Home | History | Annotate | Download | only in include

Lines Matching defs:vector

203     pANTLR3_VECTOR  vector;
218 /* Structure that represents a vector element
228 /* Structure that represents a vector collection. A vector is a simple list
237 /** Array of pointers to vector elements
245 /** Many times, a vector holds just a few nodes in an AST and it
255 * case only the factory can free the memory for the actual vector,
256 * though the vector free function is called and will recurse through its
265 void (ANTLR3_CDECL *free) (struct ANTLR3_VECTOR_struct * vector);
266 void (*del) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry);
267 void * (*get) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry);
268 void * (*remove) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry);
269 void (*clear) (struct ANTLR3_VECTOR_struct * vector);
271 ANTLR3_UINT32 (*add) (struct ANTLR3_VECTOR_struct * vector, void * element, void (ANTLR3_CDECL *freeptr)(void *));
272 ANTLR3_UINT32 (*set) (struct ANTLR3_VECTOR_struct * vector, ANTLR3_UINT32 entry, void * element, void (ANTLR3_CDECL *freeptr)(void *), ANTLR3_BOOLEAN freeExisting);
273 ANTLR3_UINT32 (*size) (struct ANTLR3_VECTOR_struct * vector);
277 /** Default vector pool size if otherwise unspecified
281 /** Structure that tracks vectors in a vector and auto deletes the vectors
282 * in the vector factory when closed.
287 /** List of all vector pools allocated so far
291 /** Count of the vector pools allocated so far (current active pool)
295 /** The next vector available in the pool
299 /** Trick to quickly initialize a new vector via memcpy and not a function call
303 /** Consumers from the factory can release a factory produced vector
311 /** Function to close the vector factory
315 /** Function to supply a new vector
319 /// Function to return a vector to the factory for reuse
321 void (*returnVector) (struct ANTLR3_VECTOR_FACTORY_struct * factory, pANTLR3_VECTOR vector);
397 * the vector entries in place, as well as a sort method that just returns an
409 * A vector of vectors of edges, built by calling the addEdge method()
410 * to indicate that node number n depends on node number m. Each entry in the vector
417 * A vector used to build up the sorted output order. Note that
418 * as the vector contains UINT32 then the maximum node index is
424 * A vector used to detect cycles in the edge dependecies. It is used