| /dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/contourtree/ |
| H A D | SubrangeOffset.h | 74 WholeArrayIn sortVector, // (input) sorted vector of vertices
85 const InFieldPortalType& sortVector, in operator()
88 if (sortVector.Get(sortID) != sortVector.Get(sortID - 1)) in operator()
89 candidate.Set(sortVector.Get(sortID), sortID); in operator()
|
| H A D | RegularToCandidate.h | 77 FieldOut sortVector); // (output) target for write back
90 vtkm::Id sortVector; in operator() local
98 sortVector = NO_VERTEX_ASSIGNED; in operator()
101 sortVector = regularToCritical.Get(joinNeighbour); in operator()
102 return sortVector; in operator()
|
| H A D | RegularToCriticalDown.h | 77 FieldOut sortVector); // (output)
90 vtkm::Id sortVector; in operator() local
97 sortVector = NO_VERTEX_ASSIGNED; in operator()
100 sortVector = regularToCritical.Get(splitNeighbour); in operator()
101 return sortVector; in operator()
|
| H A D | DegreeSubrangeOffset.h | 75 WholeArrayIn sortVector, // (input)
86 const InFieldPortalType& sortVector, in operator()
89 vtkm::Id superID = sortVector.Get(sortID); in operator()
90 vtkm::Id prevSuper = sortVector.Get(sortID - 1); in operator()
|
| H A D | CopyNeighbors.h | 78 FieldOut sortVector); // (output) neighbors for active edge
91 vtkm::Id sortVector; in operator() local
94 sortVector = neighbour; in operator()
95 return sortVector; in operator()
|
| H A D | DegreeDelta.h | 74 WholeArrayIn sortVector, // (input) sorted vector of vertices
90 const InFieldPortalType& sortVector, in operator()
93 vtkm::Id iCandidate = sortVector.Get(sortID); in operator()
102 vtkm::Id nextCandidate = sortVector.Get(sortID + 1); in operator()
|
| H A D | ContourTree.h | 385 vtkm::cont::ArrayHandle<vtkm::Id> sortVector; in FindSupernodes() local
386 sortVector.Allocate(nCandidates); in FindSupernodes()
402 vtkm::cont::Algorithm::Sort(sortVector); in FindSupernodes()
415 sortVector, // input in FindSupernodes()
445 vtkm::cont::Algorithm::Sort(sortVector); in FindSupernodes()
468 sortVector, // input in FindSupernodes()
724 vtkm::cont::ArrayHandle<vtkm::Id> sortVector; in FindDegrees() local
725 sortVector.Allocate(nActiveSupernodes); in FindDegrees()
741 vtkm::cont::Algorithm::Sort(sortVector); in FindDegrees()
766 sortVector, // input in FindDegrees()
[all …]
|
| /dports/math/vtk8/VTK-8.2.0/ThirdParty/vtkm/vtk-m/vtkm/worklet/contourtree/ |
| H A D | SubrangeOffset.h | 85 WholeArrayIn<IdType> sortVector, // (input) sorted vector of vertices
96 const InFieldPortalType& sortVector, in operator()
99 if (sortVector.Get(sortID) != sortVector.Get(sortID - 1)) in operator()
100 candidate.Set(sortVector.Get(sortID), sortID); in operator()
|
| H A D | RegularToCandidate.h | 87 FieldOut<IdType> sortVector); // (output) target for write back
100 vtkm::Id sortVector; in operator() local
108 sortVector = NO_VERTEX_ASSIGNED; in operator()
111 sortVector = regularToCritical.Get(joinNeighbour); in operator()
112 return sortVector; in operator()
|
| H A D | RegularToCriticalDown.h | 87 FieldOut<IdType> sortVector); // (output)
100 vtkm::Id sortVector; in operator() local
107 sortVector = NO_VERTEX_ASSIGNED; in operator()
110 sortVector = regularToCritical.Get(splitNeighbour); in operator()
111 return sortVector; in operator()
|
| H A D | DegreeSubrangeOffset.h | 85 WholeArrayIn<IdType> sortVector, // (input)
96 const InFieldPortalType& sortVector, in operator()
99 vtkm::Id superID = sortVector.Get(sortID); in operator()
100 vtkm::Id prevSuper = sortVector.Get(sortID - 1); in operator()
|
| H A D | CopyNeighbors.h | 88 FieldOut<IdType> sortVector); // (output) neighbors for active edge
101 vtkm::Id sortVector; in operator() local
104 sortVector = neighbour; in operator()
105 return sortVector; in operator()
|
| H A D | DegreeDelta.h | 85 WholeArrayIn<IdType> sortVector, // (input) sorted vector of vertices
101 const InFieldPortalType& sortVector, in operator()
104 vtkm::Id iCandidate = sortVector.Get(sortID); in operator()
113 vtkm::Id nextCandidate = sortVector.Get(sortID + 1); in operator()
|
| H A D | ContourTree.h | 401 vtkm::cont::ArrayHandle<vtkm::Id> sortVector; in FindSupernodes() local
402 sortVector.Allocate(nCandidates); in FindSupernodes()
419 DeviceAlgorithm::Sort(sortVector); in FindSupernodes()
433 sortVector, // input in FindSupernodes()
465 DeviceAlgorithm::Sort(sortVector); in FindSupernodes()
490 sortVector, // input in FindSupernodes()
756 vtkm::cont::ArrayHandle<vtkm::Id> sortVector; in FindDegrees() local
757 sortVector.Allocate(nActiveSupernodes); in FindDegrees()
774 DeviceAlgorithm::Sort(sortVector); in FindDegrees()
801 sortVector, // input in FindDegrees()
[all …]
|
| /dports/textproc/redisearch/RediSearch-2.2.5/src/ |
| H A D | doc_table.c | 165 dmd->sortVector = v; in DocTable_SetSortingVector()
217 dmd->sortVector = NULL; in DocTable_Put()
262 if (md->sortVector) { in DMD_Free()
263 SortingVector_Free(md->sortVector); in DMD_Free()
264 md->sortVector = NULL; in DMD_Free()
324 if (md->sortVector) { in DocTable_Pop()
325 t->sortablesSize -= RSSortingVector_GetMemorySize(md->sortVector); in DocTable_Pop()
460 dmd->sortVector = NULL; in DocTable_LegacyRdbLoad()
462 dmd->sortVector = SortingVector_RdbLoad(rdb, encver); in DocTable_LegacyRdbLoad()
463 t->sortablesSize += RSSortingVector_GetMemorySize(dmd->sortVector); in DocTable_LegacyRdbLoad()
[all …]
|
| H A D | document.c | 765 if (!md->sortVector) { in AddDocumentCtx_UpdateNoIndex()
766 md->sortVector = NewSortingVector(sctx->spec->sortables->len); in AddDocumentCtx_UpdateNoIndex()
775 RSSortingVector_Put(md->sortVector, idx, (void *)RedisModule_StringPtrLen(f->text, NULL), in AddDocumentCtx_UpdateNoIndex()
783 RSSortingVector_Put(md->sortVector, idx, &numval, RS_SORTABLE_NUM, 0); in AddDocumentCtx_UpdateNoIndex()
|
| /dports/textproc/redisearch16/RediSearch-1.6.16/src/ |
| H A D | doc_table.c | 164 dmd->sortVector = v; in DocTable_SetSortingVector()
217 dmd->sortVector = NULL; in DocTable_Put()
261 if (md->sortVector) { in DMD_Free()
262 SortingVector_Free(md->sortVector); in DMD_Free()
263 md->sortVector = NULL; in DMD_Free()
357 SortingVector_RdbSave(rdb, dmd->sortVector); in DocTable_RdbSave()
440 dmd->sortVector = NULL; in DocTable_RdbLoad()
442 dmd->sortVector = SortingVector_RdbLoad(rdb, encver); in DocTable_RdbLoad()
443 t->sortablesSize += RSSortingVector_GetMemorySize(dmd->sortVector); in DocTable_RdbLoad()
|
| H A D | document.c | 703 if (!md->sortVector) { in AddDocumentCtx_UpdateNoIndex()
704 md->sortVector = NewSortingVector(sctx->spec->sortables->len); in AddDocumentCtx_UpdateNoIndex()
712 RSSortingVector_Put(md->sortVector, idx, (void *)RedisModule_StringPtrLen(f->text, NULL), in AddDocumentCtx_UpdateNoIndex()
720 RSSortingVector_Put(md->sortVector, idx, &numval, RS_SORTABLE_NUM); in AddDocumentCtx_UpdateNoIndex()
|
| H A D | redisearch.h | 89 struct RSSortingVector *sortVector; member
|
| /dports/textproc/redisearch20/RediSearch-2.0.15/src/ |
| H A D | doc_table.c | 167 dmd->sortVector = v; in DocTable_SetSortingVector()
222 dmd->sortVector = NULL; in DocTable_Put()
267 if (md->sortVector) { in DMD_Free()
268 SortingVector_Free(md->sortVector); in DMD_Free()
269 md->sortVector = NULL; in DMD_Free()
457 dmd->sortVector = NULL; in DocTable_LegacyRdbLoad()
459 dmd->sortVector = SortingVector_RdbLoad(rdb, encver); in DocTable_LegacyRdbLoad()
460 t->sortablesSize += RSSortingVector_GetMemorySize(dmd->sortVector); in DocTable_LegacyRdbLoad()
552 dmd->sortVector = NULL; in DocTable_RdbLoad()
|
| H A D | document.c | 747 if (!md->sortVector) { in AddDocumentCtx_UpdateNoIndex()
748 md->sortVector = NewSortingVector(sctx->spec->sortables->len); in AddDocumentCtx_UpdateNoIndex()
757 RSSortingVector_Put(md->sortVector, idx, (void *)RedisModule_StringPtrLen(f->text, NULL), in AddDocumentCtx_UpdateNoIndex()
765 RSSortingVector_Put(md->sortVector, idx, &numval, RS_SORTABLE_NUM, 0); in AddDocumentCtx_UpdateNoIndex()
|
| H A D | redisearch.h | 85 struct RSSortingVector *sortVector; member
|
| /dports/biology/bedtools/bedtools2-2.30.0/src/utils/FileRecordTools/Records/ |
| H A D | RecordKeyVector.h | 53 void sortVector();
|
| H A D | RecordKeyVector.cpp | 108 void RecordKeyVector::sortVector() { in sortVector() function in RecordKeyVector
|
| /dports/biology/bedtools/bedtools2-2.30.0/src/utils/BinTree/ |
| H A D | BinTree.cpp | 95 hitSet.sortVector(); in getHits()
|