Home
last modified time | relevance | path

Searched full:balanced (Results 1 – 25 of 178) sorted by relevance

12345678

/freebsd/share/man/man3/
H A Dtree.3105 .Nd "implementations of splay and rank-balanced (wavl) trees"
211 splay trees and rank-balanced (wavl) trees.
380 .Sh RANK-BALANCED TREES
381 Rank-balanced (RB) trees are a framework for defining height-balanced
398 tree; insertions lead to a tree becoming as balanced as an AVL tree.
400 A rank-balanced tree is headed by a structure defined by the
505 The rank-balanced tree can also be initialized statically by using the
611 macro should be used to check whether a rank-balanced tree is empty.
670 The following example demonstrates how to declare a rank-balanced tree
804 .%T "Rank-Balanced Trees"
/freebsd/contrib/bmake/unit-tests/
H A Dvarmod-ifelse.mk215 # parser only counted balanced '{' and '}', ignoring any escaping or other
226 # balanced-mode parsing.
233 # fixed. The modifier ':@' now parses the body in balanced mode, while
240 # is always parsed using balanced mode. The modifier ':?', on the other hand,
242 # evaluated or not. Since balanced mode and standard mode are incompatible,
243 # it's impossible to use balanced mode in the modifier ':?'.
258 # parsed in balanced mode, ignoring that the inner '}}' were ordinary
299 # 2023, the exact parsing algorithm switched a few times, counting balanced
H A Dcond-func.mk14 ${:UVAR{value}}= variable name with balanced braces
62 # They must be balanced though.
73 # They don't need to be balanced.
H A Dmoderrs.mk57 # In ParseModifierPart, braces and parentheses don't have to be balanced.
59 # braces must be balanced.
61 # used delimiter (either braces or parentheses) must be balanced.
H A Dvarname.mk8 # must be balanced. Parentheses and braces may be mixed.
27 # balanced. At the end of the line, there are still 3 levels open, which
H A Dopt-debug-for.mk15 # the "begin" and "end" events are not balanced and the nesting level
H A Ddirective-for-generating-endif.mk15 # balanced.
/freebsd/contrib/llvm-project/clang/include/clang/Lex/
H A DPPEmbedParameters.h43 /// `prefix( balanced-token-seq )`
53 /// `suffix( balanced-token-seq )`
63 /// `if_empty( balanced-token-seq )`
/freebsd/share/man/man4/
H A Dcarp.4206 .\"router itself will always be balanced to the same virtual host.
211 .\"balanced routers and a host they are serving.
215 .\"If the reply would be load balanced to second router, it will be
269 .\"In order to set up an ARP balanced virtual host, it is necessary to configure
309 .\"subsequent IP traffic will be balanced among the hosts.
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A Dregerror.c65 { REG_EBRACK, "REG_EBRACK", "brackets ([ ]) not balanced" },
66 { REG_EPAREN, "REG_EPAREN", "parentheses not balanced" },
67 { REG_EBRACE, "REG_EBRACE", "braces not balanced" },
H A DBalancedPartitioning.cpp9 // This file implements BalancedPartitioning, a recursive balanced graph
21 #define DEBUG_TYPE "balanced-partitioning"
109 LLVM_DEBUG(dbgs() << "Balanced partitioning completed\n"); in run()
/freebsd/crypto/openssl/include/internal/
H A Dquic_reactor_wait_ctx.h33 * balanced calls to enter()/leave() on a single thread) is more convenient.
61 * wait context so long as the number of calls is balanced. The last leave()
107 * been balanced with corresponding leave() calls before calling this
/freebsd/lib/libc/regex/
H A Dregerror.c89 {REG_EBRACK, "REG_EBRACK", "brackets ([ ]) not balanced"},
90 {REG_EPAREN, "REG_EPAREN", "parentheses not balanced"},
91 {REG_EBRACE, "REG_EBRACE", "braces not balanced"},
H A Dregex.3650 not balanced
654 not balanced
658 not balanced
/freebsd/contrib/nvi/regex/
H A Dregerror.c95 { REG_EBRACK, "REG_EBRACK", "brackets ([ ]) not balanced" },
96 { REG_EPAREN, "REG_EPAREN", "parentheses not balanced" },
97 { REG_EBRACE, "REG_EBRACE", "braces not balanced" },
H A Dregex.3471 REG_EBRACK brackets [ ] not balanced
472 REG_EPAREN parentheses ( ) not balanced
473 REG_EBRACE braces { } not balanced
/freebsd/sys/contrib/openzfs/module/avl/
H A Davl.c38 * almost perfectly balanced. By "almost" perfectly balanced, we mean that at
42 * This relaxation from a perfectly balanced binary tree allows doing
47 * rotations, which bring unbalanced subtrees back into the semi-balanced state.
312 * case 1 : node is overly left heavy, the left child is balanced or in avl_rotation()
341 * If child used to be left heavy (now balanced) we reduced in avl_rotation()
407 * else it is balanced in avl_rotation()
/freebsd/contrib/lutok/
H A Dtest_utils.hpp134 //ATF_FAIL(F("Stack not balanced: before %d, after %d") % in ~stack_balance_checker()
136 ATF_FAIL("Stack not balanced"); in ~stack_balance_checker()
/freebsd/sys/sys/
H A Dtree.h38 * splay trees and rank-balanced trees.
52 * A rank-balanced tree is a binary search tree with an integer
58 * Different additional conditions define different sorts of balanced trees,
61 * "Rank Balanced Trees", ACM Transactions on Algorithms Volume 11 Issue 4 June
70 * Every operation on a rank-balanced tree is bounded as O(lg n).
71 * The maximum height of a rank-balanced tree is 2lg (n+1).
307 /* Macros that define a rank-balanced tree */
500 * is not rank-balanced, or has inconsistent augmentation data.
/freebsd/lib/libc/stdlib/
H A Dtdelete.c41 * If we reach a node that is balanced, or has a child \
42 * in the opposite direction that is balanced, we know \
/freebsd/sys/contrib/device-tree/Bindings/display/bridge/
H A Dmicrochip,sam9x75-lvds.yaml15 LVDS output signals. LVDSC functions include bit mapping, balanced mode
/freebsd/sys/contrib/device-tree/Bindings/iio/frequency/
H A Dadi,admv4420.yaml13 The ADMV4420 is a highly integrated, double balanced, active
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DBalancedPartitioning.h9 // This file implements BalancedPartitioning, a recursive balanced graph
75 /// The bucket assigned by balanced partitioning
/freebsd/contrib/bc/src/
H A Ddc_lex.c95 * Parses a dc string. Since dc's strings need to check for balanced brackets,
122 // have "depth", which means we haven't completely balanced brackets in dc_lex_string()
/freebsd/sys/contrib/openzfs/man/man7/
H A Dzpoolconcepts.7175 If more than one log device is specified, then writes are load-balanced between
187 allocations are load-balanced between those devices.
194 allocations are load-balanced between those devices.

12345678