| /prebuilts/go/darwin-x86/doc/play/ |
| tree.go | 32 // Walk traverses a tree depth-first,
34 func Walk(t *Tree, ch chan int) {
38 Walk(t.Left, ch)
40 Walk(t.Right, ch)
43 // Walker launches Walk in a new goroutine,
48 Walk(t, ch)
|
| /prebuilts/go/linux-x86/doc/play/ |
| tree.go | 32 // Walk traverses a tree depth-first,
34 func Walk(t *Tree, ch chan int) {
38 Walk(t.Left, ch)
40 Walk(t.Right, ch)
43 // Walker launches Walk in a new goroutine,
48 Walk(t, ch)
|
| /prebuilts/go/darwin-x86/src/go/ast/ |
| walk.go | 9 // A Visitor's Visit method is invoked for each node encountered by Walk.
10 // If the result visitor w is not nil, Walk visits each of the children
20 Walk(v, x)
26 Walk(v, x)
32 Walk(v, x)
38 Walk(v, x)
42 // TODO(gri): Investigate if providing a closure to Walk leads to
45 // Walk traverses an AST in depth-first order: It starts by calling
47 // v.Visit(node) is not nil, Walk is invoked recursively with visitor
51 func Walk(v Visitor, node Node)
[all...] |
| /prebuilts/go/linux-x86/src/go/ast/ |
| walk.go | 9 // A Visitor's Visit method is invoked for each node encountered by Walk.
10 // If the result visitor w is not nil, Walk visits each of the children
20 Walk(v, x)
26 Walk(v, x)
32 Walk(v, x)
38 Walk(v, x)
42 // TODO(gri): Investigate if providing a closure to Walk leads to
45 // Walk traverses an AST in depth-first order: It starts by calling
47 // v.Visit(node) is not nil, Walk is invoked recursively with visitor
51 func Walk(v Visitor, node Node)
[all...] |
| /art/runtime/gc/space/ |
| bump_pointer_space-walk-inl.h | 31 inline void BumpPointerSpace::Walk(Visitor&& visitor) {
38 // on Walk to expose the interprocedural nature of locks here without having to duplicate the
63 // Walk all of the objects in the main block first.
77 // Walk the other blocks (currently only TLABs).
|
| dlmalloc_space.cc | 236 void DlMallocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
309 // To allow the Walk/InspectAll() to exclusively-lock the mutator
314 Walk(MSpaceChunkCallback, &max_contiguous_allocation);
|
| rosalloc_space.cc | 263 void RosAllocSpace::Walk(void(*callback)(void *start, void *end, size_t num_bytes, void* callback_arg),
|
| large_object_space.cc | 226 void LargeObjectMapSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
378 void FreeListSpace::Walk(DlMallocSpace::WalkCallback callback, void* arg) {
|
| /external/pdfium/core/fpdfapi/parser/ |
| cpdf_object_walker_unittest.cpp | 25 std::string Walk(CPDF_Object* object) {
58 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Null>().get()), "Null");
59 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Dictionary>().get()), "Dict");
60 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Array>().get()), "Arr");
61 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_String>().get()), "Str");
62 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Boolean>().get()), "Bool");
63 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Stream>().get()), "Stream");
64 EXPECT_EQ(Walk(pdfium::MakeUnique<CPDF_Reference>(nullptr, 0).get()), "Ref");
78 EXPECT_EQ(Walk(dict.get()), "Dict Str Bool Arr Ref Null Stream Dict Num");
|
| /build/blueprint/ |
| context_test.go | 31 Walk() bool
58 func (f *fooModule) Walk() bool {
86 func (b *barModule) Walk() bool {
194 if dep.module.logicModule.(Walker).Walk() {
201 if dep.module.logicModule.(Walker).Walk() {
|
| /external/google-breakpad/src/processor/ |
| stackwalker.cc | 105 bool Stackwalker::Walk(
109 BPLOG_IF(ERROR, !stack) << "Stackwalker::Walk requires |stack|";
113 BPLOG_IF(ERROR, !modules_without_symbols) << "Stackwalker::Walk requires "
115 BPLOG_IF(ERROR, !modules_without_symbols) << "Stackwalker::Walk requires "
141 BPLOG(INFO) << "Stack walk is interrupted.";
|
| /prebuilts/go/darwin-x86/src/path/filepath/ |
| path.go | 337 // visited by Walk. The path argument contains the argument to Walk as a
338 // prefix; that is, if Walk is called with "dir", which is a directory
339 // containing the file "a", the walk function will be called with argument
344 // to handle that error (and Walk will not descend into that directory). If
347 // on a directory, Walk skips the directory's contents entirely.
349 // Walk skips the remaining files in the containing directory.
354 // walk recursively descends path, calling walkFn.
355 func walk(path string, info os.FileInfo, walkFn WalkFunc) error { func
362 // If err != nil, walk can't walk into this directory
[all...] |
| /prebuilts/go/linux-x86/src/path/filepath/ |
| path.go | 337 // visited by Walk. The path argument contains the argument to Walk as a
338 // prefix; that is, if Walk is called with "dir", which is a directory
339 // containing the file "a", the walk function will be called with argument
344 // to handle that error (and Walk will not descend into that directory). If
347 // on a directory, Walk skips the directory's contents entirely.
349 // Walk skips the remaining files in the containing directory.
354 // walk recursively descends path, calling walkFn.
355 func walk(path string, info os.FileInfo, walkFn WalkFunc) error { func
362 // If err != nil, walk can't walk into this directory
[all...] |
| /art/runtime/gc/accounting/ |
| space_bitmap-inl.h | 165 void SpaceBitmap<kAlignment>::Walk(Visitor&& visitor) {
|
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
| BaseOrderedCollectionRedBlackTreeLib.c | 308 RED_BLACK_TREE_NODE *Walk;
319 Walk = Node->Right;
320 if (Walk != NULL) {
321 while (Walk->Left != NULL) {
322 Walk = Walk->Left;
324 return Walk;
332 Walk = Child->Parent;
333 while (Walk != NULL && Child == Walk->Right) {
[all...] |
| /prebuilts/go/darwin-x86/src/net/ |
| dnsmsg.go | 10 // Each message structure has a Walk method that is used by
74 // Walk iterates over fields of a structure and calls f
80 // Whenever f returns false, Walk must stop and return
82 Walk(f func(v interface{}, name, tag string) (ok bool)) (ok bool)
92 func (h *dnsHeader) Walk(f func(v interface{}, name, tag string) bool) bool {
117 func (q *dnsQuestion) Walk(f func(v interface{}, name, tag string) bool) bool {
138 func (h *dnsRR_Header) Walk(f func(v interface{}, name, tag string) bool) bool {
162 func (rr *dnsRR_CNAME) Walk(f func(v interface{}, name, tag string) bool) bool {
163 return rr.Hdr.Walk(f) && f(&rr.Cname, "Cname", "domain")
176 func (rr *dnsRR_MX) Walk(f func(v interface{}, name, tag string) bool) bool
[all...] |
| /prebuilts/go/linux-x86/src/net/ |
| dnsmsg.go | 10 // Each message structure has a Walk method that is used by
74 // Walk iterates over fields of a structure and calls f
80 // Whenever f returns false, Walk must stop and return
82 Walk(f func(v interface{}, name, tag string) (ok bool)) (ok bool)
92 func (h *dnsHeader) Walk(f func(v interface{}, name, tag string) bool) bool {
117 func (q *dnsQuestion) Walk(f func(v interface{}, name, tag string) bool) bool {
138 func (h *dnsRR_Header) Walk(f func(v interface{}, name, tag string) bool) bool {
162 func (rr *dnsRR_CNAME) Walk(f func(v interface{}, name, tag string) bool) bool {
163 return rr.Hdr.Walk(f) && f(&rr.Cname, "Cname", "domain")
176 func (rr *dnsRR_MX) Walk(f func(v interface{}, name, tag string) bool) bool
[all...] |
| /art/oatdump/ |
| oatdump.cc | 203 Walk();
233 void Walk() {
275 // Note: even if this is an interface or a native class, we still have to walk it, as there
[all...] |
