Home
last modified time | relevance | path

Searched refs:firstLeaf (Results 1 – 25 of 58) sorted by relevance

123

/dports/devel/flex-sdk/flex-sdk-4.6.0.23201/frameworks/projects/textLayout/src/flashx/textLayout/edit/
H A DElementRange.as92 public function get firstLeaf():FlowLeafElement property in flashx.textLayout.edit.ElementRange
96 public function set firstLeaf(value:FlowLeafElement):void property in flashx.textLayout.edit.ElementRange
238 return firstLeaf.computedFormat;
255 var leaf:FlowLeafElement = firstLeaf;
350 rslt.firstLeaf = textFlow.findLeaf(rslt.absoluteStart);
351 rslt.firstParagraph = rslt.firstLeaf.getParagraph();
354 rslt.lastLeaf = rslt.firstLeaf;
370 rslt.firstLeaf = textFlow.findLeaf(rslt.absoluteStart);
377 rslt.firstParagraph = rslt.firstLeaf.getParagraph();
411 …&& (!(rslt.firstLeaf.parent is SubParagraphGroupElementBase) || previousNode.parent === rslt.first…
[all …]
/dports/security/liboqs/liboqs-0.7.0/src/sig/picnic/external/
H A Dpicnic3_tree.c116 size_t firstLeaf = tree->numNodes - tree->numLeaves;
117 return tree->nodes[firstLeaf + leafIndex];
446 size_t firstLeaf = tree->numNodes - tree->numLeaves;
452 memcpy(tree->nodes[firstLeaf + i], leafData[i], tree->dataSize);
453 tree->haveNode[firstLeaf + i] = 1;
465 size_t firstLeaf = tree->numNodes - tree->numLeaves;
470 missingNodes[firstLeaf + missingLeaves[i]] = 1;
590 size_t firstLeaf = tree->numNodes - tree->numLeaves;
596 if (tree->haveNode[firstLeaf + i] == 1) {
601 memcpy(tree->nodes[firstLeaf + i], leafData[i], tree->dataSize);
[all …]
/dports/science/agrum/aGrUM-29e540d8169268e8fe5d5c69bc4b2b1290f12320/src/agrum/FMDP/learning/datastructure/leaves/
H A DleafAggregator.cpp168 || (*fusIter)->leaf()->contains((*pairIter)->firstLeaf()->id())) { in updateLeaf()
205 || (*fusIter)->leaf()->contains((*pairIter)->firstLeaf()->id())) { in removeLeaf()
254 if (!newLeaf->contains(pairIter.key()->firstLeaf()->id()) in update()
257 if (!newLeaf->contains(pairIter.key()->firstLeaf()->id()) in update()
258 && !newContext->containsAssociatedLeaf(pairIter.key()->firstLeaf())) in update()
259 newContext->associateLeaf(pairIter.key()->firstLeaf()); in update()
H A DleafPair.h100 AbstractLeaf* firstLeaf() { return _l1_; } in firstLeaf() function
/dports/www/firefox-legacy/firefox-52.8.0esr/dom/canvas/
H A DWebGLElementArrayCache.cpp238 bool Validate(T maxAllowed, size_t firstLeaf, size_t lastLeaf) in Validate()
240 size_t firstTreeIndex = TreeIndexForLeaf(firstLeaf); in Validate()
388 size_t firstLeaf = LeafForByte(firstByte); in Update() local
391 MOZ_ASSERT(firstLeaf <= lastLeaf && lastLeaf < NumLeaves()); in Update()
393 size_t firstTreeIndex = TreeIndexForLeaf(firstLeaf); in Update()
407 size_t srcIndex = firstLeaf * kElementsPerLeaf; in Update()
/dports/devel/llvm11/llvm-11.0.1.src/tools/clang/include/clang/Tooling/Syntax/
H A DTree.h160 Leaf *firstLeaf();
161 const Leaf *firstLeaf() const { in firstLeaf() function
162 return const_cast<Tree *>(this)->firstLeaf(); in firstLeaf()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/clang/include/clang/Tooling/Syntax/
H A DTree.h160 Leaf *firstLeaf();
161 const Leaf *firstLeaf() const { in firstLeaf() function
162 return const_cast<Tree *>(this)->firstLeaf(); in firstLeaf()
/dports/devel/llvm10/llvm-10.0.1.src/tools/clang/include/clang/Tooling/Syntax/
H A DTree.h158 Leaf *firstLeaf();
159 const Leaf *firstLeaf() const { in firstLeaf() function
160 return const_cast<Tree *>(this)->firstLeaf(); in firstLeaf()
/dports/math/ogdf/OGDF/src/ogdf/energybased/fast_multipole_embedder/
H A DLinearQuadtreeBuilder.cpp54 firstLeaf = begin; in prepareTree()
55 firstInner = firstLeaf+n; in prepareTree()
137 tree.m_firstLeaf = firstLeaf; in build()
H A DFMEMultipoleKernel.cpp118 localContext->firstLeaf = builder.firstLeaf; in quadtreeConstruction()
131 sbuilder.firstLeaf = globalContext->pLocalContext[0]->firstLeaf; in quadtreeConstruction()
/dports/devel/tinygo/tinygo-0.14.1/llvm-project/clang/include/clang/Tooling/Syntax/
H A DTree.h158 Leaf *firstLeaf();
159 const Leaf *firstLeaf() const { in firstLeaf() function
160 return const_cast<Tree *>(this)->firstLeaf(); in firstLeaf()
/dports/audio/sc3-plugins/sc3-plugins-Version-3.9.0/source/MCLDUGens/
H A DMCLDTreeUGens.cpp271 int firstLeaf = NearestN_descend(sibling, ndims, inputData, bufData, bufChannels, bufFrames); in NearestN_ascend() local
272 …NearestN_ascend(firstLeaf, sibling, ndims, inputData, bufData, bestlist, num, bufChannels, bufFram… in NearestN_ascend()
315 int firstLeaf = NearestN_descend(1, ndims, inputdata, bufData, bufChannels, bufFrames); in NearestN_next() local
317 NearestN_ascend(firstLeaf, 0, ndims, inputdata, bufData, bestlist, num, bufChannels, bufFrames); in NearestN_next()
/dports/misc/openvdb/openvdb-9.0.0/openvdb_ax/openvdb_ax/test/integration/
H A DCompareGrids.cc209 inline bool compareNodes(const NodeT& firstLeaf, in compareNodes() argument
218 const BufferT& firstBuffer = firstLeaf.buffer(); in compareNodes()
229 const typename NodeT::NodeMaskType& firstMask = firstLeaf.getValueMask(); in compareNodes()
372 (const openvdb::points::PointDataTree::LeafNodeType& firstLeaf, in compareAttributes() argument
379 const Descriptor& firstDescriptor = firstLeaf.attributeSet().descriptor(); in compareAttributes()
407 const auto& array1 = firstLeaf.constAttributeArray(pos1); in compareAttributes()
426 compareStringArrays(array1, array2, firstLeaf, secondLeaf, name, data); in compareAttributes()
433 compareArrays<decltype(x)>(array1, array2, firstLeaf, name, data); in compareAttributes()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/rendering/svg/
H A DSVGRootInlineBox.cpp208 InlineBox* firstLeaf = firstLeafChild(); in closestLeafChildForPosition() local
210 if (firstLeaf == lastLeaf) in closestLeafChildForPosition()
211 return firstLeaf; in closestLeafChildForPosition()
215 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) { in closestLeafChildForPosition()
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/rendering/
H A DRootInlineBox.cpp463 InlineBox* firstLeaf = firstLeafChild(); in closestLeafChildForLogicalLeftPosition() local
465 if (firstLeaf == lastLeaf && (!onlyEditableLeaves || isEditableLeaf(firstLeaf))) in closestLeafChildForLogicalLeftPosition()
466 return firstLeaf; in closestLeafChildForLogicalLeftPosition()
469 …(leftPosition <= firstLeaf->logicalLeft() && !firstLeaf->renderer()->isListMarker() && (!onlyEdita… in closestLeafChildForLogicalLeftPosition()
472 return firstLeaf; in closestLeafChildForLogicalLeftPosition()
480 for (InlineBox* leaf = firstLeaf; leaf; leaf = leaf->nextLeafChild()) { in closestLeafChildForLogicalLeftPosition()
/dports/news/husky/husky-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-areafix/husky-areafix-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-sqpack/husky-sqpack-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-hpt/husky-hpt-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-smapi/husky-smapi-1.9.20191207,1/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-huskylib/husky-huskylib-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-htick/husky-htick-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/news/husky-fidoconf/husky-fidoconf-1.9.20191207/msged/
H A Dmxbt.h27 long firstLeaf; member
/dports/multimedia/vlc/vlc-3.0.16/modules/gui/skins2/utils/
H A Dvar_tree.hpp137 m_flat ? firstLeaf() : m_children.begin(), this ); in begin()
179 Iterator firstLeaf();
/dports/www/firefox-legacy/firefox-52.8.0esr/layout/base/
H A DnsBidiPresUtils.cpp1287 nsIFrame* firstLeaf = aFrame; in GetFirstLeaf() local
1288 while (!IsBidiLeaf(firstLeaf)) { in GetFirstLeaf()
1289 nsIFrame* firstChild = firstLeaf->PrincipalChildList().FirstChild(); in GetFirstLeaf()
1291 firstLeaf = (realFrame->GetType() == nsGkAtoms::letterFrame) ? in GetFirstLeaf()
1294 return firstLeaf; in GetFirstLeaf()
1312 nsIFrame* firstLeaf = aFrame; in GetFrameBaseLevel() local
1313 while (!IsBidiLeaf(firstLeaf)) { in GetFrameBaseLevel()
1314 firstLeaf = firstLeaf->PrincipalChildList().FirstChild(); in GetFrameBaseLevel()
1316 return firstLeaf->GetBaseLevel(); in GetFrameBaseLevel()

123