Click here to Skip to main content
15,898,222 members
Home / Discussions / C / C++ / MFC
   

C / C++ / MFC

 
AnswerRe: print in list box Pin
_AnsHUMAN_ 9-Aug-06 18:37
_AnsHUMAN_ 9-Aug-06 18:37 
GeneralRe: print in list box Pin
With_problem9-Aug-06 19:10
With_problem9-Aug-06 19:10 
GeneralRe: print in list box Pin
_AnsHUMAN_ 9-Aug-06 19:22
_AnsHUMAN_ 9-Aug-06 19:22 
GeneralRe: print in list box Pin
With_problem9-Aug-06 20:25
With_problem9-Aug-06 20:25 
AnswerRe: print in list box [modified] Pin
Amar Sutar9-Aug-06 19:49
Amar Sutar9-Aug-06 19:49 
GeneralRe: print in list box [modified] Pin
With_problem9-Aug-06 20:26
With_problem9-Aug-06 20:26 
AnswerRe: print in list box Pin
Hamid_RT9-Aug-06 21:54
Hamid_RT9-Aug-06 21:54 
QuestionSTL headache Pin
Waldermort9-Aug-06 17:32
Waldermort9-Aug-06 17:32 
I have a list of 60 non-identical Chinese names (MBCS build). I am trying to create a routine that will count how many non-identical names there are. Simple I thought, use the STL set which is a unique list. Thing is, using those 60 Chinese names, the resulting set size is 58. It has discarded 2 names for no reason. OK, maybe a set is not up to the challenge, so I instead used the vector class. A vector of 60 names, sort() and unique() again becomes 58.

Unless anybody can point me in the right direction, I'm going to have to create something of my own.
// check for multiple students
std::vector< std::string > names(sheet->UsedRows() );
std::set< std::string > list;
short col = -1;
for (int i=0;i<sheet->UsedCols();i++) {
    if (head[i].type == NAME)
        col = head[i].column;
}
if (col == -1)
    return 0;
for (i=xRow;i<sheet->UsedRows();i++) {
    names[i] = sheet->Cell(col,i);
    list.insert( sheet->Cell(col,i) );
}
int sz = names.size();
sort(names.begin(),names.end() );
names.erase( unique(names.begin(),names.end() ),names.end() );
int foo = list.size();
int bar = names.size();

AnswerRe: STL headache Pin
Christian Graus9-Aug-06 17:38
protectorChristian Graus9-Aug-06 17:38 
AnswerRe: STL headache Pin
Zac Howland10-Aug-06 4:38
Zac Howland10-Aug-06 4:38 
QuestionQuicksort algorithm is Causing stack overflow [modified] Pin
JKallen9-Aug-06 16:43
JKallen9-Aug-06 16:43 
AnswerRe: Quicksort algorithm is Causing stack overflow Pin
PJ Arends9-Aug-06 16:53
professionalPJ Arends9-Aug-06 16:53 
GeneralRe: Quicksort algorithm is Causing stack overflow Pin
JKallen9-Aug-06 16:58
JKallen9-Aug-06 16:58 
AnswerRe: Quicksort algorithm is Causing stack overflow Pin
Christian Graus9-Aug-06 16:54
protectorChristian Graus9-Aug-06 16:54 
GeneralRe: Quicksort algorithm is Causing stack overflow Pin
JKallen9-Aug-06 17:00
JKallen9-Aug-06 17:00 
GeneralRe: Quicksort algorithm is Causing stack overflow Pin
Christian Graus9-Aug-06 17:02
protectorChristian Graus9-Aug-06 17:02 
GeneralRe: Quicksort algorithm is Causing stack overflow Pin
JKallen9-Aug-06 17:04
JKallen9-Aug-06 17:04 
GeneralRe: Quicksort algorithm is Causing stack overflow Pin
Christian Graus9-Aug-06 17:40
protectorChristian Graus9-Aug-06 17:40 
AnswerRe: Quicksort algorithm is Causing stack overflow Pin
Gerald Schwab9-Aug-06 18:07
Gerald Schwab9-Aug-06 18:07 
AnswerRe: Quicksort algorithm is Causing stack overflow Pin
David Crow10-Aug-06 4:05
David Crow10-Aug-06 4:05 
AnswerRe: Quicksort algorithm is Causing stack overflow Pin
Hamid_RT10-Aug-06 8:15
Hamid_RT10-Aug-06 8:15 
QuestionEnum local security groups in NTFS folder ACL Pin
fourierman9-Aug-06 16:32
fourierman9-Aug-06 16:32 
AnswerRe: Enum local security groups in NTFS folder ACL Pin
Milton Karimbekallil9-Aug-06 23:45
Milton Karimbekallil9-Aug-06 23:45 
QuestionComparing images.... Visual C++ (MFC) Pin
cheng859-Aug-06 16:06
cheng859-Aug-06 16:06 
AnswerRe: Comparing images.... Visual C++ (MFC) Pin
Christian Graus9-Aug-06 16:55
protectorChristian Graus9-Aug-06 16:55 

General General    News News    Suggestion Suggestion    Question Question    Bug Bug    Answer Answer    Joke Joke    Praise Praise    Rant Rant    Admin Admin   

Use Ctrl+Left/Right to switch messages, Ctrl+Up/Down to switch threads, Ctrl+Shift+Left/Right to switch pages.