/dports/accessibility/accerciser/accerciser-3.38.0/src/lib/accerciser/ |
H A D | accessible_treeview.py | 537 def _onCursorChanged(self, tree): argument
|
/dports/accessibility/at-spi2-atk/at-spi2-atk-2.34.2/atk-adaptor/adaptors/ |
H A D | collection-adaptor.c | 966 dbus_uint32_t tree; in impl_GetMatchesFrom() local 1027 dbus_uint32_t tree; in impl_GetMatchesTo() local
|
/dports/accessibility/at-spi2-core/at-spi2-core-2.36.0/atspi/ |
H A D | atspi-collection.c | 174 AtspiCollectionTreeTraversalType tree, in atspi_collection_get_matches_to() 231 AtspiCollectionTreeTraversalType tree, in atspi_collection_get_matches_from()
|
/dports/accessibility/caribou/caribou-0.4.21/tools/ |
H A D | convert_cldr.py | 30 def convert(source, tree): argument
|
/dports/accessibility/py-atspi/pyatspi-2.38.1/pyatspi/ |
H A D | collection.py | 98 def getMatchesTo(self, current_object, rule, sortby, tree, recurse, count, traverse): argument 101 def getMatchesFrom(self, current_object, rule, sortby, tree, count, traverse): argument
|
/dports/accessibility/wl-gammarelay-rs/wl-gammarelay-rs-0.2.1/cargo-crates/syn-1.0.86/src/ |
H A D | buffer.rs | 335 let tree = match self.entry() { in token_tree() localVariable
|
/dports/accessibility/yasr/yasr-0.6.9/yasr/ |
H A D | option.c | 89 void opt_add(void *ptr, int tree, char *name, int type, ...) in opt_add()
|
H A D | yasr.h | 187 int tree; member
|
/dports/archivers/7-zip/7-zip-21.07/CPP/7zip/Archive/Wim/ |
H A D | WimHandlerOut.cpp | 522 void CDb::WriteTree(const CDir &tree, Byte *dest, size_t &pos) const in WriteTree() argument 554 void CDb::WriteOrderList(const CDir &tree) in WriteOrderList() 1761 const CDir &tree = trees[i]; in UpdateItems() local 1865 CDir &tree = trees[i]; in UpdateItems() local
|
/dports/archivers/arj/arj-3.10.22/ |
H A D | encode.c | 38 unsigned char *tree=NULL; variable
|
/dports/archivers/brotli/brotli-1.0.9/c/enc/ |
H A D | brotli_bit_stream.c | 284 HuffmanTree* tree, in BrotliStoreHuffmanTree() 351 HuffmanTree* tree, in BuildAndStoreHuffmanTree() 436 HuffmanTree* tree = BROTLI_ALLOC(m, HuffmanTree, max_tree_size); in BrotliBuildAndStoreHuffmanTreeFast() local 684 HuffmanTree* tree, in EncodeContextMap() 760 HuffmanTree* tree, in BuildAndStoreBlockSplitCode() 792 HuffmanTree* tree, in StoreTrivialContextMap() 866 HuffmanTree* tree, size_t* storage_ix, uint8_t* storage) { in BuildAndStoreBlockSwitchEntropyCodes() 946 HuffmanTree* tree; in BrotliStoreMetaBlock() local 1148 HuffmanTree* tree; in BrotliStoreMetaBlockTrivial() local
|
H A D | compress_fragment.c | 131 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
H A D | compress_fragment_two_pass.c | 74 HuffmanTree tree[129]; in BuildAndStoreCommandPrefixCode() local
|
H A D | entropy_encode.c | 74 HuffmanTree* tree, in BrotliCreateHuffmanTree() 168 uint8_t* tree, in BrotliWriteHuffmanTreeRepetitions() 211 uint8_t* tree, in BrotliWriteHuffmanTreeRepetitionsZeros() 408 uint8_t* tree, in BrotliWriteHuffmanTree()
|
/dports/archivers/c-blosc/c-blosc-1.21.0/internal-complibs/zlib-1.2.8/ |
H A D | trees.c | 163 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 167 # define send_code(s, c, tree) \ argument 432 #define pqremove(s, tree, top) \ argument 443 #define smaller(tree, n, m, depth) \ argument 453 local void pqdownheap(s, tree, k) in pqdownheap() argument 492 ct_data *tree = desc->dyn_tree; local 575 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument 621 ct_data *tree = desc->dyn_tree; local 705 local void scan_tree (s, tree, max_code) in scan_tree() argument 750 local void send_tree (s, tree, max_code) in send_tree() argument
|
/dports/archivers/c-blosc/c-blosc-1.21.0/internal-complibs/zstd-1.4.8/compress/ |
H A D | huf_compress.c | 494 size_t HUF_buildCTable_wksp (HUF_CElt* tree, const unsigned* count, U32 maxSymbolValue, U32 maxNbBi… in HUF_buildCTable_wksp() 888 size_t HUF_buildCTable (HUF_CElt* tree, const unsigned* count, unsigned maxSymbolValue, unsigned ma… in HUF_buildCTable()
|
/dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zlib-ng-2.0.5/ |
H A D | trees.c | 131 #define pqremove(s, tree, top) \ argument 142 #define smaller(tree, n, m, depth) \ argument 152 static void pqdownheap(deflate_state *s, ct_data *tree, int k) { in pqdownheap() 188 ct_data *tree = desc->dyn_tree; in gen_bitlen() local 281 Z_INTERNAL void gen_codes(ct_data *tree, int max_code, uint16_t *bl_count) { in gen_codes() 325 ct_data *tree = desc->dyn_tree; in build_tree() local 412 static void scan_tree(deflate_state *s, ct_data *tree, int max_code) { in scan_tree() 460 static void send_tree(deflate_state *s, ct_data *tree, int max_code) { in send_tree()
|
H A D | trees_emit.h | 66 # define send_code(s, c, tree, bi_buf, bi_valid) { \ argument 71 # define send_code(s, c, tree, bi_buf, bi_valid) \ argument
|
/dports/archivers/c-blosc2/c-blosc2-2.0.4/internal-complibs/zstd-1.5.0/compress/ |
H A D | huf_compress.c | 513 size_t HUF_buildCTable_wksp (HUF_CElt* tree, const unsigned* count, U32 maxSymbolValue, U32 maxNbBi… in HUF_buildCTable_wksp() 911 size_t HUF_buildCTable (HUF_CElt* tree, const unsigned* count, unsigned maxSymbolValue, unsigned ma… in HUF_buildCTable()
|
/dports/archivers/dpkg/dpkg-1.19.7/dpkg-deb/ |
H A D | build.c | 62 struct treeroot *tree; in control_treewalk_feed() local 155 struct treeroot *tree; in file_treewalk_feed() local
|
/dports/archivers/dpkg/dpkg-1.19.7/lib/dpkg/ |
H A D | treewalk.c | 307 treeroot_set_curdir(struct treeroot *tree, struct treenode *node) in treeroot_set_curdir() 313 treeroot_set_curnode(struct treeroot *tree, struct treenode *node) in treeroot_set_curnode() 319 treeroot_skip_node(struct treeroot *tree, struct treenode *node) in treeroot_skip_node() 328 treeroot_fill_node(struct treeroot *tree, struct treenode *dir) in treeroot_fill_node() 334 treeroot_sort_node(struct treeroot *tree, struct treenode *dir) in treeroot_sort_node() 347 treeroot_visit_node(struct treeroot *tree, struct treenode *node) in treeroot_visit_node() 367 struct treeroot *tree; in treewalk_open() local 409 treewalk_node(struct treeroot *tree) in treewalk_node() 435 treewalk_next(struct treeroot *tree) in treewalk_next() 506 treewalk_close(struct treeroot *tree) in treewalk_close() [all …]
|
/dports/archivers/dpkg/dpkg-1.19.7/src/ |
H A D | archives.c | 1487 struct treeroot *tree; in archivefiles() local
|
/dports/archivers/dzip/dzip-2.9/zlib/ |
H A D | infcodes.c | 40 inflate_huft *tree; /* pointer into tree */ member
|
H A D | trees.c | 167 # define send_code(s, c, tree) send_bits(s, tree[c].Code, tree[c].Len) argument 171 # define send_code(s, c, tree) \ argument 435 #define pqremove(s, tree, top) \ argument 446 #define smaller(tree, n, m, depth) \ argument 456 local void pqdownheap(s, tree, k) in pqdownheap() argument 495 ct_data *tree = desc->dyn_tree; local 578 local void gen_codes (tree, max_code, bl_count) in gen_codes() argument 624 ct_data *tree = desc->dyn_tree; local 707 local void scan_tree (s, tree, max_code) in scan_tree() argument 752 local void send_tree (s, tree, max_code) in send_tree() argument
|
/dports/archivers/gtar/tar-1.34/gnu/ |
H A D | regcomp.c | 1348 bin_tree_t *op, *cls, *tree1, *tree; in lower_subexp() local 2123 bin_tree_t *tree, *eor, *root; in parse() local 2157 bin_tree_t *tree, *branch = NULL; in parse_reg_exp() local 2205 bin_tree_t *tree, *expr; in parse_branch() local 2251 bin_tree_t *tree; in parse_expression() local 2485 bin_tree_t *tree; in parse_sub_exp() local 2527 bin_tree_t *tree = NULL, *old_tree = NULL; in parse_dup_op() local 3659 bin_tree_t *tree; in build_charclass_op() local 3808 bin_tree_t *tree; in create_token_tree() local
|