  fiber::_LValue< Scalar, LView< Scalar, Exp, rows_, cols_ > > | |
  fiber::LView< Scalar, Exp, rows_, cols_ > | Expression template for subset of a matrix expression |
| fiber::_LValue< Scalar, Matrix< Scalar, Rows, Cols > > | |
 fiber::Matrix< Scalar, Rows, Cols > | |
 fiber::Matrix< Scalar, 3, 1 > | |
 fiber::euler::Angles< Scalar, Axis1, Axis2, Axis3 > | A vector of euler angles |
| fiber::_RValue< Scalar, _CrossMatrix< Scalar, Exp > > | |
| fiber::_CrossMatrix< Scalar, Exp > | Cross-product matrix of a vector |
| fiber::_RValue< Scalar, _Difference< Scalar, Exp1, Exp2 > > | |
| fiber::_Difference< Scalar, Exp1, Exp2 > | Expression template for difference of two matrix expressions |
| fiber::_RValue< Scalar, _Normalize< Scalar, Exp > > | |
| fiber::_Normalize< Scalar, Exp > | Expression template presents a view of a matrix where each element is normalized, such that the sum of the elements is 1.0 |
| fiber::_RValue< Scalar, _RView< Scalar, Exp, rows_, cols_ > > | |
| fiber::_RView< Scalar, Exp, rows_, cols_ > | Expression template for subset of a matrix expression |
| fiber::_RValue< Scalar, _Scale< Scalar, Exp > > | |
| fiber::_Scale< Scalar, Exp > | |
| fiber::_RValue< Scalar, _Sum< Scalar, Exp1, Exp2 > > | |
| fiber::_Sum< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| fiber::_RValue< Scalar, _Transpose< Scalar, Exp > > | |
| fiber::_Transpose< Scalar, Exp > | Expression template for difference of two matrix expressions |
| fiber::_RValue< Scalar, CoordinateAxis< Scalar, Axis > > | |
| fiber::CoordinateAxis< Scalar, Axis > | A 3x1 normal vector with one unity element |
| fiber::_RValue< Scalar, Eye< Scalar, N > > | |
| fiber::Eye< Scalar, N > | A N x N matrix expression for the identity matrix |
| fiber::_RValue< Scalar, Matrix< Scalar, Rows, Cols > > | |
| fiber::Matrix< Scalar, Rows, Cols > | |
| fiber::Matrix< Scalar, 3, 1 > | |
| fiber::_RValue< Scalar, Quaternion< Scalar > > | |
| fiber::Quaternion< Scalar > | |
| mpblocks::cuda::linalg2::Assignment< Scalar, ROWS, COLS, i+1, 0, Exp1, Exp2 > | |
| mpblocks::cuda::linalg2::Assignment< Scalar, ROWS, COLS, i, COLS, Exp1, Exp2 > | Specialization for past-end-of row, acts like the next row |
| mpblocks::btps::BasicNode< ExampleTraits > | |
| mpblocks::btps::ExampleTraits::Node | This type is not required by the interface, but if you just need a simple node type then this one will do it for you |
| mpblocks::cuda::polynomial::Coefficient< Scalar, SpecHead > | |
| mpblocks::cuda::polynomial::Storage< Scalar, IntList< SpecHead, SpecTail > > | |
| mpblocks::cuda::polynomial::Coefficient< Scalar, SpecTail > | |
| mpblocks::cuda::polynomial::Storage< Scalar, IntList< SpecTail, intlist::Terminal > > | |
| cudaDeviceProp | |
| mpblocks::cuda::DeviceProp | |
| cudaFuncAttributes | |
| mpblocks::cuda::FuncAttributes | |
| Dim3 | |
| mpblocks::dubins::kd_tree::Distance< Scalar > | |
| edelsbrunner96::BreadthFirst< Traits > | |
| edelsbrunner96::ExampleTraits | Example of a traits class suitable for instantiation an edelsbrunner triangulation object |
| edelsbrunner96::ExampleTraits::Storage | Storage abstraction for simplices and points |
| edelsbrunner96::ExhaustiveSimplexDistance< Traits > | Computes the distance of a point to a simplex by expanding all combinations of vertices and evaluating the distance to the lower-dimensional simplex feature represented by that combination of vertices |
| edelsbrunner96::Facet< Traits > | A facet is a (d-1)-dimensional simplex |
| edelsbrunner96::InducedSubcomplex< Traits > | The induced subcomplex of a facet between two simplices is the set of all simplices in the triangulation whose vertices are composed of those from the two simplices in question |
| edelsbrunner96::InducedSubcomplex< Traits >::BreadthFirstNode | We do a breadthfirst search for simplices in the induced subcomplex. This data structure is what we queue in the search |
| edelsbrunner96::iter::BreadthFirst< Traits > | |
| edelsbrunner96::SimplexBase< Traits > | A simplex in the triangulation. A simplex is the convex hull of Ndim+1 points in R^NDim |
| edelsbrunner96::SimplexFill< Traits > | A convenience for setting vertices of a simplex |
| fcgi::Request | An FCGI request object |
| fcgi::Socket | An fcgi socket connection |
| FcMatrix | |
| fontconfig::Matrix | Wraps FcMatrix with it's member methods |
| fd_set | |
| nix::FdSet | Fd_set with array accessors |
| fiber::_LValue< Scalar, Exp > | Expression template for rvalues |
| fiber::_RValue< Scalar, Exp > | Expression template for rvalues |
| fiber::AxisAngle< Scalar > | Encodes a rotation in 3-dimensions by an return RView<Scalar, Exp, rows, Exp::COLS>(static_cast<Exp const&>(A), i, 0);axis of rotation and an angle magnitude of rotation about that axis |
| fiber::CoordinateAxisAngle< Scalar, Axis > | An axis angle rotation about a coordinate axis |
| fiber::euler::_AnglesFromQuaternion< Scalar, Axis1, Axis2, Axis3 > | Construction euler angles from quaternion, only certain sequences can be constructed this way |
| fiber::euler::_AnglesFromQuaternion< Scalar, _1, _2, _1 > | |
| fiber::euler::_AnglesFromQuaternion< Scalar, _1, _2, _3 > | |
| fiber::euler::_AnglesFromQuaternion< Scalar, _3, _1, _3 > | |
| fiber::euler::_AnglesFromQuaternion< Scalar, _3, _2, _1 > | |
| fiber::StreamAssignment< Mat > | Assignment |
| fontconfig::Atomic | Traits class for FcAtomic wrapper Used for locking access to configuration files. Provides a safe way to update configuration files |
| fontconfig::AtomicDelegate | Used for locking access to configuration files. Provides a safe way to update configuration files |
| fontconfig::Blanks | Traits class for FcBlanks. holds a list of Unicode chars which are expected to be blank |
| fontconfig::BlanksDelegate | Holds a list of Unicode chars which are expected to be blank |
| fontconfig::Cache | Traits class for FcCache Holds information about the fonts contained in a single directory |
| fontconfig::CacheDelegate | Holds information about the fonts contained in a single directory |
| fontconfig::CharSet | Traits class for a charset. An CharSet is an abstract type that holds the set of encoded Unicode chars in a font. Operations to build and compare these sets are provided |
| fontconfig::CharSetDelegate | An CharSet is an abstract type that holds the set of encoded Unicode chars in a font. Operations to build and compare these sets are provided |
| fontconfig::Config | |
| fontconfig::ConfigDelegate | Holds a complete configuration of the library; |
| fontconfig::Constant | |
| fontconfig::ConstantDelegate | |
| fontconfig::ConstantList | Utility class for building a static list of ObjectTypes, replaces static allocation of a list of FcObjectType objects |
| fontconfig::ConstantList::BuildToken | |
| fontconfig::ConstantList::Item | |
| fontconfig::ConstCPtr< Traits > | Acts like a const c-pointer by overloading the ->() operator, but is not copyable and doesn't allow the underlying c-pointer to be copied |
| fontconfig::CPtr< Traits > | Acts like a c-pointer by overloading the ->() operator, but is not copyable and doesn't allow the underlying c-pointer to be copied |
| fontconfig::FontSet | An FcFontSet simply holds a list of patterns; these are used to return the results of listing available fonts |
| fontconfig::FontSetDelegate | An FcFontSet simply holds a list of patterns; these are used to return the results of listing available fonts |
| fontconfig::LangSet | |
| fontconfig::LangSetDelegate | An LangSet is an abstract type that holds the set of languages supported by a font |
| fontconfig::LValuePair< T1, T2 > | Allows an error to be returned with a result in a single expression |
| fontconfig::ObjectSet | |
| fontconfig::ObjectSet::Builder | |
| fontconfig::ObjectSetDelegate | Holds a set of names and is used to specify which fields from fonts are placed in the the list of returned patterns when listing fonts |
| fontconfig::ObjectType | |
| fontconfig::ObjectTypeDelegate | Wraps FcObjectType |
| fontconfig::ObjectTypeList | Utility class for building a static list of ObjectTypes, replaces static allocation of a list of FcObjectType objects |
| fontconfig::ObjectTypeList::BuildToken | |
| fontconfig::ObjectTypeList::Item | |
| fontconfig::Pattern | Traits class for FcPattern holds a set of names with associated value lists; |
| fontconfig::Pattern::Builder | Utility for building patterns using interface similar to variable argument list |
| fontconfig::PatternDelegate | Holds a set of names with associated value lists; |
| fontconfig::RefPtr< Traits > | Object which acts like a c-pointer, but when dereferenced returns a delegate object which adds methods to the pointer |
| fontconfig::RValuePair< T1, T2 > | Allows an error to be returned with a result in a single expression |
| fontconfig::String< Ptr_t > | |
| fontconfig::StringOther< Ptr_t > | |
| fontconfig::StringOther< Char8_t * > | |
| fontconfig::StringOther< const Char8_t * > | |
| fontconfig::StrList | |
| fontconfig::StrListDelegate | Used during enumeration to safely and correctly walk the list of strings even while that list is edited in the middle of enumeration |
| fontconfig::StrSet | |
| fontconfig::StrSetDelegate | Holds a list of strings that can be appended to and enumerated |
| fontconfig::TypeMap< key > | Ensures typesafety of pattern add,get by mapping property keys to their type in a compile-time queriable map |
| freetype::ConstCPtr< Traits > | Acts like a const c-pointer by overloading the ->() operator, but is not copyable and doesn't allow the underlying c-pointer to be copied |
| freetype::ContourReference | |
| freetype::ContourIterator | |
| freetype::CPtr< Traits > | Acts like a c-pointer by overloading the ->() operator, but is not copyable and doesn't allow the underlying c-pointer to be copied |
| freetype::EncTag< x1, x2, x3, x4 > | Template used to replace the FT_ENC_TAG macro: converts four-letter tags into an unsigned long type |
| freetype::Face | Traits class for a Face, a Freetype face instance. A face object models a given typeface, in a given style |
| freetype::FaceDelegate | C++ interface on top of c-object pointer |
| freetype::GlyphSlot | Traits class for a GlyphSlot, a face's storage location for storing a glyph image |
| freetype::GlyphSlotDelegate | |
| freetype::ImageTag< x1, x2, x3, x4 > | Template used to replace the FT_IMAGE_TAG macro: converts four-letter tags into an unsigned long type |
| freetype::Library | Traits class for Library, a FreeType library instance |
| freetype::LibraryDelegate | C++ interface on top of c-object pointer |
| freetype::load_target::LoadTarget< x > | |
| freetype::LValuePair< T1, T2 > | Allows an error to be returned with a result in a single expression |
| freetype::Memory | A handle to a given memory manager object, defined with an FT_MemoryRec structure |
| freetype::Module | |
| freetype::ModuleClass | |
| freetype::OpenArgs | A structure used to indicate how to open a new font file or stream. A pointer to such a structure can be used as a parameter for the functions Open_Face_t& and Attach_Stream_t& |
| freetype::Outline | |
| freetype::OutlineDelegate | |
| freetype::PointReference | |
| freetype::PointIterator | |
| freetype::RefPtr< T > | Pointer to a reference counted object, auto destruct when reference count is zero |
| freetype::RValuePair< T1, T2 > | Allows an error to be returned with a result in a single expression |
| freetype::Untag | |
| DrawingArea | |
| mpblocks::gtk::PanZoomView | A drawing area with built in mouse handlers for pan-zoom control |
| mpblocks::gtk::SimpleView | Very simple drawing area which just rescales the area to (0,0),(1,1) and emits the context via a signal so that things can draw themselves |
| Head | |
| kw::ParamPack< Head, Tail...> | Specialization for recursion, provides storage for the current type in the type list, then recursively derives from the remaining types in the type list |
| mpblocks::dubins::curves_eigen::hyper::HyperRect< Format > | |
| mpblocks::dubins::kd_tree::Traits< Format >::HyperRect | |
| kw::Arg< Tag, T > | Parameter storage for type T within a parameter pack |
| kw::CanConvertTo< SourceType, TargetType > | |
| kw::CanConvertTo< SourceType, TargetType >::No | |
| kw::CanConvertTo< SourceType, TargetType >::Yes | |
| kw::ConstRefWrap< T > | Signifies the parameter should be passed by const reference |
| kw::ContainsTag< Tag, Args > | Template meta-function contains a static boolean variable 'result' which is true if Tag is in the list of kwargs and false if not |
| kw::ContainsTag< Tag > | Specialization for when Tag is not in the type list |
| kw::ContainsTag< Tag, Arg< Tag, T >, Rest...> | Specialization for when the Arg<Tag,T> type is found |
| kw::ContainsTag< Tag, First, Rest...> | Specialization for recursion |
| kw::details::clone_constness< src_type, dest_type > | Template meta function, copy's "const" from src_type to dest_type |
| kw::details::clone_constness< const src_type, dest_type > | Template meta function, copy's "const" from src_type to dest_type. Specialization for when src_type is const |
| kw::details::void_exp_result< type > | |
| kw::GetImpl< Tag, exists, Default, Args > | Static member Get() with implementations depending on whether or not Tag is in Args.. |
| kw::GetImpl< Tag, false, Default, Args...> | Specialization for when Tag is not in Args..., returns the default value |
| kw::GetImpl< Tag, true, Default, Args...> | Specialization for when Tag is in Args... returns the value corresponding to Tag |
| kw::has_member< Type > | Template metafunction, ::result evaluates to true if Type has a function call operator member |
| kw::has_member< Type >::DummyFnCallOperator | Very simply, a class which has a function call operator |
| kw::has_member< Type >::HasAtLeastOneFnCallOperator | This class derives from both the argument of the meta function, and a class which we know has a function call operator |
| kw::has_member< Type >::Helper< T, t > | This template only exists for a pair of template parameters where the type of the second parameter is equivalent to the first parameter |
| kw::has_member< Type >::no | |
| kw::has_member< Type >::yes | |
| kw::is_call_possible< type, call_details > | |
| kw::is_call_possible< type, call_details >::Dispatcher< Mid, Tail > | |
| kw::is_call_possible< type, call_details >::Dispatcher< Tail > | |
| kw::is_call_possible< type, call_details >::impl< HasFnCallOperator, F > | Default template, HasFnCallOperator is false so obviously no function call is possible |
| kw::is_call_possible< type, call_details >::impl< true, r(args...)> | |
| kw::is_call_possible< type, call_details >::no | |
| kw::is_call_possible< type, call_details >::return_value_check< T, DesiredReturnType > | Provides a member function deduce() which accepts any parameters and whose return type is always no except for when the single parameter matches DesiredReturnType |
| kw::is_call_possible< type, call_details >::return_value_check< T, void > | If the desired return type is void, then we will ignore the return value of the function call anyway, so it doesn't matter what the return value is... Any return value will be compatable |
| kw::is_call_possible< type, call_details >::yes | |
| kw::Key< Tag > | Assignment operator sentinal used as a key for key-values pairs in the kwargs parameter pack |
| kw::ParamPack< Args > | Storage for kwargs parameter pack |
| kw::RefWrap< T > | Signifies that the parameter should be passed by reference |
| kw::Tag | Constexpr string, used to implement tagging with strings |
| kw::TypeOfTagDefault< Tag, Default, Args > | Template meta function provides a member typedef Result which evaluates to T if Arg<Tag,T> is in Args... or Default if it is not |
| kw::TypeOfTagDefault< Tag, Default > | Specialization for when Arg<Tag,T> is not in the type list |
| kw::TypeOfTagDefault< Tag, Default, Arg< Tag, T >, Tail...> | Specialization for when Arg<Tag,T> is found |
| kw::TypeOfTagDefault< Tag, Default, Head, Tail...> | Specialization for recursion |
| mpblocks::cuda::linalg2::LValue< Format_t, ROWS, COLS, Matrix< Format_t, ROWS, COLS > > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 2, 1 > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 3, 1 > | |
| mpblocks::cuda::linalg::LValue< Scalar, LView< Scalar, Exp > > | |
| mpblocks::cuda::linalg::LView< Scalar, Exp > | Expression template for subset of a matrix expression |
| mpblocks::cuda::linalg::LValue< Scalar, Matrix< Scalar, ROWS, COLS > > | |
| mpblocks::cuda::linalg::Matrix< Scalar, ROWS, COLS > | |
| mpblocks::polynomial::LValue< Scalar, Polynomial< Scalar, Degree > > | |
| mpblocks::polynomial::Polynomial< Scalar, Degree > | A dense, statically sized polynomial |
| mpblocks::polynomial::LValue< Scalar, Polynomial< Scalar, Dynamic > > | |
| mpblocks::polynomial::Polynomial< Scalar, Dynamic > | A dense, dynamically sized polynomial |
| mpblocks::cuda::polynomial::LValue< Scalar, Polynomial< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range > > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range > | |
| mpblocks::cuda::polynomial::LValue< Scalar, Polynomial< Scalar, Spec > > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, Spec > | A sparse, statically sized polynomial |
| mpblocks::cuda::polynomial::LValue< Scalar, Polynomial< Scalar, typename intlist::range< 0, size >::result > > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, typename intlist::range< 0, size >::result > | |
| mpblocks::cuda::linalg2::LValue< Scalar, ROWS, COLS, Matrix< Scalar, ROWS, COLS > > | |
| mpblocks::cuda::linalg2::Matrix< Scalar, ROWS, COLS > | |
| mpblocks::cuda::linalg2::MatrixElement< Format_t, ROWS, COLS, 0, 0 > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 2, 1 > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 3, 1 > | |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, 0, 0 > | |
| mpblocks::cuda::linalg2::Matrix< Scalar, ROWS, COLS > | |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i+1, 0 > | |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i, 0 > | Specialization for 0'th column, also inherits row |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i, 1 > | |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i, 0 > | Specialization for 0'th column, also inherits row |
| mpblocks::brown79::Inversion< Traits > | Represents the inversion operator described in Brown |
| mpblocks::btps::BasicNode< Traits > | A node in a btps tree |
| mpblocks::btps::ExampleTraits | Example traits structure from which a balanced tree of partial sums may be instantiated |
| mpblocks::btps::ExampleTraits::NodeOps | Callable type which implements the primitives required to access fields of a node |
| mpblocks::btps::Tree< Traits > | Implements a binary tree of partial sums for sampling from discrete distributions with arbitrary weight |
| mpblocks::clarkson93::BitMemberBase | Dummy class which allows us to use SNFINAE |
| mpblocks::clarkson93::BitMember< SimplexBits, simplex::NUM_BITS > | |
| mpblocks::clarkson93::dynamic::SimplexBase< Traits > | A simplex is the convex hull of d+1 points in general position (IGP), i.e. they do not lie on the same hyperplane |
| mpblocks::clarkson93::dynamic::DefaultSimplex< Traits > | Default simplex structure which contains no additional functionality |
| mpblocks::clarkson93::SimplexBase< Traits > | Encapsulates a vertex, simplex pair where the simplex is the neighbor across from the specified vertex |
| mpblocks::clarkson93::DefaultSimplex< Traits > | Default simplex structure which contains no additional functionality |
| mpblocks::clarkson93::SimplexBase< ExampleTraits > | |
| mpblocks::clarkson93::ExampleTraits::Simplex | The derived type to use for simplices |
| mpblocks::clarkson93::BitMember< Enum, Size > | Indicates membership into a number of sets by a bitfield |
| mpblocks::clarkson93::dynamic::Triangulation< Traits > | Misleadingly-named data structure, is actually a "simplexification", the dimension agnostic analog of a triangulation |
| mpblocks::clarkson93::ExampleTraits | Documents the interface for Traits : encapsulates various policies for the Triangulation |
| mpblocks::clarkson93::ExampleTraits2< SCALAR, NDIM > | Documents the interface for Traits : encapsulates various policies for the Triangulation |
| mpblocks::clarkson93::ExampleTraits2< SCALAR, NDIM >::Callback | Triangulation provides some static callbacks for when hull faces are added or removed. If we wish to do anything special this is where we can hook into them. If you do not wish to hook into the callbacks then simply create an empty structure which has empty implementation for these |
| mpblocks::clarkson93::ExampleTraits2< SCALAR, NDIM >::Deref | Proves a means of turning a PointRef into a Point& |
| mpblocks::clarkson93::ExampleTraits::Callback | Triangulation provides some static callbacks for when hull faces are added or removed. If we wish to do anything special this is where we can hook into them. If you do not wish to hook into the callbacks then simply create an empty structure which has empty implementation for these |
| mpblocks::clarkson93::ExampleTraits::PointDeref | Proves a means of turning a PointRef into a Point& |
| mpblocks::clarkson93::HorizonRidge< Traits > | A horizon ridge is a d-2 dimensional facet (i.e. a facet of a facet), |
| mpblocks::clarkson93::Indexed< Index_t, Value_t > | Priority queue node |
| mpblocks::clarkson93::Indexed< Index_t, Value_t >::Greater | |
| mpblocks::clarkson93::Indexed< Index_t, Value_t >::Less | |
| mpblocks::clarkson93::NeighborIterator< Traits > | Interator over neighbors in a simplex |
| mpblocks::clarkson93::NeighborRange< Traits > | Iterator range for neighbors of a simplex |
| mpblocks::clarkson93::OptDefined< T > | Template meta function evaluating whether or not a traits class specifies an optimization level |
| mpblocks::clarkson93::OptLevel< int > | Simply maps a complile-time integer to a type |
| mpblocks::clarkson93::OptLevelGet< T, Defined > | Template meta function evaluating the optimization level as specified by the traits class |
| mpblocks::clarkson93::OptLevelGet< T, false > | |
| mpblocks::clarkson93::Simplex2< Traits > | A simplex is the convex hull of d+1 points in general position (IGP), i.e. they do not lie on the same hyperplane |
| mpblocks::clarkson93::SimplexOps< Traits > | Implements simplex operations for simplex references, using other references can be easily extended by building on top of this class |
| mpblocks::clarkson93::Surrogate< T > | Surrogate for a certain value used in setters |
| mpblocks::clarkson93::VertexIterator< Traits > | Interator over vertices in a simplex |
| mpblocks::clarkson93::VertexRange< Traits > | Iterator range for vertices of a simplex |
| mpblocks::clarkson93::WithoutSet | |
| mpblocks::cuda::bitonic::Sorter< KeyType, ValueType > | A utility class for calculating properties of the bitonic sort kernels |
| mpblocks::cuda::bitonic::Sorter< KeyType, void > | Partial specialization for key-only sort |
| mpblocks::cuda::linalg2::Assignment< Scalar, ROWS, COLS, i, j, Exp1, Exp2 > | Copies elements one by one |
| mpblocks::cuda::linalg2::Assignment2< Scalar, ROWS, COLS, i, j, Exp1, Exp2 > | |
| mpblocks::cuda::linalg2::Assignment2< Scalar, ROWS, COLS, i, COLS, Exp1, Exp2 > | Specialization for past-end-of row, acts like the next row |
| mpblocks::cuda::linalg2::Assignment2< Scalar, ROWS, COLS, ROWS, 0, Exp1, Exp2 > | Specialization for past-end-of array |
| mpblocks::cuda::linalg2::Assignment< Scalar, ROWS, COLS, ROWS, 0, Exp1, Exp2 > | Specialization for past-end-of array |
| mpblocks::cuda::linalg2::AssignmentIterator< Scalar, ROWS, COLS, i, j, Exp > | Iterates over elements |
| mpblocks::cuda::linalg2::AssignmentIterator< Scalar, ROWS, COLS, i, COLS, Exp > | Specialization for past-end-of row, acts like the next row |
| mpblocks::cuda::linalg2::dot_private::Iterator< Scalar, ROWS, i, ExpA, ExpB > | Returns the square of the ith element plus the result of the next iterator |
| mpblocks::cuda::linalg2::dot_private::Iterator< Scalar, ROWS, ROWS, ExpA, ExpB > | Specialization for past the end iterator intermediate rows returns the result from the next row, 0th column |
| mpblocks::cuda::linalg2::LValue< Scalar, ROWS, COLS, Exp > | Expression template for rvalues |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i, j > | Default template has column inheritence |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, i, COLS > | Empty class for last column |
| mpblocks::cuda::linalg2::MatrixElement< Scalar, ROWS, COLS, ROWS, 0 > | Empty class for last row |
| mpblocks::cuda::linalg2::norm_private::Iterator< Scalar, ROWS, COLS, i, j, Exp > | Returns the square of the (i,j)th element plus the result of the next iterator |
| mpblocks::cuda::linalg2::norm_private::Iterator< Scalar, ROWS, 1, i, 0, Exp > | Returns the square of the ith element plus the result of the next iterator |
| mpblocks::cuda::linalg2::norm_private::Iterator< Scalar, ROWS, 1, ROWS, 0, Exp > | Specialization for past the end iterator intermediate rows returns the result from the next row, 0th column |
| mpblocks::cuda::linalg2::norm_private::Iterator< Scalar, ROWS, COLS, i, COLS, Exp > | Specialization for past the end iterator intermediate rows returns the result from the next row, 0th column |
| mpblocks::cuda::linalg2::norm_private::Iterator< Scalar, ROWS, COLS, ROWS, COLS, Exp > | Specialization for past the end iterator for the last row |
| mpblocks::cuda::linalg2::ostream::OutputIterator< Scalar > | |
| mpblocks::cuda::linalg2::ostream::ElementIterator< Scalar, ROWS, COLS, i, j, Exp > | Iterates over elements |
| mpblocks::cuda::linalg2::ostream::ElementIterator< Scalar, ROWS, COLS, i, COLS, Exp > | Specialization for last element in a row |
| mpblocks::cuda::linalg2::ostream::ElementIterator< Scalar, ROWS, COLS, ROWS, 0, Exp > | Specialization for one past the end of the array |
| mpblocks::cuda::linalg2::product::Iterator< Scalar, ROWS, COLS, COMMON, i, j, k, Exp1, Exp2 > | Returns the result of the i,j element of the product |
| mpblocks::cuda::linalg2::product::Iterator< Scalar, ROWS, COLS, COMMON, i, j, COMMON, Exp1, Exp2 > | Specialization for past the end iterator |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Exp > | Expression template for rvalues |
| mpblocks::cuda::linalg::LValue< Scalar, Mat > | Expression template for rvalues |
| mpblocks::cuda::linalg::RValue< Scalar, Mat > | Expression template for rvalues |
| mpblocks::cuda::linalg::Product< Scalar, Exp1, Exp2 > | Expression template for product of two matrix expressions |
| mpblocks::cuda::linalg::StreamAssignment< Mat > | Assignment |
| mpblocks::cuda::polynomial::Assign< Enable, Scalar, Spec, Exp, idx > | |
| mpblocks::cuda::polynomial::Assign< true, Scalar, Spec, Exp, idx > | |
| mpblocks::cuda::polynomial::AssignmentHelper< Scalar, Exp1, Exp2, Spec > | |
| mpblocks::cuda::polynomial::AssignmentHelper< Scalar, Exp1, Exp2, IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::AssignmentHelper< Scalar, Exp1, Exp2, IntList< Tail, intlist::Terminal > > | |
| mpblocks::cuda::polynomial::Coefficient< Scalar, Idx > | Class actually providing storage for a coefficient |
| mpblocks::cuda::polynomial::CoefficientKey< idx > | |
| mpblocks::cuda::polynomial::CountZeros< size > | |
| mpblocks::cuda::polynomial::CountZeros< 1 > | |
| mpblocks::cuda::polynomial::CountZeros< 2 > | |
| mpblocks::cuda::polynomial::CountZeros< 3 > | |
| mpblocks::cuda::polynomial::CountZeros< 4 > | |
| mpblocks::cuda::polynomial::CountZeros< 5 > | |
| mpblocks::cuda::polynomial::derivative_detail::DerivativeSpec< Enable, Spec > | |
| mpblocks::cuda::polynomial::derivative_detail::DerivativeSpec< true, IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::derivative_detail::Index< Spec > | |
| mpblocks::cuda::polynomial::derivative_detail::Index< IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::derivative_detail::InitHelper< n, Exp1, Exp2, Spec > | |
| mpblocks::cuda::polynomial::derivative_detail::InitHelper< n, Exp1, Exp2, IntList< Head, intlist::Terminal > > | |
| mpblocks::cuda::polynomial::derivative_detail::InitHelper< n, Exp1, Exp2, IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::derivative_detail::Looper1< n, size1, Exp2, Spec2, i > | |
| mpblocks::cuda::polynomial::derivative_detail::Looper1< n, size1, Exp2, Spec2, size1 > | |
| mpblocks::cuda::polynomial::derivative_detail::Looper2< Exp, Spec, j, i, size2 > | |
| mpblocks::cuda::polynomial::derivative_detail::Looper2< Exp, Spec, i, i, size2 > | Loop termination, j == i |
| mpblocks::cuda::polynomial::derivative_detail::Looper2< Exp, Spec, size2, i, size2 > | Loop termination: j = out.size() |
| mpblocks::cuda::polynomial::derivative_detail::Looper2< Exp, Spec, size2, size2, size2 > | Loop termination: j = out.size() |
| mpblocks::cuda::polynomial::derivative_detail::SetHelper< B, Exp, j, i > | |
| mpblocks::cuda::polynomial::derivative_detail::SetHelper< true, Exp, j, i > | |
| mpblocks::cuda::polynomial::DerivativeSpec< Spec, n > | |
| mpblocks::cuda::polynomial::DerivativeSpec< IntList< Head, intlist::Terminal >, n > | |
| mpblocks::cuda::polynomial::DerivativeSpec< IntList< Head, Tail >, n > | |
| mpblocks::cuda::polynomial::DerivativeSurrogate< n, Scalar, Exp, Spec > | Intermediate object which allows LValue assignment operator to call differntiate expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::Divide< Enabled, i, Scalar, NumExp, NumSpec, DenExp, DenSpec > | Specialization for the first step uses actual numerator, not remainder |
| mpblocks::cuda::polynomial::Divide< true, 0, Scalar, NumExp, NumSpec, DenExp, DenSpec > | Specialization for the first step uses actual numerator, not remainder |
| mpblocks::cuda::polynomial::Divide< true, i, Scalar, NumExp, NumSpec, DenExp, DenSpec > | |
| mpblocks::cuda::polynomial::get_spec< Exp > | |
| mpblocks::cuda::polynomial::get_spec< Derivative< Scalar, Exp, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< Difference< Scalar, Exp1, Spec1, Exp2, Spec2 > > | |
| mpblocks::cuda::polynomial::get_spec< Negative< Scalar, Exp, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< Normalized< Scalar, Exp, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< Polynomial< Scalar, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< Product< Scalar, Exp1, Spec1, Exp2, Spec2 > > | |
| mpblocks::cuda::polynomial::get_spec< ScalarProduct< Scalar, Exp, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< ScalarSum< Scalar, Exp, Spec > > | |
| mpblocks::cuda::polynomial::get_spec< Sum< Scalar, Exp1, Spec1, Exp2, Spec2 > > | |
| mpblocks::cuda::polynomial::GetHelper< HasCoefficient, idx, Scalar, Spec > | |
| mpblocks::cuda::polynomial::GetHelper< true, idx, Scalar, Spec > | |
| mpblocks::cuda::polynomial::IntList< Head, Tail > | Compile time integer list (because cuda doesn't understand variadic templates ) |
| mpblocks::cuda::polynomial::intlist::allpairs_sum< IntList1, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::allpairs_sum_unsorted< IntList1, IntList2 > | Computes the unsorted allpairs sum of two two sorted lists |
| mpblocks::cuda::polynomial::intlist::allpairs_sum_unsorted< IntList< Head, Tail >, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::allpairs_sum_unsorted< IntList< Head, Terminal >, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::construct< v00, v01, v02, v03, v04, v05, v06, v07, v08, v09, v10, v11, v12 > | More convenient constructor |
| mpblocks::cuda::polynomial::intlist::construct1< v0 > | Construct an integer list |
| mpblocks::cuda::polynomial::intlist::construct2< v0, v1 > | Construct an integer list |
| mpblocks::cuda::polynomial::intlist::construct3< v0, v1, v2 > | Construct an integer list |
| mpblocks::cuda::polynomial::intlist::construct4< v0, v1, v2, v3 > | Construct an integer list |
| mpblocks::cuda::polynomial::intlist::construct< INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX, INT_MAX > | |
| mpblocks::cuda::polynomial::intlist::contains< IntList, val > | Evalutes to true if IntList contains val |
| mpblocks::cuda::polynomial::intlist::contains< IntList< Head, Tail >, val > | |
| mpblocks::cuda::polynomial::intlist::contains< IntList< val, Tail >, val > | |
| mpblocks::cuda::polynomial::intlist::contains_helper< B, val, Tail > | |
| mpblocks::cuda::polynomial::intlist::contains_helper< true, val, Tail > | |
| mpblocks::cuda::polynomial::intlist::enabled_range< Enable, i, j > | |
| mpblocks::cuda::polynomial::intlist::enabled_range< true, i, i > | |
| mpblocks::cuda::polynomial::intlist::enabled_range< true, i, j > | |
| mpblocks::cuda::polynomial::intlist::get< IntList, i > | Retrieve the i'th element of the list |
| mpblocks::cuda::polynomial::intlist::get< IntList< Head, Tail >, 0 > | |
| mpblocks::cuda::polynomial::intlist::get< IntList< Head, Tail >, i > | |
| mpblocks::cuda::polynomial::intlist::head< IntList, len > | Return the first len sublist |
| mpblocks::cuda::polynomial::intlist::if_else< B, T_if, T_else > | |
| mpblocks::cuda::polynomial::intlist::if_else< true, T_if, T_else > | |
| mpblocks::cuda::polynomial::intlist::join< IntList1, IntList2 > | Append IntList2 to the end of IntList1 |
| mpblocks::cuda::polynomial::intlist::join< IntList< Head1, Tail1 >, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::join< IntList< Head1, Terminal >, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::make_union< IntList1, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::max< IntList > | Retrieve the max element of the list (linear without short circut so it works with non-sorted arrays ) |
| mpblocks::cuda::polynomial::intlist::max< IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::intlist::max< IntList< Head, Terminal > > | |
| mpblocks::cuda::polynomial::intlist::merge_sort< IntList > | Performs merge sort. No seriously, merge sort at compile time. I'm not even joking |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::divide_and_conquer< IntList > | |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::divide_and_conquer< IntList< Head, Terminal > > | |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::merge< IntList1, IntList2 > | |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::merge< IntList, Terminal > | |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::merge< IntList< Head1, Tail1 >, IntList< Head2, Tail2 > > | |
| mpblocks::cuda::polynomial::intlist::merge_sort_detail::merge< Terminal, IntList > | |
| mpblocks::cuda::polynomial::intlist::pair_sum< val, IntList > | Computes sum of an integer with an intlist |
| mpblocks::cuda::polynomial::intlist::pair_sum< val, IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::intlist::pair_sum< val, IntList< Head, Terminal > > | |
| mpblocks::cuda::polynomial::intlist::range< i, j > | Creates an integer list from i to j (including both i and j) |
| mpblocks::cuda::polynomial::intlist::range< i, i > | |
| mpblocks::cuda::polynomial::intlist::size< IntList > | Evaluate the length of an integer list |
| mpblocks::cuda::polynomial::intlist::size< IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::intlist::size< IntList< Head, Terminal > > | |
| mpblocks::cuda::polynomial::intlist::strip_dups< IntList, prev > | Strips duplicates |
| mpblocks::cuda::polynomial::intlist::strip_dups< IntList< Head, Tail >, Head > | |
| mpblocks::cuda::polynomial::intlist::strip_dups< IntList< Head, Tail >, prev > | |
| mpblocks::cuda::polynomial::intlist::strip_dups< IntList< Head, Terminal >, Head > | |
| mpblocks::cuda::polynomial::intlist::strip_dups< IntList< Head, Terminal >, prev > | |
| mpblocks::cuda::polynomial::intlist::sublist< IntList, off, len > | Return a sublist starting at the specified index and having the specified length |
| mpblocks::cuda::polynomial::intlist::sublist< IntList< Head, Tail >, 0, 0 > | |
| mpblocks::cuda::polynomial::intlist::sublist< IntList< Head, Tail >, 0, len > | |
| mpblocks::cuda::polynomial::intlist::sublist< IntList< Head, Tail >, off, len > | |
| mpblocks::cuda::polynomial::intlist::sublist< Terminal, off, len > | |
| mpblocks::cuda::polynomial::intlist::tail< IntList, off > | Return the sublist starting at off and ending at the end |
| mpblocks::cuda::polynomial::LValue< Scalar, Exp > | Expression template for lvalues |
| mpblocks::cuda::polynomial::ParamKey | |
| mpblocks::cuda::polynomial::PolyPrinter< Scalar, Exp, Spec > | |
| mpblocks::cuda::polynomial::PolyPrinter< Scalar, Exp, intlist::Terminal > | |
| mpblocks::cuda::polynomial::PolyPrinter< Scalar, Exp, IntList< 0, Tail > > | |
| mpblocks::cuda::polynomial::PolyPrinter< Scalar, Exp, IntList< 1, Tail > > | |
| mpblocks::cuda::polynomial::PolyPrinter< Scalar, Exp, IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::polyval_detail::Helper< Scalar, Exp, idx, max > | |
| mpblocks::cuda::polynomial::polyval_detail::Helper< Scalar, Exp, max, max > | |
| mpblocks::cuda::polynomial::Printer< T > | |
| mpblocks::cuda::polynomial::Printer< IntList< Head, Tail > > | |
| mpblocks::cuda::polynomial::Printer< IntList< Tail, intlist::Terminal > > | |
| mpblocks::cuda::polynomial::product_detail::IdxPair< A, B > | Pairs one index of the first polynomial with one index of the second polynomial |
| mpblocks::cuda::polynomial::product_detail::inner_loop< Coeff1, Spec2, Map > | Inner loop |
| mpblocks::cuda::polynomial::product_detail::inner_loop< Coeff1, IntList< Head, intlist::Terminal >, Map > | |
| mpblocks::cuda::polynomial::product_detail::inner_loop< Coeff1, IntList< Head, Tail >, Map > | |
| mpblocks::cuda::polynomial::product_detail::insert< Root, Node > | Insert a new key/value pair into the map |
| mpblocks::cuda::polynomial::product_detail::insert< Null, Node > | Insert a Node into an empty map |
| mpblocks::cuda::polynomial::product_detail::insert_postTest< NodeA, NodeB, ALessThanB > | If ALessThanB is true, then template recurses, otherwise B is inserted in front of A |
| mpblocks::cuda::polynomial::product_detail::insert_postTest< Node< KeyA, ValueA, NextA >, NodeB, true > | |
| mpblocks::cuda::polynomial::product_detail::insert_postTest< NodeA, Node< KeyB, ValueB, Null >, false > | |
| mpblocks::cuda::polynomial::product_detail::less_than< A, B > | Evaluates ordering on nodes by resolving their keys |
| mpblocks::cuda::polynomial::product_detail::less_than< Node< KeyA, ValueA, NextA >, Node< KeyB, ValueB, NextB > > | |
| mpblocks::cuda::polynomial::product_detail::less_than< Node< KeyA, ValueA, NextA >, Null > | |
| mpblocks::cuda::polynomial::product_detail::less_than< Null, Node< KeyA, ValueA, NextA > > | |
| mpblocks::cuda::polynomial::product_detail::Node< Key, Value, Next > | Compile time map of output monomial to input monomial pairs that contribute to that coefficient |
| mpblocks::cuda::polynomial::product_detail::outer_loop< Spec1, Spec2, Map > | Outer loop |
| mpblocks::cuda::polynomial::product_detail::outer_loop< IntList< Head, intlist::Terminal >, Spec2, Map > | |
| mpblocks::cuda::polynomial::product_detail::outer_loop< IntList< Head, Tail >, Spec2, Map > | |
| mpblocks::cuda::polynomial::product_detail::product_spec< Spec1, Spec2 > | Compute product specification |
| mpblocks::cuda::polynomial::product_detail::SpecPrinter< Spec > | |
| mpblocks::cuda::polynomial::product_detail::SpecPrinter< Node< Key, IdxPair< ValA, ValB >, Next > > | |
| mpblocks::cuda::polynomial::product_detail::SpecPrinter< Null > | |
| mpblocks::cuda::polynomial::product_detail::Summation< i, Scalar, Exp1, Exp2, Spec > | |
| mpblocks::cuda::polynomial::product_detail::Summation< i, Scalar, Exp1, Exp2, Node< i, IdxPair< ValA, ValB >, Next > > | |
| mpblocks::cuda::polynomial::product_detail::Summation< i, Scalar, Exp1, Exp2, Node< i, IdxPair< ValA, ValB >, Null > > | |
| mpblocks::cuda::polynomial::product_detail::Summation< i, Scalar, Exp1, Exp2, Node< Key, IdxPair< ValA, ValB >, Next > > | |
| mpblocks::cuda::polynomial::product_detail::Summation< i, Scalar, Exp1, Exp2, Node< Key, IdxPair< ValA, ValB >, Null > > | |
| mpblocks::cuda::polynomial::Quotient< Scalar, ExpNum, SpecNum, ExpDen, SpecDen > | Expression template for polynomial long division |
| mpblocks::cuda::polynomial::Quotient< Scalar, ExpNum, SpecNum, ExpDen, SpecDen >::QuotientStep< size, min > | |
| mpblocks::cuda::polynomial::Quotient< Scalar, ExpNum, SpecNum, ExpDen, SpecDen >::QuotientStep< min, min > | |
| mpblocks::cuda::polynomial::Quotient< Scalar, ExpNum, SpecNum, ExpDen, SpecDen >::QuotientWork< size, min > | |
| mpblocks::cuda::polynomial::QuotientSpec< NumSpec, DenSpec > | |
| mpblocks::cuda::polynomial::QuotientSurrogate< Scalar, ExpNum, SpecNum, ExpDen, SpecDen > | Surrogate for initialzing with / operator |
| mpblocks::cuda::polynomial::RemainderSpec< NumSpec, DenSpec > | |
| mpblocks::cuda::polynomial::RValue< Scalar, Exp, Spec > | Expression template for rvalues |
| mpblocks::cuda::polynomial::scalarsum_detail::Get< idx, Scalar, Exp, Spec > | |
| mpblocks::cuda::polynomial::scalarsum_detail::Get< 0, Scalar, Exp, Spec > | |
| mpblocks::cuda::polynomial::ScratchSpec< NumSpec, DenSpec > | |
| mpblocks::cuda::polynomial::Storage< Scalar, IntList > | Recursive inheritance tree which provides storage for each of the required coefficients |
| mpblocks::cuda::polynomial::StreamAssignment< Scalar, Exp, idx > | Assignment |
| mpblocks::cuda::polynomial::sturm2_detail::Construct< Enable, Scalar, Spec, idx > | |
| mpblocks::cuda::polynomial::sturm2_detail::Construct< true, Scalar, Spec, idx > | |
| mpblocks::cuda::polynomial::sturm2_detail::CountSignChanges< Enable, Scalar, Spec, idx > | |
| mpblocks::cuda::polynomial::sturm2_detail::CountSignChanges< true, Scalar, Spec, idx > | |
| mpblocks::cuda::polynomial::sturm2_detail::Index< Spec, idx > | |
| mpblocks::cuda::polynomial::sturm2_detail::Storage< false, Scalar, Spec, idx > | End of recursion |
| mpblocks::cuda::polynomial::sturm2_detail::SturmSpec< Spec, idx > | Returns the the specification of the i'th polynomial in the sequence |
| mpblocks::cuda::polynomial::sturm2_detail::SturmSpec< Spec, 0 > | |
| mpblocks::cuda::polynomial::sturm2_detail::SturmSpec< Spec, 1 > | |
| mpblocks::cuda::polynomial::sturm_detail::RebuildHelper< Scalar, i, max > | |
| mpblocks::cuda::polynomial::sturm_detail::RebuildHelper< Scalar, size, size > | |
| mpblocks::cuda::polynomial::sturm_detail::SignChangeHelper< Scalar, i, max > | |
| mpblocks::cuda::polynomial::sturm_detail::SignChangeHelper< Scalar, size, size > | |
| mpblocks::cuda::polynomial::sturm_detail::Storage< Scalar,-1 > | |
| mpblocks::cuda::polynomial::SturmTypes< Scalar, Spec > | |
| mpblocks::cuda_cert::CertDef | Global offset of and size of vertex and face buffer for a particular certificate volume |
| mpblocks::cuda_cert::CertSet | Convenience interface for managing a set of workspace certificates in GPU memory, and dispatching brute force CUDA searches on that point set |
| mpblocks::cuda_cert::CertSet2 | Convenience interface for managing a set of workspace certificates in GPU memory, and dispatching brute force CUDA searches on that point set |
| mpblocks::cuda_cert::FaceFinishTag | |
| mpblocks::cuda_cert::FaceSurrogate< ArrayLike, Scalar > | |
| mpblocks::cuda_cert::FinishTag | |
| mpblocks::cuda_cert::SetDef | Global offset of and size of buffer for a vertex set or a face set |
| mpblocks::cuda_cert::VertexFinishTag | |
| mpblocks::cuda_cert::VertexSurrogate< ArrayLike > | |
| mpblocks::cudaNN::euclidean_distance< Pseudo, Scalar, NDim > | |
| mpblocks::cudaNN::EuclideanTag | |
| mpblocks::cudaNN::intr::Dispatch< Trajectory > | |
| mpblocks::cudaNN::intr::Dispatch< DEVICE > | |
| mpblocks::cudaNN::kernels::NextPow2< Arg > | |
| mpblocks::cudaNN::kernels::NextPow2_iter< Arg, i, final > | |
| mpblocks::cudaNN::kernels::NextPow2_iter< Arg, i, true > | |
| mpblocks::cudaNN::kernels::Reader< Format_t, NDim, Idx > | |
| mpblocks::cudaNN::kernels::Reader< Format_t, NDim, NDim > | |
| mpblocks::cudaNN::kernels::so3_distance_fn< Scalar, Pseudo > | |
| mpblocks::cudaNN::kernels::so3_distance_fn< Scalar, true > | |
| mpblocks::cudaNN::PointSet< Format_t, NDim > | Convenience interface for managing a point set in GPU memory, and dispatching brute force CUDA searches on that point set |
| mpblocks::cudaNN::QueryPoint< Format_t, NDim > | |
| mpblocks::cudaNN::R2S1Attr< Format_t, NDim, Enable > | |
| mpblocks::cudaNN::R2S1Attr< Format_t, NDim, true > | |
| mpblocks::cudaNN::R2S1Kernel< Format_t, NDim, Enabled > | |
| mpblocks::cudaNN::R2S1Kernel< Format_t, NDim, true > | |
| mpblocks::cudaNN::R2S1Tag | |
| mpblocks::cudaNN::RectangleQuery< Format_t, NDim > | |
| mpblocks::cudaNN::ResultBlock< Format_t, NDim > | |
| mpblocks::cudaNN::SE3Attr< Format_t, NDim, Enable > | |
| mpblocks::cudaNN::SE3Attr< Format_t, NDim, true > | |
| mpblocks::cudaNN::SE3FAttr< Format_t, NDim, Enabled > | |
| mpblocks::cudaNN::SE3FAttr< Format_t, NDim, true > | |
| mpblocks::cudaNN::SE3Kernel< Format_t, NDim, Enabled > | |
| mpblocks::cudaNN::SE3Kernel< Format_t, NDim, true > | |
| mpblocks::cudaNN::SE3Tag | |
| mpblocks::cudaNN::so3_distance< Pseudo, Scalar, NDim > | |
| mpblocks::cudaNN::SO3FAttr< Format_t, NDim, Enabled > | |
| mpblocks::cudaNN::SO3FAttr< Format_t, NDim, true > | |
| mpblocks::dubins::a | Empty struct used to template "variant" of three arc primitives |
| mpblocks::dubins::b | Empty struct used to template "variant" of three arc primitives |
| mpblocks::dubins::curves_cuda::DebugCurved< Format_t > | |
| mpblocks::dubins::curves_cuda::DebugStraight< Format_t > | |
| mpblocks::dubins::curves_cuda::EuclideanParams< Format_t > | |
| mpblocks::dubins::curves_cuda::intr::Dispatch< Trajectory > | |
| mpblocks::dubins::curves_cuda::intr::Dispatch< DEVICE > | |
| mpblocks::dubins::curves_cuda::PackedIndex< Format_t > | Stores both the index of the entry and the solution id of it's best solver in a bitfield |
| mpblocks::dubins::curves_cuda::PackedStorage< BYTES > | Template meta function which defines internal typedef Result to be an unsigned integer of size BYTES |
| mpblocks::dubins::curves_cuda::PackedStorage< 1 > | |
| mpblocks::dubins::curves_cuda::PackedStorage< 2 > | |
| mpblocks::dubins::curves_cuda::PackedStorage< 4 > | |
| mpblocks::dubins::curves_cuda::PackedStorage< 8 > | |
| mpblocks::dubins::curves_cuda::Params< Format_t > | |
| mpblocks::dubins::curves_cuda::PointSet< Format_t > | Convenience interface for managing a point set of dubins states in GPU memory, including brute force CUDA searches on that point set |
| mpblocks::dubins::curves_cuda::Query< Format_t > | Encapsulates two states and a raidus |
| mpblocks::dubins::curves_cuda::ResultBlock< Format_t > | |
| mpblocks::dubins::curves_cuda::Solver< Id, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< Id, Format_t >::DebugResult | |
| mpblocks::dubins::curves_cuda::Solver< LRLa, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< LRLb, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< LSL, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< LSR, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< RLRa, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< RLRb, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< RSL, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_cuda::Solver< RSR, Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_eigen::DrawOpts | Encapsulates patterns for drawing |
| mpblocks::dubins::curves_eigen::GenericArtist< Format_t > | Interface for different solutions |
| mpblocks::dubins::curves_eigen::hyper::HyperRect< Format_t > | A hyper-rectangle in dubins space: A rectangular prism in R^3 |
| mpblocks::dubins::curves_eigen::hyper::Solver< xSpec, ySpec, tSpec, Format_t > | Default solver is instantated when not all three constraints are active and it simply dispatches the point-to-point solver |
| mpblocks::dubins::curves_eigen::hyper::Solver< OFF, OFF, OFF, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< OFF, OFF, tSpec, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< OFF, ySpec, OFF, Format_t > | Specialization for a single y constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< OFF, ySpec, tSpec, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< xSpec, OFF, OFF, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< xSpec, OFF, tSpec, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::Solver< xSpec, ySpec, OFF, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::SolverIterator< xSpec, ySpec, tSpec, Format_t > | Iterates over solvers and accumulates the solution |
| mpblocks::dubins::curves_eigen::hyper::SolverIterator< 3, ySpec, tSpec, Format_t > | Specialization to end template recursino |
| mpblocks::dubins::curves_eigen::hyper::SolverIterator< xSpec, 3, tSpec, Format_t > | Specialization to end template recursino |
| mpblocks::dubins::curves_eigen::hyper::SolverIterator< xSpec, ySpec, 3, Format_t > | Specialization to end template recursino |
| mpblocks::dubins::curves_eigen::hyper::SpecPack< xSpec, ySpec, tSpec > | |
| mpblocks::dubins::curves_eigen::hyper::ThreeConstraintHelper< xSpec, ySpec, tSpec > | |
| mpblocks::dubins::curves_eigen::hyper::ThreeConstraintHelper< xSpec, ySpec, tSpec >::Iterator< idx, Format_t > | |
| mpblocks::dubins::curves_eigen::hyper::ThreeConstraintHelper< xSpec, ySpec, tSpec >::Iterator< INVALID, Format_t > | |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::HelperWrap< xSpec, tSpec, Format_t > | Wraps structures and accessors for the specific xSpec and tSpec |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::HelperWrap< xSpec, tSpec, Format_t >::SolverIterator< List > | Iteration over solvers |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::HelperWrap< xSpec, tSpec, Format_t >::SolverIterator< First, List...> | |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::HelperWrap< xSpec, tSpec, Format_t >::SolverIterator< Last > | |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, Variant, Format_t > | Interface for variants of solvers, default template is never instantiated |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, LRLa, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, LSL, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, LSR, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, RLRa, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, RSL, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_x::Solver< xSpec, tSpec, RSR, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::HelperWrap< ySpec, tSpec, Format_t > | Wraps structures and accessors for the specific ySpec and tSpec |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::HelperWrap< ySpec, tSpec, Format_t >::SolverIterator< List > | Iteration over solvers |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::HelperWrap< ySpec, tSpec, Format_t >::SolverIterator< First, List...> | |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::HelperWrap< ySpec, tSpec, Format_t >::SolverIterator< Last > | |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, Variant, Format_t > | Interface for variants of solvers, default template is never instantiated |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, LRLa, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, LSL, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, LSR, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, RLRa, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, RSL, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::hyper::two_theta_y::Solver< ySpec, tSpec, RSR, Format_t > | Specialization for a single theta constraint (min or max) |
| mpblocks::dubins::curves_eigen::Integrate< Scalar > | |
| mpblocks::dubins::curves_eigen::IntegrateIncrementally< Scalar > | |
| mpblocks::dubins::curves_eigen::Opposite< Arc1 > | Opposite arc type for given template parameter |
| mpblocks::dubins::curves_eigen::Opposite< L > | |
| mpblocks::dubins::curves_eigen::Opposite< R > | |
| mpblocks::dubins::curves_eigen::Query< Format_t > | Encapsulates two dubins states and a raidus |
| mpblocks::dubins::curves_eigen::Solver< Id, Format_t > | Interface for different solutions, this is specialized for each Id in the SolutionId enum |
| mpblocks::dubins::curves_eigen::Solver< LRLa, Scalar > | Solves a left turn, plus a right turn, plus a left turn |
| mpblocks::dubins::curves_eigen::Solver< LRLb, Scalar > | Solves left turn followed by a right turn followed by a left turn |
| mpblocks::dubins::curves_eigen::Solver< LSL, Scalar > | Solves a left turn, plus a straight segment, plus a left turn |
| mpblocks::dubins::curves_eigen::Solver< LSR, Scalar > | Solves a left turn, plus a straight segment, plus a right turn |
| mpblocks::dubins::curves_eigen::Solver< RLRa, Scalar > | Solves a right turn, plus a left turn, plus a right turn |
| mpblocks::dubins::curves_eigen::Solver< RLRb, Scalar > | Solves a right turn, plus a left turn, plus a right turn |
| mpblocks::dubins::curves_eigen::Solver< RSL, Scalar > | Interface for different solutions |
| mpblocks::dubins::curves_eigen::Solver< RSR, Scalar > | Solves a right turn, plus a straight segment, plus a right turn |
| mpblocks::dubins::curves_eigen::SolverIterator< idx, Format_t > | |
| mpblocks::dubins::curves_eigen::SolverIterator< INVALID, Format_t > | |
| mpblocks::dubins::curves_eigen::TrigWrap< Format_t, Primitive > | Static functions which call the appropriate trig function based in the template parameter specifying the path Primitive; |
| mpblocks::dubins::curves_eigen::TrigWrap< Format_t, L > | |
| mpblocks::dubins::curves_eigen::TrigWrap< Format_t, R > | |
| mpblocks::dubins::DistanceAndId< Format_t > | Encapsulates a solution distance along with the id of the path type, identifying the nature of the three arc segments in the path |
| mpblocks::dubins::IdToType< ID, i > | Converts a SolutionID and index 0,1,2 into a type |
| mpblocks::dubins::IdToType< LRLa, 0 > | |
| mpblocks::dubins::IdToType< LRLa, 1 > | |
| mpblocks::dubins::IdToType< LRLa, 2 > | |
| mpblocks::dubins::IdToType< LRLb, 0 > | |
| mpblocks::dubins::IdToType< LRLb, 1 > | |
| mpblocks::dubins::IdToType< LRLb, 2 > | |
| mpblocks::dubins::IdToType< LSL, 0 > | |
| mpblocks::dubins::IdToType< LSL, 1 > | |
| mpblocks::dubins::IdToType< LSL, 2 > | |
| mpblocks::dubins::IdToType< LSR, 0 > | |
| mpblocks::dubins::IdToType< LSR, 1 > | |
| mpblocks::dubins::IdToType< LSR, 2 > | |
| mpblocks::dubins::IdToType< RLRa, 0 > | |
| mpblocks::dubins::IdToType< RLRa, 1 > | |
| mpblocks::dubins::IdToType< RLRa, 2 > | |
| mpblocks::dubins::IdToType< RLRb, 0 > | |
| mpblocks::dubins::IdToType< RLRb, 1 > | |
| mpblocks::dubins::IdToType< RLRb, 2 > | |
| mpblocks::dubins::IdToType< RSL, 0 > | |
| mpblocks::dubins::IdToType< RSL, 1 > | |
| mpblocks::dubins::IdToType< RSL, 2 > | |
| mpblocks::dubins::IdToType< RSR, 0 > | |
| mpblocks::dubins::IdToType< RSR, 1 > | |
| mpblocks::dubins::IdToType< RSR, 2 > | |
| mpblocks::dubins::kd_tree::Distance< Format > | R2_s1 distance computation |
| mpblocks::dubins::kd_tree::Key< Format > | Key for priority queue |
| mpblocks::dubins::kd_tree::Key< Format >::LessThan | |
| mpblocks::dubins::kd_tree::Traits< Format > | |
| mpblocks::dubins::L | Empty struct used to template "left turn" primitive |
| mpblocks::dubins::Path< Format_t > | Encodes a dubins path primitive, which is three connected arc segments |
| mpblocks::dubins::R | Empty struct used to template "right turn" primitive |
| mpblocks::dubins::Result< Format_t > | Encapsulates the solution distance along with a feasibility bit for a particular primitive solution |
| mpblocks::dubins::S | Empty struct used to template "straight" primitive |
| mpblocks::dubins::TypeToId< P1, P2, P3, V > | Converts template paramters to SolutionID |
| mpblocks::dubins::TypeToId< L, R, L, a > | |
| mpblocks::dubins::TypeToId< L, R, L, b > | |
| mpblocks::dubins::TypeToId< L, S, L, V > | |
| mpblocks::dubins::TypeToId< L, S, R, V > | |
| mpblocks::dubins::TypeToId< R, L, R, a > | |
| mpblocks::dubins::TypeToId< R, L, R, b > | |
| mpblocks::dubins::TypeToId< R, S, L, V > | |
| mpblocks::dubins::TypeToId< R, S, R, V > | |
| mpblocks::gjk88::MinkowskiPair< Point > | |
| mpblocks::gtk::DerivedTypes< T > | Maps a widget or object class to their pointer and map types |
| mpblocks::gtk::EigenCairo | Wrapper for cairo context which adds methods allowing for eigen vector typed points |
| mpblocks::gtk::EigenCairo::SolidPattern | |
| mpblocks::gtk::GetTypes< T, Type > | Maps a class to the pointer type and map type corresponding to it, default is a widget map whose pointer types are regular points |
| mpblocks::gtk::GetTypes< T, ObjectType > | Specialization for object types |
| mpblocks::gtk::GetTypes< T, WidgetType > | Sepecialization for widget types |
| mpblocks::gtk::ObjectMapBase< Object_t > | Base class for a map of string names -> object RefPtrs |
| mpblocks::gtk::ObjectType | |
| mpblocks::gtk::TypeOf< T > | Maps a Gtk:: class to either a WidgetType or an ObjectType, default is WidgetType |
| mpblocks::gtk::TypeOf< Gtk::Adjustment > | |
| mpblocks::gtk::TypeOf< Gtk::EntryBuffer > | |
| mpblocks::gtk::TypeOf< Gtk::TextBuffer > | |
| mpblocks::gtk::WidgetMapBase< Widget_t > | Base class for a map of string names -> widget pointers |
| mpblocks::gtk::WidgetType | |
| mpblocks::kd_tree::blocks::Inserter< Traits, Allocator > | A block which wraps the tree insertion operator |
| mpblocks::kd_tree::euclidean::blocks::Ball< Traits, Allocator > | |
| mpblocks::kd_tree::euclidean::blocks::KNearest< Traits, Allocator > | |
| mpblocks::kd_tree::euclidean::blocks::KNearestBall< Traits, Allocator > | |
| mpblocks::kd_tree::euclidean::blocks::KNearestBallCenter< Traits, Allocator > | Performs search for k-NN within a ball at a specified center and radius |
| mpblocks::kd_tree::euclidean::blocks::Nearest< Traits > | |
| mpblocks::kd_tree::euclidean::Distance< Traits > | Euclidean distance computation |
| mpblocks::kd_tree::euclidean::HyperRect< Traits > | NDim dimensional hyperrectangle, represented as a min and max extent |
| mpblocks::kd_tree::euclidean::Key< Traits > | |
| mpblocks::kd_tree::euclidean::Key< Traits >::Compare | |
| mpblocks::kd_tree::ListBuilder< Traits > | Enumerates an entire subtree, building a list of nodes along with the hyperectangle bounding the subtree at that node |
| mpblocks::kd_tree::ListPair< Traits > | Pairs nodes of the Kd tree along with a hyperrectangle that is the bounding volume for the subtree rooted at that node |
| mpblocks::kd_tree::NearestSearchIface< Traits > | Interface for nearest node type searches |
| mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator > | |
| mpblocks::kd_tree::euclidean::KNearestBall< Traits, Allocator > | |
| mpblocks::kd_tree::euclidean::KNearestBallCenter< Traits, Allocator > | Performs search for k-NN within a ball at a specified center and radius |
| mpblocks::kd_tree::euclidean::Nearest< Traits > | Search algorithm for finding the nearest point in the kd tree to some query point |
| mpblocks::kd_tree::r2_s1::KNearest< Traits, Allocator > | |
| mpblocks::kd_tree::r2_s1::Nearest< Traits > | |
| mpblocks::kd_tree::Node< Traits > | Base class for nodes in the kd tree |
| mpblocks::dubins::kd_tree::Traits< Format >::Node | |
| mpblocks::kd_tree::Traits::Node | Node class must be defined in traits since it uses the CTRP, it must derive from kd_tree::Node<Traits> where Traits is the class containing Node |
| mpblocks::kd_tree::r2_s1::blocks::KNearest< Traits, Allocator > | |
| mpblocks::kd_tree::r2_s1::blocks::Nearest< Traits > | |
| mpblocks::kd_tree::r2_s1::Distance< Traits > | R2_s1 distance computation |
| mpblocks::kd_tree::r2_s1::HyperRect< Traits > | NDim dimensional hyperrectangle, represented as a min and max extent |
| mpblocks::kd_tree::r2_s1::Key< Traits > | |
| mpblocks::kd_tree::r2_s1::Key< Traits >::Compare | |
| mpblocks::kd_tree::RangeSearchIface< Traits > | |
| mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > | |
| mpblocks::kd_tree::Traits | Example traits class, can also be used as a default if you're lazy and your problem happens to be 2d |
| mpblocks::kd_tree::Tree< Traits > | Simple KDtree class |
| mpblocks::polynomial::LValue< Scalar, Exp > | Expression template for rvalues |
| mpblocks::polynomial::Max< Val1, Val2 > | |
| mpblocks::polynomial::MaxSelect< Val1, Val2, First > | |
| mpblocks::polynomial::MaxSelect< Val1, Val2, false > | |
| mpblocks::polynomial::Min< Val1, Val2 > | |
| mpblocks::polynomial::MinSelect< Val1, Val2, First > | |
| mpblocks::polynomial::MinSelect< Val1, Val2, false > | |
| mpblocks::polynomial::Polynomial< Scalar, Degree >::iterator | |
| mpblocks::polynomial::Polynomial< Scalar, Dynamic >::iterator | |
| mpblocks::polynomial::Quotient< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| mpblocks::polynomial::RValue< Scalar, Exp > | Expression template for rvalues |
| mpblocks::polynomial::SparsePolynomial< Scalar > | |
| mpblocks::polynomial::StreamAssignment< Exp > | Assignment |
| mpblocks::polynomial::SturmSequence< Scalar > | |
| mpblocks::redblack::BasicNode< Traits > | A node in a redblack tree |
| mpblocks::redblack::ExampleTraits | Example traits struction from which a red-black tree may be instantiated |
| mpblocks::redblack::ExampleTraits::NodeOps | Callable type which implements the primitives required to access fields of a node |
| mpblocks::redblack::Iterator< Traits > | Implements red black trees from CLRS |
| mpblocks::redblack::Tree< Traits > | Implements red black trees from CLRS |
| mpblocks::simplex_tree::Geometry< Traits > | Vertex storage for recursively building the "active" simplex during insertion |
| mpblocks::simplex_tree::Node< Traits > | Base class for nodes, implements storage and interface for the simplex tree |
| mpblocks::simplex_tree::Simplex< Traits > | Base class for nodes, implements storage and interface for the simplex tree |
| mpblocks::simplex_tree::Tree< Traits > | Base class for nodes, implements storage and interface for the simplex tree |
| mpblocks::util::Range_< T > | |
| mpblocks::util::Range_< T >::Iterator | |
| mpblocks::kd_tree::NearestSearchIface< Traits< Scalar > > | |
| mpblocks::dubins::kd_tree::KNearest< Scalar > | |
| mpblocks::dubins::kd_tree::Nearest< Scalar > | |
| nix::Clock | |
| nix::Epoll | |
| nix::epoll::Flags | |
| nix::FdSet::ConstRef | Reference to an element in a bitset |
| nix::FdSet::Ref | Reference to an element in a bitset |
| nix::NotifyPipe | Manages a pipe which can be used as a condition variable between two threads. This is in contrast to a pthreads condition variable which can't be selected-ed or epoll-ed |
| nix::SelectSet | |
| nix::SelectSurrogate | |
| mpblocks::gtk::ObjectMapBase< Gtk::Adjustment > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::ObjectMapBase< Gtk::EntryBuffer > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::ObjectMapBase< Gtk::TextBuffer > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::clarkson93::OptLevel< mpblocks::clarkson93::OptLevelGet< Traits >::Value > | |
| mpblocks::dubins::curves_cuda::PackedStorage< sizeof(Format_t) > | |
| mpblocks::dubins::curves_cuda::PackedStorage< sizeof(PunType)> | |
| kw::ParamPack< Tail...> | |
| kw::ParamPack< Head, Tail...> | Specialization for recursion, provides storage for the current type in the type list, then recursively derives from the remaining types in the type list |
| pthreads::Access< Base, T > | Access delegate, an object which can access an attribute value of an attribute object |
| pthreads::Assignment< Base, T > | Assignment delegate, an object which can assign an attribute value to an attribute object |
| pthreads::Attr< Base > | Attributes object for type Base |
| pthreads::AttrType< Base > | Template used to resolve the pthreads_xxx_t object corresponding to the Attr<Base> object |
| pthreads::AttrType< Barrier > | A simple way of telling Attr<Barrier> that it's storage type is pthread_barrierattr_t |
| pthreads::AttrType< Condition > | A simple way of telling Attr<Condition> that it's storage type is pthread_condattr_t |
| pthreads::AttrType< Mutex > | A simple way of telling Attr<Mutex> that it's storage type is pthread_mutexattr_t |
| pthreads::AttrType< Thread > | A simple way of telling Attr<Thread> that it's storage type is pthread_attr_t |
| pthreads::Barrier | A barrier is an object which synchronizes a fixed number of threads at a specific point |
| pthreads::Condition | Allows multiple threads to wait until a condition is satisfied |
| pthreads::Delegate< Base, T > | Two-way delegate, may assign or retrieve (unsafely) an attribute value of an attribute object |
| pthreads::Friendly< T > | Since a template parameter cannot be a friend (until C++-11) this template simply allows us to work around that limitation |
| pthreads::Key | A key is an identifier used to specify a storage location where the thing stored is different for each thread |
| pthreads::Mutex | Mutual exclusion lock |
| pthreads::ScopedLock | Points to a locked mutex and unlocks the mutex when destroyed |
| pthreads::Stack | Simply encapsulates the stack address and size in a single object |
| pthreads::Thread | A thread... presumably you know what this is |
| pthreads::TypeWrap< T, ID > | Provides a unique type that acts like a native type |
| fontconfig::RefPtr< fontconfig::ObjectSet > | |
| fontconfig::RefPtr< fontconfig::Pattern > | |
| mpblocks::cuda::linalg2::RValue< Format_t, ROWS, COLS, Matrix< Format_t, ROWS, COLS > > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 2, 1 > | |
| mpblocks::cuda::linalg2::Matrix< Format_t, 3, 1 > | |
| mpblocks::cuda::linalg2::RValue< Scalar, 2, 2, Rotation2d< Scalar > > | |
| mpblocks::cuda::linalg2::Rotation2d< Scalar > | |
| mpblocks::cuda::linalg2::RValue< Scalar, COLS, ROWS, Transpose< Scalar, ROWS, COLS, Exp > > | |
| mpblocks::cuda::linalg2::Transpose< Scalar, ROWS, COLS, Exp > | Expression template for sum of two expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Derivative< Scalar, Exp, Spec >, derivative_detail::DerivativeSpec< true, Spec >::result > | |
| mpblocks::cuda::polynomial::Derivative< Scalar, Exp, Spec > | Expression template for sum of two matrix expressions |
| mpblocks::polynomial::RValue< Scalar, Difference< Scalar, Exp1, Exp2 > > | |
| mpblocks::polynomial::Difference< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Difference< Scalar, Exp1, Exp2 > > | |
| mpblocks::cuda::linalg::Difference< Scalar, Exp1, Exp2 > | Expression template for difference of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Difference< Scalar, Exp1, Spec1, Exp2, Spec2 >, intlist::make_union< Spec1, Spec2 >::result > | |
| mpblocks::cuda::polynomial::Difference< Scalar, Exp1, Spec1, Exp2, Spec2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, LView< Scalar, Exp > > | |
| mpblocks::cuda::linalg::LView< Scalar, Exp > | Expression template for subset of a matrix expression |
| mpblocks::cuda::linalg::RValue< Scalar, Matrix< Scalar, ROWS, COLS > > | |
| mpblocks::cuda::linalg::Matrix< Scalar, ROWS, COLS > | |
| mpblocks::polynomial::RValue< Scalar, Negative< Scalar, Exp > > | |
| mpblocks::polynomial::Negative< Scalar, Exp > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Negative< Scalar, Exp, Spec >, Spec > | |
| mpblocks::cuda::polynomial::Negative< Scalar, Exp, Spec > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Normalize< Scalar, Exp > > | |
| mpblocks::cuda::linalg::Normalize< Scalar, Exp > | Expression template for difference of two matrix expressions |
| mpblocks::polynomial::RValue< Scalar, Normalized< Scalar, Exp > > | |
| mpblocks::polynomial::Normalized< Scalar, Exp > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Normalized< Scalar, Exp, Spec >, Spec > | |
| mpblocks::cuda::polynomial::Normalized< Scalar, Exp, Spec > | Expression template for sum of two matrix expressions |
| mpblocks::polynomial::RValue< Scalar, Polynomial< Scalar, Degree > > | |
| mpblocks::polynomial::Polynomial< Scalar, Degree > | A dense, statically sized polynomial |
| mpblocks::polynomial::RValue< Scalar, Polynomial< Scalar, Dynamic > > | |
| mpblocks::polynomial::Polynomial< Scalar, Dynamic > | A dense, dynamically sized polynomial |
| mpblocks::cuda::polynomial::RValue< Scalar, Polynomial< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range >, mpblocks::cuda::polynomial::intlist::enabled_range > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range > | |
| mpblocks::cuda::polynomial::RValue< Scalar, Polynomial< Scalar, Spec >, Spec > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, Spec > | A sparse, statically sized polynomial |
| mpblocks::cuda::polynomial::RValue< Scalar, Polynomial< Scalar, typename intlist::range< 0, size >::result >, typename intlist::range< 0, size >::result > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, typename intlist::range< 0, size >::result > | |
| mpblocks::cuda::linalg::RValue< Scalar, Product< Scalar, Exp1, Exp2 > > | |
| mpblocks::polynomial::RValue< Scalar, Product< Scalar, Exp1, Exp2 > > | |
| mpblocks::polynomial::Product< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Product< Scalar, Exp1, Spec1, Exp2, Spec2 >, intlist::allpairs_sum< Spec1, Spec2 >::result > | |
| mpblocks::cuda::polynomial::Product< Scalar, Exp1, Spec1, Exp2, Spec2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Rotation2d< Scalar > > | |
| mpblocks::cuda::linalg::Rotation2d< Scalar > | |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Difference< Scalar, ROWS, COLS, Exp1, Exp2 > > | |
| mpblocks::cuda::linalg2::Difference< Scalar, ROWS, COLS, Exp1, Exp2 > | Expression template for difference of two expressions |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Matrix< Scalar, ROWS, COLS > > | |
| mpblocks::cuda::linalg2::Matrix< Scalar, ROWS, COLS > | |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Product< Scalar, ROWS, COLS, COMMON, Exp1, Exp2 > > | |
| mpblocks::cuda::linalg2::Product< Scalar, ROWS, COLS, COMMON, Exp1, Exp2 > | Expression template for product expressions |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Scale< Scalar, ROWS, COLS, Exp > > | |
| mpblocks::cuda::linalg2::Scale< Scalar, ROWS, COLS, Exp > | Expression template for multiplication by a scalar |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, Sum< Scalar, ROWS, COLS, Exp1, Exp2 > > | |
| mpblocks::cuda::linalg2::Sum< Scalar, ROWS, COLS, Exp1, Exp2 > | Expression template for sum of two expressions |
| mpblocks::cuda::linalg2::RValue< Scalar, ROWS, COLS, View< i, j, ROWS, COLS, Scalar, Exp > > | |
| mpblocks::cuda::linalg2::View< i, j, ROWS, COLS, Scalar, Exp > | Expression template for subset of a matrix expression |
| mpblocks::cuda::linalg::RValue< Scalar, RView< Scalar, Exp > > | |
| mpblocks::cuda::linalg::RView< Scalar, Exp > | Expression template for subset of a matrix expression |
| mpblocks::cuda::polynomial::RValue< Scalar, ScalarProduct< Scalar, Exp, Spec >, Spec > | |
| mpblocks::cuda::polynomial::ScalarProduct< Scalar, Exp, Spec > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, ScalarSum< Scalar, Exp, Spec >, intlist::make_union< IntList< 0, intlist::Terminal >, Spec >::result > | |
| mpblocks::cuda::polynomial::ScalarSum< Scalar, Exp, Spec > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Scale< Scalar, Exp > > | |
| mpblocks::cuda::linalg::Scale< Scalar, Exp > | Forward declared for normalized() |
| mpblocks::polynomial::RValue< Scalar, Sum< Scalar, Exp1, Exp2 > > | |
| mpblocks::polynomial::Sum< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Sum< Scalar, Exp1, Exp2 > > | |
| mpblocks::cuda::linalg::Sum< Scalar, Exp1, Exp2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::polynomial::RValue< Scalar, Sum< Scalar, Exp1, Spec1, Exp2, Spec2 >, intlist::make_union< Spec1, Spec2 >::result > | |
| mpblocks::cuda::polynomial::Sum< Scalar, Exp1, Spec1, Exp2, Spec2 > | Expression template for sum of two matrix expressions |
| mpblocks::cuda::linalg::RValue< Scalar, Transpose< Scalar, Exp > > | |
| mpblocks::cuda::linalg::Transpose< Scalar, Exp > | Expression template for difference of two matrix expressions |
| mpblocks::clarkson93::Simplex2< This > | |
| mpblocks::clarkson93::ExampleTraits2< SCALAR, NDIM >::Simplex | The derived type to use for simplices |
| mpblocks::cuda::bitonic::Sorter< Format_t, Format_t > | |
| std::bitset< Bits > | STL class |
| mpblocks::clarkson93::BitMember< SimplexBits, simplex::NUM_BITS > | |
| mpblocks::clarkson93::BitMember< Enum, Size > | Indicates membership into a number of sets by a bitfield |
| std::exception | STL class |
| mpblocks::cuda::CudaException | Exception which carries a standard error code |
| std::ios_base | STL class |
| std::basic_ios< Char > | STL class |
| std::basic_istream< Char > | STL class |
| std::basic_iostream< Char > | STL class |
| std::basic_stringstream< Char > | STL class |
| std::stringstream | STL class |
| mpblocks::cuda::CudaExceptionStream | Used to simplify the process of generating an exception message |
| mpblocks::cuda::ExceptionStream< Exception_t > | Used to simplify the process of generating an exception message |
| mpblocks::utility::ExceptionStream< Exception_t > | Used to simplify the process of generating an exception message |
| std::basic_ostream< Char > | STL class |
| std::basic_iostream< Char > | STL class |
| std::priority_queue< T > | STL class |
| mpblocks::clarkson93::P_Queue< T > | A priority queue with a slightly more readable interface than from the STL |
| mpblocks::clarkson93::P_Queue< PQ_Key > | |
| std::vector< T > | STL class |
| mpblocks::clarkson93::ExampleTraits2< SCALAR, NDIM >::SimplexMgr | Template for allocators & memory managers |
| mpblocks::clarkson93::ExampleTraits::SimplexFactory | Template for allocators & memory managers |
| mpblocks::clarkson93::Facet2< Traits > | Subset of the vertices of a simplex |
| mpblocks::clarkson93::Stack< T, SetEnum > | |
| mpblocks::clarkson93::Stack< T *, SetEnum > | |
| mpblocks::clarkson93::Stack< T, void > | |
| mpblocks::polynomial::Polynomial< Scalar, Dynamic > | A dense, dynamically sized polynomial |
| mpblocks::clarkson93::Stack< HorizonRidge_t > | |
| mpblocks::clarkson93::Stack< Simplex *, SimplexBits > | |
| mpblocks::cuda::polynomial::Storage< Index< Spec, idx+1 >::enabled, Scalar, Spec, idx+1 > | |
| mpblocks::cuda::polynomial::sturm2_detail::Storage< Enabled, Scalar, Spec, idx > | Storage class, stores one polynomial in teh sequence |
| mpblocks::cuda::polynomial::sturm2_detail::Storage< true, Scalar, Spec, 0 > | |
| mpblocks::cuda::polynomial::SturmSequence2< Scalar, Spec > | Stores a squence of polynomials which satisfy the properties of sturms theorem and provides methods for computing the number of sign changes |
| mpblocks::cuda::polynomial::Storage< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, mpblocks::cuda::polynomial::intlist::enabled_range > | |
| mpblocks::cuda::polynomial::Storage< Scalar, size-1 > | |
| mpblocks::cuda::polynomial::sturm_detail::Storage< Scalar, size > | Storage class, stores one polynomial in teh sequence |
| mpblocks::cuda::polynomial::sturm_detail::Storage< Scalar, max > | |
| mpblocks::cuda::polynomial::SturmSequence< Scalar, max > | Stores a squence of polynomials which satisfy the properties of sturms theorem and provides methods for computing the number of sign changes |
| mpblocks::cuda::polynomial::Storage< Scalar, Spec > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, Spec > | A sparse, statically sized polynomial |
| mpblocks::cuda::polynomial::Storage< Scalar, SpecTail > | |
| mpblocks::cuda::polynomial::Storage< Scalar, IntList< SpecHead, SpecTail > > | |
| mpblocks::cuda::polynomial::Storage< Scalar, typename intlist::range< 0, size >::result > | |
| mpblocks::cuda::polynomial::Polynomial< Scalar, typename intlist::range< 0, size >::result > | |
| Tail | |
| kw::ParamPack< Tail > | Specialization for base case, provides storage for the last type in the type list |
| timespec | |
| mpblocks::utility::Timespec | Just a c timespec with arithmetic operators |
| nix::Timespec | Just a c timeval |
| timeval | |
| nix::Timeval | |
| SimplexOps | |
| mpblocks::clarkson93::Triangulation< Traits > | Misleadingly-named data structure, is actually a "simplexification", the dimension agnostic analog of a triangulation |
| type | |
| kw::is_call_possible< type, call_details >::derived | A class which will definitely have a function call operator. If type has a function call operator then derived will also have that same operator available; If type does not have a function call operator, then the only function call operator available to derived is the one returning a no |
| Type | |
| kw::has_member< Type >::HasAtLeastOneFnCallOperator | This class derives from both the argument of the meta function, and a class which we know has a function call operator |
| mpblocks::gtk::WidgetMapBase< Gtk::Alignment > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::AspectFrame > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Box > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Button > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::CheckButton > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::ColorButton > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::ComboBox > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::ComboBoxText > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::DrawingArea > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Expander > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Frame > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Grid > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::ProgressBar > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::RadioButton > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Scale > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::SpinButton > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::TextView > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::ToggleButton > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::TreeView > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
| mpblocks::gtk::WidgetMapBase< Gtk::Window > | |
| mpblocks::gtk::LayoutMap | Stores typed maps from string names -> pointers or RefPtrs depending on if the pointed-to object is a widget or an object |
1.8.6