| /external/libutf/ |
| utfdef.h | 14 #define nil ((void*)0) macro
|
| /external/clang/test/Index/ |
| complete-macros.c | 4 #define nil 0 macro
13 int *ip = nil;
14 ip = nil;
15 g(nil);
35 // CHECK-CC2: macro definition:{TypedText nil} (32)
38 // CHECK-CC3: macro definition:{TypedText nil} (65)
|
| /external/clang/test/SemaTemplate/ |
| example-typelist.cpp | 5 struct nil { }; struct
7 template<typename Head, typename Tail = nil>
33 struct length<nil> {
66 class reverse<nil> {
68 typedef nil type;
91 struct find<nil, T> {
92 typedef nil type;
98 int find1[is_same<find<unsigned_inttypes, int>::type, nil>::value? 1 : -1];
|
| /external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/tree/ |
| BaseTreeAdaptor.as | 18 public function nil():Object { function
82 /** If oldRoot is a nil root, just copy or move the children to newRoot.
83 * If not a nil root, make oldRoot a child of newRoot.
85 * old=^(nil a b c), new=r yields ^(r a b c)
88 * If newRoot is a nil-rooted single child tree, use the single
91 * old=^(nil a b c), new=^(nil r) yields ^(r a b c)
92 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c))
97 * old=null, new=^(nil r) yields ^(nil r
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreeAdaptor.java | 62 /** Return a nil node (an empty but non-null node) that can hold
64 * use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
66 public Object nil(); method in interface:TreeAdaptor
84 /** Is tree considered a nil node used to make lists of child nodes? */
96 /** If oldRoot is a nil root, just copy or move the children to newRoot.
97 * If not a nil root, make oldRoot a child of newRoot.
99 * old=^(nil a b c), new=r yields ^(r a b c)
102 * If newRoot is a nil-rooted single child tree, use the single
105 * old=^(nil a b c), new=^(nil r) yields ^(r a b c
[all...] |
| BaseTreeAdaptor.java | 46 public Object nil() { method in class:BaseTreeAdaptor
111 /** If oldRoot is a nil root, just copy or move the children to newRoot.
112 * If not a nil root, make oldRoot a child of newRoot.
114 * old=^(nil a b c), new=r yields ^(r a b c)
117 * If newRoot is a nil-rooted single child tree, use the single
120 * old=^(nil a b c), new=^(nil r) yields ^(r a b c)
121 * old=^(a b c), new=^(nil r) yields ^(r ^(a b c))
126 * old=null, new=^(nil r) yields ^(nil r
[all...] |
| /external/clang/test/ARCMT/ |
| Common.h | 12 #define nil ((void*) 0) macro
|
| /external/clang/test/Sema/ |
| conditional-expr.c | 87 #define nil ((void*) 0) macro
93 return a ? f1() : nil; // expected-warning {{pointer/integer type mismatch in conditional expression ('int' and 'void *')}} expected-warning {{incompatible pointer to integer conversion returning 'void *' from a function with result type 'int'}}
|
| /ndk/tests/device/issue42891-boost-1_52/jni/boost/boost/test/utils/ |
| named_params.hpp | 64 // ************** nil ************** //
67 struct nil { struct in namespace:boost::nfp::nfp_detail
81 nil operator()( Arg1 const& )
82 { report_access_to_invalid_parameter(); return nil(); }
85 nil operator()( Arg1 const&, Arg2 const& )
86 { report_access_to_invalid_parameter(); return nil(); }
89 nil operator()( Arg1 const&, Arg2 const&, Arg3 const& )
90 { report_access_to_invalid_parameter(); return nil(); }
96 static nil& inst() { static nil s_inst; return s_inst;
98 nil() {} function in struct:boost::nfp::nfp_detail::nil
[all...] |
| /external/emma/core/java12/com/vladium/emma/report/ |
| IItemAttribute.java | 180 final double nil = il.getAggregate (m_numeratorAggregateID); local
186 final double diff = nil * dig - nig * dil;
|
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
| DebugTreeAdaptor.java | 102 public Object nil() { method in class:DebugTreeAdaptor
103 Object node = adaptor.nil();
|
| /external/antlr/antlr-3.4/runtime/Python/antlr3/ |
| debug.py | 272 def nil(self): member in class:DebugTreeAdaptor
273 node = self.adaptor.nil()
658 """A nil was created (even nil nodes have a unique ID...
[all...] |
| tree.py | 173 is nil, add all children of t to this' children.
180 """Set ith child (0..n-1) to t; t must be non-null and non-nil node"""
192 a list (nil-root tree). num of children can increase or decrease.
202 Indicates the node is a nil node but may still have children, meaning
312 def nil(self): member in class:TreeAdaptor
314 Return a nil node (an empty but non-null node) that can hold
316 use "t=adaptor.nil(); t.addChild(x); t.addChild(y);"
343 """Is tree considered a nil node used to make lists of child nodes?"""
363 If oldRoot is a nil root, just copy or move the children to newRoot.
364 If not a nil root, make oldRoot a child of newRoot
968 def nil(self): member in class:BaseTreeAdaptor
[all...] |
| /external/e2fsprogs/e2fsck/ |
| dict.c | 94 the sentinel nil node, and root->parent->left points back to root */
138 static void free_nodes(dict_t *dict, dnode_t *node, dnode_t *nil)
140 if (node == nil)
142 free_nodes(dict, node->left, nil);
143 free_nodes(dict, node->right, nil);
185 * mismatches. It does not check for every nil node being black, because there
186 * is only one sentinel nil node. The return value of this function is the
191 static unsigned int verify_redblack(dnode_t *nil, dnode_t *root)
195 if (root != nil) {
196 height_left = verify_redblack(nil, root->left)
311 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); local
397 dnode_t *nil = dict_nil(dict), *root = dict_root(dict); local
457 dnode_t *nil = dict_nil(dict); local
496 dnode_t *nil = dict_nil(dict); local
528 dnode_t *nil = dict_nil(dict); local
563 dnode_t *where = dict_root(dict), *nil = dict_nil(dict); local
661 dnode_t *nil = dict_nil(dict), *child, *delparent = delete->parent; local
861 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *left; local
877 dnode_t *nil = dict_nil(dict), *root = dict_root(dict), *right; local
895 dnode_t *nil = dict_nil(dict), *parent, *left; local
921 dnode_t *nil = dict_nil(dict), *parent, *right; local
1060 dnode_t *nil = &load->nilnode; local
[all...] |
| /external/opencv/cv/src/ |
| cvstereogc.cpp | 137 GCVtx stub, *nil = &stub, *first = nil, *last = nil; local
143 stub.next = nil;
162 last->next = nil;
163 nil->next = 0;
173 while( first != nil )
192 u->next = nil;
347 u->next = nil;
|
| /external/v8/test/cctest/compiler/ |
| test-scheduler.cc | 696 Node* nil = graph.NewNode(common_builder.Dead()); local
698 Node* n23 = graph.NewNode(op, nil);
701 Node* n22 = graph.NewNode(op, nil, nil);
704 Node* n16 = graph.NewNode(op, nil, nil, nil);
707 Node* n15 = graph.NewNode(op, nil, nil, nil, nil, nil)
840 Node* nil = graph.NewNode(common_builder.Dead()); local
958 Node* nil = graph.NewNode(common_builder.Dead()); local
1207 Node* nil = graph.NewNode(common_builder.Dead()); local
1529 Node* nil = graph.NewNode(common_builder.Dead()); local
[all...] |
| /external/v8/src/ic/ |
| ic.cc | 2421 NilValue nil = stub.nil_value(); local
[all...] |
| /external/mesa3d/src/glx/tests/ |
| indirect_api.cpp | 54 static const void *nil = 0; variable
754 EXPECT_NE(nil, table[i]);
[all...] |
| /cts/tools/signature-tools/lib/ |
| antlr-2.7.7.jar | |
| /prebuilts/tools/common/m2/repository/org/parboiled/parboiled-core/1.0.2/ |
| parboiled-core-1.0.2.jar | |
| /external/antlr/antlr-3.4/lib/ |
| antlr-3.4-complete.jar | |
| /prebuilts/misc/common/antlr/ |
| antlr-3.4-complete.jar | |
| /external/emma/lib/ |
| emma.jar | |
| /external/owasp/sanitizer/tools/emma/lib/ |
| emma.jar | |
| /prebuilts/devtools/tools/lib/ |
| emma.jar | |
