/dports/graphics/openvkl/openvkl-1.1.0/openvkl/devices/cpu/volume/vdb/ |
H A D | VdbSampler_tile.ih | 16 uniform uint64 /*leafIndex*/, \ 61 uniform uint64 leafIndex, \ 69 grid->leafUnstructuredIndices + leafIndex, \ 181 uniform vkl_uint64 leafIndex, \ 188 grid->leafUnstructuredIndices + leafIndex, \ 189 grid->leafUnstructuredTimes + leafIndex, \ 197 uniform vkl_uint64 leafIndex, \ 204 grid->leafUnstructuredIndices + leafIndex, \ 205 grid->leafUnstructuredTimes + leafIndex, \ 213 const vkl_uint64 &leafIndex, \ [all …]
|
H A D | VdbSampler_denseZYX.ih | 18 uniform uint64 /*leafIndex*/, \ 50 uniform uint64 leafIndex, \ 57 grid->leafStructuredTimesteps[leafIndex]; \ 88 uniform uint64 leafIndex, \ 106 grid->leafUnstructuredIndices + leafIndex, \ 198 uniform vkl_uint64 leafIndex, \ 204 grid->leafStructuredTimesteps[leafIndex]; \ 218 uniform vkl_uint64 leafIndex, \ 224 grid->leafStructuredTimesteps[leafIndex]; \ 245 const vkl_uint64 &leafIndex, \ [all …]
|
H A D | VdbGrid.h | 101 univary vkl_uint64 leafIndex, \ 105 assert(leafIndex < grid->numLeaves); \ 107 return ((VKL_INTEROP_UNIFORM vkl_uint64)grid->numAttributes) * leafIndex + \ 252 univary vkl_uint64 leafIndex, \ 258 assert(leafIndex < (((univary vkl_uint64)1) << 58)); \ 260 (((univary vkl_uint64)leafIndex) << 6) + \ 266 assert(vklVdbVoxelLeafGetIndex(voxel) == leafIndex); \
|
/dports/multimedia/svt-hevc/SVT-HEVC-1.5.1/Source/Lib/Codec/ |
H A D | EbProductCodingLoop.c | 1274 const EB_U8 leafIndex = leafDataArray[cuIdx].leafIndex; in CalculateNextCuIndex() local 4782 const EB_U8 leafIndex = leafDataArray[cuIdx].leafIndex; in ModeDecisionLcu() local 4807 cuPtr->leafIndex = leafIndex; in ModeDecisionLcu() 4863 leafIndex, in ModeDecisionLcu() 5280 cuPtr->leafIndex = leafIndex; in BdpPillar() 5320 leafIndex, in BdpPillar() 5455 leafIndex, in BdpPillar() 5652 cuPtr->leafIndex = leafIndex; in Bdp64x64vs32x32RefinementProcess() 5691 leafIndex, in Bdp64x64vs32x32RefinementProcess() 5996 cuPtr->leafIndex = leafIndex; in Bdp16x16vs8x8RefinementProcess() [all …]
|
/dports/multimedia/gstreamer1-plugins-svt-hevc/SVT-HEVC-1.5.1/Source/Lib/Codec/ |
H A D | EbProductCodingLoop.c | 1274 const EB_U8 leafIndex = leafDataArray[cuIdx].leafIndex; in CalculateNextCuIndex() local 4782 const EB_U8 leafIndex = leafDataArray[cuIdx].leafIndex; in ModeDecisionLcu() local 4807 cuPtr->leafIndex = leafIndex; in ModeDecisionLcu() 4863 leafIndex, in ModeDecisionLcu() 5280 cuPtr->leafIndex = leafIndex; in BdpPillar() 5320 leafIndex, in BdpPillar() 5455 leafIndex, in BdpPillar() 5652 cuPtr->leafIndex = leafIndex; in Bdp64x64vs32x32RefinementProcess() 5691 leafIndex, in Bdp64x64vs32x32RefinementProcess() 5996 cuPtr->leafIndex = leafIndex; in Bdp16x16vs8x8RefinementProcess() [all …]
|
/dports/www/firefox-esr/firefox-91.8.0/security/ct/ |
H A D | BTVerifier.cpp | 181 rv = ReadUint<kLeafIndexLength>(reader, result.leafIndex); in DecodeInclusionProof() 186 if (result.leafIndex >= result.treeSize) { in DecodeInclusionProof() 298 if (proof.leafIndex >= proof.treeSize) { in VerifyInclusionProof() 304 uint64_t leafIndex = proof.leafIndex; in VerifyInclusionProof() local 316 if (leafIndex % 2 == 1 || leafIndex == lastNodeIndex) { in VerifyInclusionProof() 322 if (leafIndex % 2 == 0) { in VerifyInclusionProof() 323 while (leafIndex % 2 == 0 && lastNodeIndex > 0) { in VerifyInclusionProof() 324 leafIndex >>= 1; in VerifyInclusionProof() 335 leafIndex >>= 1; in VerifyInclusionProof()
|
/dports/www/firefox/firefox-99.0/security/ct/ |
H A D | BTVerifier.cpp | 181 rv = ReadUint<kLeafIndexLength>(reader, result.leafIndex); in DecodeInclusionProof() 186 if (result.leafIndex >= result.treeSize) { in DecodeInclusionProof() 298 if (proof.leafIndex >= proof.treeSize) { in VerifyInclusionProof() 304 uint64_t leafIndex = proof.leafIndex; in VerifyInclusionProof() local 316 if (leafIndex % 2 == 1 || leafIndex == lastNodeIndex) { in VerifyInclusionProof() 322 if (leafIndex % 2 == 0) { in VerifyInclusionProof() 323 while (leafIndex % 2 == 0 && lastNodeIndex > 0) { in VerifyInclusionProof() 324 leafIndex >>= 1; in VerifyInclusionProof() 335 leafIndex >>= 1; in VerifyInclusionProof()
|
/dports/mail/thunderbird/thunderbird-91.8.0/security/ct/ |
H A D | BTVerifier.cpp | 181 rv = ReadUint<kLeafIndexLength>(reader, result.leafIndex); in DecodeInclusionProof() 186 if (result.leafIndex >= result.treeSize) { in DecodeInclusionProof() 298 if (proof.leafIndex >= proof.treeSize) { in VerifyInclusionProof() 304 uint64_t leafIndex = proof.leafIndex; in VerifyInclusionProof() local 316 if (leafIndex % 2 == 1 || leafIndex == lastNodeIndex) { in VerifyInclusionProof() 322 if (leafIndex % 2 == 0) { in VerifyInclusionProof() 323 while (leafIndex % 2 == 0 && lastNodeIndex > 0) { in VerifyInclusionProof() 324 leafIndex >>= 1; in VerifyInclusionProof() 335 leafIndex >>= 1; in VerifyInclusionProof()
|
/dports/lang/spidermonkey78/firefox-78.9.0/security/ct/ |
H A D | BTVerifier.cpp | 181 rv = ReadUint<kLeafIndexLength>(reader, result.leafIndex); in DecodeInclusionProof() 186 if (result.leafIndex >= result.treeSize) { in DecodeInclusionProof() 298 if (proof.leafIndex >= proof.treeSize) { in VerifyInclusionProof() 304 uint64_t leafIndex = proof.leafIndex; in VerifyInclusionProof() local 316 if (leafIndex % 2 == 1 || leafIndex == lastNodeIndex) { in VerifyInclusionProof() 322 if (leafIndex % 2 == 0) { in VerifyInclusionProof() 323 while (leafIndex % 2 == 0 && lastNodeIndex > 0) { in VerifyInclusionProof() 324 leafIndex >>= 1; in VerifyInclusionProof() 335 leafIndex >>= 1; in VerifyInclusionProof()
|
/dports/science/jmol/jmol-14.32.7/src/org/jmol/bspt/ |
H A D | CubeIterator.java | 43 private int leafIndex; field in CubeIterator 103 for ( ; leafIndex < leaf.count; ++leafIndex) in hasMoreElements() 104 if (isWithinRadius(leaf.tuples[leafIndex])) in hasMoreElements() 117 return leaf.tuples[leafIndex++]; in nextElement() 171 leafIndex = 0; in findLeftLeaf()
|
/dports/textproc/xerces-c3/xerces-c-3.2.3/src/xercesc/validators/common/ |
H A D | DFAContentModel.cpp | 809 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 814 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 840 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 845 tmpSorter[fSortCount++] = leafIndex; in buildDFA() 989 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 992 if (setT->getBit(leafIndex)) in buildDFA() 1018 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 1020 while (leafIndex != -1) in buildDFA() 1023 if (setT->getBit(leafIndex)) in buildDFA() 1030 *newSet |= *fFollowList[leafIndex]; in buildDFA() [all …]
|
/dports/biology/py-python-libsbml/python-libsbml-5.19.0/libsbml_dependencies/xerces-c/src/xercesc/validators/common/ |
H A D | DFAContentModel.cpp | 809 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 814 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 840 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 845 tmpSorter[fSortCount++] = leafIndex; in buildDFA() 989 for (unsigned int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) in buildDFA() local 992 if (setT->getBit(leafIndex)) in buildDFA() 1018 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 1020 while (leafIndex != -1) in buildDFA() 1023 if (setT->getBit(leafIndex)) in buildDFA() 1030 *newSet |= *fFollowList[leafIndex]; in buildDFA() [all …]
|
/dports/math/dune-grid/dune-grid-de36e4b4e99da4cd7a120a39779345e701821115/dune/grid/uggrid/ |
H A D | uggridindexsets.cc | 174 int& index = UG_NS<dim>::leafIndex(UG_NS<dim>::GetEdge(UG_NS<dim>::Corner(target_, in update() 186 …UG::UINT& index = UG_NS<dim>::leafIndex(UG_NS<dim>::SideVector(target_,UGGridRenumberer<dim>::face… in update() 232 int& index = UG_NS<dim>::leafIndex(UG_NS<dim>::GetEdge(UG_NS<dim>::Corner(target_, in update() 245 UG_NS<dim>::leafIndex(UG_NS<dim>::GetEdge(UG_NS<dim>::Corner(father_, in update() 277 …UG_NS<dim>::leafIndex(UG_NS<dim>::SideVector(father_,UGGridRenumberer<dim>::facesDUNEtoUG(i,gt))) … in update() 324 UG_NS<dim>::leafIndex(element.impl().target_) = numSimplices_++; in update() 326 UG_NS<dim>::leafIndex(element.impl().target_) = numPyramids_++; in update() 328 UG_NS<dim>::leafIndex(element.impl().target_) = numPrisms_++; in update() 330 UG_NS<dim>::leafIndex(element.impl().target_) = numCubes_++; in update() 358 UG_NS<dim>::leafIndex(vertex.impl().target_) = (*nodePermutation)[numVertices_++]; in update() [all …]
|
/dports/math/vtk9/VTK-9.1.0/IO/PIO/ |
H A D | BHTree.cxx | 187 this->leafIndex = 0; in BHTree() 193 for (int i = 0; i < (this->leafIndex + 1); i++) in ~BHTree() 265 this->leafIndex++; in insertLeaf() 268 this->bhNode[tindx]->child[oindx] = this->leafIndex; in insertLeaf() 269 return leafIndex; in insertLeaf() 274 std::cout << "Number of leaves " << leafIndex << " Number of nodes " << nodeIndex << std::endl; in print() 277 for (i = 1; i <= this->leafIndex; i++) in print()
|
/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/java.xml/share/classes/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 538 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 539 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 542 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 641 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 643 while (leafIndex != -1) { in buildDFA() 645 if (setT.getBit(leafIndex)) in buildDFA() 652 newSet.union(fFollowList[leafIndex]); in buildDFA() 655 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 580 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 581 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 584 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 683 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 685 while (leafIndex != -1) { in buildDFA() 687 if (setT.getBit(leafIndex)) in buildDFA() 694 newSet.union(fFollowList[leafIndex]); in buildDFA() 697 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/jaxp/src/com/sun/org/apache/xerces/internal/impl/dtd/models/ |
H A D | DFAContentModel.java | 580 for (int leafIndex = 0; leafIndex < fLeafCount; leafIndex++) { in buildDFA() 581 final QName leaf = fLeafList[leafIndex].getElement(); in buildDFA() 584 fLeafSorter[fSortCount++] = leafIndex; in buildDFA() 683 int leafIndex = fLeafSorter[sorterIndex++]; in buildDFA() local 685 while (leafIndex != -1) { in buildDFA() 687 if (setT.getBit(leafIndex)) in buildDFA() 694 newSet.union(fFollowList[leafIndex]); in buildDFA() 697 leafIndex = fLeafSorter[sorterIndex++]; in buildDFA()
|
/dports/misc/py-xgboost/xgboost-1.5.1/jvm-packages/xgboost4j-example/src/main/scala/ml/dmlc/xgboost4j/scala/example/ |
H A D | PredictLeafIndices.scala | 45 val leafIndex = booster.predictLeaf(testMat, 2) constant 46 for (leafs <- leafIndex) { 52 for (leafs <- leafIndex) {
|