|
Rasterfarm-SDK
|
API for creating Applications and rasterization-engines. More...
Namespaces | |
| namespace | Raster |
| namespace | Schedule |
| namespace | Shape |
| namespace | Surface |
Classes | |
| class | Application |
| This class abstracts-away user callbacks, events, and window-management. More... | |
| class | Circulator |
| class | CommandBuffer |
| class | GraphicsPipeline |
| class | ImageMemory |
| struct | MasterLock |
| class | Memory |
| class | PrimaryCommandBuffer |
| class | Program |
| struct | Rectangle |
| class | RenderBuffer |
| class | ResourceManager |
| class | SecondaryCommandBuffer |
| class | Uniform |
| class | UniformBuffer |
| class | UniformMemory |
| class | UniformSampler |
| class | UniformValue |
| class | VertexMemory |
Typedefs | |
| using | UniformValue1i = UniformValue< int > |
| using | UniformValue1f = UniformValue< float > |
| using | UniformBuffer1i = UniformBuffer< int, 1 > |
| using | UniformBuffer1f = UniformBuffer< float, 1 > |
| using | UniformBuffer2f = UniformBuffer< float, 2 > |
| using | UniformBuffer3f = UniformBuffer< float, 3 > |
| using | UniformBuffer4f = UniformBuffer< float, 4 > |
| using | UniformMatrix3f = UniformBuffer< Matrix3f, 1 > |
| using | UniformMatrix4f = UniformBuffer< Matrix4f, 1 > |
| template<class C > | |
| using | Initializer = std::initializer_list< C > |
| template<class C , size_t N> | |
| using | Array = std::array< C, N > |
| template<class C > | |
| using | HeapArray = std::vector< C > |
| template<class C > | |
| using | HeapArray2D = std::vector< std::vector< C > > |
| template<class C > | |
| using | List = std::list< C > |
| template<class C > | |
| using | Queue = std::queue< C > |
| template<class C > | |
| using | Stack = std::stack< C > |
| template<class C > | |
| using | UnorderedSet = std::unordered_set< C > |
| template<class C > | |
| using | Function = std::function< C > |
| using | String = std::string |
| using | StringStream = std::stringstream |
| using | InputStringStream = std::istringstream |
| using | OutputStringStream = std::ostringstream |
| using | InputFfileStream = std::ifstream |
| template<class A , class B > | |
| using | Pair = std::pair< A, B > |
| template<class A , class B > | |
| using | UnorderedMap = std::unordered_map< A, B > |
| template<class A , class B > | |
| using | OrderedMap = std::map< A, B > |
| using | Thread = std::thread |
| using | Mutex = std::mutex |
| using | RecursiveMutex = std::recursive_mutex |
| using | ConditionalVariable = std::condition_variable |
| template<class C > | |
| using | UniqueLock = std::unique_lock< C > |
| typedef UnorderedSet< std::string > | StringUnorderedSet |
| typedef UnorderedMap< int, bool > | StateEnabledUnorderedMap |
| typedef UnorderedMap< int, bool > | CapabilityUnorderedMap |
| typedef unsigned char | Byte |
| typedef HeapArray< Byte > | ByteArray |
| typedef unsigned short | ushort |
| typedef uint | TypeID |
| using | UintRectangle = Rectangle< uint > |
| using | FloatRectangle = Rectangle< float > |
| using | DoubleRectangle = Rectangle< double > |
| typedef uint | Handle |
| typedef Handle | ArrayIndex |
Enumerations | |
| enum | : uint { INVALID_HANDLE = std::numeric_limits< uint >::max() } |
Functions | |
| template<class C > | |
| int | distance (const Circulator< C > &a, const Circulator< C > &b) |
| template<class C > | |
| uint | forwardDistance (const Circulator< C > &a, const Circulator< C > &b) |
| template<class C > | |
| int | shortestDistance (const Circulator< C > &a, const Circulator< C > &b) |
| std::string | demangle (const char *str) |
| void | insertAfterEach (const char *token, const char *insert, std::string &str) |
| std::vector< std::string > | tokenize (const std::string &source, const char *delimiter=" ") |
| template<typename FROM , typename RETURN > | |
| RETURN | convert (const FROM &from) |
| template<typename T > | |
| bool | powerOfTwo (T value) |
| template<typename T > | |
| bool | compare (const T &v1, const T &v2, T precision) |
| template<typename T > | |
| T | clamp (T value, T lower, T upper) |
| template<typename T > | |
| int | sign (T val) |
| template<typename T > | |
| T | degreesToRadians (T angle) |
| template<typename T > | |
| T | radiansToDegrees (T radians) |
| template<class C , typename I > | |
| C::const_iterator | findIterator (const C &container, const I &item) |
| template<class C , typename I > | |
| C::iterator | findIterator (C &container, const I &item) |
| template<class C , typename I > | |
| bool | contains (const C &container, const I &item) |
| template<class M , typename K > | |
| bool | mapContains (const M &map, const K &key) |
| template<typename T > | |
| std::vector< uint > | sortIndexes (const std::vector< T > &v) |
| template<typename T > | |
| std::vector< T > | getCSV (std::string str) |
| template<class STL > | |
| bool | hasDuplicates (const STL &container) |
| template<class C , typename I > | |
| uint | getIndex (const C &container, const I &item) |
| bool | doesFileExist (const char *file) |
| std::string | addLineNumbers (const char *str) |
| std::string | baseName (const char *str, bool removeSuffix) |
Variables | |
| const bool | isLittleEndian = ( __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ ) |
API for creating Applications and rasterization-engines.
| using Engine::Array = std::array< C, N > |
| typedef Handle Engine::ArrayIndex |
| typedef unsigned char Engine::Byte |
| typedef HeapArray< Byte > Engine::ByteArray |
| typedef UnorderedMap< int, bool > Engine::CapabilityUnorderedMap |
| using Engine::ConditionalVariable = std::condition_variable |
| using Engine::DoubleRectangle = Rectangle< double > |
| using Engine::FloatRectangle = Rectangle< float > |
| using Engine::Function = std::function< C > |
| typedef uint Engine::Handle |
| using Engine::HeapArray = std::vector< C > |
| using Engine::HeapArray2D = std::vector< std::vector< C > > |
| using Engine::Initializer = std::initializer_list< C > |
| using Engine::InputFfileStream = std::ifstream |
| using Engine::InputStringStream = std::istringstream |
| using Engine::List = std::list< C > |
| using Engine::Mutex = std::mutex |
| using Engine::OrderedMap = std::map< A, B > |
| using Engine::OutputStringStream = std::ostringstream |
| using Engine::Pair = std::pair< A, B > |
| using Engine::Queue = std::queue< C > |
| using Engine::RecursiveMutex = std::recursive_mutex |
| using Engine::Stack = std::stack< C > |
| typedef UnorderedMap< int, bool > Engine::StateEnabledUnorderedMap |
| using Engine::String = std::string |
| using Engine::StringStream = std::stringstream |
| typedef UnorderedSet< std::string > Engine::StringUnorderedSet |
| using Engine::Thread = std::thread |
| typedef uint Engine::TypeID |
| using Engine::UintRectangle = Rectangle< uint > |
| using Engine::UniformBuffer1f = UniformBuffer< float, 1 > |
| using Engine::UniformBuffer1i = UniformBuffer< int, 1 > |
| using Engine::UniformBuffer2f = UniformBuffer< float, 2 > |
| using Engine::UniformBuffer3f = UniformBuffer< float, 3 > |
| using Engine::UniformBuffer4f = UniformBuffer< float, 4 > |
| using Engine::UniformMatrix3f = UniformBuffer< Matrix3f, 1 > |
| using Engine::UniformMatrix4f = UniformBuffer< Matrix4f, 1 > |
| using Engine::UniformValue1f = UniformValue< float > |
| using Engine::UniformValue1i = UniformValue< int > |
| using Engine::UniqueLock = std::unique_lock< C > |
| using Engine::UnorderedMap = std::unordered_map< A, B > |
| using Engine::UnorderedSet = std::unordered_set< C > |
| typedef unsigned short Engine::ushort |
|
inline |
|
inline |
| bool Engine::contains | ( | const C & | container, |
| const I & | item ) |
|
inline |
|
inline |
| int Engine::distance | ( | const Circulator< C > & | a, |
| const Circulator< C > & | b ) |
Gets the distance of 2 Circulators. This returns the shortest-distance regardless of order.
|
inline |
| C::iterator Engine::findIterator | ( | C & | container, |
| const I & | item ) |
| C::const_iterator Engine::findIterator | ( | const C & | container, |
| const I & | item ) |
| uint Engine::forwardDistance | ( | const Circulator< C > & | a, |
| const Circulator< C > & | b ) |
Gets the distance of 2 Circulators. This returns the forward-distance, order implied.
|
inline |
|
inline |
|
inline |
| bool Engine::mapContains | ( | const M & | map, |
| const K & | key ) |
| int Engine::shortestDistance | ( | const Circulator< C > & | a, |
| const Circulator< C > & | b ) |
Gets shortest-distance between 2 Circulators.
|
inline |
| const bool Engine::isLittleEndian = ( __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__ ) |