Changeset b57a3ee in mainline for uspace/lib/cpp/include/__bits/adt
- Timestamp:
- 2018-07-05T21:41:24Z (7 years ago)
- Branches:
- lfn, master, serial, ticket/834-toolchain-update, topic/msim-upgrade, topic/simplify-dev-export
- Children:
- c735afb
- Parents:
- 4f461384
- git-author:
- Dzejrou <dzejrou@…> (2018-06-25 16:58:08)
- git-committer:
- Dzejrou <dzejrou@…> (2018-07-05 21:41:24)
- Location:
- uspace/lib/cpp/include/__bits/adt
- Files:
-
- 24 moved
Legend:
- Unmodified
- Added
- Removed
-
uspace/lib/cpp/include/__bits/adt/array.hpp
r4f461384 rb57a3ee 1 1 /* 2 * Copyright (c) 201 7Jaroslav Jindrak2 * Copyright (c) 2018 Jaroslav Jindrak 3 3 * All rights reserved. 4 4 * … … 27 27 */ 28 28 29 #ifndef LIBCPP_ ARRAY30 #define LIBCPP_ ARRAY29 #ifndef LIBCPP_BITS_ADT_ARRAY 30 #define LIBCPP_BITS_ADT_ARRAY 31 31 32 32 #include <iterator> -
uspace/lib/cpp/include/__bits/adt/bitset.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS ET30 #define LIBCPP_BITS ET29 #ifndef LIBCPP_BITS_ADT_BITSET 30 #define LIBCPP_BITS_ADT_BITSET 31 31 32 32 #include <iosfwd> -
uspace/lib/cpp/include/__bits/adt/deque.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_DEQUE 30 #define LIBCPP_DEQUE 31 29 #ifndef LIBCPP_BITS_ADT_DEQUE 30 #define LIBCPP_BITS_ADT_DEQUE 31 32 #include <__bits/insert_iterator.hpp> 32 33 #include <algorithm> 33 34 #include <initializer_list> 34 #include <__bits/insert_iterator.hpp>35 35 #include <iterator> 36 36 #include <memory> -
uspace/lib/cpp/include/__bits/adt/forward_list.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_ FORWARD_LIST30 #define LIBCPP_ FORWARD_LIST29 #ifndef LIBCPP_BITS_ADT_FORWARD_LIST 30 #define LIBCPP_BITS_ADT_FORWARD_LIST 31 31 32 32 #error "<forward_list> is not implemented" -
uspace/lib/cpp/include/__bits/adt/hash_table.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_HASH_TABLE 30 #define LIBCPP_BITS_HASH_TABLE 31 29 #ifndef LIBCPP_BITS_ADT_HASH_TABLE 30 #define LIBCPP_BITS_ADT_HASH_TABLE 31 32 #include <__bits/adt/list_node.hpp> 33 #include <__bits/adt/key_extractors.hpp> 34 #include <__bits/adt/hash_table_iterators.hpp> 35 #include <__bits/adt/hash_table_policies.hpp> 32 36 #include <cstdlib> 33 #include <__bits/list_node.hpp>34 #include <__bits/key_extractors.hpp>35 #include <__bits/hash_table_iterators.hpp>36 #include <__bits/hash_table_policies.hpp>37 37 #include <iterator> 38 38 #include <limits> -
uspace/lib/cpp/include/__bits/adt/hash_table_bucket.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ HASH_TABLE_BUCKET30 #define LIBCPP_BITS_ HASH_TABLE_BUCKET29 #ifndef LIBCPP_BITS_ADT_HASH_TABLE_BUCKET 30 #define LIBCPP_BITS_ADT_HASH_TABLE_BUCKET 31 31 32 #include <__bits/ list_node.hpp>32 #include <__bits/adt/list_node.hpp> 33 33 34 34 namespace std::aux -
uspace/lib/cpp/include/__bits/adt/hash_table_iterators.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ HASH_TABLE_ITERATORS30 #define LIBCPP_BITS_ HASH_TABLE_ITERATORS31 32 #include <__bits/ iterator.hpp>33 #include <__bits/ list_node.hpp>34 #include <__bits/ hash_table_bucket.hpp>29 #ifndef LIBCPP_BITS_ADT_HASH_TABLE_ITERATORS 30 #define LIBCPP_BITS_ADT_HASH_TABLE_ITERATORS 31 32 #include <__bits/adt/list_node.hpp> 33 #include <__bits/adt/hash_table_bucket.hpp> 34 #include <__bits/iterator_helpers.hpp> 35 35 #include <iterator> 36 36 -
uspace/lib/cpp/include/__bits/adt/hash_table_policies.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ HASH_TABLE_POLICIES30 #define LIBCPP_BITS_ HASH_TABLE_POLICIES29 #ifndef LIBCPP_BITS_ADT_HASH_TABLE_POLICIES 30 #define LIBCPP_BITS_ADT_HASH_TABLE_POLICIES 31 31 32 32 #include <tuple> -
uspace/lib/cpp/include/__bits/adt/initializer_list.hpp
r4f461384 rb57a3ee 1 1 /* 2 * Copyright (c) 201 7Jaroslav Jindrak2 * Copyright (c) 2018 Jaroslav Jindrak 3 3 * All rights reserved. 4 4 * … … 27 27 */ 28 28 29 #ifndef LIBCPP_ INITIALIZER_LIST30 #define LIBCPP_ INITIALIZER_LIST29 #ifndef LIBCPP_BITS_ADT_INITIALIZER_LIST 30 #define LIBCPP_BITS_ADT_INITIALIZER_LIST 31 31 32 32 #include <cstdlib> -
uspace/lib/cpp/include/__bits/adt/key_extractors.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ KEY_EXTRACTORS30 #define LIBCPP_BITS_ KEY_EXTRACTORS29 #ifndef LIBCPP_BITS_ADT_KEY_EXTRACTORS 30 #define LIBCPP_BITS_ADT_KEY_EXTRACTORS 31 31 32 32 #include <utility> -
uspace/lib/cpp/include/__bits/adt/list.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_LIST 30 #define LIBCPP_LIST 31 29 #ifndef LIBCPP_BITS_ADT_LIST 30 #define LIBCPP_BITS_ADT_LIST 31 32 #include <__bits/adt/list_node.hpp> 32 33 #include <__bits/insert_iterator.hpp> 33 #include <__bits/list_node.hpp>34 34 #include <cstdlib> 35 35 #include <iterator> -
uspace/lib/cpp/include/__bits/adt/list_node.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ LIST_NODE30 #define LIBCPP_BITS_ LIST_NODE29 #ifndef LIBCPP_BITS_ADT_LIST_NODE 30 #define LIBCPP_BITS_ADT_LIST_NODE 31 31 32 32 namespace std::aux -
uspace/lib/cpp/include/__bits/adt/map.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_MAP 30 #define LIBCPP_MAP 31 29 #ifndef LIBCPP_BITS_ADT_MAP 30 #define LIBCPP_BITS_ADT_MAP 31 32 #include <__bits/adt/rbtree.hpp> 32 33 #include <functional> 33 #include <__bits/rbtree.hpp>34 34 #include <iterator> 35 35 #include <memory> -
uspace/lib/cpp/include/__bits/adt/queue.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_ QUEUE30 #define LIBCPP_ QUEUE29 #ifndef LIBCPP_BITS_ADT_QUEUE 30 #define LIBCPP_BITS_ADT_QUEUE 31 31 32 32 #include <algorithm> -
uspace/lib/cpp/include/__bits/adt/rbtree.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ RBTREE30 #define LIBCPP_BITS_ RBTREE31 32 #include <__bits/ key_extractors.hpp>33 #include <__bits/ rbtree_iterators.hpp>34 #include <__bits/ rbtree_node.hpp>35 #include <__bits/ rbtree_policies.hpp>29 #ifndef LIBCPP_BITS_ADT_RBTREE 30 #define LIBCPP_BITS_ADT_RBTREE 31 32 #include <__bits/adt/key_extractors.hpp> 33 #include <__bits/adt/rbtree_iterators.hpp> 34 #include <__bits/adt/rbtree_node.hpp> 35 #include <__bits/adt/rbtree_policies.hpp> 36 36 37 37 namespace std::aux -
uspace/lib/cpp/include/__bits/adt/rbtree_iterators.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ RBTREE_ITERATORS30 #define LIBCPP_BITS_ RBTREE_ITERATORS31 32 #include <__bits/ iterator.hpp>33 #include <__bits/ rbtree_node.hpp>29 #ifndef LIBCPP_BITS_ADT_RBTREE_ITERATORS 30 #define LIBCPP_BITS_ADT_RBTREE_ITERATORS 31 32 #include <__bits/adt/rbtree_node.hpp> 33 #include <__bits/iterator_helpers.hpp> 34 34 #include <iterator> 35 35 -
uspace/lib/cpp/include/__bits/adt/rbtree_node.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ RBTREE_NODE30 #define LIBCPP_BITS_ RBTREE_NODE29 #ifndef LIBCPP_BITS_ADT_RBTREE_NODE 30 #define LIBCPP_BITS_ADT_RBTREE_NODE 31 31 32 32 #include <cassert> -
uspace/lib/cpp/include/__bits/adt/rbtree_policies.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_BITS_ RBTREE_POLICIES30 #define LIBCPP_BITS_ RBTREE_POLICIES31 32 #include <__bits/ rbtree_node.hpp>29 #ifndef LIBCPP_BITS_ADT_RBTREE_POLICIES 30 #define LIBCPP_BITS_ADT_RBTREE_POLICIES 31 32 #include <__bits/adt/rbtree_node.hpp> 33 33 #include <utility> 34 34 -
uspace/lib/cpp/include/__bits/adt/set.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_SET 30 #define LIBCPP_SET 31 29 #ifndef LIBCPP_BITS_ADT_SET 30 #define LIBCPP_BITS_ADT_SET 31 32 #include <__bits/adt/rbtree.hpp> 32 33 #include <functional> 33 #include <__bits/rbtree.hpp>34 34 #include <iterator> 35 35 #include <memory> -
uspace/lib/cpp/include/__bits/adt/stack.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_ STACK30 #define LIBCPP_ STACK29 #ifndef LIBCPP_BITS_ADT_STACK 30 #define LIBCPP_BITS_ADT_STACK 31 31 32 32 #include <deque> … … 36 36 namespace std 37 37 { 38 39 38 /** 40 39 * 23.5.6.2, stack: -
uspace/lib/cpp/include/__bits/adt/unordered_map.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_UNORDERED_MAP 30 #define LIBCPP_UNORDERED_MAP 31 29 #ifndef LIBCPP_BITS_ADT_UNORDERED_MAP 30 #define LIBCPP_BITS_ADT_UNORDERED_MAP 31 32 #include <__bits/adt/hash_table.hpp> 32 33 #include <initializer_list> 33 #include <__bits/hash_table.hpp>34 34 #include <functional> 35 35 #include <memory> -
uspace/lib/cpp/include/__bits/adt/unordered_set.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_UNORDERED_SET 30 #define LIBCPP_UNORDERED_SET 31 29 #ifndef LIBCPP_BITS_ADT_UNORDERED_SET 30 #define LIBCPP_BITS_ADT_UNORDERED_SET 31 32 #include <__bits/adt/hash_table.hpp> 32 33 #include <initializer_list> 33 #include <__bits/hash_table.hpp>34 34 #include <functional> 35 35 #include <memory> -
uspace/lib/cpp/include/__bits/adt/valarray.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_ VALARRAY30 #define LIBCPP_ VALARRAY29 #ifndef LIBCPP_BITS_ADT_VALARRAY 30 #define LIBCPP_BITS_ADT_VALARRAY 31 31 32 32 #error "<valarray> is not implemented" -
uspace/lib/cpp/include/__bits/adt/vector.hpp
r4f461384 rb57a3ee 27 27 */ 28 28 29 #ifndef LIBCPP_ VECTOR30 #define LIBCPP_ VECTOR29 #ifndef LIBCPP_BITS_ADT_VECTOR 30 #define LIBCPP_BITS_ADT_VECTOR 31 31 32 32 #include <algorithm>
Note:
See TracChangeset
for help on using the changeset viewer.