/dports/editors/helix/helix-0.5.0/cargo-crates/ropey-1.3.1/src/tree/ |
H A D | mod.rs | 52 pub(crate) const MIN_CHILDREN: usize = MAX_CHILDREN / 2; 91 pub(crate) const MIN_CHILDREN: usize = MAX_CHILDREN / 2; 99 pub(crate) use self::constants::{MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN}; 102 pub(crate) use self::test_constants::{MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN};
|
H A D | node.rs | 6 Count, NodeChildren, NodeText, TextInfo, MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN, 88 const FRAG_MIN_BYTES: usize = (MAX_BYTES * MIN_CHILDREN) + (MAX_BYTES / 32); in edit_chunk_at_char() 615 Node::Internal(ref children) => children.len() < MIN_CHILDREN, in is_undersized() 684 assert!(children.len() >= MIN_CHILDREN); in assert_node_size() 846 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in zip_fix_left() 875 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in zip_fix_right() 910 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam() 913 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam() 922 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam()
|
/dports/editors/kak-lsp/kak-lsp-11.1.0/cargo-crates/ropey-1.3.1/src/tree/ |
H A D | mod.rs | 52 pub(crate) const MIN_CHILDREN: usize = MAX_CHILDREN / 2; 91 pub(crate) const MIN_CHILDREN: usize = MAX_CHILDREN / 2; 99 pub(crate) use self::constants::{MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN}; 102 pub(crate) use self::test_constants::{MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN};
|
H A D | node.rs | 6 Count, NodeChildren, NodeText, TextInfo, MAX_BYTES, MAX_CHILDREN, MIN_BYTES, MIN_CHILDREN, 88 const FRAG_MIN_BYTES: usize = (MAX_BYTES * MIN_CHILDREN) + (MAX_BYTES / 32); in edit_chunk_at_char() 615 Node::Internal(ref children) => children.len() < MIN_CHILDREN, in is_undersized() 684 assert!(children.len() >= MIN_CHILDREN); in assert_node_size() 846 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in zip_fix_left() 875 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in zip_fix_right() 910 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam() 913 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam() 922 Node::Internal(ref children2) => children2.len() < MIN_CHILDREN, in fix_tree_seam()
|
/dports/editors/xi-core/xi-editor-0.3.0/rust/rope/src/ |
H A D | tree.rs | 23 const MIN_CHILDREN: usize = 4; const 255 NodeVal::Internal(ref nodes) => (nodes.len() >= MIN_CHILDREN), in is_ok_child() 265 let splitpoint = min(MAX_CHILDREN, n_children - MIN_CHILDREN); in merge_nodes()
|
/dports/shells/ksh93-devel/ast-cc1bca27/src/lib/libtk/generic/ |
H A D | tkTextBTree.c | 66 #define MIN_CHILDREN 6 macro 2669 minChildren = MIN_CHILDREN; 2866 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; 2868 for (i = MIN_CHILDREN-1, 2876 for (i = MIN_CHILDREN-1, 2894 while (nodePtr->numChildren < MIN_CHILDREN) {
|
/dports/shells/ksh93/ast-93u/src/lib/libtk/generic/ |
H A D | tkTextBTree.c | 66 #define MIN_CHILDREN 6 macro 2669 minChildren = MIN_CHILDREN; 2866 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; 2868 for (i = MIN_CHILDREN-1, 2876 for (i = MIN_CHILDREN-1, 2894 while (nodePtr->numChildren < MIN_CHILDREN) {
|
/dports/shells/ast-ksh/ast-ksh93v/src/lib/libtk/generic/ |
H A D | tkTextBTree.c | 66 #define MIN_CHILDREN 6 macro 2669 minChildren = MIN_CHILDREN; 2866 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; 2868 for (i = MIN_CHILDREN-1, 2876 for (i = MIN_CHILDREN-1, 2894 while (nodePtr->numChildren < MIN_CHILDREN) {
|
/dports/x11-toolkits/p5-Tk/Tk-804.035/pTk/mTk/generic/ |
H A D | tkTextBTree.c | 69 #define MIN_CHILDREN 6 macro 2814 minChildren = MIN_CHILDREN; 3011 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; 3013 for (i = MIN_CHILDREN-1, 3021 for (i = MIN_CHILDREN-1, 3039 while (nodePtr->numChildren < MIN_CHILDREN) {
|
/dports/x11-toolkits/tk87/tk8.7a5/generic/ |
H A D | tkTextBTree.c | 95 #define MIN_CHILDREN 6 macro 3930 minChildren = MIN_CHILDREN; in CheckNodeConsistency() 4160 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; in Rebalance() 4162 for (i = MIN_CHILDREN-1, in Rebalance() 4170 for (i = MIN_CHILDREN-1, in Rebalance() 4188 while (nodePtr->numChildren < MIN_CHILDREN) { in Rebalance()
|
/dports/x11-toolkits/tk86/tk8.6.12/generic/ |
H A D | tkTextBTree.c | 95 #define MIN_CHILDREN 6 macro 3930 minChildren = MIN_CHILDREN; in CheckNodeConsistency() 4160 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; in Rebalance() 4162 for (i = MIN_CHILDREN-1, in Rebalance() 4170 for (i = MIN_CHILDREN-1, in Rebalance() 4188 while (nodePtr->numChildren < MIN_CHILDREN) { in Rebalance()
|
/dports/x11-toolkits/tk85/tk8.5.19/generic/ |
H A D | tkTextBTree.c | 95 #define MIN_CHILDREN 6 macro 3912 minChildren = MIN_CHILDREN; in CheckNodeConsistency() 4142 newPtr->numChildren = nodePtr->numChildren - MIN_CHILDREN; in Rebalance() 4144 for (i = MIN_CHILDREN-1, in Rebalance() 4152 for (i = MIN_CHILDREN-1, in Rebalance() 4170 while (nodePtr->numChildren < MIN_CHILDREN) { in Rebalance()
|
/dports/x11-toolkits/gtk40/gtk-4.4.1/gtk/ |
H A D | gtktextbtree.c | 236 #define MIN_CHILDREN 6 macro 239 #define MIN_CHILDREN 3 macro 5742 new_node->num_children = node->num_children - MIN_CHILDREN; in gtk_text_btree_rebalance() 5745 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5756 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5776 while (node->num_children < MIN_CHILDREN) in gtk_text_btree_rebalance() 6655 min_children = MIN_CHILDREN; in gtk_text_btree_node_check_consistency()
|
/dports/x11-toolkits/gtk30/gtk+-3.24.31/gtk/ |
H A D | gtktextbtree.c | 243 #define MIN_CHILDREN 6 macro 246 #define MIN_CHILDREN 3 macro 5790 new_node->num_children = node->num_children - MIN_CHILDREN; in gtk_text_btree_rebalance() 5793 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5804 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5824 while (node->num_children < MIN_CHILDREN) in gtk_text_btree_rebalance() 6727 min_children = MIN_CHILDREN; in gtk_text_btree_node_check_consistency()
|
/dports/x11-toolkits/gtk20/gtk+-2.24.33/gtk/ |
H A D | gtktextbtree.c | 240 #define MIN_CHILDREN 6 macro 243 #define MIN_CHILDREN 3 macro 5755 new_node->num_children = node->num_children - MIN_CHILDREN; in gtk_text_btree_rebalance() 5758 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5769 for (i = MIN_CHILDREN-1, in gtk_text_btree_rebalance() 5789 while (node->num_children < MIN_CHILDREN) in gtk_text_btree_rebalance() 6700 min_children = MIN_CHILDREN; in gtk_text_btree_node_check_consistency()
|