  paal::data_structures::_metric_traits< Metric, _VertexType > | Base for metric traits |
 paal::data_structures::_metric_traits< euclidean_metric< T >, std::pair< T, T > > | |
  paal::data_structures::metric_traits< euclidean_metric< T > > | |
| paal::data_structures::_metric_traits< Metric, int > | |
| paal::data_structures::metric_traits< Metric > | Metric traits |
| paal::data_structures::_metric_traits< metric_on_idx< Metric, Bimap, read_indexes_tag >, bimap_traits< std::decay< Bimap >::type >::Idx > | |
| paal::data_structures::metric_traits< metric_on_idx< Metric, Bimap, read_indexes_tag > > | |
| paal::data_structures::_metric_traits< metric_on_idx< Metric, Bimap, read_values_tag >, bimap_traits< std::decay< Bimap >::type >::Val > | |
| paal::data_structures::metric_traits< metric_on_idx< Metric, Bimap, read_values_tag > > | |
| paal::data_structures::_voronoi_traits< V, Vertex > | Voronoi traits base |
| paal::data_structures::_voronoi_traits< V, int > | |
| paal::data_structures::voronoi_traits< V > | Default VertexType is int |
| paal::data_structures::_voronoi_traits< voronoi< Metric >, metric_traits< Metric >::VertexType > | |
| paal::data_structures::voronoi_traits< voronoi< Metric > > | Specialization of voronoi_traits |
| paal::lp::add_first_violated< GetCandidates, HowViolated, AddViolated, ReorderCandidates > | Functor |
| paal::lp::add_max_violated< GetCandidates, HowViolated, AddViolated, CompareHow > | Functor for adding maximum violated constraint |
| paal::data_structures::adjacency_matrix< Metric > | Type of adjacency_matrix, for given metric |
| paal::utils::And | And |
| paal::data_structures::detail::push_back_name::apply< Vector, NameWithDefault > | |
| paal::data_structures::detail::push_back_default::apply< Vector, Name > | |
| paal::data_structures::detail::push_back_default::apply< Vector, NameWithDefault< Name, Default > > | |
| paal::detail::arithmetic_size_tag | |
| paal::utils::array_to_functor< Array > | Adapts array as function, providing operator()() |
| paal::utils::assert_functor | Functors calls assert(false) |
| paal::utils::assignable_functor< Functor > | Wrapper around a functor which adds assigmnent operator as well as default constructor. Note, this struct might be dangerous. Using this struct correctly requires the underlying functor to live at least as long as this wrapper |
| paal::data_structures::at< Vector, Id > | Gives element on id in TypesVector |
| paal::data_structures::at< TypesVector< Arg, Args...>, std::integral_constant< C, 0 > > | Gives element on id in TypesVector, at 0 case |
| paal::data_structures::at< TypesVector< Arg, Args...>, std::integral_constant< C, i > > | Gives element on id in TypesVector |
| paal::auctions::concepts::auction< Auction > | |
| paal::auctions::concepts::auction< DemandQueryAuction > | |
| paal::auctions::concepts::demand_query_auction< DemandQueryAuction > | |
| paal::auctions::concepts::auction< GammaOracleAuction > | |
| paal::auctions::concepts::gamma_oracle_auction< GammaOracleAuction > | |
| paal::auctions::concepts::auction< ValueQueryAuction > | |
| paal::auctions::concepts::value_query_auction< ValueQueryAuction > | |
| paal::auctions::auction_traits< Auction > | Types associated with all auctions |
| paal::auctions::auction_traits< DemandQueryAuction > | |
| paal::auctions::demand_query_auction_traits< DemandQueryAuction > | Types associated with demand query auction |
| paal::auctions::auction_traits< GammaOracleAuction > | |
| paal::auctions::gamma_oracle_auction_traits< GammaOracleAuction > | Types associated with gamma oracle auction |
| paal::auctions::auction_traits< ValueQueryAuction > | |
| paal::auctions::value_query_auction_traits< ValueQueryAuction > | Types associated with value query auction |
| paal::average_accumulator< ValueType, CounterType > | Helper class facilitating counting average |
| Base | |
| paal::auctions::detail::determine_winners_in_gamma_oracle_auction_traits< GammaOracleAuction, Base > | |
| base_visitor | |
| paal::detail::nearest_recorder< NearestMap, LastEdgeMap, Tag > | |
| paal::ir::bdmst_init | |
| paal::ir::bdmst_relax_condition | |
| paal::ir::bdmst_round_condition | |
| paal::ir::bdmst_set_solution | |
| paal::ir::bdmst_violation_checker | Violations checker for the separation oracle in the bounded degree minimum spanning tree problem |
| paal::local_search::best_improving_strategy | This strategy chooses the best possible move and if it is improving applies it to the solution |
| paal::local_search::best_strategy | This strategy chooses the best possible move and applies it to the solution. Note that this strategy might commit non-improving moves |
| paal::auctions::detail::bid< Bidder, BidId, Bundle > | |
| paal::auctions::detail::bidder_info< Value, ItemSet > | |
| paal::data_structures::bimap< T, Idx > | Implements both sides mapping from the collection to (0,size(collection)) interval |
| paal::data_structures::eraseable_bimap< T, Idx > | This maps support erasing elements, Alert inefficient!! |
| paal::data_structures::bimap< CycleEl, IdxT > | |
| paal::data_structures::bimap< int, int > | |
| paal::data_structures::eraseable_bimap< int > | |
| paal::data_structures::bimap< Vertex > | |
| paal::data_structures::bimap< VertexType > | |
| paal::data_structures::bimap_mic< T, Idx > | Same as Bimap, but implemented using boost::multi_index_container. Unfortunately slower |
| paal::data_structures::bimap_of_consecutive< T, Idx > | In this bimap we know that elements forms permutation this allows optimization |
| paal::data_structures::bimap_traits< Bimap > | |
| paal::data_structures::bimap_traits< bimap< ValT, IdxT > > | Traits specialization for Bimap |
| paal::data_structures::bimap_traits< bimap_mic< ValT, IdxT > > | Traits specialization for bimap_mic |
| paal::data_structures::bimap_traits< bimap_of_consecutive< ValT, IdxT > > | Traits specialization for bimap_of_consecutive |
| paal::data_structures::bimap_traits< eraseable_bimap< ValT, IdxT > > | Traits specialization for eraseable_bimap |
| paal::ir::detail::bool_map_to_non_tree_filter< EdgeBoolMap > | |
| paal::ir::detail::bool_map_to_tree_filter< EdgeBoolMap > | |
| paal::ir::bounded_degree_mst< Graph, DegreeBounds, CostMap, VertexIndex, SpanningTreeOutputIterator, Oracle > | The class for solving the Bounded Degree MST problem using Iterative Rounding |
| paal::data_structures::capacitated_voronoi< Metric, GeneratorsCapacieties, VerticesDemands > | This class is assigning vertices demands to capacitated generators in such a way that the total cost is minimized. The solution is based on the min cost max flow algorithm |
| paal::data_structures::collection_starts_from_last_change< Iterator, hash > | This collection stores some range and expose set_last_change function each time begin and end is called this class returns range which starts from last change place |
| paal::data_structures::combine_iterator_engine< Ranges > | Class representing set of ranges with two operation next and call |
| paal::data_structures::combine_iterator_engine< Ranges...> | |
| paal::data_structures::combine_iterator_engine< RangesRest...> | |
| paal::data_structures::combine_iterator_engine< Range, RangesRest...> | |
| paal::data_structures::combine_iterator_engine<> | Specialization for empty ranges lists |
| commit | |
| paal::utils::compare< T > | Class for comparing floating point |
| paal::greedy::detail::compare | |
| paal::utils::compare< double > | |
| paal::data_structures::component_traits< components > | |
| paal::data_structures::component_traits< detail::components< Names, Types > > | |
| paal::data_structures::detail::components< Names, Types > | |
| paal::data_structures::components< ComponentNamesWithDefaults > | |
| paal::data_structures::detail::components< TypesVector< NamesRest...>, TypesVector< TypesRest...> > | |
| paal::data_structures::detail::components< TypesVector< Name, NamesRest...>, TypesVector< Type, TypesRest...> > | |
| paal::data_structures::detail::components< TypesVector<>, TypesVector<> > | |
| paal::local_search::compute_gain_wrapper< Gain, ValueType > | This wrapper counts sum of the improvements. It makes sense to use it only when ChooseFirstBetter strategy is applied |
| paal::data_structures::detail::concat< Components1, Components2 > | |
| paal::data_structures::detail::concat< paal::data_structures::components< ComponentNamesWithDefaults1...>, paal::data_structures::components< ComponentNamesWithDefaults2...> > | |
| paal::local_search::concepts::concepts_base< Functor, Solution, SearchComponents > | |
| paal::local_search::concepts::concepts_base< X, Solution, SearchComponents > | |
| paal::local_search::concepts::commit< X, Solution, SearchComponents > | |
| paal::local_search::concepts::gain< X, Solution, SearchComponents > | |
| paal::local_search::concepts::get_moves< X, Solution, SearchComponents > | |
| paal::ir::cond_bigger_equal_than | Checks if a variable is greater or equal than a fixed bound |
| paal::local_search::conditional_gain_adaptor< Gain, Condition > | If the condition is not fulfilled this gain adaptor returns 0 |
| paal::local_search::conditional_gain_adaptor< Gain, AspirationCriteria > | |
| paal::data_structures::copy_tag | Indicates that components constructor is in fact a Copy/Move Constructor |
| paal::utils::counting_functor_adaptor< Functor, CounterType > | Counts number of calls |
| paal::data_structures::concepts::Cycle< X > | |
| paal::data_structures::cycle_start_from_last_change< Cycle > | Adopts any cycle to start (vbegin) i place of the last change(flip) |
| paal::data_structures::cycle_traits< Cycle > | Traits for Cycle concept |
| paal::data_structures::cycle_traits< X > | |
| default_k_median_components | Model of Multisearch_components with default multi search components for k-median |
| default_remove_fl_components | Model of Multisearch_components with default multi search components for facility location |
| paal::ir::default_resolve_lp_to_extreme_point | Finds an extreme point solution to the LP |
| paal::ir::default_round_condition | Default column rounding condition component |
| paal::ir::default_solve_lp_in_row_generation< Problem, LP > | |
| paal::ir::default_solve_lp_to_extreme_point | Finds an extreme point solution to the LP |
| paal::ir::default_stop_condition | Default stop condition component |
| demand_query_func | |
| paal::density< Value, Size > | Density functor, for given value and size |
| paal::data_structures::capacitated_voronoi< Metric, GeneratorsCapacieties, VerticesDemands >::Dist | This class store as a distance: |
| paal::distance_oracle_thorup2kminus1approximation< Graph, VertexIndexMap, EdgeWeightMap, Rand > | 2k-1 approximate distance oracle |
| paal::lp::double_bounded_expression | |
| paal::dreyfus_wagner< Metric, Terminals, NonTerminals, TerminalsLimit > | |
| paal::utils::dynamic_return_constant_functor< T > | Functor returns always the same number (dynamic version) |
| paal::edge_hash< Graph, Enable > | Hash for edge_descriptor in bgl, undirected version |
| paal::edge_hash< Graph, typename std::enable_if< std::is_same< typename boost::graph_traits< Graph >::directed_category, boost::directed_tag >::value >::type > | Hash for edge_descriptor in bgl, directed version |
| paal::utils::equal_to | Equal_to functor |
| paal::utils::equal_to_unspecified | TODO equivalent to c++14 equal_to<>, remove when appears |
| paal::data_structures::euclidean_metric< T > | Metric with euclidean distance |
| paal::local_search::exponential_cooling_schema_dependant_on_iteration | This functors returns potential (temperature) using the following schema. The start potential equals given startTemperature, once per numberOFRoundsWithSameTemperature the temperature is multiplied by given multiplier |
| paal::local_search::exponential_cooling_schema_dependant_on_time< Duration, Clock > | This functors returns potential (temperature) using the following schema. The start potential equals given startTemperature, the end temperature (after given duration) equals given endTemperature. In the beetween potential decreases (increase when startTemperature < endTemperature, which is not typical use case) in exponential manner |
| F | |
| paal::local_search::facility_location_commit_add | Commit functor for add moves in facility location problem |
| paal::local_search::facility_location_commit_remove | Commit functor for facility location |
| paal::local_search::facility_location_commit_swap | Commit functor for facility location problem |
| paal::local_search::facility_location_gain_add | Gain functor for add moves in facility location problem |
| paal::local_search::facility_location_gain_remove | Gain functor for facility location |
| paal::local_search::facility_location_gain_swap | Gain functor for swap in facility location problem |
| paal::data_structures::facility_location_solution< FacilityCost, VoronoiType > | Describes solution to facility location The initial solution is passed as voronoi, which has to be the model of the Voronoi concept. The generators of the voronoi are the facilities and the vertices are the clients |
| paal::data_structures::facility_location_solution< utils::return_zero_functor, voronoiType > | |
| paal::data_structures::k_median_solution< voronoiType > | Solution for k median problem |
| paal::local_search::facility_location_solution_adapter< facility_location_solution > | Facility_location_solution adapter chosen range and unchosen range must be joined into one homogenus collection of Facilities |
| paal::data_structures::facility_location_solution_traits< facility_location_solution > | |
| paal::data_structures::facility_location_solution_traits< data_structures::k_median_solution< voronoi > > | Specialization of facility_location_solution_traits |
| paal::data_structures::facility_location_solution_traits< facility_location_solution< FacilityCost, Voronoi > > | Traits for facility_location_solution |
| paal::local_search::facility_locationget_moves_add | Gain functor for add moves in facility location problem |
| paal::local_search::facility_locationget_moves_remove | Get moves functor for facility location remove |
| paal::local_search::facility_locationget_moves_swap | Get moves functor for facility location problem |
| paal::utils::failure_message | Functor prints failure message |
| false_type | |
| paal::data_structures::is_sparse_row< RowType, Enable > | |
| filter_iterator | |
| paal::utils::iterator_with_excluded_element< Iterator > | This iterator exlcludes one specific element from range |
| paal::local_search::find_positive_predicate | This predicates returns true if there is a move with positive gain and the commit was successful |
| paal::local_search::first_improving_strategy | This strategy uses find_positive_predicate as stop condition |
| paal::lp::first_violated_separation_oracle | Functor computing add_first_violated |
| paal::local_search::fitness_from_gain_and_get_moves< Gain, GetMoves, Solution > | Metafunction returns Fitness type in single_solution case |
| paal::utils::concepts::floating_point< T > | Concept class for floating point types |
| paal::data_structures::fold< Vector, StartValue, Functor > | Standard fold function implementation |
| paal::data_structures::fold< TypesVector< Arg, Args...>, StartValue, Functor > | Standard fold function implementation |
| paal::data_structures::fold< TypesVector<>, StartValue, Functor > | Standard fold function implementation, empty list case |
| paal::data_structures::detail::forward_tag | |
| paal::data_structures::fraction< A, B > | Simple class to represent fraction |
| paal::frequent_directions< Matrix > | Represents sketch of matrix |
| paal::utils::functor_to_comparator< Functor, Compare > | |
| paal::ir::ga_init | |
| paal::ir::ga_relax_condition | |
| paal::ir::ga_set_solution | |
| gain | |
| paal::local_search::gain_cut_small_improves< Gain, ValueType > | This is the gain adapter which accepts gains improving the current solution by more than epsilon. This adapter should be used only when ChooseFirstBetter strategy is applied |
| paal::local_search::gain_two_opt< Metric > | Gain for two opt moves |
| gamma_oracle_func | |
| paal::ir::generalised_assignment< MachineIter, JobIter, Cost, ProceedingTime, MachineAvailableTime, JobsToMachinesOutputIterator > | The class for solving the Generalised Assignment problem using Iterative Rounding |
| paal::auctions::detail::get_bids | |
| get_copies_num_func | |
| paal::detail::get_max_element_on_capacity_indexed_collection< ValueType > | |
| paal::detail::get_max_element_on_value_indexed_collection< MaxValueType, SizeType > | |
| get_moves | |
| paal::data_structures::detail::get_name< T > | Get_name, gets name for either Name, or NamesWithDefaults struct this is the Name case |
| paal::data_structures::detail::get_name< NameWithDefault< Name, Default > > | Get_name, gets name for either Name, or NamesWithDefaults struct this is the NamesWithDefaults case |
| paal::data_structures::detail::get_types< Comp > | Generic get_types |
| paal::data_structures::detail::get_types< components< Names, Types > > | |
| paal::lp::detail::glp_impl | LP implementation using GLPK |
| paal::data_structures::graph_metric< Graph, DistanceType, graph_type::large_tag > | Specialization for large graphs |
| paal::data_structures::graph_metric_filler_impl< graph_tag_type > | Generic strategies of computing metric |
| paal::data_structures::graph_metric_filler_impl< graph_metric_traits< Graph >::graph_tag_type > | |
| paal::data_structures::graph_metric< Graph, DistanceType, GraphType > | Adopts boost graph as Metric |
| paal::data_structures::graph_metric_filler_impl< graph_type::dense_tag > | Specialization strategies of computing metric for dense_tag graphs |
| paal::data_structures::graph_metric_filler_impl< graph_type::sparse_tag > | Specialization for sparse_tag graphs |
| paal::data_structures::graph_metric_traits< Graph > | Traits for graph metric |
| paal::data_structures::graph_metric_traits< boost::adjacency_list< OutEdgeList, VertexList, Directed, VertexProperties, EdgeProperties, GraphProperties, EdgeList > > | Specialization for adjacency_list |
| paal::data_structures::graph_metric_traits< boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator > > | Specialization for adjacency_matrix |
| paal::utils::greater | Greater functor |
| paal::utils::greater_equal | Greater_equal functor |
| ham_tag | |
| paal::data_structures::detail::has_template_get< T, Name > | SFINAE check if the given type has get<Name>() member function |
| std::hash< paal::lp::Id > | |
| std::hash< paal::lp::col_id > | |
| std::hash< paal::lp::row_id > | |
| paal::hash_function_tuple< Funs > | Functor representing tuple of hash functions |
| paal::hash_function_tuple_generator< FunctionGenerator > | |
| paal::lp::Id | |
| paal::lp::col_id | |
| paal::lp::row_id | |
| paal::utils::identity_functor | Functor returns its argument |
| paal::utils::ignore_param | Type that can be constructed from anything and has no other functionality |
| paal::detail::infinity< sign > | If the sign = true, class represents plus_infinity: object bigger than everything if the sign = false, class represents minus_infinity |
| paal::detail::integral_size_tag | |
| paal::detail::integral_value_and_size_tag | |
| paal::detail::integral_value_tag | |
| paal::local_search::simulated_annealing_gain_adaptor< Gain, GetTemperature, random_generator >::is_chosen< Delta > | This object represents Delta computed by gain and the decision if the object is taken or not |
| paal::detail::is_range_const< Range > | |
| paal::ir::detail::iterative_rounding< Problem, IRcomponents, Visitor, LP > | This class solves an iterative rounding problem |
| iterator | |
| paal::data_structures::simple_cycle< CycleEl, IdxT >::edge_iterator | Iterator on cycle edges |
| paal::data_structures::simple_cycle< CycleEl, IdxT >::vertex_iterator | Iterator over vertices of the cycle |
| iterator_facade | |
| paal::data_structures::combine_iterator< Joiner, Ranges > | Combine_iterator iterates through all combinations of values from given ranges and returns them joined together using given Joiner |
| paal::data_structures::cycle_iterator< Iter > | For given collection (begin -> end) and start iterator pointing to an element inside collection (begin -> ... -> start -> ... ->end), returns new collection created by shifting the old collection to start |
| paal::data_structures::detail::Iterator< V, direction_tag > | |
| paal::data_structures::subsets_iterator< k, Iterator, Joiner > | Iterator to all k-subsets of given collection |
| paal::utils::singleton_iterator< Elem > | Iterator to range containing single element |
| jaccard_tag | |
| paal::data_structures::join< Components1, Components2 > | Detail |
| paal::data_structures::join< components< ComponentName1, ComponentNamesWithDefaults1...>, components< ComponentNamesWithDefaults2...>> | Normal case |
| paal::data_structures::join< components< NameWithDefault< Name1, Default1 >, ComponentNamesWithDefaults1...>, components< ComponentName2, ComponentNamesWithDefaults2...> > | First components class has only names with defaults |
| paal::data_structures::join< components< NameWithDefault< Name1, Default1 >, ComponentNamesWithDefaults1...>, components< NameWithDefault< Name2, Default2 >, ComponentNamesWithDefaults2...> > | Both components classes have only names with defaults |
| paal::data_structures::join< components< NameWithDefault< Name1, Default1 >, ComponentNamesWithDefaults1...>, components<> > | First components class has only names with defaults, second components class is empty. This case cannot be simplified to just "Second components class is empty" to disambiguate pattern matching |
| paal::data_structures::join< components<>, components< ComponentNamesWithDefaults2...> > | First components class is empty |
| paal::data_structures::join< TypesVector< Args1...>, TypesVector< Args2...> > | Joins to TypesVectors, implementation |
| paal::k_means_visitor | K means visitor |
| paal::detail::k_tuple< T, k > | |
| paal::detail::k_tuple< T, 1 > | |
| paal::detail::Knapsack_0_1< Objects, ObjectSizeFunctor, ObjectValueFunctor, Comparator > | This class helps solving 0/1 knapsack problem. Function solve returns the optimal value Function Retrieve solution returns chosen elements |
| paal::detail::Knapsack_0_1_get_position_range | For 0/1 knapsack dynamic algorithm for given element the table has to be traversed from the highest to the lowest element |
| paal::detail::knapsack_base< Objects, ObjectSizeFunctor, ObjectValueFunctor > | |
| paal::detail::knapsack_data< GetSize, GetValue, Objects, OutputIterator > | |
| paal::detail::knapsack_get_position_range | For knapsack dynamic algorithm for given element the table has to be traversed from the lowest to highest element |
| l1_tag | |
| l2_tag | |
| paal::lsh::l_p_hash_function< FloatType > | Hash_function for l_p distance for p in range (0,2] |
| paal::lsh::l_p_hash_function_generator< FloatType, RandomEngine, Distribution > | Factory class for l_p_hash_function |
| paal::lp::LeftBoundTag | |
| paal::distance_oracle_thorup2kminus1approximation< Graph, VertexIndexMap, EdgeWeightMap, Rand >::cluster_dist::less | A comparator struct adjusted to recognize unmodified values |
| paal::utils::less | Less functor |
| paal::utils::less_equal | Less_equal functor |
| paal::less_pointees_t< Comparator > | Compare pointee using comparator |
| paal::utils::lift_binary_operator_functor< FunctorLeft, FunctorRight, Operator > | |
| paal::utils::lift_binary_operator_functor< FunctorLeft, FunctorRight, And > | |
| paal::utils::and_functor< FunctorLeft, FunctorRight > | And_functor |
| paal::utils::lift_binary_operator_functor< FunctorLeft, FunctorRight, not_equal_to > | |
| paal::utils::xor_functor< FunctorLeft, FunctorRight > | Xor_functor |
| paal::utils::lift_binary_operator_functor< FunctorLeft, FunctorRight, Or > | |
| paal::utils::or_functor< FunctorLeft, FunctorRight > | Or_functor |
| paal::utils::lift_iterator_functor< Functor > | For given functor f, lift_iterator_functor provides operator()(Iterator iterator) which returns f(*iter) |
| paal::detail::lightweight_tag | |
| paal::lp::linear_expression | |
| paal::local_search::detail::local_search_concepts< Solution, SearchComponentsPack > | |
| paal::local_search::detail::local_search_concepts< Solution > | |
| paal::local_search::detail::local_search_concepts< Solution, SearchComponentsPack...> | |
| paal::local_search::detail::local_search_concepts< Solution, SearchComponents, SearchComponentsPack...> | |
| paal::detail::lower_tag | |
| paal::lp::LowerBoundTag | |
| LP | |
| paal::lp::detail::lp_base< LP > | The common LP solvers base class. Responsible for: |
| paal::lsh_nearest_neighbors_regression< HashValue, LshFun, HashForHashValue > | Detail |
| paal::local_search::make_move | Functor creating Move |
| paal::local_search::make_swap | Functor creating Move |
| paal::make_tuple | Function object for std::make_tuple |
| paal::data_structures::mapped_file | Data structure that gets new lines for many threads |
| paal::data_structures::matrix_type_traits< Matrix > | Traits class for matrix related types |
| paal::data_structures::matrix_type_traits< boost::numeric::ublas::matrix< T > > | Specialization matrix_type_traits for ublas matrix |
| paal::utils::max | Max |
| paal::local_search::max_functor | Functor used in fold in order to find the most improving move |
| paal::lp::max_violated_separation_oracle | Functor computing add_max_violated |
| paal::data_structures::metric_on_idx< Metric, Bimap, Strategy > | This metric keeps inner metric and index. Given vertices are reindex and passed to inner metric |
| paal::data_structures::metric_on_idx< MetricIdx &, const VertexIndex &, data_structures::read_values_tag > | |
| paal::utils::min | Min |
| paal::ir::min_cut_finder | Class for creating and modifying directed graphs with edge capacities and finding directed minimum cuts between given vertices |
| paal::lsh::min_hash_function | Min-wise independent permutations locality sensitive hashing (Jaccard) |
| paal::lsh::min_hash_function_generator< RandomEngine > | Factory class for min_hash_function |
| paal::utils::minus | Minus |
| paal::data_structures::detail::movable_tag | Tag indicating that given object is movable |
| paal::local_search::Move | Class describing Move |
| paal::utils::concepts::move_constructible< T > | Concept class for move constructible types |
| paal::local_search::move_type_from_get_moves< GetMoves, Solution > | Metafunction returns move type in single_solution case |
| paal::local_search::move_type_from_get_moves< search_components_traits< SearchComponents >::GetMovesT, Solution > | |
| paal::local_search::move_type< SearchComponents, Solution > | Metafunction returns move type in single_solution case |
| paal::detail::multiway_cut_lp< LP > | |
| paal::local_search::n_queens_commit | N_queens_commit functor |
| paal::local_search::n_queens_gain | N_queens_gain functor |
| paal::local_search::n_queens_solution_adapter< NQueensPositionsVector > | Adapts vector representing n queen problem to class able to efficiently compute gain of given move |
| paal::local_search::n_queensget_moves | Detail |
| paal::data_structures::NameWithDefault< Name, Default > | This structure can be passed on Names list and represents Name and the default type value |
| paal::detail::no_retrieve_solution_tag | |
| paal::data_structures::detail::Node< V > | |
| paal::detail::non_integral_value_and_size_tag | |
| paal::detail::Nonarithmetic_size_tag | |
| paal::utils::Not | Not |
| paal::utils::not_equal_to | Not_equal_to functor |
| paal::utils::not_functor< Functor > | Not_functor |
| paal::data_structures::detail::Notmovable_tag | Tag indicating that given object is not movable |
| paal::local_search::detail::obj_fun_commit< Commit, Fitness > | |
| paal::local_search::detail::obj_fun_gain< Fitness > | |
| paal::local_search::detail::obj_fun_get_moves< F, GetMoves, Commit > | |
| paal::data_structures::object_with_copy< T > | Keeps object and its copy. Invoke all the member functions on both: object and its copy. If you want to invoke member function on both objects, you run the object_with_copy::invoke. If you want to run member function only on the copy you run object_with_copy::invoke_on_copy |
| paal::utils::Or | Or |
| paal::utils::concepts::output_iterator< Iter, Val > | Concept class for output iterator concept. We don't use boost::OutputIterator concept as it excludes boost::function_output_iterator with lambda function |
| params | |
| paal::distance_oracle_thorup2kminus1approximation< Graph, VertexIndexMap, EdgeWeightMap, Rand >::cluster_dist::plus | Plus operation struct |
| paal::utils::plus | Plus |
| paal::data_structures::polymorfic_fold | Class for polymorphic join on boost fusion sequence |
| paal::data_structures::pos< Type, TypesVector > | Returns pos of the element in the TypesVector |
| paal::data_structures::pos< Type, TypesVector< Type, TypesSufix...> > | |
| paal::data_structures::pos< Type, TypesVector< TypesPrefix, TypesSufix...> > | Returns pos of Type in given TypeList |
| paal::greedy::detail::prefix_tree< Letter > | |
| paal::pretty_stream< Stream > | Pretty_stream stream that uses pretty_to_string method |
| paal::lsh::projection_hash_function< IntType > | Simple hash function |
| paal::utils::property_map_get< Map > | Functor object for property map get. This class exists because std::bind can't be used with polymorphic functions and we don't have polymorphic lambdas yet to allow perfect forwarding |
| paal::data_structures::push_back< Vector, Val > | Push back given val to TypesVector |
| paal::data_structures::push_back< TypesVector< Args...>, Val > | Push back given val to TypesVector |
| paal::data_structures::detail::push_back_default | |
| paal::data_structures::detail::push_back_name | Meta function takes NameWithDefault and Vector the result is new vector with new Name appended Name |
| put_get_helper | |
| paal::ir::detail::const_int_map< KeyType, num > | A boost graph map that returns a constant integer value |
| paal::detail::radix_pass | |
| paal::lsh::random_projection_hash_function_generator< RandomEngine, IntType > | Factory class for projection_hash_function |
| paal::lp::detail::random_rotate< URNG > | |
| paal::lp::random_violated_separation_oracle | Detail |
| paal::range_hash | Functor that can be used as a std::unordered_map/set hash param, when key is a range. copied from: http://stackoverflow.com/questions/10405030/c-unordered-map-fail-when-used-with-a-vector-as-key |
| paal::data_structures::read_indexes_tag | |
| paal::data_structures::read_values_tag | |
| paal::utils::concepts::readable_range< T > | Concept class for readable range concept |
| paal::local_search::record_solution_commit_adapter< Commit, Solution, Comparator > | This is adaptor on Commit which allows to record solution basing on condition It is particularly useful in tabu search and simulated annealing in which we'd like to store the best found solution |
| paal::data_structures::rectangle_array_metric< DistanceTypeParam > | Metric implementation on 2 dimensional array distance calls on this metric are valid opnly when x < N and y < M (N and M given in the constructor) when we know that only certain calls occurs it might be worthwhile to use this metric |
| paal::data_structures::array_metric< DistanceTypeParam > | This metric is rectangle_array_metric with N == M |
| paal::data_structures::rectangle_array_metric< Dist > | |
| paal::data_structures::array_metric< Dist > | |
| paal::data_structures::rectangle_array_metric< DistanceType > | |
 paal::data_structures::array_metric< DistanceType > | |
 paal::data_structures::graph_metric< Graph, DistanceType, GraphType > | Adopts boost graph as Metric |
| paal::ir::relaxations_limit_condition | Checks if the relaxations limit was reached |
| paal::data_structures::remove_n_first< n, V > | Removes first n elements from given TypesVector |
| paal::data_structures::remove_n_first< 0, TypesVector< Arg, Args...> > | Two cases below cannot be one becasuse of ambiguity in instancaition |
| paal::data_structures::remove_n_first< 0, TypesVector<> > | Removes first n elements from given TypesVector, n=0 case |
| paal::data_structures::remove_n_first< n, TypesVector< Arg, Args...> > | Removes first n elements from given TypesVector |
| paal::utils::remove_reference | Removes reference |
| paal::data_structures::replace_at_pos< pos, NewType, TypesVector > | Replace element at pos to NewType |
| paal::data_structures::replace_at_pos< 0, NewType, TypesVector< TypesPrefix, TypesSufix...> > | Replace type at pos to new type, specialization for pos = 0 |
| paal::data_structures::replace_at_pos< pos, NewType, TypesVector< TypesPrefix, TypesSufix...> > | Replace type at pos to new type |
| paal::data_structures::replaced_type< Name, NewType, components > | Generic version of replaced_type |
| paal::data_structures::replaced_type< Name, NewType, detail::components< Names, Types > > | |
| paal::detail::retrieve_solution_tag | |
| paal::utils::return_constant_functor< T, t > | Functor returns always the same number. The number has to be known at compile time |
| paal::utils::return_constant_functor< bool, false > | |
| paal::utils::always_false | Functor return false |
| paal::utils::return_constant_functor< bool, true > | |
| paal::utils::always_true | Functor return true |
| paal::utils::return_constant_functor< int, 0 > | |
| paal::utils::return_zero_functor | Functor returns 0 |
| paal::utils::return_constant_functor< int, 1 > | |
| paal::utils::return_one_functor | Functor returns 1 |
| paal::data_structures::detail::reversed_tag | |
| paal::lp::RightBoundTag | |
| paal::ir::round_condition_equals<> | Column rounding component. Rounds a column if its value is equal to one of the template parameter values |
| paal::ir::round_condition_equals< 0 > | |
| paal::ir::round_condition_equals< args...> | |
| paal::ir::round_condition_equals< arg, args...> | Column rounding component. Rounds a column if its value is equal to one of the template parameter values |
| paal::ir::round_condition_equals<> | Column rounding component. Rounds a column if its value is equal to one of the template parameter values. Edge case (no template parameter values) |
| paal::ir::round_condition_to_fun< Cond, F > | Column rounding component. Rounds a column if its value satisfies a fixed condition. The column is rounded to a value defined by a fixed function |
| paal::ir::round_condition_to_fun< cond_bigger_equal_than, utils::return_one_functor > | |
| paal::ir::round_condition_greater_than_half | Column rounding component. A variable is rounded up to 1, if it has value at least half in the solution |
| paal::ir::row_generation_solve_lp< SolveLP > | |
| paal::data_structures::Satisfy | Find for StaticLazyJoin |
| paal::utils::scale_functor< Functor, ScaleType, ReturnType > | Functor that scales another functor |
| paal::greedy::detail::sched_traits< MachineIterator, JobIterator, GetSpeed, GetLoad > | |
| paal::local_search::concepts::search_components< X, Solution > | |
| paal::local_search::search_components_traits< search_components > | Traits class for search_components |
| paal::local_search::search_obj_function_components_traits< SearchComponentsObjFun > | Traits class for search_componentsObjFun |
| paal::greedy::detail::selector< Budget, SetCost, SetIdToData, ElementWeight, SetIdToElements, ElementIndex, GetWeightOfElement, DecreseWeight > | |
| paal::greedy::detail::set_data_type< ElementWeight, SetCost > | |
| paal::data_structures::detail::set_defaults< Names, Defaults, TypesPrefix > | |
| paal::greedy::detail::shortest_superstring< Words > | Class to solve shortest superstring 3.5 aproximation, using greedy algorithm: contract pair of words with largest overlap until one word stays
#include <iostream>
#include <string>
int main() {
std::vector<std::string> words({ "ba", "ab", "aa", "bb" });
}
|
| paal::data_structures::simple_cycle< CycleEl, IdxT > | This is the simplest implementation of the Cycle concept based on the list |
| paal::data_structures::Simplecycle_start_from_last_change< CycleEl, IdxT > | This class adapts Simple cycle to start from last changed position |
| paal::local_search::simulated_annealing_commit_adaptor< Commit, Gain, GetTemperature, random_generator > | This adaptor takes Cammit functor and adopts it to simulated annealing. If the input move has positive gain it is chosen otherwise the move is chosen wit probability e^(movesGain/Temperature). Temperature is given by getTemperature functor |
| paal::local_search::simulated_annealing_gain_adaptor< Gain, GetTemperature, random_generator > | This adaptor takes Gain functor and adopts it to simulated annealing. For each move, if it has positive gain it is chosen otherwise the move is chosen wit probability e^(movesGain/Temperature). Temperature is given by getTemperature functor |
| paal::lp::single_bounded_expression< BoundTypeTag, BoundDirectionTag > | |
| paal::auctions::concepts::single_minded< Bidders, Items, GetValue, GetItems, GetCopiesNum > | |
| paal::data_structures::size< Vec > | Computes size of TypesVector |
| paal::data_structures::size< TypesVector< Args...> > | Computes size of TypesVector |
| paal::utils::skip_functor | Functor does nothing |
| paal::data_structures::splay_cycle< T > | Cycle based on splay tree |
| paal::data_structures::splay_tree< T > | Detail |
| paal::data_structures::stack< T > | Stack |
| paal::data_structures::stack< detail::tail< Element > > | |
| paal::ir::steiner_component< Vertex, Dist > | Class represents k-components of Steiner Tree. Component is a subtree whose terminals coincide with leaves |
| paal::ir::steiner_components< Vertex, Dist > | |
| paal::ir::steiner_network< Graph, Restrictions, CostMap, VertexIndex, ResultNetworkOutputIterator, Oracle > | The class for solving the Steiner Network problem using Iterative Rounding |
| paal::ir::steiner_network_init | |
| paal::ir::steiner_network_round_condition | |
| paal::ir::steiner_network_set_solution | |
| paal::ir::steiner_network_violation_checker | Violations checker for the separation oracle in the steiner network problem |
| paal::detail::steiner_tree< Metric, Voronoi > | This is Alexander Zelikovsky 11/6 approximation algorithm for steiner tree |
| paal::ir::steiner_tree< OrigMetric, Terminals, Result, Strategy, Oracle > | The class for solving the Steiner Tree problem using Iterative Rounding |
| paal::ir::steiner_tree_all_generator | |
| paal::ir::steiner_tree_graph_all_generator< Graph, Vertex, Terminals > | |
| paal::ir::steiner_tree_init | |
| paal::ir::steiner_tree_random_generator | |
| paal::ir::steiner_tree_round_condition | |
| paal::ir::steiner_tree_set_solution | |
| paal::ir::steiner_tree_smart_generator | |
| paal::ir::steiner_tree_stop_condition | |
| paal::ir::steiner_tree_violation_checker | Violations checker for the separation oracle in the steiner tree problem |
| paal::ir::steiner_utils | |
| paal::local_search::stop_condition_count_limit | This is custom StopCondition , it returns true after given count limit |
| paal::local_search::stop_condition_time_limit< duration, clock > | This is custom StopCondition, it returns true after given time limit |
| paal::subset_backtrack< Element > | Detail |
| paal::data_structures::subsets_iterator_engine< k, Iterator > | |
| paal::data_structures::subsets_iterator_engine< 0, Iterator > | Specialization for k==0 for boundary cases. This class stores iterator pointing to the end of the input collection |
| paal::detail::svm_row< CoordinatesType, ResultType, FeatureIdType > | Class that can read single svm row |
| paal::local_search::Swap< Element > | Swap |
| paal::ir::ta_init | |
| paal::ir::ta_round_condition | |
| paal::ir::ta_set_solution | |
| paal::local_search::tabu_gain_adaptor< TabuList, Gain, AspirationCriteria > | Adapts gain to implement tabu search |
| paal::data_structures::tabu_list_remember_move< Move > | This Tabu list remember some number of last moves |
| paal::data_structures::tabu_list_remember_move< std::pair< Solution, Move > > | |
| paal::data_structures::tabu_list_remember_solution_and_move< Solution, Move > | This Tabu list remember both current solution and move It is implemented as tabu_list_remember_move<pair<Solution, Move>> with nullptr passed as dummy solution |
| paal::detail::tail< Element > | |
| paal::data_structures::detail::temp_replaced_components< Name, NewType, Names, Types > | |
| TempReplacecomponents | This class behavies like partial components<Names, Types>, with type for Name chanche to Type |
| detail::test_xor_bids_gamma_oracle< GetBids, GetValue, GetItems, Gamma > | |
| paal::thread_pool | Simple threadpool, class uses also current thread! |
| paal::ir::tree_aug< Graph, TreeMap, CostMap, VertexIndex, EdgeSetOutputIterator > | This is Jain's iterative rounding 2-approximation algorithm for the Generalised Steiner Network Problem, specialized for the Tree Augmentation Problem |
| trivial_commit | Used in case when update is actually the new solution |
| paal::ir::trivial_visitor | Default Iterative Rounding visitor |
| true_type | |
| paal::data_structures::is_sparse_row< RowType, typename std::enable_if< std::is_same< typename paal::decay_t< RowType >::container_type::storage_category, boost::numeric::ublas::sparse_tag >::value >::type > | |
| paal::utils::tuple_get< I > | Functor for std::tuple::get<I> |
| paal::local_search::detail::tuple_to_move | |
| paal::utils::tuple_uncurry< F > | Transforms a functor taking multiple parameters into a functor taking a tuple parameter |
| paal::local_search::two_local_search_adapter< Cycle > | Adapts cycle to have begin and end pointing to edge collection |
| paal::local_search::two_local_search_commit | Commit class for local_search |
| paal::local_search::two_local_searchget_moves | Commit class for local_search |
| paal::data_structures::detail::type_for_name< Name, Names, Types > | If Name is kth on Names list, returns kth Type |
| paal::data_structures::detail::type_for_name< Name, TypesVector< Name, NamesRest...>, TypesVector< Type, TypesRest...> > | Specialization when found |
| paal::data_structures::TypesVector< Args > | TypesVector |
| paal::detail::unbounded_tag | |
| paal::detail::upper_tag | |
| paal::lp::UpperBoundTag | |
| value_query_func | |
| vertex_cover< Graph, CostMap, OutputIter > | [Iterative Rounding Problem Example] |
| vertex_cover_init | [Iterative Rounding Problem Example] |
| vertex_cover_set_solution | |
| paal::ir::detail::vertex_filter< Vertex > | |
| paal::data_structures::vertex_to_edge_iterator< vertex_iterator > | Transforms collection to collection of pairs consecutive elements of the input collection. The last element and the first element are considered consecutive |
| paal::data_structures::voronoi< Metric > | Simple implementation of the Voronoi concept |
| paal::data_structures::detail::wrap_to_constructable< T > | Wraps type to constructible type |
| X | |
| paal::auctions::concepts::xor_bids< Bidders, Items, GetBids, GetValue, GetItems, GetCopiesNum > | |
| paal::auctions::detail::xor_bids_demand_query< GetBids, GetValue, GetItems > | |
| paal::auctions::detail::xor_bids_gamma_oracle< GetBids, GetValue, GetItems > | |
| paal::auctions::detail::xor_bids_traits< Bidder, GetBids, GetValue, GetItems > | |
| paal::auctions::detail::xor_bids_value_query< GetBids, GetValue, GetItems > | |
| Y | |
| Z | |
| paal::detail::zero_one_tag | |
1.8.5
