 |
PIP 5.5.3
Platform-Independent Primitives
|
|
PIP 5.5.3
Platform-Independent Primitives
|
This is the complete list of members for PIQueue< T >, including all inherited members.
| any(std::function< bool(const T &e)> test) const | PIDeque< T > | inline |
| append(const T &e) | PIDeque< T > | inline |
| append(T &&e) | PIDeque< T > | inline |
| append(std::initializer_list< T > init_list) | PIDeque< T > | inline |
| append(const PIDeque< T > &v) | PIDeque< T > | inline |
| assign(const T &e=T()) | PIDeque< T > | inline |
| assign(size_t new_size, const T &e) | PIDeque< T > | inline |
| at(size_t index) const | PIDeque< T > | inline |
| atWhere(std::function< bool(const T &e)> test, ssize_t start=0, const T &def=T()) const | PIDeque< T > | inline |
| back() | PIDeque< T > | inline |
| begin() | PIDeque< T > | inline |
| capacity() const | PIDeque< T > | inline |
| clear() | PIDeque< T > | inline |
| contains(const T &e, ssize_t start=0) const | PIDeque< T > | inline |
| contains(const PIDeque< T > &v, ssize_t start=0) const | PIDeque< T > | inline |
| data(size_t index=0) | PIDeque< T > | inline |
| data(size_t index=0) const | PIDeque< T > | inline |
| dequeue() | PIQueue< T > | inline |
| end() | PIDeque< T > | inline |
| enlarge(ssize_t add_size, const T &e=T()) | PIDeque< T > | inline |
| enqueue(const T &v) | PIQueue< T > | inline |
| enqueue(T &&v) | PIQueue< T > | inline |
| entries(const T &e, ssize_t start=0) const | PIDeque< T > | inline |
| entries(std::function< bool(const T &e)> test, ssize_t start=0) const | PIDeque< T > | inline |
| every(std::function< bool(const T &e)> test) const | PIDeque< T > | inline |
| fill(const T &e=T()) | PIDeque< T > | inline |
| fill(std::function< T(size_t i)> f) | PIDeque< T > | inline |
| filter(std::function< bool(const T &e)> test) const | PIDeque< T > | inline |
| filterIndexed(std::function< bool(size_t index, const T &e)> test) const | PIDeque< T > | inline |
| filterReverse(std::function< bool(const T &e)> test) const | PIDeque< T > | inline |
| filterReverseIndexed(std::function< bool(size_t index, const T &e)> test) const | PIDeque< T > | inline |
| flatten(ReshapeOrder order=ReshapeByRow) const | PIDeque< T > | inline |
| forEach(std::function< void(const T &e)> f) const | PIDeque< T > | inline |
| forEach(std::function< void(T &e)> f) | PIDeque< T > | inline |
| forEachIndexed(std::function< void(size_t index, const T &e)> f) const | PIDeque< T > | inline |
| forEachIndexed(std::function< void(size_t index, T &e)> f) | PIDeque< T > | inline |
| forEachReverse(std::function< void(const T &e)> f) const | PIDeque< T > | inline |
| forEachReverse(std::function< void(T &e)> f) | PIDeque< T > | inline |
| forEachReverseIndexed(std::function< void(size_t index, const T &e)> f) const | PIDeque< T > | inline |
| forEachReverseIndexed(std::function< void(size_t index, T &e)> f) | PIDeque< T > | inline |
| front() | PIDeque< T > | inline |
| getRange(size_t index, size_t count) const | PIDeque< T > | inline |
| head() | PIQueue< T > | inline |
| indexOf(const T &e, ssize_t start=0) const | PIDeque< T > | inline |
| indexWhere(std::function< bool(const T &e)> test, ssize_t start=0) const | PIDeque< T > | inline |
| insert(size_t index, const T &e=T()) | PIDeque< T > | inline |
| insert(size_t index, T &&e) | PIDeque< T > | inline |
| insert(size_t index, const PIDeque< T > &v) | PIDeque< T > | inline |
| insert(size_t index, std::initializer_list< T > init_list) | PIDeque< T > | inline |
| isEmpty() const | PIDeque< T > | inline |
| isNotEmpty() const | PIDeque< T > | inline |
| lastAtWhere(std::function< bool(const T &e)> test, ssize_t start=-1, const T &def=T()) const | PIDeque< T > | inline |
| lastIndexOf(const T &e, ssize_t start=-1) const | PIDeque< T > | inline |
| lastIndexWhere(std::function< bool(const T &e)> test, ssize_t start=-1) const | PIDeque< T > | inline |
| length() const | PIDeque< T > | inline |
| map(std::function< ST(const T &e)> f) const | PIDeque< T > | inline |
| mapIndexed(std::function< ST(size_t index, const T &e)> f) const | PIDeque< T > | inline |
| mapReverse(std::function< ST(const T &e)> f) const | PIDeque< T > | inline |
| mapReverseIndexed(std::function< ST(size_t index, const T &e)> f) const | PIDeque< T > | inline |
| operator!=(const PIDeque< T > &v) const | PIDeque< T > | inline |
| operator<<(const T &e) | PIDeque< T > | inline |
| operator<<(T &&e) | PIDeque< T > | inline |
| operator<<(const PIDeque< T > &v) | PIDeque< T > | inline |
| operator=(const PIDeque< T > &other) | PIDeque< T > | inline |
| operator=(PIDeque< T > &&other) | PIDeque< T > | inline |
| operator==(const PIDeque< T > &v) const | PIDeque< T > | inline |
| operator[](size_t index) | PIDeque< T > | inline |
| PIDeque() | PIDeque< T > | inline |
| PIDeque(const PIDeque< T > &other) | PIDeque< T > | inline |
| PIDeque(std::initializer_list< T > init_list) | PIDeque< T > | inline |
| PIDeque(const T *data, size_t size) | PIDeque< T > | inline |
| PIDeque(size_t pid_size, const T &e=T()) | PIDeque< T > | inlineexplicit |
| PIDeque(size_t piv_size, std::function< T(size_t i)> f) | PIDeque< T > | inline |
| PIDeque(PIDeque< T > &&other) | PIDeque< T > | inline |
| PIQueue() | PIQueue< T > | inline |
| pop_back() | PIDeque< T > | inline |
| pop_front() | PIDeque< T > | inline |
| prepend(const T &e) | PIDeque< T > | inline |
| prepend(T &&e) | PIDeque< T > | inline |
| prepend(const PIDeque< T > &v) | PIDeque< T > | inline |
| prepend(std::initializer_list< T > init_list) | PIDeque< T > | inline |
| push_back(const T &e) | PIDeque< T > | inline |
| push_back(T &&e) | PIDeque< T > | inline |
| push_back(std::initializer_list< T > init_list) | PIDeque< T > | inline |
| push_back(const PIDeque< T > &v) | PIDeque< T > | inline |
| push_front(const T &e) | PIDeque< T > | inline |
| push_front(T &&e) | PIDeque< T > | inline |
| push_front(const PIDeque< T > &v) | PIDeque< T > | inline |
| push_front(std::initializer_list< T > init_list) | PIDeque< T > | inline |
| rbegin() | PIDeque< T > | inline |
| reduce(std::function< ST(const T &e, const ST &acc)> f, const ST &initial=ST()) const | PIDeque< T > | inline |
| reduceIndexed(std::function< ST(size_t index, const T &e, const ST &acc)> f, const ST &initial=ST()) const | PIDeque< T > | inline |
| reduceReverse(std::function< ST(const T &e, const ST &acc)> f, const ST &initial=ST()) const | PIDeque< T > | inline |
| reduceReverseIndexed(std::function< ST(size_t index, const T &e, const ST &acc)> f, const ST &initial=ST()) const | PIDeque< T > | inline |
| remove(size_t index, size_t count=1) | PIDeque< T > | inline |
| removeAll(const T &e) | PIDeque< T > | inline |
| removeOne(const T &e) | PIDeque< T > | inline |
| removeWhere(std::function< bool(const T &e)> test) | PIDeque< T > | inline |
| rend() | PIDeque< T > | inline |
| reserve(size_t new_size) | PIDeque< T > | inline |
| reshape(size_t rows, size_t cols, ReshapeOrder order=ReshapeByRow) const | PIDeque< T > | inline |
| reshape(size_t rows, size_t cols, ReshapeOrder order=ReshapeByRow) const | PIDeque< T > | inline |
| resize(size_t new_size, const T &e=T()) | PIDeque< T > | inline |
| resize(size_t new_size, std::function< T(size_t i)> f) | PIDeque< T > | inline |
| reverse() | PIDeque< T > | inline |
| reversed() const | PIDeque< T > | inline |
| size() const | PIDeque< T > | inline |
| size_s() const | PIDeque< T > | inline |
| sort() | PIDeque< T > | inline |
| sort(std::function< bool(const T &a, const T &b)> comp) | PIDeque< T > | inline |
| split(const T &separator) const | PIDeque< T > | inline |
| splitBySize(size_t sz) const | PIDeque< T > | inline |
| swap(PIDeque< T > &other) | PIDeque< T > | inline |
| tail() | PIQueue< T > | inline |
| take_back() | PIDeque< T > | inline |
| take_front() | PIDeque< T > | inline |
| takeRange(size_t index, size_t count) | PIDeque< T > | inline |
| toDeque() const | PIQueue< T > | inline |
| toType() const | PIDeque< T > | inline |
| toVector() const | PIQueue< T > | inline |
1.9.4