HomeSort by: relevance | last modified time | path
    Searched refs:is_empty (Results 1 - 25 of 449) sorted by relevancy

1 2 3 4 5 6 7 8 91011>>

  /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/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/dist/gcc/
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-table.h 415 bool is_empty () const { return elements () == 0; } function in class:hash_table
540 first ruled out is_empty. */
541 gcc_checking_assert (!Descriptor::is_empty (v));
545 static bool is_empty (value_type &v) function in class:hash_table
547 return Descriptor::is_empty (v);
557 gcc_checking_assert (!Descriptor::is_empty (v));
575 if (!is_empty (*m_inserting_slot))
586 gcc_checking_assert (is_empty (*ret));
713 if (is_empty (entry))
735 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i])
    [all...]
tree-hasher.h 42 static bool is_empty (const value_type &v) { return v.to == NULL; } function in struct:int_tree_hasher
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);
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
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);
  /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/gpl3/gcc.old/dist/libphobos/libdruntime/core/stdcpp/
type_traits.d 37 struct is_empty(T)
xutility.d 43 import core.stdcpp.type_traits : is_empty;
311 extern (C++, class) struct _Compressed_pair(_Ty1, _Ty2, bool Ty1Empty = is_empty!_Ty1.value)
341 import core.stdcpp.type_traits : is_empty;
349 enum Ty1Empty = is_empty!_T1.value;
350 enum Ty2Empty = is_empty!_T2.value;
  /src/external/gpl3/gcc.old/dist/gcc/
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
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-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);
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);
hash-table.h 415 bool is_empty () const { return elements () == 0; } function in class:hash_table
539 static bool is_empty (value_type &v) function in class:hash_table
541 return Descriptor::is_empty (v);
665 else if (!is_empty (entry))
681 if (!is_empty (m_entries[i]) && !is_deleted (m_entries[i]))
741 if (is_empty (*slot))
753 if (is_empty (*slot))
819 if (!is_empty (x) && !is_deleted (x))
850 if (!is_empty (entries[i]) && !is_deleted (entries[i]))
894 || is_empty (*slot) || is_deleted (*slot)))
    [all...]
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 = hash_entry::is_empty (*e);
190 return Traits::is_empty (e) ? NULL : &e.m_value;
201 bool ins = Traits::is_empty (*e);
248 bool is_empty () const { return m_table.is_empty (); } function
  /src/external/gpl2/groff/dist/contrib/groffer/
groffer2.sh 1060 if obj _APROPOS_PROG is_empty
1064 if obj _APROPOS_SECTIONS is_empty
1066 if obj _OPT_SECTIONS is_empty
1112 if obj _APROPOS_PROG is_empty
1238 if is_empty "$1"
1242 if is_empty "$2"
1530 # is_empty (<string>)
1537 is_empty() function
1539 func_check is_empty '=' 1 "$@";
1661 if is_empty "$1
    [all...]
  /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
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
call-string.h 80 bool empty_p () const { return m_elements.is_empty (); }
  /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()
isl_test_cpp.cc 52 bool b_true = empty.is_empty();
53 bool b_false = univ.is_empty();
56 null.is_empty();
140 return !map.lex_ge_at(id).is_empty();

Completed in 42 milliseconds

1 2 3 4 5 6 7 8 91011>>