| /external/chromium-trace/catapult/telemetry/third_party/altgraph/ |
| README.txt | 2 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| README.chromium | 9 constructing graphs, BFS and DFS traversals, topological sort, shortest paths,
|
| /external/kernel-headers/original/uapi/linux/ |
| bfs_fs.h | 2 * include/linux/bfs_fs.h - BFS data structures on disk.
22 /* BFS inode layout on disk */
49 /* BFS superblock layout on disk */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/sysroot/usr/include/linux/ |
| bfs_fs.h | 2 * include/linux/bfs_fs.h - BFS data structures on disk.
22 /* BFS inode layout on disk */
49 /* BFS superblock layout on disk */
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/sysroot/usr/include/linux/ |
| bfs_fs.h | 2 * include/linux/bfs_fs.h - BFS data structures on disk.
22 /* BFS inode layout on disk */
49 /* BFS superblock layout on disk */
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/cr16/ |
| bcc_test.s | 16 bfs *+0x09a
35 bfs *+0x0f9a
53 bfs *+0x660f9a
|
| bcc_test.d | 17 e: 8d 14 bfs \*\+0xa8 <main\+0xa8>:s
33 48: 80 18 9a 0f bfs \*\+0xfe2 <main\+0xfe2>:m
56 94: 10 00 86 06 bfs \*\+0x66102e <main\+0x66102e>:l
|
| /toolchain/binutils/binutils-2.25/gas/testsuite/gas/crx/ |
| br_insn.s | 56 .global bfs
57 bfs: label
58 bfs *+0x2 label
59 bfs *+0177776 label
60 bfs *+0200000 label
|
| br_insn.d | 55 0000005a <bfs>:
56 5a: 01 78 bfs 0x[0-9a-f]* [-_<>+0-9a-z]*
57 5c: 7e 78 ff 7f bfs 0x[0-9a-f]* [-_<>+0-9a-z]*
58 60: 7f 78 00 00 bfs 0x[0-9a-f]* [-_<>+0-9a-z]*
|
| /external/iputils/ |
| tftpsubs.c | 64 } bfs[2]; variable in typeref:struct:bf
89 bfs[0].counter = BF_ALLOC; /* pass out the first buffer */
91 bfs[1].counter = BF_FREE;
93 return (struct tftphdr *)bfs[0].buf;
104 bfs[current].counter = BF_FREE; /* free old one */
107 b = &bfs[current]; /* look at new buffer */
129 b = &bfs[nextone]; /* look at "next" buffer */
169 bfs[current].counter = ct; /* set size of data to write */
171 if (bfs[current].counter != BF_FREE) /* if not free */
173 bfs[current].counter = BF_ALLOC; /* mark as alloc'd *
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| regex_executor.h | 48 * The %_Executor class has two modes: DFS mode and BFS mode, controlled
150 // Used in BFS, saving states that need to be considered for the next
153 // Used in BFS, indicating that which state is already visited.
|
| regex.tcc | 72 // quantifiers (*, +, ?), the BFS executor will be used, other wise
74 // bound, but better best-case performace. Meanwhile, BFS executor can
78 // For simple regex, BFS executor could be 2 or more times slower than
81 // Of course, BFS executor cannot handle back-references.
|
| regex_executor.tcc | 56 // This function operates in different modes, DFS mode or BFS mode, indicated
80 // BFS mode:
|
| /ndk/build/core/ |
| definitions-graph.mk | 421 $(eval bfs_deps := $$(call -ndk-mod-get-bfs-depends,A,-local-get-deps))\
431 $(eval bfs_deps := $$(call -ndk-mod-get-bfs-depends,A,-local-get-deps))\
448 -ndk-mod-get-bfs-list = $(strip \
454 $(call -ndk-mod-bfs-recursive) \
460 -ndk-mod-bfs-recursive = \
461 $(call -ndk-mod-debug,-ndk-mod-bfs-recursive wq='$(_ndk_mod_wq)' list='$(_ndk_mod_list)' visited='$(_ndk_mod_tree_visitors)')\
472 $(if $(_ndk_mod_wq),$(call -ndk-mod-bfs-recursive))
474 -test-ndk-mod-get-bfs-list.empty = \
476 $(call test-expect,,$(call -ndk-mod-get-bfs-list,,-local-deps))
478 -test-ndk-mod-get-bfs-list.A =
[all...] |
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph_tests/ |
| test_altgraph.py | 29 # do a forward bfs
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/doc/ |
| index.rst | 10 graphs, BFS and DFS traversals, topological sort, shortest paths, etc. with
|
| core.rst | 17 includes methods for constructing graphs, BFS and DFS traversals,
|
| /external/curl/tests/server/ |
| tftpd.c | 185 static struct bf bfs[2]; variable in typeref:struct:bf
433 bfs[0].counter = BF_ALLOC; /* pass out the first buffer */
435 bfs[1].counter = BF_FREE;
437 return &bfs[0].buf.hdr;
458 bfs[current].counter = BF_FREE; /* free old one */
461 b = &bfs[current]; /* look at new buffer */
482 b = &bfs[nextone]; /* look at "next" buffer */
536 bfs[current].counter = ct; /* set size of data to write */
538 if (bfs[current].counter != BF_FREE) /* if not free */
540 bfs[current].counter = BF_ALLOC; /* mark as alloc'd *
[all...] |
| /external/toybox/tests/ |
| blkid.test | 43 #adfs bfs btrfs cramfs jfs nilfs romfs
|
| /external/chromium-trace/catapult/telemetry/third_party/altgraph/altgraph/ |
| __init__.py | 15 includes methods for constructing graphs, BFS and DFS traversals,
68 # do a forward bfs from 1 at most to 20
|
| Graph.py | 450 Private method creates a subgraph in a bfs order.
555 # the direction of the bfs depends on the edges that are sampled
577 Returns a list of nodes in some forward BFS order.
586 Returns a list of nodes in some backward BFS order.
|
| /external/ceres-solver/internal/ceres/ |
| graph_algorithms.h | 89 // Given a undirected graph G(V,E), the algorithm is a greedy BFS
105 // Colors for labeling the graph during the BFS.
179 // Colors for labeling the graph during the BFS.
|
| /external/toybox/toys/other/ |
| blkid.c | 44 {"bfs", 0x1badface, 4, 0, 0,0,0},
|
| /frameworks/minikin/tools/ |
| mk_hyb_file.py | 225 # return list of nodes in bfs order
226 def bfs(self, ch_map): member in class:Hyph
402 bfs = hyph.bfs(ch_map)
|
| /prebuilts/go/darwin-x86/src/internal/trace/ |
| goroutines.go | 162 // BFS of depth 2 over "unblock" edges
|
