detail  
test_xor_bids_gamma_oracle  
paal  Global namespace of project 
auctions  Auctions namespace 
concepts  Auctions Concepts namespace 
auction  
value_query_auction  
demand_query_auction  
gamma_oracle_auction  
single_minded  
xor_bids  
detail  Concepts 
bid  
get_bids  
bidder_info  
determine_winners_in_gamma_oracle_auction_traits  
xor_bids_traits  
xor_bids_value_query  
xor_bids_demand_query  
xor_bids_gamma_oracle  
auction_traits  Types associated with all auctions 
value_query_auction_traits  Types associated with value query auction 
demand_query_auction_traits  Types associated with demand query auction 
gamma_oracle_auction_traits  Types associated with gamma oracle auction 
data_structures  Data Structure namespace 
concepts  Concepts of Data Structure namespace 
Cycle  
detail  Detail of Data Structure namespace 
wrap_to_constructable  Wraps type to constructible type 
type_for_name  If Name is kth on Names list, returns kth Type 
type_for_name< Name, TypesVector< Name, NamesRest...>, TypesVector< Type, TypesRest...> >  Specialization when found 
has_template_get  SFINAE check if the given type has get<Name>() member function 
movable_tag  Tag indicating that given object is movable 
Notmovable_tag  Tag indicating that given object is not movable 
components  
components< TypesVector<>, TypesVector<> >  
components< TypesVector< Name, NamesRest...>, TypesVector< Type, TypesRest...> >  
set_defaults  
get_name  Get_name, gets name for either Name, or NamesWithDefaults struct this is the Name case 
get_name< NameWithDefault< Name, Default > >  Get_name, gets name for either Name, or NamesWithDefaults struct this is the NamesWithDefaults case 
push_back_name  Meta function takes NameWithDefault and Vector the result is new vector with new Name appended Name 
apply  
push_back_default  
apply  
apply< Vector, NameWithDefault< Name, Default > >  
concat  
concat< paal::data_structures::components< ComponentNamesWithDefaults1...>, paal::data_structures::components< ComponentNamesWithDefaults2...> >  
get_types  Generic get_types 
get_types< components< Names, Types > >  
temp_replaced_components  
Node  
forward_tag  
reversed_tag  
Iterator  
bimap_mic  Same as Bimap, but implemented using boost::multi_index_container. Unfortunately slower 
bimap  Implements both sides mapping from the collection to (0,size(collection)) interval 
eraseable_bimap  This maps support erasing elements, Alert inefficient!! 
bimap_of_consecutive  In this bimap we know that elements forms permutation this allows optimization 
bimap_traits< bimap< ValT, IdxT > >  Traits specialization for Bimap 
bimap_traits< eraseable_bimap< ValT, IdxT > >  Traits specialization for eraseable_bimap 
bimap_traits< bimap_of_consecutive< ValT, IdxT > >  Traits specialization for bimap_of_consecutive 
bimap_traits< bimap_mic< ValT, IdxT > >  Traits specialization for bimap_mic 
bimap_traits  
collection_starts_from_last_change  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 
combine_iterator_engine  Class representing set of ranges with two operation next and call 
combine_iterator_engine< Range, RangesRest...>  
combine_iterator_engine<>  Specialization for empty ranges lists 
combine_iterator  Combine_iterator iterates through all combinations of values from given ranges and returns them joined together using given Joiner 
component_traits  
component_traits< detail::components< Names, Types > >  
NameWithDefault  This structure can be passed on Names list and represents Name and the default type value 
copy_tag  Indicates that components constructor is in fact a Copy/Move Constructor 
components  
join  Detail 
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 
join< components< NameWithDefault< Name1, Default1 >, ComponentNamesWithDefaults1...>, components< NameWithDefault< Name2, Default2 >, ComponentNamesWithDefaults2...> >  Both components classes have only names with defaults 
join< components< NameWithDefault< Name1, Default1 >, ComponentNamesWithDefaults1...>, components< ComponentName2, ComponentNamesWithDefaults2...> >  First components class has only names with defaults 
join< components<>, components< ComponentNamesWithDefaults2...> >  First components class is empty 
join< components< ComponentName1, ComponentNamesWithDefaults1...>, components< ComponentNamesWithDefaults2...>>  Normal case 
replaced_type  Generic version of replaced_type 
replaced_type< Name, NewType, detail::components< Names, Types > >  
TypesVector  TypesVector 
size  Computes size of TypesVector 
size< TypesVector< Args...> >  Computes size of TypesVector 
fold  Standard fold function implementation 
fold< TypesVector< Arg, Args...>, StartValue, Functor >  Standard fold function implementation 
fold< TypesVector<>, StartValue, Functor >  Standard fold function implementation, empty list case 
push_back  Push back given val to TypesVector 
push_back< TypesVector< Args...>, Val >  Push back given val to TypesVector 
at  Gives element on id in TypesVector 
at< TypesVector< Arg, Args...>, std::integral_constant< C, i > >  Gives element on id in TypesVector 
at< TypesVector< Arg, Args...>, std::integral_constant< C, 0 > >  Gives element on id in TypesVector, at 0 case 
join< TypesVector< Args1...>, TypesVector< Args2...> >  Joins to TypesVectors, implementation 
remove_n_first  Removes first n elements from given TypesVector 
remove_n_first< n, TypesVector< Arg, Args...> >  Removes first n elements from given TypesVector 
remove_n_first< 0, TypesVector< Arg, Args...> >  Two cases below cannot be one becasuse of ambiguity in instancaition 
remove_n_first< 0, TypesVector<> >  Removes first n elements from given TypesVector, n=0 case 
pos  Returns pos of the element in the TypesVector 
pos< Type, TypesVector< TypesPrefix, TypesSufix...> >  Returns pos of Type in given TypeList 
pos< Type, TypesVector< Type, TypesSufix...> >  
replace_at_pos  Replace element at pos to NewType 
replace_at_pos< pos, NewType, TypesVector< TypesPrefix, TypesSufix...> >  Replace type at pos to new type 
replace_at_pos< 0, NewType, TypesVector< TypesPrefix, TypesSufix...> >  Replace type at pos to new type, specialization for pos = 0 
cycle_start_from_last_change  Adopts any cycle to start (vbegin) i place of the last change(flip) 
cycle_traits  Traits for Cycle concept 
simple_cycle  This is the simplest implementation of the Cycle concept based on the list 
edge_iterator  Iterator on cycle edges 
vertex_iterator  Iterator over vertices of the cycle 
Simplecycle_start_from_last_change  This class adapts Simple cycle to start from last changed position 
splay_cycle  Cycle based on splay tree 
cycle_iterator  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 
facility_location_solution  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 
facility_location_solution_traits< facility_location_solution< FacilityCost, Voronoi > >  Traits for facility_location_solution 
facility_location_solution_traits  
k_median_solution  Solution for k median problem 
facility_location_solution_traits< data_structures::k_median_solution< voronoi > >  Specialization of facility_location_solution_traits 
fraction  Simple class to represent fraction 
mapped_file  Data structure that gets new lines for many threads 
rectangle_array_metric  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 
array_metric  This metric is rectangle_array_metric with N == M 
euclidean_metric  Metric with euclidean distance 
metric_traits< euclidean_metric< T > >  
graph_metric_traits  Traits for graph metric 
graph_metric_filler_impl  Generic strategies of computing metric 
graph_metric_filler_impl< graph_type::sparse_tag >  Specialization for sparse_tag graphs 
graph_metric_filler_impl< graph_type::dense_tag >  Specialization strategies of computing metric for dense_tag graphs 
graph_metric  Adopts boost graph as Metric 
graph_metric< Graph, DistanceType, graph_type::large_tag >  Specialization for large graphs 
graph_metric_traits< boost::adjacency_list< OutEdgeList, VertexList, Directed, VertexProperties, EdgeProperties, GraphProperties, EdgeList > >  Specialization for adjacency_list 
graph_metric_traits< boost::adjacency_matrix< Directed, VertexProperty, EdgeProperty, GraphProperty, Allocator > >  Specialization for adjacency_matrix 
read_values_tag  
read_indexes_tag  
metric_on_idx  This metric keeps inner metric and index. Given vertices are reindex and passed to inner metric 
metric_traits< metric_on_idx< Metric, Bimap, read_indexes_tag > >  
metric_traits< metric_on_idx< Metric, Bimap, read_values_tag > >  
adjacency_matrix  Type of adjacency_matrix, for given metric 
_metric_traits  Base for metric traits 
metric_traits  Metric traits 
object_with_copy  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 
splay_tree  Detail 
stack  Stack 
subsets_iterator_engine  
subsets_iterator_engine< 0, Iterator >  Specialization for k==0 for boundary cases. This class stores iterator pointing to the end of the input collection 
subsets_iterator  Iterator to all ksubsets of given collection 
tabu_list_remember_move  This Tabu list remember some number of last moves 
tabu_list_remember_solution_and_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 
is_sparse_row  
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 >  
matrix_type_traits  Traits class for matrix related types 
matrix_type_traits< boost::numeric::ublas::matrix< T > >  Specialization matrix_type_traits for ublas matrix 
vertex_to_edge_iterator  Transforms collection to collection of pairs consecutive elements of the input collection. The last element and the first element are considered consecutive 
capacitated_voronoi  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 
Dist  This class store as a distance: 
voronoi  Simple implementation of the Voronoi concept 
voronoi_traits< voronoi< Metric > >  Specialization of voronoi_traits 
_voronoi_traits  Voronoi traits base 
voronoi_traits  Default VertexType is int 
polymorfic_fold  Class for polymorphic join on boost fusion sequence 
Satisfy  Find for StaticLazyJoin 
detail  Detail namespace 
upper_tag  
lower_tag  
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 
Knapsack_0_1  This class helps solving 0/1 knapsack problem. Function solve returns the optimal value Function Retrieve solution returns chosen elements 
knapsack_get_position_range  For knapsack dynamic algorithm for given element the table has to be traversed from the lowest to highest element 
get_max_element_on_value_indexed_collection  
get_max_element_on_capacity_indexed_collection  
is_range_const  
nearest_recorder  
multiway_cut_lp  
lightweight_tag  
steiner_tree  This is Alexander Zelikovsky 11/6 approximation algorithm for steiner tree 
tail  
radix_pass  
infinity  If the sign = true, class represents plus_infinity: object bigger than everything if the sign = false, class represents minus_infinity 
knapsack_base  
integral_value_and_size_tag  
integral_value_tag  
integral_size_tag  
non_integral_value_and_size_tag  
arithmetic_size_tag  
Nonarithmetic_size_tag  
zero_one_tag  
unbounded_tag  
retrieve_solution_tag  
no_retrieve_solution_tag  
knapsack_data  
svm_row  Class that can read single svm row 
k_tuple  
k_tuple< T, 1 >  
greedy  Greedy namespace 
detail  Detail of Greedy namespace 
sched_traits  
compare  
set_data_type  
selector  
prefix_tree  
shortest_superstring  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" });
std::cout << paal::greedy::shortestSuperstring(words) << std::endl;
}

hash  Hash functions namespace 
ir  Iterative Rounding namespace 
detail  Detail of Iterative Rounding namespace 
iterative_rounding  This class solves an iterative rounding problem 
vertex_filter  
bool_map_to_tree_filter  
bool_map_to_non_tree_filter  
const_int_map  A boost graph map that returns a constant integer value 
bounded_degree_mst  The class for solving the Bounded Degree MST problem using Iterative Rounding 
bdmst_round_condition  
bdmst_relax_condition  
bdmst_init  
bdmst_set_solution  
bdmst_violation_checker  Violations checker for the separation oracle in the bounded degree minimum spanning tree problem 
ga_relax_condition  
ga_set_solution  
ga_init  
generalised_assignment  The class for solving the Generalised Assignment problem using Iterative Rounding 
default_round_condition  Default column rounding condition component 
round_condition_equals  Column rounding component. Rounds a column if its value is equal to one of the template parameter values 
round_condition_equals< arg, args...>  Column rounding component. Rounds a column if its value is equal to one of the template parameter values 
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) 
round_condition_to_fun  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 
cond_bigger_equal_than  Checks if a variable is greater or equal than a fixed bound 
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 
default_solve_lp_to_extreme_point  Finds an extreme point solution to the LP 
default_resolve_lp_to_extreme_point  Finds an extreme point solution to the LP 
default_stop_condition  Default stop condition component 
relaxations_limit_condition  Checks if the relaxations limit was reached 
trivial_visitor  Default Iterative Rounding visitor 
default_solve_lp_in_row_generation  
row_generation_solve_lp  
min_cut_finder  Class for creating and modifying directed graphs with edge capacities and finding directed minimum cuts between given vertices 
steiner_network  The class for solving the Steiner Network problem using Iterative Rounding 
steiner_network_init  
steiner_network_round_condition  
steiner_network_set_solution  
steiner_network_violation_checker  Violations checker for the separation oracle in the steiner network problem 
steiner_component  Class represents kcomponents of Steiner Tree. Component is a subtree whose terminals coincide with leaves 
steiner_components  
steiner_tree_all_generator  
steiner_tree_graph_all_generator  
steiner_tree_random_generator  
steiner_tree_smart_generator  
steiner_tree  The class for solving the Steiner Tree problem using Iterative Rounding 
steiner_tree_init  
steiner_tree_round_condition  
steiner_tree_stop_condition  
steiner_tree_set_solution  
steiner_tree_violation_checker  Violations checker for the separation oracle in the steiner tree problem 
steiner_utils  
ta_round_condition  
ta_set_solution  
ta_init  
tree_aug  This is Jain's iterative rounding 2approximation algorithm for the Generalised Steiner Network Problem, specialized for the Tree Augmentation Problem 
local_search  Local Search namespace 
concepts  Concepts of Local Search namespace 
concepts_base  
get_moves  
gain  
commit  
search_components  
detail  Detail of Local Search namespace 
local_search_concepts  
local_search_concepts< Solution, SearchComponents, SearchComponentsPack...>  
local_search_concepts< Solution >  
obj_fun_get_moves  
obj_fun_gain  
obj_fun_commit  
tuple_to_move  
Swap  Swap 
make_swap  Functor creating Move 
gain_two_opt  Gain for two opt moves 
two_local_search_commit  Commit class for local_search 
two_local_searchget_moves  Commit class for local_search 
two_local_search_adapter  Adapts cycle to have begin and end pointing to edge collection 
conditional_gain_adaptor  If the condition is not fulfilled this gain adaptor returns 0 
gain_cut_small_improves  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 
stop_condition_count_limit  This is custom StopCondition , it returns true after given count limit 
stop_condition_time_limit  This is custom StopCondition, it returns true after given time limit 
compute_gain_wrapper  This wrapper counts sum of the improvements. It makes sense to use it only when ChooseFirstBetter strategy is applied 
tabu_gain_adaptor  Adapts gain to implement tabu search 
record_solution_commit_adapter  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 
facility_location_commit_add  Commit functor for add moves in facility location problem 
facility_locationget_moves_add  Gain functor for add moves in facility location problem 
facility_location_gain_add  Gain functor for add moves in facility location problem 
facility_location_gain_remove  Gain functor for facility location 
facility_location_commit_remove  Commit functor for facility location 
facility_locationget_moves_remove  Get moves functor for facility location remove 
facility_location_solution_adapter  Facility_location_solution adapter chosen range and unchosen range must be joined into one homogenus collection of Facilities 
facility_location_gain_swap  Gain functor for swap in facility location problem 
facility_location_commit_swap  Commit functor for facility location problem 
facility_locationget_moves_swap  Get moves functor for facility location problem 
find_positive_predicate  This predicates returns true if there is a move with positive gain and the commit was successful 
first_improving_strategy  This strategy uses find_positive_predicate as stop condition 
max_functor  Functor used in fold in order to find the most improving move 
best_improving_strategy  This strategy chooses the best possible move and if it is improving applies it to the solution 
best_strategy  This strategy chooses the best possible move and applies it to the solution. Note that this strategy might commit nonimproving moves 
search_obj_function_components_traits  Traits class for search_componentsObjFun 
Move  Class describing Move 
make_move  Functor creating Move 
n_queens_commit  N_queens_commit functor 
n_queensget_moves  Detail 
n_queens_gain  N_queens_gain functor 
n_queens_solution_adapter  Adapts vector representing n queen problem to class able to efficiently compute gain of given move 
search_components_traits  Traits class for search_components 
move_type_from_get_moves  Metafunction returns move type in single_solution case 
move_type  Metafunction returns move type in single_solution case 
fitness_from_gain_and_get_moves  Metafunction returns Fitness type in single_solution case 
exponential_cooling_schema_dependant_on_time  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 
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 
simulated_annealing_gain_adaptor  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 
is_chosen  This object represents Delta computed by gain and the decision if the object is taken or not 
simulated_annealing_commit_adaptor  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 
lp  Linear Programming namespace 
detail  Detail of Linear Programming namespace 
glp_impl  LP implementation using GLPK 
lp_base  The common LP solvers base class. Responsible for: 
random_rotate  
LowerBoundTag  
UpperBoundTag  
RightBoundTag  
LeftBoundTag  
single_bounded_expression  
double_bounded_expression  
linear_expression  
Id  
col_id  
row_id  
add_max_violated  Functor for adding maximum violated constraint 
max_violated_separation_oracle  Functor computing add_max_violated 
add_first_violated  Functor 
first_violated_separation_oracle  Functor computing add_first_violated 
random_violated_separation_oracle  Detail 
lsh  
projection_hash_function  Simple hash function 
random_projection_hash_function_generator  Factory class for projection_hash_function 
l_p_hash_function  Hash_function for l_p distance for p in range (0,2] 
l_p_hash_function_generator  Factory class for l_p_hash_function 
min_hash_function  Minwise independent permutations locality sensitive hashing (Jaccard) 
min_hash_function_generator  Factory class for min_hash_function 
utils  Utils namespace 
concepts  Utils concepts namespace 
floating_point  Concept class for floating point types 
move_constructible  Concept class for move constructible types 
output_iterator  Concept class for output iterator concept. We don't use boost::OutputIterator concept as it excludes boost::function_output_iterator with lambda function 
readable_range  Concept class for readable range concept 
compare  Class for comparing floating point 
ignore_param  Type that can be constructed from anything and has no other functionality 
skip_functor  Functor does nothing 
return_constant_functor  Functor returns always the same number. The number has to be known at compile time 
dynamic_return_constant_functor  Functor returns always the same number (dynamic version) 
identity_functor  Functor returns its argument 
tuple_uncurry  Transforms a functor taking multiple parameters into a functor taking a tuple parameter 
always_false  Functor return false 
always_true  Functor return true 
return_zero_functor  Functor returns 0 
return_one_functor  Functor returns 1 
assert_functor  Functors calls assert(false) 
remove_reference  Removes reference 
counting_functor_adaptor  Counts number of calls 
array_to_functor  Adapts array as function, providing operator()() 
assignable_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 
lift_iterator_functor  For given functor f, lift_iterator_functor provides operator()(Iterator iterator) which returns f(*iter) 
greater  Greater functor 
less  Less functor 
greater_equal  Greater_equal functor 
less_equal  Less_equal functor 
equal_to  Equal_to functor 
equal_to_unspecified  TODO equivalent to c++14 equal_to<>, remove when appears 
not_equal_to  Not_equal_to functor 
functor_to_comparator  
scale_functor  Functor that scales another functor 
plus  Plus 
minus  Minus 
max  Max 
min  Min 
Not  Not 
Or  Or 
And  And 
lift_binary_operator_functor  
not_functor  Not_functor 
or_functor  Or_functor 
and_functor  And_functor 
xor_functor  Xor_functor 
tuple_get  Functor for std::tuple::get<I> 
iterator_with_excluded_element  This iterator exlcludes one specific element from range 
property_map_get  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 
singleton_iterator  Iterator to range containing single element 
failure_message  Functor prints failure message 
k_means_visitor  K means visitor 
thread_pool  Simple threadpool, class uses also current thread! 
distance_oracle_thorup2kminus1approximation  2k1 approximate distance oracle 
hash_function_tuple  Functor representing tuple of hash functions 
hash_function_tuple_generator  
lsh_nearest_neighbors_regression  Detail 
frequent_directions  Represents sketch of matrix 
dreyfus_wagner  
average_accumulator  Helper class facilitating counting average 
subset_backtrack  Detail 
edge_hash  Hash for edge_descriptor in bgl, undirected version 
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 
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/cunorderedmapfailwhenusedwithavectoraskey 
density  Density functor, for given value and size 
less_pointees_t  Compare pointee using comparator 
make_tuple  Function object for std::make_tuple 
pretty_stream  Pretty_stream stream that uses pretty_to_string method 
std  Paal 
hash< paal::lp::Id >  
hash< paal::lp::row_id >  
hash< paal::lp::col_id >  
commit  
default_k_median_components  Model of Multisearch_components with default multi search components for kmedian 
default_remove_fl_components  Model of Multisearch_components with default multi search components for facility location 
demand_query_func  
F  
gain  
gamma_oracle_func  
get_copies_num_func  
get_moves  
ham_tag  
jaccard_tag  
l1_tag  
l2_tag  
params  
TempReplacecomponents  This class behavies like partial components<Names, Types>, with type for Name chanche to Type 
trivial_commit  Used in case when update is actually the new solution 
value_query_func  
vertex_cover  [Iterative Rounding Problem Example] 
vertex_cover_init  [Iterative Rounding Problem Example] 
vertex_cover_set_solution  
X  
Y  
Z 