Home
last modified time | relevance | path

Searched refs:prev_leaf (Results 1 – 25 of 30) sorted by relevance

12

/dports/textproc/py-yapf/yapf-0.31.0/yapf/yapflib/
H A Dcomment_splicer.py43 prev_leaf = [None]
81 standalone=False), prev_leaf[0])
172 if comment_lineno == prev_leaf[0].lineno:
176 comment_column = prev_leaf[0].column
177 comment_column += len(prev_leaf[0].value)
184 pytree_utils.InsertNodesAfter([comment_leaf], prev_leaf[0])
201 prev_leaf[0] = child
/dports/textproc/p5-Lingua-Treebank/Lingua-Treebank-0.16/Const/t/
H A D20basemethods.t26 qw( prev_leaf next_leaf ),
78 ok( (not defined $joe->prev_leaf()), " leftmost's prev_leaf not defined");
92 is($likes->prev_leaf, $joe, ' next-previous is original');
/dports/misc/thrill/thrill-12c5b59bca66df93b66628b3829027bd0f110dd9/extlib/tlx/tlx/container/
H A Dbtree.hpp278 LeafNode* prev_leaf; member
289 prev_leaf = next_leaf = nullptr; in initialize()
465 curr_leaf = curr_leaf->prev_leaf; in operator --()
484 curr_leaf = curr_leaf->prev_leaf; in operator --()
637 curr_leaf = curr_leaf->prev_leaf; in operator --()
656 curr_leaf = curr_leaf->prev_leaf; in operator --()
774 curr_leaf = curr_leaf->prev_leaf; in operator ++()
793 curr_leaf = curr_leaf->prev_leaf; in operator ++()
2100 newleaf->prev_leaf = leaf; in split_leaf_node()
2184 leaf->prev_leaf = tail_leaf_; in bulk_load()
[all …]
/dports/devel/tlx/tlx-0.5.20200222-5-g8982a9d/tlx/container/
H A Dbtree.hpp278 LeafNode* prev_leaf; member
289 prev_leaf = next_leaf = nullptr; in initialize()
465 curr_leaf = curr_leaf->prev_leaf; in operator --()
484 curr_leaf = curr_leaf->prev_leaf; in operator --()
637 curr_leaf = curr_leaf->prev_leaf; in operator --()
656 curr_leaf = curr_leaf->prev_leaf; in operator --()
774 curr_leaf = curr_leaf->prev_leaf; in operator ++()
793 curr_leaf = curr_leaf->prev_leaf; in operator ++()
2100 newleaf->prev_leaf = leaf; in split_leaf_node()
2184 leaf->prev_leaf = tail_leaf_; in bulk_load()
[all …]
/dports/misc/e2fsprogs-libblkid/e2fsprogs-1.46.5/debugfs/
H A Dextent_cmds.ct32 prev_leaf, pl;
/dports/misc/e2fsprogs-libuuid/e2fsprogs-1.46.5/debugfs/
H A Dextent_cmds.ct32 prev_leaf, pl;
/dports/sysutils/e2fsprogs/e2fsprogs-1.46.5/debugfs/
H A Dextent_cmds.ct32 prev_leaf, pl;
/dports/games/iortcw/iortcw-1.51c/MP/code/botlib/
H A Dbe_aas_def.h72 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/iortcw/iortcw-1.51c/SP/code/botlib/
H A Dbe_aas_def.h72 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/openjk/OpenJK-07675e2/codemp/botlib/
H A Dbe_aas_def.h67 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/ioquake3-server/ioquake3-1.36/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/ioquake3/ioquake3-1.36/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/tremulous/tremulous/tremulous-1.1.0-src/src/botlib/
H A Dbe_aas_def.h76 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/openarena/openarena-engine-source-0.8.8/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/openarena-server/openarena-engine-source-0.8.8/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/evq3/evq3/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/games/worldofpadman/worldofpadman-1.2.20080621/code/botlib/
H A Dbe_aas_def.h75 struct bsp_link_s *next_leaf, *prev_leaf; member
/dports/textproc/p5-Lingua-Treebank/Lingua-Treebank-0.16/Const/
H A DConst.pm595 sub prev_leaf { subroutine
615 return $self->parent->prev_leaf();
/dports/editors/xi-core/xi-editor-0.3.0/rust/rope/src/
H A Dtree.rs647 let l = self.prev_leaf().unwrap().0; in is_boundary()
674 self.prev_leaf()?; in prev()
832 pub fn prev_leaf(&mut self) -> Option<(&'a N::L, usize)> { in prev_leaf() method
H A Drope.rs706 let (pl, poffset) = self.prev_leaf()?; in next_grapheme()
734 let (pl, poffset) = self.prev_leaf()?; in prev_grapheme()
738 let (pl, poffset) = self.prev_leaf()?; in prev_grapheme()
H A Dcompare.rs378 if let Some(prev) = self.base.prev_leaf() { in load_prev_chunk()
384 if let Some(prev) = self.target.prev_leaf() { in load_prev_chunk()
/dports/x11-wm/bspwm/bspwm-0.9.10/src/
H A Dtree.h62 node_t *prev_leaf(node_t *n, node_t *r);
/dports/sysutils/vector/lucet-d4fc14a03bdb99ac83173d27fddf1aca48412a86/wasmtime/cranelift/bforest/src/
H A Dpath.rs153 self.prev_leaf(pool).map(|node| { in prev()
194 fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> { in prev_leaf() method
/dports/www/geckodriver/mozilla-central-e9783a644016aa9b317887076618425586730d73/testing/geckodriver/cargo-crates/cranelift-bforest-0.44.0/src/
H A Dpath.rs153 self.prev_leaf(pool).map(|node| { in prev()
194 fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> { in prev_leaf() method
/dports/www/firefox/firefox-99.0/third_party/rust/cranelift-bforest/src/
H A Dpath.rs153 self.prev_leaf(pool).map(|node| { in prev()
194 fn prev_leaf(&mut self, pool: &NodePool<F>) -> Option<Node> { in prev_leaf() method

12