OKlibrary  0.2.1.6
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
Algebra::Normed_remainder< Int >
Algebra::RSA< Int >
Algebra::Z_mod_n< modulus, Int >
Algebra::Zmodn< Int >
Algebra_Concepts_tests::Test_Z_mod_n< Z_mod_n >
Algebra_Traits::BinaryLinearCombination< Operator, Value >
Algebra_Traits::MultiplicativeGroupoid_traits< MultiplicativeGroupoid >
Algebra_Traits::MultiplicativeGroupoid_traits< Algebra::Z_mod_n< modulus, Int > >
Algebra_Traits::MultiplicativeGroupoid_traits< Algebra::Zmodn< Int > >
Algebra_Traits::MultiplicativeGroupoid_traits< int >
AlgebraicStructures::SignRing
AlgebraicStructures::SignRing::iterator
Algorithms::Median< Out, It >
Algorithms::Median_with_sorting< Out, It >
Algorithms::Power_natural< MultiplicativeMonoid, Int >
Algorithms::Rand
Algorithms::RandomGeneratorInterval< bgt, dt >
Algorithms_Tests::test_median< median >
Algorithms_Tests::test_median_with_sorting< median >
Algorithms_Tests::Test_power_natural< Power_natural >
ALGPARAMETERS
Analyse::FormatError
Analyse::mean_time
Analyse::SolverResult
AutomatedCompilation::both_outputs
AutomatedCompilation::Compilation< Compiler, Environment, Compiler_Output, Source, Executable >
AutomatedCompilation::Compiler_default
AutomatedCompilation::dcc
AutomatedCompilation::Environment_basis
AutomatedCompilation::Environment_kullmann
AutomatedCompilation::Environment_wwwrun
AutomatedCompilation::Error
AutomatedCompilation::gpc_basic
AutomatedCompilation::gpc_delphi_new
AutomatedCompilation::gpc_delphi_transfer
AutomatedCompilation::ignore_output
AutomatedCompilation::include_into_source< inclusion_method >
AutomatedCompilation::include_into_source< inclusion_method >::Source_file_data
AutomatedCompilation::Naming_conventions
AutomatedCompilation::new_executable_name
AutomatedCompilation::new_executable_name::Executable_file_data
AutomatedCompilation::transfer_source_name
AutomatedCompilation::unchanged_source_file
BinomialNumerical template metafunction: Binomial(n,k>::value = n over k
BoolVarLit::BoolVal
BoolVarLit::BoolVarUI
counting_iterator
boost::graph_traits< Graphs::MutableAdjacencyGraph_ViaIntegers >
basic_line_filter
dual_use
filter_tag
multichar_tag
optimally_buffered_tag
stream
is_base_and_derived
and_
bool_
long_
or_
boost::range_const_iterator< boost::filesystem::path >
boost::range_const_iterator< const boost::filesystem::path >
boost::range_size< boost::filesystem::path >
boost::range_size< const boost::filesystem::path >
grammar
CgiHandling::chmod_program_file
CgiHandling::compilation_error
CgiHandling::conversion_error
CgiHandling::critical_program_abortion
CgiHandling::database_error
CgiHandling::different_outputs
CgiHandling::direct_access
CgiHandling::Error
CgiHandling::error_from_own_library
CgiHandling::error_from_std_library
CgiHandling::error_handling_done
CgiHandling::error_output
CgiHandling::HTML_Output
CgiHandling::indirect_access
CgiHandling::invalide_key
CgiHandling::Libc
CgiHandling::mail_error
CgiHandling::missing_hidden_field
CgiHandling::missing_public_field
CgiHandling::missing_refresh_field
CgiHandling::non_critical_program_abortion
CgiHandling::open_log_file_error
CgiHandling::open_program_file
CgiHandling::open_test_directory
CgiHandling::PublicFieldDeclarations
CgiHandling::read_correct_output
CgiHandling::remove_program
CgiHandling::save_program_file
CgiHandling::serial_name_error
CgiHandling::Submission
CgiHandling::system_call_error
CgiHandling::type_error
CgiHandling::unknown_error
CgiHandling::unknown_submission_type
CgiHandling::unknown_transfer_error
CgiHandling::unlock_impossible
CgiHandling::write_log_file_error
Clauses::Cl
Clauses::ClAsSets< Literal, Comp >
Clauses::ClAsSets< Literal, Comp >::Tautological_clause
Clauses::Error::not_a_clause
Clauses::Error_Clauses
Clauses::Litset
Clausesets::Cls
ClauseSets::ClsAsSets< Clauses, Comp >
clint_registers
CLSAdaptorMinOnes2PseudoBooleanAdaptor for clause-sets for output in DIMACS format
Combinatorics::Binom_integer_over_integer< Int >Functor for computing integral binomial coefficients; with helper function binom_integer_over_integer
Combinatorics::Descending_power< Num, Int >Functor for computation of descending powers; with helper function descending_power
Combinatorics::Error
Combinatorics::Factorial< Int >Functor for computation of the factorial function; with helper function factorial
Combinatorics_Tests::test_binom_integer_over_integer< Binom_integer_over_integer >
Combinatorics_Tests::test_descending_power< Descending_power >
Combinatorics_Tests::test_factorial< Factorial >
Compiler
Compiler_Output
ConceptDefinitions::AbstractSpecifier_concept< AbstrSpec >
ConceptDefinitions::AbstractSpecifier_tag
ConceptDefinitions::AtomicLiteral_concept< Lit >
ConceptDefinitions::AtomicLiteral_tag
ConceptDefinitions::BasicPartialAssignment_concept< PartAssig >
ConceptDefinitions::BasicPartialAssignment_tag
ConceptDefinitions::BooleanDomain_concept< B >
ConceptDefinitions::BooleanDomain_tag
ConceptDefinitions::CommutativeSemiring_concept< S >
ConceptDefinitions::CommutativeSemiring_tag
ConceptDefinitions::FiniteDomain_concept< T >
ConceptDefinitions::FiniteDomain_tag
ConceptDefinitions::FixedGlobalContainer_concept< C >
ConceptDefinitions::FixedGlobalContainer_tag
ConceptDefinitions::FullyConstructibleConcept< T >
ConceptDefinitions::GeneralLiteral_concept< Lit >
ConceptDefinitions::GeneralLiteral_tag
ConceptDefinitions::LiteralsAsPairsInfoPolicy_concept< Policy >
ConceptDefinitions::LiteralWithVariables_concept< Lit >
ConceptDefinitions::LiteralWithVariables_tag
ConceptDefinitions::OutputStreamableConcept< T >
ConceptDefinitions::Root_tag
ConceptDefinitions::Semiring_concept< S >
ConceptDefinitions::Semiring_tag
ConceptDefinitions::SetOfVariables_concept< VarSet >
ConceptDefinitions::SetOfVariables_tag
ConceptDefinitions::SignRing_concept< S >
ConceptDefinitions::SignRing_tag
ConceptDefinitions::SingletonSetOfVariables_concept< VarSet >
ConceptDefinitions::SingletonSetOfVariables_tag
ConceptDefinitions::SpecifierWithVariables_concept< Spec >
ConceptDefinitions::SpecifierWithVariables_tag
ConceptDefinitions::TotalOrderComparableConcept< T >
ConceptDefinitions::ValueLiteral_concept< Lit >
ConceptDefinitions::ValueLiteral_tag
ConceptDefinitions::ValueLiteralWithInfo_concept< Lit >
ConceptDefinitions::ValueLiteralWithInfo_tag
ConceptDefinitions::Variable_concept< Var >
ConceptDefinitions::Variable_tag
ConceptDefinitions::VariableIndexInfoPolicy_concept< Policy >
ConceptDefinitions::VariableIndexInfoPolicy_tag
ConceptDefinitions::VariableWithCounting_concept< Var >
ConceptDefinitions::VariableWithCounting_tag
ConceptDefinitions::VariableWithHistory_concept< Var >
ConceptDefinitions::VariableWithHistory_tag
ConceptDefinitions::VariableWithInfo_concept< Var >
ConceptDefinitions::VariableWithInfo_tag
Concepts_General::FullyConstructibleConcept< T >
Concepts_General::OutputStreamableConcept< T >
Concepts_General::Root_tag
Concepts_General::TotalOrderComparableConcept< T >
Concepts_Graphs::EdgeDescriptorGraphConcept< G >
Concepts_Graphs::VertexListSizeConstructibleGraphConcept< G >
Concepts_Variables::Variable_concept< Var >
Concepts_Variables::Variable_tag
Concepts_Variables::VariableDomain_concept< VarD >
Concepts_Variables::VariableDomain_tag
Concepts_Variables::VariableDomainWithAllocation_concept< VarD >
Concepts_Variables::VariableDomainWithAllocation_tag
Concepts_Variables::VariableDomainWithIterator_concept< VarD >
Concepts_Variables::VariableDomainWithIterator_tag
Concepts_Variables::VariableDomainWithIteratorAndAllocation_concept< VarD >
Concepts_Variables::VariableDomainWithIteratorAndAllocation_tag
Concepts_Variables::VariableDomainWithSizeType_concept< VarD >
Concepts_Variables::VariableDomainWithSizeType_tag
DatabaseHandler01::AllAttObj
DatabaseHandler01::Attribute
DatabaseHandler01::AttributeIterator
DatabaseHandler01::AttributeObject
DatabaseHandler01::Command
DatabaseHandler01::Connection
DatabaseHandler01::DatabaseHandler
DatabaseHandler01::Error::attribute_not_found
DatabaseHandler01::Error::bad_connection
DatabaseHandler01::Error::command_failed
DatabaseHandler01::Error::filling
DatabaseHandler01::Error::General
DatabaseHandler01::Error::inconsistency
DatabaseHandler01::Error::invalid_column_index
DatabaseHandler01::Error::invalid_index
DatabaseHandler01::Error::multiple_attributes
DatabaseHandler01::Error::no_attribute
DatabaseHandler01::Error::no_insert
DatabaseHandler01::Error::no_table
DatabaseHandler01::Error::no_tuples
DatabaseHandler01::Error::ObjectInterface
DatabaseHandler01::Error::Postgres
DatabaseHandler01::FieldIterator
DatabaseHandler01::local_get_values::val_it
DatabaseHandler01::local_TableHandler_clear::clear
DatabaseHandler01::RowIterator
DatabaseHandler01::Select
DatabaseHandler01::TableHandler
DatabaseHandler01::Value
demangle_component
demangler_engine
DLL_Algorithms::Result
Doc_Object::Latex_Object< InputType >
Domains::Boolean_T< SignRing >
Domains::Boolean_T< SignRing >::iterator
Domains::Boolean_T< SignRing >::set
Domains::FiniteDomain< Int, D >
Domains::FiniteDomain< Int, D >::iterator
Domains::FiniteDomain< Int, D >::set
dtd_access_policy
ElementAttributeHandler
eliminate_row
emailHandling::sendmail
emailHandling::sendmail::Error
emailHandling::sendmail::get_file_stat
emailHandling::sendmail::open_file
emailHandling::sendmail::set_file_stat
emailHandling::sendmail::write_file
emailHandling::SendWaitingEmails
emailHandling::SendWaitingEmails::delete_file
emailHandling::SendWaitingEmails::Error
emailHandling::SendWaitingEmails::get_file_stat
emailHandling::SendWaitingEmails::open_dir
emailHandling::SendWaitingEmails::open_file
emailHandling::SendWaitingEmails::open_log_file
emailHandling::SendWaitingEmails::read_file
emailHandling::SendWaitingEmails::send_mail
emailHandling::SendWaitingEmails::write_log_file
emailHandling::Serial_e_mail
emailHandling::Serial_e_mail::empty_dirname
emailHandling::Serial_e_mail::Error
emailHandling::Serial_e_mail::invalid_address
emailHandling::Serial_e_mail::missing_name
emailHandling::Serial_e_mail::missing_text
encoding_policy
EndlicherAutomat::Automat
EndlicherAutomat::Initialisierungsfehler
EndlicherAutomat::Transition
Environment
Error_Variables::Basis_Variables_Error
Error_Variables::CapacityOverflow
Error_Variables::InvalidName
ErrorHandling::Error
Exception_IntOverflow
exceptional_valueExceptional_value<V>::value is the exceptional value for value-type V
Executable
Extend_include_directives_Two_directoriesExtend all include directives in files below some working directories with pathes relative to a working directory
FaronsPuzzle::Test_score
FaronsPuzzle::Test_score::too_many_components
FaronsPuzzle::Test_score::wrong_dimension
FaronsPuzzle::Test_score::zero_components
FaronsPuzzle::Test_score_extended_symmetry_breaking
FaronsPuzzle::Test_score_simple_symmetry_breaking
first_valueFirst_value<V>::value is the first value for value-type V
FullyConstructibleLoConcept FullyConstructibleLo combines concepts FullyConstructibleEq and LinearOrder
FunctionHandling::Counter< Int >
FunctionHandling::DeleteObject
FunctionHandling::DeleteObjectSecond
FunctionHandling::DeleteObjectSecondNullify
FunctionHandling::Dereferenciation< Value, Pointer >
FunctionHandling::First< C >
FunctionHandling::FirstMutable< C >
FunctionHandling::in_closed_interval< T >
FunctionHandling::in_left_open_interval< T >
FunctionHandling::in_open_interval< T >
FunctionHandling::in_right_open_interval< T >
FunctionHandling::Second< C >
FunctionHandling::SecondMutable< C >
Graphs::MutableAdjacencyGraph_ViaIntegers
Implementation::M1
InfoPolicy
InfoPolicyLit
InfoPolicyTemplate
InputCls::AfterParameterError
InputCls::Construct_Cls_dynamic< Clauseset >
InputCls::EmptyClauseError
InputCls::Error_InputCls
InputCls::IsolatedNegationError
InputCls::MissingCnfError
InputCls::ParameterError
InputCls::ReadError
InputCls::SyntaxError
Int
is_separator
isSpace
IteratorHandling::Advance_Count< T >
IteratorHandling::Arithmetical_progression< Num, Int >
IteratorHandling::Arithmetical_progression< Num, Int >::iterator
IteratorHandling::Count_iterator< Int >
IteratorHandling::IteratorFirst< Iterator >Metafunction for converting iterators over pairs into iterators over the first component
IteratorHandling::IteratorFirstMutable< Iterator >
IteratorHandling::IteratorSecond< Iterator >Metafunction for converting iterators over pairs into iterators over the second component
IteratorHandling::IteratorSecondMutable< Iterator >
IteratorHandling::RangeFirstConst< Range >
IteratorHandling::RangeFirstMutable< Range >
IteratorHandling::RangeSecondConst< Range >
IteratorHandling::RangeSecondMutable< Range >
IteratorHandling_Tests::test_arithmetical_progression< Arithmetical_progression >
KlauselvStructure identifying one clause-occurrence
KMZ::Argumentstruktur
KMZ::GenArg
last_valueLast_value<V>::value is the last value for value-type V
LexicographicalSeriesPolicyClass template governing the use of series and super-series for LexicographicalEvaluation
lit
Lit_tag
Literal::Comp< Literal >
Literal::Lit< Var, Value >
Literals::InfoPolicyEmpty< Var, Dom >
Literals::InfoPolicyEmpty< Var, Dom >::Dummy
Literals::InfoPolicyVector< Info, Index >
Literals::InfoPolicyVector< Info, Index >::Link
Literals::InfoPolicyVectorOccurrences< Index >
Literals::Lit
Literals::LiteralsAsIntegers< Index, InfoPolicyVar, InfoPolicyLit, Name >
Literals::Occurrences
Literals::VariableValuePairs< PartialAssignments, SingletonVarSet, InfoPolicyTemplate >
LitSets::Litset< Literal, Comp >
litvStructure for one literal-occurrence
Matrices::QuadMatrix< i_type, v_type, dimension, st >Simple square-matrices class, wrapping arrays
Matrices::QuadMatrix< i_type, v_type, dimension, mutable_elements >
MessageHandling::Message_catalogues< catalogue_types >
MessageHandling::Messages< number_languages >
node
NumberTheory::Euler_phi_brute_force< Int >
NumberTheory::Gcd< Int, Visitor >
NumberTheory::Gcd_extended< Int, Visitor >
NumberTheory::GcdExtVisitor_empty< Int >
NumberTheory::GcdExtVisitor_output< Int >
NumberTheory::GcdVisitor_empty< Int >
NumberTheory::GcdVisitor_output< Int >
NumberTheory_Concept_test::Test_Euler_phi< Euler_phi >
NumberTheory_Concept_test::Test_gcd< Gcd >
NumberTheory_Concept_test::Test_gcd_extended< Gcd_extended, Gcd >
NumberTheory_Concept_test::Test_wrapper_gcd_extended< Int, Gcd_extended, Gcd >
Numerics::Graph_edges< Nat >
Numerics::Integer_exponentiation< base_type, exponent_type >
Numerics::Nat_1_2_diag< Nat >
Numerics::Round< Float, Return, Int_basis, Int_position >
Numerics_Tests::test_graph_edges< Graph_edges >
Numerics_Tests::test_integer_exponentiation< Integer_exponentiation >
Numerics_Tests::test_nat_1_2< Nat_1_2 >
Numerics_Tests::test_round< Round >Test function for rounding operation
OKlib::AtomicConditions::traits::value_type< T >Traits meta-function to extract the value type
OKlib::AtomicConditions::traits::value_type< AC_bool >
OKlib::Combinatorics::Hypergraphs::Generators::Accumulate_l< V, Num >Changes a vector of pairs in-place, replacing the second components by the accumulated sums
OKlib::Combinatorics::Hypergraphs::Generators::Arithmetic_progression< Integer >An arithmetic progression as a container
OKlib::Combinatorics::Hypergraphs::Generators::Arithmetical_progressions< Int >All arithmetical progressions in {1,...,n}, in lexicographical order (in iterator-fashion, without storage)
OKlib::Combinatorics::Hypergraphs::Generators::Arithmetical_progressions_colex< Int >All arithmetical progressions in {1,...,n}, in colexicographical order (in iterator-fashion, without storage)
OKlib::Combinatorics::Hypergraphs::Generators::Arithprog_finish< Hyperedges, SetSystem, Int >Functor which produces the list of arithmetic progressions of length k in {1, ..., n} finishing in n
OKlib::Combinatorics::Hypergraphs::Generators::First_prime_numbers< UInt >Functor for computing the first n prime numbers as a std::vector
OKlib::Combinatorics::Hypergraphs::Generators::GreenTao< UInt >Class for creating GreenTao hypergraphs
OKlib::Combinatorics::Hypergraphs::Generators::Hindman_k2< UInt >Functor for creating Hindman hypergraphs with k=2
OKlib::Combinatorics::Hypergraphs::Generators::Iterator_arithmetic_progression< Integer >Iterator to iterate through the elements of an arithmetical progression
OKlib::Combinatorics::Hypergraphs::Generators::Pd_arithmetical_progressions< Int >All palindromised arithmetical progressions in {1,...,n} (in iterator-fashion, without storage)
OKlib::Combinatorics::Hypergraphs::Generators::Pd_arithprog_ohg< Int >Functor for creating palindromic vdW-hypergraphs
OKlib::Combinatorics::Hypergraphs::Generators::Sizes_strata_indmon< Vertices, Hyperedges >Given an ordered hypergraph, compute the sizes of the strata given by the maximum element of hyperedges
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::Bounded_transversals_bv< SetSystem >Functor, which for a given set system G and a bound B computes (essentially) all transversals of G of size at most B
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::DirectStratification< SetSystem, UInt >Transforms a set-system into a standardised stratified set-system according to the order on the vertices
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::Minimum_transversals_mongen< SetSystem, Generator, Output >Computing all minimum transversals for hypergraphs gen(N0+1), ..., gen(Nmax)
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::TransversalPredicate< SetSystem >Unary predicate for checking whether a set of vertices is a transversal of a given hypergraph
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::TrivialOutput< SetSystem >Functor for just outputting the number of minimum transversals (together with the number of vertices and the minimum size of a transversal)
OKlib::Combinatorics::Hypergraphs::Transversals::Bounded::Wrapper
OKlib::Combinatorics::traits::range_type< T >Traits meta-function to extract the range type
OKlib::Concepts::Assignable< T >Concept Assignable according to Table 64 in the standard
OKlib::Concepts::Assignable_Archetype
OKlib::Concepts::Assignable_tag
OKlib::Concepts::AtomicCondition< AC >Concept for basic atomic conditions
OKlib::Concepts::AtomicCondition_Archetype
OKlib::Concepts::AtomicCondition_Archetype::value_type
OKlib::Concepts::AtomicCondition_tag
OKlib::Concepts::BasicRequirements< T >Root of the concept hierarchy for the library, requiring a concept tag and const correctness
OKlib::Concepts::BasicRequirements_Archetype
OKlib::Concepts::BasicRequirements_tag
OKlib::Concepts::ConceptsBase_tag
OKlib::Concepts::ConstCorrect< T >Concept ConstCorrect: Semantical requirement, that operations allowed for const objects maintain substitution-equivalence
OKlib::Concepts::ConstCorrect_Archetype
OKlib::Concepts::ConstCorrect_tag
OKlib::Concepts::ConstructibleCAEq< T >Concept ConstructibleCAEq adds Assignable to ConstructibleCEq
OKlib::Concepts::ConstructibleCAEq_Archetype
OKlib::Concepts::ConstructibleCAEq_Archetype::convertible_to_bool
OKlib::Concepts::ConstructibleCAEq_Axiom_assign_eq< T >Checks whether after assignment x = b we have x == b
OKlib::Concepts::ConstructibleCAEq_basic_test_one_object< T >Basic test for ConstructibleCAEq, given one object
OKlib::Concepts::ConstructibleCAEq_basic_test_three_objects< T >Basic test for ConstructibleCAEq, given three objects
OKlib::Concepts::ConstructibleCAEq_basic_test_two_objects< T >Basic test for ConstructibleCAEq, given two objects
OKlib::Concepts::ConstructibleCAEq_tag
OKlib::Concepts::ConstructibleCEq< T >Concept ConstructibleCEq adds CopyConstructible to FullyEqualityComparable
OKlib::Concepts::ConstructibleCEq_Archetype
OKlib::Concepts::ConstructibleCEq_Archetype::convertible_to_bool
OKlib::Concepts::ConstructibleCEq_Axiom_copy_eq< T >Checks for object a whether for x copy-constructed from a we have x == a
OKlib::Concepts::ConstructibleCEq_basic_test_one_object< T >Basic test for ConstructibleCEq, given one object
OKlib::Concepts::ConstructibleCEq_basic_test_three_objects< T >Basic test for ConstructibleCEq, given three objects
OKlib::Concepts::ConstructibleCEq_basic_test_two_objects< T >Basic test for ConstructibleCEq, given two objects
OKlib::Concepts::ConstructibleCEq_tag
OKlib::Concepts::ConstructibleDEq< T >Concept ConstructibleDEq adds DefaultConstructible to FullyEqualityComparable
OKlib::Concepts::ConstructibleDEq_Archetype
OKlib::Concepts::ConstructibleDEq_Archetype::convertible_to_bool
OKlib::Concepts::ConstructibleDEq_Axiom_default_eq< T >Checks whether two default constructed objects are equal
OKlib::Concepts::ConstructibleDEq_basic_test_no_object< T >Basic test for ConstructibleDEq (not requiring any object)
OKlib::Concepts::ConstructibleDEq_basic_test_one_object< T >Basic test for ConstructibleDEq, given one object
OKlib::Concepts::ConstructibleDEq_basic_test_three_objects< T >Basic test for ConstructibleDEq, given three objects
OKlib::Concepts::ConstructibleDEq_basic_test_two_objects< T >Basic test for ConstructibleDEq, given two objects
OKlib::Concepts::ConstructibleDEq_tag
OKlib::Concepts::Container< C >Concept Container according to Table 65 in the standard
OKlib::Concepts::Container_Archetype
OKlib::Concepts::Container_Archetype::const_iterator
OKlib::Concepts::Container_Archetype::const_iterator::internal
OKlib::Concepts::Container_Archetype::const_iterator::reference
OKlib::Concepts::Container_Archetype::const_iterator::value_type
OKlib::Concepts::Container_Archetype::const_reference
OKlib::Concepts::Container_Archetype::iterator
OKlib::Concepts::Container_Archetype::iterator::internal
OKlib::Concepts::Container_Archetype::iterator::reference
OKlib::Concepts::Container_Archetype::iterator::value_type
OKlib::Concepts::Container_Archetype::reference
OKlib::Concepts::Container_Archetype::value_type
OKlib::Concepts::Container_tag
OKlib::Concepts::convertible_to_boolFully constructible class, implicitely convertible to bool
OKlib::Concepts::CopyConstructible< T >Concept CopyConstructible
OKlib::Concepts::CopyConstructible_Archetype
OKlib::Concepts::CopyConstructible_tag
OKlib::Concepts::DefaultConstructible< T >Concept DefaultConstructible
OKlib::Concepts::DefaultConstructible_Archetype
OKlib::Concepts::DefaultConstructible_tag
OKlib::Concepts::Destructible< T >Concept Destructible (an obvious addition to the standard)
OKlib::Concepts::Destructible_Archetype
OKlib::Concepts::Destructible_tag
OKlib::Concepts::EqualityComparable< T >Concept EqualityComparable according to Table 28 in the standard (plus const-correctness)
OKlib::Concepts::EqualityComparable_Archetype
OKlib::Concepts::EqualityComparable_Archetype::convertible_to_bool
OKlib::Concepts::EqualityComparable_Axiom_reflexivity< T >Checks for objects a whether a == a holds
OKlib::Concepts::EqualityComparable_Axiom_symmetry< T >Checks for objects a, b whether either (a == b and b == a) holds or (not (a == b) and not (b == a))
OKlib::Concepts::EqualityComparable_Axiom_transitivity< T >Checks for objects a, b, c with a == b and b == c, whether a == c holds
OKlib::Concepts::EqualityComparable_basic_test_one_object< T >Basic test for EqualityComparable, given one object
OKlib::Concepts::EqualityComparable_basic_test_three_objects< T >Basic test for EqualityComparable, given two objects
OKlib::Concepts::EqualityComparable_basic_test_two_objects< T >Basic test for EqualityComparable, given two objects
OKlib::Concepts::EqualityComparable_tag
OKlib::Concepts::EqualitySubstitutable< T >Concept EqualitySubstitutable: Refines EqualityComparable with the requirement, that equal entities are substitution-equivalent
OKlib::Concepts::EqualitySubstitutable_Archetype
OKlib::Concepts::EqualitySubstitutable_tag
OKlib::Concepts::ForwardIterator< Iterator >Concept ForwardIterator according to the standard
OKlib::Concepts::ForwardIterator_Archetype
OKlib::Concepts::ForwardIterator_Archetype::convertible_to_bool
OKlib::Concepts::ForwardIterator_Archetype::internal
OKlib::Concepts::ForwardIterator_Archetype::reference
OKlib::Concepts::ForwardIterator_Archetype::value_type
OKlib::Concepts::ForwardIterator_tag
OKlib::Concepts::FullyConstructible< T >Concept FullyConstructible: All four special member functions are available
OKlib::Concepts::FullyConstructible_Archetype
OKlib::Concepts::FullyConstructible_tag
OKlib::Concepts::FullyConstructibleEq< T >Concept FullyConstructibleEq combines concepts FullyEqualityComparable and FullyConstructible (plus natural semantical requirements enabled by equality)
OKlib::Concepts::FullyConstructibleEq_Archetype
OKlib::Concepts::FullyConstructibleEq_Archetype::convertible_to_bool
OKlib::Concepts::FullyConstructibleEq_basic_test_no_object< T >Basic test for FullyConstructibleEq (not requiring any object)
OKlib::Concepts::FullyConstructibleEq_basic_test_one_object< T >Basic test for FullyConstructibleEq, given one object
OKlib::Concepts::FullyConstructibleEq_basic_test_three_objects< T >Basic test for FullyEqualityComparable, given three objects
OKlib::Concepts::FullyConstructibleEq_basic_test_two_objects< T >Basic test for FullyEqualityComparable, given two objects
OKlib::Concepts::FullyConstructibleEq_tag
OKlib::Concepts::FullyEqualityComparable< T >Concept FullyEqualityComparable: == and !=
OKlib::Concepts::FullyEqualityComparable_Archetype
OKlib::Concepts::FullyEqualityComparable_Axiom_equal_vs_unequal< T >Checks for objects a, b whether either (a == b and not (a != b)) or (not (a == b) and a != b) holds
OKlib::Concepts::FullyEqualityComparable_basic_test_one_object< T >Basic test for FullyEqualityComparable, given one object
OKlib::Concepts::FullyEqualityComparable_basic_test_three_objects< T >Basic test for FullyEqualityComparable, given three objects
OKlib::Concepts::FullyEqualityComparable_basic_test_two_objects< T >Basic test for FullyEqualityComparable, given two objects
OKlib::Concepts::FullyEqualityComparable_tag
OKlib::Concepts::FullyLessThanComparable< T >Concept FullyLessThanComparable: <, >, <=, >=
OKlib::Concepts::FullyLessThanComparable_Archetype
OKlib::Concepts::FullyLessThanComparable_Axiom_greater_equal_negative< T >
OKlib::Concepts::FullyLessThanComparable_Axiom_greater_equal_positive< T >
OKlib::Concepts::FullyLessThanComparable_Axiom_greater_negative< T >
OKlib::Concepts::FullyLessThanComparable_Axiom_greater_positive< T >
OKlib::Concepts::FullyLessThanComparable_Axiom_less_equal_negative< T >
OKlib::Concepts::FullyLessThanComparable_Axiom_less_equal_positive< T >
OKlib::Concepts::FullyLessThanComparable_basic_test_one_object< T >
OKlib::Concepts::FullyLessThanComparable_tag
OKlib::Concepts::HasConceptTag< T >Boolean metafunction: HasConceptTag<T> is true iff T has a nested type concept_tag which is a concept tag
OKlib::Concepts::implementation_has_concept_tag::is_concept_tag
OKlib::Concepts::implementation_has_concept_tag::is_concept_tag< true, T >
OKlib::Concepts::IncludeDirective< IncDir >
OKlib::Concepts::IncludeDirective_Archetype
OKlib::Concepts::IncludeDirective_Archetype::string_type
OKlib::Concepts::IncludeDirective_tag
OKlib::Concepts::InputIterator< Iterator >Concept InputIterator according to the standard
OKlib::Concepts::InputIterator_Archetype
OKlib::Concepts::InputIterator_Archetype::convertible_to_bool
OKlib::Concepts::InputIterator_Archetype::internal
OKlib::Concepts::InputIterator_Archetype::reference
OKlib::Concepts::InputIterator_Archetype::value_type
OKlib::Concepts::InputIterator_tag
OKlib::Concepts::IsConceptTag< Tag >Boolean metafunction: IsConceptTag<Tag> is true iff Tag is strictly derived from OKlib::Concepts::ConceptsBase_tag
OKlib::Concepts::IsTagModel< T, concept_tag >Boolean metafunction: IsTagModel<T, tag> is true iff the concept tag of T is derived from (or equal to) tag
OKlib::Concepts::LessThanComparable< T >LessThanComparable according to Table 29 in the standard (plus const-correctness)
OKlib::Concepts::LessThanComparable_Archetype
OKlib::Concepts::LessThanComparable_Archetype::convertible_to_bool
OKlib::Concepts::LessThanComparable_Axiom_asymmetry< T >Checks that not at the same time a < b and b < a holds
OKlib::Concepts::LessThanComparable_Axiom_equivalence_reflexivity< T >Checks for objects a whether a ~ a holds
OKlib::Concepts::LessThanComparable_Axiom_equivalence_symmetry< T >Checks for objects a whether a ~ b => b ~ a holds
OKlib::Concepts::LessThanComparable_Axiom_equivalence_transitivity< T >Checks for objects a, b, c with a ~ b and b ~ c, whether a ~ c holds
OKlib::Concepts::LessThanComparable_Axiom_irreflexivity< T >Checks for objects a whether not (a < a) holds
OKlib::Concepts::LessThanComparable_Axiom_transitivity< T >Checks for objects a, b, c with a < b and b < c, whether a < c holds
OKlib::Concepts::LessThanComparable_basic_test_one_object< T >Basic test for LessThanComparable, given one object
OKlib::Concepts::LessThanComparable_basic_test_three_objects< T >Basic test for LessThanComparable, given three objects
OKlib::Concepts::LessThanComparable_basic_test_two_objects< T >Basic test for LessThanComparable, given two objects
OKlib::Concepts::LessThanComparable_tag
OKlib::Concepts::LinearOrder< T >Concept LinearOrder: <, >, <=, >= and ==, !=
OKlib::Concepts::LinearOrder_Archetype
OKlib::Concepts::LinearOrder_Axiom_negative< T >
OKlib::Concepts::LinearOrder_Axiom_positive< T >
OKlib::Concepts::LinearOrder_basic_test_one_object< T >
OKlib::Concepts::LinearOrder_tag
OKlib::Concepts::Literals< Lit >Basic literals concept
OKlib::Concepts::Literals_Archetype
OKlib::Concepts::Literals_tag
OKlib::Concepts::MultiPassInputIterator< Iterator >Concept MultiPassInputIterator according to Boost
OKlib::Concepts::MultiPassInputIterator_Archetype
OKlib::Concepts::MultiPassInputIterator_tag
OKlib::Concepts::OutputStreamable< X >
OKlib::Concepts::OutputStreamable_Archetype
OKlib::Concepts::OutputStreamable_tag
OKlib::Concepts::ResultElement< Res >Root class for the concept hierarchy about result elements (requiring only types)
OKlib::Concepts::ResultElement_Archetype
OKlib::Concepts::ResultElement_basic_test< Res >Test function for Concepts::ResultElement, which just checks the syntactic requirements
OKlib::Concepts::ResultElement_tag
OKlib::Concepts::ResultElementWithName< Res >Refines concept ResultElementWithOrder by adding the possibility to construct result elements with a given name, and to query this name. The order on such result elements must be given by the natural order on the names
OKlib::Concepts::ResultElementWithName_Archetype
OKlib::Concepts::ResultElementWithName_Archetype::string_type
OKlib::Concepts::ResultElementWithName_Archetype::string_type::convertible_to_bool
OKlib::Concepts::ResultElementWithName_Axiom_name_equality< Res >Sub-test function for Concepts::ResultElementWithName, testing that equal names yield equal result elements
OKlib::Concepts::ResultElementWithName_Axiom_name_lessthan< Res >Sub-test function for Concepts::ResultElementWithName, testing that if the name is less, then the result element is less
OKlib::Concepts::ResultElementWithName_basic_test< Res >Test function for Concepts::ResultElementWithName, checking the syntax and that the order on the names carries over to the result elements
OKlib::Concepts::ResultElementWithName_tag
OKlib::Concepts::ResultElementWithOrder< Res >Refines concept ResultElement by requiring a linear order on result elements
OKlib::Concepts::ResultElementWithOrder_Archetype
OKlib::Concepts::ResultElementWithOrder_Archetype::convertible_to_bool
OKlib::Concepts::ResultElementWithOrder_basic_test< Res >Test function for Concepts::ResultElementWithOrder, checking syntax and applying the basic tests for linear order using one object
OKlib::Concepts::ResultElementWithOrder_tag
OKlib::Concepts::Test_ConceptTag_T< ConceptTag >
OKlib::Concepts::Test_ContainerConcept< ContainerConcept >Test for a container concept by instantiating container-types from the standard library
OKlib::Concepts::Test_HasConceptTag_T< HasConceptTag >
OKlib::Concepts::Test_IsConceptTag_Tag< IsConceptTag >
OKlib::Concepts::Test_IsTagModel_T_concept_tag< IsTagModel >
OKlib::Concepts::TestIndex::assert_index< index_type, is_signed >
OKlib::Concepts::TestIndex::assert_index< index_type, true >
OKlib::Concepts::tests::AtomicCondition_basic< AC >Basic tests for models of concept AtomicCondition
OKlib::Concepts::tests::Literals_basic< Lit >Basic tests for models of concept Literals
OKlib::Concepts::traits::concept_tag< T >Traits metafunction, which returns no type in case concept_tag of T is not defined
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_int >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_long_int >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_short_int >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_signed_char >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_unsigned_char >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_unsigned_int >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_unsigned_long_int >
OKlib::Concepts::traits::concept_tag< ::OKlib::Variables::Variables_unsigned_short_int >
OKlib::Concepts::traits::concept_tag< OKlib::AtomicConditions::AC_bool >
OKlib::Concepts::traits::implementation_concept_tag::get_concept_tag
OKlib::Concepts::traits::implementation_concept_tag::get_concept_tag< true, T >
OKlib::Concepts::Variables< Var >Basic variables concept
OKlib::Concepts::Variables_Archetype
OKlib::Concepts::Variables_Axiom_singular_variables_false< Var >Test function for Concepts::Variables, checking that default-created variables are singular
OKlib::Concepts::Variables_Axiom_singular_variables_identity< Var >Test function for Concepts::Variables, checking that two singular variables are identical
OKlib::Concepts::Variables_basic_test< Var >Basic test function for Concepts::Variables, which checks syntax, singularity of default-constructed variables, and applies the basic test for the linear order
OKlib::Concepts::Variables_tag
OKlib::Concepts::VariablesAsIndex< Var >Refinement of concept Concepts::VariablesWithIndex, requiring a constructor of variables from index values
OKlib::Concepts::VariablesAsIndex_Archetype
OKlib::Concepts::VariablesAsIndex_Axiom< Var >Test function for concept Concepts::VariablesAsIndex, checks that variables constructed from an index return the same index
OKlib::Concepts::VariablesAsIndex_basic_test< Var >Basic test function for concept Concepts::VariablesAsIndex, checking syntax, applying the basic test for Concepts::VariablesWithIndex, and checking creation of variables from indices
OKlib::Concepts::VariablesAsIndex_tag
OKlib::Concepts::VariablesLiterals_tag< Var_tag, Lit_tag >Tags for types which are used as variables and as literals
OKlib::Concepts::VariablesWithIndex< Var >Refinement of concept Concepts::Variables, adding an index_type, and variables can be implicitely converted to this index type
OKlib::Concepts::VariablesWithIndex_Archetype
OKlib::Concepts::VariablesWithIndex_Axiom_index_identity< Var >Test function for concept Concepts::VariablesWithIndex, checking that variables with identical indices are identical
OKlib::Concepts::VariablesWithIndex_Axiom_index_nonnegative< Var >Test function for concept Concepts::VariablesWithIndex, checking that indices of variables are not negative
OKlib::Concepts::VariablesWithIndex_Axiom_index_zero_negative< Var >Test function for concept Concepts::VariablesWithIndex, checking that if the index is zero, then the variable is singular
OKlib::Concepts::VariablesWithIndex_Axiom_index_zero_positive< Var >Test function for concept Concepts::VariablesWithIndex, checking that singular variables have index 0
OKlib::Concepts::VariablesWithIndex_basic_test< Var >Basis text function for concept Concepts::VariablesWithIndex, checking syntax and that singular variables have index 0, and applying the basic test for concept Concept::Variables
OKlib::Concepts::VariablesWithIndex_tag
OKlib::Concepts::WithConceptTag< T >Basic internal concept, statically asserting the concept tag
OKlib::Concepts::WithConceptTag_Archetype
OKlib::Concepts::WithConceptTag_tag
OKlib::DPv::Clause
OKlib::DPv::Clause_set
OKlib::DPv::Dimacs
OKlib::DPv::DimacsParser< ClauseSet >
OKlib::DPv::Error::Illogical
OKlib::DPv::Error::Unknown_result
OKlib::DPv::Input::FStream
OKlib::DPv::Literal
OKlib::DPv::LiteralSet
OKlib::DPv::Output::FStream
OKlib::DPv::ParserLiteral
OKlib::DPv::Stat_comp< T >
OKlib::DPv::Test_DimacsParser_ClauseSet< DimacsParser >
OKlib::DPv::Test_ParserLiteral< ParserLiteral >
OKlib::DPv::Variable
OKlib::DPv::VariableSet
OKlib::GeneralInputOutput::BasicCounter< Ch >Extension of the filter boost::iostreams::basic_counter with a member function for the number of characters read from the current line
OKlib::GeneralInputOutput::BasicCounter< Ch >::category
OKlib::GeneralInputOutput::BasicIndentLines< Ch, Alloc >Filter for iostreams indenting each line
OKlib::GeneralInputOutput::BasicNullStream< Char >BasicNullStream<Char> is an output stream discarding all output
OKlib::GeneralInputOutput::DirectoryIteratorClass which provides recursive input iterators over the non-directory files within a directory
OKlib::GeneralInputOutput::OStreamDescriptorConcrete type for a pair consisting of a label and a string, which describe some output-stream
OKlib::GeneralInputOutput::OStreamDescriptor::EmptyAfterEqDescription
OKlib::GeneralInputOutput::OStreamDescriptor::EmptyDescription
OKlib::GeneralInputOutput::OStreamDescriptor::EmptyName
OKlib::GeneralInputOutput::OStreamDescriptor::NoEqInDescription
OKlib::GeneralInputOutput::OStreamDescriptor::NonEmptyName
OKlib::GeneralInputOutput::OStreamDescriptor::OStreamDescriptorError
OKlib::GeneralInputOutput::OStreamDescriptor::UnknownDescription
OKlib::GeneralInputOutput::OStreamMultiplexerClass for creating ostreams which comprise described ostreams
OKlib::GeneralInputOutput::Test_BasicCounter< BasicCounter >Testing a filter for counting characters and lines
OKlib::GeneralInputOutput::Test_BasicIndentLines< BasicIndentLines >Testing a filter for indenting lines
OKlib::GeneralInputOutput::Test_DirectoryIterator< DirectoryIterator >Testing the concept of a directory iterator
OKlib::GeneralInputOutput::Test_NullStream< NullStream >Test an output stream discarding all characters
OKlib::GeneralInputOutput::Test_OStreamDescriptor< OStreamDescriptor >Test models of OStreamDescriptor
OKlib::GeneralInputOutput::Test_OStreamMultiplexer< OStreamMultiplexer >Testing an OStreamMulitplexer model
OKlib::GeneralInputOutput::TestDataProvides the names of directories and files within the TestDirectory and their status as directory (1) or file (0)
OKlib::GraphDecomposition::Test_Width_elimination_sequence< Width_elimination_sequence, Graph >
OKlib::GraphDecomposition::Treewidth_by_enumerating_elimination_sequences< Graph >
OKlib::GraphDecomposition::Width_elimination_sequence< EliminationSequence, Graph >Functor computing the width induced by an elimination sequence
OKlib::HypergraphColouring::Greedy_colouring< UndirectedGraph >Evaluation of greedy colouring for a graph
OKlib::HypergraphColouring::Out_degree_order< Graph >Order predicate to compare vertex descriptors according to their degrees
OKlib::InjectivityConstraints::TrivialAllDifferent< PASS >Very first prototype for an all-different constraint (just returning true or false)
OKlib::InputOutput::AllEqual< Object >Predicate-functor which is constant false for all inputs
OKlib::InputOutput::ClauseInputError
OKlib::InputOutput::ClauseOutputError
OKlib::InputOutput::CLSAdaptorDIMACSFileOutput< Int, String, AdaptorStatistics >Adaptor for clause-sets for file-output in DIMACS format
OKlib::InputOutput::CLSAdaptorDIMACSOutput< Int, String, AdaptorStatistics >Adaptor for clause-sets for output in DIMACS format
OKlib::InputOutput::CLSAdaptorFilter< Int, String, CLSAdaptor >
OKlib::InputOutput::CLSAdaptorFullStatistics< Int, String >Adaptor for clause-sets which gathers "all" statistics
OKlib::InputOutput::CLSAdaptorPreciseStatistics< Int, String >Adaptor for clause-sets gathering (basic) statistics in all forms
OKlib::InputOutput::CLSAdaptorRandomShuffle< Int, String, RandomGenerator, OutputCLSAdaptor >Adaptor which sorts the clause-list given to it
OKlib::InputOutput::CLSAdaptorSortByClauseLength< Int, String, OutputCLSAdaptor, OrderComparator >Adaptor which sorts the clause-list given to it
OKlib::InputOutput::CLSAdaptorSortByClauseLengthDescending< Int, String, OutputCLSAdaptor, OrderComparator >
OKlib::InputOutput::CLSAdaptorStatistics< Int, String >Adaptor for clause-sets which only gathers the basic ncl-statistics
OKlib::InputOutput::CommentInputError
OKlib::InputOutput::DimacsInputError
OKlib::InputOutput::DimacsOutputError
OKlib::InputOutput::FullStatistics< Int >Class for gathering "all" statistics about input/output (especially in DIMACS format)
OKlib::InputOutput::InputError
OKlib::InputOutput::InputOutputError
OKlib::InputOutput::IStreamError
OKlib::InputOutput::List2DIMACSOutputTransfers a clause-set as a sequence of sequences to an output-stream in Dimacs format
OKlib::InputOutput::ListTransfer< CLSAdaptor >Transfers a sequence of sequences of literals to a CLSAdaptor
OKlib::InputOutput::LiteralReadingExtended< Int >Extended policy, which allows arbitrary strings as variables
OKlib::InputOutput::LiteralReadingStrict< Int >Standard policy for reading a Dimacs-literal
OKlib::InputOutput::OStreamError
OKlib::InputOutput::OutputError
OKlib::InputOutput::ParameterInputError
OKlib::InputOutput::ParameterOutputError
OKlib::InputOutput::RawDimacsCLSAdaptor< Lit, ClauseContainer, Int, String >Adaptor which turns Dimacs input into a std::vector<std::vector<int> >
OKlib::InputOutput::RawDimacsCLSAdaptorSets< Lit, ClauseContainer, Int, String >Adaptor which turns Dimacs input into a std::set<std::set<int> >
OKlib::InputOutput::StandardDIMACSInput< CLSAdaptor, LiteralReadingPolicy, Int >Parsing an input stream containing a cnf formula in DIMACS format and transferring it to a CLS-adaptor
OKlib::InputOutput::Statistics< Int >Class for gathering statistics about input/output (especially in DIMACS format)
OKlib::InputOutput::Test_StandardDIMACSInput< StandardDIMACSInput >Test the standard DIMACS cnf reader
OKlib::Iterators::counting_iterator< Incrementable, CategoryOrTraversal, Difference >Counting_iterator<Incrementable> extends boost::counting_iterator<Incrementable> by providing an implicit conversion from Incrementable to counting_iterator
OKlib::Iterators::Test_counting_iterator< counting_iterator >Testing the extended counting iterator
OKlib::LatinSquares::SudokuProblem< Box_size, BijectivityConstraint >First prototype for an alliance of active clause-sets for Sudoku
OKlib::LatinSquares::Trivial_reduction_Sudoku< SudokuP >Trivial reduction for a Sudoku problem
OKlib::Literals::traits::cond_type< T >Traits meta-function to extract the condition type
OKlib::Literals::traits::cond_type< Literals_int >
OKlib::Literals::traits::cond_type< Literals_long_int >
OKlib::Literals::traits::cond_type< Literals_short_int >
OKlib::Literals::traits::cond_type< Literals_signed_char >
OKlib::Literals::traits::var_type< L >Traits meta-function to extract the variables type
OKlib::Literals::traits::var_type< Literals_int >
OKlib::Literals::traits::var_type< Literals_long_int >
OKlib::Literals::traits::var_type< Literals_short_int >
OKlib::Literals::traits::var_type< Literals_signed_char >
OKlib::Matrices::Is_equal< Matrix >Functor-predicate for checking whether two matrices in the uBLAS-sense are equal
OKlib::Matrices::Is_self_dual< Matrix, PermutationsGenerator >Functor-predicate for checking whether a matrix in the uBLAS-sense is self_dual (is isomorphic to its transposition)
OKlib::Matrices::Is_self_polar< Matrix, PermutationsGenerator >Functor-predicate for checking whether a matrix in the uBLAS-sense is self_polar (is isomorphic to a symmetric matrix)
OKlib::Matrices::Is_symmetric< Matrix >Functor-predicate for checking whether a matrix in the uBLAS-sense is symmetric
OKlib::Messages::demo::Message_1Speaks only english, in basic and full level
OKlib::Messages::demo::Message_2Speaks english and german, both only in basic level
OKlib::Messages::demo::Message_3Speaks english and german, both in basic level, and english also in full level : IMPOSSIBLE
OKlib::Messages::demo::Message_3_variationSpeaks english in basic level and german in full level
OKlib::Messages::L< language >L<language>, where language is an element of Languages, is a tagging class representing this language
OKlib::Messages::L< de_AT >
OKlib::Messages::L< de_CH >
OKlib::Messages::L< de_DE >
OKlib::Messages::L< en_AU >
OKlib::Messages::L< en_CA >
OKlib::Messages::L< en_US >
OKlib::Messages::L< fr_CA >
OKlib::Messages::L< fr_CH >
OKlib::Messages::L< fr_FR >
OKlib::Messages::LanguageNameFunctor to translate language names into language constants
OKlib::Messages::LanguageName::UninterpretableLanguageName
OKlib::Messages::messages::LanguageNamesOutputs a description for all provided languages (more precisely, locales)
OKlib::Messages::messages::LevelNamesOutputs a description for all provided levels
OKlib::Messages::MessagesBaseThe polymorphic base class for message classes
OKlib::Messages::MessagesLinesBasic messages class, extending MessagesBase by additionally providing virtual functions for line-start and line-end
OKlib::Messages::MessagesPrePostExtends MessagesLines by managing two strings for prefixing and postfixing lines
OKlib::Messages::S< level >S<level>, where level is an element of Strata, is a tagging class representing this level
OKlib::Messages::S< Extensive >
OKlib::Messages::S< Full >
OKlib::Messages::Utilities::FileIdentificationBasic source-code-file information
OKlib::Messages::Utilities::LineIdentificationLine number indentification (for source-code files)
OKlib::Messages::Utilities::TimeDateStandardImplementationMessage objects for the preferred date and time representation by the system
OKlib::Messages::Utilities::TrivialMessage< X >Message object TrivialMessage<X>(x) prints x
OKlib::Messages::Utilities::TrivialMessageC< X >Message object TrivialMessageC<X>(x) prints x
OKlib::MetaProgramming::False< T >
OKlib::MetaProgramming::Power< b, e >Numerical template metafunction: Power<b,e>::value = b^e
OKlib::MetaProgramming::Power< b,(unsigned) 0 >
OKlib::MetaProgramming::property_tag
OKlib::MetaProgramming::Test_Binomial< Binom >Testing the compiler binomial function (ad-hoc tests)
OKlib::MetaProgramming::Test_False_T< False >
OKlib::MetaProgramming::Test_Power< Power >Testing the compiler power function (ad-hoc tests)
OKlib::MetaProgramming::Test_True_T< True >
OKlib::MetaProgramming::True< T >
OKlib::OrderRelations::Equivalence< LessThanRelation >Defines a ~ b as not (a < b) and not (b < a)
OKlib::OrderRelations::GreaterEqualThan< LessThanRelation >Defines a >= b as not (a < b)
OKlib::OrderRelations::GreaterThan< LessThanRelation >Defines a > b as b < a
OKlib::OrderRelations::LessEqualThan< LessThanRelation >Defines a <= b as not (b < a)
OKlib::Parallelism::Counter< N >Functor class, counting a counter down, to simulate some operation
OKlib::Parallelism::CounterWithMutex< N >Publically derived from Counter, provides mutex-functionality
OKlib::Parallelism::Counting_and_writingConstructed with a total count and an output-filestream
OKlib::Parallelism::Test_Counter< Counter >
OKlib::Parser::ParserBase< CharT, ParseIterator_ >
OKlib::Parser::Test_ParsingResult_Positional< ParseIterator >
OKlib::Parser::Test_ParsingString< Parser >Subtest for testing whether a parser derived from OKlib::Parser::ParserBase parses successfully a string or not
OKlib::PartialAssignments::MultiPASS< Values, NumVar, Var >Very first prototype for a set-valued partial assignment
OKlib::Programming::Sequences::Common_part< Range1, Range2, Implementation_common_part_self >
OKlib::Programming::Sequences::Common_part< Range1, Range2, Implementation_common_part_std >
OKlib::Programming::Sequences::Common_part_c< Range1, Range2, Implementation_common_part_self >
OKlib::Programming::Sequences::Common_part_c< Range1, Range2, Implementation_common_part_std >
OKlib::Programming::Sequences::Common_part_c_res_t< Range1, Range2 >
OKlib::Programming::Sequences::Common_part_res_t< Range1, Range2 >
OKlib::Programming::Sequences::Implementation_common_part
OKlib::Programming::Sequences::Implementation_common_part_self
OKlib::Programming::Sequences::Implementation_common_part_std
OKlib::Programming::Sequences::tests::CommonPart< CP, ImpPol >Testing functors for computing longest common initial sequences
OKlib::Programming::Utilities::OrderRelations::Colexicographical_comparison< Container >Predicate-functor for colexicographical comparison of containers
OKlib::Programming::Utilities::OrderRelations::SizeLessThan< LessThanRelation >Predicate-functor, which turns a container-comparator into one which compares first the sizes
OKlib::Refactoring::BaseTestDataProvides typedefs common to both IncludeDirectiveTestData, PrefixTestData and ProgramTestData
OKlib::Refactoring::CheckTranslation
OKlib::Refactoring::ExtendIncludeDirectives< APC, UniquenessPolicy >Functor for adding suitable prefixes to the include directives of an istream
OKlib::Refactoring::ExtendIncludeDirectivesTwoDirectories< Path, UniquenessPolicy >
OKlib::Refactoring::ExtendIncludeDirectivesTwoRanges< ReferenceRange, WorkingRange, UniquenessPolicy, HandleProgramRepresentation >Extends the include directives from a range of program representations according to a range of prefixes
OKlib::Refactoring::IncludeDirective< String >Representation of one include directive
OKlib::Refactoring::IncludeDirectiveTestDataProvides data for include directives in flat directory directory structure and deep directory structure
OKlib::Refactoring::IncludeParsingGrammarDefines grammar of a C++ program as far as necessary for parsing include directives in a file
OKlib::Refactoring::IncludeParsingGrammar::action_blanks_hash
OKlib::Refactoring::IncludeParsingGrammar::action_blanks_include
OKlib::Refactoring::IncludeParsingGrammar::action_context
OKlib::Refactoring::IncludeParsingGrammar::action_header_file
OKlib::Refactoring::IncludeParsingGrammar::action_include_form
OKlib::Refactoring::IncludeParsingGrammar::action_other
OKlib::Refactoring::IncludeParsingGrammar::action_push_back
OKlib::Refactoring::IncludeParsingGrammar::definition< ScannerT >
OKlib::Refactoring::NoExtension
OKlib::Refactoring::NonUniqueExtension
OKlib::Refactoring::OverwriteFiles
OKlib::Refactoring::PrefixTestDataProvides string representation of full paths in a reference directory structure
OKlib::Refactoring::ProgramTestDataProvides string representation of C++ programs before and after transition
OKlib::Refactoring::StreamExtractor_by_copyFunctor class for extracting include directives from input streams, copying the stream content
OKlib::Refactoring::StreamExtractor_by_istream_iteratorFunctor class for extracting include directives from input streams, using multipass-iterator-wrappers around istream-iterators
OKlib::Refactoring::Test_BoostFilesystemFixTesting of fix for erroneous boost::filesystem
OKlib::Refactoring::Test_ExtendIncludeDirectives< ExtendIncludeDirectives >Test class for functor which handles the extending of include directives in a single file
OKlib::Refactoring::Test_ExtendIncludeDirectivesTwoDirectories< ExtendIncludeDirectivesTwoDirectories >Test class for extending all include directives in files below some working directories with paths relative to a working directory
OKlib::Refactoring::Test_ExtendIncludeDirectivesTwoRanges< ExtendIncludeDirectivesTwoRanges >Testing of ExtendIncludeDirectivesTwoRanges
OKlib::Refactoring::Test_IncludeDirective< Include_Directive >Testing classes representing one include directive
OKlib::Refactoring::Test_IncludeParsingGrammar< Include_Parsing_Grammar >Testing grammars for parsing source code units in order to extract include directives
OKlib::Refactoring::Test_Parsing< Program_Representation_Includes, StreamExtractor >Testing parsing of include directives from an istream
OKlib::Refactoring::Test_ProgramRepresentationIncludes< Program_Representation_Includes >Testing classes for representing the include-directives within a program
OKlib::Refactoring::TestDataTo provide data used by the testing of include handling
OKlib::Refactoring::ThrowIfNonUnique
OKlib::Refactoring::traits::size_type< T >Traits meta-function to extract the size type
OKlib::Refactoring::traits::string_type< T >Traits meta-function to extract the string type
OKlib::Rijndael::Rijndael
OKlib::SATAlgorithms::Backtracking< ExtProblem, Red, Heur, Vis >Generic backtracking solver (first prototype)
OKlib::SATCompetition::Add_positive_result_tuples< Container, TupleResult >
OKlib::SATCompetition::Add_positive_result_tuples< Container, TupleResultRandomSat >
OKlib::SATCompetition::Benchmark
OKlib::SATCompetition::Check_set< Map, Set >
OKlib::SATCompetition::Check_sizes< Map, Size >
OKlib::SATCompetition::ConstantSeriesPursePolicy for PurseScoring, which does not change the series purse
OKlib::SATCompetition::Copy_results< ParserResult, OutputIterator >
OKlib::SATCompetition::Copy_results_from_file< ParserResult, OutputIterator, Result_, ParserExtension >
OKlib::SATCompetition::Copy_results_from_file_to_container< ParserResult, Container, Result_, ParserExtension >
OKlib::SATCompetition::ElementaryAnalysis< Database >Given a "database" of results, computes an "indexed database", providing elementary maps, for example assiging to a solver the set of solved benchmarks, and elementary sets, for example the set of "complete" solvers
OKlib::SATCompetition::ElementaryAnalysis< Database >::AmbigueBenchmark
OKlib::SATCompetition::ElementaryAnalysis< Database >::AmbigueSolution
OKlib::SATCompetition::ElementaryAnalysis< Database >::ErrorElementaryAnalysis
OKlib::SATCompetition::ElementaryAnalysis< Database >::SolvedBenchmark
OKlib::SATCompetition::LexicographicalEvaluation< IndexedDatabase, SeriesPolicy, NumberType >Given an "indexed database" of results, map each solver to the map, which assigns to each solved super-series the map, which assigns to each solved series the pair of solved-count and average running time
OKlib::SATCompetition::LexicographicalEvaluation< IndexedDatabase, SeriesPolicy, NumberType >::numerics_solver_on_series_type
OKlib::SATCompetition::LexicographicalEvaluationRandom< IndexedDatabase, SortingPolicy, NumberType >Given an "indexed database" of results, map each super-series to the set of solver-resultvector pairs, where the resultvectors contain the series evaluations computed by LexicographicalEvaluation, and the order of these pairs is some variation of lexicographical order
OKlib::SATCompetition::LexicographicalEvaluationRandom_from_file< ParserExtension >
OKlib::SATCompetition::LexicographicalSeriesPolicy< Result >
OKlib::SATCompetition::LexicographicalSeriesPolicy< ResultRandomSat >
OKlib::SATCompetition::LexicographicalSortingPolicy_induced_lexicographical< solver_evaluation_pair_type >Policy for LexicographicalEvaluationRandom yielding the order of evaluation vectors which is the lexicographical order based on the order given for numerics_solver_on_series_type
OKlib::SATCompetition::LexicographicalSortingPolicy_induced_lexicographical< solver_evaluation_pair_type >::comparison_type
OKlib::SATCompetition::LexicographicalSortingPolicy_unfolded_lexicographical< solver_evaluation_pair_type >Policy for LexicographicalEvaluationRandom yielding the order of evaluation vectors which is the lexicographical order when unfolding the pairs, that is, first all first components, then all second components
OKlib::SATCompetition::LexicographicalSortingPolicy_unfolded_lexicographical< solver_evaluation_pair_type >::comparison_type
OKlib::SATCompetition::ParserEmpty< CharT, ParseIterator >
OKlib::SATCompetition::ParserError
OKlib::SATCompetition::ParserResult< Result, CharT, ParseIterator, ParserExtension >
OKlib::SATCompetition::ParserResult< ResultRandomSat, CharT, ParseIterator, ParserExtension >
OKlib::SATCompetition::ParserResultElement< AverageTime, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< Benchmark, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< RandomKSat, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< RandomKSat_n, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< SATStatus, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< Series, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< Solver, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< SuperSeries, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultElement< TimeOut, CharT, ParseIterator >
OKlib::SATCompetition::ParserResultSequence< ParserResult, OutputIterator >
OKlib::SATCompetition::ParserThreeElements< CharT, ParseIterator >
OKlib::SATCompetition::PurseScoring< IndexedDatabase, SeriesPursePolicy, NumberType >Computing score(solver) = problem_purse(solver) + speed_award(solver) + series_purse(solver)
OKlib::SATCompetition::RandomKSat
OKlib::SATCompetition::RandomKSat_n
OKlib::SATCompetition::Result
OKlib::SATCompetition::Result_database_from_file< ParserResult, Result_, ParserExtension, Container >
OKlib::SATCompetition::ResultBasis
OKlib::SATCompetition::ResultDatabase< ResultIterator >Creates the undirected ("bi-directed") bipartite attribute-result graphs from a sequence of results, and enables computation of the set of common results for a set of attribute-values (for different attributes)
OKlib::SATCompetition::ResultElementPolymorphic base class for the representation of various forms of "results"
OKlib::SATCompetition::ResultElement_with_nameAddition of a name to SATCompetition::ResultElement, by which result elements can be alphabetically sorted
OKlib::SATCompetition::ResultNode
OKlib::SATCompetition::ResultRandomSat
OKlib::SATCompetition::ResultRandomSatBasis
OKlib::SATCompetition::SAT2005SeriesPursePolicy for PurseScoring, which does divides the series purse by 3, if only 4 or less benchmarks are in the series
OKlib::SATCompetition::SATStatusSpecial result element representing the return value of the solver
OKlib::SATCompetition::Scoring_from_file< ParserExtension, ResultClass, SeriesPursePolicy >Given a file with competition results, computes sorted lists of scores for the SAT, UNSAT and SAT+UNSAT categories
OKlib::SATCompetition::Scoring_from_file< ParserExtension, ResultClass, SeriesPursePolicy >::scoringContains scoring related data for one solver
OKlib::SATCompetition::Scoring_from_file< ParserExtension, ResultClass, SeriesPursePolicy >::series_info
OKlib::SATCompetition::Scoring_from_file< ParserExtension, ResultClass, SeriesPursePolicy >::solved_series
OKlib::SATCompetition::Series
OKlib::SATCompetition::Series_with_n
OKlib::SATCompetition::Solver
OKlib::SATCompetition::Test_Copy_results_fill_from_file< Container >
OKlib::SATCompetition::Test_Copy_results_ParserResult_Result
OKlib::SATCompetition::Test_Copy_results_ParserResult_Result_negative_cases
OKlib::SATCompetition::Test_Copy_results_ParserResult_Result_positive_cases
OKlib::SATCompetition::Test_Copy_results_ParserResultRandomSat_ResultRandomSat
OKlib::SATCompetition::Test_Copy_results_ParserResultRandomSat_ResultRandomSat_positive_cases
OKlib::SATCompetition::Test_Database_vs_Container< ResultDatabase, ResultContainer >
OKlib::SATCompetition::Test_ElementaryAnalysis< ElementaryAnalysis >
OKlib::SATCompetition::Test_LexicographicalEvaluation< LexicographicalEvaluation >Testing the basic facility for lexicographical evaluation
OKlib::SATCompetition::Test_LexicographicalEvaluationRandom< LexicographicalEvaluationRandom >Testing lexicographical evaluation
OKlib::SATCompetition::Test_ParserResult_Result< Result >
OKlib::SATCompetition::Test_ParserResult_Result_negative_cases< Result >
OKlib::SATCompetition::Test_ParserResult_Result_positive_cases< Result >
OKlib::SATCompetition::Test_ParserResult_ResultRandomSat< ResultRandomSat >
OKlib::SATCompetition::Test_ParserResult_ResultRandomSat_positive_cases< ResultRandomSat >
OKlib::SATCompetition::Test_ParserResultElement_AverageTime< AverageTime >
OKlib::SATCompetition::Test_ParserResultElement_AverageTime_negative_cases< AverageTime >
OKlib::SATCompetition::Test_ParserResultElement_AverageTime_positive_cases< AverageTime >
OKlib::SATCompetition::Test_ParserResultElement_Benchmark< Benchmark >
OKlib::SATCompetition::Test_ParserResultElement_Benchmark_negative_cases< Benchmark >
OKlib::SATCompetition::Test_ParserResultElement_Benchmark_positive_cases< Benchmark >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat< RandomKSat >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat_n< RandomKSat_n >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat_n_negative_cases< RandomKSat_n >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat_n_positive_cases< RandomKSat_n >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat_negative_cases< RandomKSat >
OKlib::SATCompetition::Test_ParserResultElement_RandomKSat_positive_cases< RandomKSat >
OKlib::SATCompetition::Test_ParserResultElement_SATStatus< SATStatus >
OKlib::SATCompetition::Test_ParserResultElement_SATStatus_negative_cases< SATStatus >
OKlib::SATCompetition::Test_ParserResultElement_SATStatus_positive_cases< SATStatus >
OKlib::SATCompetition::Test_ParserResultElement_Series< Series >
OKlib::SATCompetition::Test_ParserResultElement_Series_negative_cases< Series >
OKlib::SATCompetition::Test_ParserResultElement_Series_positive_cases< Series >
OKlib::SATCompetition::Test_ParserResultElement_Solver< Solver >
OKlib::SATCompetition::Test_ParserResultElement_Solver_negative_cases< Solver >
OKlib::SATCompetition::Test_ParserResultElement_Solver_positive_cases< Solver >
OKlib::SATCompetition::Test_ParserResultElement_SuperSeries< SuperSeries >
OKlib::SATCompetition::Test_ParserResultElement_SuperSeries_negative_cases< SuperSeries >
OKlib::SATCompetition::Test_ParserResultElement_SuperSeries_positive_cases< SuperSeries >
OKlib::SATCompetition::Test_ParserResultElement_TimeOut< TimeOut >
OKlib::SATCompetition::Test_ParserResultElement_TimeOut_negative_cases< TimeOut >
OKlib::SATCompetition::Test_ParserResultElement_TimeOut_positive_cases< TimeOut >
OKlib::SATCompetition::Test_PurseScoring< PurseScoring >
OKlib::SATCompetition::Test_RepresentationSolverSeries< LexicographicalEvaluation >Tests representations of the run of a solver on a series
OKlib::SATCompetition::Test_ResultDatabase_ResultIterator< ResultDatabase >
OKlib::SATCompetition::traits::floating_point_type< T >Traits meta-function to extract the floating_point type
OKlib::SATCompetition::traits::natural_number_type< T >Traits meta-function to extract the natural-number type
OKlib::SATCompetition::traits::string_type< T >Traits meta-function to extract the string type
OKlib::SATCompetition::tuple_type< Result >
OKlib::SATCompetition::tuple_type< ResultRandomSat >
OKlib::Satisfiability::Assignments::PartialAssignments::ApplyPassAdaptor< Int, RPass, CLSAdaptor >CLSAdaptor, which applies a partial assignments, and transfers the result to another CLSAdaptor
OKlib::Satisfiability::Assignments::PartialAssignments::BPass0< Lit >An immutable boolean partial assignment in the simplest form
OKlib::Satisfiability::Assignments::TotalAssignments::BAssignmentWithQueue< Lit >Boolean assignments with queue for (elementary) assignments to be processed
OKlib::Satisfiability::Assignments::TotalAssignments::BAssignmentWithRQueue< Lit >Boolean assignments with resettable queue for (elementary) assignments to be processed
OKlib::Satisfiability::FiniteFunctions::QuineMcCluskey< n, ClauseContainer >Functor, computing all prime implicates of a full clause-set
OKlib::Satisfiability::FiniteFunctions::tests::Test_QuineMcCluskey< QuineMcCluskey >
OKlib::Satisfiability::Interfaces::InputOutput::Error_readpass_contradiction
OKlib::Satisfiability::Interfaces::InputOutput::Error_readpass_missing_v
OKlib::Satisfiability::Interfaces::InputOutput::Error_readpass_nonint
OKlib::Satisfiability::Interfaces::InputOutput::Error_readpass_stream
OKlib::Satisfiability::Interfaces::InputOutput::GeneralisedHypergraphColouring< SetSystem, Int >Transforming generalised hypergraph colouring to (boolean) CNF
OKlib::Satisfiability::Interfaces::InputOutput::HypergraphTwoColouring< SetSystem, CLSAdaptor, Int >Translating two hypergraphs into a boolean clause-set (as a 2-colouring problem)
OKlib::Satisfiability::Interfaces::InputOutput::ReadPass< Lit, Pass >Reading a partial assignment from an input stream
OKlib::Satisfiability::ProblemInstances::Clauses::RClausesAsSets< Lit >Clauses with remove-functionality, implemented by sets
OKlib::Satisfiability::ProblemInstances::Clauses::RClausesAsVectors< Lit >Clauses with remove-functionality, implemented by vectors
OKlib::Satisfiability::ProblemInstances::Clauses::WatchedLiterals_mono< Lit >Clause-type with two watched literals, where the user can't distinguish between them
OKlib::Satisfiability::ProblemInstances::Literals::Literal2pair< Lit >Functor for translating a literal x into a pair (var,condition)
OKlib::Satisfiability::Reductions::KLevelForcedAssignments::CLSAdaptorKUcp< WatchedClauses, Assignment >Transferring a (boolean) clause-set into a clause-list, and then performing r_k-reduction
OKlib::Satisfiability::Reductions::UnitClausePropagation::CLSAdaptorUcp< Lit, Clauses >Transferring a (boolean) clause-set into a clause-list, and then performing unit-clause propagation
OKlib::Satisfiability::Reductions::UnitClausePropagation::CLSAdaptorUcpW< WatchedClauses, Assignment >Transferring a (boolean) clause-set into a clause-list, and then performing UCP using watched literals
OKlib::Satisfiability::Transformers::Generators::VanderWaerden_TwoParts_1< UInt, APit >Creation of vdW-SAT-problems for mixed binary problems
OKlib::Satisfiability::Values::traits::exceptional_value< Assignment_status >
OKlib::Satisfiability::Values::traits::first_value< Assignment_status >
OKlib::Satisfiability::Values::traits::first_value< Sat_status >
OKlib::Satisfiability::Values::traits::last_value< Assignment_status >
OKlib::Satisfiability::Values::traits::last_value< Sat_status >
OKlib::SearchDataStructures::AssociativePrefixContainer< Range >Class for associative container of ranges with lexicographic ordering
OKlib::SearchDataStructures::BaseTestDataBase class for testing data
OKlib::SearchDataStructures::ExtensionTestDataProvides a vector of tuples. The first element of each tuple is a header, the second is the first extension (according to the data in PrefixTestData) and the final is a boolean which is true if and only if the extension is unique, and false otherwise
OKlib::SearchDataStructures::PrefixTestDataProvides a vector of strings, each of which is a string representation of the full path of some header
OKlib::SearchDataStructures::Test_AssociativePrefixContainer< PrefixContainer >Test for associative prefix container
OKlib::SetAlgorithms::Disjoint< Set >Unary predicate checking whether a set B is disjoint to the given set A
OKlib::SetAlgorithms::Erase< Container >Functor template for (generically) erasing an element from a container while maintaining the element-specifying iterator
OKlib::SetAlgorithms::Erase< std::multiset< T > >
OKlib::SetAlgorithms::Erase< std::set< T > >
OKlib::SetAlgorithms::Get_underlying_iterator< Iterator >
OKlib::SetAlgorithms::Get_underlying_iterator< boost::reverse_iterator< Iterator > >
OKlib::SetAlgorithms::Get_underlying_iterator< std::reverse_iterator< Iterator > >
OKlib::SetAlgorithms::Intersection< InputIterator_sets, OutputIterator >Functor: Given a range (input iterators) of ordered sequences, which are given as input-iterator-ranges, and an output iterator, compute the intersection
OKlib::SetAlgorithms::MapValue< Map >Adaptor to create a functor from a map in the sense of the C++ standard
OKlib::SetAlgorithms::Size< Range >
OKlib::SetAlgorithms::Subsumption_elimination< ContainerSets, UniquenessTag, OrderTag, SizeTag >Functor template for eliminating all inclusions from a container
OKlib::SetAlgorithms::Subsumption_hypergraph< RangeF, RangeG, Int >Constructing the subsumption hypergraph
OKlib::SetAlgorithms::SubsumptionsTags::do_not_use_size_of_hyperedges
OKlib::SetAlgorithms::SubsumptionsTags::hyperedges_are_unique
OKlib::SetAlgorithms::SubsumptionsTags::hyperedges_may_not_be_sorted_by_size
OKlib::SetAlgorithms::SubsumptionsTags::hyperedges_may_not_be_unique
OKlib::SetAlgorithms::SubsumptionsTags::hyperedges_sorted_by_size
OKlib::SetAlgorithms::SubsumptionsTags::order_tag
OKlib::SetAlgorithms::SubsumptionsTags::size_tag
OKlib::SetAlgorithms::SubsumptionsTags::uniqueness_tag
OKlib::SetAlgorithms::SubsumptionsTags::use_size_of_hyperedges
OKlib::SetAlgorithms::Sum_sizes< InputIterator_sets >
OKlib::SetAlgorithms::Test_Intersection< Intersection >
OKlib::SetAlgorithms::Test_MapValue< MapValue >
OKlib::SetAlgorithms::Test_Subsumption_elimination< Subsumption_elimination >
OKlib::SetAlgorithms::Test_Sum_sizes< Sum_sizes >
OKlib::SetAlgorithms::Test_Union< Union >
OKlib::SetAlgorithms::TestOperation< SetCollection, ReferenceSet, Operation >
OKlib::SetAlgorithms::tests::Test_Subsumption_hypergraph< Subsumption_hypergraph >
OKlib::SetAlgorithms::Union< InputIterator_sets, OutputIterator >Functor: Given a range (input iterators) of ordered sequences, which are given as input-iterator-ranges, and an output iterator, compute the union
OKlib::SystemSpecifics::DemangleFunctor, translating mangled type names into plain type names (both as C-strings)
OKlib::TestExecutionTools::AllCombinations< Dim, InputRange, Functor >Test function, depending on the dimension dim, which takes a range of objects and a test function F, and performs all tests F(x_1, ..., x_dim), where {x_1, ..., x_dim} runs through all dim-element subsets of the set of objects given by the range
OKlib::TestExecutionTools::AllCombinations< 1, InputRange, Functor >
OKlib::TestExecutionTools::AllCombinations< 2, InputRange, Functor >
OKlib::TestExecutionTools::AllCombinations< 3, InputRange, Functor >
OKlib::TestExecutionTools::AllVariations< Dim, InputRange, Functor >Test function, depending on the dimension dim, which takes a range of objects and a test function F, and performs all tests F(x_1, ..., x_dim), where (x_1, ..., x_dim) runs through all possibilities
OKlib::TestExecutionTools::AllVariations< 1, InputRange, Functor >
OKlib::TestExecutionTools::AllVariations< 2, InputRange, Functor >
OKlib::TestExecutionTools::AllVariations< 3, InputRange, Functor >
OKlib::TestExecutionTools::Empty< T >Empty relation
OKlib::TestExecutionTools::EnumerationBase< Dim, InputRange, Functor >Helper base class for enumerating test cases
OKlib::TestExecutionTools::Id< T >Identity relation
OKlib::TestExecutionTools::Test_AllCombinations< AllCombinations >Tests a facility AllCombinations by executing it and counting the number of sub-tests executed
OKlib::TestExecutionTools::Test_AllVariations< AllVariations >Tests a facility AllVariations by executing it and counting the number of sub-tests executed
OKlib::TestExecutionTools::Test_Empty< Empty >Testing the empty relation
OKlib::TestExecutionTools::Test_Id< Id >Testing the identity relation
OKlib::TestExecutionTools::Test_TestAntisymmetry< TestAntisymmetry >Tests the test whether a binary predicate on a range of objects is antisymmetric
OKlib::TestExecutionTools::Test_TestAsymmetry< TestAsymmetry >Tests the test whether a binary predicate on a range of objects is asymmetric
OKlib::TestExecutionTools::Test_TestCounter< TestCounter >Tests the test counter by calling it some times
OKlib::TestExecutionTools::Test_TestEquivalence< TestEquivalence >Tests the test whether a binary predicate on a range of objects is an equivalence
OKlib::TestExecutionTools::Test_TestIrreflexivity< TestIrreflexivity >Tests the test whether a binary predicate on a range of objects is irreflexiv
OKlib::TestExecutionTools::Test_TestQuasiorder< TestQuasiorder >Tests the test whether a binary predicate on a range of objects is a quasiorder
OKlib::TestExecutionTools::Test_TestReflexivity< TestReflexivity >Tests the test whether a binary predicate on a range of objects is reflexiv
OKlib::TestExecutionTools::Test_TestSymmetry< TestSymmetry >Tests the test whether a binary predicate on a range of objects is symmetric
OKlib::TestExecutionTools::Test_TestTotality< TestTotality >Tests the test whether a binary predicate on a range of objects is total
OKlib::TestExecutionTools::Test_TestTransitivity< TestTransitivity >Tests the test whether a binary predicate on a range of objects is transitiv
OKlib::TestExecutionTools::Test_TestTrichotomy< TestTrichotomy >Tests the test whether a binary predicate on a range of objects fulfils trochotomy
OKlib::TestExecutionTools::Test_Total< Total >Testing the total relation
OKlib::TestExecutionTools::TestAntisymmetry< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is antisymmetric
OKlib::TestExecutionTools::TestAsymmetry< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is asymmetric
OKlib::TestExecutionTools::TestCounter< Dummy, IntType >Test function which increments a global counter each time it is called, and throws a test exception of the value of that counter after increment equals a throw_value
OKlib::TestExecutionTools::TestEquivalence< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is an equivalence
OKlib::TestExecutionTools::TestIrreflexivity< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is irreflexiv
OKlib::TestExecutionTools::TestQuasiorder< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is a quasiorder
OKlib::TestExecutionTools::TestReflexivity< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is reflexiv
OKlib::TestExecutionTools::TestSymmetry< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is symmetric
OKlib::TestExecutionTools::TestTotality< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is total
OKlib::TestExecutionTools::TestTransitivity< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects is transitiv
OKlib::TestExecutionTools::TestTrichotomy< Range, BinaryPredicate >Tests whether a binary predicate on a range of objects fulfils trichotomy
OKlib::TestExecutionTools::Total< T >Total relation
OKlib::TestSystem::Basic
OKlib::TestSystem::ErrorDescriptionThe unit to describe one point in call history leading to a test failure
OKlib::TestSystem::Extensive
OKlib::TestSystem::Full
OKlib::TestSystem::messages::Banner
OKlib::TestSystem::messages::BannerSingle
OKlib::TestSystem::messages::BasicTestDescriptionOutputs a description of the test (an identification of the test function, and nesting depth and test level)
OKlib::TestSystem::messages::ErrorDescriptionThe unit to describe the point in call history leading to a test failure
OKlib::TestSystem::messages::IdentificationTestSystem
OKlib::TestSystem::messages::LogDescriptionOutputs a description of the circumstances of a log-message
OKlib::TestSystem::messages::NotEqual< T1, T2 >Output of streamable objects which are not equal (unexpectedly)
OKlib::TestSystem::messages::RunTestClosing
OKlib::TestSystem::messages::RunTestOpening
OKlib::TestSystem::messages::SingleTestClosing
OKlib::TestSystem::messages::SingleTestOpening
OKlib::TestSystem::messages::TestExceptionThe root of the exception class hierarchy, to be thrown in case of test failure
OKlib::TestSystem::messages::TestLevelDescriptionsOutput of test-level descriptions
OKlib::TestSystem::messages::TestLevelDescriptions::dispatch
OKlib::TestSystem::OutputWrapper< T >Class template used in conjunction with OKLIB_TEST_EQUAL_W when testing ranges for equality, where a list of the elements shall be output in case of test failure
OKlib::TestSystem::OutputWrapper2< T >Wrapper type to mark objects for nested list-output
OKlib::TestSystem::OutputWrapper3< T >Wrapper type to mark objects for doubly nested list-output
OKlib::TestSystem::RunTestResponsible for running tests
OKlib::TestSystem::TestRoot of the test class hierarchy. From this class test classes are to be derived, which are used by other test classes
OKlib::TestSystem::TestBaseBase class for tests with auto-insertion. Derived from Test; from this class test classes are to be derived, which shall be executed on their own
OKlib::TestSystem::TestExceptionThe root of the exception class hierarchy to be thrown in case of test failure
OKlib::TestSystem::TestLevelAbstract base class of the (polymorphic) test-level hierarchy
OKlib::TestSystem::tests::Test1
OKlib::TestSystem::tests::Test2
OKlib::TestSystem::tests::Test3
OKlib::TestSystem::tests::TestSystemTesting the test system
OKlib::TestSystem::VisitorTestLevelAbstract base class for generic visitors (helper classes) for TestLevel (to enable "polymorphic switches" on objects of type TestLevel)
OKlib::traits::has_size_function< T >
OKlib::traits::is_signed_integral< T >
OKlib::traits::is_std_container< T >
OKlib::traits::is_std_container< std::deque< T > >
OKlib::traits::is_std_container< std::list< T > >
OKlib::traits::is_std_container< std::multiset< T > >
OKlib::traits::is_std_container< std::set< T > >
OKlib::traits::is_std_container< std::vector< T > >
OKlib::traits::is_unqualified_signed_integral< T >
OKlib::traits::is_unqualified_signed_integral< int >
OKlib::traits::is_unqualified_signed_integral< long int >
OKlib::traits::is_unqualified_signed_integral< short int >
OKlib::traits::is_unqualified_signed_integral< signed char >
OKlib::traits::is_unqualified_signedunsigned_integral< T >
OKlib::traits::is_unqualified_unsigned_integral< T >
OKlib::traits::is_unqualified_unsigned_integral< unsigned char >
OKlib::traits::is_unqualified_unsigned_integral< unsigned int >
OKlib::traits::is_unqualified_unsigned_integral< unsigned long int >
OKlib::traits::is_unqualified_unsigned_integral< unsigned short int >
OKlib::traits::is_unsigned_integral< T >
OKlib::traits::Test_is_unqualified_signed_integral_T< is_unqualified_signed_integral >
OKlib::traits::Test_is_unqualified_signedunsigned_integral_T< is_unqualified_signedunsigned_integral >
OKlib::traits::Test_is_unqualified_unsigned_integral_T< is_unqualified_unsigned_integral >
OKlib::Van_der_Waerden_hypergraph::Test_Arithmetic_progression< Arithmetic_progression >
OKlib::Van_der_Waerden_hypergraph::Test_Arithmetic_progression_Integer< Arithmetic_progression >
OKlib::Van_der_Waerden_hypergraph::Test_Iterator_arithmetic_progression< Iterator_arithmetic_progression >
OKlib::Van_der_Waerden_hypergraph::Test_Iterator_arithmetic_progression_Integer< Iterator_arithmetic_progression >
OKlib::Variables::traits::index_type< T >Traits meta-function to extract the index type
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_int >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_long_int >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_short_int >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_signed_char >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_unsigned_char >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_unsigned_int >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_unsigned_long_int >
OKlib::Variables::traits::index_type< ::OKlib::Variables::Variables_unsigned_short_int >
OutputCls::Adapter_Dimacs_Output
OutputCls::Dimacs_output_literal_stream< Lit >
OutputCls::Error_OutputCls
OutputCls::Output_literal_stream< Lit >
PartAssignments::Error::inconsistent_extension
PartAssignments::Error::not_in_domain
PartAssignments::Pass
PartialAssignments::PassAsMaps< Literals >PassAsMaps<Literals> yields partial assignments, implemented via std::maps
PartialAssignments::PassViaMap< Variables, Domain >PassViaMap<Var, Dom> yields partial assignments, implemented via std::maps
Pfadinfo
Presentation
ProgramRepresentationIncludes< String >Class for representing the include-directives within a program
QuineMcCluskeyTesting the QuineMcCluskey prime generation
Ramsey::Enumerate_hyperedges< Int >Computing the hypergraphs underlying Ramsey-instances
Ramsey::Ramsey_TwoColours_1< Int >Outputs a Ramsey SAT-instance for two colours and arbitrary hyperedge size
ressource
Rev
Sammlung
SAT_translation< Graph >Creating a CNF in DIMACS format encoding the 101-colouring conditions
SetsOfVariables::SingletonVarSet< Variables >
SetsOfVariables::SingletonVarSet< Variables >::iterator
Source
StapeleintragF
binary_function
iterator
streambuf
unary_function
StreamHandling::basename_template
StreamHandling::basename_template::Parameter
StreamHandling::Error
StreamHandling::Error_file2string::open_file
StreamHandling::Error_FileLines::open_file
StreamHandling::Error_FileLines::read_file
StreamHandling::Error_LockFile::call_close
StreamHandling::Error_LockFile::call_open
StreamHandling::Error_LockFile::lock_file
StreamHandling::Error_LockFile::unlock_file
StreamHandling::Error_remove_lines::temporary_file
StreamHandling::Error_TempFile::call_close
StreamHandling::Error_TempFile::call_mktemp
StreamHandling::Error_TempFile::call_open
StreamHandling::Error_TempFile::open_file
StreamHandling::Error_TempFile::remove_file
StreamHandling::fdostream
StreamHandling::fdoutbuf
StreamHandling::FileLines
StreamHandling::FileLinesInputIterator
StreamHandling::LockedFileOstream
StreamHandling::path_template
StreamHandling::path_template::Parameter
StreamHandling::RedirectingStd
StreamHandling::self_named
StreamHandling::self_named::Parameter
StreamHandling::TempFile
StreamHandling::TemporaryFile< Creator >
StreamHandling::TemporaryFile_basename_template
StreamHandling::TemporaryFile_path_template
StreamHandling::TemporaryFile_self_named
StreamHandling::Wrapper< T, width >
StringHandling::Error
StringHandling::Error_StringHandling::conversion_from_string
StringHandling::Error_StringHandling::conversion_to_string
StringHandling::Vector_c_str
Subsumption_hypergraphTesting the subsumption hypergraph generator
Support::edge_check< Graph >
SystemHandling::create_file
SystemHandling::open_directory
SystemHandling::open_file
SystemHandling::PidType
SystemHandling::System
SystemHandling::System_bash
SystemHandling::system_error
SystemHandling::System_sh
SystemHandling::SystemError
SystemHandling::SystemOutput
Test< C, T >
Test1
Test< C, ConceptDefinitions::Root_tag >
Test< Pass, ConceptDefinitions::BasicPartialAssignment_tag >
Test< Var, ConceptDefinitions::Variable_tag >
Test< Var, ConceptDefinitions::VariableWithCounting_tag >
Test< Var, ConceptDefinitions::VariableWithHistory_tag >
Test< Var, ConceptDefinitions::VariableWithInfo_tag >
Test< Variables::VarCharOccInt, Variables::VarCharOccInt::Concept >
Test< Variables::VarRefCharInt, Variables::VarRefCharInt::Concept >
Test< VarSet, ConceptDefinitions::SetOfVariables_tag >
Test< VarSet, ConceptDefinitions::SingletonSetOfVariables_tag >
Tests_General::Helper_VariableDomain::fill_variables< VarD, Iterator, name_type >
Tests_General::Helper_VariableDomain::fill_variables< VarD, Iterator, int >
Tests_General::Helper_VariableDomain::fill_variables< VarD, Iterator, std::string >
Tests_General::Test< C, T >
Tests_General::Test< C, Concepts_General::Root_tag >
Tests_General::Test< VarD, Concepts_Variables::VariableDomain_tag >
Tests_General::Test< VarD, Concepts_Variables::VariableDomainWithAllocation_tag >
Tests_General::Test< VarD, Concepts_Variables::VariableDomainWithIterator_tag >
Tests_General::Test< VarD, Concepts_Variables::VariableDomainWithIteratorAndAllocation_tag >
Tests_General::Test< VarD, Concepts_Variables::VariableDomainWithSizeType_tag >
TimeHandling::Progress
TimeHandling::SystemTimeDEPRECATED (replaced by boost::timer): For elapsed system time in seconds since initialisation
TimeHandling::WallTimeFor elapsed wall time in (full) seconds since initialisation
Traits_General::Basis_VariablesAsIntegers_DomainWithNameAdministration::Basis_Traits< Int, Name >
Traits_General::MetaData< Variables::VariablesAsIntegers< Int > >
Traits_General::MetaData< Variables::VariablesAsIntegers_DomainWithNameAdministration< Int, Name > >
Traits_General::MetaData< Variables::VariablesAsIntegers_DomainWithNameAdministration< Int, std::string > >
Traits_Variables::AllocationBehaviour
Traits_Variables::AllocationCausesInvalidation
Traits_Variables::ComparisonDifferentDomainsImplementationDefined
Traits_Variables::ComparisonDifferentDomainsUndefinedBehaviour
Traits_Variables::DoesntThrowTotalCapacityOverflow
Traits_Variables::GeneralNames
Traits_Variables::LocalDomainsIdentified
Traits_Variables::NaturalNumberConvertibleName
Traits_Variables::NaturalSize
Traits_Variables::NoInvalidNames
Traits_Variables::OneGlobalDomain
Traits_Variables::OrderByCreation
Traits_Variables::OrderImplementationDefined
Traits_Variables::OrderNameInherited
Traits_Variables::SafeAllocation
Traits_Variables::SizeBehaviour
Traits_Variables::SizeIndexRelated
Traits_Variables::SizeNameRelated
Traits_Variables::SpecialNames
Traits_Variables::StringConvertibleName
Traits_Variables::ThrowsInvalidName
Traits_Variables::ThrowsTotalCapacityOverflow
TransformationsBiclique::Symmetric_conflict_number_to_SAT< Matrix, Formula >
TransformationsBiclique::Symmetric_conflict_number_to_SAT< Matrix, Formula >::Biclique_side
TransformationsBiclique::Symmetric_conflict_number_to_SAT< Matrix, Formula >::Conflict
typeALGORITHM
typeALGPARM
typeITEM
typeITEMLIST
typePARAMETERDEFAULT
typeREPORT
typeREPORTCOL
typeREPORTSTAT
typeTRIGGER
Values::BooleanValues
var
Var< Matrix, Formula >Translating an adjacency matrix M and a desired max biclique-number max_bc into the (boolean CNF) SAT problem F
var_node
Var_tag
Variables::EmptyLiteralLink< Index >
Variables::Error::empty_name
Variables::Error::invalid_assignment
Variables::Error_Variables
Variables::InfoPolicyEmpty< IndexType >
Variables::InfoPolicyEmpty< IndexType >::Dummy
Variables::InfoPolicyIndexVector< InfoType, IndexType >
Variables::InfoPolicyIndexVectorOccurrences< Index >
Variables::InfoPolicyPointerVector< Info >
Variables::Iterator_VariablesAsIntegers< Int >
Variables::Occurrences
Variables::Overflow_Variables
Variables::Size_type_signed< Integer >
Variables::Var
Variables::Var_basic
Variables::Var_Set
Variables::VariablesAsIndices< InfoPolicy, Name, LiteralLink >
Variables::VariablesAsIntegers< Int >
Variables::VariablesAsIntegers_DomainWithNameAdministration< Int, Name >
Variables::VariablesAsNames< Name >
Variables::VariablesAsPointers< InfoPolicy, Name, LiteralLink >
Variables::VariablesViaReferenceCounting< Name, Index >
VarMaskeFor a variable its word-position and mask
HandlerBase
XercesTools::AttributeMap
XercesTools::checked< T >
XercesTools::checked_conversion_failed
XercesTools::ElementMap
XercesTools::ElementStack< T, Container >
XercesTools::Error
XercesTools::full_string
XercesTools::full_string_co
XercesTools::InitBasis
XercesTools::Inititialisation_and_Termination
XercesTools::missing_required_attribute
XercesTools::SimpleElementAttributeHandling
XercesTools::SimpleErrorHandler
XercesTools::SimpleParserWrapper
XercesTools::Unique_content_extraction_handler< ElementAttributeHandler >
XercesTools::Wrapper
XercesTools::WrapperData< T >
XMLHandling::Basis
XMLHandling::dtd_access_policy_base
XMLHandling::dtd_declaration10< dtd_access_policy, encoding_policy >
XMLHandling::dtd_declaration10< dtd_access_policy, no_encoding >
XMLHandling::Element< Presentation, is_empty >
XMLHandling::Element< Presentation, is_not_empty >
XMLHandling::Element_basis< Presentation >
XMLHandling::encoding_policy_base
XMLHandling::external_dtd
XMLHandling::internal_dtd
XMLHandling::no_encoding
XMLHandling::with_encoding
XMLHandling::xml_declaration10
XMLHandling::XML_Presentation
XMLHandling::XML_Presentation_sepvar