1 /***************************************************************************
2 * Copyright (C) 2007 by www.databasecache.com *
3 * Contact: praba_tuty@databasecache.com *
5 * This program is free software; you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation; either version 2 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 ***************************************************************************/
18 #include<CatalogTables.h>
22 //does not check for duplicates
23 DbRetVal
FieldList::append(FieldDef fDef
)
25 FieldNode
*newNode
= new FieldNode();
26 newNode
->fldDef
= fDef
;
28 //If this is the first node, set it as head
29 if (NULL
== head
) { head
= newNode
; return OK
; }
31 FieldNode
*iter
= head
;
32 while (NULL
!= iter
->next
) iter
= iter
->next
;
38 DbRetVal
FieldList::remove(const char* fldName
)
42 printError(ErrNotExists
, "There are no elements in the list. Empty list");
45 FieldNode
*iter
= head
, *prev
= head
;
46 while (iter
->next
!= NULL
)
48 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
50 prev
->next
= iter
->next
;
56 if( iter
== head
) // there is only one node in the list
58 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
66 if( prev
== head
) // there are only two node in the list
68 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
75 printError(ErrNotFound
, "There are no elements in the list");
79 DbRetVal
FieldList::removeAll()
81 if (NULL
== head
) return OK
;
82 FieldNode
*iter
= head
, *next
= head
;
83 while (iter
->next
!= NULL
)
89 delete iter
; //deleting the last element
94 //-1->if val is passed NULL
95 //-2->if fld is not present
96 DbRetVal
FieldList::updateBindVal(const char *fldName
, void *val
)
100 printError(ErrBadArg
, "Value passed is NULL");
103 FieldNode
*iter
= head
;
106 if (strcmp(iter
->fldDef
.fldName_
, fldName
) == 0)
108 iter
->fldDef
.bindVal_
= val
;
113 printError(ErrNotFound
, "Field not present in the list");
117 DbRetVal
FieldList::getFieldInfo(const char *fldName
, FieldInfo
*&info
)
119 FieldNode
*iter
= head
;
122 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
124 strcpy(info
->fldName
, iter
->fldDef
.fldName_
);
125 info
->length
= iter
->fldDef
.length_
;
126 info
->type
= iter
->fldDef
.type_
;
127 info
->offset
= getFieldOffset(fldName
);
128 info
->isDefault
= iter
->fldDef
.isDefault_
;
129 strcpy(info
->defaultValueBuf
, iter
->fldDef
.defaultValueBuf_
);
130 info
->isNull
= iter
->fldDef
.isNull_
;
131 info
->isPrimary
= iter
->fldDef
.isPrimary_
;
140 int FieldList::getFieldOffset(const char *fldName
)
142 FieldNode
*iter
= head
;
146 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
150 offset
= offset
+ os::align(iter
->fldDef
.length_
);
155 int FieldList::getFieldOffset(int fldpos
)
157 if (fldpos
< 1) return -1;
158 FieldNode
*iter
= head
;
163 if (counter
== fldpos
-1)
167 offset
= offset
+ os::align(iter
->fldDef
.length_
);
174 //Returns position of field in the list
175 //Count starting from 1
176 //-1 if field not found in the list
177 int FieldList::getFieldPosition(const char *fldName
)
180 FieldNode
*iter
= head
;
183 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
192 int FieldList::getTupleSize()
194 FieldNode
*iter
= head
;
198 offset
= offset
+ os::align(iter
->fldDef
.length_
);
206 DataType
FieldList::getFieldType(const char *fldName
)
208 FieldNode
*iter
= head
;
212 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
214 return iter
->fldDef
.type_
;
221 //-1->if field not present in list
222 size_t FieldList::getFieldLength(const char *fldName
)
224 FieldNode
*iter
= head
;
228 if (0 == strcmp(iter
->fldDef
.fldName_
, fldName
))
230 return iter
->fldDef
.length_
;
238 //No check for duplicates
239 //TODO::User exposed so check for duplicates
240 DbRetVal
FieldNameList::append(const char *name
)
242 FieldNameNode
*newNode
= new FieldNameNode();
243 strcpy(newNode
->fldName
, name
);
244 newNode
->next
= NULL
;
245 //If this is the first node, set it as head
246 if (NULL
== head
) { head
= newNode
; return OK
; }
248 FieldNameNode
*it
= head
;
249 while (NULL
!= it
->next
) it
= it
->next
;
253 //-1 -> if there is nothing in list
254 //-2 -> if it is not present in list
255 DbRetVal
FieldNameList::remove(const char* name
)
259 printError(ErrNotExists
, "List is empty");
262 FieldNameNode
*ite
= head
, *prev
= head
;
263 while (ite
->next
!= NULL
)
265 if (0 == strcmp(ite
->fldName
, name
))
267 prev
->next
= ite
->next
;
273 if( ite
== head
) // there is only one node in the list
275 if (0 == strcmp(ite
->fldName
, name
))
283 if( prev
== head
) // there are only two node in the list
285 if (0 == strcmp(ite
->fldName
, name
))
292 printError(ErrNotFound
, "Field name %s not present in the list", name
);
296 DbRetVal
FieldNameList::removeAll()
298 if (NULL
== head
) return OK
;
299 FieldNameNode
*iter
= head
, *next
= head
;
300 while (iter
->next
!= NULL
)
306 delete iter
; //deleting the last element
311 char* FieldNameList::nextFieldName()
313 if (iter
== NULL
) return NULL
;
314 FieldNameNode
*node
= iter
;
316 return node
->fldName
;
319 int FieldNameList::size()
321 FieldNameNode
*it
= head
;
322 if (NULL
== it
) return 0;
324 while (NULL
!= it
->next
) {it
= it
->next
; count
++;}