void List<T>::deleteN(T x)
{
Node<T> *PreNode = nullptr;
Node<T> *Pel = nullptr;
PreNode = findN(x);
if (PreNode == nullptr)
{
cout << "Error your list is empty or there is no element with value" << x << endl;
}
else if (PreNode->getPtr() == nullptr)
{
header.setNumEl(header.getNumel() - 1);
header.setLast(nullptr);
header.setPtr(nullptr);
delete PreNode;
}
else{
Pel = PreNode->getPtr();
if (Pel->getPtr() == nullptr)
header.setLast(PreNode);
PreNode->setPtr(Pel->getPtr());
delete Pel;
header.setNumEl(header.getNumel() - 1);
PreNode = nullptr;
Pel = nullptr;
}
}
void List<T>::addN(T y, T x)// y val of the previous element, x input value
{
Node<T> *Ptr = nullptr;
Node<T> *newNode = nullptr;
//allocating memory
newNode = new Node<T>;
// first element value and it's pointer
newNode->setval(x);
newNode->setPtr(nullptr);
Ptr = findN(x);
if (Ptr != nullptr)
{
if (Ptr->getPtrt() != nullptr)
{
Ptr = Ptr->getPtr();
newNode->setPtr(Ptr->getPtr());
Ptr->setPtr(newNode);
header.setNumEl(header.getNumel() + 1);
}
else
{
Ptr->setPtr(newNode);
header.setLast(newNode);
header.setNumEl(header.getNumel() + 1);
}
}
else
{
header.setPtr(newNode);
header.setLast(newNode);
header.setNumel(header.getNumel() + 1);
}
}
int _tmain(int argc, _TCHAR* argv[])
{
int a[30];
printf("enter array elements\n");
for(int i=0;i<10;i++)
scanf("%d",&a[i]);
int n=findN(a);
printf("\nn value:%d",n);
getch();
return 0;
}
CraftingTreeRoot::CraftingTreeRoot(qint32 outputItemID)
: CraftingTreeVertex(outputItemID, customConstructFunc)
{
Gw2ListingsManager::load();
setCount(findN());
}
int main() {
unsigned int a[] = {1,2,5,6,2,0,0,0};
printf("N = %d",findN(a));
}
int main(){
unsigned int a[8] = {1,2,3,9,6,0,0,0};
printf("\n%d",findN(a));
}
BSONObj DBClientInterface::findOne(const string &ns, const Query& query, const BSONObj *fieldsToReturn, int queryOptions) {
vector<BSONObj> v;
findN(v, ns, query, 1, 0, fieldsToReturn, queryOptions);
return v.empty() ? BSONObj() : v[0];
}
