aboutsummaryrefslogtreecommitdiff
path: root/src/interfaces/odbc/tuplelist.c
diff options
context:
space:
mode:
authorBruce Momjian <bruce@momjian.us>2001-05-08 17:06:18 +0000
committerBruce Momjian <bruce@momjian.us>2001-05-08 17:06:18 +0000
commit296e7ba2ba27847a152d77a41115e2f1db240779 (patch)
tree481398f1932cd3546b8cef8c76db4a163656c101 /src/interfaces/odbc/tuplelist.c
parent062a79a9900e7012e0eada333f209203ed433b31 (diff)
downloadpostgresql-296e7ba2ba27847a152d77a41115e2f1db240779.tar.gz
postgresql-296e7ba2ba27847a152d77a41115e2f1db240779.zip
ODBC source code cleanup patch. Should match rest of PostgreSQL code better.
Diffstat (limited to 'src/interfaces/odbc/tuplelist.c')
-rw-r--r--src/interfaces/odbc/tuplelist.c17
1 files changed, 8 insertions, 9 deletions
diff --git a/src/interfaces/odbc/tuplelist.c b/src/interfaces/odbc/tuplelist.c
index 4482f5e3862..eb924c12083 100644
--- a/src/interfaces/odbc/tuplelist.c
+++ b/src/interfaces/odbc/tuplelist.c
@@ -1,20 +1,23 @@
-/* Module: tuplelist.c
+/*--------
+ * Module: tuplelist.c
*
- * Description: This module contains functions for creating a manual result set
- * (the TupleList) and retrieving data from it for a specific row/column.
+ * Description: This module contains functions for creating a manual
+ * result set (the TupleList) and retrieving data from
+ * it for a specific row/column.
*
* Classes: TupleListClass (Functions prefix: "TL_")
*
* API functions: none
*
* Comments: See "notice.txt" for copyright and license information.
- *
+ *--------
*/
#include <stdlib.h>
#include "tuplelist.h"
#include "tuple.h"
+
TupleListClass *
TL_Constructor(UInt4 fieldcnt)
{
@@ -25,7 +28,6 @@ TL_Constructor(UInt4 fieldcnt)
rv = (TupleListClass *) malloc(sizeof(TupleListClass));
if (rv)
{
-
rv->num_fields = fieldcnt;
rv->num_tuples = 0;
rv->list_start = NULL;
@@ -39,6 +41,7 @@ TL_Constructor(UInt4 fieldcnt)
return rv;
}
+
void
TL_Destructor(TupleListClass *self)
{
@@ -134,7 +137,6 @@ TL_get_fieldval(TupleListClass *self, Int4 tupleno, Int2 fieldno)
}
else if (start_is_closer)
{
-
/*
* the shortest way is to start the search from the head of the
* list
@@ -177,11 +179,9 @@ TL_get_fieldval(TupleListClass *self, Int4 tupleno, Int2 fieldno)
}
-
char
TL_add_tuple(TupleListClass *self, TupleNode *new_field)
{
-
/*
* we append the tuple at the end of the doubly linked list of the
* tuples we have already read in
@@ -200,7 +200,6 @@ TL_add_tuple(TupleListClass *self, TupleNode *new_field)
}
else
{
-
/*
* there is already an element in the list, so add the new one at
* the end of the list