| /third_party/node/deps/npm/node_modules/fs-vacuum/ |
| D | vacuum.js | 14 function vacuum (leaf, options, cb) { argument
15 assert(typeof leaf === 'string', 'must pass in path to remove')
23 leaf = leaf && resolve(leaf)
25 if (base && !isInside(leaf, base)) {
26 return cb(new Error(leaf + ' is not a child of ' + base))
29 lstat(leaf, function (error, stat) {
38 log(leaf, 'is not a directory, file, or link')
39 return cb(new Error(leaf + ' is not a directory, file, or link'))
43 log('purging', leaf)
44 rimraf(leaf, function (error) {
[all …]
|
| /third_party/e2fsprogs/lib/ext2fs/ |
| D | nls_utf8.c | 487 utf8leaf_t *leaf;
496 leaf = utf8lookup(data, hangul, s);
497 if (!leaf)
500 leaf_age = utf8agetab[LEAF_GEN(leaf)];
517 utf8leaf_t *leaf;
526 leaf = utf8lookup(data, hangul, s);
527 if (!leaf)
529 leaf_age = utf8agetab[LEAF_GEN(leaf)];
545 utf8leaf_t *leaf;
554 leaf = utf8nlookup(data, hangul, s, len);
[all …]
|
| /third_party/f2fs-tools/lib/ |
| D | nls_utf8.c | 485 utf8leaf_t *leaf;
494 leaf = utf8lookup(data, hangul, s);
495 if (!leaf)
498 leaf_age = utf8agetab[LEAF_GEN(leaf)];
515 utf8leaf_t *leaf;
524 leaf = utf8lookup(data, hangul, s);
525 if (!leaf)
527 leaf_age = utf8agetab[LEAF_GEN(leaf)];
543 utf8leaf_t *leaf;
552 leaf = utf8nlookup(data, hangul, s, len);
[all …]
|
| /third_party/boost/libs/coroutine/example/asymmetric/ |
| D | tree.h | 25 struct leaf;
32 virtual void visit( leaf & l) = 0;
72 struct leaf : public node struct
77 { return ptr_t( new leaf( value_) ); } in create() argument
79 leaf( std::string const& value_) : in leaf() argument
88 bool operator==( leaf const& l, leaf const& r) argument
92 bool operator!=( leaf const& l, leaf const& r)
98 boost::coroutines::asymmetric_coroutine< leaf & >::push_type & c_;
101 tree_visitor( boost::coroutines::asymmetric_coroutine< leaf & >::push_type & c) : in tree_visitor()
111 void visit( leaf & l) in visit()
[all …]
|
| /third_party/boost/libs/coroutine2/example/ |
| D | tree.h | 23 struct leaf;
30 virtual void visit( leaf & l) = 0;
70 struct leaf : public node struct
75 { return ptr_t( new leaf( value_) ); } in create() argument
77 leaf( std::string const& value_) : in leaf() function
86 bool operator==( leaf const& l, leaf const& r) argument
90 bool operator!=( leaf const& l, leaf const& r)
|
| /third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/ |
| D | cord_rep_btree_test.cc | 192 CordRepBtree* leaf = CordRepBtree::Create(MakeHexFlat(0)); in MakeLeaf() local
194 leaf = CordRepBtree::Append(leaf, MakeHexFlat(i)); in MakeLeaf()
196 return leaf; in MakeLeaf()
351 auto* leaf = CordRepBtree::Create(flat); in TEST() local
352 EXPECT_THAT(leaf->size(), Eq(1)); in TEST()
353 EXPECT_THAT(leaf->height(), Eq(0)); in TEST()
354 EXPECT_THAT(leaf->Edges(), ElementsAre(flat)); in TEST()
355 CordRepBtree::Unref(leaf); in TEST()
359 auto* leaf = CordRepBtree::Create(MakeFlat("a")); in TEST() local
360 CordRepBtree* tree = CordRepBtree::New(leaf); in TEST()
[all …]
|
| /third_party/e2fsprogs/util/ |
| D | mkutf8data.c | 381 void *leaf = NULL; in lookup() local
384 while (!leaf && node) { in lookup()
392 leaf = node->right; in lookup()
401 leaf = node->left; in lookup()
408 return leaf; in lookup()
531 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() argument
557 *cursor = leaf; in insert()
575 leaf = node->left; in insert()
580 tree->root = leaf; in insert()
583 parent->left = leaf; in insert()
[all …]
|
| /third_party/boringssl/src/crypto/x509/ |
| D | x509_test.cc | 990 static int Verify(X509 *leaf, const std::vector<X509 *> &roots, in Verify() argument
1020 ctx.get(), store.get(), leaf, in Verify()
1050 static int Verify(X509 *leaf, const std::vector<X509 *> &roots, in Verify() argument
1055 Verify(leaf, roots, intermediates, crls, flags, false, nullptr); in Verify()
1057 Verify(leaf, roots, intermediates, crls, flags, true, nullptr); in Verify()
1077 bssl::UniquePtr<X509> leaf(CertFromPEM(kLeafPEM)); in TEST() local
1086 ASSERT_TRUE(leaf); in TEST()
1093 Verify(leaf.get(), empty, empty, empty_crls)); in TEST()
1095 Verify(leaf.get(), empty, {intermediate.get()}, empty_crls)); in TEST()
1098 Verify(leaf.get(), {root.get()}, {intermediate.get()}, empty_crls)); in TEST()
[all …]
|
| /third_party/boost/tools/inspect/ |
| D | path_name_check.cpp | 43 string const leaf( full_path.leaf().string() ); in inspect() local
46 if ( (pos = leaf.find_first_not_of( allowable )) != string::npos ) in inspect()
51 + leaf[pos] + "'" ); in inspect()
55 if ( std::strchr( initial_char, leaf[0] ) == 0 ) in inspect()
65 if ( std::strchr( leaf.c_str(), '.' ) ) in inspect()
|
| /third_party/boost/boost/property_tree/json_parser/detail/ |
| D | standard_callbacks.hpp | 71 if (stack.back().k == leaf) stack.pop_back(); in on_end_array()
80 if (stack.back().k == leaf) stack.pop_back(); in on_end_object()
101 enum kind { array, object, key, leaf }; enumerator
107 layer l = {leaf, &root}; in new_tree()
115 layer nl = {leaf, &l.t->back().second}; in new_tree()
125 layer nl = {leaf, &l.t->back().second}; in new_tree()
129 case leaf: in new_tree()
138 case leaf: in new_value()
|
| /third_party/boost/libs/ptr_container/test/ |
| D | tree_test.cpp | 113 class leaf : public node class
133 leaf() : data( T() ) in leaf() function in leaf
136 leaf( const T& r ) : data(r) in leaf() function in leaf
244 node1.add_child( new leaf<string>( "leaf 1" ) ); in test_tree()
245 node1.add_child( new leaf<int>( 42 ) ); in test_tree()
247 node2.add_child( new leaf<float>( 42.0f ) ); in test_tree()
248 node2.add_child( new leaf<string>( "leaf 4" ) ); in test_tree()
255 root.add_child( new leaf<string>( "leaf 5" ) ); in test_tree()
261 leaf<int>& the_leaf = dynamic_cast< leaf<int>& >( *a_leaf ); in test_tree()
|
| /third_party/boost/boost/geometry/index/detail/rtree/visitors/ |
| D | copy.hpp | 32 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::visitors::copy
70 inline void operator()(leaf & l) in operator ()()
72 …node_pointer raw_new_node = rtree::create_node<allocators_type, leaf>::apply(m_allocators); … in operator ()()
75 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
78 elements_type & elements_dst = rtree::elements(rtree::get<leaf>(*new_node)); in operator ()()
|
| D | destroy.hpp | 29 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::visitors::destroy
59 inline void operator()(leaf & l) in operator ()()
62 BOOST_GEOMETRY_INDEX_ASSERT(&l == &rtree::get<leaf>(*m_current_node), "invalid pointers"); in operator ()()
64 rtree::destroy_node<allocators_type, leaf>::apply(m_allocators, m_current_node); in operator ()()
|
| D | spatial_query.hpp | 34 typedef typename MembersHolder::leaf leaf; typedef
65 inline void operator()(leaf const& n) in operator ()()
67 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
112 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::visitors::spatial_query_incremental
119 typedef typename rtree::elements_type<leaf>::type leaf_elements;
120 typedef typename rtree::elements_type<leaf>::type::const_iterator leaf_iterator;
148 inline void operator()(leaf const& n) in operator ()()
|
| D | children_box.hpp | 31 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::visitors::children_box
49 inline void operator()(leaf const& n) in operator ()()
51 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
|
| D | is_leaf.hpp | 27 typedef typename MembersHolder::leaf leaf; typedef
38 inline void operator()(leaf const&) in operator ()()
|
| D | iterator.hpp | 25 …typedef typename rtree::leaf<Value, typename Options::parameters_type, Box, Allocators, typename O… typedef in boost::geometry::index::detail::rtree::visitors::iterator
32 typedef typename rtree::elements_type<leaf>::type leaf_elements;
33 typedef typename rtree::elements_type<leaf>::type::const_iterator leaf_iterator;
48 inline void operator()(leaf const& n) in operator ()()
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/IR/ |
| D | Metadata.def | 27 // Handler for leaf nodes in the class hierarchy.
32 // Handler for non-leaf nodes in the class hierarchy.
37 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
50 // Handler for leaf nodes under MDNode.
55 // Handler for leaf nodes under MDNode.
60 // Handler for non-leaf nodes under MDNode.
65 // Handler for specialized leaf nodes under MDNode.
70 // Handler for specialized non-leaf nodes under MDNode.
|
| /third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/IR/ |
| D | Metadata.def | 28 // Handler for leaf nodes in the class hierarchy.
33 // Handler for non-leaf nodes in the class hierarchy.
38 // Handler for specialized and uniquable leaf nodes under MDNode. Defers to
51 // Handler for leaf nodes under MDNode.
56 // Handler for leaf nodes under MDNode.
61 // Handler for non-leaf nodes under MDNode.
66 // Handler for specialized leaf nodes under MDNode.
71 // Handler for specialized non-leaf nodes under MDNode.
|
| /third_party/uboot/u-boot-2020.01/test/py/tests/ |
| D | test_bind.py | 10 leaf = ' ' * 4 * depth;
12 leaf = leaf + r'\|'
14 leaf = leaf + '`'
15 leaf = leaf + '-- ' + name
17 .format(uclass, drv, leaf))
|
| /third_party/protobuf/java/core/src/test/java/com/google/protobuf/ |
| D | IsValidUtf8Test.java | 135 ByteString leaf = factory.newByteString(realBytes); in assertValidUtf8() local
136 ByteString sub = leaf.substring(0, bytes.length); in assertValidUtf8()
137 assertTrue(not ^ leaf.isValidUtf8()); in assertValidUtf8()
140 RopeByteString.newInstanceForTest(ByteString.EMPTY, leaf), in assertValidUtf8()
142 RopeByteString.newInstanceForTest(leaf, ByteString.EMPTY), in assertValidUtf8()
144 RopeByteString.newInstanceForTest(sub, leaf) in assertValidUtf8()
|
| /third_party/boost/boost/geometry/index/detail/rtree/rstar/ |
| D | insert.hpp | 70 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::visitors::rstar::remove_elements_to_reinsert
217 typename rtree::leaf<
234 typedef typename base::leaf leaf; typedef
319 inline void recalculate_aabb(leaf const& n) const in recalculate_aabb()
344 typedef typename base::leaf leaf; typedef
418 inline void operator()(leaf &) in operator ()()
431 typedef typename base::leaf leaf; typedef
469 inline void operator()(leaf & n) in operator ()()
490 typedef typename base::leaf leaf; typedef
523 inline void operator()(leaf & n) in operator ()()
[all …]
|
| /third_party/skia/third_party/externals/tint/test/unittest/reader/spirv/ |
| D | SpvParserTest_EmitFunctions_CalleePrecedesCaller.spvasm | 13 OpName %leaf "leaf"
30 %leaf_result = OpFunctionCall %uint %leaf
33 %leaf = OpFunction %uint None %12
|
| /third_party/boost/boost/geometry/index/detail/rtree/utilities/ |
| D | are_levels_ok.hpp | 29 typedef typename MembersHolder::leaf leaf; typedef in boost::geometry::index::detail::rtree::utilities::visitors::are_levels_ok
62 inline void operator()(leaf const& n) in operator ()()
64 typedef typename rtree::elements_type<leaf>::type elements_type; in operator ()()
|
| /third_party/uboot/u-boot-2020.01/fs/btrfs/ |
| D | ctree.h | 256 struct btrfs_leaf leaf; member
286 return &p->nodes[0]->leaf.items[p->slots[0]].key; in btrfs_path_leaf_key()
313 return p->nodes[0]->leaf.items[p->slots[0]].size; in btrfs_path_item_size()
316 static inline void *btrfs_leaf_data(struct btrfs_leaf *leaf, u32 slot) in btrfs_leaf_data() argument
318 return ((u8 *) leaf) + sizeof(struct btrfs_header) in btrfs_leaf_data()
319 + leaf->items[slot].offset; in btrfs_leaf_data()
324 return btrfs_leaf_data(&p->nodes[0]->leaf, p->slots[0]); in btrfs_path_leaf_data()
|