|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
#include <functional>#include <optional>#include <gtest/gtest.h>#include <ahFunctional.H>#include <htlist.H>#include <tpl_dynArray.H>#include <tpl_dynBinHeap.H>#include <tpl_graph.H>#include <tpl_sort_utils.H>Go to the source code of this file.
Concepts | |
| concept | can_introsort |
| concept | can_name_heap |
| concept | can_filter |
| concept | can_mutable_for_each |
| concept | can_foldl |
| concept | can_partition |
| concept | can_count_if |
| concept | can_each |
| concept | can_traverse_nodes |
| concept | can_filter_arcs |
| concept | can_nodes_map |
Functions | |
| TEST (AhConceptsFunctionalTest, ConstrainedCallsStillRun) | |
| TEST (AhConceptsFunctionalTest, MemberMapsAndFoldsAcceptLambdasWithoutExplicitType) | |
| TEST (AhConceptsFunctionalTest, MemberInOutArcMapsAndFoldsAcceptLambdas) | |
| TEST (AhConceptsFunctionalTest, FreeGraphOverloadsStayUnambiguous) | |
| TEST (AhConceptsFunctionalTest, MapHelpersDeduceTFromStdFunctionArguments) | |
| TEST | ( | AhConceptsFunctionalTest | , |
| ConstrainedCallsStillRun | |||
| ) |
Definition at line 171 of file ah_concepts_functional_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::count_if(), FunctionalMethods< Container, T >::filter(), GraphCommon< GT, Node, Arc >::filter_arcs(), FunctionalMethods< Container, T >::foldl(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), Aleph::introsort(), l, FunctionalMethods< Container, T >::partition(), Aleph::size(), and GraphCommon< GT, Node, Arc >::traverse_nodes().
| TEST | ( | AhConceptsFunctionalTest | , |
| FreeGraphOverloadsStayUnambiguous | |||
| ) |
Definition at line 242 of file ah_concepts_functional_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::for_each_arc(), Aleph::forall_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::size().
| TEST | ( | AhConceptsFunctionalTest | , |
| MapHelpersDeduceTFromStdFunctionArguments | |||
| ) |
Definition at line 263 of file ah_concepts_functional_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and Aleph::size().
| TEST | ( | AhConceptsFunctionalTest | , |
| MemberInOutArcMapsAndFoldsAcceptLambdas | |||
| ) |
Definition at line 223 of file ah_concepts_functional_test.cc.
References Aleph::blossom_maximum_cardinality_matching(), GraphCommon< GT, Node, Arc >::foldl_in_arcs(), GraphCommon< GT, Node, Arc >::foldl_out_arcs(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and GraphCommon< GT, Node, Arc >::out_arcs_map().
| TEST | ( | AhConceptsFunctionalTest | , |
| MemberMapsAndFoldsAcceptLambdasWithoutExplicitType | |||
| ) |
Definition at line 200 of file ah_concepts_functional_test.cc.
References GraphCommon< GT, Node, Arc >::arcs_map(), Aleph::blossom_maximum_cardinality_matching(), GraphCommon< GT, Node, Arc >::foldl_arcs(), GraphCommon< GT, Node, Arc >::foldl_nodes(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_arc(), Aleph::List_Graph< _Graph_Node, _Graph_Arc >::insert_node(), and GraphCommon< GT, Node, Arc >::nodes_map().