ORIGINAL
Loading...
Searching...
No Matches
core.h
Go to the documentation of this file.
1#ifndef CORE_H
2#define CORE_H
3
44#include "algorithms.h"
45#include "allocator.h"
46#include "array.h"
47#include "autoPtr.h"
48#include "baseArray.h"
49#include "baseList.h"
50#include "bitSet.h"
51#include "blocksList.h"
52#include "chain.h"
53#include "cloneable.h"
54#include "comparable.h"
55#include "comparator.h"
56#include "config.h"
57#include "container.h"
58#include "containerAdapter.h"
59#include "couple.h"
60#include "deleter.h"
61#include "deque.h"
63#include "error.h"
64#include "filter.h"
65#include "filterStream.h"
66#include "forwardChain.h"
67#include "hash.h"
68#include "iterable.h"
69#include "iterationStream.h"
70#include "iterator.h"
71#include "map.h"
72#include "maps.h"
73#include "maths.h"
74#include "ownerPtr.h"
75#include "printable.h"
76#include "prique.h"
77#include "queue.h"
79#include "RBTree.h"
80#include "refCntPtr.h"
81#include "serial.h"
82#include "set.h"
84#include "stack.h"
85#include "stepIterator.h"
86#include "transform.h"
87#include "transformStream.h"
88#include "tuple.h"
89#include "types.h"
90#include "vector.h"
91#include "wrapper.h"
92
93#endif //CORE_H
Red-Black Tree implementation header.
Standard algorithm implementations for iterator-based containers.
Memory allocation interface and implementations.
Provides the array class for a fixed-size container with random access.
Base class for reference-counted smart pointers.
Provides a base class for fixed-size serial containers.
Provides a base class for variable-size serial containers.
BitSet class declaration.
A block-based list implementation.
Non-cyclic doubly linked list implementation.
Abstract base class for cloneable objects.
Interface for objects that can be compared.
Comparator base class and concrete comparator classes.
Platform-independent integer and floating-point type definitions.
Base class for container adapters with common interfaces.
Abstract base class for container types.
Generic pair container implementation.
Default deleters for resource management.
Double-ended queue (deque) container adapter implementation.
Double-direction iterator base class.
Custom exception classes and callback validation utilities.
Composite filter operations with logical chaining.
Filter base class and derived filter classes for various matching operations.
Non-cyclic singly linked list implementation.
Provides a generic hashing utility and a base interface for hashable types.
Base interface for iterable container types.
Provides functionality for an iteration stream.
Defines the iterator class for traversing and manipulating container elements.
Abstract base class for map-like container implementations.
Implementation of hashMap container.
Mathematical utilities and constants.
Exclusive-ownership smart pointer implementation.
Interface for polymorphic string formatting and output.
Priority queue container implementation.
Queue container adapter implementation.
Base class for random-access iterators.
Reference-counted smart pointer hierarchy.
Defines an abstract base class for sequential containers with index-based access.
Abstract base class for set container implementations.
Single-direction iterator base class.
Stack container adapter implementation.
Step iterator base class for single-step iterators.
Transform pipeline composition and execution.
Transformation classes for various operations on elements.
Heterogeneous tuple container implementation.
Core type system foundations and concept definitions.
Dynamic array container with automatic resizing.
Abstract polymorphic container with value encapsulation and navigation support.