Home
last modified time | relevance | path

Searched +defs:node +defs:previous (Results 1 – 25 of 1455) sorted by relevance

12345678910>>...59

/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/timing/
H A Dlayout_shift_attribution.cc17 Node* node, in Create()
18 DOMRectReadOnly* previous, in Create()
23 LayoutShiftAttribution::LayoutShiftAttribution(Node* node, in LayoutShiftAttribution()
24 DOMRectReadOnly* previous, in LayoutShiftAttribution()
30 Node* LayoutShiftAttribution::node() const { in node() function in blink::LayoutShiftAttribution
/dports/devel/pear-Structure_LinkedList/Structures_LinkedList-0.2.2/Structures/LinkedList/
H A DSingle.php158 // {{{ function rewind()
246 // {{{ protected function getTailNode()
302 if (!$this->root_node) {
344 $previous_node->setNext($new_node);
365 // {{{ function prependNode()
366 /**
/dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/core/dom/
H A Dlayout_tree_builder_traversal.cc37 inline static bool HasDisplayContentsStyle(const Node& node) { in HasDisplayContentsStyle()
76 const Node& node, in LayoutParent()
135 if (Node* previous = FlatTreeTraversal::LastChild(*parent_element)) in PreviousSibling() local
140 if (Node* previous = FlatTreeTraversal::PreviousSibling(node)) in PreviousSibling() local
145 if (Node* previous = parent_element->GetPseudoElement(kPseudoIdBefore)) in PreviousSibling() local
151 if (Node* previous = parent_element->GetPseudoElement(kPseudoIdMarker)) in PreviousSibling() local
177 Node* LayoutTreeBuilderTraversal::Previous(const Node& node, in Previous()
219 const Node& node, in NextSkippingChildren()
228 Node* LayoutTreeBuilderTraversal::Next(const Node& node, in Next()
309 const Node& node, in NextSiblingLayoutObject()
[all …]
H A Dflat_tree_traversal.h153 static void AssertPrecondition(const Node& node) { in AssertPrecondition()
159 static void AssertPostcondition(const Node* node) { in AssertPostcondition()
201 const Node& node, in Parent()
227 inline Node* FlatTreeTraversal::Next(const Node& node) { in Next()
234 inline Node* FlatTreeTraversal::Next(const Node& node, in Next()
268 const Node& node, in TraverseNextSkippingChildren()
287 if (Node* previous = TraversePreviousSibling(node)) { in TraversePrevious() local
295 inline Node* FlatTreeTraversal::Previous(const Node& node, in Previous()
300 Node* previous = Previous(node); in Previous() local
342 const Node& node) { in AncestorsOf()
[all …]
/dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/blink/renderer/core/dom/
H A Dlayout_tree_builder_traversal.cc37 inline static bool HasDisplayContentsStyle(const Node& node) { in HasDisplayContentsStyle()
76 const Node& node, in LayoutParent()
135 if (Node* previous = FlatTreeTraversal::LastChild(*parent_element)) in PreviousSibling() local
140 if (Node* previous = FlatTreeTraversal::PreviousSibling(node)) in PreviousSibling() local
146 if (Node* previous = parent_element->GetPseudoElement(kPseudoIdBefore)) in PreviousSibling() local
150 if (Node* previous = parent_element->GetPseudoElement(kPseudoIdMarker)) in PreviousSibling() local
175 Node* LayoutTreeBuilderTraversal::Previous(const Node& node, in Previous()
217 const Node& node, in NextSkippingChildren()
226 Node* LayoutTreeBuilderTraversal::Next(const Node& node, in Next()
307 const Node& node, in NextSiblingLayoutObject()
[all …]
H A Dflat_tree_traversal.h153 static void AssertPrecondition(const Node& node) { in AssertPrecondition()
159 static void AssertPostcondition(const Node* node) { in AssertPostcondition()
201 const Node& node, in Parent()
227 inline Node* FlatTreeTraversal::Next(const Node& node) { in Next()
234 inline Node* FlatTreeTraversal::Next(const Node& node, in Next()
268 const Node& node, in TraverseNextSkippingChildren()
287 if (Node* previous = TraversePreviousSibling(node)) { in TraversePrevious() local
295 inline Node* FlatTreeTraversal::Previous(const Node& node, in Previous()
300 Node* previous = Previous(node); in Previous() local
342 const Node& node) { in AncestorsOf()
[all …]
/dports/dns/knot3/knot-3.1.5/src/knot/nameserver/
H A Dnsec_proofs.c43 static bool ds_optout(const zone_node_t *node) in ds_optout()
55 static bool node_in_nsec(const zone_node_t *node) in node_in_nsec()
68 static bool node_in_nsec3(const zone_node_t *node) in node_in_nsec3()
77 static const zone_node_t *nsec_previous(const zone_node_t *previous) in nsec_previous()
214 const zone_node_t *node = NULL; in put_covering_nsec3() local
299 static int put_nsec_wildcard(const zone_node_t *previous, in put_nsec_wildcard()
336 const zone_node_t *previous, in put_wildcard_answer()
375 const zone_node_t *previous, in put_nsec_nxdomain()
464 const zone_node_t *previous, in put_nxdomain()
495 const zone_node_t *previous, in put_nsec_nodata()
[all …]
/dports/dns/knot3-lib/knot-3.1.5/src/knot/nameserver/
H A Dnsec_proofs.c43 static bool ds_optout(const zone_node_t *node) in ds_optout()
55 static bool node_in_nsec(const zone_node_t *node) in node_in_nsec()
68 static bool node_in_nsec3(const zone_node_t *node) in node_in_nsec3()
77 static const zone_node_t *nsec_previous(const zone_node_t *previous) in nsec_previous()
214 const zone_node_t *node = NULL; in put_covering_nsec3() local
299 static int put_nsec_wildcard(const zone_node_t *previous, in put_nsec_wildcard()
336 const zone_node_t *previous, in put_wildcard_answer()
375 const zone_node_t *previous, in put_nsec_nxdomain()
464 const zone_node_t *previous, in put_nxdomain()
495 const zone_node_t *previous, in put_nsec_nodata()
[all …]
/dports/devel/libfastcommon/libfastcommon-1.0.43/src/
H A Dskiplist_set.c113 SkiplistSetNode *node; in skiplist_set_destroy() local
155 SkiplistSetNode *node; in skiplist_set_insert() local
156 SkiplistSetNode *previous; in skiplist_set_insert() local
211 SkiplistSetNode *previous; in skiplist_set_get_equal_previous() local
237 SkiplistSetNode *previous; in skiplist_set_get_first_larger_or_equal() local
262 SkiplistSetNode *previous; in skiplist_set_get_first_larger() local
286 SkiplistSetNode *previous; in skiplist_set_delete() local
316 SkiplistSetNode *previous; in skiplist_set_find() local
325 SkiplistSetNode *previous; in skiplist_set_find_all() local
H A Dflat_skiplist.c114 FlatSkiplistNode *node; in flat_skiplist_destroy() local
155 FlatSkiplistNode *node; in flat_skiplist_insert() local
156 FlatSkiplistNode *previous; in flat_skiplist_insert() local
203 FlatSkiplistNode *previous; in flat_skiplist_get_previous() local
229 FlatSkiplistNode *previous; in flat_skiplist_get_first_larger_or_equal() local
261 FlatSkiplistNode *previous; in flat_skiplist_get_first_larger() local
292 FlatSkiplistNode *previous; in flat_skiplist_delete() local
332 FlatSkiplistNode *previous; in flat_skiplist_find() local
341 FlatSkiplistNode *previous; in flat_skiplist_find_all() local
H A Dmulti_skiplist.c121 MultiSkiplistNode *node; in multi_skiplist_destroy() local
160 MultiSkiplistNode *previous; in multi_skiplist_get_previous() local
186 MultiSkiplistNode *previous; in multi_skiplist_get_first_larger_or_equal() local
211 MultiSkiplistNode *previous; in multi_skiplist_get_first_larger() local
258 MultiSkiplistNode *node; in multi_skiplist_insert() local
259 MultiSkiplistNode *previous; in multi_skiplist_insert() local
320 MultiSkiplistNode *previous; in multi_skiplist_do_delete() local
381 MultiSkiplistNode *previous; in multi_skiplist_find() local
391 MultiSkiplistNode *previous; in multi_skiplist_find_all() local
/dports/www/mediawiki137/mediawiki-1.37.1/vendor/wikimedia/dodo/src/Internal/
H A DNodeTraversal.php20 public static function nextSkippingChildren( Node $node, ?Node $stayWithin ): ?Node {
38 public static function nextAncestorSibling( Node $node, ?Node $stayWithin ): ?Node {
58 public static function next( Node $node, ?Node $stayWithin ): ?Node {
79 public static function deepLastChild( Node $node ): ?Node {
93 public static function previous( Node $node, ?Node $stayWithin ): ?Node { function in Wikimedia\\Dodo\\Internal\\NodeTraversal
/dports/games/pentobi/pentobi-19.1/libboardgame_base/
H A DSgfNode.cpp21 void SgfNode::append(unique_ptr<SgfNode> node) in append()
32 auto node = make_unique<SgfNode>(); in create_new_child() local
97 auto node = m_first_child.get(); in get_last_child() local
176 auto previous = m_properties.end(); in move_property_to_front() local
249 auto previous = m_properties.end(); in remove_property() local
266 auto node = &m_first_child; in remove_child() local
267 unique_ptr<SgfNode>* previous = nullptr; in remove_child() local
/dports/java/eclipse/eclipse.platform.releng.aggregator-R4_16/eclipse.jdt.core/org.eclipse.jdt.core/dom/org/eclipse/jdt/internal/core/dom/
H A DSourceRangeVerifier.java46 public String process(ASTNode node) { in process()
57 public boolean preVisit2(ASTNode node) { in preVisit2()
58 ASTNode previous = null; in preVisit2() local
89 private boolean checkChild(ASTNode parent, ASTNode previous, ASTNode child) { in checkChild()
/dports/games/lizzie/lizzie-0.6-105-gd0e7040/src/main/java/featurecat/lizzie/rules/
H A DBoardHistoryNode.java10 private Optional<BoardHistoryNode> previous; field in BoardHistoryNode
139 public Optional<BoardHistoryNode> previous() { in previous() method in BoardHistoryNode
219 BoardHistoryNode node = this; in resetMoveNumberListBranch() local
270 BoardHistoryNode node = this; in getDepth() local
286 BoardHistoryNode node = this; in childAtDepth() local
304 BoardHistoryNode node = this; in hasDepth() local
354 BoardHistoryNode node = this; in findChildOfPreviousWithVariation() local
451 BoardHistoryNode node = this; in isMainTrunk() local
468 BoardHistoryNode node = this; in goToNextNodeWithComment() local
487 BoardHistoryNode node = this; in goToPreviousNodeWithComment() local
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/rendering/
H A DCounterNode.cpp135 CounterNode* previous = m_previousSibling; in previousInPreOrder() local
192 RenderCounter* previous = 0; in removeRenderer() local
216 CounterNode* node = this; in resetThisAndDescendantsRenderers() local
225 for (CounterNode* node = this; node; node = node->m_nextSibling) { in recount() local
318 CounterNode* previous = oldChild->m_previousSibling; in removeChild() local
344 static void showTreeAndMark(const CounterNode* node) in showTreeAndMark()
/dports/emulators/vt100/terminal-simulator-0.2/vt100/
H A Devent.c8 struct event *node; in cancel_event() local
20 struct event *node; in add_event() local
45 struct event *node; in events() local
64 struct event *node; in print_events() local
73 unsigned long long previous; in timer() local
/dports/net-mgmt/librenms/librenms-vendor-21.5.1/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/finance/prestashop/prestashop/vendor/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/www/webtrees20/webtrees-2.0.19/webtrees/vendor/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/www/typo3-10/typo3_src-10.4.25/vendor/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/www/typo3-11/typo3_src-11.5.7/vendor/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/www/owncloud/owncloud/lib/composer/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/www/nextcloud/nextcloud/3rdparty/nikic/php-parser/lib/PhpParser/NodeVisitor/
H A DNodeConnectingVisitor.php27 private $previous; variable in PhpParser\\NodeVisitor\\NodeConnectingVisitor
34 public function enterNode(Node $node) {
47 public function leaveNode(Node $node) {
/dports/devel/icu-lx/icu/source/i18n/
H A Dcollationbuilder.h249 static inline int64_t nodeFromPreviousIndex(int32_t previous) { in nodeFromPreviousIndex()
259 static inline uint32_t weight32FromNode(int64_t node) { in weight32FromNode()
262 static inline uint32_t weight16FromNode(int64_t node) { in weight16FromNode()
265 static inline int32_t previousIndexFromNode(int64_t node) { in previousIndexFromNode()
268 static inline int32_t nextIndexFromNode(int64_t node) { in nextIndexFromNode()
271 static inline int32_t strengthFromNode(int64_t node) { in strengthFromNode()
275 static inline UBool nodeHasBefore2(int64_t node) { in nodeHasBefore2()
278 static inline UBool nodeHasBefore3(int64_t node) { in nodeHasBefore3()
281 static inline UBool nodeHasAnyBefore(int64_t node) { in nodeHasAnyBefore()
284 static inline UBool isTailoredNode(int64_t node) { in isTailoredNode()
[all …]

12345678910>>...59