The class adds more functionality to ibis::query to handle data from regular meshes. More...
#include <meshQuery.h>
Public Member Functions | |
| int | getHitsAsBlocks (std::vector< std::vector< uint32_t > > ®, const bool merge=false) const |
| Translate hit vector into bounding boxes. More... | |
| int | getHitsAsBlocks (std::vector< std::vector< uint32_t > > ®, const std::vector< uint32_t > &dim, const bool merge=false) const |
| This function converts the input bitmap to a list of blocks. More... | |
| int | getHitsAsLines (std::vector< uint32_t > &lines) const |
| int | getHitsAsLines (std::vector< uint32_t > &lines, const std::vector< uint32_t > &dim) const |
| Convert the hit vector into a list of line segments. More... | |
| int | getPointsOnBoundary (std::vector< std::vector< uint32_t > > &bdy, const std::vector< uint32_t > &dim) const |
| Determine points with neighbors that are not hits. More... | |
| int | getPointsOnBoundary (std::vector< std::vector< uint32_t > > &bdy) const |
| Determine points with neighbors that are not hits. More... | |
| meshQuery (const char *uid, const part *et, const char *pref=0) | |
| Constructor for building a new query. | |
| meshQuery (const char *dir, const ibis::partList &tl) | |
| Constructor for recoverying from crash. | |
 Public Member Functions inherited from ibis::query | |
| int | addConditions (const ibis::qExpr *qexp) |
| Add a set of conditions to the existing where clause. More... | |
| int | addConditions (const char *) |
| Add a set of conditions to the existing where clause. More... | |
| void | clear () |
| Releases the resources held by the query object. More... | |
| void | clearErrorMessage () const |
| Reset the last error message to blank. | |
| const selectClause & | components () const |
| Return a list of names specified in the select clause. | |
| void | contractQuery () |
| Contracts where clause to preferred bounds. More... | |
| long | countHits () const |
| Count the number of hits. More... | |
| const char * | dir () const |
| Return the directory for any persistent data. More... | |
| int | estimate () |
| Function to perform estimation. More... | |
| int | evaluate (const bool evalSelect=false) |
| Computes the exact hits. More... | |
| void | expandQuery () |
| Expands where clause to preferred bounds. More... | |
| long | getCandidateRows (std::vector< uint32_t > &) const |
| Extract the positions of candidates. More... | |
| const ibis::bitvector * | getCandidateVector () const |
| Return a pointer to the bit vector representing the candidates. | |
| long | getExpandedHits (ibis::bitvector &) const |
| Get a bitvector containing all rows satisfying the query condition. More... | |
| long | getHitRows (std::vector< uint32_t > &rids) const |
| Extract the positions of the bits that are 1s in the solution. More... | |
| const ibis::bitvector * | getHitVector () const |
| Return the pointer to the internal hit vector. More... | |
| const char * | getLastError () const |
| Return the last error message recorded internally. | |
| long | getMaxNumHits () const |
| Return the number of records in the upper bound. | |
| long | getMinNumHits () const |
| Return the number of records in the lower bound. | |
| long | getNumHits () const |
| Compute the number of records in the exact solution. More... | |
| virtual const char * | getSelectClause () const |
| Return the select clause string. | |
| QUERY_STATE | getState () const |
| Return the current state of query. | |
| const RIDSet * | getUserRIDs () const |
| Return a const pointer to the copy of the user supplied RID set. | |
| virtual const char * | getWhereClause () const |
| Return the where clause string. | |
| const char * | id () const |
| Return an identifier of the query. | |
| long | limit (const char *names, uint32_t keep, bool updateHits=true) |
| Truncate the results to provide the top-K rows. More... | |
| void | logMessage (const char *event, const char *fmt,...) const |
| Used to print information about the progress or state of query processing. More... | |
| int | orderby (const char *names) const |
| Re-order the results according to the new "ORDER BY" specification. More... | |
| const part * | partition () const |
| Return the pointer to the data partition used to process the query. | |
| void | printSelected (std::ostream &out) const |
| Print the values of the selected columns to the specified output stream. More... | |
| void | printSelectedWithRID (std::ostream &out) const |
| Print the values of the columns in the select clause without functions. More... | |
| query (const char *dir, const ibis::partList &tl) | |
| Constructor. More... | |
| query (const char *uid=0, const part *et=0, const char *pref=0) | |
| Constructor. More... | |
| RIDSet * | readRIDs () const |
| Read RIDs from the file named "-rids". More... | |
| std::string | removeComplexConditions () |
| Separate out the sub-expressions that are not simple. More... | |
| long | sequentialScan (ibis::bitvector &bv) const |
| Perform a simple sequential scan. More... | |
| int | setPartition (const ibis::part *tbl) |
| Resets the data partition associated with the query. More... | |
| int | setRIDs (const RIDSet &set) |
| Specify a list of Row IDs for the query object. More... | |
| virtual int | setSelectClause (const char *str) |
| Specifies the select clause for the query. More... | |
| int | setTable (const ibis::part *tbl) |
| This is deprecated, will be removed soon. | |
| int | setWhereClause (const char *str) |
| Specify the where clause in the string form. More... | |
| int | setWhereClause (const std::vector< const char * > &names, const std::vector< double > &lbounds, const std::vector< double > &rbounds) |
| Specify the where clause as a set of conjunctive ranges. More... | |
| int | setWhereClause (const ibis::qExpr *qexp) |
| Specify the where clause through a qExpr object. More... | |
| time_t | timestamp () const |
| The time stamp on the data used to process the query. | |
| const char * | userName () const |
| User started the query. | |
| void | writeRIDs (const RIDSet *rids) const |
| Write the list of RIDs to a file named "-rids". | |
| virtual | ~query () |
| Desctructor. | |
| array_t< signed char > * | getQualifiedBytes (const char *column_name) |
The functions getQualifiedTTT return the values of selected columns in the records that satisfies the specified conditions. More... | |
| array_t< unsigned char > * | getQualifiedUBytes (const char *column_name) |
| Retrieve the values of column_name as 8-bit unsigned integers. More... | |
| array_t< int16_t > * | getQualifiedShorts (const char *column_name) |
| Retrieve the values of column_name as 16-bit integers. More... | |
| array_t< uint16_t > * | getQualifiedUShorts (const char *column_name) |
| Retrieve the values of column_name as 16-bit unsigned integers. More... | |
| array_t< int32_t > * | getQualifiedInts (const char *column_name) |
| Retrieve integer values from records satisfying the query conditions. More... | |
| array_t< uint32_t > * | getQualifiedUInts (const char *column_name) |
| Retrieve unsigned integer values from records satisfying the query conditions. More... | |
| array_t< int64_t > * | getQualifiedLongs (const char *column_name) |
| Retrieve values of column_name as 64-bit integers. More... | |
| array_t< uint64_t > * | getQualifiedULongs (const char *column_name) |
| Retrieve values of column_name as 64-bit unsigned integers. More... | |
| array_t< float > * | getQualifiedFloats (const char *column_name) |
| Retrieve floating-point values from records satisfying the query conditions. More... | |
| array_t< double > * | getQualifiedDoubles (const char *column_name) |
| Retrieve double precision floating-point values from records satisfying the query conditions. More... | |
| std::vector< std::string > * | getQualifiedStrings (const char *column_name) |
| Retrieve string values from records satisfying the query conditions. More... | |
| RIDSet * | getRIDs () const |
| Return the list of row IDs of the hits. More... | |
| RIDSet * | getRIDs (const ibis::bitvector &mask) const |
| Return a list of row IDs that match the mask. More... | |
| const RIDSet * | getRIDsInBundle (const uint32_t bid) const |
| Return the list of row IDs of the hits within the specified bundle. | |
| template<> | |
| int64_t | countEqualPairs (const array_t< int32_t > &val1, const array_t< uint32_t > &val2) const |
| template<> | |
| int64_t | countEqualPairs (const array_t< uint32_t > &val1, const array_t< int32_t > &val2) const |
| template<> | |
| int64_t | countDeltaPairs (const array_t< uint32_t > &val1, const array_t< int32_t > &val2, const uint32_t &delta) const |
| template<> | |
| int64_t | countDeltaPairs (const array_t< int32_t > &val1, const array_t< uint32_t > &val2, const int32_t &delta) const |
| template<> | |
| int64_t | recordEqualPairs (const array_t< uint32_t > &val1, const array_t< int32_t > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const char *filename) const |
| template<> | |
| int64_t | recordEqualPairs (const array_t< int32_t > &val1, const array_t< uint32_t > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const char *filename) const |
| template<> | |
| int64_t | recordDeltaPairs (const array_t< uint32_t > &val1, const array_t< int32_t > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const uint32_t &delta, const char *filename) const |
| template<> | |
| int64_t | recordDeltaPairs (const array_t< int32_t > &val1, const array_t< uint32_t > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const int32_t &delta, const char *filename) const |
Static Public Member Functions | |
| static int | bitvectorToCoordinates (const ibis::bitvector &bv, const std::vector< uint32_t > &dim, std::vector< uint32_t > &coords) |
| Convert positions in a bit vector to mesh coordinates. More... | |
| static int | labelBlocks (const std::vector< std::vector< uint32_t > > &blocks, std::vector< uint32_t > &labels) |
| Assign a unique labels to each connected set of blocks. More... | |
| static int | labelLines (uint32_t nd, const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
| Assign each connected component a unique label. More... | |
| Static Public Member Functions inherited from ibis::query | |
| static bool | isValidToken (const char *tok) |
| Is the given string a valid query token. More... | |
| static void | keepQueryRecords () |
| Tell the destructor to leave stored information on disk. | |
| static void | removeQueryRecords () |
| Tell the destructor to remove all stored information about queries. | |
| static unsigned | tokenLength () |
| Length of the query token. | |
Protected Member Functions | |
| void | block2d (uint32_t last, const std::vector< uint32_t > &dim, std::vector< uint32_t > &block, std::vector< std::vector< uint32_t > > ®) const |
| Deal with one (single) 2D block. More... | |
| void | block3d (uint32_t last, const uint32_t n2, const uint32_t n3, const std::vector< uint32_t > &dim, std::vector< uint32_t > &block, std::vector< std::vector< uint32_t > > ®) const |
| Deal with one (single) 3D block. | |
| void | blocknd (uint32_t last, const std::vector< uint32_t > &scl, const std::vector< uint32_t > &dim, std::vector< uint32_t > &block, std::vector< std::vector< uint32_t > > ®) const |
| Deal with one (single) N-Dimensional block. | |
| void | boundary2d (const std::vector< uint32_t > &dim, const std::vector< std::vector< uint32_t > > &rang, std::vector< std::vector< uint32_t > > &bdy) const |
| void | boundary2d1 (const std::vector< uint32_t > &dim, const std::vector< std::vector< uint32_t > > &rang, std::vector< std::vector< uint32_t > > &bdy) const |
| void | boundary3d (const std::vector< uint32_t > &dim, const std::vector< std::vector< uint32_t > > &rang, std::vector< std::vector< uint32_t > > &bdy) const |
| void | boundarynd (const std::vector< uint32_t > &dim, const std::vector< std::vector< uint32_t > > &rang, std::vector< std::vector< uint32_t > > &bdy) const |
| int | findPointsOnBoundary (const ibis::bitvector &bv, const std::vector< uint32_t > &dim, std::vector< std::vector< uint32_t > > &bdy) const |
| int | linesIn1D (std::vector< uint32_t > &lines) const |
| Convert the hits into line segements on a 1-D mesh. | |
| int | linesIn2D (std::vector< uint32_t > &lines, const std::vector< uint32_t > &dim) const |
| Convert the hits into line segments on a 2-D mesh. | |
| int | linesIn3D (std::vector< uint32_t > &lines, const std::vector< uint32_t > &dim) const |
| Convert hits into line segments in 3-D. | |
| int | linesIn4D (std::vector< uint32_t > &lines, const std::vector< uint32_t > &dim) const |
| Convert hits into line segments in 4-D. | |
| int | linesInND (std::vector< uint32_t > &lines, const std::vector< uint32_t > &dim) const |
| Convert hits into line segments in a regular mesh of any dimension. | |
| void | merge2DBlocks (std::vector< std::vector< uint32_t > > ®) const |
| Merge 2D blocks. More... | |
| void | merge3DBlocks (std::vector< std::vector< uint32_t > > ®) const |
| Merge 3D blocks. | |
| void | mergeNDBlocks (std::vector< std::vector< uint32_t > > ®) const |
| Merge n-D blocks. | |
| int | toBlocks1 (const ibis::bitvector &bv, std::vector< std::vector< uint32_t > > ®) const |
| Convert a bitvector into 1-D blocks. | |
| int | toBlocks2 (const ibis::bitvector &bv, const std::vector< uint32_t > &dim, std::vector< std::vector< uint32_t > > ®) const |
| Convert a bitvector to a list of 2-D blocks. | |
| int | toBlocks3 (const ibis::bitvector &bv, const std::vector< uint32_t > &dim, std::vector< std::vector< uint32_t > > ®) const |
| Convert a bitvector to a list of 3-D blocks. | |
| int | toBlocksN (const ibis::bitvector &bv, const std::vector< uint32_t > &dim, std::vector< std::vector< uint32_t > > ®) const |
| Convert a bitvector to a list of n-D blocks. | |
| Protected Member Functions inherited from ibis::query | |
| int | computeHits () |
| Generate the hit vector. More... | |
| template<typename T1 , typename T2 > | |
| int64_t | countDeltaPairs (const array_t< T1 > &val1, const array_t< T2 > &val2, const T1 &delta) const |
| Assume the two input arrays are sorted in ascending order, count the number of elements that are with delta of each other. More... | |
| template<typename T1 , typename T2 > | |
| int64_t | countEqualPairs (const array_t< T1 > &val1, const array_t< T2 > &val2) const |
| Assume the two input arrays are sorted in ascending order, count the number of elements that match. More... | |
| uint32_t | countPages (unsigned wordsize) const |
| Count the number of pages accessed to retrieve every value in the hit vector. More... | |
| int | doContract (ibis::qExpr *exp0) const |
| Contract range conditions to remove the need of candidate check. | |
| void | doEstimate (const qExpr *term, ibis::bitvector &low, ibis::bitvector &high) const |
| Use index only to come up with a upper bound and a lower bound. More... | |
| int | doEvaluate (const qExpr *term, ibis::bitvector &hits) const |
| Evaluate the query expression. More... | |
| int | doEvaluate (const qExpr *term, const ibis::bitvector &mask, ibis::bitvector &hits) const |
| Evaluate the query expression with mask. More... | |
| int | doExpand (ibis::qExpr *exp0) const |
| Expand range conditions to remove the need of candidate check. | |
| int | doScan (const qExpr *term, const ibis::bitvector &mask, ibis::bitvector &hits) const |
| Masked sequential scan. More... | |
| int | doScan (const qExpr *term, ibis::bitvector &hits) const |
| Perform a sequential scan. More... | |
| void | gainReadAccess (const char *mesg) const |
| void | gainWriteAccess (const char *mesg) const |
| void | getBounds () |
| Compute the upper and lower bounds for range queries. | |
| bool | hasBundles () const |
| void | logError (const char *event, const char *fmt,...) const |
| !< The warning/error message | |
| void | logWarning (const char *event, const char *fmt,...) const |
| int64_t | mergePairs (const char *pairfile) const |
| void | orderPairs (const char *pairfile) const |
| Sort the content of the file as ibis::rid_t. More... | |
| void | printRIDs (const RIDSet &ridset) const |
| Export the Row IDs of the hits to log file. More... | |
| int64_t | processJoin () |
| Process the join operation and return the number of pairs. More... | |
| void | readHits () |
| Read the results of the query. | |
| void | readQuery (const ibis::partList &tl) |
| Read the status information from disk. More... | |
| template<typename T1 , typename T2 > | |
| int64_t | recordDeltaPairs (const array_t< T1 > &val1, const array_t< T2 > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const T1 &delta, const char *pairfile) const |
| template<typename T1 , typename T2 > | |
| int64_t | recordEqualPairs (const array_t< T1 > &val1, const array_t< T2 > &val2, const array_t< uint32_t > &ind1, const array_t< uint32_t > &ind2, const char *pairfile) const |
| void | releaseAccess (const char *mesg) const |
| void | removeFiles () |
| Remove the files written by this object. | |
| void | reorderExpr () |
| int64_t | sortEquiJoin (const ibis::deprecatedJoin &cmp, const ibis::bitvector &mask) const |
| Performing an equi-join by sorting the selected values first. More... | |
| int64_t | sortEquiJoin (const ibis::deprecatedJoin &cmp, const ibis::bitvector &mask, const char *pairfile) const |
| Perform equi-join by sorting the selected values. More... | |
| int64_t | sortJoin (const std::vector< const ibis::deprecatedJoin * > &terms, const ibis::bitvector &mask) const |
| int64_t | sortJoin (const ibis::deprecatedJoin &cmp, const ibis::bitvector &mask) const |
| int64_t | sortRangeJoin (const ibis::deprecatedJoin &cmp, const ibis::bitvector &mask) const |
| Performing a range join by sorting the selected values. More... | |
| int64_t | sortRangeJoin (const ibis::deprecatedJoin &cmp, const ibis::bitvector &mask, const char *pairfile) const |
| Performing range join by sorting the selected values. | |
| void | storeErrorMesg (const char *) const |
| Store the message into member variable lastError for later use. More... | |
| void | writeHits () const |
| Write the results of the query. | |
| virtual void | writeQuery () |
| Write the basic information about the query to disk. More... | |
Static Protected Member Functions | |
| static uint32_t | afind (ibis::array_t< uint32_t > &rep, uint32_t s) |
| The array-based find operation. More... | |
| static uint32_t | aflatten (ibis::array_t< uint32_t > &rep) |
| Flatten the array-based union-find data strucutre. More... | |
| static void | aset (ibis::array_t< uint32_t > &rep, uint32_t s, uint32_t r) |
| Reset all nodes from s to the root to directly point to node r. More... | |
| static int | label1DBlocks (const std::vector< std::vector< uint32_t > > &blocks, std::vector< uint32_t > &labels) |
| Assign labels to blocks on a 1D mesh. More... | |
| static int | label2DBlocks (const std::vector< std::vector< uint32_t > > &blocks, std::vector< uint32_t > &labels) |
| Assign labels to blocks on 2D regular mesh. More... | |
| static int | label3DBlocks (const std::vector< std::vector< uint32_t > > &blocks, std::vector< uint32_t > &labels) |
| Assign a unique labels to each connected set of blocks. More... | |
| static int | label4DBlocks (const std::vector< std::vector< uint32_t > > &blocks, std::vector< uint32_t > &labels) |
| Assign a unique labels to each connected set of blocks. More... | |
| static int | labelLines1 (const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
| Label line segements on a 1D mesh. | |
| static int | labelLines2 (const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
| static int | labelLines3 (const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
| static int | labelLines4 (const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
| static int | labelLinesN (uint32_t nd, const std::vector< uint32_t > &lines, std::vector< uint32_t > &labels) |
Additional Inherited Members | |
| Public Types inherited from ibis::query | |
| enum | QUERY_STATE { UNINITIALIZED, SET_COMPONENTS, SET_RIDS, SET_PREDICATE, SPECIFIED, QUICK_ESTIMATE, FULL_EVALUATE, BUNDLES_TRUNCATED, HITS_TRUNCATED } |
| Protected Attributes inherited from ibis::query | |
| selectClause | comps |
| !< Query conditions | |
| whereClause | conds |
| !< Name of the user who specified the query | |
| ibis::part::readLock * | dslock |
| !< Estimated upper bound | |
| ibis::bitvector * | hits |
| !< Status of the query | |
| char | lastError [MAX_LINE+PATH_MAX] |
| !< A read lock on the mypart | |
| QUERY_STATE | state |
| !< Select clause | |
| ibis::bitvector * | sup |
| !< Solution in bitvector form (or lower bound) | |
| char * | user |
Detailed Description
The class adds more functionality to ibis::query to handle data from regular meshes.
The new functions treats cells of meshes as connected regions in space.
Member Function Documentation
|
staticprotected |
The array-based find operation.
This is the find operation of the implicit union-find data structur that uses the array rep to represent the union-find data structure. Starting a node s, it returns the root of the union-find tree containing s.
- Note
- The incoming value of s is used as the position in array rep. If the value of s is too large to be a valid position in rep, its value is immediately returned, which is equivalent to indicating the node is the root of a tree.
- The path from s to the root is compressed in this function, i.e., all nodes from s to the root will point directly to the root at the conclusion of this function.
References ibis::array_t< T >::size().
|
staticprotected |
Flatten the array-based union-find data strucutre.
It also compress all labels to be consecutive integers starting from 0. It returns the number of unique labels used.
References ibis::array_t< T >::size().
|
staticprotected |
Reset all nodes from s to the root to directly point to node r.
This is the path-compression operation of the implicit union-find data structure.
In the implicit union-find data structure, the values s1 and s2 are used as positions in array rep. If the array is too small, this function extends rep so that the newly created trees all have only a single node each.
- Note
- The union and find operations are to be implemented with a combination of afind and aset. For example, the find operation with path-compress can be implemented with a call to afind followed by a call to aset; the union operation can be implemented with two calls to afind followed by two calls to aset.
References ibis::array_t< T >::size().
|
static |
Convert positions in a bit vector to mesh coordinates.
It converts the positions of bits that are 1 to coordinates in a regular mesh with deminsions given in dim. The C-sytle array ordering is assumed.
References ibis::bitvector::cnt(), ibis::bitvector::indexSet::nIndices(), and ibis::bitvector::size().
|
protected |
Deal with one (single) 2D block.
The last block generated is not recorded, other blocks generated here are recorded in reg.
| int ibis::meshQuery::getHitsAsBlocks | ( | std::vector< std::vector< uint32_t > > & | reg, |
| const bool | merge = false |
||
| ) | const |
Translate hit vector into bounding boxes.
This variant of getHitsAsBlocks uses the dimensions defined by ibis::table::getMeshShape().
- See also
- ibis::meshQuery::getHitsAsBlocks
- ibis::table::getMeshShape
References ibis::horometer::realTime(), ibis::horometer::resume(), ibis::horometer::start(), and ibis::horometer::stop().
| int ibis::meshQuery::getHitsAsBlocks | ( | std::vector< std::vector< uint32_t > > & | reg, |
| const std::vector< uint32_t > & | dim, | ||
| const bool | merge = false |
||
| ) | const |
This function converts the input bitmap to a list of blocks.
The bitmap is assumed to be a mapping of a regular mesh with dimensions specified in variable dim. A row-major ordering (the C style multiple dimensional arrays, NOT the Fortran style) is assumed, that is the slowest varying dimension is dim[0].
- Parameters
-
reg The return value that contains the list of blocks as hypercubes. Following the convention of typical C/C++ indexing scheme, the lower bounds of the blocks are inclusive and the upper bounds of the blocks are exclusive. For example, a 2D block [2, 3, 5, 10] covers points with coordinates [2, 5], [2, 6], [2, 7], [2, 8] and [2, 9]. This is an example of a line segment with five points. In short, the lower and upper bounds of each dimension is specified together, where the lower bound is inclusive but the upper bound is exclusive. This function may generate hypercubes of any shape or size. dim The size of the mesh. The value dim.size() is the number of dimensions. Input argument, not modified. merge An optional argument. If true, will attempt to merge line segments generated to form larger hypercubes. Default to false because it make take a significant amount of time to merge the blocks.
This function returns an integer value with the following definition.
- 0 – conversion succeeded (no warning)
- -1 – the bitvector length does not match the product of values in
dim - -2 – product of values in
dimoverflows an unsigned integer - -3 – no hit vector to work with
- -4 – array
dimis empty
- Note
- It can only be called after the functions
estimateorevaluatehave been called. The blocks computed after callingestimatemay be smaller than that computed after callingevaluatebecaueestimatemay not generate the exact answer to the query.
References ibis::horometer::realTime(), ibis::horometer::resume(), ibis::horometer::start(), and ibis::horometer::stop().
| int ibis::meshQuery::getHitsAsLines | ( | std::vector< uint32_t > & | lines, |
| const std::vector< uint32_t > & | dim | ||
| ) | const |
Convert the hit vector into a list of line segments.
The underlying data is assumed to be defined a simple regular mesh. The shape of the mesh is defined by the argument dim, where dim[0] is the slowest varying dimension. A line segment here is a group of nodes sharing the same coordinates in all dimensions expected the fastest varying one and having consecutive coordiantes in the fastest varying dimension. Each line segement is represented by (dim.size()+1) consecutive values in the array lines. The first (dim.size()-1) values are the shared coordinates in the first (dim.size()-1) dimensions, element dim.size() is the coordinate of the first node in dimension dim.size() and the last element is the coordinate of the point just beyond the last node in the line segement. For example, on a 2D mesh, the line segment (11, 2, 5) contains three nodes with the coordinates (11, 2), (11, 3) and (11, 4). On a 3D mesh, the line segment (4, 8, 1, 3) contains two points with coordinates (4, 8, 1) and (4, 8, 2).
References ibis::horometer::realTime(), ibis::horometer::start(), and ibis::horometer::stop().
| int ibis::meshQuery::getPointsOnBoundary | ( | std::vector< std::vector< uint32_t > > & | bdy, |
| const std::vector< uint32_t > & | dim | ||
| ) | const |
Determine points with neighbors that are not hits.
Assume the records are a linearization of points on a simple regular mesh, the function getPointsOnBoundary computes all points that satisfy the conditions specified by function setWhereClause but have at least one neighboring mesh point that does not satisfy the conditions.
- Parameters
-
bdy The return value that contains the list of points. dim The size of the mesh. The value dim.size() is the number of dimensions. Each element of bdy is a std::vector with the same size as dim.
- See also
- ibis::meshQuery::getHitsAsBlocks
- Note
- The inner array has the same number of elements as argument
dimand the dimensions are ordered the same way as indimas well. All functions in this class assumes that the mesh points are linearized using a raster scan order wheredim[0] varies the slowest.
References ibis::horometer::realTime(), ibis::horometer::resume(), ibis::horometer::start(), and ibis::horometer::stop().
| int ibis::meshQuery::getPointsOnBoundary | ( | std::vector< std::vector< uint32_t > > & | bdy | ) | const |
Determine points with neighbors that are not hits.
The variant of getPointsOnBoundary use dimensions returned by ibis::table::getMeshShape().
- See also
- ibis::meshQuery::getPointsOnBoundary
- ibis::table::getMeshShape
References ibis::horometer::realTime(), ibis::horometer::resume(), ibis::horometer::start(), and ibis::horometer::stop().
|
staticprotected |
Assign labels to blocks on a 1D mesh.
A node on this 1D mesh is assumed to connected to its two immediate neighbors. Furthermore, it assumes that the blocks are sorted and do not overlap. The only error condition checked by this function is that the first block must have at least two numbers. If this this not true, it returns -1. There are two other error conditions that are not check: failure to allocate enough space for the array labels and memory access error cuased by some blocks having less than 2 values.
|
staticprotected |
Assign labels to blocks on 2D regular mesh.
A node on this mesh is assumed to connect to its four nearest neighbors. The blocks are assumed to be in ascending order. Furthermore, the blocks are constructed in such way that if two blocks are connected along the second (the faster varying) dimension, they would be absorbed into a single block. This simplifies the processing of blocks in this function.
- Returns
- This function returns the number of connected components identified if it runs to completion. Otherwise, it returns a negative number to indicate error.
References ibis::array_t< T >::push_back(), and ibis::array_t< T >::size().
|
staticprotected |
Assign a unique labels to each connected set of blocks.
It assumes the incoming blocks are defined on a simple regular 3D mesh, presumably outputted from ibis::meshQuery::getHitsAsBlocks. This function checks that first block has at least 6 numbers. Failure to pass this minimal test will cause this function to return a negative code. If some of the blocks does not have 6 numbers it may cause memory access errors that are not checked by this function. It further assumes that the blocks are organized in ascending order. If it detects any block out of order, it will return with an error code (-2).
This function assumes the nearest neighbors along each of the three dimensions are connected. This is the minimum connectivity.
- Returns
- Upon successful completion of this function, it returns the number of connected components identified. It returns a negative value to indicate errors.
References ibis::array_t< T >::push_back(), and ibis::array_t< T >::size().
|
staticprotected |
Assign a unique labels to each connected set of blocks.
It assumes the incoming blocks are defined on a simple regular mesh, presumably outputted from ibis::meshQuery::getHitsAsBlocks. This function works with a mesh with four dimensions only. The bounding box produced are expected to be produced from ibis::meshQuery::getHitsAsBlocks, where each box uses two numbers (an inclusive lower bound and an exclusive upper bound) for each dimension. However, this function only check the number of values of the first bounding box; it does not check the sizes of remaining blocks. It is happy to proceed if the first bounding box has at least eight values, otherwise an error code is returned. It further assumes that the blocks are organized in ascending order. If it detects any block out of order, it will return with an error code (-2).
This function assumes the nearest neighbors along each of the three dimensions are connected. This is the minimum connectivity.
- Returns
- Upon successful completion of this function, it returns the number of connected components identified. It returns a negative value to indicate errors.
References ibis::array_t< T >::push_back(), and ibis::array_t< T >::size().
|
static |
Assign a unique labels to each connected set of blocks.
It assumes the incoming blocks are defined on a simple regular mesh, presumably outputted from ibis::meshQuery::getHitsAsBlocks. This function works with a mesh with an arbitrary number of dimensions. The bounding box produced are expected to be produced from ibis::meshQuery::getHitsAsBlocks, where each box uses two numbers (an inclusive lower bound and an exclusive upper bound) for each dimension. However, this function determines the number of dimensions based on the size of the first bounding box; it does not check the sizes of remaining blocks. It further assumes that the blocks are organized in ascending order. If it detects any block out of order, it will return with an error code (-2).
This function assumes the nearest neighbors along each of the three dimensions are connected. This is the minimum connectivity.
- Returns
- Upon successful completion of this function, it returns the number of connected components identified. It returns a negative value to indicate errors. There are two likely exceptional conditions not monitored by this function: failure to allocate enough space for array labels and memory access failure due to some blocks actually having less than expected number of elements.
References ibis::array_t< T >::push_back(), and ibis::array_t< T >::size().
|
static |
Assign each connected component a unique label.
This version works with query lines. It assumes the underlying mesh is a simple nd-dimensional mesh with nearest neighbors on each dimension connected to each other.
The input lines are assumed to be produced by ibis::meshQuery::getHitsAsLines. In particular, it assumes the query lines are in ascending order of their start coordinates. Any violation of this ordering will treated as an input error.
It returns the number of connected components identified upon successful completion. Otherwise, it returns a negative number to indicate error.
|
protected |
Merge 2D blocks.
Blocks with one dimension that has connecting coordinates and the same coordinates on all other dimensions can be merged.
Assumptions/requirements: (1) the incoming reg is assumed to be sorted. (2) no dimension reaches the maximum value of UINT_MAX, which is used to denote a invalid block to be removed.
The documentation for this class was generated from the following files:
- meshQuery.h
- meshQuery.cpp
