HelenOS sources
empty 198 kernel/genarch/src/mm/page_pt.c bool empty = true;
empty 203 kernel/genarch/src/mm/page_pt.c empty = false;
empty 208 kernel/genarch/src/mm/page_pt.c if (empty) {
empty 239 kernel/genarch/src/mm/page_pt.c empty = false;
empty 244 kernel/genarch/src/mm/page_pt.c if (empty) {
empty 274 kernel/genarch/src/mm/page_pt.c empty = false;
empty 279 kernel/genarch/src/mm/page_pt.c if (empty) {
empty 100 uspace/lib/bithenge/src/sequence.c bool empty;
empty 102 uspace/lib/bithenge/src/sequence.c bithenge_node_as_blob(subblob_node), &empty);
empty 103 uspace/lib/bithenge/src/sequence.c if (rc == EOK && empty) {
empty 166 uspace/lib/bithenge/src/sequence.c bool empty;
empty 168 uspace/lib/bithenge/src/sequence.c bithenge_node_as_blob(blob_node), &empty);
empty 169 uspace/lib/bithenge/src/sequence.c if (rc == EOK && empty) {
empty 830 uspace/lib/cpp/include/__bits/adt/deque.hpp if (empty())
empty 850 uspace/lib/cpp/include/__bits/adt/deque.hpp if (empty())
empty 239 uspace/lib/cpp/include/__bits/adt/hash_table.hpp if (empty())
empty 900 uspace/lib/cpp/include/__bits/adt/list.hpp if (&other == this || other.empty())
empty 257 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.empty();
empty 916 uspace/lib/cpp/include/__bits/adt/map.hpp return tree_.empty();
empty 109 uspace/lib/cpp/include/__bits/adt/queue.hpp return c.empty();
empty 298 uspace/lib/cpp/include/__bits/adt/queue.hpp return c.empty();
empty 233 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.empty();
empty 714 uspace/lib/cpp/include/__bits/adt/set.hpp return tree_.empty();
empty 92 uspace/lib/cpp/include/__bits/adt/stack.hpp return c.empty();
empty 201 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.empty();
empty 878 uspace/lib/cpp/include/__bits/adt/unordered_map.hpp return table_.empty();
empty 206 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.empty();
empty 622 uspace/lib/cpp/include/__bits/adt/unordered_set.hpp return table_.empty();
empty 544 uspace/lib/cpp/include/__bits/adt/vector.hpp if (!empty())
empty 1152 uspace/lib/cpp/include/__bits/iterator.hpp constexpr auto empty(const Container& c) -> decltype(c.empty())
empty 1154 uspace/lib/cpp/include/__bits/iterator.hpp return c.empty();
empty 1212 uspace/lib/cpp/include/__bits/string/string.hpp if (empty() || len == 0 || len + pos > size())
empty 1234 uspace/lib/cpp/include/__bits/string/string.hpp if (empty())
empty 1253 uspace/lib/cpp/include/__bits/string/string.hpp if (empty() || len == 0 || len + pos > size())
empty 1275 uspace/lib/cpp/include/__bits/string/string.hpp if (empty())
empty 1294 uspace/lib/cpp/include/__bits/string/string.hpp if (empty() || len == 0 || pos >= size())
empty 1326 uspace/lib/cpp/include/__bits/string/string.hpp if (empty() || len == 0)
empty 1355 uspace/lib/cpp/include/__bits/string/string.hpp if (empty() || pos >= size())
empty 1377 uspace/lib/cpp/include/__bits/string/string.hpp if (empty())
empty 1396 uspace/lib/cpp/include/__bits/string/string.hpp if (empty())
empty 1415 uspace/lib/cpp/include/__bits/string/string.hpp if (empty())
empty 75 uspace/lib/cpp/src/__bits/test/adaptors.cpp if (queue_.empty())
empty 126 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("queue initialized from deque not empty", q.empty(), false);
empty 147 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from iterator range not empty", q1.empty(), false);
empty 164 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("priority_queue initialized from vector and compare not empty", q2.empty(), false);
empty 185 uspace/lib/cpp/src/__bits/test/adaptors.cpp test_eq("stack initialized from deque not empty", s.empty(), false);
empty 253 uspace/lib/cpp/src/__bits/test/algorithm.cpp "move pt2", (data6[0].empty() && data6[1].empty(),
empty 254 uspace/lib/cpp/src/__bits/test/algorithm.cpp data6[2].empty())
empty 93 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("move construction - origin empty", d4.empty(), true);
empty 115 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("move assignment - origin empty", d4.empty(), true);
empty 185 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("resize to 0", d2.empty(), true);
empty 225 uspace/lib/cpp/src/__bits/test/deque.cpp test_eq("clear() - empty()", d2.empty(), true);
empty 85 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("not empty", l4.empty(), false);
empty 93 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("move initializaiton - origin empty pt1", l4.empty(), true);
empty 110 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("move assignment - origin empty", l4.empty(), true);
empty 159 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list", l1.empty(), true);
empty 163 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("empty list push_back pt2", l1.empty(), false);
empty 237 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("clear empty", l1.empty(), true);
empty 256 uspace/lib/cpp/src/__bits/test/list.cpp test_eq("splice pt2", l3.empty(), true);
empty 109 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("empty", m1.empty(), true);
empty 216 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by key pt2", map3.empty(), true);
empty 221 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("erase root by iterator pt2", map3.empty(), true);
empty 224 uspace/lib/cpp/src/__bits/test/map.cpp test_eq("clear", map2.empty(), true);
empty 91 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("empty", s1.empty(), true);
empty 165 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by key pt2", set3.empty(), true);
empty 170 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("erase root by iterator pt2", set3.empty(), true);
empty 173 uspace/lib/cpp/src/__bits/test/set.cpp test_eq("clear", set2.empty(), true);
empty 94 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("empty", m1.empty(), true);
empty 204 uspace/lib/cpp/src/__bits/test/unordered_map.cpp test_eq("clear", map2.empty(), true);
empty 84 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("empty", s1.empty(), true);
empty 155 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by key pt2", set3.empty(), true);
empty 160 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("erase only element by iterator pt2", set3.empty(), true);
empty 163 uspace/lib/cpp/src/__bits/test/unordered_set.cpp test_eq("clear", set2.empty(), true);
empty 107 uspace/lib/label/src/empty.c bool empty;
empty 134 uspace/lib/label/src/empty.c empty = true;
empty 146 uspace/lib/label/src/empty.c empty = false;
empty 161 uspace/lib/label/src/empty.c empty = false;
empty 168 uspace/lib/label/src/empty.c *rempty = empty;
empty 43 uspace/lib/pcut/tests/teardown.c PCUT_TEST(empty) {
empty 46 uspace/lib/riff/test/chunk.c PCUT_TEST(empty)
empty 205 uspace/srv/volsrv/part.c bool empty;
empty 240 uspace/srv/volsrv/part.c rc = volsrv_part_is_empty(part->svc_id, &empty);
empty 254 uspace/srv/volsrv/part.c part->pcnt = empty ? vpc_empty : vpc_unknown;
HelenOS homepage, sources at GitHub