| /src/external/gpl3/gcc/dist/contrib/ |
| check-MAINTAINERS.py | 62 def is_empty(line): function
91 chunk = list(takewhile(is_empty, lines))
98 chunk = list(takewhile(is_empty, lines))
105 chunk = list(takewhile(is_empty, lines))
|
| /src/external/gpl3/gcc.old/dist/contrib/ |
| check-MAINTAINERS.py | 62 def is_empty(line): function
91 chunk = list(takewhile(is_empty, lines))
98 chunk = list(takewhile(is_empty, lines))
105 chunk = list(takewhile(is_empty, lines))
|
| /src/external/gpl2/groff/dist/src/include/ |
| symbol.h | 42 int is_empty() const;
78 inline int symbol::is_empty() const function in class:symbol
|
| /src/external/gpl3/gcc/dist/gcc/ |
| hash-map-traits.h | 40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) function in class:simple_hashmap_traits
75 return H::is_empty (entry.m_key);
123 template <typename T> static inline bool is_empty (const T &);
157 unbounded_hashmap_traits <Key, Value>::is_empty (const T &entry) function in class:unbounded_hashmap_traits
159 return default_hash_traits <Value>::is_empty (entry.m_value);
|
| tree-hasher.h | 42 static bool is_empty (const value_type &v) { return v.to == NULL; } function in struct:int_tree_hasher
|
| gimple-predicate-analysis.h | 58 bool is_empty () const function in class:predicate
60 return m_preds.is_empty ();
65 return is_empty () && m_cval;
70 return is_empty () && !m_cval;
|
| hash-set.h | 59 bool existed = !Traits::is_empty (*e);
64 gcc_checking_assert (!Traits::is_empty (*e)
79 return !Traits::is_empty (e);
107 bool is_empty () const { return m_table.is_empty (); } function in class:hash_set
|
| hash-set-tests.cc | 214 static bool is_empty (const value_type &v) function in struct:selftest::value_hash_traits
216 return base_type::is_empty (v.val);
|
| hash-traits.h | 130 static inline bool is_empty (Type);
157 int_hash <Type, Empty, Deleted>::is_empty (Type x) function in class:int_hash
179 static inline bool is_empty (Type *);
222 pointer_hash <Type>::is_empty (Type *e) function in class:pointer_hash
358 static inline bool is_empty (const value_type &);
406 pair_hash <T1, T2>::is_empty (const value_type &x) function in class:pair_hash
408 return T1::is_empty (x.first);
|
| hash-map.h | 71 static bool is_empty (const hash_entry &e) { return Traits::is_empty (e); } function in struct:hash_entry
172 bool ins = Traits::is_empty (*e);
177 gcc_checking_assert (!Traits::is_empty (*e)
192 return Traits::is_empty (e) ? NULL : &e.m_value;
203 bool ins = Traits::is_empty (*e);
208 gcc_checking_assert (!Traits::is_empty (*e)
252 bool is_empty () const { return m_table.is_empty (); } function
|
| vec.h | 604 bool is_empty (void) const { return m_vecpfx.m_num == 0; } function
700 /* If V is NULL, return true. Otherwise, return V->is_empty(). */
705 return v ? v->is_empty () : true;
1570 bool is_empty (void) const
1571 { return m_vec ? m_vec->is_empty () : true; }
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| hash-map-traits.h | 40 template <typename T> static inline bool is_empty (const T &);
73 simple_hashmap_traits <H, Value>::is_empty (const T &entry) function in class:simple_hashmap_traits
75 return H::is_empty (entry.m_key);
118 template <typename T> static inline bool is_empty (const T &);
135 unbounded_hashmap_traits <Value>::is_empty (const T &entry) function in class:unbounded_hashmap_traits
137 return default_hash_traits <Value>::is_empty (entry.m_value);
|
| tree-hasher.h | 42 static bool is_empty (const value_type &v) { return v.to == NULL; } function in struct:int_tree_hasher
|
| gimple-predicate-analysis.h | 88 bool is_empty () const function in class:predicate
90 return m_preds.is_empty ();
|
| hash-set.h | 59 bool existed = !Traits::is_empty (*e);
74 return !Traits::is_empty (e);
102 bool is_empty () const { return m_table.is_empty (); } function in class:hash_set
|
| hash-set-tests.cc | 214 static bool is_empty (const value_type &v) function in struct:selftest::value_hash_traits
216 return base_type::is_empty (v.val);
|
| hash-traits.h | 106 static inline bool is_empty (Type);
147 int_hash <Type, Empty, Deleted>::is_empty (Type x) function in class:int_hash
169 static inline bool is_empty (Type *);
212 pointer_hash <Type>::is_empty (Type *e) function in class:pointer_hash
348 static inline bool is_empty (const value_type &);
396 pair_hash <T1, T2>::is_empty (const value_type &x) function in class:pair_hash
398 return T1::is_empty (x.first);
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| call-string.h | 77 bool empty_p () const { return m_elements.is_empty (); }
135 template <typename T> static inline bool is_empty (const T &entry) function in struct:ana::call_string::hashmap_traits_t
|
| state-purge.h | 66 pod_hash_traits<function_point>::is_empty (value_type v) function in class:pod_hash_traits
|
| /src/external/mit/isl/dist/ |
| isl_pw_union_opt.c | 185 isl_bool is_subset, is_empty; local
200 is_empty = isl_set_is_empty(better);
201 if (is_empty >= 0 && is_empty)
207 if (is_empty < 0 || is_subset < 0)
313 if (FN(PW,is_empty)(pw1)) {
318 if (FN(PW,is_empty)(pw2)) {
|
| isl_test_python.py | 128 b_true = empty.is_empty()
129 b_false = univ.is_empty()
234 return not map.lex_ge_at(id).is_empty()
254 def is_empty(s): function in function:test_every
255 return s.is_empty()
256 assert(not us.every_set(is_empty))
259 return not s.is_empty()
|
| /src/external/bsd/wpa/dist/src/fst/ |
| fst_group.c | 502 bool is_empty = !fst_group_has_ifaces(group) && local
505 if (is_empty)
508 return is_empty;
|
| /src/external/gpl3/gcc/dist/contrib/gcc-changelog/ |
| git_commit.py | 283 def is_empty(self): member in class:ChangeLogEntry
584 if last_entry.is_empty:
|
| /src/external/gpl3/gcc.old/dist/contrib/gcc-changelog/ |
| git_commit.py | 275 def is_empty(self): member in class:ChangeLogEntry
570 if last_entry.is_empty:
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| analyzer.h | 326 static inline bool is_empty (Type);
346 static inline bool is_empty (Type t) { return t.is_empty (); } function in struct:member_function_hash_traits
|
