Visual C++ :: NetShareEnum - WinAPI Not Able To Remove Unnecessary Sharefolders
Apr 12, 2013
For getting the share folder name i have been used the following code , here i am able to get the folder names . But the problem what i am facing is along with the share folder created by the user it gives some extra folder also , i don't know how to prevent the programe to hide that unnecessary folder names . Like in my case i am getting "cc_views"(used for clearcase) and "Users" folders , which i want to remove from my folder lists .
I want to pass some parameters to a dialog. I am trying to pass a struct as LPARAM in CreateDialogParam. How to access this structure from ONOK for example?
I made a dialog to have a customizable msgbox. (custom icon, custom caption on buttons). This is how I try to display an icon on the dialog but it is not working.
In a typical MFC application I use SetRegistryKey(_T("My_Company")); to set the root registry entry for my application. The MFC application however creates an entry by the name of executable where it stores all the settings of that application. I don't want that because we often change the name of executable and I want it read registry from the same set location. As example if my application name is Calculator.exe and Calculator_debug.exe it creates two different registry settings.
I had some software made for me by another programmer and i think he has put some sort of protection on it, so I can't use this software on any other computer apart from the one it is installed on now, how to remove this protection so I can run it off of any PC.
Code: /* generals is the first array. Max 10 elements. numGenerals is the element count of generals.
genBuff is the second array; it is to be checked/pruned. genCount is the element count of genBuff. genBuff will be a max of 171, but be pruned to no more than 10, and no more than the complement of the element count of generals. */
[Code] ....
(I do have comments in the actual source, different from above).
I have two int arrays. They hold values from 0 to 170. The first one will never be more than 10. The second will be at most 171, but will be whittled down to at most 10, usually less. 171 is worst case, most users of this particular program will probably be reasonable and not try to add all 171 (max is 10 anyway). The first array is the original array. The second array is a temporary array. Any value in the second array that is also found in the first array, is removed from the second array, since all values in the first one must be unique. After this pruning process, both arrays will collectively contain no more than 10 unique elements; the elements from the second will be added to the first.
So right now I have three nested loops. I figured with the miniscule array sizes it wouldn't be a big deal. I can think of a way to remove one or two of them, but I want to be sure that I'm still writing clean, legible, good-practice code. The first loop walks through the first array. For each element in the first array, there is a second loop to walk through the second array to check for duplicates. If a duplicate is found, the third loop walks through the second array to overwrite the duplicate while preserving the second loop's position (j).
Is this dumb? I know that the big O gets worse and worse the deeper you go with nested loops. Even though the arrays are really tiny, is this still a thing to avoid?
The following 2 codes are almost identical, only that the switch statements are slightly different. The 2nd code has the issue of requiring an additional enter key to be pressed when I enter '3' as input to exit the program.
Working code :
Code:
#include <stdio.h> #include <ctype.h> #include <string.h> void clearKeyboardBuffer() { int ch; while ((ch = getchar() != '
I know how to remove digits in number from right to left.For example: the number 319. If I do (number /= 10), I get 31.how can I remove digits in number from left to right.For example: the number 319. If I will do something, I will get the number 19.
class List; List *deletezeroendlist(List* L); class List { public: intdigit; List*nextDigit; public: List():digit(0), nextDigit(NULL){} List(int d, List *next):digit(d), nextDigit(next){}
I have tried many different ways but it is still not the answer / perform the function List *deletezeroendlist(List* L)
Below is my .h file and the code below that is my function that I'm having troubles with. Its suppose to take in a users topic and see if that topic exists, if it does exist then find the keyword, commentcompare will find where that keyword is and delete the comment. However its not deleting anything and its returning temp is NULL.
class comment //adds a comment { public: comment(char * create_comment);
How can I remove an element in a list when I have only an iterator that points to the object I want to remove. Is there a build in command? remove() takes an object reference as its argument. Is it possible to convert the iterator into a pointer type so it can be deferenced and passed to remove?
This is the code I am working on:
//player.cpp void Player::CheckCollectableCollisions(std::list<Collectable>& c) { std::list<Collectable>::iterator i = c.begin(); while(i != c.end()) { if (Collider::CheckCollision(pNodes_.front().getLocation(), i->getLocation()))
I am trying to remove the first digit so if the user enters 12345 it should output 2345 the code i have works only for removing the last digit how would i go about removing the first one?
#include <iostream> using namespace std; int removeFirst(int n); int main(){ int n, m; cout << "enter number" << endl;
Im supose to use <>bool removeTile(char, int, int, char[])<> to do this "function that takes in the choice (D or S) and the two dice numbers and the board as input arguments. When the move is legal and the tile is available for removal, it removes the tile according to the choice by marking the tile as ‘X’. Returns true if the move is successful."
i used a tab control to open form when user clicks on button of required form.. now the problem is that if form open once it can b again open using its button... how can i stop this re open problem?
I am writing a parse system, and I want to go in and check a string for multiple Ks to be exact a K at the beginning and one at the end, if it does have a K at the end of the string I want to remove that K. I don't have an exact size of my string. I know how to remove the last K but not how to check the string for the multiple Ks.
This is what I have:
if (poNumber.Contains("K...K")) poNumber.Remove(poNumber.Length - 1,1);
I know that the first part will not work the way I want it to.
