![]() |
Lumiera
0.pre.03
»edityourfreedom«
|
Implementation namespace for support and library code.
Namespaces | |
con | |
diff | |
factory | |
hash | |
Hash implementations usable for the HashIndexed mixin as well as key within std::unordered_map. | |
idi | |
Identification Schemes. | |
iter | |
iter_explorer | |
iter_source | |
iter_stl | |
linked_elements | |
maybe | |
meta | |
polyvalue | |
query | |
sync | |
Helpers and building blocks for Monitor based synchronisation. | |
test | |
time | |
variant | |
visitor | |
wrapper | |
Typedefs | |
typedef size_t | HashVal |
a STL compatible hash value More... | |
typedef size_t | IxID |
typedef lumiera_uid * | LUID |
a Lumiera UID More... | |
typedef smatch::value_type const & | SubMatch |
typedef vector< string > | VectS |
Classes | |
class | AddressExposingIter |
wrapper for an existing Iterator type to expose the address of each value yielded. More... | |
class | AllocationCluster |
A pile of objects sharing common allocation and lifecycle. More... | |
class | Allocator_TransferNoncopyable |
Addendum to scoped-holder.hpp for transferring the lifecycle management to another instance. More... | |
class | AutoRegistered |
Helper mixin template for implementing a type intended to participate in automatic element tracking. More... | |
class | CallQueue |
A threadsafe queue for bound void(void) functors. More... | |
class | ClassLock |
A synchronisation protection guard employing a lock scoped to the parameter type as a whole, not an individual instance. More... | |
class | Cmdline |
Abstraction of the usual int argc, int** argv -Commandline, to be able to treat it as a vector of strings. More... | |
class | ConstIter |
wrapper to expose values as const More... | |
class | CustomAllocator |
Policy: use just plain heap allocations. More... | |
class | DelStash |
Manage a collection of deleter functions. More... | |
class | Depend |
Access point to singletons and other kinds of dependencies designated by type. More... | |
class | DependencyFactory |
Helper to abstract creation and lifecycle of a dependency. More... | |
singleton | DependInject |
This framework allows to (re)configure the lib::Depend front-end for dependency-injection. More... | |
class | DiagnosticContext |
Diagnostic data frame to collect specific information concerning a scope. More... | |
class | ElementTracker |
Registry for tracking object instances. More... | |
class | ExtendedSubId |
class | ExtensibleFilterIter |
Additional capabilities for FilterIter, allowing to extend the filter condition underway. More... | |
class | FamilyMember |
Utility to produce member IDs for objects belonging to a "Family", as defined by a distinguishing type. More... | |
struct | FilterCore |
Implementation of the filter logic. More... | |
class | FilterIter |
Iterator tool filtering pulled data according to a predicate. More... | |
class | Handle |
Generic opaque reference counting handle, for accessing a service and managing its lifecycle. More... | |
struct | HashIndexed |
A Mixin to add a private ID type to the target class, together with storage to hold an instance of this ID, getter and setter, and a templated version of the ID type which can be used to pass specific subclass type info. More... | |
struct | IdentityCore |
A neutral identity-function core, also serving as point-of reference how any core is intended to work. More... | |
class | InPlaceAnyHolder |
Inline buffer to hold and own an object while concealing the concrete type. More... | |
struct | InPlaceAnyHolder_unrelatedTypes |
Alternative policy for accessing the contents without a common interface; use this policy if the intention is to use OpaqueHolder with a family of similar classes, without requiring all of them to be derived from a common base class. More... | |
struct | InPlaceAnyHolder_useCommonBase |
Standard policy for accessing the contents via a common base class interface. More... | |
class | InPlaceBuffer |
Buffer to place and maintain an object instance privately within another object. More... | |
class | IterAdapter |
Adapter for building an implementation of the »Lumiera Forward Iterator« concept. More... | |
class | IterCursor |
A cursor-like iterator with the ability to switch iteration direction. More... | |
class | IterExplorer |
Adapter for using an Iterator in the way of a Monad This allows to "bind" or "flatMap" a functor, thereby creating a derived version of the iterator, yielding the (flattened) combination of all the results generated by this bound functor. More... | |
struct | IterExploreSource |
Iterator front-end to manage and operate a TreeExplorer pipeline opaquely. More... | |
struct | IterQueue |
A Queue which can be pulled by iterating. More... | |
class | IterSource |
Iteration source interface to abstract a data source, which then can be accessed through IterAdapter as a frontend, allowing to pull individual elements until exhaustion. More... | |
struct | IterStack |
A Stack which can be popped by iterating. More... | |
class | IterStateWrapper |
Another Lumiera Forward Iterator building block, based on incorporating a state type right into the iterator. More... | |
class | IterTool |
Standard functionality to build up any iterator tool. More... | |
struct | IterType |
Helper for type rewritings: get the element type for an iterator like entity. More... | |
struct | IterType< Iter< TY, CON > > |
struct | IterType< RangeIter< IT > > |
class | LinkedElements |
Intrusive single linked list, possibly taking ownership of node elements. More... | |
class | Literal |
inline string literal This is a marker type to indicate that More... | |
class | Maybe |
A value, which might be unavailable. More... | |
class | NobugResourceHandleContext |
Disabled placeholder for the Diagnostic context, not used in release builds. More... | |
struct | NoInstantiationCount |
Policy: no additional instantiation accounting. More... | |
struct | NullValue |
Singleton holder for NIL or default value objects. More... | |
class | NumIter |
Enumerate all "numbers" within a range. More... | |
class | OpaqueHolder |
Inline buffer to hold and own an object while concealing the concrete type. More... | |
class | OptionalRef |
Optional or switchable link to an existing object. More... | |
class | OrientationIndicator |
class | P |
Customised refcounting smart pointer template, built upon std::shared_ptr, but forwarding type relationships and ordering operators to the pointee objects. More... | |
class | PathArray |
Abstraction for path-like topological coordinates. More... | |
class | PlantingHandle |
handle to allow for safe _»remote implantation«_ of an unknown subclass into a given opaque InPlaceBuffer, without having to disclose the concrete buffer type or size. More... | |
class | PolymorphicValue |
Template to build polymorphic value objects. More... | |
class | PtrDerefIter |
wrapper for an existing Iterator type, automatically dereferencing the output of the former. More... | |
class | QueryText |
Syntactical query representation. More... | |
class | RangeIter |
Accessing a STL element range through a Lumiera forward iterator, An instance of this iterator adapter is completely self-contained and allows to iterate once over the range of elements, until pos==end . More... | |
class | RefArray |
Abstraction: Array of const references. More... | |
class | RefArrayTable |
RefArray implementation based on a fixed size array, i.e. More... | |
class | RefArrayVector |
This variation of the wrapper actually is a vector, but can act as a RefArray. More... | |
class | RefArrayVectorWrapper |
Wrap a vector holding objects of a subtype and provide array-like access using the interface type. More... | |
class | Result |
Optional Result value or status of some operation. More... | |
class | Result< void > |
Specialisation for signalling success or failure, without returning any value result. More... | |
class | ScopedCollection |
A fixed collection of non-copyable polymorphic objects. More... | |
class | ScopedHolder |
Inline buffer holding and owning an object similar to unique_ptr. More... | |
class | ScopedPtrHolder |
Extension to std::unique_ptr, allowing copy operations on empty pointers (i.e. More... | |
class | ScopedPtrVect |
Simple vector based collection of pointers, managing lifecycle of the pointed-to objects. More... | |
class | SearchPathSplitter |
Helper: Access a path Specification as a sequence of filesystem Paths. More... | |
class | SimpleAllocator |
Frontend for explicit allocations, using a custom allocator. More... | |
class | SingleValCore |
Implementation of a singleton value holder, which discards the contained value once "iterated". More... | |
class | SingleValIter |
Pseudo-Iterator to yield just a single value. More... | |
class | SkipRepetition |
Helper: predicate returning true whenever the argument value changes during a sequence of invocations. More... | |
class | SubId |
class | SubID |
class | Symbol |
Token or Atom with distinct identity. More... | |
class | SymbolTable |
Table for automatically interned strings. More... | |
class | Sync |
Facility for monitor object based locking. More... | |
class | ThreadLocalPtr |
Thread local pointer without ownership management. More... | |
class | TransformingCore |
Implementation of custom processing logic. More... | |
class | TransformIter |
Iterator tool treating pulled data by a custom transformation (function) More... | |
class | Tree |
A STL-like tree implementation class. More... | |
class | tree_node_ |
A node in the tree, combining links to other nodes as well as the actual data. More... | |
class | TreeExplorer |
Adapter to build a demand-driven tree expanding and exploring computation based on a custom opaque state core. More... | |
class | TypedAllocationManager |
Foundation for a custom allocation manager, tracking the created objects by smart-ptrs. More... | |
class | TypedContext |
Provide type-IDs for a specific context. More... | |
class | TypedCounter |
Utility providing a set of counters, each tied to a specific type. More... | |
class | UniqueMallocOwner |
Ownership token for a piece of heap memory allocated in plain-C style. More... | |
struct | UseInstantiationCounting |
Policy: maintain explicit per type instance count. More... | |
class | Variant |
Typesafe union record. More... | |
class | VariantO |
A variant wrapper (typesafe union) capable of holding a value of any of a bounded collection of types. More... | |
singleton | VerbToken |
Action token implemented by double dispatch to a handler function, as defined in the "receiver" interface (parameter REC ). More... | |
class | VerbToken< REC, RET(ARGS...)> |
class | WrappedLumieraIter |
Standard implementation of the IterSource interface: a wrapped "Lumiera Forward Iterator". More... | |
class | ZombieCheck |
Automatic lifecycle tracker, to produce an alarm when accessing objects after deletion. More... | |
Functions | |
template<class IT , class CON > | |
void | append_all (IT iter, CON &container) |
template<class IT > | |
iter_explorer::BreadthFirst< IT > | breadthFirst (IT const &srcSeq) |
template<class T1 , class T2 > | |
void | constructor (T1 *p, T2 &val) |
template<class T1 > | |
void | constructor (T1 *p) |
template<class IT > | |
iter_explorer::DepthFirst< IT > | depthFirst (IT const &srcSeq) |
template<class T1 > | |
void | destructor (T1 *p) |
template<typename INT > | |
NumIter< INT > | eachNum (INT start, INT end) |
convenience function to iterate "each number" More... | |
template<typename T > | |
IterQueue< T > | elements (T const &elm) |
convenience free function to build an iterable sequence More... | |
template<typename T > | |
IterQueue< T > | elements (T const &e0, T const &e1) |
template<typename T > | |
IterQueue< T > | elements (T const &e0, T const &e1, T const &e2) |
template<typename T > | |
IterQueue< T > | elements (T const &e0, T const &e1, T const &e2, T const &e3) |
template<typename T > | |
IterQueue< T > | elements (T const &e0, T const &e1, T const &e2, T const &e3, T const &e4) |
template<class IT > | |
IterExplorer < iter_explorer::WrappedSequence < IT > > | exploreIter (IT const &srcSeq) |
template<class IT , typename PRED > | |
auto | filterIterator (IT const &src, PRED filterPredicate) |
Build a FilterIter: convenience free function shortcut, picking up the involved types automatically. More... | |
template<class IT , typename PRED > | |
auto | filterIterator (IT &&src, PRED filterPredicate) |
template<class IT > | |
auto | filterRepetitions (IT const &source) |
filters away repeated values emitted by source iterator More... | |
template<class IT > | |
auto | filterRepetitions (IT &&source) |
string | findExePath () |
retrieve the location of the executable More... | |
HashVal | hash_value (QueryText const &entry) |
support using queries in hashtables. More... | |
size_t | hash_value (SubID const &sID) |
size_t | hash_value (Literal literal) |
generate hash value based on the Literal's contents. More... | |
size_t | hash_value (Symbol sym) |
hash value for Symbols is directly based on the symbol table entry More... | |
template<class IT > | |
iter_explorer::ChainedIters< IT > | iterChain (IT const &seq) |
template<class IT > | |
iter_explorer::ChainedIters< IT > | iterChain (IT const &seq1, IT const &seq2) |
template<class IT > | |
iter_explorer::ChainedIters< IT > | iterChain (IT const &seq1, IT const &seq2, IT const &seq3) |
template<class IT > | |
iter_explorer::ChainedIters< IT > | iterChain (IT const &seq1, IT const &seq2, IT const &seq3, IT const &seq4) |
template<class IT > | |
iter_explorer::ChainedIters< IT > | iterChain (IT const &seq1, IT const &seq2, IT const &seq3, IT const &seq4, IT const &seq5) |
LUMIERA_ERROR_DECLARE (FILE_NOT_DIRECTORY) | |
path element points at a file instead of a directory More... | |
LUMIERA_ERROR_DEFINE (FILE_NOT_DIRECTORY,"path element points at a file instead of a directory") | |
template<typename X , typename... ARGS> | |
P< X > | makeP (ARGS &&...ctorArgs) |
Helper to create and manage by lib::P. More... | |
template<typename TY1 , typename TY2 , class ALO > | |
bool | operator!= (Allocator_TransferNoncopyable< TY1, ALO > const &, Allocator_TransferNoncopyable< TY2, ALO > const &) |
bool | operator!= (Literal const &s1, Literal const &s2) |
bool | operator!= (Symbol const &s1, Symbol const &s2) |
bool | operator!= (Literal s1, const char *s2) |
bool | operator!= (const char *s1, Literal s2) |
bool | operator!= (Symbol s1, const char *s2) |
bool | operator!= (const char *s1, Symbol s2) |
bool | operator!= (Literal s1, Symbol s2) |
bool | operator!= (Symbol s1, Literal s2) |
bool | operator!= (Literal s1, std::string s2) |
bool | operator!= (std::string s1, Literal s2) |
bool | operator!= (Symbol s1, std::string s2) |
bool | operator!= (std::string s1, Symbol s2) |
template<class I1 , class I2 > | |
bool | operator!= (PtrDerefIter< I1 > const &il, PtrDerefIter< I2 > const &ir) |
template<class CX > | |
bool | operator!= (IterTool< CX > const &ito1, IterTool< CX > const &ito2) |
template<class P1 , class P2 , class CON > | |
bool | operator!= (IterAdapter< P1, CON > const &il, IterAdapter< P2, CON > const &ir) |
template<class I1 , class I2 > | |
bool | operator!= (AddressExposingIter< I1 > const &il, AddressExposingIter< I2 > const &ir) |
template<class T1 , class T2 , class ST > | |
bool | operator!= (IterStateWrapper< T1, ST > const &il, IterStateWrapper< T2, ST > const &ir) |
template<class I1 , class I2 > | |
bool | operator!= (RangeIter< I1 > const &il, RangeIter< I2 > const &ir) |
template<size_t cl, size_t cr> | |
bool | operator!= (PathArray< cl > const &l, PathArray< cr > const &r) |
template<class I1 , class I2 > | |
bool | operator!= (NumIter< I1 > const &il, NumIter< I2 > const &ir) |
template<class I1 , class I2 > | |
bool | operator!= (ConstIter< I1 > const &il, ConstIter< I2 > const &ir) |
std::string | operator+ (std::string str, Literal const &sym) |
string concatenation More... | |
std::string | operator+ (Literal const &sym, std::string str) |
bool | operator== (SubID const &id1, SubID const &id2) |
template<typename TY1 , typename TY2 , class ALO > | |
bool | operator== (Allocator_TransferNoncopyable< TY1, ALO > const &, Allocator_TransferNoncopyable< TY2, ALO > const &) |
bool | operator== (Literal const &s1, Literal const &s2) |
bool | operator== (Symbol const &s1, Symbol const &s2) |
bool | operator== (const char *s1, Literal s2) |
bool | operator== (Symbol s1, const char *s2) |
bool | operator== (const char *s1, Symbol s2) |
bool | operator== (Literal s1, Symbol s2) |
bool | operator== (Symbol s1, Literal s2) |
bool | operator== (Literal s1, std::string s2) |
bool | operator== (std::string s1, Literal s2) |
bool | operator== (Symbol s1, std::string s2) |
bool | operator== (std::string s1, Symbol s2) |
template<class I1 , class I2 > | |
bool | operator== (PtrDerefIter< I1 > const &il, PtrDerefIter< I2 > const &ir) |
Supporting equality comparisons... More... | |
template<class CX > | |
bool | operator== (IterTool< CX > const &it1, IterTool< CX > const &it2) |
template<class P1 , class P2 , class CON > | |
bool | operator== (IterAdapter< P1, CON > const &il, IterAdapter< P2, CON > const &ir) |
Supporting equality comparisons... More... | |
template<class I1 , class I2 > | |
bool | operator== (AddressExposingIter< I1 > const &il, AddressExposingIter< I2 > const &ir) |
Supporting equality comparisons... More... | |
template<class T1 , class T2 , class ST > | |
bool | operator== (IterStateWrapper< T1, ST > const &il, IterStateWrapper< T2, ST > const &ir) |
Supporting equality comparisons of equivalent iterators (same state type)... More... | |
template<class I1 , class I2 > | |
bool | operator== (RangeIter< I1 > const &il, RangeIter< I2 > const &ir) |
Supporting equality comparisons... More... | |
template<size_t cl, size_t cr> | |
bool | operator== (PathArray< cl > const &l, PathArray< cr > const &r) |
Equality comparison of arbitrary PathArray objects. More... | |
template<class I1 , class I2 > | |
bool | operator== (NumIter< I1 > const &il, NumIter< I2 > const &ir) |
Supporting equality comparisons... More... | |
template<class I1 , class I2 > | |
bool | operator== (ConstIter< I1 > const &il, ConstIter< I2 > const &ir) |
Supporting equality comparisons... More... | |
template<typename T > | |
OptionalRef< T > | optionalRefTo (T &target) |
template<class IT > | |
IT::value_type | pull_last (IT iter) |
string | replaceMagicLinkerTokens (string const &src) |
replace $ORIGIN tokens in the given string More... | |
string | resolveModulePath (fsys::path moduleName, string searchPath="") |
helper to establish the location to search for loadable modules, configuration files, icons and further resources. More... | |
template<class VAL > | |
auto | singleValIterator (VAL &&something) |
Build a SingleValIter: convenience free function shortcut, to pick up just any value and wrap it as Lumiera Forward Iterator. More... | |
template<class VAL > | |
auto | singleValIterator (VAL const &ref) |
template<class IT , typename FUN > | |
auto | transformIterator (IT const &src, FUN processingFunc) |
Build a TransformIter: convenience free function shortcut, picking up the involved types automatically. More... | |
template<class IT , typename FUN > | |
auto | transformIterator (IT &&src, FUN processingFunc) |
template<class IT > | |
auto | treeExplore (IT &&srcSeq) |
start building a TreeExplorer by suitably wrapping the given iterable source. More... | |
Variables | |
const size_t | STRING_MAX_RELEVANT |
safety guard: maximum number of chars to process. More... | |
typedef vector<string> VectS |
Definition at line 47 of file cmdline.hpp.
typedef size_t HashVal |
a STL compatible hash value
Definition at line 56 of file hash-value.h.
typedef lumiera_uid* LUID |
a Lumiera UID
Definition at line 59 of file hash-value.h.
typedef smatch::value_type const& SubMatch |
Definition at line 52 of file searchpath.hpp.
typedef size_t IxID |
Definition at line 72 of file typed-counter.hpp.
struct lib::IterType |
struct lib::IterType< Iter< TY, CON > > |
class lib::PathArray |
class lib::tree_node_ |
Class Members | ||
---|---|---|
tree_node_< T > * | parent | |
tree_node_< T > * | first_child | |
tree_node_< T > * | last_child | |
tree_node_< T > * | prev_sibling | |
tree_node_< T > * | next_sibling | |
T | data |
singleton lib::VerbToken |
bool lib::operator== | ( | PtrDerefIter< I1 > const & | il, |
PtrDerefIter< I2 > const & | ir | ||
) |
Supporting equality comparisons...
Definition at line 216 of file iter-adapter-ptr-deref.hpp.
References PtrDerefIter< IT >::getBase().
Referenced by TreeMutatorBinding_test::mutateCollection().
bool lib::operator!= | ( | PtrDerefIter< I1 > const & | il, |
PtrDerefIter< I2 > const & | ir | ||
) |
Definition at line 219 of file iter-adapter-ptr-deref.hpp.
Referenced by TreeMutatorBinding_test::mutateCollection().
bool lib::operator== | ( | AddressExposingIter< I1 > const & | il, |
AddressExposingIter< I2 > const & | ir | ||
) |
Supporting equality comparisons...
Definition at line 325 of file iter-adapter-ptr-deref.hpp.
References AddressExposingIter< IT >::getBase().
bool lib::operator!= | ( | AddressExposingIter< I1 > const & | il, |
AddressExposingIter< I2 > const & | ir | ||
) |
Definition at line 328 of file iter-adapter-ptr-deref.hpp.
|
inline |
Supporting equality comparisons...
Definition at line 299 of file iter-adapter.hpp.
References IterAdapter< POS, CON >::pos_.
|
inline |
Definition at line 302 of file iter-adapter.hpp.
|
inline |
Supporting equality comparisons of equivalent iterators (same state type)...
Definition at line 426 of file iter-adapter.hpp.
References IterStateWrapper< T, ST >::core_, IterStateWrapper< T, ST >::empty(), and IterStateWrapper< T, ST >::isValid().
|
inline |
Definition at line 434 of file iter-adapter.hpp.
|
inline |
Supporting equality comparisons...
Definition at line 556 of file iter-adapter.hpp.
References RangeIter< IT >::getPos().
|
inline |
Definition at line 559 of file iter-adapter.hpp.
|
inline |
Supporting equality comparisons...
Definition at line 664 of file iter-adapter.hpp.
References NumIter< INT >::getPos().
|
inline |
Definition at line 667 of file iter-adapter.hpp.
|
inline |
convenience function to iterate "each number"
Definition at line 674 of file iter-adapter.hpp.
Referenced by FormatHelper_test::checkStringify(), and IterAdapter_test::enumerate().
|
inline |
Supporting equality comparisons...
Definition at line 787 of file iter-adapter.hpp.
References ConstIter< IT >::getBase().
|
inline |
Definition at line 790 of file iter-adapter.hpp.
|
inline |
Definition at line 939 of file iter-explorer.hpp.
Referenced by IterTreeExplorer_test::verify_asIterSource(), and IterExplorer_test::verifyMonadOperator().
|
inline |
Definition at line 947 of file iter-explorer.hpp.
Referenced by HierarchyOrientationIndicator_test::demonstrate_tree_rebuilding(), and IterExplorer_test::verifyDepthFirstExploration().
|
inline |
Definition at line 955 of file iter-explorer.hpp.
Referenced by IterExplorer_test::verifyBreadthFirstExploration().
|
inline |
Definition at line 964 of file iter-explorer.hpp.
Referenced by IterExplorer_test::verifyChainedIterators().
|
inline |
Definition at line 974 of file iter-explorer.hpp.
|
inline |
Definition at line 985 of file iter-explorer.hpp.
|
inline |
Definition at line 997 of file iter-explorer.hpp.
|
inline |
Definition at line 1010 of file iter-explorer.hpp.
|
inline |
convenience free function to build an iterable sequence
Definition at line 295 of file iter-stack.hpp.
Referenced by ScopedPtrVect< node::DummyTick >::allPtrs(), LinkedElements_test::iterating(), lumiera_priqueue_reserve(), LinkedElements_test::populate_by_iterator(), LinkedElements< proc::engine::JobTicket::Prerequisite >::pushAll(), IterQueue_test::run(), LinkedElements_test::simpleUsage(), LinkedElements_test::verify_customAllocator(), LinkedElements_test::verify_ExceptionSafety(), LinkedElements_test::verify_nonOwnership(), LinkedElements_test::verify_RAII_safety(), IterExplorer_test::verifyBreadthFirstExploration(), IterExplorer_test::verifyDepthFirstExploration(), and IterExplorer_test::verifyRecursiveSelfIntegration().
|
inline |
Definition at line 302 of file iter-stack.hpp.
References IterQueue< TY >::feed().
|
inline |
Definition at line 309 of file iter-stack.hpp.
References IterQueue< TY >::feed().
|
inline |
Definition at line 316 of file iter-stack.hpp.
References IterQueue< TY >::feed().
|
inline |
Definition at line 323 of file iter-stack.hpp.
References IterQueue< TY >::feed().
|
inline |
start building a TreeExplorer by suitably wrapping the given iterable source.
Definition at line 1262 of file iter-tree-explorer.hpp.
Referenced by TreeStructureNavigator::buildIterator(), IterTreeExplorer_test::demonstrate_LayeredEvaluation(), IterTreeExplorer_test::verify_asIterSource(), IterTreeExplorer_test::verify_combinedExpandTransform(), IterTreeExplorer_test::verify_depthFirstExploration(), IterTreeExplorer_test::verify_expandOperation(), IterTreeExplorer_test::verify_FilterIterator(), IterTreeExplorer_test::verify_IterSource(), IterTreeExplorer_test::verify_scheduledExpansion(), IterTreeExplorer_test::verify_transformOperation(), IterTreeExplorer_test::verify_wrappedIterator(), and IterTreeExplorer_test::verify_wrappedState().
|
inline |
Definition at line 253 of file itertools.hpp.
|
inline |
Definition at line 262 of file itertools.hpp.
|
inline |
Build a FilterIter: convenience free function shortcut, picking up the involved types automatically.
filterPredicate | to be invoked for each source element |
Definition at line 376 of file itertools.hpp.
Referenced by IterTools_test::buildFilterIterator(), and filterRepetitions().
|
inline |
Definition at line 383 of file itertools.hpp.
|
inline |
Build a SingleValIter: convenience free function shortcut, to pick up just any value and wrap it as Lumiera Forward Iterator.
Definition at line 659 of file itertools.hpp.
Referenced by IterTools_test::buildWrappedSingleElement(), GenNodeLocationQuery::childNavigator(), lib::iter_source::singleVal(), and IterTreeExplorer_test::verify_depthFirstExploration().
|
inline |
Definition at line 666 of file itertools.hpp.
|
inline |
Build a TransformIter: convenience free function shortcut, picking up the involved types automatically.
processingFunc | to be invoked for each source element |
Definition at line 790 of file itertools.hpp.
Referenced by IterTools_test::buildTransformingIterator(), FormatHelper_test::checkStringJoin(), GenNodeLocationQuery::childNavigator(), Record< VAL >::keys(), Record< VAL >::operator std::string(), TestMutationTarget::showContent(), TestMutationTarget::showSrcBuffer(), util::stringify(), lib::iter_source::transform(), and Record< VAL >::vals().
|
inline |
Definition at line 798 of file itertools.hpp.
|
inline |
Definition at line 812 of file itertools.hpp.
Referenced by EngineService::calculate(), PlayProcess::initiate(), ScopePath::navigate(), DiffListGeneration_test::run(), MutationMessage_test::verify_builder(), and DispatcherInterface_test::verify_standardDispatcherUsage().
|
inline |
Definition at line 821 of file itertools.hpp.
Referenced by DispatcherInterface_test::check_ContinuationBuilder(), GenNodeLocationQuery::getCurrentWindow(), and IterTools_test::verifyPullLast().
|
inline |
filters away repeated values emitted by source iterator
Definition at line 848 of file itertools.hpp.
References filterIterator().
Referenced by lib::iter_source::eachDistinctKey(), and IterTools_test::verify_filterRepetitions().
|
inline |
Definition at line 856 of file itertools.hpp.
References filterIterator().
OptionalRef<T> lib::optionalRefTo | ( | T & | target | ) |
Definition at line 152 of file optional-ref.hpp.
|
inline |
bool lib::operator== | ( | PathArray< cl > const & | l, |
PathArray< cr > const & | r | ||
) |
Equality comparison of arbitrary PathArray objects.
Definition at line 580 of file path-array.hpp.
References util::isnil().
bool lib::operator!= | ( | PathArray< cl > const & | l, |
PathArray< cr > const & | r | ||
) |
Definition at line 597 of file path-array.hpp.
HashVal lib::hash_value | ( | QueryText const & | entry | ) |
support using queries in hashtables.
Definition at line 61 of file query-text.cpp.
References QueryText::definition_.
Referenced by SymbolHashtable_test::checkHashFunction(), Symbol_test::checkLiteral(), Symbol_test::checkSymbolCreation(), hash_value(), and QueryText_test::useHashValue().
|
inline |
Definition at line 133 of file scoped-holder-transfer.hpp.
|
inline |
Definition at line 138 of file scoped-holder-transfer.hpp.
lib::LUMIERA_ERROR_DEFINE | ( | FILE_NOT_DIRECTORY | , |
"path element points at a file instead of a directory" | |||
) |
string findExePath | ( | ) |
retrieve the location of the executable
helper to figure out the installation directory, as given by the absolute path of the currently executing program
Definition at line 54 of file searchpath.cpp.
References GET_PATH_TO_EXECUTABLE, and STRING_MAX_RELEVANT.
Referenced by replaceMagicLinkerTokens(), and SearchPathSplitter_test::resolveEmbeddedOriginToken().
string replaceMagicLinkerTokens | ( | string const & | src | ) |
replace $ORIGIN tokens in the given string
helper to replace all $ORIGIN prefixes in a given string by the directory holding the current executable
Definition at line 75 of file searchpath.cpp.
References findExePath().
string resolveModulePath | ( | fsys::path | moduleName, |
string | searchPath = "" |
||
) |
helper to establish the location to search for loadable modules, configuration files, icons and further resources.
After first trying the moduleName directly, the given search path is walked using the SearchPathSplitter, until encountering an existing file with the given name.
error::Config | when the resolution fails |
Definition at line 89 of file searchpath.cpp.
References BuilderDoxygen::exists(), SearchPathSplitter::isValid(), SearchPathSplitter::next(), and TRACE().
Referenced by StyleManager::setTheme().
lib::LUMIERA_ERROR_DECLARE | ( | FILE_NOT_DIRECTORY | ) |
path element points at a file instead of a directory
|
inline |
Definition at line 89 of file sub-id.hpp.
References hash_value().
|
inline |
Definition at line 95 of file sub-id.hpp.
size_t hash_value | ( | Literal | literal | ) |
generate hash value based on the Literal's contents.
This function is intended to be picked up by ADL, and should be usable both with std::hash
and <boost/functional/hash.hpp>
. It is implemented similar as the boost::hash specialisation for std::string
Definition at line 110 of file symbol-impl.cpp.
References hash, and STRING_MAX_RELEVANT.
size_t hash_value | ( | Symbol | sym | ) |
hash value for Symbols is directly based on the symbol table entry
Definition at line 126 of file symbol-impl.cpp.
References Literal::c().
|
inline |
Definition at line 178 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 179 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 183 of file symbol.hpp.
|
inline |
Definition at line 184 of file symbol.hpp.
|
inline |
Definition at line 185 of file symbol.hpp.
|
inline |
Definition at line 186 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 187 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 188 of file symbol.hpp.
|
inline |
Definition at line 189 of file symbol.hpp.
|
inline |
Definition at line 190 of file symbol.hpp.
|
inline |
Definition at line 191 of file symbol.hpp.
|
inline |
Definition at line 195 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 196 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 197 of file symbol.hpp.
|
inline |
Definition at line 198 of file symbol.hpp.
|
inline |
Definition at line 199 of file symbol.hpp.
|
inline |
Definition at line 200 of file symbol.hpp.
|
inline |
Definition at line 201 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 202 of file symbol.hpp.
References Literal::c().
|
inline |
Definition at line 203 of file symbol.hpp.
|
inline |
Definition at line 204 of file symbol.hpp.
|
inline |
Definition at line 205 of file symbol.hpp.
|
inline |
Definition at line 206 of file symbol.hpp.
|
inline |
string concatenation
Definition at line 212 of file symbol.hpp.
|
inline |
Definition at line 219 of file symbol.hpp.
void lib::constructor | ( | T1 * | p, |
T2 & | val | ||
) |
Definition at line 67 of file tree.hpp.
Referenced by Tree< T, tree_node_allocator >::append_child(), Tree< T, tree_node_allocator >::insert(), Tree< T, tree_node_allocator >::insert_after(), Tree< T, tree_node_allocator >::prepend_child(), and Tree< T, tree_node_allocator >::replace().
void lib::destructor | ( | T1 * | p | ) |
Definition at line 79 of file tree.hpp.
Referenced by Tree< T, tree_node_allocator >::erase(), Tree< T, tree_node_allocator >::erase_children(), and Tree< T, tree_node_allocator >::replace().
const size_t STRING_MAX_RELEVANT |
safety guard: maximum number of chars to process.
For comparisons, hash calculations etc., when dealing with raw char ptrs (typically literal values)
Definition at line 58 of file symbol-impl.cpp.
Referenced by SymbolHashtable_test::checkHashFunction(), findExePath(), and hash_value().