projects
/
rrq
/
rrqmisc.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
further camelcase fixing
[rrq/rrqmisc.git]
/
vector
/
Relation.h
diff --git
a/vector/Relation.h
b/vector/Relation.h
index b3c2be7d90dee2c30493b5a4c210607c4553a61e..76c500210574e48fd3c1b9441074cf82d4578c88 100644
(file)
--- a/
vector/Relation.h
+++ b/
vector/Relation.h
@@
-1,5
+1,5
@@
-#ifndef
r
elation_H
-#define
r
elation_H
+#ifndef
R
elation_H
+#define
R
elation_H
#include <HashVector.h>
#include <TupleSchema.h>
#include <HashVector.h>
#include <TupleSchema.h>
@@
-43,7
+43,7
@@
typedef struct {
*
* \related Relation
*/
*
* \related Relation
*/
-extern Relation *
r
elation_create(TupleSchema *schema);
+extern Relation *
R
elation_create(TupleSchema *schema);
/**
* \brief Add a key constraint to a \ref Relation.
/**
* \brief Add a key constraint to a \ref Relation.
@@
-68,10
+68,10
@@
extern Relation *relation_create(TupleSchema *schema);
* \ref tuple "tuples" are then "knocked out" from the Relation by the
* new addition.
*
* \ref tuple "tuples" are then "knocked out" from the Relation by the
* new addition.
*
- * \see
r
elation_add
+ * \see
R
elation_add
* \related Relation
*/
* \related Relation
*/
-extern int
r
elation_add_constraint(Relation *r,...);
+extern int
R
elation_add_constraint(Relation *r,...);
/**
* \brief Add the tuple to the Relation.
/**
* \brief Add the tuple to the Relation.
@@
-91,10
+91,10
@@
extern int relation_add_constraint(Relation *r,...);
*
* \related Relation
*/
*
* \related Relation
*/
-extern Vector *
r
elation_add(Relation *r,tuple *t);
+extern Vector *
R
elation_add(Relation *r,tuple *t);
/**
/**
- * \brief Delete all tuples matching to the
q
uery \ref tuple fromt the
+ * \brief Delete all tuples matching to the
Q
uery \ref tuple fromt the
* \ref Relation.
*
* \param r is the \ref Relation concerned.
* \ref Relation.
*
* \param r is the \ref Relation concerned.
@@
-104,29
+104,29
@@
extern Vector *relation_add(Relation *r,tuple *t);
* \returns a \Vector Vector of all knocked out tuples, i.e. the
* same-key tuples, if any, contained in the Relation
*
* \returns a \Vector Vector of all knocked out tuples, i.e. the
* same-key tuples, if any, contained in the Relation
*
- * Note that deletion uses a "
q
uery" tuple, which means that some
+ * Note that deletion uses a "
Q
uery" tuple, which means that some
* columns may be null to mark that them match to any value.
*
* \related Relation
*/
* columns may be null to mark that them match to any value.
*
* \related Relation
*/
-extern Vector *
relation_delete(Relation *r,tuple *q
uery);
+extern Vector *
Relation_delete(Relation *r,tuple *Q
uery);
/**
* \brief Return the next \ref tuple in the \ref Relation that matches
/**
* \brief Return the next \ref tuple in the \ref Relation that matches
- * to the
q
uery \ref tuple, at or after the index.
+ * to the
Q
uery \ref tuple, at or after the index.
*
* \param r is the \ref Relation concerned.
*
* \param index is a pointer to the \ref Vector index to update.
*
*
* \param r is the \ref Relation concerned.
*
* \param index is a pointer to the \ref Vector index to update.
*
- * \param
query is a q
uery \tuple tuple for selection of certain
+ * \param
Query is a Q
uery \tuple tuple for selection of certain
* column values.
*
* \returns any such matching \tuple tuple and an updateed *index.
*
* \related Relation
*/
* column values.
*
* \returns any such matching \tuple tuple and an updateed *index.
*
* \related Relation
*/
-extern void *
relation_next(Relation *r,VectorIndex *index,tuple *q
uery);
+extern void *
Relation_next(Relation *r,VectorIndex *index,tuple *Q
uery);
/**
* \brief Lay out a dynamic \ref Relation initializer for a Relation
/**
* \brief Lay out a dynamic \ref Relation initializer for a Relation