 |
aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
|
|
aGrUM 3.0.0
a C++ library for (probabilistic) graphical models
|
gum is the global namespace for all aGrUM entities More...
Namespaces | |
| namespace | __sig__ |
| Internal namespace for aGrUM signaler/listener components. | |
| namespace | __debug__ |
| Internal namespace for aGrUM debugging tools. | |
| namespace | aggregator |
| Aggregators are functional description of CPTs. | |
| namespace | complexity |
| Internal namespace for complexity tools (quite empty for now). | |
| namespace | credal |
| namespace for all credal networks entities | |
| namespace | prm |
| namespace for all probabilistic relational models entities | |
| namespace | formula |
| namespace | threadsOMP |
| namespace | threadsSTL |
| namespace | _rand_namespace_ |
| namespace | learning |
| include the inlined functions if necessary | |
| namespace | graph |
Classes | |
| class | ApproximationPolicy |
| Mother class for all approximation policy classes. More... | |
| class | ApproximationScheme |
| Approximation Scheme. More... | |
| class | ApproximationSchemeListener |
| The ApproximationSchemeListener class. More... | |
| class | ExactPolicy |
| Class implementing exact approximation policy (meaning a value is approximate to itself). More... | |
| class | IApproximationSchemeConfiguration |
| Approximation Scheme. More... | |
| class | LinearApproximationPolicy |
| Class implementing linear approximation policy (meaning possible value are split out in interval). More... | |
| struct | ArgMaxSet |
| Class to handle efficiently argMaxSet. More... | |
| class | AVLTree |
| AVL binary search tree. More... | |
| class | AVLTreeIterator |
| AVL binary search tree iterator. More... | |
| class | AVLTreeIteratorSafe |
| AVL binary search tree safe (w.r.t. More... | |
| class | AVLTreeReverseIterator |
| AVL binary search tree reverse iterator. More... | |
| class | AVLTreeReverseIteratorSafe |
| AVL binary search tree safe (w.r.t. More... | |
| class | BijectionImplementation |
| A non scalar implementation of a Bijection. More... | |
| class | BijectionIteratorGet |
| Dummy classes for discriminating scalars and non-scalars operators and -> wihtout any overhead. More... | |
| struct | BijectionIteratorGet< true > |
| class | BijectionIteratorSafe |
| Safe iterators for bijectionIterator. More... | |
| class | BijectionIterator |
| Unsafe iterators for bijection. More... | |
| class | Bijection |
| Set of pairs of elements with fast search for both elements. More... | |
| class | BinSearchTree |
| A generic binary search tree. More... | |
| class | BinSearchTreeIterator |
| A Generic binary search tree. More... | |
| class | BinTreeNode |
| Nodes of a binary trees. More... | |
| class | ParseError |
| This class is used to represent parsing errors for the different parser implemented in aGrUM. More... | |
| class | ErrorsContainer |
| This class is used contain and manipulate gum::ParseError. More... | |
| class | Exception |
| Base class for all aGrUM's exceptions. More... | |
| struct | Maximizes |
| Maximization function object class. More... | |
| struct | Minimizes |
| Minimization function object class. More... | |
| struct | ArgumentMaximises |
| Arg Max function object class. More... | |
| class | HashFuncConst |
| Useful constants for hash functions. More... | |
| class | HashFuncBase |
| All hash functions should inherit from this class. More... | |
| class | HashFuncSmallKey |
| Generic hash functions for numeric keys smaller than or equal to Size. More... | |
| class | HashFuncSmallCastKey |
| Generic hash functions for keys castable as Size and whose size is strictly smaller than that of Size. More... | |
| class | HashFuncMediumCastKey |
| Generic hash functions for keys castable as Size and whose size is precisely that of Size. More... | |
| class | HashFuncLargeCastKey |
| Generic hash functions for keys castable as Size and whose size is precisely twice that of Size. More... | |
| class | HashFuncCastKey |
| Generic hash functions for keys castable as Size whose size is either smaller than Size, or equal to that of one or two Size. More... | |
| class | dummyHash |
| class | HashFuncConditionalType |
| This class enables to safely define hash functions for types that may or may not already has defined hash functions. More... | |
| struct | HashFuncConditionalType< Key > |
| struct | HashFuncConditionalType< KEY_TYPE, TYPE > |
| struct | HashFuncConditionalType< KEY_TYPE, FIRST_TYPE, OTHER_TYPES... > |
| class | HashFunc |
| This class should be useless as only its specializations should be used. More... | |
| class | HashFunc< std::pair< Key1, Key2 > > |
| class | HashFunc< bool > |
| Hash function for booleans. More... | |
| class | HashFunc< int > |
| Hash function for integers. More... | |
| class | HashFunc< unsigned int > |
| Hash function for unsigned integers. More... | |
| class | HashFunc< long > |
| Hash function for long integers. More... | |
| class | HashFunc< unsigned long > |
| Hash function for unsigned long integers. More... | |
| class | HashFunc< typename HashFuncConditionalType< std::size_t, unsigned long, unsigned int, long, int >::type > |
| Hash function for std::size_t. More... | |
| class | HashFunc< float > |
| Hash function for floats. More... | |
| class | HashFunc< double > |
| Hash function for doubles. More... | |
| class | HashFunc< Type * > |
| Hash function for pointers. More... | |
| class | HashFunc< std::string > |
| Hash function for strings. More... | |
| class | HashFunc< std::vector< Idx > > |
| Hash function for vectors of gum::Idx. More... | |
| class | HashFunc< Debug > |
| Hash function for gum::Debug. More... | |
| class | HashFunc< std::shared_ptr< Type > > |
| Hash function for shared pointers. More... | |
| class | HashTableConst |
| Parameters specifying the default behavior of the hashtables. More... | |
| class | HashTableBucket |
| A recipient for a pair of key value in a gum::HashTableList. More... | |
| class | HashTableList |
| A chained list used by gum::HashTable. More... | |
| class | HashTable |
| The class for generic Hash Tables. More... | |
| class | HashTableConstIteratorSafe |
| Safe Const Iterators for hashtables. More... | |
| class | Heap |
| Heap data structure. More... | |
| class | IndexedTree |
| The class for storing the nodes of the Arborescence. More... | |
| struct | IThreadNumberManager |
| class | ListBucket |
| Bucket for a chained list. More... | |
| class | List |
| Generic doubly linked lists. More... | |
| class | ListConstIterator |
| Unsafe but fast const iterators for Lists. More... | |
| class | ListIterator |
| Unsafe but fast iterators for Lists. More... | |
| class | ListConstIteratorSafe |
| Safe const iterators for Lists. More... | |
| class | ListIteratorSafe |
| Safe iterators for Lists. More... | |
| class | Chi2 |
| Static math utilities for the chi2 distribution. More... | |
| class | Dirichlet |
| A class for sampling w.r.t. More... | |
| class | FormulaPart |
| Represents part of a formula. More... | |
| class | Formula |
| Evaluates a string as a algebraic formula. More... | |
| class | GammaLog2 |
| The class for computing Log2 (Gamma(x)). More... | |
| class | Rational |
| Class template used to approximate decimal numbers by rationals. More... | |
| class | VariableLog2ParamComplexity |
| the class for computing the log2 of the parametric complexity of an r-ary multinomial variable More... | |
| class | MultiPriorityQueue |
| A MultiPriorityQueue is a heap in which each element has a mutable priority and duplicates are allowed. More... | |
| class | optional_ref |
| A lightweight wrapper around a pointer providing an optional-like API for references (not supported by std::optional<T&>). More... | |
| class | PriorityQueue |
| A priorityQueue is a heap in which each element has a mutable priority. More... | |
| class | PriorityQueueImplementation |
| The internal class for representing priority queues. More... | |
| class | ProgressNotifier |
| Notification for progress using listener. More... | |
| class | ProgressListener |
| The ProgressListener class. More... | |
| class | SequenceImplementation |
| The internal class for storing (ordered) sequences of objects. More... | |
| class | Sequence |
| The generic class for storing (ordered) sequences of objects. More... | |
| class | SequenceIteratorSafe |
| Safe iterators for Sequence. More... | |
| class | Set |
| Representation of a set. More... | |
| class | SetIteratorSafe |
| Safe iterators for the Set class. More... | |
| class | SetIterator |
| Unsafe iterators for the Set class. More... | |
| class | HashFunc< Set< T > > |
| the hash function for sets of int More... | |
| class | Listener |
| Every class who would catch signal from signaler should derive from Listener. More... | |
| class | Signaler |
| Variadic template signaler for any number of arguments. More... | |
| class | FixedAllocator |
| Allocates objects of one given size. More... | |
| class | SmallObjectAllocator |
| <agrum/base/core/smallObjectAllocator.h> More... | |
| class | SortedPriorityQueue |
| A priority queue in which we can iterate over the elements from the top to bottom or conversely. More... | |
| class | SortedPriorityQueueIterator |
| Sorted priority queue iterator. More... | |
| class | SortedPriorityQueueIteratorSafe |
| Sorted priority queues safe (w.r.t. More... | |
| class | SortedPriorityQueueReverseIterator |
| Sorted priority queue reverse iterator. More... | |
| class | SortedPriorityQueueReverseIteratorSafe |
| Sorted priority queue safe (w.r.t. More... | |
| class | SplayBinaryNode |
| the nodes of splay trees More... | |
| class | SplayTree |
| A splay tree. More... | |
| class | ThreadData |
| A wrapper that enables to store data in a way that prevents false cacheline sharing. More... | |
| class | ThreadExecutorBase |
| Set the max number of threads to be used. More... | |
| class | ThreadNumberManager |
| A class to manage the number of threads to use in an algorithm. More... | |
| class | Timer |
| Class used to compute response times for benchmark purposes. More... | |
| struct | AlmostDifferent |
| Indicate whether two elements are (almost) different or not. More... | |
| struct | AlmostDifferent< T * > |
| Indicate whether two elements are (almost) different or not. More... | |
| class | InformationTheory |
| InformationTheory is a template class which aims at gathering the implementation of informational functions (entropy, mutual information, etc.). More... | |
| class | DAGmodel |
| Virtual base class for PGMs using a DAG. More... | |
| class | DiscreteGraphicalModel |
| <agrum/base/graphicalModels/discreteGraphicalModel.h> More... | |
| class | GraphicalModel |
| Virtual base class for probabilistic graphical models. More... | |
| class | GraphicalModelInference |
| <agrum/base/graphicalModels/graphicalModel.h> More... | |
| class | IScheduleMultiDim |
| The Table-agnostic base class of scheduleMultiDim. More... | |
| class | Schedule |
| Class containing a schedule of operations to perform on multidims. More... | |
| class | ScheduleBinaryCombination |
| a binary Combination operator class used for scheduling inferences More... | |
| class | ScheduledInference |
| the class containing the scheduler used by schedule-based inferences More... | |
| class | ScheduleMultiDim |
| a Wrapper for multi-dimensional tables used for scheduling inferences More... | |
| class | ScheduleOperator |
| the base class for "low-level" operators used to schedule inferences More... | |
| class | ScheduleProjection |
| a Projection operator class used for scheduling inferences More... | |
| class | Scheduler |
| The common interface of all the schedulers. More... | |
| class | SchedulerParallel |
| A scheduler that executes available operators in parallel. More... | |
| class | SchedulerSequential |
| class | ScheduleStorage |
| Class for storing multidimensional tables into containers (sets, etc.). More... | |
| class | UGmodel |
| Virtual base class for PGMs using a undirected graph. More... | |
| class | VariableNodeMap |
| Container used to map discrete variables with nodes. More... | |
| class | BinaryJoinTreeConverter |
| class | BinaryJoinTreeConverterDefault |
| class | DAGCycleDetector |
| A class for detecting directed cycles in DAGs when trying to apply many changes to the graph. More... | |
| class | MeekRules |
| Applies Meek's orientation rules to propagate arc directions in a mixed graph. More... | |
| class | SimplicialSet |
| Class enabling fast retrieval of simplicial, quasi and almost simplicial nodes. More... | |
| class | SpanningForest |
| Base class for computing min cost spanning trees or forests. More... | |
| class | SpanningForestPrim |
| The Prim algorithm for computing min cost spanning trees or forests. More... | |
| class | DefaultTriangulation |
| The default triangulation algorithm used by aGrUM. More... | |
| class | DefaultEliminationSequenceStrategy |
| An efficient unconstrained elimination sequence algorithm. More... | |
| class | DefaultPartialOrderedEliminationSequenceStrategy |
| An Elimination sequence algorithm that imposes a given partial ordering on the nodes elimination sequence. More... | |
| class | EliminationSequenceStrategy |
| The base class for all elimination sequence algorithms used by triangulation algorithms. More... | |
| class | OrderedEliminationSequenceStrategy |
| An Elimination sequence algorithm that imposes a given complete ordering on the nodes elimination sequence. More... | |
| class | PartialOrderedEliminationSequenceStrategy |
| Base class for all elimination sequence algorithm that impose a given partial ordering on the nodes elimination sequence, that is, the set of all the nodes is divided into several subsets. More... | |
| class | UnconstrainedEliminationSequenceStrategy |
| The base class for all elimination sequence algorithms that require only the graph to be triangulated and the nodes' domain sizes to produce the node elimination ordering. More... | |
| class | IncrementalTriangulation |
| Class that performs incremental triangulations. More... | |
| class | DefaultJunctionTreeStrategy |
| An algorithm producing a junction given the elimination tree produced by a triangulation algorithm. More... | |
| class | JunctionTreeStrategy |
| Base Class for all the algorithms producing a junction given a set of cliques/subcliques resulting from a triangulation. More... | |
| class | OrderedTriangulation |
| class for graph triangulations for which we enforce a given complete ordering on the nodes eliminations. More... | |
| class | PartialOrderedTriangulation |
| class for graph triangulations for which we enforce a given partial ordering on the nodes eliminations, that is, the set of all the nodes is divided into several subsets. More... | |
| class | StaticTriangulation |
| base class for all non-incremental triangulation methods More... | |
| class | Triangulation |
| Interface for all the triangulation methods. More... | |
| class | UnconstrainedTriangulation |
| Interface for all triangulation methods without constraints on node elimination orderings. More... | |
| class | CliqueGraph |
| Basic graph of cliques. More... | |
| class | DAG |
| Base class for dag. More... | |
| class | DiGraph |
| Base class for all oriented graphs. More... | |
| class | Edge |
| The base class for all undirected edges. More... | |
| class | Arc |
| The base class for all directed edges. More... | |
| class | MixedGraph |
| Base class for mixed graphs. More... | |
| class | PAG |
| Partial Ancestral Graph: undirected topology with endpoint marks. More... | |
| class | ArcGraphPart |
| Classes for directed edge sets. More... | |
| class | EdgeGraphPart |
| Classes for undirected edge sets. More... | |
| class | DiGraphListener |
| Abstract Base class for all diGraph Listener. More... | |
| class | MixedGraphListener |
| Abstract Base class for all mixed Graph Listener. More... | |
| class | UndiGraphListener |
| Abstract Base class for all undiGraph Listener. More... | |
| class | NodeGraphPartIterator |
| Unsafe iterator on the node set of a graph. More... | |
| class | NodeGraphPartIteratorSafe |
| Safe iterator on the node set of a graph. More... | |
| class | NodeGraphPart |
| Class for node sets in graph. More... | |
| class | PDAG |
| Base class for partially directed acyclic graphs. More... | |
| class | UndiGraph |
| Base class for undirected graphs. More... | |
| class | MultiDimICIModel |
| abstract class for Conditional Indepency Models More... | |
| class | MultiDimLogit |
| Logit representation. More... | |
| class | MultiDimNoisyAND |
| Noisy AND representation. More... | |
| class | MultiDimNoisyORCompound |
| Noisy OR representation. More... | |
| class | MultiDimNoisyORNet |
| Noisy OR representation. More... | |
| class | MultiDimAdressable |
| Abstract base class for all multi dimensionnal addressable. More... | |
| class | MultiDimBijArray |
| Decorator of a MultiDimArray, using a bijection over the variables. More... | |
| class | MultiDimArray |
| Multidimensional matrix stored as an array in memory. More... | |
| class | MultiDimBucket |
| A multidim implementation for buckets. More... | |
| class | MultiDimImplementation |
| <agrum/base/multidim/multiDimImplementation.h> More... | |
| class | MultiDimContainer |
| Abstract base class for all multi dimensionnal containers. More... | |
| class | MultiDimDecorator |
| Decorator design pattern in order to separate implementations from multidimensional matrix concepts. More... | |
| class | MultiDimFunctionGraphManager |
| Class implementingting a function graph manager. More... | |
| class | MultiDimFunctionGraphROManager |
| class | MultiDimFunctionGraphTreeManager |
| class | MultiDimFunctionGraph |
| Class implementingting a function graph. More... | |
| class | MultiDimFunctionGraphGenerator |
| Class implementing a function graph generator with template type double. More... | |
| class | MultiDimInterface |
| Interface for all classes addressing in a multiDim fashion. More... | |
| class | MultiDimPartialInstantiation |
| A generic class to instantiate a subset of variables of a multidimensional table. More... | |
| class | MultiDimReadOnly |
| Abstract base class for all multi dimensionnal read only structure. More... | |
| class | MultiDimSparse |
| Multidimensional matrix stored as a sparse array in memory. More... | |
| class | MultiDimWithOffset |
| Abstract class for Multidimensional matrix stored as an array in memory and with an offset associated with each slave instantiation. More... | |
| class | Instantiation |
| Class for assigning/browsing values to tuples of discrete variables. More... | |
| class | HashFunc< Instantiation > |
| Hash function for gum::Instantiation. More... | |
| class | SetInst |
| Class for assigning/browsing values to tuples of discrete variables. More... | |
| class | Tensor |
| aGrUM's Tensor is a multi-dimensional array with tensor operators. More... | |
| class | Parent |
| Represent a node's parent. More... | |
| class | InternalNode |
| Structure used to represent a node internal structure. More... | |
| class | Link |
| Link of a chain list allocated using the SmallObjectAllocator. More... | |
| class | LinkedList |
| Chain list allocated using the SmallObjectAllocator. More... | |
| class | MultiDimFunctionGraphOperator |
| Class used to perform Function Graph Operations. More... | |
| class | MultiDimFunctionGraphProjector |
| Class used to perform Function Graph projections. More... | |
| class | O4DGContext |
| Class used to manipulate context during Function Graph Operations. More... | |
| class | Regress |
| Class used to perform Function Graph Operations in the FMDP Framework. More... | |
| class | TreeOperator |
| Class used to perform Decision Tree Operation in the FMDP Framework. More... | |
| class | TreeRegress |
| Class used to perform Decision Tree Regression in the FMDP Framework. More... | |
| class | ExactTerminalNodePolicy |
| Implementation of a Terminal Node Policy that maps nodeid directly to value. More... | |
| class | ITerminalNodePolicy |
| Interface specifying the methods to be implemented by any TerminalNodePolicy. More... | |
| class | SetTerminalNodePolicy |
| Implementation of a Terminal Node Policy that maps nodeid to a set of value. More... | |
| class | CompleteProjectionRegister4MultiDim |
| A container for registering complete projection functions on multiDimImplementations, i.e., functions projecting tables over all their variables. More... | |
| struct | CompleteProjections4MultiDimInitialize |
| a class used to register complete projections over non-pointers types More... | |
| struct | CompleteProjections4MultiDimInitialize< GUM_ELEMENT * > |
| a class used to register complete projections over pointers types More... | |
| class | MultiDimCombination |
| A generic interface to combine efficiently several MultiDim tables. More... | |
| class | MultiDimCombinationDefault |
| A class to combine efficiently several MultiDim tables. More... | |
| class | MultiDimCombineAndProject |
| A generic interface to combine and project efficiently MultiDim tables. More... | |
| class | MultiDimCombineAndProjectDefault |
| An efficient class for combining and projecting MultiDim tables. More... | |
| class | MultiDimCompleteProjection |
| A generic class to project efficiently a MultiDim table over all of its variables. More... | |
| class | MultiDimProjection |
| A generic class to project efficiently a MultiDim table over a subset of its variables. More... | |
| class | OperatorRegister4MultiDim |
| A container for registering binary functions on multiDimImplementations. More... | |
| struct | Operators4MultiDimInitialize |
| a class used to register operators over non-pointers types More... | |
| struct | Operators4MultiDimInitialize< GUM_ELEMENT * > |
| a class used to register operators over pointers types More... | |
| class | ProjectionRegister4MultiDim |
| A container for registering projection functions on multiDimImplementations, i.e., functions projecting tables over a subset of their variables. More... | |
| struct | Projections4MultiDimInitialize |
| a class used to register projections over non-pointers types More... | |
| struct | Projections4MultiDimInitialize< GUM_ELEMENT * > |
| a class used to register projections over pointers types More... | |
| class | PartialInstantiation4MultiDimInitialize |
| A class used to register instantiation functions over non-pointers types. More... | |
| struct | PartialInstantiation4MultiDimInitialize< GUM_ELEMENT * > |
| class | PartialInstantiationRegister4MultiDim |
| A container for registering partial instantiation functions on multiDimImplementations, i.e., functions assigning values to subsets of the variables of some tables. More... | |
| class | HashFunc< learning::IdCondSet > |
| the hash function for idSets More... | |
| class | ContinuousVariable |
| Defines a continuous random variable. More... | |
| class | DiscreteVariable |
| Base class for discrete random variable. More... | |
| class | DiscretizedVariable |
| Class for discretized random variable. More... | |
| class | IContinuousVariable |
| A base class for continuous variables, independent of the GUM_SCALAR type. More... | |
| class | IDiscretizedVariable |
| A base class for discretized variables, independent of the ticks type. More... | |
| class | IntegerVariable |
| class IntegerVariable More... | |
| class | LabelizedVariable |
| class LabelizedVariable More... | |
| class | NumericalDiscreteVariable |
| class NumericalDiscreteVariable More... | |
| class | RangeVariable |
| Defines a discrete random variable over an integer interval. More... | |
| class | Variable |
| Base class for every random variable. More... | |
| class | BarrenNodesFinder |
| Detect barren nodes for inference in Bayesian networks. More... | |
| class | BayesBall |
| Implementation of Shachter's Bayes Balls algorithm. More... | |
| class | BNdistance |
| class | ExactBNdistance |
| ExactBNdistance computes exactly the KL divergence betweens 2 BNs. More... | |
| class | GibbsBNdistance |
| GibbsKL computes the KL divergence betweens 2 BNs using an approximation pattern: GIBBS sampling. More... | |
| class | dSeparationAlgorithm |
| the d-separation algorithm as described in Koller & Friedman (2009) More... | |
| class | EssentialGraph |
| Class building the essential graph from a BN. More... | |
| class | MarkovBlanket |
| Class building the markov Blanket from a BN and a nodeName. More... | |
| class | StructuralMetrics |
| A class for comparing graphs based on their structures. More... | |
| class | BayesNetFactory |
| A factory class to ease BayesNet construction. More... | |
| class | BayesNet |
| Class representing a Bayesian network. More... | |
| class | BayesNetFragment |
| Portion of a BN identified by the list of nodes and a BayesNet. More... | |
| class | IBayesNetGenerator |
| Class for generating Bayesian networks. More... | |
| class | MaxInducedWidthMCBayesNetGenerator |
| maxInducedWidthMCBayesNetGenerator.h <agrum/BN/generator/SimpleMCayesNetGenerator.h> More... | |
| class | MaxParentsMCBayesNetGenerator |
| <agrum/BN/generator/SimpleMCayesNetGenerator.h> More... | |
| class | MCBayesNetGenerator |
| <agrum/BN/generator/MCayesNetGenerator.h> More... | |
| class | SimpleBayesNetGenerator |
| <agrum/BN/generator/simpleBayesNetGenerator.h> More... | |
| class | SimpleCPTDisturber |
| <agrum/BN/generator/simpleCPTDisturber.h> More... | |
| class | SimpleCPTGenerator |
| <agrum/BN/generator/simpleCPTGenerator.h> More... | |
| class | IBayesNet |
| Class representing the minimal interface for Bayesian network with no numerical data. More... | |
| class | IBayesNetFactory |
| IBayesNetFactory is the non-template interface for BayesNetFactory : many ways to build a BN do not depend on the specification of the GUM_SCALAR template argument (for instance for BN readers). More... | |
| class | GibbsSampling |
| <agrum/BN/inference/gibbsSampling.h> More... | |
| class | ImportanceSampling |
| class | LazyPropagation |
| Implementation of a Shafer-Shenoy's-like version of lazy propagation for inference in Bayesian networks. More... | |
| class | LoopyBeliefPropagation |
| <agrum/BN/inference/loopyBeliefPropagation.h> More... | |
| class | LoopySamplingInference |
| <agrum/BN/inference/loopySamplingInference.h> More... | |
| class | MonteCarloSampling |
| class | ShaferShenoyInference |
| Implementation of Shafer-Shenoy's propagation algorithm for inference in Bayesian networks. More... | |
| class | AggregatorDecomposition |
| <agrum/BN/inference/tools/aggregatorDecomposition.h> More... | |
| class | ApproximateInference |
| class | JointTargetedInference |
| <agrum/BN/inference/jointTargetedInference.h> More... | |
| class | MarginalTargetedInference |
| <agrum/BN/inference/marginalTargetedInference.h> More... | |
| class | EvidenceInference |
| <agrum/BN/inference/evidenceInference.h> More... | |
| class | BayesNetInference |
| <agrum/BN/inference/BayesNetInference.h> More... | |
| class | Estimator |
| class | GibbsOperator |
| class containing all variables and methods required for Gibbssampling More... | |
| class | SamplingInference |
| <agrum/BN/inference/samplingInference.h> More... | |
| class | VariableElimination |
| Implementation of a Variable Elimination's-like version of lazy propagation for inference in Bayesian networks. More... | |
| class | WeightedSampling |
| class | BIFReader |
| Definition of templatized reader of BIF files for Bayesian networks. More... | |
| class | BIFWriter |
| Writes a IBayesNet in the BIF format. More... | |
| class | BIFXMLBNReader |
| <agrum/BN/io/BIFXML/BIFXMLBNReader.h> More... | |
| class | BIFXMLBNWriter |
| <agrum/BN/io/BIFXML/BIFXMLBNWriter.h> More... | |
| class | BNReader |
| Pure virtual class for reading a BN from a file. More... | |
| class | BNWriter |
| virtual class for writing a BN to a file. More... | |
| class | CNFWriter |
| Writes a IBayesNet in the BN format. More... | |
| class | ContextualDependenciesCNFWriter |
| <agrum/BN/io/cnf/ContextualDependenciesCNFWriter.h> More... | |
| class | FactorisedValuesCNFWriter |
| <agrum/BN/io/cnf/FactorisedValuesCNFWriter.h> More... | |
| class | GeneralizedCNFWriter |
| <agrum/BN/io/cnf/GeneralizedCNFWriter.h> More... | |
| class | DSLReader |
| Pure virtual class for reading a BN from a file. More... | |
| class | DSLWriter |
| Writes a IBayesNet in the DSL format. More... | |
| class | GumBNReader |
| class | GumBNWriter |
| Writes a IBayesNet in the GUM json format. More... | |
| class | NetReader |
| Pure virtual class for reading a BN from a file. More... | |
| class | NetWriter |
| Writes a IBayesNet in the BN format. More... | |
| class | UAIBNReader |
| Pure virtual class for reading a BN from a file. More... | |
| class | UAIBNWriter |
| Writes a Bayes net in a text file with UAI format. More... | |
| class | XDSLBNReader |
| <agrum/BN/io/XDSL/XDSLBNReader.h> More... | |
| class | XDSLBNWriter |
| <agrum/BN/io/XDSLXML/XDSLBNWriter.h> More... | |
| class | HashFunc< learning::GraphChange > |
| the hash function for Graph Changes More... | |
| class | HashFunc< learning::ArcAddition > |
| the hash function for Arc Additions More... | |
| class | HashFunc< learning::ArcDeletion > |
| the hash function for Arc Deletions More... | |
| class | HashFunc< learning::ArcReversal > |
| the hash function for Arc Reversals More... | |
| class | HashFunc< learning::ArcTriangleDeletion1 > |
| the hash function for Arc Triangle Deletions creating a v-structure in node 1 More... | |
| class | HashFunc< learning::ArcTriangleDeletion2 > |
| the hash function for Arc Triangle Deletions creating a v-structure in node 2 More... | |
| class | HashFunc< learning::EdgeAddition > |
| the hash function for Edge Additions More... | |
| class | HashFunc< learning::EdgeDeletion > |
| the hash function for Edge Deletions More... | |
| class | CausalImpact |
| Builds a CausalFormula for a query (d-sep -> backdoor -> frontdoor -> (optional) do-calculus). More... | |
| class | ASTtree |
| Root abstract node for the AST of algebraic expressions. More... | |
| class | CausalModel |
| A causal model pairing an observational BayesNet with a causal DAG. More... | |
| class | Counterfactual |
| Computes a counterfactual distribution by building a twin model, then evaluating a causal effect on that twin and adapting the result back to the original model’s variables. More... | |
| class | DoorCriteria |
| Implements Backdoor and Frontdoor criteria utilities for a DAG. More... | |
| class | CausalFormula |
| A container for an identified causal query. More... | |
| class | ASTBinaryOp |
| Base class for binary algebraic operators (e.g., +, -, ×, ÷). More... | |
| class | ASTplus |
| Sum of two AST sub-expressions. More... | |
| class | ASTminus |
| Difference of two AST sub-expressions (left minus right). More... | |
| class | ASTmult |
| Elementwise product of two AST sub-expressions. More... | |
| class | ASTdiv |
| Elementwise division of two AST sub-expressions (left / right). More... | |
| class | ASTposteriorProba |
| Posterior probability term ( \mathbb{P}_{bn}(\mathrm{vars}\mid\mathrm{knw}) ). More... | |
| class | ASTjointProba |
| Joint probability term ( \mathbb{P}(\mathrm{vars}) ) in an observational BN. More... | |
| class | ASTsum |
| Summation (marginalization) over one or more variables. More... | |
| class | DoCalculus |
| Instance-based do-calculus utilities bound to a single CausalModel. More... | |
| class | Separation |
| Consolidated d-separation utilities (DAG-centric). More... | |
| class | HashFunc< credal::lp::LpCol > |
| class | E_GreedyDecider |
| <agrum/FMDP/decision/E_GreedyDecider.h> More... | |
| class | LazyDecider |
| Class to make decision randomly. More... | |
| class | RandomDecider |
| Class to make decision randomly. More... | |
| class | StatisticalLazyDecider |
| <agrum/FMDP/decision/statisticalLazyDecider.h> More... | |
| class | FMDP |
| This class is used to implement factored decision process. More... | |
| class | FMDPFactory |
| A factory class to ease Factored Markov Decision Process construction. More... | |
| class | AbstractFMDPFactory |
| A factory class to ease Factored Markov Decision Process construction. More... | |
| class | FMDPDatReader |
| Definition of templatized reader of FMDPDat files for Factored Markov Decision Processes. More... | |
| class | FMDPReader |
| Pure virtual class for reading a FMDP from a file. More... | |
| class | ChiSquare |
| <agrum/FMDP/learning/core/testPolicy/chiSquare.h> More... | |
| class | ContingencyTable |
| <agrum/FMDP/learning/core/contingencyTable.h> More... | |
| struct | Int2Type |
| struct | TestSelect |
| struct | TestSelect< CHI2TEST, A, B, C > |
| struct | TestSelect< LEASTSQUARETEST, A, B, C > |
| struct | ValueSelect |
| struct | ValueSelect< false, A, B > |
| struct | LearnerSelect |
| struct | LearnerSelect< ITILEARNER, A, B > |
| class | Chi2TestPolicy |
| <agrum/base/multidim/core/testPolicy/Chi2TestPolicy.h> More... | |
| class | GTestPolicy |
| <agrum/base/multidim/core/testPolicies/GTestPolicy.h> More... | |
| class | ITestPolicy |
| <agrum/base/multidim/core/testPolicies/ITestPolicy.h> More... | |
| class | LeastSquareTestPolicy |
| <agrum/base/multidim/core/testPolicy/leastSquareTestPolicy.h> More... | |
| class | HashFunc< std::tuple< unsigned int, unsigned int, unsigned int > > |
| the hash function for tuple (unsigned int, unsigned int,unsigned int) More... | |
| class | IMDDI |
| class | IncrementalGraphLearner |
| <agrum/FMDP/learning/datastructure/incrementalGraphLearner> More... | |
| class | ITI |
| Learn a graphical representation of a function as a decision tree. More... | |
| class | IVisitableGraphLearner |
| <agrum/FMDP/SDyna/IVisitableGraphLearner.h> More... | |
| class | AbstractLeaf |
| <agrum/FMDP/learning/datastructure/leaves/abstractLeaf.h> More... | |
| class | ComposedLeaf |
| <agrum/FMDP/learning/datastructure/leaves/composedLeaf.h> More... | |
| class | ConcreteLeaf |
| <agrum/FMDP/learning/datastructure/leaves/concreteLeaf.h> More... | |
| class | FusionContext |
| <agrum/FMDP/learning/datastructure/leaves/fusionContext.h> More... | |
| class | LeafAggregator |
| <agrum/FMDP/learning/FunctionGraph/leafAggregator.h> More... | |
| class | LeafPair |
| <agrum/FMDP/learning/datastructure/leaves/leafPair.h> More... | |
| class | NodeDatabase |
| <agrum/FMDP/learning/datastructure/nodeDatabase.h> More... | |
| class | VariableSelector |
| <agrum/FMDP/planning/FunctionGraph/variableselector.h> More... | |
| class | FMDPLearner |
| class | Observation |
| struct | ArgumentMaximisesAction |
| <agrum/FMDP/planning/actionSet.h> More... | |
| class | ActionSet |
| A class to store the optimal actions. More... | |
| class | AdaptiveRMaxPlaner |
| <agrum/FMDP/planning/adaptiveRMaxPlaner.h> More... | |
| class | IOperatorStrategy |
| <agrum/FMDP/SDyna/IOperatorStrategy.h> More... | |
| class | MDDOperatorStrategy |
| <agrum/FMDP/planning/mddOperatorStrategy.h> More... | |
| class | StructuredPlaner |
| <agrum/FMDP/planning/structuredPlaner.h> More... | |
| class | TreeOperatorStrategy |
| <agrum/FMDP/planning/treeOperatorStrategy.h> More... | |
| class | SDYNA |
| The general SDyna architecture abstract class. More... | |
| class | IDecisionStrategy |
| <agrum/FMDP/SDyna/IDecisionStrategy.h> More... | |
| class | ILearningStrategy |
| <agrum/FMDP/SDyna/ILearningStrategy.h> More... | |
| class | IPlanningStrategy |
| <agrum/FMDP/SDyna/IPlanningStrategy.h> More... | |
| class | AbstractSimulator |
| <agrum/FMDP/simulation/abstractSimulator.h> More... | |
| class | FactorySimulator |
| A class to simulate the Factory problem. More... | |
| class | FMDPSimulator |
| <agrum/FMDP/simulation/fmdpSimulator.h> More... | |
| class | StatesChecker |
| <agrum/FMDP/simulation/statesChecker.h> More... | |
| class | StatesCounter |
| <agrum/FMDP/simulation/statesCounter.h> More... | |
| class | TaxiSimulator |
| A class to simulate the Taxi problem. More... | |
| class | InfluenceDiagramGenerator |
| <agrum/ID/generator/influenceDiagramGenerator.h> More... | |
| class | SimpleUTGenerator |
| Class for generating Utility Tables. More... | |
| class | UTGenerator |
| Abstract class for generating Utility Tables. More... | |
| class | ShaferShenoyLIMIDInference |
| class | DecisionTensor |
| <agrum/ID/inference/decisionTensor.h> More... | |
| class | InfluenceDiagramInference |
| <agrum/ID/inference/influenceDiagramInference.h> More... | |
| class | InfluenceDiagram |
| Class representing an Influence Diagram. More... | |
| class | BIFXMLIDReader |
| Read an influence diagram from an XML file with BIF format. More... | |
| class | BIFXMLIDWriter |
| Writes an influence diagram in a XML files with BIF format. More... | |
| class | GumIDReader |
| Reads an InfluenceDiagram from a GUM (json) file. More... | |
| class | GumIDWriter |
| Writes an InfluenceDiagram in the GUM json format. More... | |
| class | IDReader |
| Pure virtual class for importing an ID from a file. More... | |
| class | IDWriter |
| Pure virtual class for exporting an ID. More... | |
| class | IMarkovRandomField |
| Class representing the minimal interface for Markov random field. More... | |
| class | ShaferShenoyMRFInference |
| <agrum/MRF/inference/ShaferShenoyMRFInference.h> More... | |
| class | EvidenceMRFInference |
| <agrum/MRF/inference/evidenceMRFInference.h> More... | |
| class | JointTargetedMRFInference |
| <agrum/MRF/inference/jointTargetedMRFInference.h> More... | |
| class | MarginalTargetedMRFInference |
| <agrum/MRF/inference/marginalTargetedMRFInference.h> More... | |
| class | MRFInference |
| <agrum/MRF/inference/MRFInference.h> More... | |
| class | GumMRFReader |
| Reads a MarkovRandomField from a GUM (json) file. More... | |
| class | GumMRFWriter |
| Writes a MarkovRandomField in the GUM json format. More... | |
| class | MRFReader |
| Pure virtual class for reading a MRF from a file. More... | |
| class | MRFWriter |
| Pure virtual class for writing a MRF to a file. More... | |
| class | UAIMRFReader |
| Pure virtual class for reading a MRF from a file. More... | |
| class | UAIMRFWriter |
| <agrum/MRF/io/UAI/UAIMRFWriter.h> More... | |
| class | O3prmBNReader |
| Read an O3PRM and transform the gum::prm::PRMSystem into gum::BayesNet. More... | |
| class | O3prmBNWriter |
| <agrum/PRM/o3prm/O3prmBNWriter.h> More... | |
Concepts | |
| concept | GUM_HasNumericLimits |
| Concept checking that std::numeric_limits is specialized for a type. | |
| concept | GUM_IsGumScalar |
| Concept defining requirements for scalar types used as GUM_SCALAR. | |
| concept | GUM_Numeric |
| Complete concept for GUM_SCALAR template parameter. | |
| concept | JointTargettable |
| concept | GUM_NodeGraphable |
| Concept for any graph that exposes node-level queries. | |
| concept | GUM_DiGraphable |
| Concept for directed graphs (arcs with parents/children). | |
| concept | GUM_UndiGraphable |
| Concept for undirected graphs (edges with neighbours). | |
| concept | GUM_MixedGraphable |
| Concept for mixed graphs (both arcs and edges). | |
Typedefs | |
| using | Signaler0 = Signaler<> |
| Signaler with no arguments. | |
| using | ThreadExecutor = threadsSTL::ThreadExecutor |
| using | JunctionTree = CliqueGraph |
| a junction tree is a clique graph satisfying the running intersection property and such that no clique is included into another one. | |
| using | JoinTree = CliqueGraph |
| a join tree is a clique graph satisfying the running intersection property (but some cliques may be included into others) | |
| using | NodeId = Size |
| Type for node ids. | |
| using | VariableSet = Set< const DiscreteVariable* > |
| template<GUM_Numeric GUM_SCALAR> | |
| using | HybridMonteCarloSampling = LoopySamplingInference< GUM_SCALAR, MonteCarloSampling > |
| template<GUM_Numeric GUM_SCALAR> | |
| using | HybridWeightedSampling = LoopySamplingInference< GUM_SCALAR, WeightedSampling > |
| template<GUM_Numeric GUM_SCALAR> | |
| using | HybridImportanceSampling = LoopySamplingInference< GUM_SCALAR, ImportanceSampling > |
| template<GUM_Numeric GUM_SCALAR> | |
| using | HybridGibbsSampling = LoopySamplingInference< GUM_SCALAR, GibbsSampling > |
| using | LatentDescriptorIds = std::pair< std::string, std::vector< NodeId > > |
| LatentDescriptorIds = (latentName, (child1Id, child2Id, ...)). | |
| using | LatentDescriptorVector = std::vector< LatentDescriptorIds > |
| Collection of latent descriptors (see LatentDescriptorIds). | |
| using | pair_iterator = HashTableConstIteratorSafe< LeafPair*, std::vector< Size > > |
| template<GUM_Numeric GUM_SCALAR> | |
| using | FactorTable = HashTable< NodeSet, const Tensor< GUM_SCALAR >* > |
| using | Size = std::size_t |
| In aGrUM, hashed values are unsigned long int. | |
| using | Idx = Size |
| Type for indexes. | |
| template<class VAL> | |
| using | NodeProperty = HashTable< NodeId, VAL > |
| Property on graph elements. | |
| template<class VAL> | |
| using | EdgeProperty = HashTable< Edge, VAL > |
| Property on graph elements. | |
| template<class VAL> | |
| using | ArcProperty = HashTable< Arc, VAL > |
| Property on graph elements. | |
Enumerations | |
| enum class | BinTreeDir : char { LEFT_CHILD = 0 , RIGHT_CHILD = 1 , NO_PARENT = 2 } |
| The direction of a given edge in a binary tree. More... | |
| enum class | StaticInitializer : char { CONSTINIT , CONSTEXPR } |
| enum class | ScheduleOperatorType : char { COMBINE_MULTIDIM , PROJECT_MULTIDIM , DELETE_MULTIDIM , STORE_MULTIDIM } |
| the currently supported types of "low-level" operators More... | |
| enum | SchedulerType { SEQUENTIAL , PARALLEL_OPERATORS } |
| the type of scheduler that can be used More... | |
| enum class | EdgeMark : uint8_t { Circle = 0 , Tail = 1 , Arrowhead = 2 } |
| Endpoint marks used in PAG edges. More... | |
| enum class | VarType : char { DISCRETIZED , LABELIZED , INTEGER , NUMERICAL , RANGE , CONTINUOUS } |
| enum class | Complexity : char { Heavy , Difficult , Correct } |
| Complexity allows to characterize the awaited difficulty for an algorithm given a specific instance Therefore this is not a theoretical characterization but rather a pragmatic rate of that very instance. More... | |
| enum class | FindBarrenNodesType { FIND_NO_BARREN_NODES , FIND_BARREN_NODES } |
| type of algorithm to determine barren nodes More... | |
| enum class | RelevantTensorsFinderType { FIND_ALL , DSEP_BAYESBALL_NODES , DSEP_BAYESBALL_TENSORS , DSEP_KOLLER_FRIEDMAN_2009 } |
| type of algorithm for determining the relevant tensors for combinations using some d-separation analysis More... | |
| enum class | FMDPfactory_state : char { NONE , VARIABLE , ACTION , TRANSITION , COST , REWARD , DISCOUNT } |
| The enumeration of states in which the factory can be in. More... | |
| enum | TESTNAME { GTEST = 1 , CHI2TEST = 2 , LEASTSQUARETEST = 3 } |
| enum | LEARNERNAME { IMDDILEARNER = 1 , ITILEARNER = 2 } |
| enum | FactorySimulationLandmark : Idx { HOME = 0 , WORK = 1 , THEATER = 2 , CLUB = 3 , Factory = 4 } |
| enum | FactorySimulationLandmarkX : Idx { HOMEX = 0 , WORKX = 0 , THEATERX = 3 , CLUBX = 4 , STATIONX = 2 } |
| enum | FactorySimulationLandmarkY : Idx { HOMEY = 0 , WORKY = 4 , THEATERY = 0 , CLUBY = 4 , STATIONY = 1 } |
| enum | FactorySimulationAction : Idx { GoNorth = 0 , GoEast = 1 , GoSouth = 2 , GoWest = 3 , PickUp = 4 , PutDown = 5 , FillUp = 6 } |
| enum | TaxiSimulationLandmark : Idx { HOME = 0 , WORK = 1 , THEATER = 2 , CLUB = 3 , TAXI = 4 } |
| enum | TaxiSimulationLandmarkX : Idx { HOMEX = 0 , WORKX = 0 , THEATERX = 3 , CLUBX = 4 , STATIONX = 2 } |
| enum | TaxiSimulationLandmarkY : Idx { HOMEY = 0 , WORKY = 4 , THEATERY = 0 , CLUBY = 4 , STATIONY = 1 } |
| enum | TaxiSimulationAction : Idx { GoNorth = 0 , GoEast = 1 , GoSouth = 2 , GoWest = 3 , PickUp = 4 , PutDown = 5 , FillUp = 6 } |
Functions | |
| template<typename Val, typename Cmp> | |
| std::ostream & | operator<< (std::ostream &stream, const AVLTree< Val, Cmp > &tree) |
| display the content of a tree | |
| template<typename T1, typename T2> | |
| std::ostream & | operator<< (std::ostream &, const Bijection< T1, T2 > &bijection) |
| For friendly display of the content of the gum::Bijection. | |
| unsigned int | _hashTableLog2_ (const Size nb) |
| Returns the size in bits - 1 necessary to store the smallest power of 2 greater than or equal to nb. | |
| template<typename Key, typename Val> | |
| std::ostream & | operator<< (std::ostream &s, const HashTableList< Key, Val > &list) |
| Prints the content of a gum::HashTableList in the stream. | |
| template<typename Key, typename Val> | |
| std::ostream & | operator<< (std::ostream &s, const HashTableList< Key *, Val > &list) |
| Prints the content of a gum::HashTableList with pointers key in the stream. | |
| template<typename Key, typename Val> | |
| std::ostream & | operator<< (std::ostream &s, const HashTable< Key, Val > &table) |
| Prints the content of a gum::HashTable in the stream. | |
| template<typename Key, typename Val> | |
| std::ostream & | operator<< (std::ostream &s, const HashTable< Key *, Val > &table) |
| Prints the content of a gum::HashTable with pointers key in the stream. | |
| HashTableIteratorSafe< Key, Val > & | operator++ () noexcept |
| HashTableIteratorSafe< Key, Val > & | operator+= (Size i) noexcept |
| Makes the iterator point to i elements further in the hashtable. | |
| HashTableIteratorSafe< Key, Val > | operator+ (Size i) const |
| Returns a new iterator pointing to i elements further in the hashtable. | |
| bool | operator== (const HashTableIteratorSafe< Key, Val > &from) const noexcept |
| Checks whether two iterators are pointing toward equal elements. | |
| value_type & | operator* () |
| Returns the value pointed to by the iterator. | |
| template<typename Val, typename Cmp> | |
| std::ostream & | operator<< (std::ostream &, const Heap< Val, Cmp > &) |
| template<typename Key, typename Data> | |
| std::ostream & | operator<< (std::ostream &, const IndexedTree< Key, Data > &) |
| Necessary for the hashtable operator <<. | |
| template<typename Val> | |
| std::ostream & | operator<< (std::ostream &stream, const List< Val > &list) |
| an << operator for List | |
| template<typename Val> | |
| ListConstIterator< Val >::difference_type | operator- (const ListConstIterator< Val > &iter1, const ListConstIterator< Val > &iter2) |
| For STL compliance, a distance operator. | |
| template<typename Val> | |
| ListConstIteratorSafe< Val >::difference_type | operator- (const ListConstIteratorSafe< Val > &iter1, const ListConstIteratorSafe< Val > &iter2) |
| For STL compliance, a distance operator. | |
| void | print_stack (std::stack< FormulaPart > s) |
| void | print_output (std::vector< FormulaPart > v) |
| std::string | func2str (FormulaPart::token_function func) |
| Formula | operator- (const Formula &a) |
| Formula | operator+ (const Formula &a, const Formula &b) |
| Formula | operator- (const Formula &a, const Formula &b) |
| Formula | operator* (const Formula &a, const Formula &b) |
| Formula | operator/ (const Formula &a, const Formula &b) |
| std::string | to_string (const Formula &f) |
| std::ostream & | operator<< (std::ostream &os, const Formula &f) |
| template<typename T> | |
| bool | isCloseToZero (T x, T tol=T(1e-9)) |
| template<typename T> | |
| bool | isCloseToOne (T x, T tol=T(1e-9)) |
| template<typename T> | |
| bool | isfinite (T arg) |
| template<typename Val, typename Priority, typename Cmp> | |
| std::ostream & | operator<< (std::ostream &stream, const MultiPriorityQueue< Val, Priority, Cmp > &queue) |
| template<typename Val, typename Priority, typename Cmp> | |
| std::ostream & | operator<< (std::ostream &, const PriorityQueue< Val, Priority, Cmp > &) |
| template<typename Key> | |
| std::ostream & | operator<< (std::ostream &stream, const Sequence< Key > &s) |
| A << operator for displaying the content of the Sequence. | |
| template<typename Key, bool Gen> | |
| std::ostream & | operator<< (std::ostream &stream, const SequenceImplementation< Key, Gen > &seq) |
| template<typename Key> | |
| std::ostream & | operator<< (std::ostream &stream, const SequenceImplementation< Key, true > &seq) |
| template<typename Key> | |
| std::ostream & | operator<< (std::ostream &, const Set< Key > &) |
| A << operator for HashTableList. | |
| template<typename Val, typename Priority, typename Cmp> | |
| std::ostream & | operator<< (std::ostream &stream, const SortedPriorityQueue< Val, Priority, Cmp > &queue) |
| display the content of a sorted priority queue | |
| template<typename Element> | |
| INLINE std::ostream & | operator<< (std::ostream &out, const SplayBinaryNode< Element > &e) |
| Display the node. | |
| template<typename Element> | |
| INLINE std::ostream & | operator<< (std::ostream &out, const SplayTree< Element > &s) |
| Display the tree. | |
| template<class Element> | |
| static void | removeInfo (const SplayBinaryNode< Element > *e, HashTable< Element, SplayBinaryNode< Element > * > &addr) |
| template<typename Element> | |
| std::ostream & | operator<< (std::ostream &out, const SplayBinaryNode< Element > &e) |
| Display the node. | |
| template<typename Element> | |
| std::ostream & | operator<< (std::ostream &out, const SplayTree< Element > &s) |
| Display the tree. | |
| void | setNumberOfThreads (unsigned int number) |
| Set the max number of threads to be used when entering the next parallel region. | |
| bool | isOMP () |
| indicates whether aGrUM uses openMP or STL threads | |
| std::vector< std::pair< Idx, Idx > > | dispatchRangeToThreads (Idx beg, Idx end, unsigned int nb_threads) |
| returns a vector equally splitting elements of a range among threads | |
| std::ostream & | operator<< (std::ostream &os, const Timer &t) |
| template<typename GENERATOR> | |
| Idx | randomValue (GENERATOR &generator, const Size max) |
| std::ostream & | operator<< (std::ostream &, const VariableNodeMap &) |
| for friendly displaying the content of clique graphs | |
| std::ostream & | operator<< (std::ostream &, const CliqueGraph &) |
| for friendly displaying the content of clique graphs | |
| std::ostream & | operator<< (std::ostream &stream, const DiGraph &g) |
| for friendly displaying the content of directed graphs | |
| std::ostream & | operator<< (std::ostream &stream, const Edge &edge) |
| to friendly display an edge | |
| std::ostream & | operator<< (std::ostream &stream, const Arc &arc) |
| to friendly display an arc | |
| std::ostream & | operator<< (std::ostream &stream, const MixedGraph &g) |
| for friendly displaying the content of directed graphs | |
| std::ostream & | operator<< (std::ostream &stream, const PAG &g) |
| std::ostream & | operator<< (std::ostream &s, const ArcGraphPart &a) |
| for friendly displaying the content of arc set | |
| std::ostream & | operator<< (std::ostream &, const EdgeGraphPart &) |
| for friendly displaying the content of an edge set | |
| std::ostream & | operator<< (std::ostream &, const NodeGraphPart &) |
| for friendly displaying the content of node set | |
| bool | rec_hasMixedReallyOrientedPath (const PDAG &gr, NodeSet &marked, NodeId node, NodeId goal, bool alreadyOriented) |
| std::ostream & | operator<< (std::ostream &stream, const UndiGraph &g) |
| for friendly displaying the content of undirected graphs | |
| std::vector< uint8_t > | _readVector_ (std::istream &is) |
| Reads a length-prefixed byte vector from a binary stream (bgum format). | |
| void | _writeVector_ (std::ostream &os, const std::vector< uint8_t > &vec) |
| Writes a length-prefixed byte vector to a binary stream (bgum format). | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &s, const MultiDimLogit< GUM_SCALAR > &ag) |
| For friendly displaying the content of the array. | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &s, const MultiDimNoisyAND< GUM_SCALAR > &ag) |
| For friendly displaying the content of the array. | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &s, const MultiDimNoisyORCompound< GUM_SCALAR > &ag) |
| For friendly displaying the content of the array. | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &s, const MultiDimNoisyORNet< GUM_SCALAR > &ag) |
| For friendly displaying the content of the array. | |
| template<typename GUM_ELEMENT> | |
| std::ostream & | operator<< (std::ostream &out, const MultiDimContainer< GUM_ELEMENT > &array) |
| template<typename GUM_ELEMENT> | |
| void | _initTensorOperators__ () |
| template<typename GUM_ELEMENT> | |
| std::ostream & | operator<< (std::ostream &, const MultiDimImplementation< GUM_ELEMENT > &) |
| For friendly displaying the content of the array. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > & | operator<< (MultiDimImplementation< GUM_ELEMENT > &array, const DiscreteVariable &v) |
| MultiDimInterface & | operator<< (MultiDimInterface &c, const DiscreteVariable &v) |
| Adds a new var to the sequence of vars. | |
| MultiDimInterface & | operator>> (MultiDimInterface &c, const DiscreteVariable &v) |
| Removes a var from the variables of the MutliDimAdressing. | |
| std::ostream & | operator<< (std::ostream &, const Instantiation &) |
| Print information of the instantiation in the stream. | |
| std::ostream & | operator<< (std::ostream &, const SetInst &) |
| Print information of the SetInst in the stream. | |
| gum::SetInst & | operator<< (gum::SetInst &inst, const gum::DiscreteVariable &i) |
| Adds a variable to inst. | |
| gum::SetInst & | operator>> (gum::SetInst &inst, const gum::DiscreteVariable &i) |
| Removes a variable to inst. | |
| template<GUM_Numeric GUM_SCALAR> | |
| Tensor< GUM_SCALAR > | log2 (const Tensor< GUM_SCALAR > &arg) |
| template<GUM_Numeric GUM_SCALAR> | |
| Tensor< GUM_SCALAR > | abs (const Tensor< GUM_SCALAR > &arg) |
| template<GUM_Numeric GUM_SCALAR> | |
| Tensor< GUM_SCALAR > | sq (const Tensor< GUM_SCALAR > &arg) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &out, const Tensor< GUM_SCALAR > &array) |
| template<typename GUM_ELEMENT> | |
| void | registerCompleteProjection (std::string_view projection_name, std::string_view type_multidim, typename CompleteProjectionRegister4MultiDim< GUM_ELEMENT >::CompleteProjectionPtr function) |
| A function to more easily register new projection functions in MultiDims. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMax (const MultiDimImplementation< GUM_ELEMENT > &table, Instantiation *instantiation=0) |
| the function to be used to project a MultiDimImplementation using a Max | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMin (const MultiDimImplementation< GUM_ELEMENT > &table, Instantiation *instantiation=0) |
| the function to be used to project a MultiDimImplementation using a Min | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectSum (const MultiDimImplementation< GUM_ELEMENT > &table, Instantiation *instantiation=0) |
| the function to be used to project a MultiDimImplementation using a sum | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectProduct (const MultiDimImplementation< GUM_ELEMENT > &table, Instantiation *instantiation=0) |
| the function to be used to project a MultiDimImplementation using a Product | |
| template<typename GUM_ELEMENT> | |
| void | completeProjections4MultiDimInit () |
| the function used to register all the complete projection operators on multidimImplementations over non-pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | pointerCompleteProjections4MultiDimInit () |
| The function used to register all the complete projections on multidimImplementations over pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | registerOperator (std::string_view operation_name, std::string_view type1, std::string_view type2, typename OperatorRegister4MultiDim< GUM_ELEMENT >::OperatorPtr function) |
| A function to more easily register new operators in MultiDims. | |
| template<typename GUM_ELEMENT> | |
| void | operators4MultiDimInit () |
| the function used to register all the operators on multidimImplementations over non-pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | pointerOperators4MultiDimInit () |
| the function used to register all the operators on multidimImplementations over pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | registerProjection (std::string_view projection_name, std::string_view type_multidim, typename ProjectionRegister4MultiDim< GUM_ELEMENT >::ProjectionPtr function) |
| A function to more easily register new projection functions in MultiDims. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMax (const MultiDimImplementation< GUM_ELEMENT > &table, const gum::VariableSet &del_vars) |
| The function to be used to project a MultiDimImplementation using a Max. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMin (const MultiDimImplementation< GUM_ELEMENT > &table, const gum::VariableSet &del_vars) |
| The function to be used to project a MultiDimImplementation using a Min. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectSum (const MultiDimImplementation< GUM_ELEMENT > &table, const gum::VariableSet &del_vars) |
| The function to be used to project a MultiDimImplementation using a Sum. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectProduct (const MultiDimImplementation< GUM_ELEMENT > &table, const gum::VariableSet &del_vars) |
| The function to be used to project a MultiDimImplementation using a Product. | |
| template<typename GUM_ELEMENT> | |
| void | projections4MultiDimInit () |
| the function used to register all the projection operators on multidimImplementations over non-pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | pointerProjections4MultiDimInit () |
| the function used to register all the projections on multidimImplementations over pointers types. | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | partialInstantiationMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| A specialized function for instantiating variables in a multiDimArray. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | partialInstantiationMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| A specialized function for instantiating variables in a MultiDimImplementation. | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT * > * | partialInstantiationMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| A specialized function for instantiating variables in a MultiDimArray. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT * > * | partialInstantiationMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| A specialized function for instantiating variables in a MultiDimArray. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | partialInstantiation (const MultiDimImplementation< GUM_ELEMENT > &table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| Instantiate variables in a MultiDimImplementation. | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | partialInstantiation (const MultiDimDecorator< GUM_ELEMENT > &table, const HashTable< const DiscreteVariable *, Idx > &inst_vars) |
| Instantiate variables in a MultiDimDecorator. | |
| template<typename GUM_ELEMENT> | |
| void | partialInstantiation4MultiDimInit () |
| The function used to register all the instantiation operators on multidimImplementations over non-pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | pointerPartialInstantiation4MultiDimInit () |
| The function used to register all the instantiations on multidimImplementations over pointers types. | |
| template<typename GUM_ELEMENT> | |
| void | registerPartialInstantiation (std::string_view instantiation_func_name, std::string_view type_multidim, typename PartialInstantiationRegister4MultiDim< GUM_ELEMENT >::PartialInstantiationPtr function) |
| A function to more easily register new instantiation functions in MultiDims. | |
| template<GUM_Numeric GUM_SCALAR = double> | |
| std::unique_ptr< DiscreteVariable > | fastVariable (std::string var_description, Size default_domain_size) |
| Create a pointer on a Discrete Variable from a "fast" syntax. | |
| template<GUM_Numeric GUM_SCALAR = double> | |
| std::unique_ptr< DiscreteVariable > | fastVariable (std::string var_description, std::string_view default_domain="[2]") |
| Create a pointer on a Discrete Variable from a "fast" syntax. | |
| template<typename T_VAL> | |
| std::ostream & | operator<< (std::ostream &, const ContinuousVariable< T_VAL > &) |
| for friendly displaying the content of the variable | |
| std::ostream & | operator<< (std::ostream &, const DiscreteVariable &) |
| for friendly displaying the content of the variable | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &output, const BayesNet< GUM_SCALAR > &bn) |
| Prints map's DAG in output using the Graphviz-dot format. | |
| template<GUM_Numeric GUM_SCALAR> | |
| NodeId | build_node (gum::BayesNet< GUM_SCALAR > &bn, std::string_view node, std::string_view default_domain) |
| template<GUM_Numeric GUM_SCALAR> | |
| gum::Size | getMaxModality (gum::BayesNet< GUM_SCALAR > &bayesNet) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &output, const IBayesNet< GUM_SCALAR > &bn) |
| Prints map's DAG in output using the Graphviz-dot format. | |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | LPNewmultiTensor (const Tensor< GUM_SCALAR > &t1, const Tensor< GUM_SCALAR > &t2) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | LPNewprojTensor (const Tensor< GUM_SCALAR > &t1, const gum::VariableSet &del_vars) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | LPMaxprojTensor (const Tensor< GUM_SCALAR > &t1, const gum::VariableSet &del_vars) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | SSNewmultiTensor (const Tensor< GUM_SCALAR > &t1, const Tensor< GUM_SCALAR > &t2) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | SSNewprojTensor (const Tensor< GUM_SCALAR > &t1, const gum::VariableSet &del_vars) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | VENewmultiTensor (const Tensor< GUM_SCALAR > &t1, const Tensor< GUM_SCALAR > &t2) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | VENewprojTensor (const Tensor< GUM_SCALAR > &t1, const gum::VariableSet &del_vars) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::tuple< CausalImpact< GUM_SCALAR >, Tensor< GUM_SCALAR >, std::string > | causalImpact (const CausalModel< GUM_SCALAR > &cm, const Set< std::string > &on, const Set< std::string > &doing, const Set< std::string > &knowing=Set< std::string >(), const HashTable< std::string, std::string > &values=HashTable< std::string, std::string >()) |
| Standalone helper that mirrors the Python function causalImpact(...). | |
| template<GUM_Numeric GUM_SCALAR> | |
| Instantiation | makeInstantiationFromValues (const Tensor< GUM_SCALAR > &tensor, const HashTable< std::string, std::string > &values) |
| Creates an instance for a tensor based on a HashTable. | |
| std::string | _formatVarsForSentence_ (const Set< std::string > &vars) |
| std::string | _dsepExplanation_ (const Set< std::string > &on, const Set< std::string > &doing, const Set< std::string > &knowing) |
| DAG | _removeIncomingIntoLocal_ (const DAG &g, const NodeSet &xset) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::string | _formatNodeSetNames_ (const CausalModel< GUM_SCALAR > &cm, const NodeSet &zset) |
| template Tensor< double > | counterfactual< double > (const CausalModel< double > &, const Set< std::string > &, const Set< std::string > &, const HashTable< std::string, std::string > &, const HashTable< std::string, std::string > &) |
| template CausalModel< double > | counterfactualModel< double > (const CausalModel< double > &, const HashTable< std::string, std::string > &, const Set< std::string > &) |
| template<GUM_Numeric GUM_ELEMENT> | |
| Tensor< GUM_ELEMENT > | counterfactual (const CausalModel< GUM_ELEMENT > &cm, const Set< std::string > &on, const Set< std::string > &whatif, const HashTable< std::string, std::string > &profile=HashTable< std::string, std::string >(), const HashTable< std::string, std::string > &values=HashTable< std::string, std::string >()) |
| Compute a counterfactual distribution using the high-level API. | |
| template<GUM_Numeric GUM_ELEMENT> | |
| CausalModel< GUM_ELEMENT > | counterfactualModel (const CausalModel< GUM_ELEMENT > &cm, const HashTable< std::string, std::string > &profile, const Set< std::string > &whatif) |
| Build the twin causal model. | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::unique_ptr< ASTtree< GUM_SCALAR > > | productOfTrees (std::vector< std::unique_ptr< ASTtree< GUM_SCALAR > > > &<erms) |
| Build a product AST from a list of terms. | |
| template std::unique_ptr< ASTtree< double > > | productOfTrees< double > (std::vector< std::unique_ptr< ASTtree< double > > > &&) |
| INLINE std::ostream & | operator<< (std::ostream &streamy, const ActionSet &objy) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &out, const DecisionTensor< GUM_SCALAR > &array) |
| template<GUM_Numeric GUM_SCALAR> | |
| NodeId | build_node_for_ID (gum::InfluenceDiagram< GUM_SCALAR > &infdiag, std::string node, std::string_view domain) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &output, const IMarkovRandomField< GUM_SCALAR > &mn) |
| Prints map's graph in output using the Graphviz-dot format. | |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | SSNewMNmultiTensor (const Tensor< GUM_SCALAR > &t1, const Tensor< GUM_SCALAR > &t2) |
| template<GUM_Numeric GUM_SCALAR> | |
| static INLINE Tensor< GUM_SCALAR > | SSNewMNprojTensor (const Tensor< GUM_SCALAR > &t1, const gum::VariableSet &del_vars) |
| template<GUM_Numeric GUM_SCALAR> | |
| NodeId | build_node_for_MN (MarkovRandomField< GUM_SCALAR > &mn, std::string_view node, std::string_view default_domain) |
| template<GUM_Numeric GUM_SCALAR> | |
| std::ostream & | operator<< (std::ostream &output, const MarkovRandomField< GUM_SCALAR > &mn) |
| unsigned int | getMaxNumberOfThreads () |
| Returns the maximum number of threads you should use at any time. | |
| unsigned int | getNumberOfThreads () |
| returns the max number of threads used by default when entering the next parallel region | |
| unsigned int | getNumberOfLogicalProcessors () |
| Get the number of logical processors. | |
Integers Pow utility methods | |
| unsigned long | intPow (unsigned long base, unsigned long exponent) |
| Specialized pow function with integers (faster implementation). | |
| uint64_t | int2Pow (uint64_t exponent) |
| Specialized base 2 pow function with integer. | |
| void | superiorPow (unsigned long card, unsigned long &num_bits, unsigned long &new_card) |
| Compute the superior and closest power of two of an integer. | |
| Idx | randomValue (const Size max=2) |
| Returns a random Idx between 0 and max-1 included. | |
| double | randomProba () |
| Returns a random double between 0 and 1 included (i.e. | |
| template<GUM_Numeric GUM_SCALAR> | |
| std::vector< GUM_SCALAR > | randomDistribution (Size n) |
| Return a random discrete distribution. | |
| unsigned int | randomGeneratorSeed () |
| Returns the aGrUM's seed used by the std::generators. | |
| unsigned int | currentRandomGeneratorValue () |
| returns the current generator's value | |
| void | initRandom (unsigned int seed=0) |
| Initialize random generator seed. | |
| std::mt19937 & | randomGenerator () |
| define a random_engine with correct seed | |
| std::string | getUniqueFileName () |
| Returns a path to a unique file name. | |
| bool | endsWith (const std::string_view &value, const std::string_view &ending) |
| Returns true if value ends with ending. | |
| std::vector< std::string > | split (std::string_view orig, std::string_view delimiter) |
| Split str using the delimiter. | |
| std::string | replace (std::string_view s, std::string_view val, std::string_view new_val) |
| Replace val by new_val in s. | |
| bool | isIntegerWithResult (std::string_view val, int *res) |
| return true is a string contains an integer value | |
| bool | isNumericalWithResult (std::string_view val, double *res) |
| return true is a string contains a numerical (double) value | |
| std::string | toLower (std::string_view str) |
| Returns the lowercase version of str. | |
| bool | contains (std::string_view s, std::string_view needle) |
| true if needle in s | |
| bool | isInteger (std::string_view val) |
| return true is a string contains an integer value | |
| bool | isNumerical (std::string_view val) |
| return true is a string contains a numerical (double) value | |
| void | ltrim (std::string &s) |
| trim from start (in place) | |
| void | rtrim (std::string &s) |
| trim from end (in place) | |
| void | trim (std::string &s) |
| trim from both ends (in place) | |
| std::string | trim_copy (std::string_view s) |
| trim from both ends (copying) | |
| std::string | remove_newline (std::string_view s) |
| remove all newlines in a string | |
| template<typename T> | |
| std::string | compact_tostr (T value) |
| Returns a path to a unique file name. | |
Project Max Operators | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMaxMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Max operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMaxMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Max operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectMaxMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Max operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectMaxMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Max operator. | |
Project Min Operators | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMinMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Min operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectMinMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Min operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectMinMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Min operator. | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectMinMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| A specialized function for projecting a multiDimArray using a Min operator. | |
Project Sum Operators | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectSumMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| a specialized function for projecting a multiDimArray using a Sum operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectSumMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| a specialized function for projecting a multiDimArray using a Sum operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectSumMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| a specialized function for projecting a multiDimArray using a Sum operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectSumMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| a specialized function for projecting a multiDimArray using a Sum operator | |
Project Multiply Operators | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectProductMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| a function for projecting a multiDimArray using a Product operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT | projectProductMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, Instantiation *instantiation=0) |
| a function for projecting a multiDimArray using a Product operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectProductMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| a function for projecting a multiDimArray using a Product operator | |
| template<typename GUM_ELEMENT> | |
| GUM_ELEMENT * | projectProductMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, Instantiation *instantiation=0) |
| a function for projecting a multiDimArray using a Product operator | |
Add MultiDims | |
| template<typename T> | |
| MultiDimArray< T > * | add2MultiDimArrays (const MultiDimArray< T > *t1, const MultiDimArray< T > *t2) |
| a specialized function for summing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | add2MultiDimArrays (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for summing two multiDimArrays | |
| template<typename T> | |
| MultiDimArray< T * > * | add2MultiDimArrays4Pointers (const MultiDimArray< T * > *t1, const MultiDimArray< T * > *t2) |
| a specialized function for summing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T * > * | add2MultiDimArrays4Pointers (const MultiDimImplementation< T * > *t1, const MultiDimImplementation< T * > *t2) |
| a specialized function for summing two multiDimArrays | |
| template<typename T> | |
| MultiDimFunctionGraph< T > * | add2MultiDimFunctionGraphs (const MultiDimFunctionGraph< T > *t1, const MultiDimFunctionGraph< T > *t2) |
| a specialized function for summing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | add2MultiDimFunctionGraphs (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for summing two multiDimArrays | |
Substract MultiDims | |
| template<typename T> | |
| MultiDimArray< T > * | subtract2MultiDimArrays (const MultiDimArray< T > *t1, const MultiDimArray< T > *t2) |
| a specialized function for subtracting two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | subtract2MultiDimArrays (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for subtracting two multiDimArrays | |
| template<typename T> | |
| MultiDimArray< T * > * | subtract2MultiDimArrays4Pointers (const MultiDimArray< T * > *t1, const MultiDimArray< T * > *t2) |
| a specialized function for subtracting two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T * > * | subtract2MultiDimArrays4Pointers (const MultiDimImplementation< T * > *t1, const MultiDimImplementation< T * > *t2) |
| a specialized function for subtracting two multiDimArrays | |
| template<typename T> | |
| MultiDimFunctionGraph< T > * | subtract2MultiDimFunctionGraphs (const MultiDimFunctionGraph< T > *t1, const MultiDimFunctionGraph< T > *t2) |
| a specialized function for subtracting two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | subtract2MultiDimFunctionGraphs (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for subtracting two multiDimArrays | |
Multiply MultiDims | |
| template<typename T> | |
| MultiDimArray< T > * | multiply2MultiDimArrays (const MultiDimArray< T > *t1, const MultiDimArray< T > *t2) |
| a specialized function for multiplying two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | multiply2MultiDimArrays (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for multiplying two multiDimArrays | |
| template<typename T> | |
| MultiDimArray< T * > * | multiply2MultiDimArrays4Pointers (const MultiDimArray< T * > *t1, const MultiDimArray< T * > *t2) |
| a specialized function for multiplying two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T * > * | multiply2MultiDimArrays4Pointers (const MultiDimImplementation< T * > *t1, const MultiDimImplementation< T * > *t2) |
| a specialized function for multiplying two multiDimArrays | |
| template<typename T> | |
| MultiDimFunctionGraph< T > * | multiply2MultiDimFunctionGraphs (const MultiDimFunctionGraph< T > *t1, const MultiDimFunctionGraph< T > *t2) |
| a specialized function for multiplying two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | multiply2MultiDimFunctionGraphs (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for multiplying two multiDimArrays | |
Divide MultiDims | |
| template<typename T> | |
| MultiDimArray< T > * | divide2MultiDimArrays (const MultiDimArray< T > *t1, const MultiDimArray< T > *t2) |
| a specialized function for dividing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | divide2MultiDimArrays (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for dividing two multiDimArrays | |
| template<typename T> | |
| MultiDimArray< T * > * | divide2MultiDimArrays4Pointers (const MultiDimArray< T * > *t1, const MultiDimArray< T * > *t2) |
| a specialized function for dividing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T * > * | divide2MultiDimArrays4Pointers (const MultiDimImplementation< T * > *t1, const MultiDimImplementation< T * > *t2) |
| a specialized function for dividing two multiDimArrays | |
| template<typename T> | |
| MultiDimFunctionGraph< T > * | divide2MultiDimFunctionGraphs (const MultiDimFunctionGraph< T > *t1, const MultiDimFunctionGraph< T > *t2) |
| a specialized function for dividing two multiDimArrays | |
| template<typename T> | |
| MultiDimImplementation< T > * | divide2MultiDimFunctionGraphs (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for dividing two multiDimArrays | |
Maximise MultiDims | |
| template<typename T> | |
| MultiDimFunctionGraph< T > * | maximise2MultiDimFunctionGraphs (const MultiDimFunctionGraph< T > *t1, const MultiDimFunctionGraph< T > *t2) |
| a specialized function for compare value from two multiDimFunctionGraphs and gets the maximal | |
| template<typename T> | |
| MultiDimImplementation< T > * | maximise2MultiDimFunctionGraphs (const MultiDimImplementation< T > *t1, const MultiDimImplementation< T > *t2) |
| a specialized function for compare value from two multiDimFunctionGraphs and gets the maximal | |
Operators over MultiDim | |
| template<typename T> | |
| MultiDimImplementation< T > * | operator+ (const MultiDimImplementation< T > &, const MultiDimImplementation< T > &) |
| The function to be used to add two MultiDimImplementations. | |
| template<typename T> | |
| MultiDimImplementation< T > * | operator- (const MultiDimImplementation< T > &, const MultiDimImplementation< T > &) |
| The function to be used to subtract two MultiDimImplementations. | |
| template<typename T> | |
| MultiDimImplementation< T > * | operator* (const MultiDimImplementation< T > &, const MultiDimImplementation< T > &) |
| The function to be used to multiply two MultiDimImplementations. | |
| template<typename T> | |
| MultiDimImplementation< T > * | operator/ (const MultiDimImplementation< T > &, const MultiDimImplementation< T > &) |
| The function to be used to divide two MultiDimImplementations. | |
Project Max for MultiDim | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | projectMaxMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Max operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMaxMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Max operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT * > * | projectMaxMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Max operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT * > * | projectMaxMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Max operator | |
Project Min for MultiDim | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | projectMinMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Min operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMinMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Min operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT * > * | projectMinMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Min operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT * > * | projectMinMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a Min operator | |
Project Sum for MultiDim | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | projectSumMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a summation | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectSumMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a summation | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT * > * | projectSumMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a summation | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT * > * | projectSumMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using a summation | |
Project Product for MultiDim | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | projectProductMultiDimArray (const MultiDimArray< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using products | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectProductMultiDimArray (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using products | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT * > * | projectProductMultiDimArray4Pointers (const MultiDimArray< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using products | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT * > * | projectProductMultiDimArray4Pointers (const MultiDimImplementation< GUM_ELEMENT * > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimArray using products | |
Project Function for MultiDim | |
| template<typename GUM_ELEMENT> | |
| MultiDimArray< GUM_ELEMENT > * | ProjectFuncMultiDimArray (const MultiDimArray< GUM_ELEMENT > *t1, const MultiDimArray< GUM_ELEMENT > *t2, const GUM_ELEMENT(*f)(const GUM_ELEMENT &, const GUM_ELEMENT &)) |
| a specialized function for functionally projecting a multiDimArray | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | combine2MultiDimArrays (const MultiDimImplementation< GUM_ELEMENT > *t1, const MultiDimImplementation< GUM_ELEMENT > *t2, const GUM_ELEMENT(*f)(const GUM_ELEMENT &, const GUM_ELEMENT &)) |
| a specialized function for functionally projecting a multiDimArray | |
Projectors For Function Graphs | |
| template<typename GUM_ELEMENT> | |
| MultiDimFunctionGraph< GUM_ELEMENT > * | projectMaxMultiDimFunctionGraph (const MultiDimFunctionGraph< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a Max operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMaxMultiDimFunctionGraph (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a Max operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimFunctionGraph< GUM_ELEMENT > * | projectMinMultiDimFunctionGraph (const MultiDimFunctionGraph< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a Min operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectMinMultiDimFunctionGraph (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a Min operator | |
| template<typename GUM_ELEMENT> | |
| MultiDimFunctionGraph< GUM_ELEMENT > * | projectSumMultiDimFunctionGraph (const MultiDimFunctionGraph< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a summation | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectSumMultiDimFunctionGraph (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using a summation | |
| template<typename GUM_ELEMENT> | |
| MultiDimFunctionGraph< GUM_ELEMENT > * | projectProductMultiDimFunctionGraph (const MultiDimFunctionGraph< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using products | |
| template<typename GUM_ELEMENT> | |
| MultiDimImplementation< GUM_ELEMENT > * | projectProductMultiDimFunctionGraph (const MultiDimImplementation< GUM_ELEMENT > *table, const gum::VariableSet &del_vars) |
| a specialized function for projecting a multiDimFunctionGraph using products | |
Variables | |
| const double | VariableLog2ParamComplexityCTable [4][1000] |
| constexpr std::size_t | VariableLog2ParamComplexityCTableRSize {std::size_t(4)} |
| constexpr std::size_t | VariableLog2ParamComplexityCTableNSize {std::size_t(1000)} |
| template<> | |
| const float | MultiDimFunctionGraph< float >::defaultValue = 0.0f |
| template<> | |
| const double | MultiDimFunctionGraph< double >::defaultValue = 0.0 |
| template<typename T1, typename T2> | |
| using | forbidden_type = typename std::enable_if< !std::is_same< T1, T2 >::value, int >::type |
| Forbidden_type<T1,T2> return the "int" type if T1 and T2 are of the same type, else nothing. | |
| bool | Memcmp (const void *const in_, const void *const out_, unsigned long size) |
| Cross-platform replacement for memcmp. | |
| void | _atexit_ () |
| Used for debug purpose. | |
| using | EdgeSet = Set< Edge > |
| Some typdefs and define for shortcuts ... | |
| using | NodeSet = Set< NodeId > |
| Some typdefs and define for shortcuts ... | |
| using | ArcSet = Set< Arc > |
| Some typdefs and define for shortcuts ... | |
| using | ArcSetIterator = ArcSet::const_iterator |
| Some typdefs and define for shortcuts ... | |
| using | EdgeSetIterator = EdgeSet::const_iterator |
| Some typdefs and define for shortcuts ... | |
| using | NodeSetIterator = NodeSet::const_iterator |
| Some typdefs and define for shortcuts ... | |
| const NodeSet | emptyNodeSet |
| Some typdefs and define for shortcuts ... | |
gum is the global namespace for all aGrUM entities
c++11 stuff, like declval ( decltype from prototype without a default constructor )
include the inlined functions if necessary
the function to be used to partially instantiate a MultiDimDecorator
class for LOGIT implementation as multiDim
| using gum::FactorTable = HashTable< NodeSet, const Tensor< GUM_SCALAR >* > |
Definition at line 61 of file IMarkovRandomField.h.
| using gum::HybridGibbsSampling = LoopySamplingInference< GUM_SCALAR, GibbsSampling > |
Definition at line 245 of file loopySamplingInference.h.
| using gum::HybridImportanceSampling = LoopySamplingInference< GUM_SCALAR, ImportanceSampling > |
Definition at line 243 of file loopySamplingInference.h.
| using gum::HybridMonteCarloSampling = LoopySamplingInference< GUM_SCALAR, MonteCarloSampling > |
Definition at line 239 of file loopySamplingInference.h.
| using gum::HybridWeightedSampling = LoopySamplingInference< GUM_SCALAR, WeightedSampling > |
Definition at line 241 of file loopySamplingInference.h.
| using gum::JoinTree = CliqueGraph |
a join tree is a clique graph satisfying the running intersection property (but some cliques may be included into others)
Definition at line 337 of file cliqueGraph.h.
| using gum::JunctionTree = CliqueGraph |
a junction tree is a clique graph satisfying the running intersection property and such that no clique is included into another one.
Definition at line 333 of file cliqueGraph.h.
| using gum::LatentDescriptorIds = std::pair< std::string, std::vector< NodeId > > |
LatentDescriptorIds = (latentName, (child1Id, child2Id, ...)).
Compact descriptor for a single latent variable and its observed children.
The first element is the name of the latent to create; the second element is the list of **NodeId**s of observed children the latent points to in the causal DAG.
Definition at line 63 of file causalModel.h.
| using gum::LatentDescriptorVector = std::vector< LatentDescriptorIds > |
Collection of latent descriptors (see LatentDescriptorIds).
Definition at line 66 of file causalModel.h.
| using gum::pair_iterator = HashTableConstIteratorSafe< LeafPair*, std::vector< Size > > |
Definition at line 70 of file fusionContext.h.
| using gum::Signaler0 = Signaler<> |
Signaler with no arguments.
This is an alias for Signaler<> (empty parameter pack). The callback signature is void handler(const void* src).
Definition at line 273 of file signaler.h.
Definition at line 66 of file threadExecutor.h.
| using gum::VariableSet = Set< const DiscreteVariable* > |
Definition at line 192 of file discreteVariable.h.
|
strong |
The direction of a given edge in a binary tree.
| Enumerator | |
|---|---|
| LEFT_CHILD | |
| RIGHT_CHILD | |
| NO_PARENT | |
Definition at line 56 of file binTreeNode.h.
|
strong |
Complexity allows to characterize the awaited difficulty for an algorithm given a specific instance Therefore this is not a theoretical characterization but rather a pragmatic rate of that very instance.
| Enumerator | |
|---|---|
| Heavy | |
| Difficult | |
| Correct | |
Definition at line 64 of file BNdistance.h.
|
strong |
Endpoint marks used in PAG edges.
Convention: marks_[Arc(x,y)] stores the mark at the y-endpoint when traversing from x. For edge x-y:
| Enumerator | |
|---|---|
| Circle | |
| Tail | |
| Arrowhead | |
Definition at line 65 of file PAG.h.
| enum gum::FactorySimulationAction : Idx |
|
strong |
type of algorithm to determine barren nodes
When constructing messages from one clique to its neighbor, we can determine that some nodes are barren, i.e., they are the only one at the left hand side of a conditioning bar and they appear in only one tensor. In such case, in a classical BN inference, there is no need to take them into account since their removal will necessarily create a constant tensor. So, we can discard their tensor from the computation. However, when computing p(evidence), we should not do that because the constant is important and need be computed.
| Enumerator | |
|---|---|
| FIND_NO_BARREN_NODES | |
| FIND_BARREN_NODES | |
Definition at line 73 of file BayesNetInference.h.
|
strong |
The enumeration of states in which the factory can be in.
Every documentation section's name indicates from which state you can call it's methods, and in which state it places the factory.
There is an exception for the delegated CPT definition methods which do not changes the state of the factory.
| Enumerator | |
|---|---|
| NONE | |
| VARIABLE | |
| ACTION | |
| TRANSITION | |
| COST | |
| REWARD | |
| DISCOUNT | |
Definition at line 71 of file IfmdpFactory.h.
| enum gum::LEARNERNAME |
|
strong |
type of algorithm for determining the relevant tensors for combinations using some d-separation analysis
When constructing messages from one clique to its neighbor, we can exploit d-separation to determine that some tensors are irrelevant for the message computation. So we can discard them and, thereby, speed-up the computations.
| Enumerator | |
|---|---|
| FIND_ALL | |
| DSEP_BAYESBALL_NODES | |
| DSEP_BAYESBALL_TENSORS | |
| DSEP_KOLLER_FRIEDMAN_2009 | |
Definition at line 63 of file relevantTensorsFinderType.h.
|
strong |
the currently supported types of "low-level" operators
the types of "low-level" operators used for scheduling inferences
| Enumerator | |
|---|---|
| COMBINE_MULTIDIM | combine 2 ScheduleMultiDims |
| PROJECT_MULTIDIM | project a ScheduleMultiDim over a subset of its variables |
| DELETE_MULTIDIM | remove from memory a multidimensional table stored in a ScheduleMultiDim |
| STORE_MULTIDIM | store a multidimensional table outside of the scheduler |
Definition at line 67 of file scheduleOperator.h.
| enum gum::SchedulerType |
the type of scheduler that can be used
| Enumerator | |
|---|---|
| SEQUENTIAL | |
| PARALLEL_OPERATORS | |
Definition at line 61 of file scheduler.h.
|
strong |
| enum gum::TaxiSimulationAction : Idx |
| enum gum::TaxiSimulationLandmark : Idx |
| Enumerator | |
|---|---|
| HOME | |
| WORK | |
| THEATER | |
| CLUB | |
| TAXI | |
Definition at line 63 of file taxiSimulator.h.
| enum gum::TaxiSimulationLandmarkX : Idx |
| enum gum::TaxiSimulationLandmarkY : Idx |
| enum gum::TESTNAME |
|
strong |
| Enumerator | |
|---|---|
| DISCRETIZED | |
| LABELIZED | |
| INTEGER | |
| NUMERICAL | |
| RANGE | |
| CONTINUOUS | |
Definition at line 62 of file variable.h.
|
inline |
Definition at line 70 of file causalImpact_tpl.h.
References _formatVarsForSentence_(), and gum::Set< Key >::empty().
| std::string gum::_formatNodeSetNames_ | ( | const CausalModel< GUM_SCALAR > & | cm, |
| const NodeSet & | zset ) |
Definition at line 96 of file causalImpact_tpl.h.
|
inline |
Definition at line 51 of file causalImpact_tpl.h.
Referenced by _dsepExplanation_().
| void gum::_initTensorOperators__ | ( | ) |
Definition at line 63 of file multiDimDecorator_tpl.h.
References gum::CompleteProjections4MultiDimInitialize< GUM_ELEMENT >::init(), gum::Operators4MultiDimInitialize< GUM_ELEMENT >::init(), gum::PartialInstantiation4MultiDimInitialize< GUM_ELEMENT >::init(), and gum::Projections4MultiDimInitialize< GUM_ELEMENT >::init().
Referenced by gum::MultiDimDecorator< GUM_ELEMENT >::MultiDimDecorator(), and gum::MultiDimDecorator< GUM_ELEMENT >::MultiDimDecorator().
| INLINE std::vector< uint8_t > gum::_readVector_ | ( | std::istream & | is | ) |
Reads a length-prefixed byte vector from a binary stream (bgum format).
The first 8 bytes encode the payload length as a little-endian uint64_t, followed by that many payload bytes.
| is | The input binary stream. |
Definition at line 50 of file GumBinaryIO_inl.h.
Definition at line 85 of file causalImpact_tpl.h.
| INLINE void gum::_writeVector_ | ( | std::ostream & | os, |
| const std::vector< uint8_t > & | vec ) |
Writes a length-prefixed byte vector to a binary stream (bgum format).
| os | The output binary stream. |
| vec | The payload bytes to write. |
Definition at line 63 of file GumBinaryIO_inl.h.
|
inline |
| NodeId gum::build_node | ( | gum::BayesNet< GUM_SCALAR > & | bn, |
| std::string_view | node, | ||
| std::string_view | default_domain ) |
Definition at line 78 of file BayesNet_tpl.h.
References gum::BayesNet< GUM_SCALAR >::add(), gum::DAGmodel::exists(), fastVariable(), and gum::BayesNet< GUM_SCALAR >::idFromName().
Referenced by gum::BayesNet< GUM_SCALAR >::fastPrototype().
| NodeId gum::build_node_for_ID | ( | gum::InfluenceDiagram< GUM_SCALAR > & | infdiag, |
| std::string | node, | ||
| std::string_view | domain ) |
Definition at line 61 of file influenceDiagram_tpl.h.
References gum::InfluenceDiagram< GUM_SCALAR >::addChanceNode(), gum::InfluenceDiagram< GUM_SCALAR >::addDecisionNode(), gum::InfluenceDiagram< GUM_SCALAR >::addUtilityNode(), gum::DAGmodel::exists(), fastVariable(), GUM_ERROR, and gum::InfluenceDiagram< GUM_SCALAR >::idFromName().
Referenced by gum::InfluenceDiagram< GUM_SCALAR >::fastPrototype().
| NodeId gum::build_node_for_MN | ( | MarkovRandomField< GUM_SCALAR > & | mn, |
| std::string_view | node, | ||
| std::string_view | default_domain ) |
Definition at line 76 of file MarkovRandomField_tpl.h.
References fastVariable().
| std::tuple< CausalImpact< GUM_SCALAR >, Tensor< GUM_SCALAR >, std::string > gum::causalImpact | ( | const CausalModel< GUM_SCALAR > & | cm, |
| const Set< std::string > & | on, | ||
| const Set< std::string > & | doing, | ||
| const Set< std::string > & | knowing = Set< std::string >(), | ||
| const HashTable< std::string, std::string > & | values = HashTable< std::string, std::string >() ) |
Standalone helper that mirrors the Python function causalImpact(...).
Returns: (symbolic CausalFormula, numeric Tensor, explanation string). If not identifiable, the formula carries a null AST and the tensor is empty.
Definition at line 322 of file causalImpact_tpl.h.
References gum::HashTable< Key, Val >::empty(), gum::CausalImpact< GUM_SCALAR >::eval(), gum::CausalImpact< GUM_SCALAR >::explanation(), gum::CausalImpact< GUM_SCALAR >::isIdentified(), and makeInstantiationFromValues().
| MultiDimImplementation< GUM_ELEMENT > * gum::combine2MultiDimArrays | ( | const MultiDimImplementation< GUM_ELEMENT > * | t1, |
| const MultiDimImplementation< GUM_ELEMENT > * | t2, | ||
| const GUM_ELEMENT(* | f )(const GUM_ELEMENT &, const GUM_ELEMENT &) ) |
a specialized function for functionally projecting a multiDimArray
The function produces a tensorial functional combination of t1 and t2, that is, if t1 and t2 are multiDimArrays over variables A,B,C,D and D,B,E respectively, function combine2MultiDimArrays will return a multiDimArray T defined as T[A,B,C,D,E] = f ( t1[A,B,C,D],t2[D,B,E] ) for all A,B,C,D,E.
| Tensor< GUM_ELEMENT > gum::counterfactual | ( | const CausalModel< GUM_ELEMENT > & | cm, |
| const Set< std::string > & | on, | ||
| const Set< std::string > & | whatif, | ||
| const HashTable< std::string, std::string > & | profile = HashTable< std::string, std::string >(), | ||
| const HashTable< std::string, std::string > & | values = HashTable< std::string, std::string >() ) |
Compute a counterfactual distribution using the high-level API.
Mirrors the Python function counterfactual(cm, profile, on, whatif, values). Internally constructs a Counterfactual<GUM_ELEMENT> instance and returns its evaluated tensor adapted to variables from cm.
| GUM_ELEMENT | numeric scalar type (e.g., double) |
| cm | Causal model (original, observational world) |
| on | Names of variables of interest (can be a singleton) |
| whatif | Intervention targets (do-variables) by name |
| profile | Optional evidence on original world (name -> label) |
| values | Optional intervention values (name -> label). If empty, the result spans all values of the whatif variables. |
on (variables are those of cm). Definition at line 308 of file counterfactual_tpl.h.
References gum::Counterfactual< GUM_ELEMENT >::value().
| template Tensor< double > gum::counterfactual< double > | ( | const CausalModel< double > & | , |
| const Set< std::string > & | , | ||
| const Set< std::string > & | , | ||
| const HashTable< std::string, std::string > & | , | ||
| const HashTable< std::string, std::string > & | ) |
| CausalModel< GUM_ELEMENT > gum::counterfactualModel | ( | const CausalModel< GUM_ELEMENT > & | cm, |
| const HashTable< std::string, std::string > & | profile, | ||
| const Set< std::string > & | whatif ) |
Build the twin causal model.
Mirrors the Python function counterfactualModel(cm, profile, whatif). It computes posteriors of idiosyncratic nodes in the original BN given profile and replaces their priors in a cloned model.
| GUM_ELEMENT | numeric scalar type (e.g., double) |
| cm | Original causal model |
| profile | Optional evidence on the original BN (name -> label) |
| whatif | Intervention targets (do-variables) by name |
Definition at line 320 of file counterfactual_tpl.h.
References gum::GraphicalModelInference< GUM_SCALAR >::addEvidence(), gum::HashTable< Key, Val >::empty(), gum::Set< Key >::erase(), gum::CausalModel< GUM_SCALAR >::idFromName(), gum::Set< Key >::insert(), gum::CausalModel< GUM_SCALAR >::latentVariablesIds(), gum::GraphicalModelInference< GUM_SCALAR >::makeInference(), gum::CausalModel< GUM_SCALAR >::observationalBN(), and gum::JointTargetedInference< GUM_SCALAR >::posterior().
| template CausalModel< double > gum::counterfactualModel< double > | ( | const CausalModel< double > & | , |
| const HashTable< std::string, std::string > & | , | ||
| const Set< std::string > & | ) |
| std::vector< std::pair< Idx, Idx > > gum::dispatchRangeToThreads | ( | Idx | beg, |
| Idx | end, | ||
| unsigned int | nb_threads ) |
returns a vector equally splitting elements of a range among threads
| beg | the beginning of the range (included) |
| end | the end of the range (excluded) |
| nb_threads | the number of threads over which we would like performing the splitting |
Definition at line 76 of file threads.cpp.
Referenced by gum::credal::CredalNet< GUM_SCALAR >::_H2Vlrs_(), gum::credal::CNLoopyPropagation< GUM_SCALAR >::enum_combi_(), gum::credal::CNLoopyPropagation< GUM_SCALAR >::enum_combi_(), gum::credal::MultipleInferenceEngine< GUM_SCALAR, BNInferenceEngine >::expFusion_(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::makeInference(), and gum::credal::MultipleInferenceEngine< GUM_SCALAR, BNInferenceEngine >::verticesFusion_().
| std::unique_ptr< DiscreteVariable > gum::fastVariable | ( | std::string | var_description, |
| Size | default_domain_size ) |
Create a pointer on a Discrete Variable from a "fast" syntax.
| var_description | : the string in "fast" syntax |
| default_domain_size | : the domain size if the description does not give this information. Note that if default_domain_size=1, a variable with a domain Size=1 is not an error. |
Definition at line 52 of file allDiscreteVariables_tpl.h.
References fastVariable(), and GUM_ERROR.
Referenced by gum::BayesNet< GUM_SCALAR >::add(), gum::InfluenceDiagram< GUM_SCALAR >::addChanceNode(), gum::InfluenceDiagram< GUM_SCALAR >::addDecisionNode(), gum::InfluenceDiagram< GUM_SCALAR >::addUtilityNode(), build_node(), build_node_for_ID(), build_node_for_MN(), and fastVariable().
| std::unique_ptr< DiscreteVariable > gum::fastVariable | ( | std::string | var_description, |
| std::string_view | default_domain = "[2]" ) |
Create a pointer on a Discrete Variable from a "fast" syntax.
| var_description | : the string in "fast" syntax |
| default_domain_size | : the domain size if the description does not give this information. Note that if default_domain_size=1, a variable with a domain Size=1 is not an error. |
Definition at line 62 of file allDiscreteVariables_tpl.h.
References GUM_ERROR, isfinite(), isInteger(), isNumerical(), split(), and trim().
| std::string gum::func2str | ( | FormulaPart::token_function | func | ) |
Definition at line 79 of file formula.cpp.
References gum::FormulaPart::exp, GUM_ERROR, gum::FormulaPart::ln, gum::FormulaPart::log, gum::FormulaPart::nil, gum::FormulaPart::pow, and gum::FormulaPart::sqrt.
Referenced by gum::FormulaPart::str().
| gum::Size gum::getMaxModality | ( | gum::BayesNet< GUM_SCALAR > & | bayesNet | ) |
Definition at line 56 of file MCBayesNetGenerator_tpl.h.
References gum::DiscreteVariable::domainSize(), gum::DAGmodel::nodes(), and gum::BayesNet< GUM_SCALAR >::variable().
Referenced by gum::MCBayesNetGenerator< GUM_SCALAR, ICPTGenerator, ICPTDisturber >::MCBayesNetGenerator().
| INLINE unsigned int gum::threadsSTL::getMaxNumberOfThreads | ( | ) |
Returns the maximum number of threads you should use at any time.
By default, it should be the number of CPU cores available. Note that it is preferable to use function getNumberOfThreads(), which corresponds to the max number of threads the user wants to launch in parallel regions (this is by default equal to getMaxNumberOfThreads(), but the user may wish to change it for some reason).
Definition at line 61 of file threadsSTL_inl.h.
| INLINE unsigned int gum::threadsSTL::getNumberOfLogicalProcessors | ( | ) |
Get the number of logical processors.
Definition at line 66 of file threadsSTL_inl.h.
| unsigned int gum::threadsSTL::getNumberOfThreads | ( | ) |
returns the max number of threads used by default when entering the next parallel region
This is the number of threads launched in parallel regions. By default, this number is equal to getMaxNumberOfThreads() but if the user has changed it using method setNumberOfThreads, then this number is what the user required.
Definition at line 70 of file threadsSTL.cpp.
Referenced by gum::credal::CredalNet< GUM_SCALAR >::_H2Vlrs_(), gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::_mcThreadDataCopy_(), gum::credal::CNLoopyPropagation< GUM_SCALAR >::enum_combi_(), gum::credal::CNLoopyPropagation< GUM_SCALAR >::enum_combi_(), and gum::credal::CNMonteCarloSampling< GUM_SCALAR, BNInferenceEngine >::makeInference().
| bool gum::isCloseToOne | ( | T | x, |
| T | tol = T(1e-9) ) |
Definition at line 52 of file math_utils_tpl.h.
Referenced by gum::credal::LRSWrapper< GUM_SCALAR >::H2V(), gum::Tensor< GUM_SCALAR >::mean(), gum::credal::CredalNet< GUM_SCALAR >::setCPT(), gum::credal::CredalNet< GUM_SCALAR >::setCPT(), gum::credal::CredalNet< GUM_SCALAR >::setCPTs(), and gum::Tensor< GUM_SCALAR >::variance().
| bool gum::isCloseToZero | ( | T | x, |
| T | tol = T(1e-9) ) |
Definition at line 47 of file math_utils_tpl.h.
| bool gum::isfinite | ( | T | arg | ) |
Definition at line 57 of file math_utils_tpl.h.
Referenced by gum::IntegerVariable::IntegerVariable(), gum::NumericalDiscreteVariable::NumericalDiscreteVariable(), gum::NumericalDiscreteVariable::NumericalDiscreteVariable(), and fastVariable().
| bool gum::isOMP | ( | ) |
indicates whether aGrUM uses openMP or STL threads
Definition at line 66 of file threads.cpp.
|
inline |
|
static |
|
static |
|
static |
|
inline |
Creates an instance for a tensor based on a HashTable.
| tensor | The target tensor whose variables define the instantiation’s scope. |
| values | Mapping from variable name to label that must be fully applicable. |
values.| NotFound | If a variable name in values is not a dimension of tensor. |
| NotFound | If a label in values is not in the corresponding variable’s domain. |
Definition at line 299 of file causalImpact_tpl.h.
References gum::Instantiation::add(), and gum::Instantiation::chgVal().
Referenced by causalImpact(), and gum::Counterfactual< GUM_ELEMENT >::run().
| const value_type & gum::operator* | ( | ) |
Returns the value pointed to by the iterator.
| UndefinedIteratorValue | Raised when the iterator does not point to a valid hash table element |
| UndefinedIteratorValue | Raised when the iterator does not point to a valid hash table element. |
Definition at line 252 of file formula_inl.h.
References gum::Formula::result().
Definition at line 242 of file formula_inl.h.
References gum::Formula::result().
| HashTableIteratorSafe< Key, Val > gum::operator+ | ( | Size | i | ) | const |
Returns a new iterator pointing to i elements further in the hashtable.
| i | The number of increments. |
|
noexcept |
|
noexcept |
Makes the iterator point to i elements further in the hashtable.
| i | The number of increments. |
Referenced by gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::ArgMaxSet(), and gum::ArgMaxSet< GUM_SCALAR_VAL, GUM_SCALAR_SEQ >::operator=().
Definition at line 239 of file formula_inl.h.
References gum::Formula::result().
Definition at line 247 of file formula_inl.h.
References gum::Formula::result().
| ListConstIterator< Val >::difference_type gum::operator- | ( | const ListConstIterator< Val > & | iter1, |
| const ListConstIterator< Val > & | iter2 ) |
For STL compliance, a distance operator.
Definition at line 348 of file list_tpl.h.
| ListConstIteratorSafe< Val >::difference_type gum::operator- | ( | const ListConstIteratorSafe< Val > & | iter1, |
| const ListConstIteratorSafe< Val > & | iter2 ) |
For STL compliance, a distance operator.
Definition at line 944 of file list_tpl.h.
Definition at line 257 of file formula_inl.h.
References gum::Formula::result().
| gum::SetInst & gum::operator<< | ( | gum::SetInst & | inst, |
| const gum::DiscreteVariable & | i ) |
Adds a variable to inst.
| inst | The SetInst to which a variable is added. |
| i | The variable to add. |
| DuplicateElement | If i is already in the SetInst. |
| MultiDimImplementation< GUM_ELEMENT > & gum::operator<< | ( | MultiDimImplementation< GUM_ELEMENT > & | array, |
| const DiscreteVariable & | v ) |
Definition at line 127 of file multiDimImplementation_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Bijection< T1, T2 > & | bijection ) |
For friendly display of the content of the gum::Bijection.
| bijection | The gum::Bijection to display. |
| T1 | The first type of elements in the gum::Bjection. |
| T2 | The second type of elements in the gum::Bjection. |
Definition at line 1083 of file bijection_tpl.h.
References gum::BijectionImplementation< T1, T2, Gen >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const CliqueGraph & | ) |
for friendly displaying the content of clique graphs
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const ContinuousVariable< T_VAL > & | ) |
for friendly displaying the content of the variable
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const DiscreteVariable & | ) |
for friendly displaying the content of the variable
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const EdgeGraphPart & | set ) |
for friendly displaying the content of an edge set
Definition at line 167 of file edgeGraphPart.cpp.
References gum::EdgeGraphPart::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Heap< Val, Cmp > & | heap ) |
Definition at line 310 of file heap_tpl.h.
References gum::Heap< Val, Cmp >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const IndexedTree< Key, Data > & | ) |
Necessary for the hashtable operator <<.
| std::ostream & gum::operator<< | ( | std::ostream & | aStream, |
| const Instantiation & | i ) |
Print information of the instantiation in the stream.
Definition at line 273 of file instantiation.cpp.
References gum::Instantiation::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const NodeGraphPart & | set ) |
for friendly displaying the content of node set
Definition at line 209 of file nodeGraphPart.cpp.
References gum::NodeGraphPart::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const PriorityQueue< Val, Priority, Cmp > & | queue ) |
Definition at line 1032 of file priorityQueue_tpl.h.
References gum::PriorityQueueImplementation< Val, Priority, Cmp, Gen >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Set< Key > & | set ) |
A << operator for HashTableList.
Definition at line 716 of file set_tpl.h.
References gum::Set< Key >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const SetInst & | ) |
Print information of the SetInst in the stream.
| std::ostream & gum::operator<< | ( | std::ostream & | , |
| const VariableNodeMap & | ) |
for friendly displaying the content of clique graphs
| INLINE std::ostream & gum::operator<< | ( | std::ostream & | os, |
| const Formula & | f ) |
Definition at line 265 of file formula_inl.h.
References gum::Formula::result().
| INLINE std::ostream & gum::operator<< | ( | std::ostream & | os, |
| const Timer & | t ) |
Definition at line 95 of file timer_inl.h.
References gum::Timer::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const DecisionTensor< GUM_SCALAR > & | array ) |
Definition at line 217 of file decisionTensor_tpl.h.
References gum::DecisionTensor< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const MultiDimContainer< GUM_ELEMENT > & | array ) |
Definition at line 314 of file multiDimContainer_tpl.h.
| INLINE std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const SplayBinaryNode< Element > & | e ) |
Display the node.
Friendly to display.
Definition at line 794 of file splay_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const SplayBinaryNode< Element > & | e ) |
| INLINE std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const SplayTree< Element > & | s ) |
Display the tree.
Friendly to display.
Definition at line 807 of file splay_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const SplayTree< Element > & | s ) |
| std::ostream & gum::operator<< | ( | std::ostream & | out, |
| const Tensor< GUM_SCALAR > & | array ) |
Definition at line 751 of file tensor_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | output, |
| const BayesNet< GUM_SCALAR > & | bn ) |
Prints map's DAG in output using the Graphviz-dot format.
Definition at line 536 of file BayesNet_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | output, |
| const IBayesNet< GUM_SCALAR > & | bn ) |
Prints map's DAG in output using the Graphviz-dot format.
Definition at line 316 of file IBayesNet_tpl.h.
References gum::IBayesNet< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | output, |
| const IMarkovRandomField< GUM_SCALAR > & | mn ) |
Prints map's graph in output using the Graphviz-dot format.
Definition at line 303 of file IMarkovRandomField_tpl.h.
References gum::IMarkovRandomField< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | output, |
| const MarkovRandomField< GUM_SCALAR > & | mn ) |
Definition at line 331 of file MarkovRandomField_tpl.h.
| std::ostream & gum::operator<< | ( | std::ostream & | s, |
| const ArcGraphPart & | a ) |
for friendly displaying the content of arc set
| s | the stream to which we display the content of a |
| a | the ArcGraphPart to be displayed |
Definition at line 198 of file arcGraphPart.cpp.
References gum::ArcGraphPart::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | s, |
| const MultiDimLogit< GUM_SCALAR > & | ag ) |
For friendly displaying the content of the array.
Definition at line 129 of file multiDimLogit_tpl.h.
References gum::MultiDimLogit< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | s, |
| const MultiDimNoisyAND< GUM_SCALAR > & | ag ) |
For friendly displaying the content of the array.
Definition at line 131 of file multiDimNoisyAND_tpl.h.
References gum::MultiDimNoisyAND< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | s, |
| const MultiDimNoisyORCompound< GUM_SCALAR > & | ag ) |
For friendly displaying the content of the array.
Definition at line 137 of file multiDimNoisyORCompound_tpl.h.
References gum::MultiDimNoisyORCompound< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | s, |
| const MultiDimNoisyORNet< GUM_SCALAR > & | ag ) |
For friendly displaying the content of the array.
Definition at line 132 of file multiDimNoisyORNet_tpl.h.
References gum::MultiDimNoisyORNet< GUM_SCALAR >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Arc & | arc ) |
to friendly display an arc
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const AVLTree< Val, Cmp > & | tree ) |
display the content of a tree
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const DiGraph & | g ) |
for friendly displaying the content of directed graphs
Definition at line 109 of file diGraph.cpp.
References gum::DiGraph::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Edge & | edge ) |
to friendly display an edge
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const List< Val > & | list ) |
an << operator for List
Definition at line 1966 of file list_tpl.h.
References gum::List< Val >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const MixedGraph & | g ) |
for friendly displaying the content of directed graphs
Definition at line 131 of file mixedGraph.cpp.
References gum::MixedGraph::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const MultiPriorityQueue< Val, Priority, Cmp > & | queue ) |
Definition at line 603 of file multiPriorityQueue_tpl.h.
References gum::MultiPriorityQueue< Val, Priority, Cmp >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const PAG & | g ) |
Definition at line 260 of file PAG.cpp.
References gum::PAG::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const Sequence< Key > & | s ) |
A << operator for displaying the content of the Sequence.
Definition at line 1068 of file sequence_tpl.h.
References gum::SequenceImplementation< Key, Gen >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const SequenceImplementation< Key, Gen > & | seq ) |
Definition at line 577 of file sequence_tpl.h.
References gum::SequenceImplementation< Key, Gen >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const SequenceImplementation< Key, true > & | seq ) |
Definition at line 931 of file sequence_tpl.h.
References gum::SequenceImplementation< Key, Gen >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const SortedPriorityQueue< Val, Priority, Cmp > & | queue ) |
display the content of a sorted priority queue
Definition at line 1080 of file sortedPriorityQueue_tpl.h.
References gum::SortedPriorityQueue< Val, Priority, Cmp >::toString().
| std::ostream & gum::operator<< | ( | std::ostream & | stream, |
| const UndiGraph & | g ) |
for friendly displaying the content of undirected graphs
Definition at line 141 of file undiGraph.cpp.
References gum::UndiGraph::toString().
| INLINE std::ostream & gum::operator<< | ( | std::ostream & | streamy, |
| const ActionSet & | objy ) |
Definition at line 115 of file actionSet_inl.h.
|
noexcept |
Checks whether two iterators are pointing toward equal elements.
| from | The gum::HashTableIteratorSafe to test for equality. |
Referenced by gum::List< Val >::operator!=(), gum::ListIterator< Val >::operator!=(), gum::ListIteratorSafe< Val >::operator!=(), gum::SequenceImplementation< Key, Gen >::operator!=(), and gum::SequenceIteratorSafe< Key >::operator!=().
| gum::SetInst & gum::operator>> | ( | gum::SetInst & | inst, |
| const gum::DiscreteVariable & | i ) |
| MultiDimImplementation< GUM_ELEMENT > * gum::partialInstantiation | ( | const MultiDimDecorator< GUM_ELEMENT > & | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
Instantiate variables in a MultiDimDecorator.
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
| MultiDimImplementation< GUM_ELEMENT > * gum::partialInstantiation | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
Instantiate variables in a MultiDimImplementation.
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
| void gum::partialInstantiation4MultiDimInit | ( | ) |
The function used to register all the instantiation operators on multidimImplementations over non-pointers types.
Definition at line 117 of file partialInstantiation4MultiDim_tpl.h.
References partialInstantiationMultiDimArray(), and registerPartialInstantiation().
Referenced by gum::PartialInstantiation4MultiDimInitialize< GUM_ELEMENT >::init().
| MultiDimArray< GUM_ELEMENT > * gum::partialInstantiationMultiDimArray | ( | const MultiDimArray< GUM_ELEMENT > * | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
A specialized function for instantiating variables in a multiDimArray.
The function instantiates some variables in a multiDimArray. For instance, if table is a MultiDimArray defined over A,B,C,D and if inst_vars = {<A=a1>,<C=c2>}, then the function returns a table over B,D defined as table (a1,B,c2,D).
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
Referenced by partialInstantiation4MultiDimInit().
| MultiDimImplementation< GUM_ELEMENT > * gum::partialInstantiationMultiDimArray | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
A specialized function for instantiating variables in a MultiDimImplementation.
The function instantiates some variables in a multiDimArray. For instance, if table is a MultiDimArray defined over A,B,C,D and if inst_vars = {<A=a1>,<C=c2>}, then the function returns a table over B,D defined as table (a1,B,c2,D).
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
| MultiDimArray< GUM_ELEMENT * > * gum::partialInstantiationMultiDimArray4Pointers | ( | const MultiDimArray< GUM_ELEMENT * > * | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
A specialized function for instantiating variables in a MultiDimArray.
The function instantiates some variables in a multiDimArray. For instance, if table is a MultiDimArray defined over A,B,C,D and if inst_vars = {<A=a1>,<C=c2>}, then the function returns a table over B,D defined as table (a1,B,c2,D).
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
Referenced by pointerPartialInstantiation4MultiDimInit().
| MultiDimImplementation< GUM_ELEMENT * > * gum::partialInstantiationMultiDimArray4Pointers | ( | const MultiDimImplementation< GUM_ELEMENT * > * | table, |
| const HashTable< const DiscreteVariable *, Idx > & | inst_vars ) |
A specialized function for instantiating variables in a MultiDimArray.
The function instantiates some variables in a multiDimArray. For instance, if table is a MultiDimArray defined over A,B,C,D and if inst_vars = {<A=a1>,<C=c2>}, then the function returns a table over B,D defined as table (a1,B,c2,D).
| table | The table to instantiate. |
| inst_vars | The variables instantiation. |
| void gum::pointerPartialInstantiation4MultiDimInit | ( | ) |
The function used to register all the instantiations on multidimImplementations over pointers types.
Definition at line 139 of file partialInstantiation4MultiDim_tpl.h.
References partialInstantiationMultiDimArray4Pointers(), and registerPartialInstantiation().
Referenced by gum::PartialInstantiation4MultiDimInitialize< GUM_ELEMENT * >::init().
| void gum::pointerProjections4MultiDimInit | ( | ) |
the function used to register all the projections on multidimImplementations over pointers types.
| void gum::print_output | ( | std::vector< FormulaPart > | v | ) |
Definition at line 71 of file formula.cpp.
| void gum::print_stack | ( | std::stack< FormulaPart > | s | ) |
Definition at line 55 of file formula.cpp.
| std::unique_ptr< ASTtree< GUM_SCALAR > > gum::productOfTrees | ( | std::vector< std::unique_ptr< ASTtree< GUM_SCALAR > > > && | lterms | ) |
Build a product AST from a list of terms.
Consumes the vector of unique_ptrs and returns a single AST representing their Elementwise product (e.g., left-associated chain of ASTmult nodes).
| lterms | list of term nodes (ownership transferred) |
Definition at line 633 of file doAST_tpl.h.
References GUM_ERROR.
Referenced by gum::DoCalculus< GUM_SCALAR >::getBackDoorTree().
|
extern |
| MultiDimArray< GUM_ELEMENT > * gum::ProjectFuncMultiDimArray | ( | const MultiDimArray< GUM_ELEMENT > * | t1, |
| const MultiDimArray< GUM_ELEMENT > * | t2, | ||
| const GUM_ELEMENT(* | f )(const GUM_ELEMENT &, const GUM_ELEMENT &) ) |
a specialized function for functionally projecting a multiDimArray
The function produces a tensorial functional combination of t1 and t2, that is, if t1 and t2 are multiDimArrays over variables A,B,C,D and D,B,E respectively, function combine2MultiDimArrays will return a multiDimArray T defined as T[A,B,C,D,E] = f ( t1[A,B,C,D],t2[D,B,E] ) for all A,B,C,D,E.
| void gum::projections4MultiDimInit | ( | ) |
the function used to register all the projection operators on multidimImplementations over non-pointers types.
| MultiDimImplementation< GUM_ELEMENT > * gum::projectMax | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| const gum::VariableSet & | del_vars ) |
The function to be used to project a MultiDimImplementation using a Max.
| GUM_ELEMENT gum::projectMax | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| Instantiation * | instantiation = 0 ) |
the function to be used to project a MultiDimImplementation using a Max
Referenced by gum::Tensor< GUM_SCALAR >::max(), gum::Tensor< GUM_SCALAR >::maxIn(), and gum::Tensor< GUM_SCALAR >::maxOut().
| MultiDimFunctionGraph< GUM_ELEMENT > * gum::projectMaxMultiDimFunctionGraph | ( | const MultiDimFunctionGraph< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a Max operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Max_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectMaxMultiDimFunctionGraph | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a Max operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Max_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectMin | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| const gum::VariableSet & | del_vars ) |
The function to be used to project a MultiDimImplementation using a Min.
| GUM_ELEMENT gum::projectMin | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| Instantiation * | instantiation = 0 ) |
the function to be used to project a MultiDimImplementation using a Min
Referenced by gum::Tensor< GUM_SCALAR >::minIn(), and gum::Tensor< GUM_SCALAR >::minOut().
| MultiDimArray< GUM_ELEMENT > * gum::projectMinMultiDimArray | ( | const MultiDimArray< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectMinMultiDimArray | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimArray< GUM_ELEMENT * > * gum::projectMinMultiDimArray4Pointers | ( | const MultiDimArray< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT * > * gum::projectMinMultiDimArray4Pointers | ( | const MultiDimImplementation< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimFunctionGraph< GUM_ELEMENT > * gum::projectMinMultiDimFunctionGraph | ( | const MultiDimFunctionGraph< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectMinMultiDimFunctionGraph | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a Min operator
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Min_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectProduct | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| const gum::VariableSet & | del_vars ) |
The function to be used to project a MultiDimImplementation using a Product.
| GUM_ELEMENT gum::projectProduct | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| Instantiation * | instantiation = 0 ) |
the function to be used to project a MultiDimImplementation using a Product
Referenced by gum::Tensor< GUM_SCALAR >::prodIn(), and gum::Tensor< GUM_SCALAR >::prodOut().
| MultiDimArray< GUM_ELEMENT > * gum::projectProductMultiDimArray | ( | const MultiDimArray< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectProductMultiDimArray | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimArray< GUM_ELEMENT * > * gum::projectProductMultiDimArray4Pointers | ( | const MultiDimArray< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT * > * gum::projectProductMultiDimArray4Pointers | ( | const MultiDimImplementation< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimFunctionGraph< GUM_ELEMENT > * gum::projectProductMultiDimFunctionGraph | ( | const MultiDimFunctionGraph< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectProductMultiDimFunctionGraph | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using products
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Prod_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectSum | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| const gum::VariableSet & | del_vars ) |
The function to be used to project a MultiDimImplementation using a Sum.
| GUM_ELEMENT gum::projectSum | ( | const MultiDimImplementation< GUM_ELEMENT > & | table, |
| Instantiation * | instantiation = 0 ) |
the function to be used to project a MultiDimImplementation using a sum
Referenced by gum::Tensor< GUM_SCALAR >::sum(), and gum::Tensor< GUM_SCALAR >::sumIn().
| MultiDimArray< GUM_ELEMENT > * gum::projectSumMultiDimArray | ( | const MultiDimArray< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectSumMultiDimArray | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
| MultiDimArray< GUM_ELEMENT * > * gum::projectSumMultiDimArray4Pointers | ( | const MultiDimArray< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT * > * gum::projectSumMultiDimArray4Pointers | ( | const MultiDimImplementation< GUM_ELEMENT * > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimArray using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimArray defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
| MultiDimFunctionGraph< GUM_ELEMENT > * gum::projectSumMultiDimFunctionGraph | ( | const MultiDimFunctionGraph< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
| MultiDimImplementation< GUM_ELEMENT > * gum::projectSumMultiDimFunctionGraph | ( | const MultiDimImplementation< GUM_ELEMENT > * | table, |
| const gum::VariableSet & | del_vars ) |
a specialized function for projecting a multiDimFunctionGraph using a summation
The function projects a table over the subset of its variables NOT IN the set of variables del_vars. For instance, if table is a MultiDimFunctionGraph defined over A,B,C,D and if del_vars = {A,C}, then the function returns a table over B,D defined as Sum_{A,C} table (A,B,C,D).
Definition at line 83 of file utils_random_tpl.h.
| bool gum::rec_hasMixedReallyOrientedPath | ( | const PDAG & | gr, |
| NodeSet & | marked, | ||
| NodeId | node, | ||
| NodeId | goal, | ||
| bool | alreadyOriented ) |
Definition at line 90 of file PDAG.cpp.
References gum::ArcGraphPart::children(), gum::Set< Key >::contains(), gum::Set< Key >::insert(), gum::EdgeGraphPart::neighbours(), and rec_hasMixedReallyOrientedPath().
Referenced by gum::PDAG::hasMixedReallyOrientedPath(), and rec_hasMixedReallyOrientedPath().
| void gum::registerOperator | ( | std::string_view | operation_name, |
| std::string_view | type1, | ||
| std::string_view | type2, | ||
| typename OperatorRegister4MultiDim< GUM_ELEMENT >::OperatorPtr | function ) |
A function to more easily register new operators in MultiDims.
| void gum::registerPartialInstantiation | ( | std::string_view | instantiation_func_name, |
| std::string_view | type_multidim, | ||
| typename PartialInstantiationRegister4MultiDim< GUM_ELEMENT >::PartialInstantiationPtr | function ) |
A function to more easily register new instantiation functions in MultiDims.
Referenced by partialInstantiation4MultiDimInit(), and pointerPartialInstantiation4MultiDimInit().
| void gum::registerProjection | ( | std::string_view | projection_name, |
| std::string_view | type_multidim, | ||
| typename ProjectionRegister4MultiDim< GUM_ELEMENT >::ProjectionPtr | function ) |
A function to more easily register new projection functions in MultiDims.
|
static |
Definition at line 664 of file splay_tpl.h.
References gum::SplayBinaryNode< Element >::getElement(), gum::SplayBinaryNode< Element >::getFd(), gum::SplayBinaryNode< Element >::getFg(), and removeInfo().
Referenced by removeInfo(), gum::SplayTree< Element >::split(), and gum::SplayTree< Element >::split_by_val().
|
inline |
|
static |
|
static |
|
static |
|
static |
| INLINE std::string gum::to_string | ( | const Formula & | f | ) |
Definition at line 262 of file formula_inl.h.
References gum::Formula::result().
Referenced by gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), gum::Formula::Formula(), and gum::Formula::Formula().
|
static |
|
static |
| const double gum::MultiDimFunctionGraph< double >::defaultValue = 0.0 |
Definition at line 70 of file multiDimFunctionGraph.cpp.
| const float gum::MultiDimFunctionGraph< float >::defaultValue = 0.0f |
Definition at line 67 of file multiDimFunctionGraph.cpp.
| const double gum::VariableLog2ParamComplexityCTable |
Definition at line 246 of file variableLog2ParamComplexity.cpp.
Referenced by gum::VariableLog2ParamComplexity::log2Cnr().
|
constexpr |
Definition at line 73 of file variableLog2ParamComplexity.h.
Referenced by gum::VariableLog2ParamComplexity::CnrToFile(), and gum::VariableLog2ParamComplexity::log2Cnr().
|
constexpr |
Definition at line 70 of file variableLog2ParamComplexity.h.
Referenced by gum::VariableLog2ParamComplexity::log2Cnr().