forked from NicoleJAVA/Vector-Space-Model
-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort_firstDictV20.cpp
199 lines (139 loc) · 6.13 KB
/
sort_firstDictV20.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
/*
Ver. 19 - sort_firstDict.cpp
1.)
Ver. 19 >> remove debug info.
2.)
Ver. 19 >> except insertNode(), all the other operations of listnode are move
to nodeoperation.cpp
3.)
Ver 19 >>
Wrong code : strncpy( newPtr->data.c_str(), value.c_str(), SORT_LEN );
Correct code : strncpy( const_cast<char*>(newPtr->data.c_str()), value.c_str(), SORT_LEN );
*/
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <strings.h>
#include <unistd.h>
#include <ctype.h>
#include "compareTerm.cpp"
#define MAX_STR_LEN 30
#define SORT_LEN 1000
using namespace std;
/* self-referential structure */
#ifndef _IR_HPP_
#define _IR_HPP_
struct ListNode {
std::string data; /* each listNode contains a character */
struct ListNode *nextPtr; /* pointer to next node*/
}; /* end structure listNode */
#endif
//typedef struct listNode ListNode; /* synonym for struct listNode */
typedef ListNode *ListNodePtr; /* synonym for ListNode* */
/* prototypes */
void insertNode( ListNodePtr &sPtr, std::string value );
char deleteNode( ListNodePtr *sPtr, char * value );
int isEmpty( ListNodePtr sPtr );
void printList( ListNodePtr currentPtr );
void instructions( void );
/****************************************************************************/
/* Insert a new value into the list in sorted order */
void insertNode( ListNodePtr &sPtr, std::string value, int index )
{
char chbuf[ 1000 ];
strncpy( chbuf, value.c_str(), 1000 );
//printf("\n\n嗨 嗨 嗨 嗨 嗨 嗨 sPtr is %s.", chbuf );
ListNodePtr newPtr; /* pointer to new node */
ListNodePtr previousPtr; /* pointer to previous node in list */
ListNodePtr currentPtr; /* pointer to current node in list */
int termOrder = 0;
int currDataSize ;
char buf1[ SORT_LEN ];
char buf2[ SORT_LEN ];
// original code : newPtr = (ListNode *) malloc( sizeof( ListNode ) ); /* create node */
newPtr = new ListNode; /* new will return the address */
/* -> if newPtr is space available */
if ( newPtr != NULL ) { //printf("\n 若 newPtr 的記憶體是 ok 的 " );
/************************************ 開始註解 ******************/
if( sPtr == NULL ){
printf("\n第 %d 個。\n傳進來的 dictPtr 是 NULL\n ", index);
}
else{
if(index<5){printf("\n第 %d 個。\n傳進來的 dictPtr 不是 NULL ", index);} }
/******************************************************/
strncpy( const_cast<char*>(newPtr->data.c_str()), value.c_str(), SORT_LEN );
newPtr->nextPtr = NULL; /* node does not link to another node */
previousPtr = NULL;
currentPtr = sPtr;
/************************************ 開始註解 ******************/
if( currentPtr == NULL ){
printf("\n第 %d 個。\n currentPtr 是 NULL\n ", index);
}
else{
if(index<5){
printf("\n第 %d 個。\ncurrentPtr 不是 NULL。 ", index);
printf(" ---> 字串 : %s." , currentPtr->data.c_str() );
} // end if
} // end else
/******************************************************/
if( currentPtr != NULL ){
strncpy( buf1, value.c_str(), SORT_LEN );
strncpy( buf2, currentPtr->data.c_str(), SORT_LEN );
termOrder = compare_term( sPtr->data.c_str(), value.c_str() );
//printf("\n完成了字串比對. termOrder 是 %d", termOrder);
}
/******************** 開始註解 ******************/
if( currentPtr != NULL ) {
// loop to find the correct location in the list
// Ver. 14 嘗試修改 : while ( currentPtr != NULL && termOrder > 0 && previousPtr != NULL ) {
while ( currentPtr != NULL && termOrder == 0 ) {
//printf("\n從現在開始 previousPtr 才會開始不為 NULL 喔" );
previousPtr = currentPtr; //* walk to ...
currentPtr = currentPtr->nextPtr; //* ... next node
} //* end while
} //* END if */
/**************************************/
/* insert new node at beginning of list */
if ( previousPtr == NULL ) {
//printf("\nS P E C I A L C A S E : first listNode to be inserted." );
//printf("\npreviousPtr 是 NULL 所以是第一個唷" );
newPtr->nextPtr = sPtr;
/****************************************** M G I C */
sPtr = newPtr;
/****************************************** M G I C */
} /* end if */
else { /* insert new node between previousPtr and currentPtr */
previousPtr->nextPtr = newPtr;
newPtr->nextPtr = currentPtr;
} /* end else */
} /* end if */
else {
printf( "%c not inserted. No memory available.\n", value.c_str() );
} /* end else */
} /* ----- end function insertNode( ) ----- */
/***************************************************************************/
int main2( void )
{
ListNodePtr startPtr = NULL; //* initially there are no nodes */
int choice; /* user's choice */
char item[ MAX_STR_LEN ]; //* char entered by user */
/*************************************************/
printf( "End of run.\n" );
system("PAUSE");
return 0; //* indicates successful termination
} //* end main
/*****************************************************************************/
/**************************************************************************
* (C) Copyright 1992-2007 by Deitel & Associates, Inc. and *
* Pearson Education, Inc. All Rights Reserved. *
* *
* DISCLAIMER: The authors and publisher of this book have used their *
* best efforts in preparing the book. These efforts include the *
* development, research, and testing of the theories and programs *
* to determine their effectiveness. The authors and publisher make *
* no warranty of any kind, expressed or implied, with regard to these *
* programs or to the documentation contained in these books. The authors *
* and publisher shall not be liable in any event for incidental or *
* consequential damages in connection with, or arising out of, the *
* furnishing, performance, or use of these programs. *
*************************************************************************/