SYMBOL INDEX (8634 symbols across 522 files) FILE: apps/cascades/cascades.cpp type Status (line 29) | enum Status {INFECTED, SUSCEPTIBLE, RECOVERED} type infected_status (line 37) | struct infected_status: public graphlab::IS_POD_TYPE { method infected_status (line 41) | infected_status() { method infected_status (line 46) | infected_status& operator+=(const infected_status& other) { function line_parser (line 61) | bool line_parser(graph_type& graph, const std::string& filename, const s... class cascades (line 98) | class cascades: method edge_dir_type (line 103) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 107) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 121) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 158) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... type cascades_writer (line 163) | struct cascades_writer{ method save_vertex (line 164) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 181) | std::string save_edge (graph_type::edge_type e) { return ""; } function main (line 185) | int main(int argc, char** argv) { FILE: apps/concomp/concomp.cpp function init_vertex (line 36) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = -1; } type min_combiner (line 38) | struct min_combiner : public graphlab::IS_POD_TYPE { method min_combiner (line 41) | min_combiner() { method min_combiner (line 45) | min_combiner& operator+=(const min_combiner& other) { class concomp (line 53) | class concomp : method init (line 64) | void init(icontext_type& context, const vertex_type& vertex, const mes... method edge_dir_type (line 75) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method apply (line 80) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 90) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 100) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type concomp_writer (line 115) | struct concomp_writer { method save_vertex (line 116) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 121) | std::string save_edge(graph_type::edge_type e) { return ""; } function main (line 125) | int main(int argc, char** argv) { FILE: apps/example/hello_world.cpp function init_vertex (line 37) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = vert... type min_combiner (line 39) | struct min_combiner { method min_combiner (line 41) | min_combiner& operator+=(const min_combiner& other) { class concomp (line 47) | class concomp : method gather (line 52) | float gather(icontext_type& context, const vertex_type& vertex, edge_t... method apply (line 69) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 81) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 90) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type concomp_writer (line 98) | struct concomp_writer { method save_vertex (line 99) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 104) | std::string save_edge(graph_type::edge_type e) { return ""; } function main (line 108) | int main(int argc, char** argv) { FILE: apps/label_propagation/label_propagation.cpp type label_counter (line 23) | struct label_counter { method label_counter (line 26) | label_counter() { method label_counter (line 29) | label_counter& operator+=(const label_counter& other) { method save (line 38) | void save(graphlab::oarchive& oarc) const { method load (line 42) | void load(graphlab::iarchive& iarc) { function line_parser (line 55) | bool line_parser(graph_type& graph, const std::string& filename, const s... class labelpropagation (line 76) | class labelpropagation : method edge_dir_type (line 82) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 86) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 101) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 127) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 136) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type labelpropagation_writer (line 143) | struct labelpropagation_writer { method save_vertex (line 144) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 149) | std::string save_edge (graph_type::edge_type e) { return ""; } function main (line 153) | int main(int argc, char** argv) { FILE: cmake/Mex_stub.cpp function mexFunction (line 13) | void mexFunction(int nlhs, mxArray *plhs[], function at_exit (line 23) | static void at_exit() FILE: cxxtest/cxxtest/Descriptions.cpp type CxxTest (line 17) | namespace CxxTest FILE: cxxtest/cxxtest/Descriptions.h function virtual (line 32) | virtual int line() const = 0; FILE: cxxtest/cxxtest/DummyDescriptions.cpp type CxxTest (line 14) | namespace CxxTest function TestDescription (line 26) | TestDescription *DummyTestDescription::next() { return 0; } function TestDescription (line 27) | const TestDescription *DummyTestDescription::next() const { return 0; } function TestSuite (line 34) | TestSuite *DummySuiteDescription::suite() const { return 0; } function TestDescription (line 36) | const TestDescription &DummySuiteDescription::testDescription( unsigne... function SuiteDescription (line 37) | SuiteDescription *DummySuiteDescription::next() { return 0; } function TestDescription (line 38) | TestDescription *DummySuiteDescription::firstTest() { return 0; } function SuiteDescription (line 39) | const SuiteDescription *DummySuiteDescription::next() const { return 0; } function TestDescription (line 40) | const TestDescription *DummySuiteDescription::firstTest() const { retu... function SuiteDescription (line 51) | const SuiteDescription &DummyWorldDescription::suiteDescription( unsig... function SuiteDescription (line 52) | SuiteDescription *DummyWorldDescription::firstSuite() { return 0; } function SuiteDescription (line 53) | const SuiteDescription *DummyWorldDescription::firstSuite() const { re... FILE: cxxtest/cxxtest/DummyDescriptions.h function line (line 29) | int line() const; FILE: cxxtest/cxxtest/ErrorFormatter.h function namespace (line 29) | namespace CxxTest function endl (line 42) | static void endl( OutputStream &o ) { (o << "\n").flush(); } function class (line 45) | class ErrorFormatter : public TestListener function newLine (line 246) | void newLine( void ) function reportTest (line 254) | void reportTest( void ) function dump (line 262) | void dump( const void *buffer, unsigned size ) function dumpNull (line 270) | void dumpNull() function dumpBuffer (line 275) | void dumpBuffer( const void *buffer, unsigned size ) function endl (line 290) | static void endl( OutputStream &o ) FILE: cxxtest/cxxtest/ErrorPrinter.h function namespace (line 37) | namespace CxxTest FILE: cxxtest/cxxtest/GlobalFixture.cpp type CxxTest (line 17) | namespace CxxTest function GlobalFixture (line 27) | GlobalFixture *GlobalFixture::firstGlobalFixture() { return (GlobalFix... function GlobalFixture (line 28) | GlobalFixture *GlobalFixture::lastGlobalFixture() { return (GlobalFixt... function GlobalFixture (line 29) | GlobalFixture *GlobalFixture::nextGlobalFixture() { return (GlobalFixt... function GlobalFixture (line 30) | GlobalFixture *GlobalFixture::prevGlobalFixture() { return (GlobalFixt... FILE: cxxtest/cxxtest/GlobalFixture.h function namespace (line 17) | namespace CxxTest FILE: cxxtest/cxxtest/Gui.h function namespace (line 22) | namespace CxxTest FILE: cxxtest/cxxtest/LinkedList.cpp type CxxTest (line 17) | namespace CxxTest function Link (line 27) | Link *List::head() function Link (line 35) | const Link *List::head() const function Link (line 43) | Link *List::tail() function Link (line 51) | const Link *List::tail() const function Link (line 72) | Link *List::nth( unsigned n ) function Link (line 114) | Link * Link::justNext() function Link (line 119) | Link * Link::justPrev() function Link (line 124) | Link * Link::next() function Link (line 132) | Link * Link::prev() function Link (line 140) | const Link * Link::next() const function Link (line 148) | const Link * Link::prev() const FILE: cxxtest/cxxtest/LinkedList.h function namespace (line 17) | namespace CxxTest FILE: cxxtest/cxxtest/Mock.h function namespace (line 15) | namespace dummy_mock_ns {} FILE: cxxtest/cxxtest/ParenPrinter.h function namespace (line 23) | namespace CxxTest FILE: cxxtest/cxxtest/QtGui.h function namespace (line 39) | namespace CxxTest FILE: cxxtest/cxxtest/RealDescriptions.cpp type CxxTest (line 22) | namespace CxxTest function TestDescription (line 102) | TestDescription *RealTestDescription::next() { return (RealTestDescripti... function TestDescription (line 103) | const TestDescription *RealTestDescription::next() const { return (const... function TestSuite (line 105) | TestSuite *RealTestDescription::suite() const { return _suite->suite(); } function TestDescription (line 140) | TestDescription *RealSuiteDescription::firstTest() { return (RealTestDes... function TestDescription (line 141) | const TestDescription *RealSuiteDescription::firstTest() const { return ... function SuiteDescription (line 142) | SuiteDescription *RealSuiteDescription::next() { return (RealSuiteDescri... function SuiteDescription (line 143) | const SuiteDescription *RealSuiteDescription::next() const { return (con... function TestDescription (line 147) | const TestDescription &RealSuiteDescription::testDescription( unsigned i... function TestSuite (line 190) | TestSuite *StaticSuiteDescription::suite() const function List (line 221) | List &RealWorldDescription::suites() function SuiteDescription (line 239) | SuiteDescription *RealWorldDescription::firstSuite() function SuiteDescription (line 244) | const SuiteDescription *RealWorldDescription::firstSuite() const function SuiteDescription (line 249) | const SuiteDescription &RealWorldDescription::suiteDescription( unsigned... function activateAllTests (line 318) | void activateAllTests() function leaveOnly (line 323) | bool leaveOnly( const char *suiteName, const char *testName ) FILE: cxxtest/cxxtest/RealDescriptions.h function namespace (line 23) | namespace CxxTest function class (line 212) | class RealWorldDescription : public WorldDescription FILE: cxxtest/cxxtest/StdTestSuite.h function namespace (line 20) | namespace CxxTest { FILE: cxxtest/cxxtest/StdValueTraits.h function namespace (line 32) | namespace CxxTest FILE: cxxtest/cxxtest/StdioFilePrinter.h function namespace (line 25) | namespace CxxTest FILE: cxxtest/cxxtest/StdioPrinter.h function namespace (line 23) | namespace CxxTest FILE: cxxtest/cxxtest/TeeListener.h function namespace (line 22) | namespace CxxTest FILE: cxxtest/cxxtest/TestListener.h function virtual (line 32) | virtual ~TestListener() {} FILE: cxxtest/cxxtest/TestMain.h function namespace (line 32) | namespace CxxTest FILE: cxxtest/cxxtest/TestRunner.h function namespace (line 26) | namespace CxxTest FILE: cxxtest/cxxtest/TestSuite.cpp type CxxTest (line 20) | namespace CxxTest function abortTestOnFail (line 34) | bool abortTestOnFail() function setAbortTestOnFail (line 39) | void setAbortTestOnFail( bool value ) function doAbortTest (line 44) | void doAbortTest() function maxDumpSize (line 57) | unsigned maxDumpSize() function setMaxDumpSize (line 62) | void setMaxDumpSize( unsigned value ) function doTrace (line 70) | void doTrace( const char *file, int line, const char *message ) function doWarn (line 77) | void doWarn( const char *file, int line, const char *message ) function doFailTest (line 82) | void doFailTest( const char *file, int line, const char *message ) function doFailAssert (line 88) | void doFailAssert( const char *file, int line, function sameData (line 97) | bool sameData( const void *x, const void *y, unsigned size ) function doAssertSameData (line 117) | void doAssertSameData( const char *file, int line, function sameFiles (line 132) | bool sameFiles( const char* file1, const char* file2, std::ostringstre... function doAssertSameFiles (line 216) | void doAssertSameFiles( const char* file, int line, function doFailAssertThrows (line 234) | void doFailAssertThrows( const char *file, int line, function doFailAssertThrowsNot (line 249) | void doFailAssertThrowsNot( const char *file, int line, FILE: cxxtest/cxxtest/TestSuite.h function namespace (line 31) | namespace CxxTest function test (line 92) | static bool test( X x, Y y ) function test (line 114) | static bool test( X x, Y y ) function test (line 136) | static bool test( X x, Y y ) function test (line 195) | static bool test( X x, Y y, D d ) FILE: cxxtest/cxxtest/TestTracker.cpp type CxxTest (line 17) | namespace CxxTest function TestTracker (line 35) | TestTracker & TestTracker::tracker() function TestDescription (line 53) | const TestDescription *TestTracker::fixTest( const TestDescription *d ... function SuiteDescription (line 58) | const SuiteDescription *TestTracker::fixSuite( const SuiteDescription ... function WorldDescription (line 63) | const WorldDescription *TestTracker::fixWorld( const WorldDescription ... function TestDescription (line 68) | const TestDescription &TestTracker::dummyTest() const function SuiteDescription (line 73) | const SuiteDescription &TestTracker::dummySuite() const function WorldDescription (line 78) | const WorldDescription &TestTracker::dummyWorld() const FILE: cxxtest/cxxtest/TestTracker.h function namespace (line 24) | namespace CxxTest FILE: cxxtest/cxxtest/ValueTraits.cpp type CxxTest (line 17) | namespace CxxTest function digitToChar (line 23) | char digitToChar( unsigned digit ) function stringsEqual (line 50) | bool stringsEqual( const char *s1, const char *s2 ) FILE: cxxtest/cxxtest/ValueTraits.h function namespace (line 38) | namespace CxxTest type _CXXTEST_LONGLONG (line 230) | typedef _CXXTEST_LONGLONG T; type T (line 245) | typedef unsigned _CXXTEST_LONGLONG T; type T (line 261) | typedef signed long int T; type T (line 276) | typedef unsigned long int T; function namespace (line 369) | namespace dummy_enum_ns {} FILE: cxxtest/cxxtest/Win32Gui.h function namespace (line 36) | namespace CxxTest function greenBar (line 396) | void greenBar() function setColor (line 403) | void setColor( BYTE red, BYTE green, BYTE blue ) function setColor (line 408) | void setColor( BYTE, BYTE, BYTE ) function setIcon (line 413) | void setIcon( LPCTSTR icon ) function HICON (line 418) | HICON loadStandardIcon( LPCTSTR icon ) function setTestCaption (line 423) | void setTestCaption( const char *suiteName, const char *testName ) function showSuiteName (line 443) | void showSuiteName( const char *suiteName ) function showTestName (line 448) | void showTestName( const char *testName ) function showTestsDone (line 453) | void showTestsDone() function updateTime (line 461) | void updateTime() function setStatusTime (line 468) | void setStatusTime( unsigned part, DWORD start ) function keep (line 483) | bool keep() function showSummary (line 492) | void showSummary() function setStatusPart (line 499) | void setStatusPart( unsigned part, const char *text ) function stopTimer (line 504) | void stopTimer() function setSummaryStatusBar (line 510) | void setSummaryStatusBar() function setSummaryCaption (line 525) | void setSummaryCaption() function deallocate (line 535) | void deallocate( char *data ) FILE: cxxtest/cxxtest/X11Gui.h function namespace (line 34) | namespace CxxTest FILE: cxxtest/cxxtest/XUnitPrinter.h function namespace (line 23) | namespace CxxTest FILE: cxxtest/cxxtest/XmlFormatter.h function namespace (line 49) | namespace CxxTest function class (line 114) | class ElementInfo function class (line 184) | class TestCaseInfo function class (line 243) | class XmlFormatter : public TestListener FILE: cxxtest/cxxtest/XmlPrinter.h function namespace (line 37) | namespace CxxTest FILE: cxxtest/cxxtest/YesNoRunner.h function namespace (line 23) | namespace CxxTest FILE: cxxtest/cxxtest/cxx_parser.py function ply_init (line 68) | def ply_init(data): class Scope (line 73) | class Scope(object): method __init__ (line 75) | def __init__(self,name,abs_name,scope_t,base_classes,lineno): method insert (line 84) | def insert(self,scope): class CppInfo (line 88) | class CppInfo(object): method __init__ (line 90) | def __init__(self, filter=None): method push_scope (line 101) | def push_scope(self,ns,scope_t,base_classes=[]): method pop_scope (line 108) | def pop_scope(self): method add_function (line 114) | def add_function(self, fn): method get_functions (line 124) | def get_functions(self,name,quiet=False): method find_class (line 139) | def find_class(self,name,scope): method __repr__ (line 154) | def __repr__(self): method is_baseclass (line 157) | def is_baseclass(self,cls,base): method __str__ (line 173) | def __str__(self): function flatten (line 190) | def flatten(x): function t_COMMENT (line 365) | def t_COMMENT(t): function t_StringLiteral (line 373) | def t_StringLiteral(t): function t_Identifier (line 378) | def t_Identifier(t): function t_error (line 384) | def t_error(t): function t_newline (line 389) | def t_newline(t): function p_identifier (line 417) | def p_identifier(p): function p_id (line 425) | def p_id(p): function p_global_scope (line 432) | def p_global_scope(p): function p_id_scope (line 437) | def p_id_scope(p): function p_id_scope_seq (line 441) | def p_id_scope_seq(p): function p_nested_id (line 451) | def p_nested_id(p): function p_scoped_id (line 457) | def p_scoped_id(p): function p_destructor_id (line 476) | def p_destructor_id(p): function p_template_decl (line 488) | def p_template_decl(p): function p_special_function_id (line 498) | def p_special_function_id(p): function p_nested_special_function_id (line 505) | def p_nested_special_function_id(p): function p_scoped_special_function_id (line 512) | def p_scoped_special_function_id(p): function p_declarator_id (line 519) | def p_declarator_id(p): function p_built_in_type_id (line 533) | def p_built_in_type_id(p): function p_pseudo_destructor_id (line 539) | def p_pseudo_destructor_id(p): function p_nested_pseudo_destructor_id (line 546) | def p_nested_pseudo_destructor_id(p): function p_scoped_pseudo_destructor_id (line 552) | def p_scoped_pseudo_destructor_id(p): function p_literal (line 563) | def p_literal(p): function p_translation_unit (line 576) | def p_translation_unit(p): function get_rest (line 620) | def get_rest(p): function p_primary_expression (line 623) | def p_primary_expression(p): function p_abstract_expression (line 634) | def p_abstract_expression(p): function p_postfix_expression (line 641) | def p_postfix_expression(p): function p_bexpression_opt (line 661) | def p_bexpression_opt(p): function p_bexpression (line 667) | def p_bexpression(p): function p_bexpression_seq (line 674) | def p_bexpression_seq(p): function p_bexpression_clause (line 680) | def p_bexpression_clause(p): function p_expression_list_opt (line 687) | def p_expression_list_opt(p): function p_expression_list (line 693) | def p_expression_list(p): function p_unary_expression (line 699) | def p_unary_expression(p): function p_delete_expression (line 717) | def p_delete_expression(p): function p_new_expression (line 722) | def p_new_expression(p): function p_new_type_id (line 730) | def p_new_type_id(p): function p_new_declarator (line 737) | def p_new_declarator(p): function p_direct_new_declarator (line 743) | def p_direct_new_declarator(p): function p_new_initializer_opt (line 749) | def p_new_initializer_opt(p): function p_cast_expression (line 760) | def p_cast_expression(p): function p_pm_expression (line 766) | def p_pm_expression(p): function p_multiplicative_expression (line 773) | def p_multiplicative_expression(p): function p_additive_expression (line 781) | def p_additive_expression(p): function p_shift_expression (line 788) | def p_shift_expression(p): function p_relational_expression (line 799) | def p_relational_expression(p): function p_equality_expression (line 804) | def p_equality_expression(p): function p_and_expression (line 811) | def p_and_expression(p): function p_exclusive_or_expression (line 817) | def p_exclusive_or_expression(p): function p_inclusive_or_expression (line 823) | def p_inclusive_or_expression(p): function p_logical_and_expression (line 829) | def p_logical_and_expression(p): function p_logical_or_expression (line 835) | def p_logical_or_expression(p): function p_conditional_expression (line 841) | def p_conditional_expression(p): function p_assignment_expression (line 853) | def p_assignment_expression(p): function p_assignment_operator (line 861) | def p_assignment_operator(p): function p_expression (line 882) | def p_expression(p): function p_constant_expression (line 888) | def p_constant_expression(p): function p_statement (line 903) | def p_statement(p): function p_compound_statement (line 914) | def p_compound_statement(p): function p_statement_seq_opt (line 919) | def p_statement_seq_opt(p): function p_selection_statement (line 928) | def p_selection_statement(p): function p_condition_opt (line 935) | def p_condition_opt(p): function p_condition (line 941) | def p_condition(p): function p_condition_seq (line 948) | def p_condition_seq(p): function p_labeled_statement (line 954) | def p_labeled_statement(p): function p_try_block (line 961) | def p_try_block(p): function p_jump_statement (line 967) | def p_jump_statement(p): function p_iteration_statement (line 975) | def p_iteration_statement(p): function p_declaration_statement (line 982) | def p_declaration_statement(p): function p_compound_declaration (line 990) | def p_compound_declaration(p): function p_declaration_seq_opt (line 995) | def p_declaration_seq_opt(p): function p_declaration (line 1001) | def p_declaration(p): function p_specialised_declaration (line 1010) | def p_specialised_declaration(p): function p_block_declaration (line 1017) | def p_block_declaration(p): function p_specialised_block_declaration (line 1023) | def p_specialised_block_declaration(p): function p_simple_declaration (line 1032) | def p_simple_declaration(p): function p_suffix_built_in_decl_specifier_raw (line 1055) | def p_suffix_built_in_decl_specifier_raw(p): function p_suffix_built_in_decl_specifier (line 1062) | def p_suffix_built_in_decl_specifier(p): function p_suffix_named_decl_specifier (line 1070) | def p_suffix_named_decl_specifier(p): function p_suffix_named_decl_specifier_bi (line 1077) | def p_suffix_named_decl_specifier_bi(p): function p_suffix_named_decl_specifiers (line 1084) | def p_suffix_named_decl_specifiers(p): function p_suffix_named_decl_specifiers_sf (line 1090) | def p_suffix_named_decl_specifiers_sf(p): function p_suffix_decl_specified_ids (line 1098) | def p_suffix_decl_specified_ids(p): function p_suffix_decl_specified_scope (line 1108) | def p_suffix_decl_specified_scope(p): function p_decl_specifier_affix (line 1115) | def p_decl_specifier_affix(p): function p_decl_specifier_suffix (line 1124) | def p_decl_specifier_suffix(p): function p_decl_specifier_prefix (line 1129) | def p_decl_specifier_prefix(p): function p_storage_class_specifier (line 1135) | def p_storage_class_specifier(p): function p_function_specifier (line 1145) | def p_function_specifier(p): function p_type_specifier (line 1152) | def p_type_specifier(p): function p_elaborate_type_specifier (line 1159) | def p_elaborate_type_specifier(p): function p_simple_type_specifier (line 1167) | def p_simple_type_specifier(p): function p_built_in_type_specifier (line 1174) | def p_built_in_type_specifier(p): function p_attributes (line 1180) | def p_attributes(p): function p_attribute (line 1186) | def p_attribute(p): function p_Xbuilt_in_type_specifier (line 1190) | def p_Xbuilt_in_type_specifier(p): function p_elaborated_type_specifier (line 1216) | def p_elaborated_type_specifier(p): function p_elaborated_enum_specifier (line 1223) | def p_elaborated_enum_specifier(p): function p_enum_specifier (line 1228) | def p_enum_specifier(p): function p_enumerator_clause (line 1234) | def p_enumerator_clause(p): function p_enumerator_list_ecarb (line 1241) | def p_enumerator_list_ecarb(p): function p_enumerator_definition_ecarb (line 1246) | def p_enumerator_definition_ecarb(p): function p_enumerator_definition_filler (line 1251) | def p_enumerator_definition_filler(p): function p_enumerator_list_head (line 1256) | def p_enumerator_list_head(p): function p_enumerator_list (line 1262) | def p_enumerator_list(p): function p_enumerator_definition (line 1267) | def p_enumerator_definition(p): function p_enumerator (line 1273) | def p_enumerator(p): function p_namespace_definition (line 1278) | def p_namespace_definition(p): function p_namespace_alias_definition (line 1285) | def p_namespace_alias_definition(p): function p_push_scope (line 1290) | def p_push_scope(p): function p_using_declaration (line 1299) | def p_using_declaration(p): function p_using_directive (line 1305) | def p_using_directive(p): function p_asm_definition (line 1311) | def p_asm_definition(p): function p_linkage_specification (line 1316) | def p_linkage_specification(p): function p_init_declarations (line 1331) | def p_init_declarations(p): function p_init_declaration (line 1337) | def p_init_declaration(p): function p_star_ptr_operator (line 1342) | def p_star_ptr_operator(p): function p_nested_ptr_operator (line 1348) | def p_nested_ptr_operator(p): function p_ptr_operator (line 1354) | def p_ptr_operator(p): function p_ptr_operator_seq (line 1361) | def p_ptr_operator_seq(p): function p_ptr_operator_seq_opt (line 1370) | def p_ptr_operator_seq_opt(p): function p_cv_qualifier_seq_opt (line 1376) | def p_cv_qualifier_seq_opt(p): function p_cv_qualifier (line 1383) | def p_cv_qualifier(p): function p_type_id (line 1390) | def p_type_id(p): function p_abstract_declarator_opt (line 1396) | def p_abstract_declarator_opt(p): function p_direct_abstract_declarator_opt (line 1403) | def p_direct_abstract_declarator_opt(p): function p_direct_abstract_declarator (line 1409) | def p_direct_abstract_declarator(p): function p_parenthesis_clause (line 1416) | def p_parenthesis_clause(p): function p_parameters_clause (line 1422) | def p_parameters_clause(p): function p_abstract_pointer_declaration (line 1433) | def p_abstract_pointer_declaration(p): function p_abstract_parameter_declaration (line 1439) | def p_abstract_parameter_declaration(p): function p_special_parameter_declaration (line 1446) | def p_special_parameter_declaration(p): function p_parameter_declaration (line 1453) | def p_parameter_declaration(p): function p_function_definition (line 1463) | def p_function_definition(p): function p_func_definition (line 1469) | def p_func_definition(p): function p_ctor_definition (line 1488) | def p_ctor_definition(p): function p_constructor_head (line 1498) | def p_constructor_head(p): function p_function_try_block (line 1504) | def p_function_try_block(p): function p_function_block (line 1511) | def p_function_block(p): function p_function_body (line 1516) | def p_function_body(p): function p_initializer_clause (line 1521) | def p_initializer_clause(p): function p_braced_initializer (line 1527) | def p_braced_initializer(p): function p_initializer_list (line 1534) | def p_initializer_list(p): function p_class_specifier_head (line 1555) | def p_class_specifier_head(p): function p_class_key (line 1575) | def p_class_key(p): function p_class_specifier (line 1582) | def p_class_specifier(p): function p_member_specification_opt (line 1587) | def p_member_specification_opt(p): function p_member_declaration (line 1593) | def p_member_declaration(p): function p_simple_member_declaration (line 1609) | def p_simple_member_declaration(p): function p_member_init_declarations (line 1621) | def p_member_init_declarations(p): function p_member_init_declaration (line 1628) | def p_member_init_declaration(p): function p_accessibility_specifier (line 1634) | def p_accessibility_specifier(p): function p_bit_field_declaration (line 1639) | def p_bit_field_declaration(p): function p_bit_field_width (line 1646) | def p_bit_field_width(p): function p_bit_field_init_declaration (line 1652) | def p_bit_field_init_declaration(p): function p_base_specifier_list (line 1661) | def p_base_specifier_list(p): function p_base_specifier (line 1670) | def p_base_specifier(p): function p_access_specifier (line 1680) | def p_access_specifier(p): function p_conversion_function_id (line 1690) | def p_conversion_function_id(p): function p_conversion_type_id (line 1695) | def p_conversion_type_id(p): function p_ctor_initializer_opt (line 1708) | def p_ctor_initializer_opt(p): function p_ctor_initializer (line 1714) | def p_ctor_initializer(p): function p_mem_initializer_list (line 1719) | def p_mem_initializer_list(p): function p_mem_initializer_list_head (line 1725) | def p_mem_initializer_list_head(p): function p_mem_initializer (line 1730) | def p_mem_initializer(p): function p_mem_initializer_id (line 1735) | def p_mem_initializer_id(p): function p_operator_function_id (line 1744) | def p_operator_function_id(p): function p_operator (line 1763) | def p_operator(p): function p_reserved (line 1808) | def p_reserved(p): function p_template_declaration (line 1884) | def p_template_declaration(p): function p_template_parameter_clause (line 1890) | def p_template_parameter_clause(p): function p_explicit_specialization (line 1901) | def p_explicit_specialization(p): function p_handler_seq (line 1909) | def p_handler_seq(p): function p_handler (line 1915) | def p_handler(p): function p_exception_declaration (line 1921) | def p_exception_declaration(p): function p_throw_expression (line 1926) | def p_throw_expression(p): function p_exception_specification (line 1933) | def p_exception_specification(p): function p_type_id_list (line 1940) | def p_type_id_list(p): function p_nonsemicolon_seq (line 1949) | def p_nonsemicolon_seq(p): function p_nonsemicolon (line 1955) | def p_nonsemicolon(p): function p_nonparen_seq_opt (line 1966) | def p_nonparen_seq_opt(p): function p_nonparen_seq (line 1972) | def p_nonparen_seq(p): function p_nonparen (line 1978) | def p_nonparen(p): function p_nonbracket_seq_opt (line 1988) | def p_nonbracket_seq_opt(p): function p_nonbracket_seq (line 1994) | def p_nonbracket_seq(p): function p_nonbracket (line 2000) | def p_nonbracket(p): function p_nonbrace_seq_opt (line 2012) | def p_nonbrace_seq_opt(p): function p_nonbrace (line 2018) | def p_nonbrace(p): function p_nonlgt_seq_opt (line 2030) | def p_nonlgt_seq_opt(p): function p_nonlgt (line 2036) | def p_nonlgt(p): function p_misc (line 2046) | def p_misc(p): function p_empty (line 2063) | def p_empty(p): function _find_column (line 2074) | def _find_column(input,token): function p_error (line 2083) | def p_error(p): function parse_cpp (line 2102) | def parse_cpp(data=None, filename=None, debug=0, optimize=0, verbose=Fal... FILE: cxxtest/cxxtest/cxxtest_fog.py function cstr (line 26) | def cstr( str ): function scanInputFiles (line 30) | def scanInputFiles(files, _options): FILE: cxxtest/cxxtest/cxxtest_misc.py function abort (line 13) | def abort( problem ): FILE: cxxtest/cxxtest/cxxtest_parser.py function scanInputFiles (line 25) | def scanInputFiles(files, _options): function scanInputFile (line 37) | def scanInputFile(fileName): function scanInputLine (line 69) | def scanInputLine( fileName, lineNo, line ): function scanLineInsideSuite (line 80) | def scanLineInsideSuite( suite, lineNo, line ): function lineBelongsToSuite (line 88) | def lineBelongsToSuite( suite, lineNo, line ): function scanLineForStandardLibrary (line 104) | def scanLineForStandardLibrary( line ): function scanLineForExceptionHandling (line 112) | def scanLineForExceptionHandling( line ): function scanLineForSuiteStart (line 126) | def scanLineForSuiteStart( fileName, lineNo, line ): function startSuite (line 141) | def startSuite( name, file, line, generated ): function lineStartsBlock (line 159) | def lineStartsBlock( line ): function scanLineForTest (line 164) | def scanLineForTest( suite, lineNo, line ): function addTest (line 170) | def addTest( suite, name, line ): function addLineToBlock (line 180) | def addLineToBlock( suite, lineNo, line ): function fixBlockLine (line 191) | def fixBlockLine( suite, lineNo, line): function scanLineForCreate (line 198) | def scanLineForCreate( suite, lineNo, line ): function scanLineForDestroy (line 204) | def scanLineForDestroy( suite, lineNo, line ): function cstr (line 209) | def cstr( s ): function addSuiteCreateDestroy (line 214) | def addSuiteCreateDestroy( suite, which, line ): function closeSuite (line 220) | def closeSuite(): function verifySuite (line 229) | def verifySuite(suite): function rememberSuite (line 238) | def rememberSuite(suite): FILE: cxxtest/cxxtest/cxxtestgen.py function main (line 41) | def main(args=sys.argv): function parseCommandline (line 62) | def parseCommandline(args): function printVersion (line 191) | def printVersion(): function setFiles (line 196) | def setFiles(patterns ): function expandWildcards (line 201) | def expandWildcards( patterns ): function fixBackslashes (line 210) | def fixBackslashes( fileName ): function writeOutput (line 215) | def writeOutput(): function writeSimpleOutput (line 222) | def writeSimpleOutput(): function writeTemplateOutput (line 238) | def writeTemplateOutput(): function startOutputFile (line 260) | def startOutputFile(): function writePreamble (line 269) | def writePreamble( output ): function writeMain (line 303) | def writeMain( output ): function writeWorld (line 326) | def writeWorld( output ): function writeSuites (line 339) | def writeSuites(output): function isGenerated (line 353) | def isGenerated(suite): function isDynamic (line 357) | def isDynamic(suite): function writeInclude (line 361) | def writeInclude(output, file): function generateSuite (line 368) | def generateSuite( output, suite ): function writeSuitePointer (line 376) | def writeSuitePointer( output, suite ): function writeSuiteObject (line 383) | def writeSuiteObject( output, suite ): function writeTestList (line 387) | def writeTestList( output, suite ): function writeWorldDescr (line 394) | def writeWorldDescr( output ): function writeTestDescriptions (line 401) | def writeTestDescriptions( output, suite ): function writeTestDescription (line 406) | def writeTestDescription( output, suite, test ): function runBody (line 416) | def runBody( suite, test ): function dynamicRun (line 421) | def dynamicRun( suite, test ): function staticRun (line 425) | def staticRun( suite, test ): function writeSuiteDescription (line 429) | def writeSuiteDescription( output, suite ): function writeDynamicDescription (line 436) | def writeDynamicDescription( output, suite ): function writeStaticDescription (line 445) | def writeStaticDescription( output, suite ): function writeRoot (line 453) | def writeRoot(output): function writeInitialize (line 457) | def writeInitialize(output): FILE: cxxtest/python/cxxtest/cxx_parser.py function ply_init (line 68) | def ply_init(data): class Scope (line 73) | class Scope(object): method __init__ (line 75) | def __init__(self,name,abs_name,scope_t,base_classes,lineno): method insert (line 84) | def insert(self,scope): class CppInfo (line 88) | class CppInfo(object): method __init__ (line 90) | def __init__(self, filter=None): method push_scope (line 101) | def push_scope(self,ns,scope_t,base_classes=[]): method pop_scope (line 108) | def pop_scope(self): method add_function (line 114) | def add_function(self, fn): method get_functions (line 124) | def get_functions(self,name,quiet=False): method find_class (line 139) | def find_class(self,name,scope): method __repr__ (line 154) | def __repr__(self): method is_baseclass (line 157) | def is_baseclass(self,cls,base): method __str__ (line 173) | def __str__(self): function flatten (line 190) | def flatten(x): function t_COMMENT (line 365) | def t_COMMENT(t): function t_StringLiteral (line 373) | def t_StringLiteral(t): function t_Identifier (line 378) | def t_Identifier(t): function t_error (line 384) | def t_error(t): function t_newline (line 389) | def t_newline(t): function p_identifier (line 417) | def p_identifier(p): function p_id (line 425) | def p_id(p): function p_global_scope (line 432) | def p_global_scope(p): function p_id_scope (line 437) | def p_id_scope(p): function p_id_scope_seq (line 441) | def p_id_scope_seq(p): function p_nested_id (line 451) | def p_nested_id(p): function p_scoped_id (line 457) | def p_scoped_id(p): function p_destructor_id (line 476) | def p_destructor_id(p): function p_template_decl (line 488) | def p_template_decl(p): function p_special_function_id (line 498) | def p_special_function_id(p): function p_nested_special_function_id (line 505) | def p_nested_special_function_id(p): function p_scoped_special_function_id (line 512) | def p_scoped_special_function_id(p): function p_declarator_id (line 519) | def p_declarator_id(p): function p_built_in_type_id (line 533) | def p_built_in_type_id(p): function p_pseudo_destructor_id (line 539) | def p_pseudo_destructor_id(p): function p_nested_pseudo_destructor_id (line 546) | def p_nested_pseudo_destructor_id(p): function p_scoped_pseudo_destructor_id (line 552) | def p_scoped_pseudo_destructor_id(p): function p_literal (line 563) | def p_literal(p): function p_translation_unit (line 576) | def p_translation_unit(p): function get_rest (line 620) | def get_rest(p): function p_primary_expression (line 623) | def p_primary_expression(p): function p_abstract_expression (line 634) | def p_abstract_expression(p): function p_postfix_expression (line 641) | def p_postfix_expression(p): function p_bexpression_opt (line 661) | def p_bexpression_opt(p): function p_bexpression (line 667) | def p_bexpression(p): function p_bexpression_seq (line 674) | def p_bexpression_seq(p): function p_bexpression_clause (line 680) | def p_bexpression_clause(p): function p_expression_list_opt (line 687) | def p_expression_list_opt(p): function p_expression_list (line 693) | def p_expression_list(p): function p_unary_expression (line 699) | def p_unary_expression(p): function p_delete_expression (line 717) | def p_delete_expression(p): function p_new_expression (line 722) | def p_new_expression(p): function p_new_type_id (line 730) | def p_new_type_id(p): function p_new_declarator (line 737) | def p_new_declarator(p): function p_direct_new_declarator (line 743) | def p_direct_new_declarator(p): function p_new_initializer_opt (line 749) | def p_new_initializer_opt(p): function p_cast_expression (line 760) | def p_cast_expression(p): function p_pm_expression (line 766) | def p_pm_expression(p): function p_multiplicative_expression (line 773) | def p_multiplicative_expression(p): function p_additive_expression (line 781) | def p_additive_expression(p): function p_shift_expression (line 788) | def p_shift_expression(p): function p_relational_expression (line 799) | def p_relational_expression(p): function p_equality_expression (line 804) | def p_equality_expression(p): function p_and_expression (line 811) | def p_and_expression(p): function p_exclusive_or_expression (line 817) | def p_exclusive_or_expression(p): function p_inclusive_or_expression (line 823) | def p_inclusive_or_expression(p): function p_logical_and_expression (line 829) | def p_logical_and_expression(p): function p_logical_or_expression (line 835) | def p_logical_or_expression(p): function p_conditional_expression (line 841) | def p_conditional_expression(p): function p_assignment_expression (line 853) | def p_assignment_expression(p): function p_assignment_operator (line 861) | def p_assignment_operator(p): function p_expression (line 882) | def p_expression(p): function p_constant_expression (line 888) | def p_constant_expression(p): function p_statement (line 903) | def p_statement(p): function p_compound_statement (line 914) | def p_compound_statement(p): function p_statement_seq_opt (line 919) | def p_statement_seq_opt(p): function p_selection_statement (line 928) | def p_selection_statement(p): function p_condition_opt (line 935) | def p_condition_opt(p): function p_condition (line 941) | def p_condition(p): function p_condition_seq (line 948) | def p_condition_seq(p): function p_labeled_statement (line 954) | def p_labeled_statement(p): function p_try_block (line 961) | def p_try_block(p): function p_jump_statement (line 967) | def p_jump_statement(p): function p_iteration_statement (line 975) | def p_iteration_statement(p): function p_declaration_statement (line 982) | def p_declaration_statement(p): function p_compound_declaration (line 990) | def p_compound_declaration(p): function p_declaration_seq_opt (line 995) | def p_declaration_seq_opt(p): function p_declaration (line 1001) | def p_declaration(p): function p_specialised_declaration (line 1010) | def p_specialised_declaration(p): function p_block_declaration (line 1017) | def p_block_declaration(p): function p_specialised_block_declaration (line 1023) | def p_specialised_block_declaration(p): function p_simple_declaration (line 1032) | def p_simple_declaration(p): function p_suffix_built_in_decl_specifier_raw (line 1055) | def p_suffix_built_in_decl_specifier_raw(p): function p_suffix_built_in_decl_specifier (line 1062) | def p_suffix_built_in_decl_specifier(p): function p_suffix_named_decl_specifier (line 1070) | def p_suffix_named_decl_specifier(p): function p_suffix_named_decl_specifier_bi (line 1077) | def p_suffix_named_decl_specifier_bi(p): function p_suffix_named_decl_specifiers (line 1084) | def p_suffix_named_decl_specifiers(p): function p_suffix_named_decl_specifiers_sf (line 1090) | def p_suffix_named_decl_specifiers_sf(p): function p_suffix_decl_specified_ids (line 1098) | def p_suffix_decl_specified_ids(p): function p_suffix_decl_specified_scope (line 1108) | def p_suffix_decl_specified_scope(p): function p_decl_specifier_affix (line 1115) | def p_decl_specifier_affix(p): function p_decl_specifier_suffix (line 1124) | def p_decl_specifier_suffix(p): function p_decl_specifier_prefix (line 1129) | def p_decl_specifier_prefix(p): function p_storage_class_specifier (line 1135) | def p_storage_class_specifier(p): function p_function_specifier (line 1145) | def p_function_specifier(p): function p_type_specifier (line 1152) | def p_type_specifier(p): function p_elaborate_type_specifier (line 1159) | def p_elaborate_type_specifier(p): function p_simple_type_specifier (line 1167) | def p_simple_type_specifier(p): function p_built_in_type_specifier (line 1174) | def p_built_in_type_specifier(p): function p_attributes (line 1180) | def p_attributes(p): function p_attribute (line 1186) | def p_attribute(p): function p_Xbuilt_in_type_specifier (line 1190) | def p_Xbuilt_in_type_specifier(p): function p_elaborated_type_specifier (line 1216) | def p_elaborated_type_specifier(p): function p_elaborated_enum_specifier (line 1223) | def p_elaborated_enum_specifier(p): function p_enum_specifier (line 1228) | def p_enum_specifier(p): function p_enumerator_clause (line 1234) | def p_enumerator_clause(p): function p_enumerator_list_ecarb (line 1241) | def p_enumerator_list_ecarb(p): function p_enumerator_definition_ecarb (line 1246) | def p_enumerator_definition_ecarb(p): function p_enumerator_definition_filler (line 1251) | def p_enumerator_definition_filler(p): function p_enumerator_list_head (line 1256) | def p_enumerator_list_head(p): function p_enumerator_list (line 1262) | def p_enumerator_list(p): function p_enumerator_definition (line 1267) | def p_enumerator_definition(p): function p_enumerator (line 1273) | def p_enumerator(p): function p_namespace_definition (line 1278) | def p_namespace_definition(p): function p_namespace_alias_definition (line 1285) | def p_namespace_alias_definition(p): function p_push_scope (line 1290) | def p_push_scope(p): function p_using_declaration (line 1299) | def p_using_declaration(p): function p_using_directive (line 1305) | def p_using_directive(p): function p_asm_definition (line 1311) | def p_asm_definition(p): function p_linkage_specification (line 1316) | def p_linkage_specification(p): function p_init_declarations (line 1331) | def p_init_declarations(p): function p_init_declaration (line 1337) | def p_init_declaration(p): function p_star_ptr_operator (line 1342) | def p_star_ptr_operator(p): function p_nested_ptr_operator (line 1348) | def p_nested_ptr_operator(p): function p_ptr_operator (line 1354) | def p_ptr_operator(p): function p_ptr_operator_seq (line 1361) | def p_ptr_operator_seq(p): function p_ptr_operator_seq_opt (line 1370) | def p_ptr_operator_seq_opt(p): function p_cv_qualifier_seq_opt (line 1376) | def p_cv_qualifier_seq_opt(p): function p_cv_qualifier (line 1383) | def p_cv_qualifier(p): function p_type_id (line 1390) | def p_type_id(p): function p_abstract_declarator_opt (line 1396) | def p_abstract_declarator_opt(p): function p_direct_abstract_declarator_opt (line 1403) | def p_direct_abstract_declarator_opt(p): function p_direct_abstract_declarator (line 1409) | def p_direct_abstract_declarator(p): function p_parenthesis_clause (line 1416) | def p_parenthesis_clause(p): function p_parameters_clause (line 1422) | def p_parameters_clause(p): function p_abstract_pointer_declaration (line 1433) | def p_abstract_pointer_declaration(p): function p_abstract_parameter_declaration (line 1439) | def p_abstract_parameter_declaration(p): function p_special_parameter_declaration (line 1446) | def p_special_parameter_declaration(p): function p_parameter_declaration (line 1453) | def p_parameter_declaration(p): function p_function_definition (line 1463) | def p_function_definition(p): function p_func_definition (line 1469) | def p_func_definition(p): function p_ctor_definition (line 1488) | def p_ctor_definition(p): function p_constructor_head (line 1498) | def p_constructor_head(p): function p_function_try_block (line 1504) | def p_function_try_block(p): function p_function_block (line 1511) | def p_function_block(p): function p_function_body (line 1516) | def p_function_body(p): function p_initializer_clause (line 1521) | def p_initializer_clause(p): function p_braced_initializer (line 1527) | def p_braced_initializer(p): function p_initializer_list (line 1534) | def p_initializer_list(p): function p_class_specifier_head (line 1555) | def p_class_specifier_head(p): function p_class_key (line 1575) | def p_class_key(p): function p_class_specifier (line 1582) | def p_class_specifier(p): function p_member_specification_opt (line 1587) | def p_member_specification_opt(p): function p_member_declaration (line 1593) | def p_member_declaration(p): function p_simple_member_declaration (line 1609) | def p_simple_member_declaration(p): function p_member_init_declarations (line 1621) | def p_member_init_declarations(p): function p_member_init_declaration (line 1628) | def p_member_init_declaration(p): function p_accessibility_specifier (line 1634) | def p_accessibility_specifier(p): function p_bit_field_declaration (line 1639) | def p_bit_field_declaration(p): function p_bit_field_width (line 1646) | def p_bit_field_width(p): function p_bit_field_init_declaration (line 1652) | def p_bit_field_init_declaration(p): function p_base_specifier_list (line 1661) | def p_base_specifier_list(p): function p_base_specifier (line 1670) | def p_base_specifier(p): function p_access_specifier (line 1680) | def p_access_specifier(p): function p_conversion_function_id (line 1690) | def p_conversion_function_id(p): function p_conversion_type_id (line 1695) | def p_conversion_type_id(p): function p_ctor_initializer_opt (line 1708) | def p_ctor_initializer_opt(p): function p_ctor_initializer (line 1714) | def p_ctor_initializer(p): function p_mem_initializer_list (line 1719) | def p_mem_initializer_list(p): function p_mem_initializer_list_head (line 1725) | def p_mem_initializer_list_head(p): function p_mem_initializer (line 1730) | def p_mem_initializer(p): function p_mem_initializer_id (line 1735) | def p_mem_initializer_id(p): function p_operator_function_id (line 1744) | def p_operator_function_id(p): function p_operator (line 1763) | def p_operator(p): function p_reserved (line 1808) | def p_reserved(p): function p_template_declaration (line 1884) | def p_template_declaration(p): function p_template_parameter_clause (line 1890) | def p_template_parameter_clause(p): function p_explicit_specialization (line 1901) | def p_explicit_specialization(p): function p_handler_seq (line 1909) | def p_handler_seq(p): function p_handler (line 1915) | def p_handler(p): function p_exception_declaration (line 1921) | def p_exception_declaration(p): function p_throw_expression (line 1926) | def p_throw_expression(p): function p_exception_specification (line 1933) | def p_exception_specification(p): function p_type_id_list (line 1940) | def p_type_id_list(p): function p_nonsemicolon_seq (line 1949) | def p_nonsemicolon_seq(p): function p_nonsemicolon (line 1955) | def p_nonsemicolon(p): function p_nonparen_seq_opt (line 1966) | def p_nonparen_seq_opt(p): function p_nonparen_seq (line 1972) | def p_nonparen_seq(p): function p_nonparen (line 1978) | def p_nonparen(p): function p_nonbracket_seq_opt (line 1988) | def p_nonbracket_seq_opt(p): function p_nonbracket_seq (line 1994) | def p_nonbracket_seq(p): function p_nonbracket (line 2000) | def p_nonbracket(p): function p_nonbrace_seq_opt (line 2012) | def p_nonbrace_seq_opt(p): function p_nonbrace (line 2018) | def p_nonbrace(p): function p_nonlgt_seq_opt (line 2030) | def p_nonlgt_seq_opt(p): function p_nonlgt (line 2036) | def p_nonlgt(p): function p_misc (line 2046) | def p_misc(p): function p_empty (line 2063) | def p_empty(p): function _find_column (line 2074) | def _find_column(input,token): function p_error (line 2083) | def p_error(p): function parse_cpp (line 2102) | def parse_cpp(data=None, filename=None, debug=0, optimize=0, verbose=Fal... FILE: cxxtest/python/cxxtest/cxxtest_fog.py function cstr (line 26) | def cstr( str ): function scanInputFiles (line 30) | def scanInputFiles(files, _options): FILE: cxxtest/python/cxxtest/cxxtest_misc.py function abort (line 13) | def abort( problem ): FILE: cxxtest/python/cxxtest/cxxtest_parser.py function scanInputFiles (line 25) | def scanInputFiles(files, _options): function scanInputFile (line 37) | def scanInputFile(fileName): function scanInputLine (line 69) | def scanInputLine( fileName, lineNo, line ): function scanLineInsideSuite (line 80) | def scanLineInsideSuite( suite, lineNo, line ): function lineBelongsToSuite (line 88) | def lineBelongsToSuite( suite, lineNo, line ): function scanLineForStandardLibrary (line 104) | def scanLineForStandardLibrary( line ): function scanLineForExceptionHandling (line 112) | def scanLineForExceptionHandling( line ): function scanLineForSuiteStart (line 126) | def scanLineForSuiteStart( fileName, lineNo, line ): function startSuite (line 141) | def startSuite( name, file, line, generated ): function lineStartsBlock (line 159) | def lineStartsBlock( line ): function scanLineForTest (line 164) | def scanLineForTest( suite, lineNo, line ): function addTest (line 170) | def addTest( suite, name, line ): function addLineToBlock (line 180) | def addLineToBlock( suite, lineNo, line ): function fixBlockLine (line 191) | def fixBlockLine( suite, lineNo, line): function scanLineForCreate (line 198) | def scanLineForCreate( suite, lineNo, line ): function scanLineForDestroy (line 204) | def scanLineForDestroy( suite, lineNo, line ): function cstr (line 209) | def cstr( s ): function addSuiteCreateDestroy (line 214) | def addSuiteCreateDestroy( suite, which, line ): function closeSuite (line 220) | def closeSuite(): function verifySuite (line 229) | def verifySuite(suite): function rememberSuite (line 238) | def rememberSuite(suite): FILE: cxxtest/python/cxxtest/cxxtestgen.py function main (line 41) | def main(args=sys.argv): function parseCommandline (line 62) | def parseCommandline(args): function printVersion (line 191) | def printVersion(): function setFiles (line 196) | def setFiles(patterns ): function expandWildcards (line 201) | def expandWildcards( patterns ): function fixBackslashes (line 210) | def fixBackslashes( fileName ): function writeOutput (line 215) | def writeOutput(): function writeSimpleOutput (line 222) | def writeSimpleOutput(): function writeTemplateOutput (line 238) | def writeTemplateOutput(): function startOutputFile (line 260) | def startOutputFile(): function writePreamble (line 269) | def writePreamble( output ): function writeMain (line 303) | def writeMain( output ): function writeWorld (line 326) | def writeWorld( output ): function writeSuites (line 339) | def writeSuites(output): function isGenerated (line 353) | def isGenerated(suite): function isDynamic (line 357) | def isDynamic(suite): function writeInclude (line 361) | def writeInclude(output, file): function generateSuite (line 368) | def generateSuite( output, suite ): function writeSuitePointer (line 376) | def writeSuitePointer( output, suite ): function writeSuiteObject (line 383) | def writeSuiteObject( output, suite ): function writeTestList (line 387) | def writeTestList( output, suite ): function writeWorldDescr (line 394) | def writeWorldDescr( output ): function writeTestDescriptions (line 401) | def writeTestDescriptions( output, suite ): function writeTestDescription (line 406) | def writeTestDescription( output, suite, test ): function runBody (line 416) | def runBody( suite, test ): function dynamicRun (line 421) | def dynamicRun( suite, test ): function staticRun (line 425) | def staticRun( suite, test ): function writeSuiteDescription (line 429) | def writeSuiteDescription( output, suite ): function writeDynamicDescription (line 436) | def writeDynamicDescription( output, suite ): function writeStaticDescription (line 445) | def writeStaticDescription( output, suite ): function writeRoot (line 453) | def writeRoot(output): function writeInitialize (line 457) | def writeInitialize(output): FILE: cxxtest/python/python3/cxxtest/cxx_parser.py function ply_init (line 68) | def ply_init(data): class Scope (line 73) | class Scope(object): method __init__ (line 75) | def __init__(self,name,abs_name,scope_t,base_classes,lineno): method insert (line 84) | def insert(self,scope): class CppInfo (line 88) | class CppInfo(object): method __init__ (line 90) | def __init__(self, filter=None): method push_scope (line 101) | def push_scope(self,ns,scope_t,base_classes=[]): method pop_scope (line 108) | def pop_scope(self): method add_function (line 114) | def add_function(self, fn): method get_functions (line 124) | def get_functions(self,name,quiet=False): method find_class (line 139) | def find_class(self,name,scope): method __repr__ (line 154) | def __repr__(self): method is_baseclass (line 157) | def is_baseclass(self,cls,base): method __str__ (line 173) | def __str__(self): function flatten (line 190) | def flatten(x): function t_COMMENT (line 365) | def t_COMMENT(t): function t_StringLiteral (line 373) | def t_StringLiteral(t): function t_Identifier (line 378) | def t_Identifier(t): function t_error (line 384) | def t_error(t): function t_newline (line 389) | def t_newline(t): function p_identifier (line 417) | def p_identifier(p): function p_id (line 425) | def p_id(p): function p_global_scope (line 432) | def p_global_scope(p): function p_id_scope (line 437) | def p_id_scope(p): function p_id_scope_seq (line 441) | def p_id_scope_seq(p): function p_nested_id (line 451) | def p_nested_id(p): function p_scoped_id (line 457) | def p_scoped_id(p): function p_destructor_id (line 476) | def p_destructor_id(p): function p_template_decl (line 488) | def p_template_decl(p): function p_special_function_id (line 498) | def p_special_function_id(p): function p_nested_special_function_id (line 505) | def p_nested_special_function_id(p): function p_scoped_special_function_id (line 512) | def p_scoped_special_function_id(p): function p_declarator_id (line 519) | def p_declarator_id(p): function p_built_in_type_id (line 533) | def p_built_in_type_id(p): function p_pseudo_destructor_id (line 539) | def p_pseudo_destructor_id(p): function p_nested_pseudo_destructor_id (line 546) | def p_nested_pseudo_destructor_id(p): function p_scoped_pseudo_destructor_id (line 552) | def p_scoped_pseudo_destructor_id(p): function p_literal (line 563) | def p_literal(p): function p_translation_unit (line 576) | def p_translation_unit(p): function get_rest (line 620) | def get_rest(p): function p_primary_expression (line 623) | def p_primary_expression(p): function p_abstract_expression (line 634) | def p_abstract_expression(p): function p_postfix_expression (line 641) | def p_postfix_expression(p): function p_bexpression_opt (line 661) | def p_bexpression_opt(p): function p_bexpression (line 667) | def p_bexpression(p): function p_bexpression_seq (line 674) | def p_bexpression_seq(p): function p_bexpression_clause (line 680) | def p_bexpression_clause(p): function p_expression_list_opt (line 687) | def p_expression_list_opt(p): function p_expression_list (line 693) | def p_expression_list(p): function p_unary_expression (line 699) | def p_unary_expression(p): function p_delete_expression (line 717) | def p_delete_expression(p): function p_new_expression (line 722) | def p_new_expression(p): function p_new_type_id (line 730) | def p_new_type_id(p): function p_new_declarator (line 737) | def p_new_declarator(p): function p_direct_new_declarator (line 743) | def p_direct_new_declarator(p): function p_new_initializer_opt (line 749) | def p_new_initializer_opt(p): function p_cast_expression (line 760) | def p_cast_expression(p): function p_pm_expression (line 766) | def p_pm_expression(p): function p_multiplicative_expression (line 773) | def p_multiplicative_expression(p): function p_additive_expression (line 781) | def p_additive_expression(p): function p_shift_expression (line 788) | def p_shift_expression(p): function p_relational_expression (line 799) | def p_relational_expression(p): function p_equality_expression (line 804) | def p_equality_expression(p): function p_and_expression (line 811) | def p_and_expression(p): function p_exclusive_or_expression (line 817) | def p_exclusive_or_expression(p): function p_inclusive_or_expression (line 823) | def p_inclusive_or_expression(p): function p_logical_and_expression (line 829) | def p_logical_and_expression(p): function p_logical_or_expression (line 835) | def p_logical_or_expression(p): function p_conditional_expression (line 841) | def p_conditional_expression(p): function p_assignment_expression (line 853) | def p_assignment_expression(p): function p_assignment_operator (line 861) | def p_assignment_operator(p): function p_expression (line 882) | def p_expression(p): function p_constant_expression (line 888) | def p_constant_expression(p): function p_statement (line 903) | def p_statement(p): function p_compound_statement (line 914) | def p_compound_statement(p): function p_statement_seq_opt (line 919) | def p_statement_seq_opt(p): function p_selection_statement (line 928) | def p_selection_statement(p): function p_condition_opt (line 935) | def p_condition_opt(p): function p_condition (line 941) | def p_condition(p): function p_condition_seq (line 948) | def p_condition_seq(p): function p_labeled_statement (line 954) | def p_labeled_statement(p): function p_try_block (line 961) | def p_try_block(p): function p_jump_statement (line 967) | def p_jump_statement(p): function p_iteration_statement (line 975) | def p_iteration_statement(p): function p_declaration_statement (line 982) | def p_declaration_statement(p): function p_compound_declaration (line 990) | def p_compound_declaration(p): function p_declaration_seq_opt (line 995) | def p_declaration_seq_opt(p): function p_declaration (line 1001) | def p_declaration(p): function p_specialised_declaration (line 1010) | def p_specialised_declaration(p): function p_block_declaration (line 1017) | def p_block_declaration(p): function p_specialised_block_declaration (line 1023) | def p_specialised_block_declaration(p): function p_simple_declaration (line 1032) | def p_simple_declaration(p): function p_suffix_built_in_decl_specifier_raw (line 1055) | def p_suffix_built_in_decl_specifier_raw(p): function p_suffix_built_in_decl_specifier (line 1062) | def p_suffix_built_in_decl_specifier(p): function p_suffix_named_decl_specifier (line 1070) | def p_suffix_named_decl_specifier(p): function p_suffix_named_decl_specifier_bi (line 1077) | def p_suffix_named_decl_specifier_bi(p): function p_suffix_named_decl_specifiers (line 1084) | def p_suffix_named_decl_specifiers(p): function p_suffix_named_decl_specifiers_sf (line 1090) | def p_suffix_named_decl_specifiers_sf(p): function p_suffix_decl_specified_ids (line 1098) | def p_suffix_decl_specified_ids(p): function p_suffix_decl_specified_scope (line 1108) | def p_suffix_decl_specified_scope(p): function p_decl_specifier_affix (line 1115) | def p_decl_specifier_affix(p): function p_decl_specifier_suffix (line 1124) | def p_decl_specifier_suffix(p): function p_decl_specifier_prefix (line 1129) | def p_decl_specifier_prefix(p): function p_storage_class_specifier (line 1135) | def p_storage_class_specifier(p): function p_function_specifier (line 1145) | def p_function_specifier(p): function p_type_specifier (line 1152) | def p_type_specifier(p): function p_elaborate_type_specifier (line 1159) | def p_elaborate_type_specifier(p): function p_simple_type_specifier (line 1167) | def p_simple_type_specifier(p): function p_built_in_type_specifier (line 1174) | def p_built_in_type_specifier(p): function p_attributes (line 1180) | def p_attributes(p): function p_attribute (line 1186) | def p_attribute(p): function p_Xbuilt_in_type_specifier (line 1190) | def p_Xbuilt_in_type_specifier(p): function p_elaborated_type_specifier (line 1216) | def p_elaborated_type_specifier(p): function p_elaborated_enum_specifier (line 1223) | def p_elaborated_enum_specifier(p): function p_enum_specifier (line 1228) | def p_enum_specifier(p): function p_enumerator_clause (line 1234) | def p_enumerator_clause(p): function p_enumerator_list_ecarb (line 1241) | def p_enumerator_list_ecarb(p): function p_enumerator_definition_ecarb (line 1246) | def p_enumerator_definition_ecarb(p): function p_enumerator_definition_filler (line 1251) | def p_enumerator_definition_filler(p): function p_enumerator_list_head (line 1256) | def p_enumerator_list_head(p): function p_enumerator_list (line 1262) | def p_enumerator_list(p): function p_enumerator_definition (line 1267) | def p_enumerator_definition(p): function p_enumerator (line 1273) | def p_enumerator(p): function p_namespace_definition (line 1278) | def p_namespace_definition(p): function p_namespace_alias_definition (line 1285) | def p_namespace_alias_definition(p): function p_push_scope (line 1290) | def p_push_scope(p): function p_using_declaration (line 1299) | def p_using_declaration(p): function p_using_directive (line 1305) | def p_using_directive(p): function p_asm_definition (line 1311) | def p_asm_definition(p): function p_linkage_specification (line 1316) | def p_linkage_specification(p): function p_init_declarations (line 1331) | def p_init_declarations(p): function p_init_declaration (line 1337) | def p_init_declaration(p): function p_star_ptr_operator (line 1342) | def p_star_ptr_operator(p): function p_nested_ptr_operator (line 1348) | def p_nested_ptr_operator(p): function p_ptr_operator (line 1354) | def p_ptr_operator(p): function p_ptr_operator_seq (line 1361) | def p_ptr_operator_seq(p): function p_ptr_operator_seq_opt (line 1370) | def p_ptr_operator_seq_opt(p): function p_cv_qualifier_seq_opt (line 1376) | def p_cv_qualifier_seq_opt(p): function p_cv_qualifier (line 1383) | def p_cv_qualifier(p): function p_type_id (line 1390) | def p_type_id(p): function p_abstract_declarator_opt (line 1396) | def p_abstract_declarator_opt(p): function p_direct_abstract_declarator_opt (line 1403) | def p_direct_abstract_declarator_opt(p): function p_direct_abstract_declarator (line 1409) | def p_direct_abstract_declarator(p): function p_parenthesis_clause (line 1416) | def p_parenthesis_clause(p): function p_parameters_clause (line 1422) | def p_parameters_clause(p): function p_abstract_pointer_declaration (line 1433) | def p_abstract_pointer_declaration(p): function p_abstract_parameter_declaration (line 1439) | def p_abstract_parameter_declaration(p): function p_special_parameter_declaration (line 1446) | def p_special_parameter_declaration(p): function p_parameter_declaration (line 1453) | def p_parameter_declaration(p): function p_function_definition (line 1463) | def p_function_definition(p): function p_func_definition (line 1469) | def p_func_definition(p): function p_ctor_definition (line 1488) | def p_ctor_definition(p): function p_constructor_head (line 1498) | def p_constructor_head(p): function p_function_try_block (line 1504) | def p_function_try_block(p): function p_function_block (line 1511) | def p_function_block(p): function p_function_body (line 1516) | def p_function_body(p): function p_initializer_clause (line 1521) | def p_initializer_clause(p): function p_braced_initializer (line 1527) | def p_braced_initializer(p): function p_initializer_list (line 1534) | def p_initializer_list(p): function p_class_specifier_head (line 1555) | def p_class_specifier_head(p): function p_class_key (line 1575) | def p_class_key(p): function p_class_specifier (line 1582) | def p_class_specifier(p): function p_member_specification_opt (line 1587) | def p_member_specification_opt(p): function p_member_declaration (line 1593) | def p_member_declaration(p): function p_simple_member_declaration (line 1609) | def p_simple_member_declaration(p): function p_member_init_declarations (line 1621) | def p_member_init_declarations(p): function p_member_init_declaration (line 1628) | def p_member_init_declaration(p): function p_accessibility_specifier (line 1634) | def p_accessibility_specifier(p): function p_bit_field_declaration (line 1639) | def p_bit_field_declaration(p): function p_bit_field_width (line 1646) | def p_bit_field_width(p): function p_bit_field_init_declaration (line 1652) | def p_bit_field_init_declaration(p): function p_base_specifier_list (line 1661) | def p_base_specifier_list(p): function p_base_specifier (line 1670) | def p_base_specifier(p): function p_access_specifier (line 1680) | def p_access_specifier(p): function p_conversion_function_id (line 1690) | def p_conversion_function_id(p): function p_conversion_type_id (line 1695) | def p_conversion_type_id(p): function p_ctor_initializer_opt (line 1708) | def p_ctor_initializer_opt(p): function p_ctor_initializer (line 1714) | def p_ctor_initializer(p): function p_mem_initializer_list (line 1719) | def p_mem_initializer_list(p): function p_mem_initializer_list_head (line 1725) | def p_mem_initializer_list_head(p): function p_mem_initializer (line 1730) | def p_mem_initializer(p): function p_mem_initializer_id (line 1735) | def p_mem_initializer_id(p): function p_operator_function_id (line 1744) | def p_operator_function_id(p): function p_operator (line 1763) | def p_operator(p): function p_reserved (line 1808) | def p_reserved(p): function p_template_declaration (line 1884) | def p_template_declaration(p): function p_template_parameter_clause (line 1890) | def p_template_parameter_clause(p): function p_explicit_specialization (line 1901) | def p_explicit_specialization(p): function p_handler_seq (line 1909) | def p_handler_seq(p): function p_handler (line 1915) | def p_handler(p): function p_exception_declaration (line 1921) | def p_exception_declaration(p): function p_throw_expression (line 1926) | def p_throw_expression(p): function p_exception_specification (line 1933) | def p_exception_specification(p): function p_type_id_list (line 1940) | def p_type_id_list(p): function p_nonsemicolon_seq (line 1949) | def p_nonsemicolon_seq(p): function p_nonsemicolon (line 1955) | def p_nonsemicolon(p): function p_nonparen_seq_opt (line 1966) | def p_nonparen_seq_opt(p): function p_nonparen_seq (line 1972) | def p_nonparen_seq(p): function p_nonparen (line 1978) | def p_nonparen(p): function p_nonbracket_seq_opt (line 1988) | def p_nonbracket_seq_opt(p): function p_nonbracket_seq (line 1994) | def p_nonbracket_seq(p): function p_nonbracket (line 2000) | def p_nonbracket(p): function p_nonbrace_seq_opt (line 2012) | def p_nonbrace_seq_opt(p): function p_nonbrace (line 2018) | def p_nonbrace(p): function p_nonlgt_seq_opt (line 2030) | def p_nonlgt_seq_opt(p): function p_nonlgt (line 2036) | def p_nonlgt(p): function p_misc (line 2046) | def p_misc(p): function p_empty (line 2063) | def p_empty(p): function _find_column (line 2074) | def _find_column(input,token): function p_error (line 2083) | def p_error(p): function parse_cpp (line 2102) | def parse_cpp(data=None, filename=None, debug=0, optimize=0, verbose=Fal... FILE: cxxtest/python/python3/cxxtest/cxxtest_fog.py function cstr (line 26) | def cstr( str ): function scanInputFiles (line 30) | def scanInputFiles(files, _options): FILE: cxxtest/python/python3/cxxtest/cxxtest_misc.py function abort (line 13) | def abort( problem ): FILE: cxxtest/python/python3/cxxtest/cxxtest_parser.py function scanInputFiles (line 25) | def scanInputFiles(files, _options): function scanInputFile (line 37) | def scanInputFile(fileName): function scanInputLine (line 69) | def scanInputLine( fileName, lineNo, line ): function scanLineInsideSuite (line 80) | def scanLineInsideSuite( suite, lineNo, line ): function lineBelongsToSuite (line 88) | def lineBelongsToSuite( suite, lineNo, line ): function scanLineForStandardLibrary (line 104) | def scanLineForStandardLibrary( line ): function scanLineForExceptionHandling (line 112) | def scanLineForExceptionHandling( line ): function scanLineForSuiteStart (line 126) | def scanLineForSuiteStart( fileName, lineNo, line ): function startSuite (line 141) | def startSuite( name, file, line, generated ): function lineStartsBlock (line 159) | def lineStartsBlock( line ): function scanLineForTest (line 164) | def scanLineForTest( suite, lineNo, line ): function addTest (line 170) | def addTest( suite, name, line ): function addLineToBlock (line 180) | def addLineToBlock( suite, lineNo, line ): function fixBlockLine (line 191) | def fixBlockLine( suite, lineNo, line): function scanLineForCreate (line 198) | def scanLineForCreate( suite, lineNo, line ): function scanLineForDestroy (line 204) | def scanLineForDestroy( suite, lineNo, line ): function cstr (line 209) | def cstr( s ): function addSuiteCreateDestroy (line 214) | def addSuiteCreateDestroy( suite, which, line ): function closeSuite (line 220) | def closeSuite(): function verifySuite (line 229) | def verifySuite(suite): function rememberSuite (line 238) | def rememberSuite(suite): FILE: cxxtest/python/python3/cxxtest/cxxtestgen.py function main (line 41) | def main(args=sys.argv): function parseCommandline (line 62) | def parseCommandline(args): function printVersion (line 191) | def printVersion(): function setFiles (line 196) | def setFiles(patterns ): function expandWildcards (line 201) | def expandWildcards( patterns ): function fixBackslashes (line 210) | def fixBackslashes( fileName ): function writeOutput (line 215) | def writeOutput(): function writeSimpleOutput (line 222) | def writeSimpleOutput(): function writeTemplateOutput (line 238) | def writeTemplateOutput(): function startOutputFile (line 260) | def startOutputFile(): function writePreamble (line 269) | def writePreamble( output ): function writeMain (line 303) | def writeMain( output ): function writeWorld (line 326) | def writeWorld( output ): function writeSuites (line 339) | def writeSuites(output): function isGenerated (line 353) | def isGenerated(suite): function isDynamic (line 357) | def isDynamic(suite): function writeInclude (line 361) | def writeInclude(output, file): function generateSuite (line 368) | def generateSuite( output, suite ): function writeSuitePointer (line 376) | def writeSuitePointer( output, suite ): function writeSuiteObject (line 383) | def writeSuiteObject( output, suite ): function writeTestList (line 387) | def writeTestList( output, suite ): function writeWorldDescr (line 394) | def writeWorldDescr( output ): function writeTestDescriptions (line 401) | def writeTestDescriptions( output, suite ): function writeTestDescription (line 406) | def writeTestDescription( output, suite, test ): function runBody (line 416) | def runBody( suite, test ): function dynamicRun (line 421) | def dynamicRun( suite, test ): function staticRun (line 425) | def staticRun( suite, test ): function writeSuiteDescription (line 429) | def writeSuiteDescription( output, suite ): function writeDynamicDescription (line 436) | def writeDynamicDescription( output, suite ): function writeStaticDescription (line 445) | def writeStaticDescription( output, suite ): function writeRoot (line 453) | def writeRoot(output): function writeInitialize (line 457) | def writeInitialize(output): FILE: demoapps/dsl/gen_impl.cpp function user_program (line 32) | void user_program(user_funs* f) { function vertex_reduce (line 46) | void vertex_reduce(vertex_data_type& a, const vertex_data_type& b) { FILE: demoapps/dsl/gl_server.cpp function get_vertex_data (line 50) | graph_type::vertex_data_type get_vertex_data(graph_type::vertex_type* v) { function set_vertex_data (line 53) | void set_vertex_data(graph_type::vertex_data_type& d, graph_type::vertex... function vertex_get_map (line 60) | graph_type::vertex_data_type vertex_get_map(const graph_type::vertex_typ... function vertex_get_reduce (line 68) | void vertex_get_reduce(vertex_data_type& ev, const vertex_data_type ed) { function vertex_data_type (line 88) | vertex_data_type reduce_neighbors(edge_dir_type d, engine_type::context_... function signal_neighbors (line 92) | void signal_neighbors(edge_dir_type d, engine_type::context_type* ctx) { function server_program (line 100) | void server_program(engine_type::context_type& context, function init_vertex (line 133) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } function main (line 135) | int main(int argc, char** argv) { FILE: demoapps/pagerank/simple_pagerank.cpp function init_vertex (line 48) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } class pagerank (line 72) | class pagerank : method gather (line 78) | float gather(icontext_type& context, const vertex_type& vertex, method apply (line 85) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 93) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 100) | void scatter(icontext_type& context, const vertex_type& vertex, type pagerank_writer (line 111) | struct pagerank_writer { method save_vertex (line 112) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 117) | std::string save_edge(graph_type::edge_type e) { return ""; } function main (line 122) | int main(int argc, char** argv) { FILE: demoapps/pagerank/warp_engine_pagerank.cpp function init_vertex (line 39) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } function pagerank_map (line 42) | float pagerank_map(graph_type::edge_type edge, graph_type::vertex_type o... function signal_neighbor (line 47) | void signal_neighbor(warp_engine_type::context& context, function pagerank (line 54) | void pagerank(warp_engine_type::context& context, type pagerank_writer (line 74) | struct pagerank_writer { method save_vertex (line 75) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 80) | std::string save_edge(graph_type::edge_type e) { return ""; } function main (line 84) | int main(int argc, char** argv) { FILE: demoapps/pagerank/warp_parfor_pagerank.cpp function init_vertex (line 40) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } function pagerank_map (line 43) | float pagerank_map(graph_type::edge_type edge, graph_type::vertex_type o... function pagerank (line 47) | void pagerank(graph_type::vertex_type vertex) { type pagerank_writer (line 57) | struct pagerank_writer { method save_vertex (line 58) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 63) | std::string save_edge(graph_type::edge_type e) { return ""; } function main (line 67) | int main(int argc, char** argv) { FILE: demoapps/rpc/dht_performance_test.cpp function randstring (line 34) | std::string randstring(size_t len) { function main (line 45) | int main(int argc, char ** argv) { FILE: demoapps/rpc/fiber_future_test.cpp function some_remote_function (line 35) | size_t some_remote_function(size_t a) { function test_fiber (line 39) | void test_fiber(size_t sequential_count) { function main (line 46) | int main(int argc, char** argv) { FILE: demoapps/rpc/obj_fiber_future_test.cpp type testclass (line 33) | struct testclass { method testclass (line 37) | testclass(distributed_control& dc): rmi(dc, this) { } method some_remote_function (line 40) | size_t some_remote_function(size_t a) { method test_fiber (line 44) | void test_fiber(size_t sequential_count) { function main (line 53) | int main(int argc, char** argv) { FILE: demoapps/rpc/rpc_call_perf_test.cpp type teststruct (line 33) | struct teststruct { method teststruct (line 36) | teststruct(distributed_control &dc):rmi(dc, this) { method receive_ints (line 45) | void receive_ints(size_t i0, size_t i1, size_t i2, size_t i3) { method receive_vector (line 50) | void receive_vector(const std::vector &s) { method receive_string (line 54) | void receive_string(const std::string &s) { method perform_short_sends_0 (line 63) | void perform_short_sends_0(size_t number) { method perform_long_sends_0 (line 69) | void perform_long_sends_0(size_t length, size_t number) { method perform_string_sends_0 (line 77) | void perform_string_sends_0(size_t length, size_t number) { method print_res (line 86) | void print_res(double t1, double t2, double t3) { method run_short_sends_0 (line 93) | void run_short_sends_0() { method run_threaded_short_sends_0 (line 112) | void run_threaded_short_sends_0(size_t numthreads) { method run_string_sends_0 (line 138) | void run_string_sends_0(size_t length) { method run_threaded_string_sends_0 (line 163) | void run_threaded_string_sends_0(size_t length, size_t numthreads) { function main (line 194) | int main(int argc, char** argv) { FILE: demoapps/rpc/rpc_example1.cpp function print (line 29) | void print(int val) { function add_one (line 33) | int add_one(int val) { function main (line 38) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example2.cpp function print (line 34) | void print(std::string val) { function add_one (line 38) | std::vector add_one(std::vector val) { function main (line 44) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example3.cpp type teststruct (line 33) | struct teststruct: public IS_POD_TYPE{ function print (line 39) | void print(std::map &data1, function main (line 48) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example4.cpp type teststruct (line 32) | struct teststruct{ method save (line 37) | void save(oarchive &arc) const { method load (line 40) | void load(iarchive &arc) { function print (line 46) | void print(std::map &data1, function main (line 55) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example5.cpp function main (line 31) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example6.cpp function print (line 32) | void print(any val) { function main (line 38) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example7.cpp class distributed_vector (line 33) | class distributed_vector { method distributed_vector (line 39) | distributed_vector(distributed_control &dc):rmi(dc, this) { } method T (line 42) | T get(size_t i) { method set (line 63) | void set(size_t i, const T& val) { function main (line 83) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example8.cpp function print (line 29) | void print(distributed_control &dc, procid_t caller, int val) { function main (line 35) | int main(int argc, char ** argv) { FILE: demoapps/rpc/rpc_example9.cpp type test_struct (line 30) | struct test_struct { method test_struct (line 32) | test_struct(distributed_control &dc):rmi(dc, this) { method test_blob (line 36) | void test_blob(size_t len, wild_pointer w) { method print (line 41) | void print(int val) { method test (line 45) | void test() { function main (line 69) | int main(int argc, char ** argv) { FILE: scripts/ec2/gl_ec2.py function parse_args (line 42) | def parse_args(): function get_or_make_group (line 118) | def get_or_make_group(conn, name): function wait_for_instances (line 130) | def wait_for_instances(conn, instances): function is_active (line 143) | def is_active(instance): function launch_cluster (line 152) | def launch_cluster(conn, opts, cluster_name): function get_existing_cluster (line 309) | def get_existing_cluster(conn, opts, cluster_name): function get_internal_ips (line 340) | def get_internal_ips(conn, opts, cluster_name): function attach_ebs (line 347) | def attach_ebs(conn, opts, cluster_name): function detach_ebs (line 356) | def detach_ebs(conn, opts, cluster_name): function setup_cluster (line 369) | def setup_cluster(conn, master_nodes, slave_nodes, zoo_nodes, opts, clus... function wait_for_cluster (line 406) | def wait_for_cluster(conn, wait_secs, master_nodes, slave_nodes, zoo_nod... function get_num_disks (line 418) | def get_num_disks(instance_type): function deploy_files (line 447) | def deploy_files(conn, root_dir, opts, master_nodes, slave_nodes, zoo_no... function scp (line 505) | def scp(host, opts, local_file, dest_file): function ssh (line 512) | def ssh(host, opts, command): function main (line 518) | def main(): FILE: scripts/rpcexec.py function escape (line 13) | def escape(s): function get_ssh_cmd (line 25) | def get_ssh_cmd(gui, machines, port, machineid, prog, opts): function get_screen_cmd (line 58) | def get_screen_cmd(gui, machines, port, machineid, prog, opts): function shell_popen (line 84) | def shell_popen(cmd): function shell_wait_native (line 89) | def shell_wait_native(cmd): FILE: src/graphlab/aggregation/distributed_aggregator.hpp type graphlab (line 47) | namespace graphlab { class distributed_aggregator (line 80) | class distributed_aggregator { type imap_reduce_base (line 102) | struct imap_reduce_base { type default_map_types (line 149) | struct default_map_types{ type map_reduce_type (line 164) | struct map_reduce_type : public imap_reduce_base { method map_reduce_type (line 176) | map_reduce_type(VertexMapperType map_vtx_function, method map_reduce_type (line 185) | map_reduce_type(EdgeMapperType map_edge_function, method perform_map_vertex (line 192) | void perform_map_vertex(icontext_type& context, vertex_type& verte... method perform_map_edge (line 215) | void perform_map_edge(icontext_type& context, edge_type& edge) { method is_vertex_map (line 238) | bool is_vertex_map() const { method any (line 242) | any get_accumulator() const { method add_accumulator_any (line 246) | void add_accumulator_any(any& other) { method set_accumulator_any (line 252) | void set_accumulator_any(any& other) { method add_accumulator (line 259) | void add_accumulator(imap_reduce_base* other) { method clear_accumulator (line 265) | void clear_accumulator() { method finalize (line 269) | void finalize(icontext_type& context) { method imap_reduce_base (line 273) | imap_reduce_base* clone_empty() const { type async_aggregator_state (line 292) | struct async_aggregator_state { method test_vertex_mapper_type (line 315) | static void test_vertex_mapper_type(std::string key = "") { method test_edge_mapper_type (line 349) | static void test_edge_mapper_type(std::string key = "") { method distributed_aggregator (line 384) | distributed_aggregator(distributed_control& dc, method add_vertex_aggregator (line 396) | bool add_vertex_aggregator(const std::string& key, method add_vertex_aggregator (line 431) | bool add_vertex_aggregator(const std::string& key, method add_edge_aggregator (line 458) | bool add_edge_aggregator(const std::string& key, method add_edge_aggregator (line 493) | bool add_edge_aggregator(const std::string& key, method aggregate_now (line 518) | bool aggregate_now(const std::string& key) { method aggregate_periodic (line 595) | bool aggregate_periodic(const std::string& key, float seconds) { method aggregate_all_periodic (line 608) | void aggregate_all_periodic() { method start (line 627) | void start(size_t ncpus = 0) { method tick_asynchronous (line 675) | std::string tick_asynchronous() { method tick_asynchronous_compute (line 703) | void tick_asynchronous_compute(size_t cpuid, const std::string& key) { method rpc_key_merge (line 764) | void rpc_key_merge(const std::string& key, any& acc) { method decrement_distributed_counter (line 779) | void decrement_distributed_counter(const std::string& key) { method rpc_perform_finalize (line 812) | void rpc_perform_finalize(const std::string& key, any& acc_val) { method decrement_finalize_counter (line 827) | void decrement_finalize_counter(const std::string& key) { method rpc_schedule_key (line 853) | void rpc_schedule_key(const std::string& key, float next_time) { method tick_synchronous (line 867) | void tick_synchronous() { method stop (line 896) | void stop() { method get_all_periodic_keys (line 926) | std::set get_all_periodic_keys() const { method ResultType (line 941) | ResultType map_reduce_vertices(MapFunctionType mapfunction) { method ResultType (line 997) | ResultType map_reduce_edges(MapFunctionType mapfunction) { method transform_vertices (line 1052) | void transform_vertices(TransformType transform_functor) { method transform_edges (line 1070) | void transform_edges(TransformType transform_functor) { FILE: src/graphlab/engine/async_consistent_engine.hpp type graphlab (line 58) | namespace graphlab { class async_consistent_engine (line 205) | class async_consistent_engine: public iengine { type vertex_fiber_cm_handle (line 381) | struct vertex_fiber_cm_handle { method async_consistent_engine (line 438) | async_consistent_engine(distributed_control &dc, method set_options (line 471) | void set_options(const graphlab_options& opts) { method init (line 539) | void init() { method num_updates (line 572) | size_t num_updates() const { method elapsed_seconds (line 581) | float elapsed_seconds() const { method iteration (line 589) | int iteration() const { return -1; } method rpc_signal (line 602) | void rpc_signal(vertex_id_type vid, method internal_signal (line 619) | void internal_signal(const vertex_type& vtx, method internal_signal_gvid (line 662) | void internal_signal_gvid(vertex_id_type gvid, method rpc_internal_stop (line 675) | void rpc_internal_stop() { method internal_stop (line 686) | void internal_stop() { method internal_post_delta (line 702) | void internal_post_delta(const vertex_type& vertex, method internal_clear_gather_cache (line 727) | void internal_clear_gather_cache(const vertex_type& vertex) { method signal (line 742) | void signal(vertex_id_type gvid, method signal_all (line 750) | void signal_all(const message_type& message = message_type(), method signal_vset (line 756) | void signal_vset(const vertex_set& vset, method get_next_sched_task (line 790) | sched_status::status_enum get_next_sched_task( size_t threadid, method set_endgame_mode (line 804) | void set_endgame_mode() { method try_to_quit (line 816) | bool try_to_quit(size_t threadid, method lock_ready (line 866) | void lock_ready(lvid_type lvid) { method conditional_gather_type (line 874) | conditional_gather_type perform_gather(vertex_id_type vid, method perform_scatter_local (line 920) | void perform_scatter_local(lvid_type lvid, method perform_scatter (line 956) | void perform_scatter(vertex_id_type vid, method get_exclusive_access_to_vertex (line 971) | bool get_exclusive_access_to_vertex(const lvid_type lvid, method release_exclusive_access_to_vertex (line 990) | void release_exclusive_access_to_vertex(const lvid_type lvid) { method eval_sched_task (line 1010) | void eval_sched_task(const lvid_type lvid, method thread_start (line 1138) | void thread_start(size_t threadid) { method start (line 1210) | execution_status::status_enum start() { method aggregator_type (line 1289) | aggregator_type* get_aggregator() { return &aggregator; } FILE: src/graphlab/engine/distributed_chandy_misra.hpp type graphlab (line 33) | namespace graphlab { class distributed_chandy_misra (line 40) | class distributed_chandy_misra { method request_bit (line 67) | inline unsigned char request_bit(bool owner) { type philosopher (line 78) | struct philosopher { method request_for_fork (line 101) | inline void request_for_fork(size_t forkid, bool nextowner) { method fork_owner (line 105) | inline bool fork_owner(size_t forkid) { method fork_dirty (line 109) | inline bool fork_dirty(size_t forkid) { method dirty_fork (line 113) | inline void dirty_fork(size_t forkid) { method compute_initial_fork_arrangement (line 119) | void compute_initial_fork_arrangement() { method try_acquire_edge_with_backoff (line 149) | void try_acquire_edge_with_backoff(lvid_type v1, method advance_fork_state_on_lock (line 177) | inline bool advance_fork_state_on_lock(size_t forkid, method cancellation_request_unlocked (line 256) | void cancellation_request_unlocked(lvid_type lvid, procid_t requesto... method rpc_cancellation_request (line 300) | void rpc_cancellation_request(vertex_id_type gvid, procid_t requesto... method issue_cancellation_request_unlocked (line 305) | void issue_cancellation_request_unlocked(lvid_type lvid, bool lockid) { method rpc_cancellation_accept (line 335) | void rpc_cancellation_accept(vertex_id_type gvid, bool lockid) { method cancellation_accept_unlocked (line 340) | void cancellation_accept_unlocked(lvid_type p_id, bool lockid) { method rpc_make_philosopher_hungry (line 434) | void rpc_make_philosopher_hungry(vertex_id_type gvid, bool newlockid) { method local_philosopher_grabs_forks (line 451) | void local_philosopher_grabs_forks(lvid_type p_id) { method enter_hors_doeuvre_unlocked (line 515) | void enter_hors_doeuvre_unlocked(lvid_type p_id) { method signal_ready_unlocked (line 547) | void signal_ready_unlocked(lvid_type lvid, bool lockid) { method rpc_signal_ready (line 586) | void rpc_signal_ready(vertex_id_type gvid, bool lockid) { method set_eating (line 591) | void set_eating(lvid_type lvid, bool lockid) { method rpc_set_eating (line 611) | void rpc_set_eating(vertex_id_type gvid, bool lockid) { method advance_fork_state_on_unlock (line 627) | inline bool advance_fork_state_on_unlock(size_t forkid, method local_philosopher_stops_eating (line 667) | void local_philosopher_stops_eating(lvid_type p_id) { method rpc_philosopher_stops_eating (line 740) | void rpc_philosopher_stops_eating(vertex_id_type gvid) { method distributed_chandy_misra (line 746) | inline distributed_chandy_misra(distributed_control &dc, method num_clean_forks (line 762) | size_t num_clean_forks() const { method initialize_master_philosopher_as_hungry_locked (line 766) | void initialize_master_philosopher_as_hungry_locked(lvid_type p_id, method make_philosopher_hungry (line 773) | void make_philosopher_hungry(lvid_type p_id) { method make_philosopher_hungry_per_replica (line 796) | void make_philosopher_hungry_per_replica(lvid_type p_id) { method philosopher_stops_eating (line 819) | void philosopher_stops_eating(lvid_type p_id) { method philosopher_stops_eating_per_replica (line 836) | void philosopher_stops_eating_per_replica(lvid_type p_id) { method no_locks_consistency_check (line 846) | void no_locks_consistency_check() { method print_out (line 853) | void print_out() { method complete_consistency_check (line 896) | void complete_consistency_check() { FILE: src/graphlab/engine/execution_status.hpp type graphlab (line 27) | namespace graphlab { type execution_status (line 37) | struct execution_status { type status_enum (line 38) | enum status_enum { method to_string (line 53) | static std::string to_string(status_enum es) { FILE: src/graphlab/engine/iengine.hpp type graphlab (line 56) | namespace graphlab { class iengine (line 105) | class iengine { method iteration (line 227) | virtual int iteration() const { return -1; } method add_vertex_aggregator (line 484) | bool add_vertex_aggregator(const std::string& key, method add_vertex_aggregator (line 539) | bool add_vertex_aggregator(const std::string& key, method add_edge_aggregator (line 692) | bool add_edge_aggregator(const std::string& key, method add_edge_aggregator (line 748) | bool add_edge_aggregator(const std::string& key, method aggregate_now (line 780) | bool aggregate_now(const std::string& key) { method ReductionType (line 876) | ReductionType map_reduce_vertices(VertexMapperType mapfunction) { method ReductionType (line 974) | ReductionType map_reduce_edges(EdgeMapperType mapfunction) { method transform_vertices (line 1055) | void transform_vertices(VertexMapperType mapfunction) { method transform_edges (line 1132) | void transform_edges(EdgeMapperType mapfunction) { method aggregate_periodic (line 1169) | bool aggregate_periodic(const std::string& key, float seconds) { FILE: src/graphlab/engine/message_array.hpp type graphlab (line 32) | namespace graphlab { class message_array (line 39) | class message_array { type message_box (line 44) | struct message_box { method message_box (line 48) | message_box() : empty(true) { } method add (line 50) | inline bool add(const value_type& other, double& priority) { method clear (line 63) | void clear() { method get_lock_idx (line 79) | static size_t get_lock_idx(size_t i) { method message_array (line 84) | message_array(size_t num_vertices = 0) : method resize (line 95) | void resize(size_t num_vertices) { method add (line 101) | bool add(const size_t idx, method get (line 120) | bool get(const size_t idx, method peek (line 139) | bool peek(const size_t idx, method clear (line 154) | void clear(const size_t idx) { method empty (line 162) | bool empty(const size_t idx) const { method empty (line 166) | bool empty() const { method size (line 174) | size_t size() const { method num_joins (line 178) | size_t num_joins() const { method num_adds (line 187) | size_t num_adds() const { method clear (line 196) | void clear() { FILE: src/graphlab/engine/omni_engine.hpp type graphlab (line 35) | namespace graphlab { class omni_engine (line 80) | class omni_engine : public iengine { method omni_engine (line 151) | omni_engine() { } method omni_engine (line 156) | omni_engine(const omni_engine& other ) { } method omni_engine (line 177) | omni_engine(distributed_control& dc, graph_type& graph, method start (line 211) | execution_status::status_enum start( ) { return engine_ptr->start(); } method num_updates (line 213) | size_t num_updates() const { return engine_ptr->num_updates(); } method elapsed_seconds (line 214) | float elapsed_seconds() const { return engine_ptr->elapsed_seconds(); } method iteration (line 215) | int iteration() const { return engine_ptr->iteration(); } method signal (line 216) | void signal(vertex_id_type vertex, method signal_all (line 220) | void signal_all(const message_type& message = message_type(), method signal_vset (line 224) | void signal_vset(const vertex_set& vset, method aggregator_type (line 231) | aggregator_type* get_aggregator() { return engine_ptr->get_aggregato... FILE: src/graphlab/engine/synchronous_engine.hpp type graphlab (line 59) | namespace graphlab { class synchronous_engine (line 207) | class synchronous_engine : method thread_launch_wrapped_event_counter (line 771) | void thread_launch_wrapped_event_counter(boost::function... method run_synchronous (line 796) | void run_synchronous(MemberFunction member_fun) { function foreach (line 1020) | foreach(std::string opt, keys) { function foreach (line 1474) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 1519) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 1585) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 1686) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 1755) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 1802) | foreach(const procid_t& mirror, vertex.mirrors()) { function foreach (line 1817) | foreach(const vid_prog_pair_type& pair, buffer) { function foreach (line 1834) | foreach(const procid_t& mirror, vertex.mirrors()) { function foreach (line 1850) | foreach(const vid_vdata_pair_type& pair, buffer) { function foreach (line 1886) | foreach(const vid_gather_pair_type& pair, buffer) { function foreach (line 1923) | foreach(const vid_message_pair_type& pair, buffer) { FILE: src/graphlab/engine/warp_engine.hpp type graphlab (line 55) | namespace graphlab { type warp (line 57) | namespace warp { class warp_engine (line 176) | class warp_engine { type context (line 234) | struct context { method context (line 247) | context(warp_engine& engine, graph_type& graph, method context (line 257) | context(warp_engine& engine, graph_type& graph): method num_vertices (line 269) | size_t num_vertices() const { return graph.num_vertices(); } method num_edges (line 278) | size_t num_edges() const { return graph.num_edges(); } method procid (line 290) | size_t procid() const { return graph.procid(); } method num_procs (line 303) | size_t num_procs() const { return graph.numprocs(); } method elapsed_seconds (line 347) | float elapsed_seconds() const { return engine.elapsed_seconds(); } method iteration (line 355) | int iteration() const { return -1; } method stop (line 367) | void stop() { engine.internal_stop(); } method signal (line 387) | void signal(const vertex_type& vertex, method signal (line 412) | void signal(vertex_id_type gvid, method set_synchronized (line 422) | void set_synchronized() { method synchronize (line 436) | void synchronize() { type vertex_fiber_cm_handle (line 521) | struct vertex_fiber_cm_handle { method warp_engine (line 580) | warp_engine(distributed_control &dc, method get_rpc_obj_id (line 602) | size_t get_rpc_obj_id() { method set_options (line 617) | void set_options(const graphlab_options& opts) { method initialize (line 677) | void initialize() { method set_update_function (line 709) | void set_update_function(update_function_type update_function) { method num_updates (line 720) | size_t num_updates() const { method elapsed_seconds (line 734) | float elapsed_seconds() const { method iteration (line 742) | int iteration() const { return -1; } method rpc_signal (line 755) | void rpc_signal(vertex_id_type vid, method internal_signal (line 772) | void internal_signal(const vertex_type& vtx, method internal_signal_gvid (line 815) | void internal_signal_gvid(vertex_id_type gvid, method rpc_internal_stop (line 829) | void rpc_internal_stop() { method internal_stop (line 840) | void internal_stop() { method signal (line 894) | void signal(vertex_id_type gvid, method signal_all (line 936) | void signal_all(const message_type& message = message_type(), method signal_vset (line 967) | void signal_vset(const vertex_set& vset, method get_next_sched_task (line 1001) | sched_status::status_enum get_next_sched_task(size_t threadid, method set_endgame_mode (line 1015) | void set_endgame_mode() { method try_to_quit (line 1027) | bool try_to_quit(size_t threadid, method lock_ready (line 1077) | void lock_ready(lvid_type lvid) { method get_exclusive_access_to_vertex (line 1088) | bool get_exclusive_access_to_vertex(const lvid_type lvid, method release_exclusive_access_to_vertex (line 1107) | void release_exclusive_access_to_vertex(const lvid_type lvid) { method update_vertex_value (line 1120) | void update_vertex_value(vertex_id_type vid, method synchronize_one_vertex (line 1126) | void synchronize_one_vertex(vertex_type vtx) { method synchronize_one_vertex_wait (line 1134) | void synchronize_one_vertex_wait(vertex_type vtx) { method eval_sched_task (line 1155) | void eval_sched_task(const lvid_type lvid, method thread_start (line 1212) | void thread_start(size_t threadid) { method start (line 1281) | execution_status::status_enum start() { method aggregator_type (line 1354) | aggregator_type* get_aggregator() { return &aggregator; } FILE: src/graphlab/engine/warp_graph_broadcast.hpp type graphlab (line 35) | namespace graphlab { type warp (line 37) | namespace warp { type warp_impl (line 39) | namespace warp_impl { type broadcast_neighborhood_impl (line 42) | struct broadcast_neighborhood_impl { method basic_local_broadcast_neighborhood (line 63) | static void basic_local_broadcast_neighborhood(context_type& con... method basic_local_broadcast_neighborhood_from_remote (line 101) | static void basic_local_broadcast_neighborhood_from_remote(std::... method basic_broadcast_neighborhood (line 121) | static void basic_broadcast_neighborhood(context_type& context, type broadcast_neighborhood_impl2 (line 163) | struct broadcast_neighborhood_impl2 { method extended_local_broadcast_neighborhood (line 186) | static void extended_local_broadcast_neighborhood(context_type& ... method extended_local_broadcast_neighborhood_from_remote (line 226) | static void extended_local_broadcast_neighborhood_from_remote(st... method extended_broadcast_neighborhood (line 249) | static void extended_broadcast_neighborhood(context_type& context, function broadcast_neighborhood (line 360) | void broadcast_neighborhood(ContextType& context, function broadcast_neighborhood (line 444) | void broadcast_neighborhood(ContextType& context, FILE: src/graphlab/engine/warp_graph_mapreduce.hpp type graphlab (line 35) | namespace graphlab { type warp (line 37) | namespace warp { type warp_impl (line 39) | namespace warp_impl { function default_combiner (line 46) | void default_combiner(T& self, const T& other) { function extended_default_combiner (line 56) | void extended_default_combiner(T& self, const T& other, const Extr... type map_reduce_neighborhood_impl (line 62) | struct map_reduce_neighborhood_impl { method basic_local_mapper (line 81) | static conditional_combiner_wrapper basic_local_mapper(... method basic_local_mapper_from_remote (line 119) | static conditional_combiner_wrapper basic_local_mapper_... method RetType (line 137) | static RetType basic_map_reduce_neighborhood(typename GraphType:... type map_reduce_neighborhood_impl2 (line 196) | struct map_reduce_neighborhood_impl2 { method extended_local_mapper (line 204) | static conditional_combiner_wrapper extended_local_mapp... method extended_local_mapper_from_remote (line 245) | static conditional_combiner_wrapper extended_local_mapp... method RetType (line 265) | static RetType extended_map_reduce_neighborhood(typename GraphTy... function RetType (line 392) | RetType map_reduce_neighborhood(VertexType current, function RetType (line 485) | RetType map_reduce_neighborhood(VertexType current, FILE: src/graphlab/engine/warp_graph_transform.hpp type graphlab (line 35) | namespace graphlab { type warp (line 37) | namespace warp { type warp_impl (line 39) | namespace warp_impl { type transform_neighborhood_impl (line 42) | struct transform_neighborhood_impl { method basic_local_transform_neighborhood (line 61) | static void basic_local_transform_neighborhood(GraphType& graph, method basic_local_transform_neighborhood_from_remote (line 97) | static void basic_local_transform_neighborhood_from_remote(size_... method basic_transform_neighborhood (line 111) | static void basic_transform_neighborhood(typename GraphType::ver... type transform_neighborhood_impl2 (line 151) | struct transform_neighborhood_impl2 { method extended_local_transform_neighborhood (line 172) | static void extended_local_transform_neighborhood(GraphType& graph, method extended_local_transform_neighborhood_from_remote (line 210) | static void extended_local_transform_neighborhood_from_remote(si... method extended_transform_neighborhood (line 226) | static void extended_transform_neighborhood(typename GraphType::... function transform_neighborhood (line 331) | void transform_neighborhood(VertexType current, function transform_neighborhood (line 409) | void transform_neighborhood(VertexType current, FILE: src/graphlab/engine/warp_parfor_all_vertices.hpp type graphlab (line 31) | namespace graphlab { type warp (line 32) | namespace warp { type warp_impl (line 34) | namespace warp_impl { type parfor_all_vertices_impl (line 43) | struct parfor_all_vertices_impl{ method parfor_all_vertices_impl (line 50) | parfor_all_vertices_impl(GraphType& graph, method run_fiber (line 54) | void run_fiber() { function parfor_all_vertices (line 106) | void parfor_all_vertices(GraphType& graph, FILE: src/graphlab/graph/builtin_parsers.hpp type graphlab (line 46) | namespace graphlab { type builtin_parsers (line 48) | namespace builtin_parsers { function snap_parser (line 63) | bool snap_parser(Graph& graph, const std::string& srcfilename, function tsv_parser (line 86) | bool tsv_parser(Graph& graph, const std::string& srcfilename, function csv_parser (line 100) | bool csv_parser(Graph& graph, function adj_parser (line 120) | bool adj_parser(Graph& graph, const std::string& srcfilename, function adj_parser (line 147) | bool adj_parser(Graph& graph, const std::string& srcfilename, type tsv_writer (line 183) | struct tsv_writer{ method save_vertex (line 186) | std::string save_vertex(vertex_type) { return ""; } method save_edge (line 187) | std::string save_edge(edge_type e) { type graphjrl_writer (line 196) | struct graphjrl_writer{ method escape_newline (line 205) | static std::string escape_newline(charstream& strm) { method unescape_newline (line 241) | static std::string unescape_newline(const std::string& str) { method save_vertex (line 268) | std::string save_vertex(vertex_type v) { method save_edge (line 276) | std::string save_edge(edge_type e) { function graphjrl_parser (line 288) | bool graphjrl_parser(Graph& graph, const std::string& srcfilename, FILE: src/graphlab/graph/distributed_graph.hpp type tests (line 98) | namespace tests { class distributed_graph_test (line 99) | class distributed_graph_test type graphlab (line 101) | namespace graphlab { class distributed_graph (line 312) | class distributed_graph { type vertex_type (line 418) | struct vertex_type method vertex_type (line 448) | vertex_type(distributed_graph& graph_ref, lvid_type lvid): method vertex_data_type (line 459) | const vertex_data_type& data() const { method vertex_data_type (line 464) | vertex_data_type& data() { method num_in_edges (line 469) | size_t num_in_edges() const { method num_out_edges (line 474) | size_t num_out_edges() const { method vertex_id_type (line 479) | vertex_id_type id() const { method edge_list_type (line 486) | edge_list_type in_edges() __attribute__ ((noreturn)) { method edge_list_type (line 491) | edge_list_type out_edges() __attribute__ ((noreturn)) { method lvid_type (line 499) | lvid_type local_id() const { class edge_type (line 420) | class edge_type method edge_type (line 532) | edge_type(distributed_graph& graph_ref, method vertex_type (line 556) | vertex_type source() const { method vertex_type (line 572) | vertex_type target() const { method edge_data_type (line 579) | const edge_data_type& data() const { return edge.data(); } method edge_data_type (line 584) | edge_data_type& data() { return edge.data(); } type local_vertex_type (line 422) | struct local_vertex_type method local_vertex_type (line 2904) | local_vertex_type(distributed_graph& graph_ref, lvid_type lvid): method local_vertex_type (line 2908) | explicit local_vertex_type(vertex_type v) :graph_ref(v.graph_ref),... method vertex_data_type (line 2919) | const vertex_data_type& data() const { method vertex_data_type (line 2924) | vertex_data_type& data() { method num_in_edges (line 2931) | size_t num_in_edges() const { method num_out_edges (line 2938) | size_t num_out_edges() const { method lvid_type (line 2943) | lvid_type id() const { method vertex_id_type (line 2948) | vertex_id_type global_id() const { method local_edge_list_type (line 2955) | local_edge_list_type in_edges() { method local_edge_list_type (line 2962) | local_edge_list_type out_edges() { method procid_t (line 2968) | procid_t owner() const { method owned (line 2974) | bool owned() const { method global_num_in_edges (line 2981) | size_t global_num_in_edges() const { method global_num_out_edges (line 2989) | size_t global_num_out_edges() const { method mirror_type (line 2996) | const mirror_type& mirrors() const { method num_mirrors (line 3000) | size_t num_mirrors() const { method vertex_record (line 3007) | vertex_record& get_vertex_record() { type local_edge_list_type (line 423) | struct local_edge_list_type method local_edge_list_type (line 3077) | local_edge_list_type(distributed_graph& graph_ref, method size (line 3081) | size_t size() const { return elist.size(); } method local_edge_type (line 3084) | local_edge_type operator[](size_t i) const { return me_functor(eli... method iterator (line 3100) | iterator begin() const { return method iterator (line 3117) | iterator end() const { return method empty (line 3121) | bool empty() const { return elist.empty(); } class local_edge_type (line 424) | class local_edge_type method local_edge_type (line 3020) | local_edge_type(distributed_graph& graph_ref, method local_edge_type (line 3025) | explicit local_edge_type(edge_type ge) :graph_ref(ge.graph_ref),e(... method local_vertex_type (line 3033) | local_vertex_type source() const { return local_vertex_type(graph_... method local_vertex_type (line 3036) | local_vertex_type target() const { return local_vertex_type(graph_... method edge_data_type (line 3041) | const edge_data_type& data() const { return e.data(); } method edge_data_type (line 3044) | edge_data_type& data() { return e.data(); } method edge_id_type (line 3047) | edge_id_type id() const { return e.id(); } type vertex_type (line 435) | struct vertex_type { method vertex_type (line 448) | vertex_type(distributed_graph& graph_ref, lvid_type lvid): method vertex_data_type (line 459) | const vertex_data_type& data() const { method vertex_data_type (line 464) | vertex_data_type& data() { method num_in_edges (line 469) | size_t num_in_edges() const { method num_out_edges (line 474) | size_t num_out_edges() const { method vertex_id_type (line 479) | vertex_id_type id() const { method edge_list_type (line 486) | edge_list_type in_edges() __attribute__ ((noreturn)) { method edge_list_type (line 491) | edge_list_type out_edges() __attribute__ ((noreturn)) { method lvid_type (line 499) | lvid_type local_id() const { class edge_type (line 516) | class edge_type { method edge_type (line 532) | edge_type(distributed_graph& graph_ref, method vertex_type (line 556) | vertex_type source() const { method vertex_type (line 572) | vertex_type target() const { method edge_data_type (line 579) | const edge_data_type& data() const { return edge.data(); } method edge_data_type (line 584) | edge_data_type& data() { return edge.data(); } method distributed_graph (line 621) | distributed_graph(distributed_control& dc, method lock_manager_type (line 641) | lock_manager_type& get_lock_manager() { method set_options (line 645) | void set_options(const graphlab_options& opts) { method is_dynamic (line 693) | bool is_dynamic() const { method finalize (line 706) | void finalize() { method is_finalized (line 720) | bool is_finalized() { method num_vertices (line 725) | size_t num_vertices() const { return nverts; } method num_edges (line 728) | size_t num_edges() const { return nedges; } method vertex_type (line 738) | vertex_type vertex(vertex_id_type vid) { method vertex_type (line 448) | vertex_type(distributed_graph& graph_ref, lvid_type lvid): method vertex_data_type (line 459) | const vertex_data_type& data() const { method vertex_data_type (line 464) | vertex_data_type& data() { method num_in_edges (line 469) | size_t num_in_edges() const { method num_out_edges (line 474) | size_t num_out_edges() const { method vertex_id_type (line 479) | vertex_id_type id() const { method edge_list_type (line 486) | edge_list_type in_edges() __attribute__ ((noreturn)) { method edge_list_type (line 491) | edge_list_type out_edges() __attribute__ ((noreturn)) { method lvid_type (line 499) | lvid_type local_id() const { method edge_list_type (line 744) | edge_list_type in_edges(const vertex_id_type vid) const method edge_list_type (line 752) | edge_list_type out_edges(const vertex_id_type vid) const method num_in_edges (line 771) | size_t num_in_edges(const vertex_id_type vid) const { method num_out_edges (line 785) | size_t num_out_edges(const vertex_id_type vid) const { method set_duplicate_vertex_strategy (line 795) | void set_duplicate_vertex_strategy(boost::function& accfuncti... method parallel_for_edges (line 1632) | void parallel_for_edges(std::vector& accfunction) { method load (line 1653) | void load(iarchive& arc) { method save (line 1669) | void save(oarchive& arc) const { method clear (line 1688) | void clear () { method load_binary (line 1720) | bool load_binary(const std::string& prefix) { method save_binary (line 1785) | bool save_binary(const std::string& prefix) { method save_to_posixfs (line 1836) | void save_to_posixfs(const std::string& prefix, Writer writer, method save_to_hdfs (line 1913) | void save_to_hdfs(const std::string& prefix, Writer writer, method save (line 2091) | void save(const std::string& prefix, Writer writer, method save_format (line 2142) | void save_format(const std::string& prefix, const std::string& format, method load_from_posixfs (line 2170) | void load_from_posixfs(std::string prefix, method load_from_hdfs (line 2228) | void load_from_hdfs(std::string prefix, line_parser_type line_parser) { method load (line 2342) | void load(std::string prefix, line_parser_type line_parser) { method load_synthetic_powerlaw (line 2380) | void load_synthetic_powerlaw(size_t nverts, bool in_degree = false, method load_format (line 2421) | void load_format(const std::string& path, const std::string& format) { method vertex_set (line 2459) | static vertex_set empty_set() { method vertex_set (line 2466) | static vertex_set complete_set() { method vertex_set (line 2471) | vertex_set neighbors(const vertex_set& cur, method vertex_set (line 2533) | vertex_set select(FunctionType select_functor, method sync_vertex_set_master_to_mirrors (line 2552) | void sync_vertex_set_master_to_mirrors(vertex_set& vset) { method vertex_set_size (line 2568) | size_t vertex_set_size(const vertex_set& vset) { method vertex_set_empty (line 2585) | bool vertex_set_empty(const vertex_set& vset) { type vertex_record (line 2606) | struct vertex_record { method vertex_record (line 2616) | vertex_record() : method vertex_record (line 2618) | vertex_record(const vertex_id_type& vid) : method procid_t (line 2620) | procid_t get_owner () const { return owner; } method mirror_type (line 2621) | const mirror_type& mirrors() const { return _mirrors; } method num_mirrors (line 2622) | size_t num_mirrors() const { return _mirrors.popcount(); } method clear (line 2624) | void clear() { method load (line 2628) | void load(iarchive& arc) { method save (line 2637) | void save(oarchive& arc) const { method local_vertex_type (line 2662) | local_vertex_type l_vertex(lvid_type vid) { method local_vertex_type (line 2904) | local_vertex_type(distributed_graph& graph_ref, lvid_type lvid): method local_vertex_type (line 2908) | explicit local_vertex_type(vertex_type v) :graph_ref(v.graph_ref),... method vertex_data_type (line 2919) | const vertex_data_type& data() const { method vertex_data_type (line 2924) | vertex_data_type& data() { method num_in_edges (line 2931) | size_t num_in_edges() const { method num_out_edges (line 2938) | size_t num_out_edges() const { method lvid_type (line 2943) | lvid_type id() const { method vertex_id_type (line 2948) | vertex_id_type global_id() const { method local_edge_list_type (line 2955) | local_edge_list_type in_edges() { method local_edge_list_type (line 2962) | local_edge_list_type out_edges() { method procid_t (line 2968) | procid_t owner() const { method owned (line 2974) | bool owned() const { method global_num_in_edges (line 2981) | size_t global_num_in_edges() const { method global_num_out_edges (line 2989) | size_t global_num_out_edges() const { method mirror_type (line 2996) | const mirror_type& mirrors() const { method num_mirrors (line 3000) | size_t num_mirrors() const { method vertex_record (line 3007) | vertex_record& get_vertex_record() { method num_replicas (line 2668) | size_t num_replicas() const { return nreplicas; } method num_local_vertices (line 2672) | size_t num_local_vertices() const { return local_graph.num_vertices(... method num_local_edges (line 2676) | size_t num_local_edges() const { return local_graph.num_edges(); } method num_local_own_vertices (line 2680) | size_t num_local_own_vertices() const { return local_own_nverts; } method lvid_type (line 2684) | lvid_type local_vid (const vertex_id_type vid) const { method vertex_id_type (line 2693) | vertex_id_type global_vid(const lvid_type lvid) const { method contains_vertex (line 2703) | bool contains_vertex(const vertex_id_type vid) const { method local_edge_list_type (line 2713) | local_edge_list_type l_in_edges(const lvid_type lvid) { method local_edge_list_type (line 3077) | local_edge_list_type(distributed_graph& graph_ref, method size (line 3081) | size_t size() const { return elist.size(); } method local_edge_type (line 3084) | local_edge_type operator[](size_t i) const { return me_functor(eli... method iterator (line 3100) | iterator begin() const { return method iterator (line 3117) | iterator end() const { return method empty (line 3121) | bool empty() const { return elist.empty(); } method l_num_in_edges (line 2724) | size_t l_num_in_edges(const lvid_type lvid) const { method local_edge_list_type (line 2735) | local_edge_list_type l_out_edges(const lvid_type lvid) { method local_edge_list_type (line 3077) | local_edge_list_type(distributed_graph& graph_ref, method size (line 3081) | size_t size() const { return elist.size(); } method local_edge_type (line 3084) | local_edge_type operator[](size_t i) const { return me_functor(eli... method iterator (line 3100) | iterator begin() const { return method iterator (line 3117) | iterator end() const { return method empty (line 3121) | bool empty() const { return elist.empty(); } method l_num_out_edges (line 2746) | size_t l_num_out_edges(const lvid_type lvid) const { method procid_t (line 2750) | procid_t procid() const { method procid_t (line 2755) | procid_t numprocs() const { method distributed_control (line 2759) | distributed_control& dc() { method vertex_record (line 2768) | const vertex_record& get_vertex_record(vertex_id_type vid) const { method vertex_record (line 2616) | vertex_record() : method vertex_record (line 2618) | vertex_record(const vertex_id_type& vid) : method procid_t (line 2620) | procid_t get_owner () const { return owner; } method mirror_type (line 2621) | const mirror_type& mirrors() const { return _mirrors; } method num_mirrors (line 2622) | size_t num_mirrors() const { return _mirrors.popcount(); } method clear (line 2624) | void clear() { method load (line 2628) | void load(iarchive& arc) { method save (line 2637) | void save(oarchive& arc) const { method vertex_record (line 2779) | vertex_record& l_get_vertex_record(lvid_type lvid) { method vertex_record (line 2616) | vertex_record() : method vertex_record (line 2618) | vertex_record(const vertex_id_type& vid) : method procid_t (line 2620) | procid_t get_owner () const { return owner; } method mirror_type (line 2621) | const mirror_type& mirrors() const { return _mirrors; } method num_mirrors (line 2622) | size_t num_mirrors() const { return _mirrors.popcount(); } method clear (line 2624) | void clear() { method load (line 2628) | void load(iarchive& arc) { method save (line 2637) | void save(oarchive& arc) const { method vertex_record (line 2787) | const vertex_record& l_get_vertex_record(lvid_type lvid) const { method vertex_record (line 2616) | vertex_record() : method vertex_record (line 2618) | vertex_record(const vertex_id_type& vid) : method procid_t (line 2620) | procid_t get_owner () const { return owner; } method mirror_type (line 2621) | const mirror_type& mirrors() const { return _mirrors; } method num_mirrors (line 2622) | size_t num_mirrors() const { return _mirrors.popcount(); } method clear (line 2624) | void clear() { method load (line 2628) | void load(iarchive& arc) { method save (line 2637) | void save(oarchive& arc) const { method is_master (line 2796) | bool is_master(vertex_id_type vid) const { method procid_t (line 2802) | procid_t master(vertex_id_type vid) const { method l_is_master (line 2811) | bool l_is_master(lvid_type lvid) const { method procid_t (line 2819) | procid_t l_master(lvid_type lvid) const { method local_graph_type (line 2828) | local_graph_type& get_local_graph() { method local_graph_type (line 2835) | const local_graph_type& get_local_graph() const { method synchronize (line 2846) | void synchronize(const vertex_set& vset = complete_set()) { type local_vertex_type (line 2900) | struct local_vertex_type { method local_vertex_type (line 2904) | local_vertex_type(distributed_graph& graph_ref, lvid_type lvid): method local_vertex_type (line 2908) | explicit local_vertex_type(vertex_type v) :graph_ref(v.graph_ref),... method vertex_data_type (line 2919) | const vertex_data_type& data() const { method vertex_data_type (line 2924) | vertex_data_type& data() { method num_in_edges (line 2931) | size_t num_in_edges() const { method num_out_edges (line 2938) | size_t num_out_edges() const { method lvid_type (line 2943) | lvid_type id() const { method vertex_id_type (line 2948) | vertex_id_type global_id() const { method local_edge_list_type (line 2955) | local_edge_list_type in_edges() { method local_edge_list_type (line 2962) | local_edge_list_type out_edges() { method procid_t (line 2968) | procid_t owner() const { method owned (line 2974) | bool owned() const { method global_num_in_edges (line 2981) | size_t global_num_in_edges() const { method global_num_out_edges (line 2989) | size_t global_num_out_edges() const { method mirror_type (line 2996) | const mirror_type& mirrors() const { method num_mirrors (line 3000) | size_t num_mirrors() const { method vertex_record (line 3007) | vertex_record& get_vertex_record() { class local_edge_type (line 3015) | class local_edge_type { method local_edge_type (line 3020) | local_edge_type(distributed_graph& graph_ref, method local_edge_type (line 3025) | explicit local_edge_type(edge_type ge) :graph_ref(ge.graph_ref),e(... method local_vertex_type (line 3033) | local_vertex_type source() const { return local_vertex_type(graph_... method local_vertex_type (line 3036) | local_vertex_type target() const { return local_vertex_type(graph_... method edge_data_type (line 3041) | const edge_data_type& data() const { return e.data(); } method edge_data_type (line 3044) | edge_data_type& data() { return e.data(); } method edge_id_type (line 3047) | edge_id_type id() const { return e.id(); } type make_local_edge_type_functor (line 3054) | struct make_local_edge_type_functor { method make_local_edge_type_functor (line 3058) | make_local_edge_type_functor(distributed_graph& graph_ref): method result_type (line 3060) | result_type operator() (const argument_type et) const { type local_edge_list_type (line 3069) | struct local_edge_list_type { method local_edge_list_type (line 3077) | local_edge_list_type(distributed_graph& graph_ref, method size (line 3081) | size_t size() const { return elist.size(); } method local_edge_type (line 3084) | local_edge_type operator[](size_t i) const { return me_functor(eli... method iterator (line 3100) | iterator begin() const { return method iterator (line 3117) | iterator end() const { return method empty (line 3121) | bool empty() const { return elist.empty(); } method get_rpc_obj_id (line 3134) | size_t get_rpc_obj_id() { method set_ingress_method (line 3179) | void set_ingress_method(const std::string& method, method load_from_stream (line 3231) | bool load_from_stream(std::string filename, Fstream& fin, method save_vertex_to_stream (line 3259) | void save_vertex_to_stream(vertex_type& vertex, Fstream& fout, Write... method save_edge_to_stream (line 3265) | void save_edge_to_stream(edge_type& edge, Fstream& fout, Writer writ... method save_bintsv4_to_stream (line 3271) | void save_bintsv4_to_stream(std::ostream& out) { method load_bintsv4_from_stream (line 3291) | bool load_bintsv4_from_stream(std::istream& in) { method save_direct (line 3318) | void save_direct(const std::string& prefix, bool gzip, method load_direct_from_posixfs (line 3370) | void load_direct_from_posixfs(std::string prefix, method load_direct_from_hdfs (line 3423) | void load_direct_from_hdfs(std::string prefix, method load_direct (line 3464) | void load_direct(std::string prefix, FILE: src/graphlab/graph/dynamic_local_graph.hpp type graphlab (line 67) | namespace graphlab { class dynamic_local_graph (line 69) | class dynamic_local_graph { class edge_iterator (line 82) | class edge_iterator class vertex_type (line 90) | class vertex_type class edge_type (line 95) | class edge_type method dynamic_local_graph (line 101) | dynamic_local_graph() { } method dynamic_local_graph (line 104) | dynamic_local_graph(size_t nverts) : method is_dynamic (line 109) | static bool is_dynamic() { method clear (line 116) | void clear() { method num_vertices (line 127) | size_t num_vertices() const { method num_edges (line 132) | size_t num_edges() const { method add_vertex (line 142) | void add_vertex(lvid_type vid, const VertexData& vdata = VertexData(... method reserve (line 155) | void reserve(size_t num_vertices) { method resize (line 164) | void resize(size_t num_vertices ) { method reserve_edge_space (line 169) | void reserve_edge_space(size_t n) { method edge_id_type (line 176) | edge_id_type add_edge(lvid_type source, lvid_type target, method add_edges (line 198) | void add_edges(const std::vector& src_arr, method vertex_type (line 230) | vertex_type vertex(lvid_type vid) { method vertex_type (line 236) | const vertex_type vertex(lvid_type vid) const { method VertexData (line 242) | VertexData& vertex_data(lvid_type v) { method VertexData (line 248) | const VertexData& vertex_data(lvid_type v) const { method finalize (line 261) | void finalize() { method load (line 350) | void load(iarchive& arc) { method save (line 360) | void save(oarchive& arc) const { method swap (line 369) | void swap(dynamic_local_graph& other) { method load (line 378) | void load(const std::string& filename) { method save (line 388) | void save(const std::string& filename) const { method save_adjacency (line 403) | void save_adjacency(const std::string& filename) const { method num_in_edges (line 428) | size_t num_in_edges(const lvid_type v) const { method num_out_edges (line 435) | size_t num_out_edges(const lvid_type v) const { method edge_list_type (line 442) | edge_list_type in_edges(lvid_type v) { method edge_list_type (line 453) | edge_list_type out_edges(lvid_type v) { method EdgeData (line 465) | EdgeData& edge_data(edge_id_type eid) { method EdgeData (line 473) | const EdgeData& edge_data(edge_id_type eid) const { method estimate_sizeof (line 481) | size_t estimate_sizeof() const { method lvid_type (line 494) | const lvid_type maxlvid() const { class dynamic_local_graph::vertex_type (line 557) | class dynamic_local_graph::vertex_type { method vertex_type (line 559) | vertex_type(dynamic_local_graph& lgraph_ref, lvid_type vid):lgraph_r... method vertex_data_type (line 562) | const vertex_data_type& data() const { method vertex_data_type (line 566) | vertex_data_type& data() { method num_in_edges (line 570) | size_t num_in_edges() const { method num_out_edges (line 574) | size_t num_out_edges() const { method lvid_type (line 578) | lvid_type id() const { method edge_list_type (line 582) | edge_list_type in_edges() { method edge_list_type (line 586) | edge_list_type out_edges() { class dynamic_local_graph::edge_type (line 595) | class dynamic_local_graph::edge_type { method edge_type (line 597) | edge_type(dynamic_local_graph& lgraph_ref, lvid_type _source, lvid_t... method edge_data_type (line 601) | const edge_data_type& data() const { method edge_data_type (line 605) | edge_data_type& data() { method vertex_type (line 609) | vertex_type source() const { method vertex_type (line 613) | vertex_type target() const { method edge_id_type (line 617) | edge_id_type id() const { return _eid; } class dynamic_local_graph::edge_iterator (line 627) | class dynamic_local_graph::edge_iterator : type list_type (line 633) | enum list_type {CSR, CSC} method edge_iterator (line 635) | edge_iterator(dynamic_local_graph& lgraph_ref, list_type _type, method increment (line 642) | void increment() { method equal (line 645) | bool equal(const edge_iterator& other) const method edge_type (line 650) | edge_type dereference() const { method advance (line 653) | void advance(int n) { method distance_to (line 656) | ptrdiff_t distance_to(const edge_iterator& other) const { method edge_type (line 660) | edge_type make_value() const { type graphlab (line 555) | namespace graphlab { class dynamic_local_graph (line 69) | class dynamic_local_graph { class edge_iterator (line 82) | class edge_iterator class vertex_type (line 90) | class vertex_type class edge_type (line 95) | class edge_type method dynamic_local_graph (line 101) | dynamic_local_graph() { } method dynamic_local_graph (line 104) | dynamic_local_graph(size_t nverts) : method is_dynamic (line 109) | static bool is_dynamic() { method clear (line 116) | void clear() { method num_vertices (line 127) | size_t num_vertices() const { method num_edges (line 132) | size_t num_edges() const { method add_vertex (line 142) | void add_vertex(lvid_type vid, const VertexData& vdata = VertexData(... method reserve (line 155) | void reserve(size_t num_vertices) { method resize (line 164) | void resize(size_t num_vertices ) { method reserve_edge_space (line 169) | void reserve_edge_space(size_t n) { method edge_id_type (line 176) | edge_id_type add_edge(lvid_type source, lvid_type target, method add_edges (line 198) | void add_edges(const std::vector& src_arr, method vertex_type (line 230) | vertex_type vertex(lvid_type vid) { method vertex_type (line 236) | const vertex_type vertex(lvid_type vid) const { method VertexData (line 242) | VertexData& vertex_data(lvid_type v) { method VertexData (line 248) | const VertexData& vertex_data(lvid_type v) const { method finalize (line 261) | void finalize() { method load (line 350) | void load(iarchive& arc) { method save (line 360) | void save(oarchive& arc) const { method swap (line 369) | void swap(dynamic_local_graph& other) { method load (line 378) | void load(const std::string& filename) { method save (line 388) | void save(const std::string& filename) const { method save_adjacency (line 403) | void save_adjacency(const std::string& filename) const { method num_in_edges (line 428) | size_t num_in_edges(const lvid_type v) const { method num_out_edges (line 435) | size_t num_out_edges(const lvid_type v) const { method edge_list_type (line 442) | edge_list_type in_edges(lvid_type v) { method edge_list_type (line 453) | edge_list_type out_edges(lvid_type v) { method EdgeData (line 465) | EdgeData& edge_data(edge_id_type eid) { method EdgeData (line 473) | const EdgeData& edge_data(edge_id_type eid) const { method estimate_sizeof (line 481) | size_t estimate_sizeof() const { method lvid_type (line 494) | const lvid_type maxlvid() const { class dynamic_local_graph::vertex_type (line 557) | class dynamic_local_graph::vertex_type { method vertex_type (line 559) | vertex_type(dynamic_local_graph& lgraph_ref, lvid_type vid):lgraph_r... method vertex_data_type (line 562) | const vertex_data_type& data() const { method vertex_data_type (line 566) | vertex_data_type& data() { method num_in_edges (line 570) | size_t num_in_edges() const { method num_out_edges (line 574) | size_t num_out_edges() const { method lvid_type (line 578) | lvid_type id() const { method edge_list_type (line 582) | edge_list_type in_edges() { method edge_list_type (line 586) | edge_list_type out_edges() { class dynamic_local_graph::edge_type (line 595) | class dynamic_local_graph::edge_type { method edge_type (line 597) | edge_type(dynamic_local_graph& lgraph_ref, lvid_type _source, lvid_t... method edge_data_type (line 601) | const edge_data_type& data() const { method edge_data_type (line 605) | edge_data_type& data() { method vertex_type (line 609) | vertex_type source() const { method vertex_type (line 613) | vertex_type target() const { method edge_id_type (line 617) | edge_id_type id() const { return _eid; } class dynamic_local_graph::edge_iterator (line 627) | class dynamic_local_graph::edge_iterator : type list_type (line 633) | enum list_type {CSR, CSC} method edge_iterator (line 635) | edge_iterator(dynamic_local_graph& lgraph_ref, list_type _type, method increment (line 642) | void increment() { method equal (line 645) | bool equal(const edge_iterator& other) const method edge_type (line 650) | edge_type dereference() const { method advance (line 653) | void advance(int n) { method distance_to (line 656) | ptrdiff_t distance_to(const edge_iterator& other) const { method edge_type (line 660) | edge_type make_value() const { type std (line 681) | namespace std { function swap (line 686) | inline void swap(graphlab::dynamic_local_graph& a, FILE: src/graphlab/graph/graph_basic_types.hpp type graphlab (line 29) | namespace graphlab { type edge_dir_type (line 54) | enum edge_dir_type { FILE: src/graphlab/graph/graph_gather_apply.hpp type graphlab (line 38) | namespace graphlab { class graph_gather_apply (line 40) | class graph_gather_apply { method run_synchronous (line 230) | void run_synchronous(MemberFunction member_fun, const vertex_set& vs... function foreach (line 407) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 458) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 501) | foreach(size_t lvid_block_offset, local_bitset) { function foreach (line 547) | foreach(const procid_t& mirror, vertex.mirrors()) { function foreach (line 558) | foreach(const vid_gather_pair_type& pair, buffer) { FILE: src/graphlab/graph/graph_hash.hpp type graphlab (line 29) | namespace graphlab { type graph_hash (line 30) | namespace graph_hash { function hash_vertex (line 32) | inline static size_t hash_vertex (const vertex_id_type vid) { function hash_edge (line 37) | inline static size_t hash_edge (const std::pair&... function num_neighbors (line 94) | size_t num_neighbors(const distributed_graph& ... function neighbors (line 119) | void neighbors(const distributed_graph& graph, function save_metis_structure (line 151) | bool save_metis_structure(const std::string& filename, function save_edge_list_structure (line 183) | bool save_edge_list_structure(const std::string& filename, function save_zoltan_hypergraph_structure (line 202) | bool save_zoltan_hypergraph_structure(const std::string& filename, FILE: src/graphlab/graph/graph_storage_deprecated.hpp type graphlab (line 74) | namespace graphlab { class graph_storage (line 77) | class graph_storage { class edge_type (line 99) | class edge_type { method edge_type (line 101) | edge_type () : _source(-1), _target(-1), _eid(-1) {} method edge_type (line 102) | edge_type(lvid_type _source, lvid_type _target, edge_id_type _eid) method is_empty (line 105) | inline bool is_empty() { return _eid == -1; } method lvid_type (line 106) | lvid_type source() const { return _source; } method lvid_type (line 107) | lvid_type target() const { return _target; } method edge_id_type (line 108) | edge_id_type id() const { return _eid; } method csr_zip_iterator (line 121) | csr_zip_iterator make_csr_zip_iterator(typename csr_type::iterator i... type make_edge_type_csr_functor (line 127) | struct make_edge_type_csr_functor { method make_edge_type_csr_functor (line 131) | make_edge_type_csr_functor() : sourceid(-1) { } method make_edge_type_csr_functor (line 133) | make_edge_type_csr_functor(lvid_type sourceid) : sourceid(sourceid... method result_type (line 135) | result_type operator() (argument_type arg) const { type make_edge_type_csc_functor (line 143) | struct make_edge_type_csc_functor { method make_edge_type_csc_functor (line 146) | make_edge_type_csc_functor() : destid(-1) {} method make_edge_type_csc_functor (line 148) | make_edge_type_csc_functor(lvid_type destid) : destid(destid) { } method result_type (line 150) | result_type operator() (argument_type arg) const { class edge_iterator (line 161) | class edge_iterator : method edge_iterator (line 168) | edge_iterator() : _type(UNDEFINED) {} method edge_iterator (line 169) | edge_iterator(csc_edge_iterator iter) : _type(CSC), csc_iter(iter) {} method edge_iterator (line 170) | edge_iterator(csr_edge_iterator iter) : _type(CSR), csr_iter(iter) {} method increment (line 175) | void increment() { method equal (line 182) | bool equal(const edge_iterator& other) const method edge_type (line 191) | edge_type dereference() const { method decrement (line 198) | void decrement() { method advance (line 205) | void advance(int n) { method distance_to (line 212) | int distance_to(const edge_iterator& other) const { type list_type (line 220) | enum list_type {CSR, CSC, UNDEFINED} class edge_list (line 226) | class edge_list { method edge_list (line 228) | edge_list(edge_iterator _begin, edge_iterator _end) : method size (line 234) | inline size_t size() const { method edge_type (line 238) | inline edge_type operator[](size_t i) const { method is_empty (line 242) | bool is_empty() const { return size() == 0; } method iterator (line 244) | iterator begin() const { return _begin; } method iterator (line 246) | iterator end() const { return _end; } method graph_storage (line 255) | graph_storage() { } method num_edges (line 259) | size_t num_edges() const { return _edata_storage.size(); } method num_vertices (line 262) | size_t num_vertices() const { return _csr_storage.num_keys(); } method num_in_edges (line 265) | size_t num_in_edges (const lvid_type v) const { method num_out_edges (line 270) | size_t num_out_edges (const lvid_type v) const { method edge_list (line 275) | edge_list in_edges(const lvid_type v) { method edge_list (line 228) | edge_list(edge_iterator _begin, edge_iterator _end) : method size (line 234) | inline size_t size() const { method edge_type (line 238) | inline edge_type operator[](size_t i) const { method is_empty (line 242) | bool is_empty() const { return size() == 0; } method iterator (line 244) | iterator begin() const { return _begin; } method iterator (line 246) | iterator end() const { return _end; } method edge_list (line 286) | edge_list out_edges(const lvid_type v) { method edge_list (line 228) | edge_list(edge_iterator _begin, edge_iterator _end) : method size (line 234) | inline size_t size() const { method edge_type (line 238) | inline edge_type operator[](size_t i) const { method is_empty (line 242) | bool is_empty() const { return size() == 0; } method iterator (line 244) | iterator begin() const { return _begin; } method iterator (line 246) | iterator end() const { return _end; } method EdgeData (line 303) | EdgeData& edge_data(edge_id_type eid) { method EdgeData (line 308) | const EdgeData& edge_data(edge_id_type eid) const { method finalize (line 319) | void finalize(local_edge_buffer &edges) { method clear (line 411) | void clear() { method estimate_sizeof (line 416) | size_t estimate_sizeof() const { method load (line 429) | void load(iarchive& arc) { method save (line 437) | void save(oarchive& arc) const { method swap (line 444) | void swap(graph_storage& other) { type std (line 452) | namespace std { function swap (line 454) | inline void swap(graphlab::graph_storage& a, FILE: src/graphlab/graph/graph_vertex_join.hpp type graphlab (line 30) | namespace graphlab { class graph_vertex_join (line 171) | class graph_vertex_join { type injective_join_index (line 198) | struct injective_join_index { method graph_vertex_join (line 208) | graph_vertex_join(distributed_control& dc, method prepare_injective_join (line 255) | void prepare_injective_join(LeftEmitKey left_emit_key, method left_injective_join (line 304) | void left_injective_join(JoinOp join_op) { method right_injective_join (line 330) | void right_injective_join(JoinOp join_op) { method reset_and_fill_injective_index (line 338) | void reset_and_fill_injective_index(injective_join_index& idx, method compute_injective_join (line 365) | void compute_injective_join() { method get_procs_with_keys (line 459) | std::vector > method injective_join (line 475) | void injective_join(injective_join_index& target, FILE: src/graphlab/graph/ingress/distributed_batch_ingress.hpp type graphlab (line 36) | namespace graphlab { class distributed_graph (line 38) | class distributed_graph class distributed_batch_ingress (line 41) | class distributed_batch_ingress : method vid_to_dht_entry_with_readlock (line 71) | size_t vid_to_dht_entry_with_readlock(vertex_id_type vid) { method distributed_batch_ingress (line 108) | distributed_batch_ingress(distributed_control& dc, graph_type& graph, method add_edge (line 124) | void add_edge(vertex_id_type source, vertex_id_type target, const Ed... method finalize (line 139) | void finalize() { method add_edges (line 151) | void add_edges(const std::vector& source_arr, method block_add_degree_counts (line 238) | void block_add_degree_counts (procid_t pid, std::vector >& proc_src, method flush (line 320) | void flush() { method size (line 340) | size_t size() { return num_edges; } method is_full (line 343) | bool is_full() { return size() >= bufsize; } FILE: src/graphlab/graph/ingress/distributed_constrained_batch_ingress.hpp type graphlab (line 36) | namespace graphlab { class distributed_graph (line 38) | class distributed_graph class distributed_constrained_batch_ingress (line 41) | class distributed_constrained_batch_ingress : method vid_to_dht_entry_with_readlock (line 71) | size_t vid_to_dht_entry_with_readlock(vertex_id_type vid) { method distributed_constrained_batch_ingress (line 109) | distributed_constrained_batch_ingress(distributed_control& dc, graph... method add_edge (line 122) | void add_edge(vertex_id_type source, vertex_id_type target, const Ed... method finalize (line 135) | void finalize() { method add_edges (line 147) | void add_edges(const std::vector& source_arr, method block_add_degree_counts (line 232) | void block_add_degree_counts (procid_t pid, std::vector >& proc_src, method flush (line 310) | void flush() { method size (line 330) | size_t size() { return num_edges; } method is_full (line 333) | bool is_full() { return size() >= bufsize; } method procid_t (line 336) | procid_t get_master (vertex_id_type vid) { FILE: src/graphlab/graph/ingress/distributed_constrained_oblivious_ingress.hpp type graphlab (line 38) | namespace graphlab { class distributed_graph (line 40) | class distributed_graph class distributed_constrained_oblivious_ingress (line 46) | class distributed_constrained_oblivious_ingress: method distributed_constrained_oblivious_ingress (line 78) | distributed_constrained_oblivious_ingress(distributed_control& dc, g... method add_edge (line 89) | void add_edge(vertex_id_type source, vertex_id_type target, method finalize (line 101) | virtual void finalize() { method procid_t (line 107) | procid_t get_master (vertex_id_type vid) { FILE: src/graphlab/graph/ingress/distributed_constrained_random_ingress.hpp type graphlab (line 37) | namespace graphlab { class distributed_graph (line 39) | class distributed_graph class distributed_constrained_random_ingress (line 45) | class distributed_constrained_random_ingress : method distributed_constrained_random_ingress (line 61) | distributed_constrained_random_ingress(distributed_control& dc, grap... method add_edge (line 72) | void add_edge(vertex_id_type source, vertex_id_type target, FILE: src/graphlab/graph/ingress/distributed_hdrf_ingress.hpp type graphlab (line 36) | namespace graphlab { class distributed_graph (line 38) | class distributed_graph class distributed_hdrf_ingress (line 41) | class distributed_hdrf_ingress: method distributed_hdrf_ingress (line 76) | distributed_hdrf_ingress(distributed_control& dc, graph_type& graph,... method add_edge (line 86) | void add_edge(vertex_id_type source, vertex_id_type target, method finalize (line 99) | virtual void finalize() { FILE: src/graphlab/graph/ingress/distributed_identity_ingress.hpp type graphlab (line 35) | namespace graphlab { class distributed_graph (line 37) | class distributed_graph class distributed_identity_ingress (line 43) | class distributed_identity_ingress : method distributed_identity_ingress (line 55) | distributed_identity_ingress(distributed_control& dc, graph_type& gr... method add_edge (line 62) | void add_edge(vertex_id_type source, vertex_id_type target, FILE: src/graphlab/graph/ingress/distributed_ingress_base.hpp type graphlab (line 34) | namespace graphlab { class distributed_graph (line 40) | class distributed_graph class distributed_ingress_base (line 43) | class distributed_ingress_base { type vertex_buffer_record (line 61) | struct vertex_buffer_record { method vertex_buffer_record (line 64) | vertex_buffer_record(vertex_id_type vid = -1, method load (line 67) | void load(iarchive& arc) { arc >> vid >> vdata; } method save (line 68) | void save(oarchive& arc) const { arc << vid << vdata; } type edge_buffer_record (line 73) | struct edge_buffer_record { method edge_buffer_record (line 76) | edge_buffer_record(const vertex_id_type& source = vertex_id_type(-1), method load (line 80) | void load(iarchive& arc) { arc >> source >> target >> edata; } method save (line 81) | void save(oarchive& arc) const { arc << source << target << edata; } type vertex_negotiator_record (line 86) | struct vertex_negotiator_record { method vertex_negotiator_record (line 91) | vertex_negotiator_record() : num_in_edges(0), num_out_edges(0), ha... method load (line 93) | void load(iarchive& arc) { method save (line 96) | void save(oarchive& arc) const { method vertex_negotiator_record (line 100) | vertex_negotiator_record operator+=(const vertex_negotiator_record... method distributed_ingress_base (line 115) | distributed_ingress_base(distributed_control& dc, graph_type& graph) : method add_edge (line 130) | virtual void add_edge(vertex_id_type source, vertex_id_type target, method add_vertex (line 144) | virtual void add_vertex(vertex_id_type vid, const VertexData& vdata) { method set_duplicate_vertex_strategy (line 155) | void set_duplicate_vertex_strategy( method finalize (line 181) | virtual void finalize() { method exchange_global_info (line 514) | void exchange_global_info () { method vertex_negotiator_record (line 562) | vertex_negotiator_record finalize_gather(lvid_type& lvid, graph_type... method vertex_negotiator_record (line 91) | vertex_negotiator_record() : num_in_edges(0), num_out_edges(0), ha... method load (line 93) | void load(iarchive& arc) { method save (line 96) | void save(oarchive& arc) const { method vertex_negotiator_record (line 100) | vertex_negotiator_record operator+=(const vertex_negotiator_record... method finalize_apply (line 577) | void finalize_apply(lvid_type lvid, const vertex_negotiator_record& ... FILE: src/graphlab/graph/ingress/distributed_oblivious_ingress.hpp type graphlab (line 37) | namespace graphlab { class distributed_graph (line 39) | class distributed_graph class distributed_oblivious_ingress (line 45) | class distributed_oblivious_ingress: method distributed_oblivious_ingress (line 75) | distributed_oblivious_ingress(distributed_control& dc, graph_type& g... method add_edge (line 85) | void add_edge(vertex_id_type source, vertex_id_type target, method finalize (line 102) | virtual void finalize() { FILE: src/graphlab/graph/ingress/distributed_random_ingress.hpp type graphlab (line 35) | namespace graphlab { class distributed_graph (line 37) | class distributed_graph class distributed_random_ingress (line 43) | class distributed_random_ingress : method distributed_random_ingress (line 56) | distributed_random_ingress(distributed_control& dc, graph_type& grap... method add_edge (line 63) | void add_edge(vertex_id_type source, vertex_id_type target, FILE: src/graphlab/graph/ingress/ingress_edge_decision.hpp type graphlab (line 32) | namespace graphlab { class distributed_graph (line 34) | class distributed_graph class ingress_edge_decision (line 37) | class ingress_edge_decision { method ingress_edge_decision (line 46) | ingress_edge_decision(distributed_control& dc) { } method procid_t (line 49) | procid_t edge_to_proc_random (const vertex_id_type source, method procid_t (line 59) | procid_t edge_to_proc_random (const vertex_id_type source, method procid_t (line 75) | procid_t edge_to_proc_greedy (const vertex_id_type source, method procid_t (line 127) | procid_t edge_to_proc_greedy (const vertex_id_type source, method procid_t (line 192) | procid_t edge_to_proc_hdrf (const vertex_id_type source, FILE: src/graphlab/graph/ingress/sharding_constraint.hpp type graphlab (line 53) | namespace graphlab { class sharding_constraint (line 54) | class sharding_constraint { method is_grid_compatible (line 62) | static bool is_grid_compatible(size_t num_shards, int& nrow, int& nc... method is_pds_compatible (line 73) | static bool is_pds_compatible(size_t num_shards, int& p) { method sharding_constraint (line 79) | sharding_constraint(size_t num_shards, std::string method) { method get_neighbors (line 101) | bool get_neighbors (procid_t shard, std::vector& neighbors) { method make_grid_constraint (line 116) | void make_grid_constraint() { method make_pds_constraint (line 141) | void make_pds_constraint() { method compute_neighbors (line 165) | bool compute_neighbors(procid_t shardi, procid_t shardj, std::vector... FILE: src/graphlab/graph/local_edge_buffer.hpp type graphlab (line 30) | namespace graphlab { class local_edge_buffer (line 34) | class local_edge_buffer { method local_edge_buffer (line 40) | local_edge_buffer() {} method reserve_edge_space (line 41) | void reserve_edge_space(size_t n) { method add_edge (line 47) | void add_edge(lvid_type source, lvid_type target, EdgeData _data) { method add_block_edges (line 53) | void add_block_edges(const std::vector& src_arr, method clear (line 61) | void clear() { method size (line 67) | size_t size() const { method estimate_sizeof (line 71) | size_t estimate_sizeof() const { FILE: src/graphlab/graph/local_graph.hpp type graphlab (line 66) | namespace graphlab { class local_graph (line 69) | class local_graph { class edge_type (line 81) | class edge_type method edge_type (line 134) | edge_type(local_graph& lgraph_ref, lvid_type _source, lvid_type _t... method edge_data_type (line 138) | const edge_data_type& data() const { method edge_data_type (line 142) | edge_data_type& data() { method vertex_type (line 146) | vertex_type source() const { method vertex_type (line 150) | vertex_type target() const { method edge_id_type (line 154) | edge_id_type id() const { return _eid; } class vertex_type (line 82) | class vertex_type method vertex_type (line 95) | vertex_type(local_graph& lgraph_ref, lvid_type vid):lgraph_ref(lgr... method vertex_data_type (line 98) | const vertex_data_type& data() const { method vertex_data_type (line 102) | vertex_data_type& data() { method num_in_edges (line 106) | size_t num_in_edges() const { method num_out_edges (line 110) | size_t num_out_edges() const { method lvid_type (line 114) | lvid_type id() const { method edge_list_type (line 118) | edge_list_type in_edges() { method edge_list_type (line 122) | edge_list_type out_edges() { class edge_iterator (line 85) | class edge_iterator method edge_iterator (line 623) | edge_iterator(local_graph& lgraph_ref, method edge_iterator (line 626) | edge_iterator(local_graph& lgraph_ref, method increment (line 633) | void increment() { method equal (line 640) | bool equal(const edge_iterator& other) const method edge_type (line 649) | edge_type dereference() const { method decrement (line 652) | void decrement() { method advance (line 659) | void advance(int n) { method distance_to (line 666) | ptrdiff_t distance_to(const edge_iterator& other) const { method edge_type (line 674) | edge_type make_value() const { type list_type (line 692) | enum list_type {CSR, CSC} class vertex_type (line 93) | class vertex_type { method vertex_type (line 95) | vertex_type(local_graph& lgraph_ref, lvid_type vid):lgraph_ref(lgr... method vertex_data_type (line 98) | const vertex_data_type& data() const { method vertex_data_type (line 102) | vertex_data_type& data() { method num_in_edges (line 106) | size_t num_in_edges() const { method num_out_edges (line 110) | size_t num_out_edges() const { method lvid_type (line 114) | lvid_type id() const { method edge_list_type (line 118) | edge_list_type in_edges() { method edge_list_type (line 122) | edge_list_type out_edges() { class edge_type (line 132) | class edge_type { method edge_type (line 134) | edge_type(local_graph& lgraph_ref, lvid_type _source, lvid_type _t... method edge_data_type (line 138) | const edge_data_type& data() const { method edge_data_type (line 142) | edge_data_type& data() { method vertex_type (line 146) | vertex_type source() const { method vertex_type (line 150) | vertex_type target() const { method edge_id_type (line 154) | edge_id_type id() const { return _eid; } method local_graph (line 168) | local_graph() : finalized(false) { } method local_graph (line 171) | local_graph(size_t nverts) : method is_dynamic (line 177) | static bool is_dynamic() { method clear (line 184) | void clear() { method finalize (line 203) | void finalize() { method num_vertices (line 284) | size_t num_vertices() const { method num_edges (line 289) | size_t num_edges() const { method add_vertex (line 298) | void add_vertex(lvid_type vid, method reserve (line 312) | void reserve(size_t num_vertices) { method resize (line 321) | void resize(size_t num_vertices ) { method reserve_edge_space (line 326) | void reserve_edge_space(size_t n) { method edge_id_type (line 333) | edge_id_type add_edge(lvid_type source, lvid_type target, method add_edges (line 361) | void add_edges(const std::vector& src_arr, method vertex_type (line 397) | vertex_type vertex(lvid_type vid) { method vertex_type (line 95) | vertex_type(local_graph& lgraph_ref, lvid_type vid):lgraph_ref(lgr... method vertex_data_type (line 98) | const vertex_data_type& data() const { method vertex_data_type (line 102) | vertex_data_type& data() { method num_in_edges (line 106) | size_t num_in_edges() const { method num_out_edges (line 110) | size_t num_out_edges() const { method lvid_type (line 114) | lvid_type id() const { method edge_list_type (line 118) | edge_list_type in_edges() { method edge_list_type (line 122) | edge_list_type out_edges() { method vertex_type (line 403) | const vertex_type vertex(lvid_type vid) const { method vertex_type (line 95) | vertex_type(local_graph& lgraph_ref, lvid_type vid):lgraph_ref(lgr... method vertex_data_type (line 98) | const vertex_data_type& data() const { method vertex_data_type (line 102) | vertex_data_type& data() { method num_in_edges (line 106) | size_t num_in_edges() const { method num_out_edges (line 110) | size_t num_out_edges() const { method lvid_type (line 114) | lvid_type id() const { method edge_list_type (line 118) | edge_list_type in_edges() { method edge_list_type (line 122) | edge_list_type out_edges() { method VertexData (line 409) | VertexData& vertex_data(lvid_type v) { method VertexData (line 415) | const VertexData& vertex_data(lvid_type v) const { method load (line 421) | void load(iarchive& arc) { method save (line 432) | void save(oarchive& arc) const { method swap (line 442) | void swap(local_graph& other) { method load (line 453) | void load(const std::string& filename) { method save (line 463) | void save(const std::string& filename) const { method save_adjacency (line 478) | void save_adjacency(const std::string& filename) const { method num_in_edges (line 503) | size_t num_in_edges(const lvid_type v) const { method num_out_edges (line 511) | size_t num_out_edges(const lvid_type v) const { method edge_list_type (line 519) | edge_list_type in_edges(lvid_type v) { method edge_list_type (line 528) | edge_list_type out_edges(lvid_type v) { method EdgeData (line 554) | EdgeData& edge_data(edge_id_type eid) { method EdgeData (line 562) | const EdgeData& edge_data(edge_id_type eid) const { method estimate_sizeof (line 570) | size_t estimate_sizeof() const { method lvid_type (line 588) | const lvid_type maxlvid() const { class edge_iterator (line 616) | class edge_iterator : method edge_iterator (line 623) | edge_iterator(local_graph& lgraph_ref, method edge_iterator (line 626) | edge_iterator(local_graph& lgraph_ref, method increment (line 633) | void increment() { method equal (line 640) | bool equal(const edge_iterator& other) const method edge_type (line 649) | edge_type dereference() const { method decrement (line 652) | void decrement() { method advance (line 659) | void advance(int n) { method distance_to (line 666) | ptrdiff_t distance_to(const edge_iterator& other) const { method edge_type (line 674) | edge_type make_value() const { type list_type (line 692) | enum list_type {CSR, CSC} type std (line 748) | namespace std { function swap (line 753) | inline void swap(graphlab::local_graph& a, FILE: src/graphlab/graph/local_graph_ops.hpp type graphlab (line 45) | namespace graphlab { type local_graph_ops (line 48) | namespace local_graph_ops { function topological_sort (line 59) | bool topological_sort(const graphlab::local_graph& gr... function save_metis_structure (line 151) | bool save_metis_structure(const std::string& filename, function save_edge_list_structure (line 183) | bool save_edge_list_structure(const std::string& filename, function save_zoltan_hypergraph_structure (line 202) | bool save_zoltan_hypergraph_structure(const std::string& filename, FILE: src/graphlab/graph/vertex_set.hpp type graphlab (line 33) | namespace graphlab { class vertex_set (line 71) | class vertex_set { method dense_bitset (line 101) | const dense_bitset& get_lvid_bitset(const DGraphType& dgraph) const { method set_lvid_unsync (line 114) | inline void set_lvid_unsync(lvid_type lvid) { method set_lvid (line 127) | inline void set_lvid(lvid_type lvid) { method make_explicit (line 138) | void make_explicit(const DGraphType& dgraph) const { method synchronize_master_to_mirrors (line 157) | void synchronize_master_to_mirrors(DGraphType& dgraph, method synchronize_mirrors_to_master_or (line 196) | void synchronize_mirrors_to_master_or(DGraphType& dgraph, method vertex_set (line 229) | vertex_set():is_complete_set(false), lazy(true){} method vertex_set (line 236) | explicit vertex_set(bool complete):is_complete_set(complete),lazy(tr... method vertex_set (line 239) | inline vertex_set(const vertex_set& other): method vertex_set (line 245) | inline vertex_set& operator=(const vertex_set& other) { method l_contains (line 256) | inline bool l_contains(lvid_type lvid) const { method vertex_set (line 275) | inline vertex_set operator&(const vertex_set& other) const { method vertex_set (line 291) | inline vertex_set operator|(const vertex_set& other) const { method vertex_set (line 314) | inline vertex_set operator-(const vertex_set& other) const { method vertex_set (line 331) | inline vertex_set& operator&=(const vertex_set& other) { method vertex_set (line 356) | inline vertex_set& operator|=(const vertex_set& other) { method vertex_set (line 386) | inline vertex_set& operator-=(const vertex_set& other) { method vertex_set (line 409) | inline vertex_set operator~() const { method invert (line 423) | inline void invert() { FILE: src/graphlab/jni/java_any.cpp function jobject (line 46) | jobject &java_any::obj() { function jobject (line 50) | const jobject &java_any::obj() const { function java_any (line 68) | java_any &java_any::operator=(const java_any& other){ FILE: src/graphlab/jni/java_any.hpp type graphlab (line 33) | namespace graphlab { class java_any (line 42) | class java_any { FILE: src/graphlab/jni/org_graphlab_Aggregator.cpp function JNIEXPORT (line 36) | JNIEXPORT void JNICALL function proxy_aggregator (line 84) | proxy_aggregator &proxy_aggregator::operator=(const proxy_aggregator& ot... FILE: src/graphlab/jni/org_graphlab_Aggregator.hpp type graphlab (line 38) | namespace graphlab { class proxy_aggregator (line 48) | class proxy_aggregator : FILE: src/graphlab/jni/org_graphlab_Context.cpp function JNIEXPORT (line 39) | JNIEXPORT void JNICALL FILE: src/graphlab/jni/org_graphlab_Core.cpp function jlong (line 60) | static jlong createCore (JNIEnv *env, jobject obj, int argc, char **argv){ function JNIEXPORT (line 91) | JNIEXPORT jlong JNICALL function JNIEXPORT (line 97) | JNIEXPORT jlong JNICALL function JNIEXPORT (line 126) | JNIEXPORT void JNICALL function JNIEXPORT (line 145) | JNIEXPORT void JNICALL function JNIEXPORT (line 162) | JNIEXPORT void JNICALL function JNIEXPORT (line 183) | JNIEXPORT void JNICALL function JNIEXPORT (line 203) | JNIEXPORT jdouble JNICALL function JNIEXPORT (line 223) | JNIEXPORT jlong JNICALL function JNIEXPORT (line 240) | JNIEXPORT void JNICALL function JNIEXPORT (line 266) | JNIEXPORT void JNICALL function JNIEXPORT (line 293) | JNIEXPORT void JNICALL function JNIEXPORT (line 321) | JNIEXPORT jobject JNICALL function JNIEXPORT (line 347) | JNIEXPORT void JNICALL function JNIEXPORT (line 364) | JNIEXPORT void JNICALL function JNIEXPORT (line 385) | JNIEXPORT void JNICALL function JNIEXPORT (line 406) | JNIEXPORT void JNICALL function JNIEXPORT (line 427) | JNIEXPORT void JNICALL function JNIEXPORT (line 448) | JNIEXPORT void JNICALL function JNIEXPORT (line 474) | JNIEXPORT void JNICALL FILE: src/graphlab/jni/org_graphlab_Core.hpp type graphlab (line 40) | namespace graphlab { class jni_core (line 49) | class jni_core : public java_any { method jni_core (line 75) | jni_core (JNIEnv *env, jobject &obj) : java_any (env, obj) { method core_type (line 83) | core_type &operator()(){ method set_jvm (line 99) | static void set_jvm (JavaVM *jvm){ method JavaVM (line 107) | static JavaVM *get_jvm (){ method detach_from_jvm (line 119) | static void detach_from_jvm() { method dump_backtrace (line 130) | static void dump_backtrace(int sig){ method throw_exception (line 144) | static void throw_exception(JNIEnv* env, method JNIEnv (line 161) | static JNIEnv *get_jni_env (){ FILE: src/graphlab/jni/org_graphlab_Updater.cpp function JNIEXPORT (line 47) | JNIEXPORT void JNICALL function proxy_updater (line 124) | proxy_updater &proxy_updater::operator=(const proxy_updater& other){ function edge_set (line 172) | edge_set proxy_updater::gather_edges() const { function edge_set (line 184) | edge_set proxy_updater::scatter_edges() const { function consistency_model (line 196) | consistency_model proxy_updater::consistency() const { function consistency_model (line 209) | consistency_model proxy_updater::gather_consistency() const { function consistency_model (line 222) | consistency_model proxy_updater::scatter_consistency() const { FILE: src/graphlab/jni/org_graphlab_Updater.hpp type graphlab (line 36) | namespace graphlab { class proxy_edge (line 39) | class proxy_edge : public java_any { method proxy_edge (line 48) | proxy_edge (JNIEnv *env, jobject &obj) : java_any (env, obj) {} class proxy_vertex (line 52) | class proxy_vertex : public java_any { method proxy_vertex (line 54) | proxy_vertex () : java_any () {} method proxy_vertex (line 62) | proxy_vertex (JNIEnv *env, jobject &obj) : java_any (env, obj) {} class proxy_updater (line 79) | class proxy_updater : FILE: src/graphlab/logger/backtrace.cpp function demangle (line 34) | std::string demangle(const char* symbol) { function __set_back_trace_file_number (line 63) | extern void __set_back_trace_file_number(int number) { function __print_back_trace (line 68) | void __print_back_trace() { FILE: src/graphlab/logger/logger.cpp function file_logger (line 33) | file_logger& global_logger() { function streambuffdestructor (line 41) | void streambuffdestructor(void* v){ function textcolor (line 108) | void textcolor(FILE* handle, int attr, int fg) function reset_color (line 116) | void reset_color(FILE* handle) function file_logger (line 238) | file_logger& file_logger::start_stream(int lineloglevel,const char* file, FILE: src/graphlab/logger/logger.hpp type logger_impl (line 172) | namespace logger_impl { type streambuff_tls_entry (line 173) | struct streambuff_tls_entry { class file_logger (line 186) | class file_logger{ method set_log_to_console (line 204) | void set_log_to_console(bool consolelog) { method get_log_file (line 209) | std::string get_log_file(void) { method get_log_to_console (line 214) | bool get_log_to_console() { method get_log_level (line 219) | int get_log_level() { method file_logger (line 226) | file_logger& operator<<(T a) { method file_logger (line 239) | inline file_logger& operator<<(const char* a) { method file_logger (line 257) | inline file_logger& operator<<(std::ostream& (*f)(std::ostream&)){ method set_log_level (line 284) | void set_log_level(int new_log_level) { method stream_flush (line 308) | inline void stream_flush() { type log_dispatch (line 343) | struct log_dispatch {} type log_dispatch (line 346) | struct log_dispatch { method exec (line 347) | inline static void exec(int loglevel,const char* file,const char* func... type log_dispatch (line 361) | struct log_dispatch { method exec (line 362) | inline static void exec(int loglevel,const char* file,const char* func... type null_stream (line 367) | struct null_stream { method null_stream (line 369) | inline null_stream operator<<(T t) { return null_stream(); } method null_stream (line 370) | inline null_stream operator<<(const char* a) { return null_stream(); } method null_stream (line 371) | inline null_stream operator<<(std::ostream& (*f)(std::ostream&)) { ret... type log_stream_dispatch (line 376) | struct log_stream_dispatch {} type log_stream_dispatch (line 379) | struct log_stream_dispatch { method file_logger (line 380) | inline static file_logger& exec(int lineloglevel,const char* file,cons... type log_stream_dispatch (line 386) | struct log_stream_dispatch { method null_stream (line 387) | inline static null_stream exec(int lineloglevel,const char* file,const... FILE: src/graphlab/options/command_line_options.cpp type boost (line 26) | namespace boost { type graphlab (line 60) | namespace graphlab { FILE: src/graphlab/options/command_line_options.hpp type boost (line 37) | namespace boost { function graphlab_vec_to_string (line 43) | std::string graphlab_vec_to_string(const std::vector& vec) { type graphlab (line 106) | namespace graphlab { class command_line_options (line 167) | class command_line_options : public graphlab_options { method command_line_options (line 194) | command_line_options(std::string desc_str, method print_description (line 208) | inline void print_description() const { std::cout << desc << std::en... method unrecognized (line 236) | inline std::vector unrecognized() const { method attach_option (line 261) | void attach_option(const std::string& option, FILE: src/graphlab/options/graphlab_options.hpp type graphlab (line 45) | namespace graphlab { class graphlab_options (line 71) | class graphlab_options { method graphlab_options (line 88) | graphlab_options() : method set_ncpus (line 109) | void set_ncpus(size_t n) method get_ncpus (line 120) | size_t get_ncpus() const { return ncpus; } method set_scheduler_type (line 122) | void set_scheduler_type(const std::string& stype) { method options_map (line 134) | const options_map& get_engine_args() const { method options_map (line 139) | options_map& get_engine_args() { method options_map (line 143) | const options_map& get_graph_args() const { method options_map (line 147) | options_map& get_graph_args() { method options_map (line 152) | const options_map& get_scheduler_args() const { method options_map (line 156) | options_map& get_scheduler_args() { method print (line 163) | virtual void print() const { FILE: src/graphlab/options/options_map.cpp type graphlab (line 41) | namespace graphlab { FILE: src/graphlab/options/options_map.hpp type graphlab (line 44) | namespace graphlab { class options_map (line 52) | class options_map { method options_map (line 55) | options_map() {} method options_map (line 57) | explicit options_map(std::string &s) { method set_option_str (line 65) | inline void set_option_str(const std::string &opt, method set_option (line 80) | void set_option(const std::string& opt, const T& val) { method is_set (line 94) | inline bool is_set(const std::string& opt) const { method get_option (line 102) | inline bool get_option(const std::string& opt, std::string& val) con... method get_option (line 112) | inline bool get_option(const std::string& opt, bool& val) const { method get_option (line 124) | inline bool get_option(const std::string& opt, IntType& val) const { method get_option (line 134) | inline bool get_option(const std::string& opt, float& val) const { method get_option (line 144) | inline bool get_option(const std::string& opt, double& val) const { method erase_option (line 155) | inline void erase_option(const std::string &opt) { method clear_options (line 162) | void clear_options() { method parse_options (line 170) | inline bool parse_options(std::istream& s) { type option_values (line 186) | struct option_values{ method option_values (line 191) | option_values () : intval(0), dblval(0), boolval(false) { } method get_option_keys (line 195) | std::vector get_option_keys() const { FILE: src/graphlab/parallel/atomic.hpp type graphlab (line 34) | namespace graphlab { type graphlab_impl (line 35) | namespace graphlab_impl { class atomic_impl (line 37) | class atomic_impl {} class atomic_impl (line 44) | class atomic_impl : public IS_POD_TYPE { method atomic_impl (line 50) | atomic_impl(const T& value = T()) : value(value) { } method T (line 53) | T inc() { return __sync_add_and_fetch(&value, 1); } method T (line 56) | T dec() { return __sync_sub_and_fetch(&value, 1); } method T (line 62) | T operator++() { return inc(); } method T (line 65) | T operator--() { return dec(); } method T (line 68) | T inc(const T val) { return __sync_add_and_fetch(&value, val); } method T (line 71) | T dec(const T val) { return __sync_sub_and_fetch(&value, val); } method T (line 74) | T operator+=(const T val) { return inc(val); } method T (line 77) | T operator-=(const T val) { return dec(val); } method T (line 80) | T inc_ret_last() { return __sync_fetch_and_add(&value, 1); } method T (line 83) | T dec_ret_last() { return __sync_fetch_and_sub(&value, 1); } method T (line 86) | T operator++(int) { return inc_ret_last(); } method T (line 89) | T operator--(int) { return dec_ret_last(); } method T (line 92) | T inc_ret_last(const T val) { return __sync_fetch_and_add(&value, ... method T (line 95) | T dec_ret_last(const T val) { return __sync_fetch_and_sub(&value, ... method T (line 98) | T exchange(const T val) { return __sync_lock_test_and_set(&value, ... class atomic_impl (line 103) | class atomic_impl : public IS_POD_TYPE { method atomic_impl (line 109) | atomic_impl(const T& value = T()) : value(value) { } method T (line 112) | T inc() { return inc(1); } method T (line 115) | T dec() { return dec(1); } method T (line 121) | T operator++() { return inc(); } method T (line 124) | T operator--() { return dec(); } method T (line 127) | T inc(const T val) { method T (line 138) | T dec(const T val) { method T (line 149) | T operator+=(const T val) { return inc(val); } method T (line 152) | T operator-=(const T val) { return dec(val); } method T (line 155) | T inc_ret_last() { return inc_ret_last(1); } method T (line 158) | T dec_ret_last() { return dec_ret_last(1); } method T (line 161) | T operator++(int) { return inc_ret_last(); } method T (line 164) | T operator--(int) { return dec_ret_last(); } method T (line 167) | T inc_ret_last(const T val) { method T (line 178) | T dec_ret_last(const T val) { method T (line 189) | T exchange(const T val) { return __sync_lock_test_and_set(&value, ... class atomic (line 194) | class atomic: public graphlab_impl::atomic_impl (line 56) | class atomic_add_vector2 { method atomic_add_vector2 (line 72) | atomic_add_vector2(size_t num_vertices = 0) { method resize (line 80) | void resize(size_t num_vertices) { method add (line 87) | bool add(const size_t& idx, method add (line 102) | bool add(const size_t& idx, method test_and_get (line 109) | bool test_and_get(const size_t& idx, method peek (line 114) | bool peek(const size_t& idx, method empty (line 119) | bool empty(const size_t& idx) const { method size (line 123) | size_t size() const { method num_joins (line 127) | size_t num_joins() const { method clear (line 132) | void clear() { method clear (line 136) | void clear(size_t i) { atomic_box_vec.clear_bit(i);} FILE: src/graphlab/parallel/atomic_ops.hpp type graphlab (line 30) | namespace graphlab { function atomic_compare_and_swap (line 45) | bool atomic_compare_and_swap(T& a, T oldval, T newval) { function atomic_compare_and_swap (line 63) | bool atomic_compare_and_swap(volatile T& a, function atomic_compare_and_swap (line 83) | inline bool atomic_compare_and_swap(volatile double& a, function atomic_compare_and_swap (line 106) | inline bool atomic_compare_and_swap(volatile float& a, function atomic_exchange (line 122) | void atomic_exchange(T& a, T& b) { function atomic_exchange (line 133) | void atomic_exchange(volatile T& a, T& b) { function T (line 142) | T fetch_and_store(T& a, const T& newval) { FILE: src/graphlab/parallel/cache_line_pad.hpp type graphlab (line 39) | namespace graphlab { type cache_line_pad (line 43) | struct cache_line_pad { method cache_line_pad (line 46) | cache_line_pad(const T& value = T()) : value(value) { } method T (line 47) | T& operator=(const T& other) { return value = other; } FILE: src/graphlab/parallel/deferred_rwlock.hpp type graphlab (line 29) | namespace graphlab { class deferred_rwlock (line 30) | class deferred_rwlock{ type request (line 33) | struct request{ method deferred_rwlock (line 46) | deferred_rwlock(): head(NULL), method get_reader_count (line 50) | inline size_t get_reader_count() { method has_waiters (line 56) | inline bool has_waiters() { method insert_queue (line 60) | inline void insert_queue(request *I) { method insert_queue_head (line 70) | inline void insert_queue_head(request *I) { method writelock_priority (line 81) | inline bool writelock_priority(request *I) { method writelock (line 98) | inline bool writelock(request *I) { method complete_wrlock (line 117) | inline void complete_wrlock() { method complete_rdlock (line 126) | inline size_t complete_rdlock(request* &released) { method wrunlock (line 167) | inline size_t wrunlock(request* &released) { method readlock (line 188) | inline size_t readlock(request *I, request* &released) { method readlock_priority (line 213) | inline size_t readlock_priority(request *I, request* &released) { method rdunlock (line 238) | inline size_t rdunlock(request* &released) { FILE: src/graphlab/parallel/fiber_barrier.hpp type graphlab (line 5) | namespace graphlab { class fiber_barrier (line 6) | class fiber_barrier { method fiber_barrier (line 20) | fiber_barrier(const fiber_barrier&) { } method fiber_barrier (line 28) | fiber_barrier(size_t numthreads) { method resize_unsafe (line 37) | void resize_unsafe(size_t numthreads) { method wait (line 43) | inline void wait() const { FILE: src/graphlab/parallel/fiber_conditional.hpp type graphlab (line 6) | namespace graphlab { class fiber_conditional (line 21) | class fiber_conditional { method fiber_conditional (line 31) | fiber_conditional() { method fiber_conditional (line 40) | fiber_conditional(const fiber_conditional &) { method wait (line 49) | inline void wait(const mutex& mut) const { method signal (line 63) | inline void signal() const { method broadcast (line 79) | inline void broadcast() const { FILE: src/graphlab/parallel/fiber_control.cpp type graphlab (line 31) | namespace graphlab { type trampoline_args (line 242) | struct trampoline_args { function foreach (line 277) | foreach(size_t b, affinity) { function fiber_control (line 549) | fiber_control& fiber_control::get_instance() { FILE: src/graphlab/parallel/fiber_control.hpp type graphlab (line 36) | namespace graphlab { class fiber_control (line 41) | class fiber_control { type fiber (line 47) | struct fiber { type thread_schedule (line 91) | struct thread_schedule { method thread_schedule (line 92) | thread_schedule():waiting(false) { } type tls (line 117) | struct tls { method fiber_control (line 150) | fiber_control(fiber_control&) {} method num_workers (line 177) | size_t num_workers() { method num_threads (line 184) | inline size_t num_threads() { method total_threads_created (line 191) | inline size_t total_threads_created() { FILE: src/graphlab/parallel/fiber_group.cpp type graphlab (line 26) | namespace graphlab { FILE: src/graphlab/parallel/fiber_group.hpp type graphlab (line 29) | namespace graphlab { class fiber_group (line 38) | class fiber_group { method increment_running_counter (line 52) | inline void increment_running_counter() { method decrement_running_counter (line 56) | inline void decrement_running_counter() { method fiber_group (line 75) | fiber_group(size_t stacksize = 8192, method set_stacksize (line 86) | inline void set_stacksize(size_t new_stacksize) { method set_affinity (line 95) | inline void set_affinity(affinity_type new_affinity) { method running_threads (line 126) | inline size_t running_threads() { FILE: src/graphlab/parallel/fiber_remote_request.hpp type graphlab (line 30) | namespace graphlab { type fiber_reply_container (line 37) | struct fiber_reply_container: public dc_impl::ireply_container { method fiber_reply_container (line 47) | fiber_reply_container():waiting_tid(0),valready(false) { } method wait (line 53) | void wait() { method receive (line 76) | void receive(procid_t source, dc_impl::blob b) { method ready (line 89) | bool ready() const { FILE: src/graphlab/parallel/lockfree_push_back.hpp type graphlab (line 28) | namespace graphlab { type lockfree_push_back_impl (line 30) | namespace lockfree_push_back_impl { type idx_ref (line 31) | struct idx_ref { method idx_ref (line 32) | idx_ref(): reference_count(0), idx(0) { } method idx_ref (line 33) | idx_ref(size_t idx): reference_count(0), idx(idx) { } method inc_ref (line 41) | inline void inc_ref() { method wait_till_no_ref (line 51) | inline void wait_till_no_ref() { method dec_ref (line 55) | inline void dec_ref() { method flag_ref (line 59) | inline void flag_ref() { method inc_idx (line 63) | inline size_t inc_idx() { method inc_idx (line 67) | inline size_t inc_idx(size_t n) { class lockfree_push_back (line 86) | class lockfree_push_back { method lockfree_push_back (line 93) | lockfree_push_back(Container& container, size_t startidx, float scal... method size (line 96) | size_t size() const { method set_size (line 100) | void set_size(size_t s) { method push_back (line 105) | size_t push_back(Iterator begin, Iterator end) { method query (line 144) | bool query(size_t item, T& value) { method T (line 155) | T* query(size_t item) { method query_unsafe (line 165) | bool query_unsafe(size_t item, T& value) { method T (line 174) | T* query_unsafe(size_t item) { method push_back (line 183) | size_t push_back(const T& t) { FILE: src/graphlab/parallel/mutex.hpp type graphlab (line 31) | namespace graphlab { class mutex (line 39) | class mutex { method mutex (line 44) | mutex() { method mutex (line 52) | mutex(const mutex&) { method lock (line 66) | inline void lock() const { method unlock (line 72) | inline void unlock() const { method try_lock (line 77) | inline bool try_lock() const { class recursive_mutex (line 92) | class recursive_mutex { method recursive_mutex (line 97) | recursive_mutex() { method recursive_mutex (line 111) | recursive_mutex(const recursive_mutex&) { method lock (line 131) | inline void lock() const { method unlock (line 137) | inline void unlock() const { method try_lock (line 142) | inline bool try_lock() const { FILE: src/graphlab/parallel/pthread_tools.cpp type graphlab (line 28) | namespace graphlab { type thread_keys (line 32) | struct thread_keys { method thread_keys (line 34) | thread_keys() : GRAPHLAB_TSD_ID(0) { function pthread_key_t (line 42) | static pthread_key_t get_tsd_id() { function destroy_tls_data (line 97) | void destroy_tls_data(void* ptr) { FILE: src/graphlab/parallel/pthread_tools.hpp type graphlab (line 53) | namespace graphlab { class spinlock (line 67) | class spinlock { method spinlock (line 73) | spinlock () { method spinlock (line 82) | spinlock(const spinlock&) { method lock (line 92) | inline void lock() const { method unlock (line 97) | inline void unlock() const { method try_lock (line 102) | inline bool try_lock() const { class simple_spinlock (line 126) | class simple_spinlock { method simple_spinlock (line 132) | simple_spinlock () { method simple_spinlock (line 140) | simple_spinlock(const simple_spinlock&) { method lock (line 149) | inline void lock() const { method unlock (line 153) | inline void unlock() const { method try_lock (line 158) | inline bool try_lock() const { class padded_simple_spinlock (line 174) | class padded_simple_spinlock { method padded_simple_spinlock (line 181) | padded_simple_spinlock () { method padded_simple_spinlock (line 189) | padded_simple_spinlock(const padded_simple_spinlock&) { method lock (line 198) | inline void lock() const { method unlock (line 202) | inline void unlock() const { method try_lock (line 207) | inline bool try_lock() const { class conditional (line 224) | class conditional { method conditional (line 229) | conditional() { method conditional (line 238) | conditional(const conditional &) { method wait (line 249) | inline void wait(const mutex& mut) const { method timedwait (line 254) | inline int timedwait(const mutex& mut, size_t sec) const { method timedwait_ms (line 264) | inline int timedwait_ms(const mutex& mut, size_t ms) const { method timedwait_ns (line 287) | inline int timedwait_ns(const mutex& mut, size_t ns) const { method signal (line 311) | inline void signal() const { method broadcast (line 316) | inline void broadcast() const { class semaphore (line 333) | class semaphore { method semaphore (line 341) | semaphore() { method semaphore (line 349) | semaphore(const semaphore&) { method post (line 357) | inline void post() const { method wait (line 365) | inline void wait() const { method semaphore (line 391) | semaphore() { method semaphore (line 400) | semaphore(const semaphore&) { method post (line 408) | inline void post() const { method wait (line 412) | inline void wait() const { class semaphore (line 386) | class semaphore { method semaphore (line 341) | semaphore() { method semaphore (line 349) | semaphore(const semaphore&) { method post (line 357) | inline void post() const { method wait (line 365) | inline void wait() const { method semaphore (line 391) | semaphore() { method semaphore (line 400) | semaphore(const semaphore&) { method post (line 408) | inline void post() const { method wait (line 412) | inline void wait() const { class spinrwlock (line 438) | class spinrwlock { method spinrwlock (line 452) | spinrwlock() { method writelock (line 455) | inline void writelock() const { method wrunlock (line 463) | inline void wrunlock() const{ method readlock (line 474) | inline void readlock() const { method rdunlock (line 482) | inline void rdunlock() const { method unlock (line 486) | inline void unlock() const { type spinrwlock2 (line 502) | struct spinrwlock2 { method spinrwlock2 (line 505) | spinrwlock2():l(0) {} method writelock (line 506) | void writelock() const { method wrunlock (line 528) | void wrunlock() const { method readlock (line 532) | void readlock() const { method rdunlock (line 545) | void rdunlock() const { class rwlock (line 569) | class rwlock { method rwlock (line 573) | rwlock() { method rwlock (line 592) | rwlock(const rwlock &) { method readlock (line 597) | inline void readlock() const { method writelock (line 601) | inline void writelock() const { method try_readlock (line 605) | inline bool try_readlock() const { method try_writelock (line 608) | inline bool try_writelock() const { method unlock (line 611) | inline void unlock() const { method rdunlock (line 615) | inline void rdunlock() const { method wrunlock (line 618) | inline void wrunlock() const { class cancellable_barrier (line 636) | class cancellable_barrier { method cancellable_barrier (line 648) | cancellable_barrier(const cancellable_barrier&) { } method cancellable_barrier (line 653) | cancellable_barrier(size_t numthreads) { method resize_unsafe (line 664) | void resize_unsafe(size_t numthreads) { method cancel (line 672) | inline void cancel() { method wait (line 677) | inline void wait() const { class barrier (line 712) | class barrier { method barrier (line 716) | barrier(const barrier&) { } method barrier (line 719) | barrier(size_t numthreads) { method resize_unsafe (line 723) | void resize_unsafe(size_t numthreads) { method wait (line 729) | inline void wait() const { pthread_barrier_wait(&m_barrier); } function prefetch_range (line 740) | inline void prefetch_range(void *addr, size_t len) { function prefetch_range_write (line 746) | inline void prefetch_range_write(void *addr, size_t len) { class thread (line 771) | class thread { class tls_data (line 779) | class tls_data { method tls_data (line 781) | inline tls_data(size_t thread_id) : thread_id_(thread_id) { } method thread_id (line 782) | inline size_t thread_id() { return thread_id_; } method set_thread_id (line 783) | inline void set_thread_id(size_t t) { thread_id_ = t; } method any (line 784) | any& operator[](const size_t& id) { return local_data[id]; } method contains (line 785) | bool contains(const size_t& id) const { method erase (line 788) | size_t erase(const size_t& id) { method thread_id (line 808) | static inline size_t thread_id() { return get_tls_data().thread_id(); } method set_thread_id (line 812) | static inline void set_thread_id(size_t t) { get_tls_data().set_thre... method any (line 817) | static inline any& get_local(const size_t& id) { method contains (line 824) | static inline bool contains(const size_t& id) { method erase (line 832) | static inline size_t erase(const size_t& id){ type invoke_args (line 858) | struct invoke_args{ method invoke_args (line 861) | invoke_args(size_t m_thread_id, const boost::function ... method thread (line 873) | inline thread(size_t thread_id = 0) : method join (line 904) | inline void join() { method active (line 913) | inline bool active() const { method pthread_t (line 920) | inline pthread_t pthreadid() { class thread_group (line 955) | class thread_group { method thread_group (line 970) | thread_group() : m_thread_counter(0), threads_running(0) { } method running_threads (line 990) | inline size_t running_threads() { function thread (line 1000) | inline thread launch_in_new_thread(const boost::function &f, class tls_data (line 779) | class tls_data { method tls_data (line 781) | inline tls_data(size_t thread_id) : thread_id_(thread_id) { } method thread_id (line 782) | inline size_t thread_id() { return thread_id_; } method set_thread_id (line 783) | inline void set_thread_id(size_t t) { thread_id_ = t; } method any (line 784) | any& operator[](const size_t& id) { return local_data[id]; } method contains (line 785) | bool contains(const size_t& id) const { method erase (line 788) | size_t erase(const size_t& id) { method thread_id (line 808) | static inline size_t thread_id() { return get_tls_data().thread_id(); } method set_thread_id (line 812) | static inline void set_thread_id(size_t t) { get_tls_data().set_thre... method any (line 817) | static inline any& get_local(const size_t& id) { method contains (line 824) | static inline bool contains(const size_t& id) { method erase (line 832) | static inline size_t erase(const size_t& id){ type invoke_args (line 858) | struct invoke_args{ method invoke_args (line 861) | invoke_args(size_t m_thread_id, const boost::function ... method thread (line 873) | inline thread(size_t thread_id = 0) : method join (line 904) | inline void join() { method active (line 913) | inline bool active() const { method pthread_t (line 920) | inline pthread_t pthreadid() { type padded_integer (line 1009) | struct padded_integer { FILE: src/graphlab/parallel/queued_rwlock.hpp type graphlab (line 28) | namespace graphlab { class queued_rw_lock (line 41) | class queued_rw_lock{ type request (line 52) | struct request{ method queued_rw_lock (line 63) | queued_rw_lock(): tail(NULL), reader_count(0), next_writer(NULL) { } method writelock (line 65) | inline void writelock(request *I) { method wrunlock (line 94) | inline void wrunlock(request *I) { method readlock (line 108) | inline void readlock(request *I) { method rdunlock (line 156) | inline void rdunlock(request *I) { FILE: src/graphlab/parallel/thread_pool.cpp type graphlab (line 28) | namespace graphlab { FILE: src/graphlab/parallel/thread_pool.hpp type graphlab (line 34) | namespace graphlab { class thread_pool (line 56) | class thread_pool { method get_cpu_affinity (line 123) | bool get_cpu_affinity() { return cpu_affinity; } FILE: src/graphlab/rpc/async_consensus.cpp type graphlab (line 26) | namespace graphlab { FILE: src/graphlab/rpc/async_consensus.hpp type graphlab (line 34) | namespace graphlab { class async_consensus (line 95) | class async_consensus { method is_done (line 161) | bool is_done() const { type token (line 179) | struct token { method save (line 183) | void save(oarchive &oarc) const { method load (line 187) | void load(iarchive &iarc) { FILE: src/graphlab/rpc/buffered_exchange.hpp type graphlab (line 35) | namespace graphlab { class buffered_exchange (line 69) | class buffered_exchange { type buffer_record (line 74) | struct buffer_record { method buffer_record (line 77) | buffer_record() : proc(-1) { } type send_record (line 89) | struct send_record { method buffered_exchange (line 115) | buffered_exchange(distributed_control& dc, method send (line 151) | void send(const procid_t proc, const T& value, const size_t thread_i... method partial_flush (line 174) | void partial_flush(size_t thread_id) { method flush (line 193) | void flush() { method recv (line 224) | bool recv(procid_t& ret_proc, buffer_type& ret_buffer, method size (line 258) | size_t size() const { method empty (line 272) | bool empty() const { return recv_buffers.empty(); } method clear (line 274) | void clear() { } method barrier (line 276) | void barrier() { rpc.barrier(); } method rpc_recv (line 278) | void rpc_recv(size_t len, wild_pointer w) { method oarchive (line 306) | oarchive* swap_buffer(size_t index) { FILE: src/graphlab/rpc/caching_dht.hpp type graphlab (line 44) | namespace graphlab { type dc_impl (line 46) | namespace dc_impl { class lru_list (line 54) | class lru_list { method lru_list (line 65) | explicit lru_list(const KeyType& k = KeyType(), const ValueType &v... class caching_dht (line 79) | class caching_dht{ method caching_dht (line 120) | caching_dht(distributed_control &dc, method set (line 143) | void set(const KeyType& key, const ValueType &newval) { method get (line 161) | std::pair get(const KeyType &key) const { method get_cached (line 191) | std::pair get_cached(const KeyType &key) const { method invalidate (line 222) | void invalidate(const KeyType &key) const{ method cache_miss_rate (line 235) | double cache_miss_rate() { method num_gets (line 239) | size_t num_gets() const { method num_misses (line 242) | size_t num_misses() const { method cache_size (line 246) | size_t cache_size() const { method update_cache (line 255) | void update_cache(const KeyType &key, const ValueType &val) const{ method remove_lru (line 280) | void remove_lru() const{ FILE: src/graphlab/rpc/circular_char_buffer.cpp type graphlab (line 29) | namespace graphlab { function circular_char_buffer (line 55) | circular_char_buffer& FILE: src/graphlab/rpc/circular_char_buffer.hpp type graphlab (line 31) | namespace graphlab { class circular_char_buffer (line 38) | class circular_char_buffer { method consistency_check (line 131) | inline void consistency_check() const { method size (line 143) | inline std::streamsize size() const { method reserved_size (line 149) | inline std::streamsize reserved_size() const { method buffer_full (line 154) | inline bool buffer_full() const { type circular_char_buffer_source (line 177) | struct circular_char_buffer_source { method circular_char_buffer_source (line 178) | circular_char_buffer_source(circular_char_buffer &buf, type category (line 184) | struct category : public boost::iostreams::source_tag { } method optimal_buffer_size (line 189) | inline std::streamsize optimal_buffer_size() const { return 0; } method read (line 191) | inline std::streamsize read(char* s, std::streamsize n) { type circular_char_buffer_sink (line 202) | struct circular_char_buffer_sink { method circular_char_buffer_sink (line 203) | circular_char_buffer_sink(circular_char_buffer &buf):buf(buf) { } type category (line 207) | struct category: public boost::iostreams::sink_tag, method optimal_buffer_size (line 212) | inline std::streamsize optimal_buffer_size() const { return 0; } method write (line 214) | inline std::streamsize write(const char* s, std::streamsize n) { type circular_char_buffer_device (line 219) | struct circular_char_buffer_device { method circular_char_buffer_device (line 220) | circular_char_buffer_device(circular_char_buffer &buf):buf(buf) { } type category (line 224) | struct category : public boost::iostreams::bidirectional_device_tag, method optimal_buffer_size (line 229) | inline std::streamsize optimal_buffer_size() const { return 0; } method write (line 231) | inline std::streamsize write(const char* s, std::streamsize n) { method read (line 235) | inline std::streamsize read(char* s, std::streamsize n) { FILE: src/graphlab/rpc/circular_iovec_buffer.hpp type graphlab (line 29) | namespace graphlab{ type dc_impl (line 30) | namespace dc_impl { type circular_iovec_buffer (line 40) | struct circular_iovec_buffer { method circular_iovec_buffer (line 41) | inline circular_iovec_buffer(size_t len = 4096) { method empty (line 49) | inline bool empty() const { method size (line 53) | size_t size() const { method reserve (line 58) | void reserve(size_t _n) { method write (line 80) | inline void write(const std::vector& other, size_t nwrite) { method write (line 95) | inline void write(const iovec &entry) { method write (line 113) | inline void write(const iovec &entry, const iovec& actual_ptr_entr... method erase_from_head_and_free (line 127) | inline void erase_from_head_and_free() { method fill_msghdr (line 136) | void fill_msghdr(struct msghdr& data) { method sent (line 150) | void sent(size_t len) { type iovec (line 162) | struct iovec type iovec (line 163) | struct iovec FILE: src/graphlab/rpc/dc.cpp type graphlab (line 56) | namespace graphlab { type dc_impl (line 58) | namespace dc_impl { function thrlocal_send_buffer_key_deleter (line 67) | void thrlocal_send_buffer_key_deleter(void* p) { function procid_t (line 83) | procid_t distributed_control::get_instance_procid() { function distributed_control (line 87) | distributed_control* distributed_control::get_instance() { FILE: src/graphlab/rpc/dc.hpp type graphlab (line 59) | namespace graphlab { type dc_init_param (line 74) | struct dc_init_param{ method dc_init_param (line 113) | dc_init_param(size_t numhandlerthreads = RPC_DEFAULT_NUMHANDLERTHREADS, class dc_services (line 123) | class dc_services type dc_impl (line 125) | namespace dc_impl { class dc_buffered_stream_send2 (line 126) | class dc_buffered_stream_send2 class dc_stream_receive (line 127) | class dc_stream_receive class distributed_control (line 200) | class distributed_control{ type function_call_block (line 204) | struct function_call_block{ method function_call_block (line 205) | function_call_block() {} method function_call_block (line 207) | function_call_block(char* data, size_t len, type fcallqueue_entry (line 235) | struct fcallqueue_entry { method distributed_control (line 276) | distributed_control& operator=(const distributed_control& dc) { retu... method num_registered_objects (line 281) | volatile inline size_t num_registered_objects() { method num_handler_threads (line 333) | inline size_t num_handler_threads() const { method procid_t (line 344) | inline procid_t procid() const { method procid_t (line 349) | inline procid_t numprocs() const { method set_fast_track_requests (line 357) | bool set_fast_track_requests(bool val) { method fast_track_requests (line 364) | bool fast_track_requests() { method register_deletion_callback (line 375) | void register_deletion_callback(boost::function deleter) { method recv_queue_length (line 823) | size_t recv_queue_length() const { method send_queue_length (line 827) | size_t send_queue_length() const { method inc_calls_sent (line 834) | inline void inc_calls_sent(procid_t procid) { method inc_calls_received (line 839) | inline void inc_calls_received(procid_t procid) { method calls_sent (line 881) | inline size_t calls_sent() const { method mega_calls_sent (line 890) | inline double mega_calls_sent() const { method calls_received (line 901) | inline size_t calls_received() const { method bytes_sent (line 912) | inline size_t bytes_sent() const { method network_bytes_sent (line 921) | inline size_t network_bytes_sent() const { method network_megabytes_sent (line 928) | inline double network_megabytes_sent() const { method bytes_received (line 937) | inline size_t bytes_received() const { method register_object (line 948) | inline size_t register_object(void* v, dc_impl::dc_dist_object_base ... method clear_registered_object (line 970) | inline void clear_registered_object(size_t id) { method register_send_buffer (line 975) | inline void register_send_buffer(dc_impl::thread_local_buffer* buffe... method unregister_send_buffer (line 981) | inline void unregister_send_buffer(dc_impl::thread_local_buffer* buf... method write_to_buffer (line 1012) | inline void write_to_buffer(procid_t target, char* c, size_t len) { type collected_statistics (line 1381) | struct collected_statistics { method collected_statistics (line 1385) | collected_statistics(): callssent(0), bytessent(0), network_bytess... method save (line 1386) | void save(oarchive &oarc) const { method load (line 1389) | void load(iarchive &iarc) { type graphlab (line 1413) | namespace graphlab { type dc_init_param (line 74) | struct dc_init_param{ method dc_init_param (line 113) | dc_init_param(size_t numhandlerthreads = RPC_DEFAULT_NUMHANDLERTHREADS, class dc_services (line 123) | class dc_services type dc_impl (line 125) | namespace dc_impl { class dc_buffered_stream_send2 (line 126) | class dc_buffered_stream_send2 class dc_stream_receive (line 127) | class dc_stream_receive class distributed_control (line 200) | class distributed_control{ type function_call_block (line 204) | struct function_call_block{ method function_call_block (line 205) | function_call_block() {} method function_call_block (line 207) | function_call_block(char* data, size_t len, type fcallqueue_entry (line 235) | struct fcallqueue_entry { method distributed_control (line 276) | distributed_control& operator=(const distributed_control& dc) { retu... method num_registered_objects (line 281) | volatile inline size_t num_registered_objects() { method num_handler_threads (line 333) | inline size_t num_handler_threads() const { method procid_t (line 344) | inline procid_t procid() const { method procid_t (line 349) | inline procid_t numprocs() const { method set_fast_track_requests (line 357) | bool set_fast_track_requests(bool val) { method fast_track_requests (line 364) | bool fast_track_requests() { method register_deletion_callback (line 375) | void register_deletion_callback(boost::function deleter) { method recv_queue_length (line 823) | size_t recv_queue_length() const { method send_queue_length (line 827) | size_t send_queue_length() const { method inc_calls_sent (line 834) | inline void inc_calls_sent(procid_t procid) { method inc_calls_received (line 839) | inline void inc_calls_received(procid_t procid) { method calls_sent (line 881) | inline size_t calls_sent() const { method mega_calls_sent (line 890) | inline double mega_calls_sent() const { method calls_received (line 901) | inline size_t calls_received() const { method bytes_sent (line 912) | inline size_t bytes_sent() const { method network_bytes_sent (line 921) | inline size_t network_bytes_sent() const { method network_megabytes_sent (line 928) | inline double network_megabytes_sent() const { method bytes_received (line 937) | inline size_t bytes_received() const { method register_object (line 948) | inline size_t register_object(void* v, dc_impl::dc_dist_object_base ... method clear_registered_object (line 970) | inline void clear_registered_object(size_t id) { method register_send_buffer (line 975) | inline void register_send_buffer(dc_impl::thread_local_buffer* buffe... method unregister_send_buffer (line 981) | inline void unregister_send_buffer(dc_impl::thread_local_buffer* buf... method write_to_buffer (line 1012) | inline void write_to_buffer(procid_t target, char* c, size_t len) { type collected_statistics (line 1381) | struct collected_statistics { method collected_statistics (line 1385) | collected_statistics(): callssent(0), bytessent(0), network_bytess... method save (line 1386) | void save(oarchive &oarc) const { method load (line 1389) | void load(iarchive &iarc) { FILE: src/graphlab/rpc/dc_buffered_stream_send2.cpp type graphlab (line 30) | namespace graphlab { type dc_impl (line 31) | namespace dc_impl { FILE: src/graphlab/rpc/dc_buffered_stream_send2.hpp type graphlab (line 38) | namespace graphlab { class distributed_control (line 39) | class distributed_control type dc_impl (line 41) | namespace dc_impl { class dc_buffered_stream_send2 (line 64) | class dc_buffered_stream_send2: public dc_send{ method dc_buffered_stream_send2 (line 66) | dc_buffered_stream_send2(distributed_control* dc, FILE: src/graphlab/rpc/dc_comm_base.hpp type graphlab (line 34) | namespace graphlab { type dc_impl (line 35) | namespace dc_impl { class dc_comm_base (line 43) | class dc_comm_base { method dc_comm_base (line 46) | inline dc_comm_base() { } FILE: src/graphlab/rpc/dc_dist_object.hpp type graphlab (line 49) | namespace graphlab { class dc_dist_object (line 115) | class dc_dist_object : public dc_impl::dc_dist_object_base{ method inc_calls_received (line 137) | void inc_calls_received(procid_t p) { method inc_calls_sent (line 177) | void inc_calls_sent(procid_t p) { method inc_bytes_sent (line 182) | void inc_bytes_sent(procid_t p, size_t bytes) { method get_obj_id (line 187) | size_t get_obj_id() const { method dc_dist_object (line 203) | dc_dist_object(distributed_control &dc_, T* owner): method calls_received (line 255) | size_t calls_received() const { method calls_sent (line 264) | size_t calls_sent() const { method bytes_sent (line 275) | size_t bytes_sent() const { method distributed_control (line 284) | distributed_control& dc() { method distributed_control (line 289) | const distributed_control& dc() const { method procid_t (line 294) | inline procid_t procid() const { method procid_t (line 299) | inline procid_t numprocs() const { method BOOST_PP_REPEAT (line 367) | BOOST_PP_REPEAT(7, RPC_INTERFACE_GENERATOR, (control_call,dc_impl::o... method split_call_end (line 402) | void split_call_end(procid_t target, oarchive* oarc) { method split_call_cancel (line 411) | void split_call_cancel(oarchive* oarc) { method block_and_wait_for_recv (line 779) | void block_and_wait_for_recv(size_t src, method send_to (line 796) | void send_to(procid_t target, U& t, bool control = false) { method recv_from (line 825) | void recv_from(procid_t source, U& t, bool control = false) { method set_broadcast_receive (line 869) | void set_broadcast_receive(const std::string &s) { method broadcast (line 878) | void broadcast(U& data, bool originator, bool control = false) { method set_gather_receive (line 929) | void set_gather_receive(procid_t source, const std::string &s, size_... method gather (line 937) | void gather(std::vector& data, procid_t sendto, bool control = fa... method __ab_child_to_parent_barrier_trigger (line 1003) | void __ab_child_to_parent_barrier_trigger(procid_t source, std::stri... method __ab_parent_to_child_barrier_release (line 1018) | void __ab_parent_to_child_barrier_release(int releaseval, method all_gather (line 1052) | void all_gather(std::vector& data, bool control = false) { method all_reduce2 (line 1184) | void all_reduce2(U& data, PlusEqual plusequal, bool control = false) { type default_plus_equal (line 1287) | struct default_plus_equal { method all_reduce (line 1295) | void all_reduce(U& data, bool control = false) { method all_to_all (line 1307) | void all_to_all(std::vector& data, bool control = false) { method __child_to_parent_barrier_trigger (line 1376) | void __child_to_parent_barrier_trigger(procid_t source) { method __parent_to_child_barrier_release (line 1390) | void __parent_to_child_barrier_release(int releaseval) { method barrier (line 1410) | void barrier() { method full_barrier (line 1480) | void full_barrier() { type collected_statistics (line 1531) | struct collected_statistics { method collected_statistics (line 1534) | collected_statistics(): callssent(0), bytessent(0) { } method save (line 1535) | void save(oarchive &oarc) const { method load (line 1538) | void load(iarchive &iarc) { method gather_statistics (line 1546) | std::map gather_statistics() { FILE: src/graphlab/rpc/dc_dist_object_base.hpp type graphlab (line 28) | namespace graphlab { type dc_impl (line 30) | namespace dc_impl { class dc_dist_object_base (line 36) | class dc_dist_object_base{ FILE: src/graphlab/rpc/dc_init_from_env.cpp type graphlab (line 31) | namespace graphlab { function init_param_from_env (line 33) | bool init_param_from_env(dc_init_param& param) { FILE: src/graphlab/rpc/dc_init_from_env.hpp type graphlab (line 27) | namespace graphlab { FILE: src/graphlab/rpc/dc_init_from_mpi.cpp type graphlab (line 37) | namespace graphlab { function init_param_from_mpi (line 39) | bool init_param_from_mpi(dc_init_param& param,dc_comm_type commtype) { FILE: src/graphlab/rpc/dc_init_from_mpi.hpp type graphlab (line 27) | namespace graphlab { FILE: src/graphlab/rpc/dc_init_from_zookeeper.cpp type graphlab (line 36) | namespace graphlab { function zk_callback (line 38) | void zk_callback(zookeeper::server_list* slist, function init_param_from_zookeeper (line 55) | bool init_param_from_zookeeper(dc_init_param& param) { FILE: src/graphlab/rpc/dc_init_from_zookeeper.hpp type graphlab (line 27) | namespace graphlab { FILE: src/graphlab/rpc/dc_internal_types.hpp type graphlab (line 32) | namespace graphlab { class distributed_control (line 33) | class distributed_control type dc_impl (line 35) | namespace dc_impl { type packet_hdr (line 74) | struct packet_hdr { function charstring_free (line 91) | inline void charstring_free(T& t) { } type recv_from_struct (line 109) | struct recv_from_struct { method recv_from_struct (line 110) | inline recv_from_struct():tag(0), hasdata(false) { } type terminator_token (line 125) | struct terminator_token { method terminator_token (line 126) | terminator_token():calls_sent(0),calls_recv(0),terminate(false) { } method terminator_token (line 127) | terminator_token(size_t sent, size_t recv):calls_sent(sent), type buffer_elem (line 139) | struct buffer_elem { FILE: src/graphlab/rpc/dc_packet_mask.hpp type graphlab (line 26) | namespace graphlab { FILE: src/graphlab/rpc/dc_receive.hpp type graphlab (line 29) | namespace graphlab { type dc_impl (line 30) | namespace dc_impl { class dc_receive (line 43) | class dc_receive { method dc_receive (line 45) | dc_receive() { } FILE: src/graphlab/rpc/dc_send.hpp type graphlab (line 34) | namespace graphlab { type dc_impl (line 35) | namespace dc_impl { class dc_send (line 47) | class dc_send{ method dc_send (line 49) | dc_send() { } method set_option (line 80) | virtual size_t set_option(std::string opt, size_t val) { method write_packet_header (line 97) | inline static size_t write_packet_header(oarchive& oarc, FILE: src/graphlab/rpc/dc_services.hpp type graphlab (line 32) | namespace graphlab { class dc_services (line 45) | class dc_services { method dc_services (line 50) | dc_services(distributed_control &dc):rmi(dc, this) { } method send_to (line 66) | inline void send_to(procid_t target, U& t, bool control = false) { method recv_from (line 74) | inline void recv_from(procid_t source, U& t, bool control = false) { method broadcast (line 82) | inline void broadcast(U& data, bool originator, bool control = false) { method gather (line 90) | inline void gather(std::vector& data, procid_t sendto, bool contr... method all_gather (line 98) | inline void all_gather(std::vector& data, bool control = false) { method all_reduce (line 106) | inline void all_reduce(U& data, bool control = false) { method all_reduce2 (line 112) | void all_reduce2(U& data, PlusEqual plusequal, bool control = false) { method barrier (line 117) | inline void barrier() { method full_barrier (line 123) | inline void full_barrier() { FILE: src/graphlab/rpc/dc_stream_receive.cpp type graphlab (line 32) | namespace graphlab { type dc_impl (line 33) | namespace dc_impl { FILE: src/graphlab/rpc/dc_stream_receive.hpp type graphlab (line 35) | namespace graphlab { class distributed_control (line 36) | class distributed_control type dc_impl (line 38) | namespace dc_impl { class dc_stream_receive (line 50) | class dc_stream_receive: public dc_receive{ method dc_stream_receive (line 53) | dc_stream_receive(distributed_control* dc, procid_t associated_proc): FILE: src/graphlab/rpc/dc_tcp_comm.cpp type graphlab (line 58) | namespace graphlab { type dc_impl (line 60) | namespace dc_impl { type hostent (line 108) | struct hostent type timeval (line 194) | struct timeval type in_addr (line 429) | struct in_addr function on_receive_event (line 553) | void on_receive_event(int fd, short ev, void* arg) { type event_base (line 587) | struct event_base function process_sock (line 604) | inline void process_sock(dc_tcp_comm::socket_info* sockinfo) { function on_send_event (line 619) | void on_send_event(int fd, short ev, void* arg) { type event_base (line 646) | struct event_base FILE: src/graphlab/rpc/dc_tcp_comm.hpp type graphlab (line 47) | namespace graphlab { type dc_impl (line 48) | namespace dc_impl { class dc_tcp_comm (line 61) | class dc_tcp_comm:public dc_comm_base { method dc_tcp_comm (line 66) | inline dc_tcp_comm() { method capabilities (line 71) | size_t capabilities() const { method channel_active (line 103) | inline bool channel_active(size_t target) const { method procid_t (line 111) | inline procid_t numprocs() const { method procid_t (line 119) | inline procid_t procid() const { method network_bytes_sent (line 126) | inline size_t network_bytes_sent() const { method network_bytes_received (line 133) | inline size_t network_bytes_received() const { method send_queue_length (line 137) | inline size_t send_queue_length() const { type initial_message (line 195) | struct initial_message { type socket_info (line 203) | struct socket_info{ type event (line 208) | struct event type event (line 209) | struct event type msghdr (line 214) | struct msghdr type timeout_event (line 220) | struct timeout_event { type event_base (line 246) | struct event_base type event_base (line 250) | struct event_base type event_base (line 255) | struct event_base type event_base (line 257) | struct event_base type event (line 258) | struct event type event (line 259) | struct event FILE: src/graphlab/rpc/dc_thread_get_send_buffer.hpp type graphlab (line 13) | namespace graphlab { type dc_impl (line 14) | namespace dc_impl { function oarchive (line 22) | inline oarchive* get_thread_local_buffer(procid_t target) { function release_thread_local_buffer (line 36) | inline void release_thread_local_buffer(procid_t target, function write_thread_local_buffer (line 47) | inline void write_thread_local_buffer(procid_t target, function push_flush_thread_local_buffer (line 61) | inline void push_flush_thread_local_buffer() { function pull_flush_thread_local_buffer (line 70) | inline void pull_flush_thread_local_buffer(procid_t proc) { function pull_flush_soon_thread_local_buffer (line 79) | inline void pull_flush_soon_thread_local_buffer(procid_t proc) { function pull_flush_soon_thread_local_buffer (line 90) | inline void pull_flush_soon_thread_local_buffer() { function procid_t (line 103) | inline procid_t _get_procid() { function procid_t (line 118) | inline procid_t _get_sequentialization_key() { FILE: src/graphlab/rpc/dc_types.hpp type graphlab (line 28) | namespace graphlab { type dc_comm_type (line 37) | enum dc_comm_type { type wild_pointer (line 49) | struct wild_pointer { method load (line 52) | void load(iarchive& iarc) { FILE: src/graphlab/rpc/delta_dht.cpp type graphlab (line 39) | namespace graphlab { type delta_dht_impl (line 40) | namespace delta_dht_impl { function destroy_tls_data (line 44) | void destroy_tls_data(void* ptr) { type tls_key_creator (line 58) | struct tls_key_creator { method tls_key_creator (line 60) | tls_key_creator() : TLS_KEY(0) { function icache (line 66) | icache*& get_icache_ptr(const void* dht_ptr) { FILE: src/graphlab/rpc/delta_dht.hpp type graphlab (line 50) | namespace graphlab { type delta_dht_impl (line 52) | namespace delta_dht_impl { type icache (line 53) | struct icache { virtual ~icache() { } } type delta_predicate (line 58) | namespace delta_predicate { type uses (line 60) | struct uses { method uses (line 62) | uses(size_t max_uses = 100) : max_uses(max_uses) { } class delta_dht (line 80) | class delta_dht { type cache_entry (line 90) | struct cache_entry { method cache_entry (line 94) | cache_entry(const value_type& value = value_type()) : method delta_dht (line 134) | delta_dht(distributed_control& dc, method set_max_uses (line 143) | void set_max_uses(size_t max) { max_uses = max; } method cache_local (line 145) | size_t cache_local() const { return local.value; } method cache_hits (line 146) | size_t cache_hits() const { return hits.value; } method cache_misses (line 147) | size_t cache_misses() const { return misses.value; } method background_syncs (line 148) | size_t background_syncs() const { return background_updates.value; } method cache_size (line 150) | size_t cache_size() const { method is_cached (line 157) | bool is_cached(const key_type& key) const { method value_type (line 165) | value_type operator[](const key_type& key) { method apply_delta (line 199) | void apply_delta(const key_type& key, const delta_type& delta) { method flush (line 227) | void flush() { method barrier_flush (line 240) | void barrier_flush() { method synchronize (line 246) | void synchronize() { method synchronize (line 263) | void synchronize(const key_type& key) { method owning_cpu (line 277) | size_t owning_cpu(const key_type& key) const { method is_local (line 284) | bool is_local(const key_type& key) const { method delta_type (line 289) | delta_type delta(const key_type& key) const { method local_size (line 303) | size_t local_size() const { method size (line 311) | size_t size() const { method numprocs (line 320) | size_t numprocs() const { return rpc.num_procs(); } method procid (line 321) | size_t procid() const { return rpc.procid(); } method value_type (line 324) | value_type get_master(const key_type& key) { method send_delta (line 339) | void send_delta(const key_type& key, const delta_type& delta) { method send_delta_rpc (line 349) | void send_delta_rpc(const size_t& calling_procid, method send_delta_rpc_callback (line 361) | void send_delta_rpc_callback(const key_type& key, const value_type& ... FILE: src/graphlab/rpc/dht.hpp type graphlab (line 32) | namespace graphlab { class dht (line 39) | class dht { method dht (line 53) | dht(distributed_control &dc) : rpc(dc, this) { } method procid_t (line 58) | procid_t owner(const KeyType& key) const { method get (line 67) | std::pair get(const KeyType &key) const { method get_future (line 94) | request_future > get_future(const KeyType... method set (line 122) | void set(const KeyType &key, const ValueType &newval) { method print_stats (line 139) | void print_stats() const { method clear (line 147) | void clear() { FILE: src/graphlab/rpc/distributed_event_log.cpp type graphlab (line 38) | namespace graphlab { function time_to_index (line 52) | static size_t time_to_index(double t) { function index_to_time (line 56) | static double index_to_time(size_t t) { function event_log_thread_local_type (line 75) | event_log_thread_local_type* distributed_event_logger::get_thread_coun... function foreach (line 111) | foreach(size_t log, has_log_entry) { function foreach (line 134) | foreach(size_t log, has_log_entry) { function foreach (line 166) | foreach(size_t log, has_log_entry) { function foreach (line 207) | foreach(size_t log, has_log_entry) { function foreach (line 303) | foreach(size_t thr, thread_local_count_slots) { function foreach (line 306) | foreach(size_t log, has_log_entry) { function foreach (line 352) | foreach(size_t log, has_log_entry) { function foreach (line 393) | foreach(size_t log, has_log_entry) { function distributed_event_logger (line 465) | distributed_event_logger& get_event_log() { function metric_names_json (line 477) | std::pair function metric_aggregate_json (line 540) | std::pair function metric_by_machine_json (line 654) | std::pair FILE: src/graphlab/rpc/distributed_event_log.hpp type graphlab (line 36) | namespace graphlab { class dc_dist_object (line 42) | class dc_dist_object class distributed_control (line 43) | class distributed_control type log_entry (line 55) | struct log_entry: public IS_POD_TYPE { method log_entry (line 60) | explicit log_entry(double value = 0): value(value) { } type log_type (line 64) | namespace log_type { type log_type_enum (line 65) | enum log_type_enum { type log_group (line 72) | struct log_group{ type event_log_thread_local_type (line 105) | struct event_log_thread_local_type { class distributed_event_logger (line 116) | class distributed_event_logger { method get_current_time (line 228) | inline double get_current_time() const { method log_group (line 232) | inline log_group** get_logs_ptr() { FILE: src/graphlab/rpc/fiber_async_consensus.cpp type graphlab (line 26) | namespace graphlab { FILE: src/graphlab/rpc/fiber_async_consensus.hpp type graphlab (line 34) | namespace graphlab { class fiber_async_consensus (line 94) | class fiber_async_consensus { method is_done (line 160) | bool is_done() const { type token (line 178) | struct token { method save (line 182) | void save(oarchive &oarc) const { method load (line 186) | void load(iarchive &iarc) { FILE: src/graphlab/rpc/fiber_buffered_exchange.hpp type graphlab (line 35) | namespace graphlab { class fiber_buffered_exchange (line 88) | class fiber_buffered_exchange { type buffer_record (line 92) | struct buffer_record { method buffer_record (line 95) | buffer_record() : proc(-1) { } type send_record (line 109) | struct send_record { method flush_buffer (line 121) | void flush_buffer(size_t wid, procid_t proc) { method fiber_buffered_exchange (line 141) | fiber_buffered_exchange(distributed_control& dc, method send (line 176) | void send(const procid_t proc, const T& value) { method partial_flush (line 198) | void partial_flush() { method flush (line 208) | void flush() { method recv (line 226) | bool recv(std::vector& ret_buffer, method size (line 265) | size_t size() const { method empty (line 276) | bool empty() const { method clear (line 283) | void clear() { } method barrier (line 285) | void barrier() { rpc.barrier(); } method rpc_recv (line 287) | void rpc_recv(size_t len, wild_pointer w) { FILE: src/graphlab/rpc/function_broadcast_issue.hpp type graphlab (line 38) | namespace graphlab{ type dc_impl (line 39) | namespace dc_impl { FILE: src/graphlab/rpc/function_call_dispatch.hpp type graphlab (line 32) | namespace graphlab { type dc_impl (line 33) | namespace dc_impl { FILE: src/graphlab/rpc/function_call_issue.hpp type graphlab (line 39) | namespace graphlab{ type dc_impl (line 40) | namespace dc_impl { FILE: src/graphlab/rpc/function_ret_type.hpp type graphlab (line 28) | namespace graphlab { type dc_impl (line 29) | namespace dc_impl { type function_ret_type (line 45) | struct function_ret_type { type function_ret_type (line 64) | struct function_ret_type { type mem_function_ret_type (line 103) | struct mem_function_ret_type { type mem_function_ret_type (line 122) | struct mem_function_ret_type { type dc_impl (line 91) | namespace dc_impl { type function_ret_type (line 45) | struct function_ret_type { type function_ret_type (line 64) | struct function_ret_type { type mem_function_ret_type (line 103) | struct mem_function_ret_type { type mem_function_ret_type (line 122) | struct mem_function_ret_type { type graphlab (line 90) | namespace graphlab { type dc_impl (line 29) | namespace dc_impl { type function_ret_type (line 45) | struct function_ret_type { type function_ret_type (line 64) | struct function_ret_type { type mem_function_ret_type (line 103) | struct mem_function_ret_type { type mem_function_ret_type (line 122) | struct mem_function_ret_type { type dc_impl (line 91) | namespace dc_impl { type function_ret_type (line 45) | struct function_ret_type { type function_ret_type (line 64) | struct function_ret_type { type mem_function_ret_type (line 103) | struct mem_function_ret_type { type mem_function_ret_type (line 122) | struct mem_function_ret_type { FILE: src/graphlab/rpc/get_current_process_hash.cpp type graphlab (line 35) | namespace graphlab { type dc_impl (line 36) | namespace dc_impl { function get_current_process_hash (line 40) | std::string get_current_process_hash() { function get_current_process_hash (line 51) | std::string get_current_process_hash() { FILE: src/graphlab/rpc/get_current_process_hash.hpp type graphlab (line 27) | namespace graphlab { type dc_impl (line 28) | namespace dc_impl { FILE: src/graphlab/rpc/is_rpc_call.hpp type graphlab (line 41) | namespace graphlab { class distributed_control (line 42) | class distributed_control type dc_impl (line 43) | namespace dc_impl { type is_rpc_call_detail (line 45) | namespace is_rpc_call_detail { type less_than_2_args (line 52) | struct less_than_2_args { type get_args (line 64) | struct get_args{ type get_args (line 71) | struct get_args{ type get_args (line 78) | struct get_args{ type check_first_arg (line 86) | struct check_first_arg { type check_second_arg (line 91) | struct check_second_arg { type is_rpc_call (line 105) | struct is_rpc_call { FILE: src/graphlab/rpc/lazy_dht.hpp type graphlab (line 44) | namespace graphlab { class lazy_dht (line 62) | class lazy_dht{ type wait_struct (line 71) | struct wait_struct { method lazy_dht (line 88) | lazy_dht(distributed_control &dc, method set (line 112) | void set(const KeyType& key, const ValueType &newval) { method get_owned (line 119) | std::pair get_owned(const KeyType &key) const { method remote_get_owned (line 134) | void remote_get_owned(const KeyType &key, procid_t source, size_t pt... method get_reply (line 149) | void get_reply(size_t ptr, ValueType& val, bool hasvalue) { method get (line 163) | std::pair get(const KeyType &key) const { method get_cached (line 188) | std::pair get_cached(const KeyType &key) const { method invalidate (line 215) | void invalidate(const KeyType &key) const{ method cache_miss_rate (line 228) | double cache_miss_rate() { method num_gets (line 232) | size_t num_gets() const { method num_misses (line 235) | size_t num_misses() const { method cache_size (line 239) | size_t cache_size() const { method update_cache (line 267) | void update_cache(const KeyType &key, const ValueType &val) const{ method remove_lru (line 293) | void remove_lru() const{ FILE: src/graphlab/rpc/object_broadcast_issue.hpp type graphlab (line 38) | namespace graphlab{ type dc_impl (line 39) | namespace dc_impl { FILE: src/graphlab/rpc/object_call_dispatch.hpp type graphlab (line 32) | namespace graphlab { type dc_impl (line 33) | namespace dc_impl { FILE: src/graphlab/rpc/object_call_issue.hpp type graphlab (line 39) | namespace graphlab{ type dc_impl (line 40) | namespace dc_impl { class object_split_call (line 132) | class object_split_call { method oarchive (line 134) | static oarchive* split_call_begin(dc_dist_object_base* rmi, size_t... method split_call_cancel (line 152) | static void split_call_cancel(oarchive* oarc) { method split_call_end (line 164) | static void split_call_end(dc_dist_object_base* rmi, FILE: src/graphlab/rpc/object_request_dispatch.hpp type graphlab (line 41) | namespace graphlab { type dc_impl (line 42) | namespace dc_impl{ FILE: src/graphlab/rpc/object_request_issue.hpp type graphlab (line 41) | namespace graphlab { type dc_impl (line 42) | namespace dc_impl { FILE: src/graphlab/rpc/pod_template_structs.hpp type graphlab (line 29) | namespace graphlab { type dc_impl (line 30) | namespace dc_impl { type pod_template_detail (line 31) | namespace pod_template_detail { type pod_call_struct0 (line 34) | struct pod_call_struct0 : public IS_POD_TYPE{ type pod_call_struct1 (line 42) | struct pod_call_struct1 : public IS_POD_TYPE{ type pod_call_struct2 (line 51) | struct pod_call_struct2 : public IS_POD_TYPE{ type pod_call_struct3 (line 59) | struct pod_call_struct3 : public IS_POD_TYPE{ type pod_call_struct4 (line 69) | struct pod_call_struct4 : public IS_POD_TYPE{ type pod_call_struct5 (line 79) | struct pod_call_struct5 : public IS_POD_TYPE{ type pod_call_struct6 (line 89) | struct pod_call_struct6 : public IS_POD_TYPE{ type pod_call_struct7 (line 100) | struct pod_call_struct7 : public IS_POD_TYPE{ type pod_call_struct8 (line 111) | struct pod_call_struct8 : public IS_POD_TYPE{ FILE: src/graphlab/rpc/request_dispatch.hpp type graphlab (line 37) | namespace graphlab { type dc_impl (line 38) | namespace dc_impl{ FILE: src/graphlab/rpc/request_future.hpp type graphlab (line 32) | namespace graphlab { type request_future (line 65) | struct request_future { method request_future (line 72) | request_future(): method request_future (line 80) | request_future(dc_impl::ireply_container* container): method request_future (line 95) | request_future(const T& val): method request_future (line 101) | request_future(const request_future& val): method request_future (line 107) | request_future& operator=(const request_future& val) { method get_handle (line 118) | size_t get_handle() { method wait (line 125) | void wait() { method is_ready (line 140) | bool is_ready() { method result_type (line 148) | result_type& operator()() { type request_future (line 156) | struct request_future { method request_future (line 161) | request_future(): method request_future (line 165) | request_future(dc_impl::ireply_container* container): method request_future (line 169) | request_future(int val): method request_future (line 174) | request_future(const request_future& val): method request_future (line 178) | request_future& operator=(const request_future& val) { method is_ready (line 184) | bool is_ready() { method get_handle (line 189) | size_t get_handle() { method wait (line 193) | void wait() { method result_type (line 205) | result_type operator()() { FILE: src/graphlab/rpc/request_issue.hpp type graphlab (line 41) | namespace graphlab { type dc_impl (line 42) | namespace dc_impl { FILE: src/graphlab/rpc/request_reply_handler.cpp type graphlab (line 28) | namespace graphlab { function request_reply_handler (line 30) | void request_reply_handler(distributed_control &dc, procid_t src, FILE: src/graphlab/rpc/request_reply_handler.hpp type graphlab (line 30) | namespace graphlab { class distributed_control (line 32) | class distributed_control type dc_impl (line 34) | namespace dc_impl { type blob (line 41) | struct blob { method blob (line 43) | blob(char* c, size_t len):c(c),len(len) { } method blob (line 44) | blob():c(NULL), len(0){ } method save (line 51) | void save(oarchive& oarc) const { method load (line 57) | void load(iarchive& iarc) { method free (line 68) | void free() { type ireply_container (line 83) | struct ireply_container { method ireply_container (line 84) | ireply_container() { } type basic_reply_container (line 100) | struct basic_reply_container: public ireply_container{ method basic_reply_container (line 108) | basic_reply_container():valready(false) { } method receive (line 114) | void receive(procid_t source, blob b) { method wait (line 125) | inline void wait() { method ready (line 131) | inline bool ready() const { method blob (line 135) | blob& get_blob() { FILE: src/graphlab/rpc/sample_sort.hpp type graphlab (line 33) | namespace graphlab { type sample_sort_impl (line 35) | namespace sample_sort_impl { type pair_key_comparator (line 37) | struct pair_key_comparator { class sample_sort (line 46) | class sample_sort { method sample_sort (line 55) | sample_sort(distributed_control& dc): rmi(dc, this), key_exchange(dc... method sort (line 58) | void sort(KeyIterator kstart, KeyIterator kend, FILE: src/graphlab/rpc/thread_local_send_buffer.cpp type graphlab (line 3) | namespace graphlab { type dc_impl (line 4) | namespace dc_impl { function oarchive (line 86) | oarchive* thread_local_buffer::acquire(procid_t target) { FILE: src/graphlab/rpc/thread_local_send_buffer.hpp type graphlab (line 8) | namespace graphlab { class distributed_control (line 9) | class distributed_control type dc_impl (line 12) | namespace dc_impl { type thread_local_buffer (line 14) | struct thread_local_buffer { method get_bytes_sent (line 35) | inline size_t get_bytes_sent(procid_t target) { FILE: src/graphlab/scheduler/fifo_scheduler.cpp type graphlab (line 27) | namespace graphlab { function foreach (line 32) | foreach(std::string opt, keys) { FILE: src/graphlab/scheduler/fifo_scheduler.hpp type graphlab (line 40) | namespace graphlab { class fifo_scheduler (line 52) | class fifo_scheduler : public ischeduler { method print_options_help (line 101) | static void print_options_help(std::ostream& out) { FILE: src/graphlab/scheduler/get_message_priority.hpp type graphlab (line 29) | namespace graphlab { type scheduler_impl (line 31) | namespace scheduler_impl { type implements_priority_member (line 34) | struct implements_priority_member { type SFINAE (line 35) | struct SFINAE {} function get_message_priority (line 42) | typename boost::enable_if_c:... function get_message_priority (line 49) | typename boost::disable_if_c... FILE: src/graphlab/scheduler/ischeduler.hpp type graphlab (line 46) | namespace graphlab { type sched_status (line 52) | struct sched_status { type status_enum (line 54) | enum status_enum { class ischeduler (line 72) | class ischeduler { FILE: src/graphlab/scheduler/priority_scheduler.cpp type graphlab (line 26) | namespace graphlab { function foreach (line 31) | foreach(std::string opt, keys) { FILE: src/graphlab/scheduler/priority_scheduler.hpp type graphlab (line 42) | namespace graphlab { class priority_scheduler (line 54) | class priority_scheduler : public ischeduler { method print_options_help (line 100) | static void print_options_help(std::ostream& out) { FILE: src/graphlab/scheduler/queued_fifo_scheduler.cpp type graphlab (line 27) | namespace graphlab { function foreach (line 32) | foreach(std::string opt, keys) { FILE: src/graphlab/scheduler/queued_fifo_scheduler.hpp type graphlab (line 43) | namespace graphlab { class queued_fifo_scheduler (line 55) | class queued_fifo_scheduler: public ischeduler { method print_options_help (line 97) | static void print_options_help(std::ostream& out) { FILE: src/graphlab/scheduler/scheduler_factory.hpp type graphlab (line 36) | namespace graphlab { type scheduler_factory (line 42) | struct scheduler_factory { method ischeduler_type (line 49) | static ischeduler_type* method ischeduler_type (line 60) | static ischeduler_type* FILE: src/graphlab/scheduler/scheduler_list.cpp type graphlab (line 29) | namespace graphlab { function get_scheduler_names (line 31) | std::vector get_scheduler_names() { function get_scheduler_names_str (line 41) | std::string get_scheduler_names_str() { function add_line_breaks (line 54) | static std::string add_line_breaks(const std::string &s, size_t numcol... function print_scheduler_info (line 80) | void print_scheduler_info(std::string s, std::ostream &out) { FILE: src/graphlab/scheduler/scheduler_list.hpp type graphlab (line 54) | namespace graphlab { FILE: src/graphlab/scheduler/sweep_scheduler.cpp type graphlab (line 26) | namespace graphlab { function foreach (line 31) | foreach(std::string opt, keys) { FILE: src/graphlab/scheduler/sweep_scheduler.hpp type graphlab (line 38) | namespace graphlab { class sweep_scheduler (line 42) | class sweep_scheduler: public ischeduler { method print_options_help (line 73) | static void print_options_help(std::ostream &out) { method empty (line 82) | bool empty() { method get_and_inc_index (line 87) | inline size_t get_and_inc_index(const size_t cpuid) { FILE: src/graphlab/serialization/basic_types.hpp type graphlab (line 36) | namespace graphlab { class oarchive (line 37) | class oarchive class iarchive (line 38) | class iarchive type archive_detail (line 43) | namespace archive_detail { type serialize_impl (line 52) | struct serialize_impl { method exec (line 53) | static void exec(OutArcType& oarc, const char* const& s) { type serialize_impl (line 68) | struct serialize_impl { method exec (line 69) | static void exec(OutArcType& oarc, const char s[len] ) { type serialize_impl (line 80) | struct serialize_impl { method exec (line 81) | static void exec(OutArcType& oarc, char* const& s) { type deserialize_impl (line 93) | struct deserialize_impl { method exec (line 94) | static void exec(InArcType& iarc, char*& s) { type deserialize_impl (line 107) | struct deserialize_impl { method exec (line 108) | static void exec(InArcType& iarc, char s[len]) { type serialize_impl (line 121) | struct serialize_impl { method exec (line 122) | static void exec(OutArcType& oarc, const std::string& s) { type deserialize_impl (line 134) | struct deserialize_impl { method exec (line 135) | static void exec(InArcType& iarc, std::string& s) { type serialize_impl, false > (line 148) | struct serialize_impl, false > { method exec (line 149) | static void exec(OutArcType& oarc, const std::pair& s) { type deserialize_impl, false > (line 157) | struct deserialize_impl, false > { method exec (line 158) | static void exec(InArcType& iarc, std::pair& s) { type serialize_impl (line 171) | struct serialize_impl { method exec (line 172) | static void exec(OutArcType& oarc, const unsigned long & s) { type deserialize_impl (line 205) | struct deserialize_impl { method exec (line 206) | static void exec(InArcType& iarc, unsigned long & s) { type graphlab (line 42) | namespace graphlab { class oarchive (line 37) | class oarchive class iarchive (line 38) | class iarchive type archive_detail (line 43) | namespace archive_detail { type serialize_impl (line 52) | struct serialize_impl { method exec (line 53) | static void exec(OutArcType& oarc, const char* const& s) { type serialize_impl (line 68) | struct serialize_impl { method exec (line 69) | static void exec(OutArcType& oarc, const char s[len] ) { type serialize_impl (line 80) | struct serialize_impl { method exec (line 81) | static void exec(OutArcType& oarc, char* const& s) { type deserialize_impl (line 93) | struct deserialize_impl { method exec (line 94) | static void exec(InArcType& iarc, char*& s) { type deserialize_impl (line 107) | struct deserialize_impl { method exec (line 108) | static void exec(InArcType& iarc, char s[len]) { type serialize_impl (line 121) | struct serialize_impl { method exec (line 122) | static void exec(OutArcType& oarc, const std::string& s) { type deserialize_impl (line 134) | struct deserialize_impl { method exec (line 135) | static void exec(InArcType& iarc, std::string& s) { type serialize_impl, false > (line 148) | struct serialize_impl, false > { method exec (line 149) | static void exec(OutArcType& oarc, const std::pair& s) { type deserialize_impl, false > (line 157) | struct deserialize_impl, false > { method exec (line 158) | static void exec(InArcType& iarc, std::pair& s) { type serialize_impl (line 171) | struct serialize_impl { method exec (line 172) | static void exec(OutArcType& oarc, const unsigned long & s) { type deserialize_impl (line 205) | struct deserialize_impl { method exec (line 206) | static void exec(InArcType& iarc, unsigned long & s) { FILE: src/graphlab/serialization/conditional_serialize.hpp type graphlab (line 28) | namespace graphlab { type conditional_serialize (line 31) | struct conditional_serialize { method conditional_serialize (line 35) | conditional_serialize(): hasval(false) { } method conditional_serialize (line 36) | conditional_serialize(T& val): hasval(true), val(val) { } method conditional_serialize (line 38) | conditional_serialize(const conditional_serialize& cs): hasval(cs.ha... method conditional_serialize (line 39) | conditional_serialize& operator=(const conditional_serialize& cs) { method save (line 44) | void save(oarchive& oarc) const { method load (line 49) | void load(iarchive& iarc) { FILE: src/graphlab/serialization/has_load.hpp type graphlab (line 30) | namespace graphlab { type archive_detail (line 31) | namespace archive_detail { type has_load_method (line 40) | struct has_load_method type SFINAE (line 42) | struct SFINAE {} function load_or_fail (line 58) | typename boost::enable_if_c::val... function load_or_fail (line 73) | typename boost::disable_if_c::va... FILE: src/graphlab/serialization/has_save.hpp type graphlab (line 30) | namespace graphlab { type archive_detail (line 31) | namespace archive_detail { type has_save_method (line 40) | struct has_save_method type SFINAE (line 42) | struct SFINAE {} function save_or_fail (line 58) | typename boost::enable_if_c::val... function save_or_fail (line 73) | typename boost::disable_if_c::va... FILE: src/graphlab/serialization/iarchive.hpp type graphlab (line 37) | namespace graphlab { class iarchive (line 77) | class iarchive { method read_char (line 85) | inline char read_char() { method read (line 100) | inline void read(char* c, size_t l) { method fail (line 111) | inline bool fail() { method iarchive (line 121) | inline iarchive(std::istream& instream) method iarchive (line 124) | inline iarchive(const char* buf, size_t len) class iarchive_soft_fail (line 139) | class iarchive_soft_fail{ method read_char (line 146) | inline char read_char() { method read (line 154) | inline void read(char* c, size_t len) { method fail (line 159) | inline bool fail() { method iarchive_soft_fail (line 169) | inline iarchive_soft_fail(std::istream &instream) method iarchive_soft_fail (line 176) | inline iarchive_soft_fail(iarchive &iarc) type archive_detail (line 183) | namespace archive_detail { type deserialize_hard_or_soft_fail (line 187) | struct deserialize_hard_or_soft_fail { method exec (line 188) | inline static void exec(InArcType& iarc, T& t) { type deserialize_hard_or_soft_fail (line 195) | struct deserialize_hard_or_soft_fail { method exec (line 196) | inline static void exec(iarchive_soft_fail& iarc, T& t) { type deserialize_impl (line 209) | struct deserialize_impl { method exec (line 210) | inline static void exec(InArcType& iarc, T& t) { type deserialize_impl (line 217) | struct deserialize_impl{ method exec (line 218) | inline static void exec(InArcType& iarc, T &t) { function iarchive (line 232) | inline iarchive& operator>>(iarchive& iarc, T &t) { method read_char (line 85) | inline char read_char() { method read (line 100) | inline void read(char* c, size_t l) { method fail (line 111) | inline bool fail() { method iarchive (line 121) | inline iarchive(std::istream& instream) method iarchive (line 124) | inline iarchive(const char* buf, size_t len) function iarchive_soft_fail (line 245) | inline iarchive_soft_fail& operator>>(iarchive_soft_fail& iarc, T &t) { method read_char (line 146) | inline char read_char() { method read (line 154) | inline void read(char* c, size_t len) { method fail (line 159) | inline bool fail() { method iarchive_soft_fail (line 169) | inline iarchive_soft_fail(std::istream &instream) method iarchive_soft_fail (line 176) | inline iarchive_soft_fail(iarchive &iarc) function iarchive (line 256) | inline iarchive& deserialize(iarchive& iarc, method read_char (line 85) | inline char read_char() { method read (line 100) | inline void read(char* c, size_t l) { method fail (line 111) | inline bool fail() { method iarchive (line 121) | inline iarchive(std::istream& instream) method iarchive (line 124) | inline iarchive(const char* buf, size_t len) function iarchive_soft_fail (line 269) | inline iarchive_soft_fail& deserialize(iarchive_soft_fail& iarc, method read_char (line 146) | inline char read_char() { method read (line 154) | inline void read(char* c, size_t len) { method fail (line 159) | inline bool fail() { method iarchive_soft_fail (line 169) | inline iarchive_soft_fail(std::istream &instream) method iarchive_soft_fail (line 176) | inline iarchive_soft_fail(iarchive &iarc) FILE: src/graphlab/serialization/is_pod.hpp type graphlab (line 28) | namespace graphlab { type IS_POD_TYPE (line 34) | struct IS_POD_TYPE { } type gl_is_pod (line 46) | struct gl_is_pod{ type gl_is_pod_or_scaler (line 75) | struct gl_is_pod_or_scaler{ FILE: src/graphlab/serialization/iterator.hpp type graphlab (line 31) | namespace graphlab { function serialize_iterator (line 54) | void serialize_iterator(OutArcType& oarc, RandomAccessIterator begin, function serialize_iterator (line 85) | void serialize_iterator(OutArcType& oarc, InputIterator begin, function deserialize_iterator (line 118) | void deserialize_iterator(InArcType& iarc, OutputIterator result) { FILE: src/graphlab/serialization/list.hpp type graphlab (line 34) | namespace graphlab { type archive_detail (line 35) | namespace archive_detail { type serialize_impl, false > (line 38) | struct serialize_impl, false > { method exec (line 39) | static void exec(OutArcType& oarc, const std::list& vec){ type deserialize_impl, false > (line 46) | struct deserialize_impl, false > { method exec (line 47) | static void exec(InArcType& iarc, std::list& vec){ FILE: src/graphlab/serialization/map.hpp type graphlab (line 32) | namespace graphlab { type archive_detail (line 34) | namespace archive_detail { type serialize_impl, false > (line 37) | struct serialize_impl, false > { method exec (line 38) | static void exec(OutArcType& oarc, const std::map& vec){ type deserialize_impl, false > (line 47) | struct deserialize_impl, false > { method exec (line 48) | static void exec(InArcType& iarc, std::map& vec){ FILE: src/graphlab/serialization/oarchive.hpp type graphlab (line 39) | namespace graphlab { class oarchive (line 86) | class oarchive{ method oarchive (line 93) | inline oarchive(std::ostream& outstream) method oarchive (line 96) | inline oarchive(void) method expand_buf (line 99) | inline void expand_buf(size_t s) { method write (line 108) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 118) | inline void direct_assign(const T& t) { method advance (line 129) | inline void advance(size_t s) { method fail (line 139) | inline bool fail() { class oarchive_soft_fail (line 154) | class oarchive_soft_fail { method oarchive_soft_fail (line 160) | inline oarchive_soft_fail(std::ostream& outstream) method oarchive_soft_fail (line 163) | inline oarchive_soft_fail(oarchive& oarc):oarc(&oarc), mine(false) { method oarchive_soft_fail (line 166) | inline oarchive_soft_fail(void) method write (line 172) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 176) | inline void direct_assign(const T& t) { method fail (line 180) | inline bool fail() { type archive_detail (line 189) | namespace archive_detail { type serialize_hard_or_soft_fail (line 193) | struct serialize_hard_or_soft_fail { method exec (line 194) | inline static void exec(OutArcType& oarc, const T& t) { type serialize_hard_or_soft_fail (line 201) | struct serialize_hard_or_soft_fail { method exec (line 202) | inline static void exec(oarchive_soft_fail& oarc, const T& t) { type serialize_impl (line 218) | struct serialize_impl { method exec (line 219) | static void exec(OutArcType& oarc, const T& t) { type serialize_impl (line 226) | struct serialize_impl { method exec (line 227) | inline static void exec(OutArcType& oarc, const T& t) { type serialize_impl (line 237) | struct serialize_impl { method exec (line 238) | inline static void exec(OutArcType& oarc, const T& t) { type serialize_impl (line 247) | struct serialize_impl { method exec (line 248) | inline static void exec(OutArcType& oarc, const T& t) { function oarchive (line 263) | inline oarchive& operator<<(oarchive& oarc, const T& t) { method oarchive (line 93) | inline oarchive(std::ostream& outstream) method oarchive (line 96) | inline oarchive(void) method expand_buf (line 99) | inline void expand_buf(size_t s) { method write (line 108) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 118) | inline void direct_assign(const T& t) { method advance (line 129) | inline void advance(size_t s) { method fail (line 139) | inline bool fail() { function oarchive_soft_fail (line 276) | inline oarchive_soft_fail& operator<<(oarchive_soft_fail& oarc, method oarchive_soft_fail (line 160) | inline oarchive_soft_fail(std::ostream& outstream) method oarchive_soft_fail (line 163) | inline oarchive_soft_fail(oarchive& oarc):oarc(&oarc), mine(false) { method oarchive_soft_fail (line 166) | inline oarchive_soft_fail(void) method write (line 172) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 176) | inline void direct_assign(const T& t) { method fail (line 180) | inline bool fail() { function oarchive (line 288) | inline oarchive& serialize(oarchive& oarc, method oarchive (line 93) | inline oarchive(std::ostream& outstream) method oarchive (line 96) | inline oarchive(void) method expand_buf (line 99) | inline void expand_buf(size_t s) { method write (line 108) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 118) | inline void direct_assign(const T& t) { method advance (line 129) | inline void advance(size_t s) { method fail (line 139) | inline bool fail() { function oarchive_soft_fail (line 302) | inline oarchive_soft_fail& serialize(oarchive_soft_fail& oarc, method oarchive_soft_fail (line 160) | inline oarchive_soft_fail(std::ostream& outstream) method oarchive_soft_fail (line 163) | inline oarchive_soft_fail(oarchive& oarc):oarc(&oarc), mine(false) { method oarchive_soft_fail (line 166) | inline oarchive_soft_fail(void) method write (line 172) | inline void write(const char* c, std::streamsize s) { method direct_assign (line 176) | inline void direct_assign(const T& t) { method fail (line 180) | inline bool fail() { FILE: src/graphlab/serialization/serializable_concept.hpp type graphlab (line 31) | namespace graphlab { class Serializable (line 43) | class Serializable : boost::Assignable, boost::DefaultConstructible... method BOOST_CONCEPT_USAGE (line 45) | BOOST_CONCEPT_USAGE(Serializable) { FILE: src/graphlab/serialization/serialize_to_from_string.hpp type graphlab (line 29) | namespace graphlab { function serialize_to_string (line 46) | inline std::string serialize_to_string(const T &t) { function deserialize_from_string (line 72) | inline void deserialize_from_string(const std::string &s, T &t) { FILE: src/graphlab/serialization/set.hpp type graphlab (line 32) | namespace graphlab { type archive_detail (line 33) | namespace archive_detail { type serialize_impl, false > (line 36) | struct serialize_impl, false > { method exec (line 37) | static void exec(OutArcType& oarc, const std::set& vec){ type deserialize_impl, false > (line 45) | struct deserialize_impl, false > { method exec (line 46) | static void exec(InArcType& iarc, std::set& vec){ FILE: src/graphlab/serialization/unordered_map.hpp type graphlab (line 32) | namespace graphlab { type archive_detail (line 34) | namespace archive_detail { type serialize_impl, false > (line 37) | struct serialize_impl, false > { method exec (line 38) | static void exec(OutArcType& oarc, type deserialize_impl, false > (line 48) | struct deserialize_impl, false > { method exec (line 49) | static void exec(InArcType& iarc, boost::unordered_map& vec){ FILE: src/graphlab/serialization/unordered_set.hpp type graphlab (line 32) | namespace graphlab { type archive_detail (line 33) | namespace archive_detail { type serialize_impl, false > (line 36) | struct serialize_impl, false > { method exec (line 37) | static void exec(OutArcType& oarc, const boost::unordered_set& ... type deserialize_impl, false > (line 45) | struct deserialize_impl, false > { method exec (line 46) | static void exec(InArcType& iarc, boost::unordered_set& vec){ FILE: src/graphlab/serialization/unsupported_serialize.hpp type graphlab (line 31) | namespace graphlab { type unsupported_serialize (line 43) | struct unsupported_serialize { method save (line 44) | void save(oarchive& archive) const { method load (line 47) | void load(iarchive& archive) { FILE: src/graphlab/serialization/vector.hpp type graphlab (line 32) | namespace graphlab { type archive_detail (line 33) | namespace archive_detail { type vector_serialize_impl (line 39) | struct vector_serialize_impl { method exec (line 40) | static void exec(OutArcType& oarc, const ValueType& vec) { type vector_deserialize_impl (line 52) | struct vector_deserialize_impl { method exec (line 53) | static void exec(InArcType& iarc, ValueType& vec) { type vector_serialize_impl (line 63) | struct vector_serialize_impl { method exec (line 64) | static void exec(OutArcType& oarc, const std::vector& v... type vector_serialize_impl (line 72) | struct vector_serialize_impl { method exec (line 73) | static void exec(OutArcType& oarc, const std::vector& v... type vector_deserialize_impl (line 81) | struct vector_deserialize_impl { method exec (line 82) | static void exec(InArcType& iarc, std::vector& vec){ type vector_deserialize_impl (line 92) | struct vector_deserialize_impl { method exec (line 93) | static void exec(InArcType& iarc, std::vector& vec){ type serialize_impl, false > (line 106) | struct serialize_impl, false > { method exec (line 107) | static void exec(OutArcType& oarc, const std::vector& v... type deserialize_impl, false > (line 115) | struct deserialize_impl, false > { method exec (line 116) | static void exec(InArcType& iarc, std::vector& vec){ FILE: src/graphlab/ui/graphlab_visualization.js function update_domain (line 11) | function update_domain(value) { function initiate_job_info (line 26) | function initiate_job_info() { function initiate_aggregate_info (line 35) | function initiate_aggregate_info() { function initiate_node_info (line 46) | function initiate_node_info() { function process_job_info (line 59) | function process_job_info(data) { function process_aggregate_info (line 118) | function process_aggregate_info(data) { function tensor_to_table (line 168) | function tensor_to_table(tensor) { function process_node_info (line 203) | function process_node_info(data) { FILE: src/graphlab/ui/intel_demo/graphlab_visualization.js function update_domain (line 12) | function update_domain(value) { function start (line 22) | function start() { function initiate_job_info (line 29) | function initiate_job_info() { function initiate_aggregate_info (line 38) | function initiate_aggregate_info() { function initiate_node_info (line 49) | function initiate_node_info() { function process_job_info (line 62) | function process_job_info(data) { function process_aggregate_info (line 121) | function process_aggregate_info(data) { function tensor_to_table (line 171) | function tensor_to_table(tensor) { function process_node_info (line 206) | function process_node_info(data) { function initiate_graph_builder (line 257) | function initiate_graph_builder() { function process_graph_builder (line 272) | function process_graph_builder(data) { FILE: src/graphlab/ui/metrics_server.cpp type graphlab (line 41) | namespace graphlab { function rwlock (line 46) | static rwlock& callback_lock() { type mg_event (line 60) | enum mg_event type mg_connection (line 61) | struct mg_connection type mg_request_info (line 62) | struct mg_request_info function foreach (line 76) | foreach(std::string& term, terms) { function four_oh_four (line 144) | std::pair function echo (line 154) | std::pair function index_page (line 168) | std::pair function fill_builtin_callbacks (line 190) | static void fill_builtin_callbacks() { function add_metric_server_callback (line 198) | void add_metric_server_callback(std::string page, function launch_metric_server (line 205) | void launch_metric_server() { function stop_metric_server (line 224) | void stop_metric_server() { function stop_metric_server_on_eof (line 231) | void stop_metric_server_on_eof() { FILE: src/graphlab/ui/metrics_server.hpp type graphlab (line 31) | namespace graphlab { FILE: src/graphlab/ui/mongoose/mongoose.cpp type timespec (line 143) | struct timespec { type dirent (line 163) | struct dirent { type DIR (line 167) | struct DIR { type dirent (line 170) | struct dirent function pthread_t (line 227) | static pthread_t pthread_self(void) { type ssl_st (line 263) | struct ssl_st type ssl_method_st (line 264) | struct ssl_method_st type ssl_ctx_st (line 265) | struct ssl_ctx_st type ssl_func (line 297) | struct ssl_func { type ssl_func (line 336) | struct ssl_func type ssl_func (line 359) | struct ssl_func type sockaddr (line 378) | struct sockaddr type sockaddr_in (line 379) | struct sockaddr_in type sockaddr_in6 (line 381) | struct sockaddr_in6 type vec (line 386) | struct vec { type mgstat (line 392) | struct mgstat { type socket (line 400) | struct socket { type socket (line 401) | struct socket type mg_context (line 447) | struct mg_context { type socket (line 454) | struct socket type socket (line 460) | struct socket type mg_connection (line 467) | struct mg_connection { type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket type mg_connection (line 488) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket type mg_event (line 488) | enum mg_event function get_option_index (line 494) | static int get_option_index(const char *name) { type mg_context (line 506) | struct mg_context type socket (line 454) | struct socket type socket (line 460) | struct socket function sockaddr_to_string (line 517) | static void sockaddr_to_string(char *buf, size_t len, function cry (line 533) | static void cry(struct mg_connection *conn, const char *fmt, ...) { type mg_connection (line 586) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket type mg_context (line 586) | struct mg_context type socket (line 454) | struct socket type socket (line 460) | struct socket type mg_connection (line 587) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket function mg_strlcpy (line 596) | static void mg_strlcpy(register char *dst, register const char *src, siz... function lowercase (line 603) | static int lowercase(const char *s) { function mg_strncasecmp (line 607) | static int mg_strncasecmp(const char *s1, const char *s2, size_t len) { function mg_strcasecmp (line 618) | static int mg_strcasecmp(const char *s1, const char *s2) { function mg_vsnprintf (line 646) | static int mg_vsnprintf(struct mg_connection *conn, char *buf, size_t bu... function mg_snprintf (line 668) | static int mg_snprintf(struct mg_connection *conn, char *buf, size_t buf... type mg_request_info (line 733) | struct mg_request_info type mg_connection (line 744) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket type vec (line 754) | struct vec type vec (line 755) | struct vec function match_prefix (line 787) | static int match_prefix(const char *pattern, int pattern_len, const char... function should_keep_alive (line 829) | static int should_keep_alive(const struct mg_connection *conn) { type mg_connection (line 839) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket function send_http_error (line 843) | static void send_http_error(struct mg_connection *conn, int status, function pthread_mutex_init (line 877) | static int pthread_mutex_init(pthread_mutex_t *mutex, void *unused) { function pthread_mutex_destroy (line 883) | static int pthread_mutex_destroy(pthread_mutex_t *mutex) { function pthread_mutex_lock (line 887) | static int pthread_mutex_lock(pthread_mutex_t *mutex) { function pthread_mutex_unlock (line 891) | static int pthread_mutex_unlock(pthread_mutex_t *mutex) { function pthread_cond_init (line 895) | static int pthread_cond_init(pthread_cond_t *cv, const void *unused) { function pthread_cond_wait (line 902) | static int pthread_cond_wait(pthread_cond_t *cv, pthread_mutex_t *mutex) { function pthread_cond_signal (line 909) | static int pthread_cond_signal(pthread_cond_t *cv) { function pthread_cond_broadcast (line 913) | static int pthread_cond_broadcast(pthread_cond_t *cv) { function pthread_cond_destroy (line 919) | static int pthread_cond_destroy(pthread_cond_t *cv) { function change_slashes_to_backslashes (line 924) | static void change_slashes_to_backslashes(char *path) { function to_unicode (line 940) | static void to_unicode(const char *path, wchar_t *wbuf, size_t wbuf_len) { function time_t (line 978) | static time_t time(time_t *ptime) { type tm (line 994) | struct tm type tm (line 994) | struct tm type tm (line 1021) | struct tm type tm (line 1021) | struct tm function strftime (line 1026) | static size_t strftime(char *dst, size_t dst_size, const char *fmt, function mg_rename (line 1033) | static int mg_rename(const char* oldname, const char* newname) { function FILE (line 1044) | static FILE *mg_fopen(const char *path, const char *mode) { function mg_stat (line 1053) | static int mg_stat(const char *path, struct mgstat *stp) { function mg_remove (line 1072) | static int mg_remove(const char *path) { function mg_mkdir (line 1078) | static int mg_mkdir(const char *path, int mode) { function DIR (line 1092) | static DIR * opendir(const char *name) { type dirent (line 170) | struct dirent function closedir (line 1118) | static int closedir(DIR *dir) { type dirent (line 1134) | struct dirent type dirent (line 1135) | struct dirent function start_thread (line 1161) | static int start_thread(struct mg_context *ctx, mg_thread_func_t f, void... function HANDLE (line 1165) | static HANDLE dlopen(const char *dll_name, int flags) { function kill (line 1174) | static int kill(pid_t pid, int sig_num) { function pid_t (line 1180) | static pid_t spawn_process(struct mg_connection *conn, const char *prog, function set_non_blocking_mode (line 1244) | static int set_non_blocking_mode(SOCKET sock) { function mg_stat (line 1250) | static int mg_stat(const char *path, struct mgstat *stp) { function set_close_on_exec (line 1266) | static void set_close_on_exec(int fd) { function start_thread (line 1270) | static int start_thread(struct mg_context *ctx, mg_thread_func_t func, function pid_t (line 1289) | static pid_t spawn_process(struct mg_connection *conn, const char *prog, function set_non_blocking_mode (line 1335) | static int set_non_blocking_mode(SOCKET sock) { function push (line 1347) | static int64_t push(FILE *fp, SOCKET sock, SSL *ssl, const char *buf, function pull (line 1379) | static int pull(FILE *fp, SOCKET sock, SSL *ssl, char *buf, int len) { function mg_read (line 1398) | int mg_read(struct mg_connection *conn, void *buf, size_t len) { function mg_write (line 1448) | int mg_write(struct mg_connection *conn, const void *buf, size_t len) { function mg_printf (line 1453) | int mg_printf(struct mg_connection *conn, const char *fmt, ...) { function url_decode (line 1470) | static size_t url_decode(const char *src, size_t src_len, char *dst, function mg_get_var (line 1500) | int mg_get_var(const char *buf, size_t buf_len, const char *name, function mg_get_cookie (line 1536) | int mg_get_cookie(const struct mg_connection *conn, const char *cookie_n... function convert_uri_to_file_name (line 1570) | static int convert_uri_to_file_name(struct mg_connection *conn, char *buf, function sslize (line 1617) | static int sslize(struct mg_connection *conn, int (*func)(SSL *)) { function get_request_len (line 1627) | static int get_request_len(const char *buf, int buflen) { function get_month_index (line 1648) | static int get_month_index(const char *s) { function time_t (line 1659) | static time_t parse_date_string(const char *datetime) { function remove_double_dots_and_double_slashes (line 1688) | static void remove_double_dots_and_double_slashes(char *s) { function get_mime_type (line 1759) | static void get_mime_type(struct mg_context *ctx, const char *path, type MD5Context (line 1796) | struct MD5Context { function byteReverse (line 1805) | static void byteReverse(unsigned char *buf, unsigned longs) { function MD5Init (line 1826) | static void MD5Init(MD5_CTX *ctx) { function MD5Transform (line 1836) | static void MD5Transform(uint32_t buf[4], uint32_t const in[16]) { function MD5Update (line 1918) | static void MD5Update(MD5_CTX *ctx, unsigned char const *buf, unsigned l... function MD5Final (line 1954) | static void MD5Final(unsigned char digest[16], MD5_CTX *ctx) { function bin2str (line 1985) | static void bin2str(char *to, const unsigned char *p, size_t len) { function mg_md5 (line 1996) | void mg_md5(char *buf, ...) { function mg_md5_file (line 2018) | void mg_md5_file(char *buf, const char* file) { function check_password (line 2041) | static int check_password(const char *method, const char *ha1, const cha... function FILE (line 2070) | static FILE *open_auth_file(struct mg_connection *conn, const char *path) { type ah (line 2101) | struct ah { function parse_auth_header (line 2105) | static int parse_auth_header(struct mg_connection *conn, char *buf, function authorize (line 2170) | static int authorize(struct mg_connection *conn, FILE *fp) { function check_authorization (line 2196) | static int check_authorization(struct mg_connection *conn, const char *p... function send_authorization_request (line 2230) | static void send_authorization_request(struct mg_connection *conn) { function is_authorized_for_put (line 2241) | static int is_authorized_for_put(struct mg_connection *conn) { function mg_modify_passwords_file (line 2256) | int mg_modify_passwords_file(const char *fname, const char *domain, type de (line 2319) | struct de { type mg_connection (line 2320) | struct mg_connection type mgstat (line 2322) | struct mgstat function url_encode (line 2325) | static void url_encode(const char *src, char *dst, size_t dst_len) { function print_dir_entry (line 2345) | static void print_dir_entry(struct de *de) { function compare_dir_entries (line 2380) | static int WINCDECL compare_dir_entries(const void *p1, const void *p2) { function scan_directory (line 2406) | static int scan_directory(struct mg_connection *conn, const char *dir, type dir_scan_data (line 2444) | struct dir_scan_data { type de (line 2445) | struct de function dir_scan_callback (line 2450) | static void dir_scan_callback(struct de *de, void *data) { function handle_directory_request (line 2469) | static void handle_directory_request(struct mg_connection *conn, function send_file_data (line 2520) | static void send_file_data(struct mg_connection *conn, FILE *fp, int64_t... function parse_range_header (line 2544) | static int parse_range_header(const char *header, int64_t *a, int64_t *b) { function gmt_time_string (line 2548) | static void gmt_time_string(char *buf, size_t buf_len, time_t *t) { function handle_file_request (line 2552) | static void handle_file_request(struct mg_connection *conn, const char *... function mg_send_file (line 2615) | void mg_send_file(struct mg_connection *conn, const char *path) { function parse_http_headers (line 2627) | static void parse_http_headers(char **buf, struct mg_request_info *ri) { function is_valid_http_method (line 2639) | static int is_valid_http_method(const char *method) { function parse_http_request (line 2647) | static int parse_http_request(char *buf, struct mg_request_info *ri) { function read_request (line 2674) | static int read_request(FILE *fp, SOCKET sock, SSL *ssl, char *buf, int ... function substitute_index_file (line 2695) | static int substitute_index_file(struct mg_connection *conn, char *path, function is_not_modified (line 2740) | static int is_not_modified(const struct mg_connection *conn, function forward_body_data (line 2746) | static int forward_body_data(struct mg_connection *conn, FILE *fp, type cgi_env_block (line 2811) | struct cgi_env_block { type mg_connection (line 2812) | struct mg_connection type cgi_env_block (line 2821) | struct cgi_env_block type mg_connection (line 2812) | struct mg_connection function prepare_cgi_environment (line 2850) | static void prepare_cgi_environment(struct mg_connection *conn, function handle_cgi_request (line 2958) | static void handle_cgi_request(struct mg_connection *conn, const char *p... function put_dir (line 3092) | static int put_dir(const char *path) { function put_file (line 3123) | static void put_file(struct mg_connection *conn, const char *path) { type mg_connection (line 3156) | struct mg_connection type mg_request_info (line 468) | struct mg_request_info type mg_context (line 469) | struct mg_context type socket (line 471) | struct socket function do_ssi_include (line 3158) | static void do_ssi_include(struct mg_connection *conn, const char *ssi, function do_ssi_exec (line 3202) | static void do_ssi_exec(struct mg_connection *conn, char *tag) { function send_ssi_file (line 3217) | static void send_ssi_file(struct mg_connection *conn, const char *path, function handle_ssi_file_request (line 3282) | static void handle_ssi_file_request(struct mg_connection *conn, function send_options (line 3300) | static void send_options(struct mg_connection *conn) { function print_props (line 3310) | static void print_props(struct mg_connection *conn, const char* uri, function print_dav_dir_entry (line 3332) | static void print_dav_dir_entry(struct de *de, void *data) { function handle_propfind (line 3340) | static void handle_propfind(struct mg_connection *conn, const char* path, function handle_request (line 3371) | static void handle_request(struct mg_connection *conn) { function close_all_listening_sockets (line 3450) | static void close_all_listening_sockets(struct mg_context *ctx) { function parse_port_string (line 3462) | static int parse_port_string(const struct vec *vec, struct socket *so) { function set_ports_option (line 3492) | static int set_ports_option(struct mg_context *ctx) { function log_header (line 3551) | static void log_header(const struct mg_connection *conn, const char *hea... function log_access (line 3562) | static void log_access(const struct mg_connection *conn) { function isbyte (line 3594) | static int isbyte(int n) { function check_acl (line 3600) | static int check_acl(struct mg_context *ctx, const union usa *usa) { function add_to_set (line 3646) | static void add_to_set(SOCKET fd, fd_set *set, int *max_fd) { function set_uid_option (line 3654) | static int set_uid_option(struct mg_context *ctx) { function ssl_locking_callback (line 3680) | static void ssl_locking_callback(int mode, int mutex_num, const char *file, function ssl_id_callback (line 3692) | static unsigned long ssl_id_callback(void) { function load_dll (line 3697) | static int load_dll(struct mg_context *ctx, const char *dll_name, function set_ssl_option (line 3730) | static int set_ssl_option(struct mg_context *ctx) { function uninitialize_ssl (line 3798) | static void uninitialize_ssl(struct mg_context *ctx) { function set_gpass_option (line 3811) | static int set_gpass_option(struct mg_context *ctx) { function set_acl_option (line 3817) | static int set_acl_option(struct mg_context *ctx) { function reset_per_request_attributes (line 3822) | static void reset_per_request_attributes(struct mg_connection *conn) { function close_socket_gracefully (line 3837) | static void close_socket_gracefully(SOCKET sock) { function close_connection (line 3865) | static void close_connection(struct mg_connection *conn) { function discard_current_request_from_buffer (line 3876) | static void discard_current_request_from_buffer(struct mg_connection *co... function is_valid_uri (line 3897) | static int is_valid_uri(const char *uri) { function process_new_connection (line 3903) | static void process_new_connection(struct mg_connection *conn) { function consume_socket (line 3956) | static int consume_socket(struct mg_context *ctx, struct socket *sp) { function worker_thread (line 3985) | static void worker_thread(struct mg_context *ctx) { function produce_socket (line 4033) | static void produce_socket(struct mg_context *ctx, const struct socket *... function accept_new_connection (line 4053) | static void accept_new_connection(const struct socket *listener, function master_thread (line 4078) | static void master_thread(struct mg_context *ctx) { function free_context (line 4153) | static void free_context(struct mg_context *ctx) { function mg_stop (line 4176) | void mg_stop(struct mg_context *ctx) { type mg_context (line 4190) | struct mg_context type socket (line 454) | struct socket type socket (line 460) | struct socket type mg_context (line 4192) | struct mg_context type socket (line 454) | struct socket type socket (line 460) | struct socket type mg_context (line 4204) | struct mg_context type socket (line 454) | struct socket type socket (line 460) | struct socket FILE: src/graphlab/ui/mongoose/mongoose.h type mg_context (line 27) | struct mg_context type mg_connection (line 28) | struct mg_connection type mg_request_info (line 32) | struct mg_request_info { type mg_event (line 52) | enum mg_event { type mg_event (line 77) | enum mg_event type mg_connection (line 78) | struct mg_connection type mg_request_info (line 79) | struct mg_request_info type mg_context (line 107) | struct mg_context type mg_context (line 116) | struct mg_context type mg_context (line 125) | struct mg_context type mg_connection (line 152) | struct mg_connection type mg_connection (line 161) | struct mg_connection type mg_connection (line 169) | struct mg_connection type mg_connection (line 173) | struct mg_connection type mg_connection (line 181) | struct mg_connection type mg_connection (line 214) | struct mg_connection FILE: src/graphlab/util/binary_parser.hpp type graphlab (line 30) | namespace graphlab { class binary_input_stream (line 38) | class binary_input_stream : public std::ifstream { method binary_input_stream (line 42) | binary_input_stream(const char* fname) : method T (line 50) | T read() { method read (line 62) | void read(T& ret) { method read_vector (line 73) | void read_vector(std::vector& ret) { class binary_output_stream (line 92) | class binary_output_stream : public std::ofstream { method binary_output_stream (line 96) | binary_output_stream(const char* fname) : method write (line 102) | void write(T t) { FILE: src/graphlab/util/blocking_queue.hpp type graphlab (line 35) | namespace graphlab { class blocking_queue (line 42) | class blocking_queue { method blocking_queue (line 60) | blocking_queue() : m_alive(true),sleeping(0),sleeping_on_empty(0) { } method enqueue (line 63) | inline void enqueue(const T& elem) { method enqueue_to_head (line 72) | inline void enqueue_to_head(const T& elem) { method enqueue_conditional_signal (line 82) | inline void enqueue_conditional_signal(const T& elem, size_t signal_... method empty_unsafe (line 91) | bool empty_unsafe() { method begin_critical_section (line 95) | void begin_critical_section() { method is_alive (line 100) | bool is_alive() { method swap (line 104) | void swap(queue_type &q) { method try_dequeue_in_critical_section (line 113) | inline std::pair try_dequeue_in_critical_section() { method end_critical_section (line 129) | void end_critical_section() { method dequeue_and_begin_critical_section_on_success (line 134) | inline std::pair dequeue_and_begin_critical_section_on_succ... method timed_wait_for_data (line 160) | inline bool timed_wait_for_data(size_t ns, size_t immediate_size) { method try_timed_wait_for_data (line 184) | inline bool try_timed_wait_for_data(size_t ns, size_t immediate_size) { method wait_for_data (line 206) | inline bool wait_for_data() { method dequeue (line 235) | inline std::pair dequeue() { method try_dequeue (line 264) | inline std::pair try_dequeue() { method empty (line 286) | inline bool empty() { method stop_blocking (line 299) | inline void stop_blocking() { method start_blocking (line 311) | inline void start_blocking() { method size (line 318) | inline size_t size() { method wait_until_empty (line 329) | bool wait_until_empty() { method broadcast (line 349) | void broadcast() { method broadcast_blocking_empty (line 363) | void broadcast_blocking_empty() { FILE: src/graphlab/util/bloom_filter.hpp class fixed_bloom_filter (line 29) | class fixed_bloom_filter { method fixed_bloom_filter (line 33) | inline fixed_bloom_filter() { } method clear (line 35) | inline void clear() { method insert (line 39) | inline void insert(uint64_t i) { method may_contain (line 46) | inline bool may_contain(size_t i) { FILE: src/graphlab/util/cache.hpp type graphlab (line 48) | namespace graphlab { type cache (line 49) | namespace cache { class lru (line 65) | class lru { method lru (line 84) | lru(size_t cache_reserve = 1024) { method size (line 89) | size_t size() const { return cache_map.size(); } method empty (line 90) | size_t empty() const { return size() == 0; } method iterator_type (line 92) | iterator_type begin() { return cache_map.begin(); } method iterator_type (line 93) | iterator_type end() { return cache_map.end(); } method evict (line 95) | std::pair evict() { method evict (line 105) | std::pair evict(const key_type& key) { method evict (line 115) | bool evict(const key_type& key, value_type& ret_value) { method contains (line 125) | bool contains(const key_type& key) const { method value_type (line 137) | value_type& operator[](const key_type& key) { method value_type (line 154) | const value_type& operator[](const key_type& key) const { method get (line 167) | bool get(const key_type& key, value_type& ret_value) { class associative (line 186) | class associative { method associative (line 201) | associative(size_t cache_size = 1024) : method size (line 205) | size_t size() { return size_; } method evict_slot (line 208) | bool evict_slot(const key_type& key, method evict (line 218) | std::pair evict(const key_type& key) { method evict (line 228) | bool evict(const key_type& key, value_type& ret_value) { method contains (line 239) | bool contains(const key_type& key) const { method value_type (line 245) | value_type& operator[](const key_type& key) { method value_type (line 258) | const value_type& operator[](const key_type& key) const { method get (line 269) | bool get(const key_type& key, value_type& ret_value) { FILE: src/graphlab/util/chandy_misra.hpp type graphlab (line 30) | namespace graphlab { class chandy_misra (line 33) | class chandy_misra { method request_bit (line 49) | inline unsigned char request_bit(bool owner) { type philosopher (line 53) | struct philosopher { method request_for_fork (line 70) | inline void request_for_fork(size_t forkid, bool nextowner) { method fork_owner (line 74) | inline bool fork_owner(size_t forkid) { method fork_dirty (line 78) | inline bool fork_dirty(size_t forkid) { method dirty_fork (line 82) | inline void dirty_fork(size_t forkid) { method advance_fork_state_on_lock (line 90) | inline void advance_fork_state_on_lock(size_t forkid, method advance_fork_state_on_unlock (line 130) | inline bool advance_fork_state_on_unlock(size_t forkid, method compute_initial_fork_arrangement (line 164) | void compute_initial_fork_arrangement() { method compute_initial_fork_arrangement (line 185) | void compute_initial_fork_arrangement(const std::vector philosopher_stops_eating(size_t p... method cancel_eating_philosopher (line 333) | inline std::vector cancel_eating_philosopher(vertex_... method no_locks_consistency_check (line 389) | void no_locks_consistency_check() { method complete_consistency_check (line 396) | void complete_consistency_check() { FILE: src/graphlab/util/chandy_misra2.hpp type graphlab (line 31) | namespace graphlab { class chandy_misra (line 34) | class chandy_misra { method request_bit (line 50) | inline unsigned char request_bit(bool owner) { type philosopher (line 54) | struct philosopher { method atomic_eat (line 59) | bool atomic_eat() { method request_for_fork (line 79) | inline void request_for_fork(size_t forkid, bool nextowner) { method fork_owner (line 83) | inline bool fork_owner(size_t forkid) { method fork_dirty (line 87) | inline bool fork_dirty(size_t forkid) { method dirty_fork (line 91) | inline void dirty_fork(size_t forkid) { method advance_fork_state_on_lock (line 99) | inline bool advance_fork_state_on_lock(size_t forkid, method advance_fork_state_on_unlock (line 132) | inline bool advance_fork_state_on_unlock(size_t forkid, method compute_initial_fork_arrangement (line 153) | void compute_initial_fork_arrangement() { method try_acquire_edge_with_backoff (line 174) | void try_acquire_edge_with_backoff(vertex_id_type v1, method chandy_misra (line 188) | inline chandy_misra(GraphType &graph):graph(graph) { method vertex_id_type (line 194) | inline const vertex_id_type invalid_vid() const { method vertex_id_type (line 198) | inline vertex_id_type make_philosopher_hungry(vertex_id_type p_id) { method philosopher_stops_eating (line 253) | inline std::vector philosopher_stops_eating(size_t p... method no_locks_consistency_check (line 292) | void no_locks_consistency_check() { method complete_consistency_check (line 299) | void complete_consistency_check() { FILE: src/graphlab/util/chandy_misra_lockfree.hpp type graphlab (line 31) | namespace graphlab { class chandy_misra_lockfree (line 34) | class chandy_misra_lockfree { method request_bit (line 50) | static inline unsigned char request_bit(bool owner) { type philosopher (line 54) | struct philosopher { method atomic_eat (line 59) | bool atomic_eat() { method request_for_fork (line 77) | inline void request_for_fork(size_t forkid, bool nextowner) { method fork_owner (line 81) | inline bool fork_owner(size_t forkid) { method fork_dirty (line 85) | inline bool fork_dirty(size_t forkid) { method dirty_fork (line 89) | inline void dirty_fork(size_t forkid) { method advance_fork_state_on_lock (line 97) | inline bool advance_fork_state_on_lock(size_t forkid, method advance_fork_state_on_unlock (line 136) | inline bool advance_fork_state_on_unlock(size_t forkid, method compute_initial_fork_arrangement (line 157) | void compute_initial_fork_arrangement() { method try_acquire_edge_with_backoff (line 178) | void try_acquire_edge_with_backoff(vertex_id_type v1, method chandy_misra_lockfree (line 192) | inline chandy_misra_lockfree(GraphType &graph):graph(graph) { method vertex_id_type (line 198) | inline const vertex_id_type invalid_vid() const { method vertex_id_type (line 202) | inline vertex_id_type make_philosopher_hungry(vertex_id_type p_id) { method philosopher_stops_eating (line 257) | inline std::vector philosopher_stops_eating(size_t p... method no_locks_consistency_check (line 296) | void no_locks_consistency_check() { method complete_consistency_check (line 303) | void complete_consistency_check() { FILE: src/graphlab/util/char_counting_sink.hpp type graphlab (line 29) | namespace graphlab { type char_counting_sink (line 35) | struct char_counting_sink { method char_counting_sink (line 36) | char_counting_sink(size_t initial = 0):count(initial) { } method char_counting_sink (line 38) | char_counting_sink(const char_counting_sink &buf):count(buf.count) { } type category (line 41) | struct category: public boost::iostreams::device_tag, method optimal_buffer_size (line 47) | inline std::streamsize optimal_buffer_size() const { return 0; } method write (line 49) | inline std::streamsize write(const char* s, std::streamsize n) { FILE: src/graphlab/util/charstream.hpp type graphlab (line 30) | namespace graphlab { type charstream_impl (line 33) | namespace charstream_impl { type resizing_array_sink (line 36) | struct resizing_array_sink { method resizing_array_sink (line 39) | resizing_array_sink(size_t initial = 0) : str(NULL) { method resizing_array_sink (line 48) | resizing_array_sink(const resizing_array_sink& other) : method relinquish (line 67) | void relinquish() { method size (line 73) | size_t size() const { return len; } method clear (line 77) | void clear() { method clear (line 81) | void clear(size_t new_buffer_size) { method reserve (line 87) | void reserve(size_t new_buffer_size) { type category (line 98) | struct category: public boost::iostreams::device_tag, method optimal_buffer_size (line 103) | inline std::streamsize optimal_buffer_size() const { return 0; } method advance (line 105) | inline std::streamsize advance(std::streamsize n) { method write (line 116) | inline std::streamsize write(const char* s, std::streamsize n) { method swap (line 128) | inline void swap(resizing_array_sink &other) { FILE: src/graphlab/util/cuckoo_map.hpp type graphlab (line 33) | namespace graphlab { class cuckoo_map (line 49) | class cuckoo_map { method map_container_iterator (line 82) | map_container_iterator data_begin() { method map_container_iterator (line 86) | map_container_iterator data_end() { method map_container_const_iterator (line 90) | map_container_const_iterator data_begin() const { method map_container_const_iterator (line 94) | map_container_const_iterator data_end() const { method replace_in_vector (line 98) | void replace_in_vector(map_container_iterator iter, method destroy_all (line 107) | void destroy_all() { type insert_iterator (line 120) | struct insert_iterator{ method insert_iterator (line 125) | insert_iterator(cuckoo_map* c):cmap(c) {} method insert_iterator (line 127) | insert_iterator operator++() { method insert_iterator (line 130) | insert_iterator operator++(int) { method insert_iterator (line 134) | insert_iterator& operator*() { method insert_iterator (line 137) | insert_iterator& operator=(const insert_iterator& i) { method insert_iterator (line 142) | insert_iterator& operator=(const value_type& v) { type const_iterator (line 148) | struct const_iterator { method const_iterator (line 162) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 164) | const_iterator operator++() { method const_iterator (line 182) | const_iterator operator++(int) { method reference (line 189) | reference operator*() { method pointer (line 194) | pointer operator->() { method const_iterator (line 211) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::map_co... method const_iterator (line 214) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::stash_... type iterator (line 219) | struct iterator { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method iterator (line 306) | iterator do_insert(const value_type& v_) { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method cuckoo_map (line 366) | cuckoo_map(key_type illegalkey, method cuckoo_map (line 381) | cuckoo_map& operator=(const cuckoo_map& other) { method key_type (line 399) | const key_type& illegal_key() const { method index_type (line 407) | index_type size() { method iterator (line 411) | iterator begin() { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method iterator (line 429) | iterator end() { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method const_iterator (line 434) | const_iterator begin() const { method const_iterator (line 162) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 164) | const_iterator operator++() { method const_iterator (line 182) | const_iterator operator++(int) { method reference (line 189) | reference operator*() { method pointer (line 194) | pointer operator->() { method const_iterator (line 211) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::map_co... method const_iterator (line 214) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::stash_... method const_iterator (line 451) | const_iterator end() const { method const_iterator (line 162) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 164) | const_iterator operator++() { method const_iterator (line 182) | const_iterator operator++(int) { method reference (line 189) | reference operator*() { method pointer (line 194) | pointer operator->() { method const_iterator (line 211) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::map_co... method const_iterator (line 214) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::stash_... method mix (line 460) | static size_t mix(size_t state) { method index_type (line 472) | index_type compute_hash(size_t k , const uint32_t seed) const { method rehash (line 498) | void rehash() { method reserve (line 523) | void reserve(size_t newlen) { method insert (line 532) | std::pair insert(const value_type& v_) { method iterator (line 540) | iterator insert(const_iterator hint, value_type const& v) { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method iterator (line 544) | iterator find(key_type const& k) { method iterator (line 233) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 245) | iterator operator++() { method iterator (line 263) | iterator operator++(int) { method reference (line 270) | reference operator*() { method pointer (line 275) | pointer operator->() { method iterator (line 293) | iterator(cuckoo_map* cmap, typename cuckoo_map::map_container_iter... method iterator (line 296) | iterator(cuckoo_map* cmap, typename cuckoo_map::stash_container_ty... method const_iterator (line 553) | const_iterator find(key_type const& k) const { method const_iterator (line 162) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 164) | const_iterator operator++() { method const_iterator (line 182) | const_iterator operator++(int) { method reference (line 189) | reference operator*() { method pointer (line 194) | pointer operator->() { method const_iterator (line 211) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::map_co... method const_iterator (line 214) | const_iterator(const cuckoo_map* cmap, typename cuckoo_map::stash_... method count (line 562) | size_t count(key_type const& k) const { method erase (line 572) | void erase(iterator iter) { method erase (line 587) | void erase(key_type const& k) { method swap (line 592) | void swap(cuckoo_map& other) { method mapped_type (line 605) | mapped_type& operator[](const key_type& i) { method key_equal (line 612) | key_equal key_eq() const { method clear (line 616) | void clear() { method load_factor (line 622) | float load_factor() const { method save (line 626) | void save(oarchive &oarc) const { method load (line 632) | void load(iarchive &iarc) { FILE: src/graphlab/util/cuckoo_map_pow2.hpp type graphlab (line 32) | namespace graphlab { class cuckoo_map_pow2 (line 48) | class cuckoo_map_pow2 { method map_container_iterator (line 83) | map_container_iterator data_begin() { method map_container_iterator (line 87) | map_container_iterator data_end() { method map_container_const_iterator (line 91) | map_container_const_iterator data_begin() const { method map_container_const_iterator (line 95) | map_container_const_iterator data_end() const { method replace_in_vector (line 101) | void replace_in_vector(map_container_iterator iter, method destroy_all (line 110) | void destroy_all() { type insert_iterator (line 123) | struct insert_iterator{ method insert_iterator (line 128) | insert_iterator(cuckoo_map_pow2* c):cmap(c) {} method insert_iterator (line 130) | insert_iterator operator++() { method insert_iterator (line 133) | insert_iterator operator++(int) { method insert_iterator (line 137) | insert_iterator& operator*() { method insert_iterator (line 140) | insert_iterator& operator=(const insert_iterator& i) { method insert_iterator (line 145) | insert_iterator& operator=(const value_type& v) { type const_iterator (line 151) | struct const_iterator { method const_iterator (line 165) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 167) | const_iterator operator++() { method const_iterator (line 185) | const_iterator operator++(int) { method reference (line 192) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 214) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method const_iterator (line 217) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... type iterator (line 223) | struct iterator { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method iterator (line 313) | iterator do_insert(const value_type& v_) { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method cuckoo_map_pow2 (line 372) | cuckoo_map_pow2(key_type illegalkey, method key_type (line 385) | const key_type& illegal_key() const { method cuckoo_map_pow2 (line 393) | cuckoo_map_pow2& operator=(const cuckoo_map_pow2& other) { method index_type (line 412) | index_type size() { method iterator (line 416) | iterator begin() { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method iterator (line 432) | iterator end() { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method const_iterator (line 437) | const_iterator begin() const { method const_iterator (line 165) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 167) | const_iterator operator++() { method const_iterator (line 185) | const_iterator operator++(int) { method reference (line 192) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 214) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method const_iterator (line 217) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method const_iterator (line 454) | const_iterator end() const { method const_iterator (line 165) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 167) | const_iterator operator++() { method const_iterator (line 185) | const_iterator operator++(int) { method reference (line 192) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 214) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method const_iterator (line 217) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method mix (line 463) | static size_t mix(size_t state) { method index_type (line 475) | index_type compute_hash(size_t k , const uint32_t seed) const { method rehash (line 500) | void rehash() { method next_powerof2 (line 523) | static uint64_t next_powerof2(uint64_t val) { method reserve (line 535) | void reserve(size_t newlen) { method insert (line 547) | std::pair insert(const value_type& v_) { method iterator (line 553) | iterator insert(const_iterator hint, value_type const& v) { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method iterator (line 557) | iterator find(key_type const& k) { method iterator (line 237) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 249) | iterator operator++() { method iterator (line 267) | iterator operator++(int) { method reference (line 274) | reference operator*() { method pointer (line 279) | pointer operator->() { method iterator (line 297) | iterator(cuckoo_map_pow2* cmap, method iterator (line 301) | iterator(cuckoo_map_pow2* cmap, method const_iterator (line 566) | const_iterator find(key_type const& k) const { method const_iterator (line 165) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 167) | const_iterator operator++() { method const_iterator (line 185) | const_iterator operator++(int) { method reference (line 192) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 214) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method const_iterator (line 217) | const_iterator(const cuckoo_map_pow2* cmap, typename cuckoo_map_po... method count (line 575) | size_t count(key_type const& k) const { method erase (line 585) | void erase(iterator iter) { method erase (line 600) | void erase(key_type const& k) { method swap (line 605) | void swap(cuckoo_map_pow2& other) { method mapped_type (line 619) | mapped_type& operator[](const key_type& i) { method key_equal (line 626) | key_equal key_eq() const { method clear (line 630) | void clear() { method load_factor (line 636) | float load_factor() const { method save (line 640) | void save(oarchive &oarc) const { method load (line 646) | void load(iarchive &iarc) { FILE: src/graphlab/util/cuckoo_set_pow2.hpp type graphlab (line 32) | namespace graphlab { class cuckoo_set_pow2 (line 48) | class cuckoo_set_pow2 { method map_container_iterator (line 82) | map_container_iterator data_begin() { method map_container_iterator (line 86) | map_container_iterator data_end() { method map_container_const_iterator (line 90) | map_container_const_iterator data_begin() const { method map_container_const_iterator (line 94) | map_container_const_iterator data_end() const { method replace_in_vector (line 100) | void replace_in_vector(map_container_iterator iter, method destroy_all (line 108) | void destroy_all() { type insert_iterator (line 123) | struct insert_iterator{ method insert_iterator (line 128) | insert_iterator(cuckoo_set_pow2* c):cmap(c) {} method insert_iterator (line 130) | insert_iterator operator++() { method insert_iterator (line 133) | insert_iterator operator++(int) { method insert_iterator (line 137) | insert_iterator& operator*() { method insert_iterator (line 140) | insert_iterator& operator=(const insert_iterator& i) { method insert_iterator (line 145) | insert_iterator& operator=(const value_type& v) { type const_iterator (line 151) | struct const_iterator { method const_iterator (line 164) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 166) | const_iterator operator++() { method const_iterator (line 184) | const_iterator operator++(int) { method reference (line 191) | reference operator*() { method const_iterator (line 208) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method const_iterator (line 211) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... type iterator (line 217) | struct iterator { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method iterator (line 301) | iterator do_insert(const value_type& v_) { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method cuckoo_set_pow2 (line 360) | cuckoo_set_pow2(key_type illegalkey, method cuckoo_set_pow2 (line 373) | cuckoo_set_pow2(const cuckoo_set_pow2& other): method key_type (line 384) | const key_type& illegal_key() const { method cuckoo_set_pow2 (line 392) | cuckoo_set_pow2& operator=(const cuckoo_set_pow2& other) { method index_type (line 418) | index_type size() const { method iterator (line 422) | iterator begin() { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method iterator (line 438) | iterator end() { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method const_iterator (line 443) | const_iterator begin() const { method const_iterator (line 164) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 166) | const_iterator operator++() { method const_iterator (line 184) | const_iterator operator++(int) { method reference (line 191) | reference operator*() { method const_iterator (line 208) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method const_iterator (line 211) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method const_iterator (line 461) | const_iterator end() const { method const_iterator (line 164) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 166) | const_iterator operator++() { method const_iterator (line 184) | const_iterator operator++(int) { method reference (line 191) | reference operator*() { method const_iterator (line 208) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method const_iterator (line 211) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method mix (line 470) | static size_t mix(size_t state) { method index_type (line 482) | index_type compute_hash(size_t k , const uint32_t seed) const { method rehash (line 507) | void rehash() { method next_powerof2 (line 531) | static uint64_t next_powerof2(uint64_t val) { method reserve (line 543) | void reserve(size_t newlen) { method insert (line 556) | std::pair insert(const value_type& v_) { method iterator (line 562) | iterator insert(const_iterator hint, value_type const& v) { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method iterator (line 566) | iterator find(key_type const& k) { method iterator (line 230) | iterator(): cmap(NULL), in_stash(false) {} method iterator (line 242) | iterator operator++() { method iterator (line 260) | iterator operator++(int) { method reference (line 267) | reference operator*() { method iterator (line 285) | iterator(cuckoo_set_pow2* cmap, method iterator (line 289) | iterator(cuckoo_set_pow2* cmap, method const_iterator (line 575) | const_iterator find(key_type const& k) const { method const_iterator (line 164) | const_iterator(): cmap(NULL), in_stash(false) {} method const_iterator (line 166) | const_iterator operator++() { method const_iterator (line 184) | const_iterator operator++(int) { method reference (line 191) | reference operator*() { method const_iterator (line 208) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method const_iterator (line 211) | const_iterator(const cuckoo_set_pow2* cmap, typename cuckoo_set_po... method count (line 584) | size_t count(key_type const& k) const { method erase (line 597) | void erase(iterator iter) { method erase (line 612) | void erase(key_type const& k) { method swap (line 617) | void swap(cuckoo_set_pow2& other) { method key_equal (line 631) | key_equal key_eq() const { method clear (line 635) | void clear() { method load_factor (line 641) | float load_factor() const { method save (line 645) | void save(oarchive &oarc) const { method load (line 651) | void load(iarchive &iarc) { FILE: src/graphlab/util/dense_bitset.hpp type graphlab (line 35) | namespace graphlab { class dense_bitset (line 40) | class dense_bitset { method dense_bitset (line 44) | dense_bitset() : array(NULL), len(0), arrlen(0) { method dense_bitset (line 48) | explicit dense_bitset(size_t size) : array(NULL), len(0), arrlen(0) { method dense_bitset (line 54) | dense_bitset(const dense_bitset &db) { method dense_bitset (line 65) | inline dense_bitset& operator=(const dense_bitset& db) { method resize (line 80) | inline void resize(size_t n) { method clear (line 97) | inline void clear() { method empty (line 101) | inline bool empty() const { method fill (line 107) | inline void fill() { method prefetch (line 113) | inline void prefetch(size_t b) const{ method get (line 118) | inline bool get(size_t b) const{ method set_bit (line 125) | inline bool set_bit(size_t b) { method xor_bit (line 134) | inline bool xor_bit(size_t b) { method containing_word (line 143) | inline size_t containing_word(size_t b) { method get_containing_word_and_zero (line 150) | inline size_t get_containing_word_and_zero(size_t b) { method transfer_approximate_unsafe (line 181) | inline void transfer_approximate_unsafe(dense_bitset& other, method set_bit_unsync (line 212) | inline bool set_bit_unsync(size_t b) { method set (line 223) | inline bool set(size_t b, bool value) { method set_unsync (line 232) | inline bool set_unsync(size_t b, bool value) { method clear_bit (line 239) | inline bool clear_bit(size_t b) { method clear_bit_unsync (line 252) | inline bool clear_bit_unsync(size_t b) { type bit_pos_iterator (line 263) | struct bit_pos_iterator { method bit_pos_iterator (line 271) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 272) | bit_pos_iterator(const dense_bitset* const db, size_t pos):pos(pos... method bit_pos_iterator (line 300) | bit_pos_iterator begin() const { method bit_pos_iterator (line 271) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 272) | bit_pos_iterator(const dense_bitset* const db, size_t pos):pos(pos... method bit_pos_iterator (line 306) | bit_pos_iterator end() const { method bit_pos_iterator (line 271) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 272) | bit_pos_iterator(const dense_bitset* const db, size_t pos):pos(pos... method first_bit (line 314) | inline bool first_bit(size_t &b) const { method first_zero_bit (line 329) | inline bool first_zero_bit(size_t &b) const { method next_bit (line 343) | inline bool next_bit(size_t &b) const { method size (line 365) | inline size_t size() const { method save (line 370) | inline void save(oarchive& oarc) const { method load (line 376) | inline void load(iarchive& iarc) { method popcount (line 387) | size_t popcount() const { method dense_bitset (line 395) | dense_bitset operator&(const dense_bitset& other) const { method dense_bitset (line 405) | dense_bitset operator|(const dense_bitset& other) const { method dense_bitset (line 414) | dense_bitset operator-(const dense_bitset& other) const { method dense_bitset (line 424) | dense_bitset& operator&=(const dense_bitset& other) { method dense_bitset (line 433) | dense_bitset& operator|=(const dense_bitset& other) { method dense_bitset (line 441) | dense_bitset& operator-=(const dense_bitset& other) { method invert (line 449) | void invert() { method bit_to_pos (line 458) | inline static void bit_to_pos(size_t b, size_t& arrpos, size_t& bitp... method next_bit_in_block (line 465) | inline size_t next_bit_in_block(const size_t& b, const size_t& block... method first_bit_in_block (line 473) | inline size_t first_bit_in_block(const size_t& block) const{ method fix_trailing_bits (line 479) | void fix_trailing_bits() { class fixed_dense_bitset (line 523) | class fixed_dense_bitset { method fixed_dense_bitset (line 526) | fixed_dense_bitset() { method fixed_dense_bitset (line 531) | fixed_dense_bitset(const fixed_dense_bitset &db) { method initialize_from_mem (line 538) | void initialize_from_mem(void* mem, size_t memlen) { method clear (line 552) | inline void clear() { method fill (line 557) | inline void fill() { method empty (line 562) | inline bool empty() const { method prefetch (line 568) | inline void prefetch(size_t b) const{ method get (line 573) | inline bool get(size_t b) const{ method set_bit (line 580) | inline bool set_bit(size_t b) { method containing_word (line 590) | inline size_t containing_word(size_t b) { method set_bit_unsync (line 601) | inline bool set_bit_unsync(size_t b) { method set (line 615) | inline bool set(size_t b, bool value) { method set_unsync (line 624) | inline bool set_unsync(size_t b, bool value) { method clear_bit (line 631) | inline bool clear_bit(size_t b) { method clear_bit_unsync (line 644) | inline bool clear_bit_unsync(size_t b) { type bit_pos_iterator (line 656) | struct bit_pos_iterator { method bit_pos_iterator (line 664) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 665) | bit_pos_iterator(const fixed_dense_bitset* const db, size_t pos):p... method bit_pos_iterator (line 693) | bit_pos_iterator begin() const { method bit_pos_iterator (line 664) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 665) | bit_pos_iterator(const fixed_dense_bitset* const db, size_t pos):p... method bit_pos_iterator (line 699) | bit_pos_iterator end() const { method bit_pos_iterator (line 664) | bit_pos_iterator():pos(-1),db(NULL) {} method bit_pos_iterator (line 665) | bit_pos_iterator(const fixed_dense_bitset* const db, size_t pos):p... method first_bit (line 707) | inline bool first_bit(size_t &b) const { method first_zero_bit (line 721) | inline bool first_zero_bit(size_t &b) const { method next_bit (line 737) | inline bool next_bit(size_t &b) const { method size (line 759) | inline size_t size() const { method save (line 764) | inline void save(oarchive& oarc) const { method load (line 771) | inline void load(iarchive& iarc) { method popcount (line 782) | size_t popcount() const { method fixed_dense_bitset (line 790) | fixed_dense_bitset operator&(const fixed_dense_bitset& other) const { method fixed_dense_bitset (line 800) | fixed_dense_bitset operator|(const fixed_dense_bitset& other) const { method fixed_dense_bitset (line 809) | fixed_dense_bitset operator-(const fixed_dense_bitset& other) const { method fixed_dense_bitset (line 819) | fixed_dense_bitset& operator&=(const fixed_dense_bitset& other) { method fixed_dense_bitset (line 828) | fixed_dense_bitset& operator|=(const fixed_dense_bitset& other) { method fixed_dense_bitset (line 836) | fixed_dense_bitset& operator-=(const fixed_dense_bitset& other) { method bit_to_pos (line 856) | inline static void bit_to_pos(size_t b, size_t &arrpos, size_t &bitp... method next_bit_in_block (line 864) | inline size_t next_bit_in_block(const size_t &b, const size_t &block... method first_bit_in_block (line 872) | inline size_t first_bit_in_block(const size_t &block) const { method fix_trailing_bits (line 880) | void fix_trailing_bits() { FILE: src/graphlab/util/empty.hpp type graphlab (line 31) | namespace graphlab { type empty (line 33) | struct empty { method save (line 34) | void save(oarchive&) const { } method load (line 35) | void load(iarchive&) { } method empty (line 36) | empty& operator+=(const empty&) { return *this; } type std (line 42) | namespace std { class vector > (line 45) | class vector > { type iterator (line 51) | struct iterator { method iterator (line 61) | iterator(): i(0),len(NULL) { } method iterator (line 62) | iterator(size_t i, const size_t* len): i(i), len(len) { } method iterator (line 69) | iterator operator++() { method reference (line 73) | reference operator*() { method const_reference (line 76) | const_reference operator*() const { method iterator (line 79) | iterator operator++(int) { method iterator (line 84) | iterator operator--() { method iterator (line 88) | iterator operator--(int) { method iterator (line 93) | iterator operator+=(int n) { method iterator (line 99) | iterator operator-=(int n) { method iterator (line 103) | iterator operator+(int n) const { method iterator (line 108) | iterator operator-(int n) const { method vector (line 140) | explicit vector(const allocator_type& a = allocator_type()):len(0) { } method vector (line 142) | explicit vector(size_t n, const graphlab::empty& val = graphlab::emp... method vector (line 146) | vector(InputIterator first, InputIterator last, method vector (line 149) | vector(const vector& v): len(v.len)... method iterator (line 151) | iterator begin() { method iterator (line 61) | iterator(): i(0),len(NULL) { } method iterator (line 62) | iterator(size_t i, const size_t* len): i(i), len(len) { } method iterator (line 69) | iterator operator++() { method reference (line 73) | reference operator*() { method const_reference (line 76) | const_reference operator*() const { method iterator (line 79) | iterator operator++(int) { method iterator (line 84) | iterator operator--() { method iterator (line 88) | iterator operator--(int) { method iterator (line 93) | iterator operator+=(int n) { method iterator (line 99) | iterator operator-=(int n) { method iterator (line 103) | iterator operator+(int n) const { method iterator (line 108) | iterator operator-(int n) const { method iterator (line 154) | iterator end() { method iterator (line 61) | iterator(): i(0),len(NULL) { } method iterator (line 62) | iterator(size_t i, const size_t* len): i(i), len(len) { } method iterator (line 69) | iterator operator++() { method reference (line 73) | reference operator*() { method const_reference (line 76) | const_reference operator*() const { method iterator (line 79) | iterator operator++(int) { method iterator (line 84) | iterator operator--() { method iterator (line 88) | iterator operator--(int) { method iterator (line 93) | iterator operator+=(int n) { method iterator (line 99) | iterator operator-=(int n) { method iterator (line 103) | iterator operator+(int n) const { method iterator (line 108) | iterator operator-(int n) const { method const_iterator (line 157) | const_iterator begin() const { method const_iterator (line 160) | const_iterator end() const { method reverse_iterator (line 164) | reverse_iterator rbegin() { method reverse_iterator (line 167) | reverse_iterator rend() { method const_reverse_iterator (line 170) | const_reverse_iterator rbegin() const { method const_reverse_iterator (line 173) | const_reverse_iterator rend() const { method size (line 177) | size_t size() const { method capacity (line 181) | size_t capacity() const { method empty (line 185) | bool empty() const { method resize (line 189) | void resize(size_t s, const graphlab::empty& e = graphlab::empty()) ... method reserve (line 191) | void reserve(size_t s) {} method reference (line 193) | reference operator[](int i) { method const_reference (line 197) | const_reference operator[](int i) const { method reference (line 201) | reference at(int i) { method const_reference (line 206) | const_reference at(int i) const { method assign (line 212) | void assign(InputIterator first, InputIterator last) { method assign (line 217) | void assign(size_t n, const graphlab::empty&) { method push_back (line 221) | void push_back(const graphlab::empty&) { method pop_back (line 225) | void pop_back(const graphlab::empty&) { method insert (line 229) | void insert(iterator, const graphlab::empty&) { method insert (line 234) | void insert(iterator, size_t n, const graphlab::empty&) { method insert (line 240) | void insert(iterator, InputIterator first, InputIterator last) { method erase (line 244) | void erase(iterator) { method erase (line 248) | void erase(iterator first, iterator last) { method swap (line 252) | void swap(vector &v) { method clear (line 256) | void clear() { method allocator_type (line 260) | allocator_type get_allocator() const { FILE: src/graphlab/util/event_log.cpp type graphlab (line 31) | namespace graphlab { FILE: src/graphlab/util/event_log.hpp type graphlab (line 32) | namespace graphlab { class event_log (line 36) | class event_log{ type event_print_type (line 38) | enum event_print_type{ method event_log (line 69) | inline event_log():out(NULL), method accumulate_event (line 96) | inline void accumulate_event(unsigned char eventid, FILE: src/graphlab/util/fast_multinomial.hpp type graphlab (line 46) | namespace graphlab { class fast_multinomial (line 50) | class fast_multinomial { method next_powerof2 (line 80) | uint64_t next_powerof2(uint64_t val) { method left_child (line 95) | size_t left_child(size_t i) const { return 2 * i + 1; } method right_child (line 98) | size_t right_child(size_t i) const { return 2 * i + 2; } method parent (line 101) | size_t parent(size_t i) const { return (i-1) / 2; } method sibling (line 104) | size_t sibling(size_t i) const { method tree_loc_from_asg (line 111) | size_t tree_loc_from_asg(size_t asg) const { method asg_from_tree_loc (line 119) | size_t asg_from_tree_loc(size_t i) const { method is_leaf (line 128) | bool is_leaf(size_t i) const { method is_root (line 134) | bool is_root(size_t i) const { return i == 0; } method try_sample (line 139) | bool try_sample(size_t& asg, size_t cpuid) { method propagate_change (line 167) | void propagate_change(size_t loc) { method fast_multinomial (line 214) | fast_multinomial(size_t num_asg, method zero (line 229) | void zero(size_t asg) { method set (line 245) | void set(size_t asg, float_t value) { method add (line 266) | void add(size_t asg, float_t value) { method max (line 285) | void max(size_t asg, float_t value) { method sample (line 310) | bool sample(size_t& ret_asg, size_t cpuid) { method pop (line 351) | bool pop(size_t& ret_asg, size_t cpuid) { method positive_support (line 388) | size_t positive_support() { method print_tree (line 393) | void print_tree() { method float_t (line 409) | float_t get_weight(size_t asg) const { method has_support (line 414) | bool has_support(size_t asg) const { method clear (line 419) | void clear() { FILE: src/graphlab/util/fiber_blocking_queue.hpp type graphlab (line 37) | namespace graphlab { class fiber_blocking_queue (line 48) | class fiber_blocking_queue { method fiber_blocking_queue (line 64) | fiber_blocking_queue() : m_alive(true),sleeping(0) { } method wake_a_fiber (line 66) | void wake_a_fiber() { method wake_all_fibers (line 74) | void wake_all_fibers() { method fiber_sleep (line 82) | void fiber_sleep() { method enqueue (line 89) | inline void enqueue(const T& elem, bool wake_consumer = true) { method enqueue_to_head (line 98) | inline void enqueue_to_head(const T& elem) { method empty_unsafe (line 107) | bool empty_unsafe() { method is_alive (line 111) | bool is_alive() { method swap (line 115) | void swap(queue_type &q) { method wait_for_data (line 122) | inline bool wait_for_data() { method dequeue (line 150) | inline std::pair dequeue() { method try_dequeue (line 176) | inline std::pair try_dequeue() { method empty (line 195) | inline bool empty() { method stop_blocking (line 208) | inline void stop_blocking() { method start_blocking (line 219) | inline void start_blocking() { method size (line 226) | inline size_t size() { method broadcast (line 237) | void broadcast() { FILE: src/graphlab/util/fs_util.hpp type graphlab (line 31) | namespace graphlab { type fs_util (line 33) | namespace fs_util { FILE: src/graphlab/util/generate_pds.hpp type graphlab (line 26) | namespace graphlab { class pds (line 27) | class pds { method pds (line 29) | pds() {} method get_pds (line 30) | std::vector get_pds(size_t p) { method test_seq (line 56) | bool test_seq(size_t a, size_t b, size_t c, size_t p, std::vector find_pds(size_t p) { FILE: src/graphlab/util/generics/any.cpp type graphlab (line 26) | namespace graphlab { FILE: src/graphlab/util/generics/any.hpp type graphlab (line 56) | namespace graphlab { class any (line 139) | class any { class iholder (line 144) | class iholder { method any (line 159) | any() : contents(NULL) { } method any (line 163) | explicit any(const ValueType& value) method any (line 167) | any(const any & other) : method empty (line 174) | bool empty() const { return contents == NULL; } method ValueType (line 179) | ValueType& as() { method ValueType (line 188) | inline const ValueType& as() const{ method any (line 195) | any& swap(any & rhs) { method any (line 205) | any& operator=(const ValueType & rhs) { method any (line 216) | any& operator=(const any & rhs) { method type_name (line 238) | const std::string type_name() const { method load (line 243) | void load(iarchive& arc) { method save (line 252) | void save(oarchive& arc) const { method print_type_or_contents (line 282) | static method print_type_or_contents (line 289) | static class holder (line 301) | class holder : public iholder { method holder (line 307) | holder(const ValueType& value) : contents(value) { } method holder (line 309) | holder(iarchive_soft_fail& arc) { arc >> contents; } method iholder (line 313) | iholder* clone() const { return new holder(contents); } method deep_op_equal (line 315) | void deep_op_equal(const iholder* other) { method deserializer_id (line 322) | uint64_t deserializer_id() const { return registry.localid; } method save (line 323) | void save(oarchive_soft_fail &arc) const { method iholder (line 335) | static iholder* deserialize(iarchive_soft_fail &arc) { type registry_type (line 348) | struct registry_type { method registry_type (line 350) | registry_type() { method holder (line 363) | holder& operator=(const holder& other) { } FILE: src/graphlab/util/generics/blob.hpp type graphlab (line 36) | namespace graphlab { class blob (line 47) | class blob { method blob (line 53) | blob() : size_(0), data_(NULL) { } method blob (line 56) | blob(size_t new_size) : method blob (line 62) | blob(size_t osize, void* odata) : size_(0), data_(NULL) { method blob (line 67) | blob(const blob &b) : size_(0), data_(NULL) { method T (line 77) | T& as() { method T (line 85) | const T& as() const { method T (line 93) | T* as_ptr() { method T (line 101) | const T* as_ptr() const { method size (line 108) | size_t size() const { return size_; } method blob (line 118) | blob& operator=(const blob& b){ method copy (line 126) | void copy(size_t osize, void* odata) { method copy (line 133) | void copy(const blob& other) { method blob (line 142) | blob copy() const{ method resize (line 146) | void resize(size_t new_size) { method clear (line 164) | void clear() { method swap (line 175) | void swap(blob &b) { method load (line 186) | void load(iarchive& arc) { method save (line 197) | void save(oarchive& arc) const { FILE: src/graphlab/util/generics/block_linked_list.hpp type graphlab (line 36) | namespace graphlab { class block_linked_list (line 41) | class block_linked_list { method block_linked_list (line 48) | block_linked_list() : head(NULL), tail(NULL), _size(0) { } method block_linked_list (line 52) | block_linked_list(InputIterator first, InputIterator last) { method assign (line 65) | void assign(InputIterator first, InputIterator last) { method size (line 96) | size_t size() const { return _size; } method get_blocksize (line 98) | static const size_t get_blocksize() { class value_iterator (line 110) | class value_iterator : type enabler (line 114) | struct enabler {} method value_iterator (line 117) | value_iterator(blocktype* blockptr, uint32_t offset) : method value_iterator (line 121) | value_iterator(value_iterator const& other, method pdistance_to (line 130) | ptrdiff_t pdistance_to(const value_iterator& other) const { method increment (line 140) | void increment() { method equal (line 150) | bool equal(value_iterator const& other) const { method value (line 154) | value& dereference() const { method advance (line 159) | void advance(int n) { method distance_to (line 172) | ptrdiff_t distance_to(const value_iterator& other) const { method blocktype (line 204) | blocktype*& get_blockptr() { method iterator (line 219) | iterator begin() { method iterator (line 223) | iterator end() { method const_iterator (line 227) | const_iterator begin() const { method const_iterator (line 231) | const_iterator end() const { method iterator (line 241) | iterator insert(iterator iter, const valuetype& val) { method insert (line 278) | std::pair method merge_next (line 328) | void merge_next(blocktype* bptr) { method repack (line 362) | void repack(iterator begin_iter, iterator end_iter) { method blocktype (line 381) | blocktype* get_block(size_t n) { method num_blocks (line 391) | size_t num_blocks() const { method print (line 404) | void print(std::ostream& out) const { method swap (line 415) | void swap (block_linked_list& other) { method clear (line 425) | void clear() { method save (line 439) | void save(oarchive& oarc) const { method iterator (line 451) | iterator get_insert_iterator(iterator iter) { method blocktype (line 465) | blocktype* insert_block(blocktype* ins) { method blocktype (line 475) | blocktype* append_block() { method append_to_block (line 494) | std::pair FILE: src/graphlab/util/generics/conditional_addition_wrapper.hpp type graphlab (line 31) | namespace graphlab { type conditional_addition_wrapper (line 34) | struct conditional_addition_wrapper { method conditional_addition_wrapper (line 38) | conditional_addition_wrapper() : has_value(false), value(T()) {} method conditional_addition_wrapper (line 39) | explicit conditional_addition_wrapper(const T& t, method set (line 43) | void set(const T& t) { method swap (line 47) | void swap(T& t) { method clear (line 51) | void clear() { method empty (line 56) | bool empty() const { method not_empty (line 60) | bool not_empty() const { method conditional_addition_wrapper (line 65) | conditional_addition_wrapper& method conditional_addition_wrapper (line 79) | conditional_addition_wrapper& operator+=(const T& c) { method save (line 92) | void save(oarchive& oarc) const { method load (line 98) | void load(iarchive& iarc) { FILE: src/graphlab/util/generics/conditional_combiner_wrapper.hpp type graphlab (line 32) | namespace graphlab { type conditional_combiner_wrapper (line 35) | struct conditional_combiner_wrapper { method conditional_combiner_wrapper (line 40) | conditional_combiner_wrapper(boost::function com... method conditional_combiner_wrapper (line 41) | explicit conditional_combiner_wrapper(const T& t, method set_combiner (line 45) | void set_combiner(boost::function comb) { method set (line 49) | void set(const T& t) { method swap (line 53) | void swap(T& t) { method clear (line 57) | void clear() { method empty (line 62) | bool empty() const { method not_empty (line 66) | bool not_empty() const { method conditional_combiner_wrapper (line 71) | conditional_combiner_wrapper& method conditional_combiner_wrapper (line 85) | conditional_combiner_wrapper& operator+=(const T& c) { method save (line 98) | void save(oarchive& oarc) const { method load (line 104) | void load(iarchive& iarc) { FILE: src/graphlab/util/generics/counting_sort.hpp type graphlab (line 32) | namespace graphlab { function counting_sort (line 39) | void counting_sort(const std::vector& value_vec, FILE: src/graphlab/util/generics/csr_storage.hpp type graphlab (line 32) | namespace graphlab { class csr_storage (line 40) | class csr_storage { method csr_storage (line 47) | csr_storage() { } method csr_storage (line 54) | csr_storage(const std::vector& id_vec, method init (line 60) | void init(const std::vector& id_vec, method wrap (line 109) | void wrap(std::vector& valueptr_vec, method num_keys (line 120) | inline size_t num_keys() const { return value_ptrs.size(); } method num_values (line 123) | inline size_t num_values() const { return values.size(); } method iterator (line 126) | inline iterator begin(size_t id) { method iterator (line 131) | inline iterator end(size_t id) { method const_iterator (line 136) | inline const_iterator begin(size_t id) const { method const_iterator (line 141) | inline const_iterator end(size_t id) const { method print (line 146) | void print(std::ostream& out) { method get_values (line 159) | std::vector get_values() { return values; } method get_index (line 160) | std::vector get_index() { return value_ptrs; } method swap (line 162) | void swap(csr_storage& other) { method clear (line 167) | void clear() { method load (line 172) | void load(iarchive& iarc) { method save (line 177) | void save(oarchive& oarc) const { method estimate_sizeof (line 182) | size_t estimate_sizeof() const { FILE: src/graphlab/util/generics/dynamic_block.hpp type graphlab (line 30) | namespace graphlab { class block_linked_list (line 32) | class block_linked_list class dynamic_block (line 38) | class dynamic_block { method dynamic_block (line 42) | dynamic_block() : _next(NULL), _size(0) { } method assign (line 45) | void assign(InputIterator first, InputIterator last) { method split (line 58) | void split() { method valuetype (line 72) | valuetype& get(uint32_t i) { method try_add (line 79) | bool try_add(const valuetype& elem) { method is_full (line 88) | inline bool is_full() const { return _size == capacity; } method insert (line 92) | bool insert(const valuetype& elem, uint32_t pos) { method size (line 105) | size_t size() const { method dynamic_block (line 109) | dynamic_block* next() { method clear (line 113) | void clear() { method print (line 118) | void print(std::ostream& out) { FILE: src/graphlab/util/generics/dynamic_csr_storage.hpp type graphlab (line 37) | namespace graphlab { class dynamic_csr_storage (line 49) | class dynamic_csr_storage { method dynamic_csr_storage (line 58) | dynamic_csr_storage() { } method dynamic_csr_storage (line 65) | dynamic_csr_storage(const std::vector& id_vec, method wrap (line 76) | void wrap(std::vector& valueptr_vec, method num_keys (line 92) | inline size_t num_keys() const { return value_ptrs.size(); } method num_values (line 95) | inline size_t num_values() const { return values.size(); } method iterator (line 98) | inline iterator begin(size_t id) { method iterator (line 103) | inline iterator end(size_t id) { method const_iterator (line 108) | inline const_iterator begin(size_t id) const { method const_iterator (line 113) | inline const_iterator end(size_t id) const { method insert (line 120) | void insert (const idtype& key, const valuetype& value) { method insert (line 126) | void insert (const idtype& key, InputIterator first, InputIterator l... method repack (line 166) | void repack() { method print (line 178) | void print(std::ostream& out) const { method swap (line 192) | void swap(dynamic_csr_storage& other) { method clear (line 197) | void clear() { method load (line 202) | void load(iarchive& iarc) { method save (line 211) | void save(oarchive& oarc) const { method block_linked_list_t (line 232) | const block_linked_list_t& get_values() { return values; } method estimate_sizeof (line 234) | size_t estimate_sizeof() const { method meminfo (line 238) | void meminfo(std::ostream& out) { method init (line 255) | void init(const std::vector& id_vec, method sizevec2ptrvec (line 306) | void sizevec2ptrvec (const std::vector& ptrs, FILE: src/graphlab/util/generics/float_selector.hpp type graphlab (line 27) | namespace graphlab { type float_selector (line 30) | struct float_selector { type float_selector<4> (line 36) | struct float_selector<4> { type float_selector<8> (line 41) | struct float_selector<8> { type float_selector<16> (line 46) | struct float_selector<16> { FILE: src/graphlab/util/generics/integer_selector.hpp type graphlab (line 27) | namespace graphlab { type u_integer_selector (line 30) | struct u_integer_selector { type u_integer_selector<1> (line 35) | struct u_integer_selector<1> { type u_integer_selector<2> (line 40) | struct u_integer_selector<2> { type u_integer_selector<4> (line 45) | struct u_integer_selector<4> { type u_integer_selector<8> (line 50) | struct u_integer_selector<8> { FILE: src/graphlab/util/generics/remove_member_pointer.hpp type detail (line 52) | namespace detail{ type rem_mem_pointer_impl (line 54) | struct rem_mem_pointer_impl{ typedef T type; } type rem_mem_pointer_impl (line 56) | struct rem_mem_pointer_impl { typedef R type; } type rem_mem_pointer_impl (line 58) | struct rem_mem_pointer_impl { typedef R type; } type rem_mem_pointer_impl (line 60) | struct rem_mem_pointer_impl { typedef R type; } type rem_mem_pointer_impl (line 62) | struct rem_mem_pointer_impl { typedef R type; } type rem_mem_pointer_impl (line 67) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 75) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 78) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 96) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 104) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 107) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 125) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 133) | struct rem_mem_pointer_impl { typedef... type rem_mem_pointer_impl (line 136) | struct rem_mem_pointer_impl { type... type rem_mem_pointer_impl (line 154) | struct rem_mem_pointer_impl { typedef R type(); } type rem_mem_pointer_impl (line 162) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 165) | struct rem_mem_pointer_impl { typedef R ... type rem_mem_pointer_impl (line 182) | struct rem_mem_pointer_impl { typedef R type( T0); } type rem_mem_pointer_impl (line 190) | struct rem_mem_pointer_impl { typedef R type( T0... type rem_mem_pointer_impl (line 193) | struct rem_mem_pointer_impl { typedef R type(... type rem_mem_pointer_impl (line 211) | struct rem_mem_pointer_impl { typedef R type( T0); } type rem_mem_pointer_impl (line 219) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 222) | struct rem_mem_pointer_impl { typedef R ... type rem_mem_pointer_impl (line 240) | struct rem_mem_pointer_impl { typedef R ... type rem_mem_pointer_impl (line 248) | struct rem_mem_pointer_impl { type... type rem_mem_pointer_impl (line 251) | struct rem_mem_pointer_impl { t... type rem_mem_pointer_impl (line 269) | struct rem_mem_pointer_impl { typedef R type( ... type rem_mem_pointer_impl (line 277) | struct rem_mem_pointer_impl { typedef R ... type rem_mem_pointer_impl (line 280) | struct rem_mem_pointer_impl { typedef... type rem_mem_pointer_impl (line 297) | struct rem_mem_pointer_impl { typedef R type( T0 ... type rem_mem_pointer_impl (line 305) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 308) | struct rem_mem_pointer_impl { typedef R ... type rem_mem_pointer_impl (line 326) | struct rem_mem_pointer_impl { typedef R type... type rem_mem_pointer_impl (line 334) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 337) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 355) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 363) | struct rem_mem_pointer_impl {... type rem_mem_pointer_impl (line 366) | struct rem_mem_pointer_impl (line 384) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 392) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 395) | struct rem_mem_pointer_impl { ty... type rem_mem_pointer_impl (line 412) | struct rem_mem_pointer_impl { typedef R type... type rem_mem_pointer_impl (line 420) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 423) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 441) | struct rem_mem_pointer_impl { typedef R... type rem_mem_pointer_impl (line 449) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 452) | struct rem_mem_pointer_impl { ... type rem_mem_pointer_impl (line 470) | struct rem_mem_pointer_impl { ... type rem_mem_pointer_impl (line 478) | struct rem_mem_pointer_impl (line 481) | struct rem_mem_pointer_impl (line 499) | struct rem_mem_pointer_impl { typede... type rem_mem_pointer_impl (line 507) | struct rem_mem_pointer_impl { ... type rem_mem_pointer_impl (line 510) | struct rem_mem_pointer_impl... type rem_mem_pointer_impl (line 527) | struct rem_mem_pointer_impl { typedef R... type rem_mem_pointer_impl (line 535) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 538) | struct rem_mem_pointer_impl { ... type rem_mem_pointer_impl (line 556) | struct rem_mem_pointer_impl { type... type rem_mem_pointer_impl (line 564) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 567) | struct rem_mem_pointer_impl (line 585) | struct rem_mem_pointer_impl (line 593) | struct rem_mem_pointer_impl (line 596) | struct rem_mem_pointer_impl (line 614) | struct rem_mem_pointer_impl { t... type rem_mem_pointer_impl (line 622) | struct rem_mem_pointer_impl (line 625) | struct rem_mem_pointer_impl (line 642) | struct rem_mem_pointer_impl { type... type rem_mem_pointer_impl (line 650) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 653) | struct rem_mem_pointer_impl (line 671) | struct rem_mem_pointer_impl {... type rem_mem_pointer_impl (line 679) | struct rem_mem_pointer_impl (line 682) | struct rem_mem_pointer_impl (line 700) | struct rem_mem_pointer_impl (line 708) | struct rem_mem_pointer_impl (line 711) | struct rem_mem_pointer_impl (line 729) | struct rem_mem_pointer_impl (line 737) | struct rem_mem_pointer_impl (line 740) | struct rem_mem_pointer_impl (line 757) | struct rem_mem_pointer_impl {... type rem_mem_pointer_impl (line 765) | struct rem_mem_pointer_impl (line 768) | struct rem_mem_pointer_impl (line 786) | struct rem_mem_pointer_impl (line 794) | struct rem_mem_pointer_impl (line 797) | struct rem_mem_pointer_impl (line 815) | struct rem_mem_pointer_impl (line 823) | struct rem_mem_pointer_impl (line 826) | struct rem_mem_pointer_impl (line 844) | struct rem_mem_pointer_impl (line 852) | struct rem_mem_pointer_impl (line 855) | struct rem_mem_pointer_impl (line 872) | struct rem_mem_pointer_impl (line 880) | struct rem_mem_pointer_impl (line 883) | struct rem_mem_pointer_impl (line 901) | struct rem_mem_pointer_impl (line 909) | struct rem_mem_pointer_impl (line 912) | struct rem_mem_pointer_impl (line 930) | struct rem_mem_pointer_impl (line 938) | struct rem_mem_pointer_impl (line 941) | struct rem_mem_pointer_impl (line 959) | struct rem_mem_pointer_impl (line 967) | struct rem_mem_pointer_impl (line 970) | struct rem_mem_pointer_impl (line 987) | struct rem_mem_pointer_impl (line 995) | struct rem_mem_pointer_impl (line 998) | struct rem_mem_pointer_impl (line 1016) | struct rem_mem_pointer_impl (line 1024) | struct rem_mem_pointer_impl (line 1027) | struct rem_mem_pointer_impl (line 1045) | struct rem_mem_pointer_impl (line 1053) | struct rem_mem_pointer_impl (line 1056) | struct rem_mem_pointer_impl (line 1074) | struct rem_mem_pointer_impl (line 1082) | struct rem_mem_pointer_impl (line 1085) | struct rem_mem_pointer_impl (line 1102) | struct rem_mem_pointer_impl (line 1110) | struct rem_mem_pointer_impl (line 1113) | struct rem_mem_pointer_impl (line 1131) | struct rem_mem_pointer_impl (line 1139) | struct rem_mem_pointer_impl (line 1142) | struct rem_mem_pointer_impl (line 1160) | struct rem_mem_pointer_impl (line 1168) | struct rem_mem_pointer_impl (line 1171) | struct rem_mem_pointer_impl (line 1189) | struct rem_mem_pointer_impl (line 1197) | struct rem_mem_pointer_impl (line 1200) | struct rem_mem_pointer_impl (line 1217) | struct rem_mem_pointer_impl (line 1225) | struct rem_mem_pointer_impl (line 1228) | struct rem_mem_pointer_impl (line 1246) | struct rem_mem_pointer_impl (line 1254) | struct rem_mem_pointer_impl (line 1257) | struct rem_mem_pointer_impl (line 1275) | struct rem_mem_pointer_impl (line 1283) | struct rem_mem_pointer_impl (line 1286) | struct rem_mem_pointer_impl (line 1304) | struct rem_mem_pointer_impl (line 1312) | struct rem_mem_pointer_impl (line 1315) | struct rem_mem_pointer_impl (line 1332) | struct rem_mem_pointer_impl (line 1340) | struct rem_mem_pointer_impl (line 1343) | struct rem_mem_pointer_impl (line 1361) | struct rem_mem_pointer_impl (line 1369) | struct rem_mem_pointer_impl (line 1372) | struct rem_mem_pointer_impl (line 1390) | struct rem_mem_pointer_impl (line 1398) | struct rem_mem_pointer_impl (line 1401) | struct rem_mem_pointer_impl (line 1419) | struct rem_mem_pointer_impl (line 1427) | struct rem_mem_pointer_impl (line 1430) | struct rem_mem_pointer_impl (line 1447) | struct rem_mem_pointer_impl (line 1455) | struct rem_mem_pointer_impl (line 1458) | struct rem_mem_pointer_impl (line 1476) | struct rem_mem_pointer_impl (line 1484) | struct rem_mem_pointer_impl (line 1487) | struct rem_mem_pointer_impl (line 1505) | struct rem_mem_pointer_impl (line 1513) | struct rem_mem_pointer_impl (line 1516) | struct rem_mem_pointer_impl (line 1534) | struct rem_mem_pointer_impl (line 1542) | struct rem_mem_pointer_impl (line 1545) | struct rem_mem_pointer_impl (line 1562) | struct rem_mem_pointer_impl (line 1570) | struct rem_mem_pointer_impl (line 1573) | struct rem_mem_pointer_impl (line 1591) | struct rem_mem_pointer_impl (line 1599) | struct rem_mem_pointer_impl (line 1602) | struct rem_mem_pointer_impl (line 1620) | struct rem_mem_pointer_impl (line 1628) | struct rem_mem_pointer_impl (line 1631) | struct rem_mem_pointer_impl (line 1649) | struct rem_mem_pointer_impl (line 1657) | struct rem_mem_pointer_impl (line 1660) | struct rem_mem_pointer_impl (line 1677) | struct rem_mem_pointer_impl (line 1685) | struct rem_mem_pointer_impl (line 1688) | struct rem_mem_pointer_impl (line 1706) | struct rem_mem_pointer_impl (line 1714) | struct rem_mem_pointer_impl (line 1717) | struct rem_mem_pointer_impl (line 1735) | struct rem_mem_pointer_impl (line 1743) | struct rem_mem_pointer_impl (line 1746) | struct rem_mem_pointer_impl (line 1764) | struct rem_mem_pointer_impl (line 1772) | struct rem_mem_pointer_impl (line 1775) | struct rem_mem_pointer_impl (line 1792) | struct rem_mem_pointer_impl (line 1800) | struct rem_mem_pointer_impl (line 1803) | struct rem_mem_pointer_impl (line 1821) | struct rem_mem_pointer_impl (line 1829) | struct rem_mem_pointer_impl (line 1832) | struct rem_mem_pointer_impl (line 1850) | struct rem_mem_pointer_impl (line 1858) | struct rem_mem_pointer_impl (line 1861) | struct rem_mem_pointer_impl (line 1879) | struct rem_mem_pointer_impl (line 1887) | struct rem_mem_pointer_impl (line 1890) | struct rem_mem_pointer_impl (line 1907) | struct rem_mem_pointer_impl (line 1915) | struct rem_mem_pointer_impl (line 1918) | struct rem_mem_pointer_impl (line 1936) | struct rem_mem_pointer_impl (line 1944) | struct rem_mem_pointer_impl (line 1947) | struct rem_mem_pointer_impl (line 1965) | struct rem_mem_pointer_impl (line 1973) | struct rem_mem_pointer_impl (line 1976) | struct rem_mem_pointer_impl (line 1994) | struct rem_mem_pointer_impl (line 2002) | struct rem_mem_pointer_impl (line 2005) | struct rem_mem_pointer_impl (line 2022) | struct rem_mem_pointer_impl (line 2030) | struct rem_mem_pointer_impl (line 2033) | struct rem_mem_pointer_impl (line 2051) | struct rem_mem_pointer_impl (line 2059) | struct rem_mem_pointer_impl (line 2062) | struct rem_mem_pointer_impl (line 2080) | struct rem_mem_pointer_impl (line 2088) | struct rem_mem_pointer_impl (line 2091) | struct rem_mem_pointer_impl (line 2109) | struct rem_mem_pointer_impl (line 2117) | struct rem_mem_pointer_impl (line 2120) | struct rem_mem_pointer_impl (line 2137) | struct rem_mem_pointer_impl (line 2145) | struct rem_mem_pointer_impl (line 2148) | struct rem_mem_pointer_impl (line 2166) | struct rem_mem_pointer_impl (line 2174) | struct rem_mem_pointer_impl (line 2177) | struct rem_mem_pointer_impl (line 2195) | struct rem_mem_pointer_impl (line 2203) | struct rem_mem_pointer_impl (line 2206) | struct rem_mem_pointer_impl (line 2224) | struct rem_mem_pointer_impl (line 2232) | struct rem_mem_pointer_impl (line 2235) | struct rem_mem_pointer_impl (line 2252) | struct rem_mem_pointer_impl (line 2260) | struct rem_mem_pointer_impl (line 2263) | struct rem_mem_pointer_impl (line 2281) | struct rem_mem_pointer_impl (line 2289) | struct rem_mem_pointer_impl (line 2292) | struct rem_mem_pointer_impl (line 2310) | struct rem_mem_pointer_impl (line 2318) | struct rem_mem_pointer_impl (line 2321) | struct rem_mem_pointer_impl (line 2339) | struct rem_mem_pointer_impl (line 2347) | struct rem_mem_pointer_impl (line 2350) | struct rem_mem_pointer_impl (line 2367) | struct rem_mem_pointer_impl (line 2375) | struct rem_mem_pointer_impl (line 2378) | struct rem_mem_pointer_impl (line 2396) | struct rem_mem_pointer_impl (line 2404) | struct rem_mem_pointer_impl (line 2407) | struct rem_mem_pointer_impl (line 2425) | struct rem_mem_pointer_impl (line 2433) | struct rem_mem_pointer_impl (line 2436) | struct rem_mem_pointer_impl (line 2454) | struct rem_mem_pointer_impl (line 2462) | struct rem_mem_pointer_impl (line 2465) | struct rem_mem_pointer_impl (line 2482) | struct rem_mem_pointer_impl (line 2490) | struct rem_mem_pointer_impl (line 2493) | struct rem_mem_pointer_impl (line 2511) | struct rem_mem_pointer_impl (line 2519) | struct rem_mem_pointer_impl (line 2522) | struct rem_mem_pointer_impl (line 2540) | struct rem_mem_pointer_impl (line 2548) | struct rem_mem_pointer_impl (line 2551) | struct rem_mem_pointer_impl (line 2569) | struct rem_mem_pointer_impl (line 2577) | struct rem_mem_pointer_impl (line 2580) | struct rem_mem_pointer_impl (line 2597) | struct rem_mem_pointer_impl (line 2605) | struct rem_mem_pointer_impl (line 2608) | struct rem_mem_pointer_impl (line 2626) | struct rem_mem_pointer_impl (line 2634) | struct rem_mem_pointer_impl (line 2637) | struct rem_mem_pointer_impl (line 2655) | struct rem_mem_pointer_impl (line 2663) | struct rem_mem_pointer_impl (line 2666) | struct rem_mem_pointer_impl (line 2684) | struct rem_mem_pointer_impl (line 2692) | struct rem_mem_pointer_impl (line 2695) | struct rem_mem_pointer_impl (line 2712) | struct rem_mem_pointer_impl (line 2720) | struct rem_mem_pointer_impl (line 2723) | struct rem_mem_pointer_impl (line 2741) | struct rem_mem_pointer_impl (line 2749) | struct rem_mem_pointer_impl (line 2752) | struct rem_mem_pointer_impl (line 2770) | struct rem_mem_pointer_impl (line 2778) | struct rem_mem_pointer_impl (line 2781) | struct rem_mem_pointer_impl (line 2799) | struct rem_mem_pointer_impl (line 2807) | struct rem_mem_pointer_impl (line 2810) | struct rem_mem_pointer_impl (line 2827) | struct rem_mem_pointer_impl (line 2835) | struct rem_mem_pointer_impl (line 2838) | struct rem_mem_pointer_impl (line 2856) | struct rem_mem_pointer_impl (line 2864) | struct rem_mem_pointer_impl (line 2867) | struct rem_mem_pointer_impl (line 2885) | struct rem_mem_pointer_impl (line 2893) | struct rem_mem_pointer_impl (line 2896) | struct rem_mem_pointer_impl (line 2914) | struct rem_mem_pointer_impl (line 2922) | struct rem_mem_pointer_impl (line 2925) | struct rem_mem_pointer_impl (line 2942) | struct rem_mem_pointer_impl (line 2950) | struct rem_mem_pointer_impl (line 2953) | struct rem_mem_pointer_impl (line 2971) | struct rem_mem_pointer_impl (line 2979) | struct rem_mem_pointer_impl (line 2982) | struct rem_mem_pointer_impl (line 3000) | struct rem_mem_pointer_impl (line 3008) | struct rem_mem_pointer_impl (line 3011) | struct rem_mem_pointer_impl (line 3029) | struct rem_mem_pointer_impl (line 3037) | struct rem_mem_pointer_impl (line 3040) | struct rem_mem_pointer_impl (line 70) | struct rem_mem_pointer_impl { typedef R type( ...); } type rem_mem_pointer_impl (line 85) | struct rem_mem_pointer_impl { typedef R type( ...... type rem_mem_pointer_impl (line 88) | struct rem_mem_pointer_impl { typedef R type( ... type rem_mem_pointer_impl (line 99) | struct rem_mem_pointer_impl { typedef R type( ...); } type rem_mem_pointer_impl (line 114) | struct rem_mem_pointer_impl { typedef R type... type rem_mem_pointer_impl (line 117) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 128) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 143) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 146) | struct rem_mem_pointer_impl { ty... type rem_mem_pointer_impl (line 157) | struct rem_mem_pointer_impl { typedef R type( .... type rem_mem_pointer_impl (line 172) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 175) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 185) | struct rem_mem_pointer_impl { typedef R type( T0 ...... type rem_mem_pointer_impl (line 200) | struct rem_mem_pointer_impl { typedef R type( ... type rem_mem_pointer_impl (line 203) | struct rem_mem_pointer_impl { typedef R typ... type rem_mem_pointer_impl (line 214) | struct rem_mem_pointer_impl { typedef R type( T... type rem_mem_pointer_impl (line 229) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 232) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 243) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 258) | struct rem_mem_pointer_impl { ty... type rem_mem_pointer_impl (line 261) | struct rem_mem_pointer_impl {... type rem_mem_pointer_impl (line 272) | struct rem_mem_pointer_impl { typedef R type... type rem_mem_pointer_impl (line 287) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 290) | struct rem_mem_pointer_impl { typed... type rem_mem_pointer_impl (line 300) | struct rem_mem_pointer_impl { typedef R type( T... type rem_mem_pointer_impl (line 315) | struct rem_mem_pointer_impl { typedef R t... type rem_mem_pointer_impl (line 318) | struct rem_mem_pointer_impl { typedef ... type rem_mem_pointer_impl (line 329) | struct rem_mem_pointer_impl { typedef R ty... type rem_mem_pointer_impl (line 344) | struct rem_mem_pointer_impl { typede... type rem_mem_pointer_impl (line 347) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 358) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 373) | struct rem_mem_pointer_impl... type rem_mem_pointer_impl (line 376) | struct rem_mem_pointer_impl (line 387) | struct rem_mem_pointer_impl { typedef R... type rem_mem_pointer_impl (line 402) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 405) | struct rem_mem_pointer_impl { ... type rem_mem_pointer_impl (line 415) | struct rem_mem_pointer_impl { typedef R ty... type rem_mem_pointer_impl (line 430) | struct rem_mem_pointer_impl { typede... type rem_mem_pointer_impl (line 433) | struct rem_mem_pointer_impl { typ... type rem_mem_pointer_impl (line 444) | struct rem_mem_pointer_impl { typedef... type rem_mem_pointer_impl (line 459) | struct rem_mem_pointer_impl { t... type rem_mem_pointer_impl (line 462) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 473) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 488) | struct rem_mem_pointer_impl (line 491) | struct rem_mem_pointer_impl (line 502) | struct rem_mem_pointer_impl { type... type rem_mem_pointer_impl (line 517) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 520) | struct rem_mem_pointer_impl (line 530) | struct rem_mem_pointer_impl { typedef... type rem_mem_pointer_impl (line 545) | struct rem_mem_pointer_impl { t... type rem_mem_pointer_impl (line 548) | struct rem_mem_pointer_impl ... type rem_mem_pointer_impl (line 559) | struct rem_mem_pointer_impl { ty... type rem_mem_pointer_impl (line 574) | struct rem_mem_pointer_impl (line 577) | struct rem_mem_pointer_impl (line 588) | struct rem_mem_pointer_impl (line 603) | struct rem_mem_pointer_impl (line 606) | struct rem_mem_pointer_impl (line 617) | struct rem_mem_pointer_impl {... type rem_mem_pointer_impl (line 632) | struct rem_mem_pointer_impl (line 635) | struct rem_mem_pointer_impl (line 645) | struct rem_mem_pointer_impl { ty... type rem_mem_pointer_impl (line 660) | struct rem_mem_pointer_impl (line 663) | struct rem_mem_pointer_impl (line 674) | struct rem_mem_pointer_impl... type rem_mem_pointer_impl (line 689) | struct rem_mem_pointer_impl (line 692) | struct rem_mem_pointer_impl (line 703) | struct rem_mem_pointer_impl (line 718) | struct rem_mem_pointer_impl (line 721) | struct rem_mem_pointer_impl (line 732) | struct rem_mem_pointer_impl (line 747) | struct rem_mem_pointer_impl (line 750) | struct rem_mem_pointer_impl (line 760) | struct rem_mem_pointer_impl... type rem_mem_pointer_impl (line 775) | struct rem_mem_pointer_impl (line 778) | struct rem_mem_pointer_impl (line 789) | struct rem_mem_pointer_impl (line 804) | struct rem_mem_pointer_impl (line 807) | struct rem_mem_pointer_impl (line 818) | struct rem_mem_pointer_impl (line 833) | struct rem_mem_pointer_impl (line 836) | struct rem_mem_pointer_impl (line 847) | struct rem_mem_pointer_impl (line 862) | struct rem_mem_pointer_impl (line 865) | struct rem_mem_pointer_impl (line 875) | struct rem_mem_pointer_impl (line 890) | struct rem_mem_pointer_impl (line 893) | struct rem_mem_pointer_impl (line 904) | struct rem_mem_pointer_impl (line 919) | struct rem_mem_pointer_impl (line 922) | struct rem_mem_pointer_impl (line 933) | struct rem_mem_pointer_impl (line 948) | struct rem_mem_pointer_impl (line 951) | struct rem_mem_pointer_impl (line 962) | struct rem_mem_pointer_impl (line 977) | struct rem_mem_pointer_impl (line 980) | struct rem_mem_pointer_impl (line 990) | struct rem_mem_pointer_impl (line 1005) | struct rem_mem_pointer_impl (line 1008) | struct rem_mem_pointer_impl (line 1019) | struct rem_mem_pointer_impl (line 1034) | struct rem_mem_pointer_impl (line 1037) | struct rem_mem_pointer_impl (line 1048) | struct rem_mem_pointer_impl (line 1063) | struct rem_mem_pointer_impl (line 1066) | struct rem_mem_pointer_impl (line 1077) | struct rem_mem_pointer_impl (line 1092) | struct rem_mem_pointer_impl (line 1095) | struct rem_mem_pointer_impl (line 1105) | struct rem_mem_pointer_impl (line 1120) | struct rem_mem_pointer_impl (line 1123) | struct rem_mem_pointer_impl (line 1134) | struct rem_mem_pointer_impl (line 1149) | struct rem_mem_pointer_impl (line 1152) | struct rem_mem_pointer_impl (line 1163) | struct rem_mem_pointer_impl (line 1178) | struct rem_mem_pointer_impl (line 1181) | struct rem_mem_pointer_impl (line 1192) | struct rem_mem_pointer_impl (line 1207) | struct rem_mem_pointer_impl (line 1210) | struct rem_mem_pointer_impl (line 1220) | struct rem_mem_pointer_impl (line 1235) | struct rem_mem_pointer_impl (line 1238) | struct rem_mem_pointer_impl (line 1249) | struct rem_mem_pointer_impl (line 1264) | struct rem_mem_pointer_impl (line 1267) | struct rem_mem_pointer_impl (line 1278) | struct rem_mem_pointer_impl (line 1293) | struct rem_mem_pointer_impl (line 1296) | struct rem_mem_pointer_impl (line 1307) | struct rem_mem_pointer_impl (line 1322) | struct rem_mem_pointer_impl (line 1325) | struct rem_mem_pointer_impl (line 1335) | struct rem_mem_pointer_impl (line 1350) | struct rem_mem_pointer_impl (line 1353) | struct rem_mem_pointer_impl (line 1364) | struct rem_mem_pointer_impl (line 1379) | struct rem_mem_pointer_impl (line 1382) | struct rem_mem_pointer_impl (line 1393) | struct rem_mem_pointer_impl (line 1408) | struct rem_mem_pointer_impl (line 1411) | struct rem_mem_pointer_impl (line 1422) | struct rem_mem_pointer_impl (line 1437) | struct rem_mem_pointer_impl (line 1440) | struct rem_mem_pointer_impl (line 1450) | struct rem_mem_pointer_impl (line 1465) | struct rem_mem_pointer_impl (line 1468) | struct rem_mem_pointer_impl (line 1479) | struct rem_mem_pointer_impl (line 1494) | struct rem_mem_pointer_impl (line 1497) | struct rem_mem_pointer_impl (line 1508) | struct rem_mem_pointer_impl (line 1523) | struct rem_mem_pointer_impl (line 1526) | struct rem_mem_pointer_impl (line 1537) | struct rem_mem_pointer_impl (line 1552) | struct rem_mem_pointer_impl (line 1555) | struct rem_mem_pointer_impl (line 1565) | struct rem_mem_pointer_impl (line 1580) | struct rem_mem_pointer_impl (line 1583) | struct rem_mem_pointer_impl (line 1594) | struct rem_mem_pointer_impl (line 1609) | struct rem_mem_pointer_impl (line 1612) | struct rem_mem_pointer_impl (line 1623) | struct rem_mem_pointer_impl (line 1638) | struct rem_mem_pointer_impl (line 1641) | struct rem_mem_pointer_impl (line 1652) | struct rem_mem_pointer_impl (line 1667) | struct rem_mem_pointer_impl (line 1670) | struct rem_mem_pointer_impl (line 1680) | struct rem_mem_pointer_impl (line 1695) | struct rem_mem_pointer_impl (line 1698) | struct rem_mem_pointer_impl (line 1709) | struct rem_mem_pointer_impl (line 1724) | struct rem_mem_pointer_impl (line 1727) | struct rem_mem_pointer_impl (line 1738) | struct rem_mem_pointer_impl (line 1753) | struct rem_mem_pointer_impl (line 1756) | struct rem_mem_pointer_impl (line 1767) | struct rem_mem_pointer_impl (line 1782) | struct rem_mem_pointer_impl (line 1785) | struct rem_mem_pointer_impl (line 1795) | struct rem_mem_pointer_impl (line 1810) | struct rem_mem_pointer_impl (line 1813) | struct rem_mem_pointer_impl (line 1824) | struct rem_mem_pointer_impl (line 1839) | struct rem_mem_pointer_impl (line 1842) | struct rem_mem_pointer_impl (line 1853) | struct rem_mem_pointer_impl (line 1868) | struct rem_mem_pointer_impl (line 1871) | struct rem_mem_pointer_impl (line 1882) | struct rem_mem_pointer_impl (line 1897) | struct rem_mem_pointer_impl (line 1900) | struct rem_mem_pointer_impl (line 1910) | struct rem_mem_pointer_impl (line 1925) | struct rem_mem_pointer_impl (line 1928) | struct rem_mem_pointer_impl (line 1939) | struct rem_mem_pointer_impl (line 1954) | struct rem_mem_pointer_impl (line 1957) | struct rem_mem_pointer_impl (line 1968) | struct rem_mem_pointer_impl (line 1983) | struct rem_mem_pointer_impl (line 1986) | struct rem_mem_pointer_impl (line 1997) | struct rem_mem_pointer_impl (line 2012) | struct rem_mem_pointer_impl (line 2015) | struct rem_mem_pointer_impl (line 2025) | struct rem_mem_pointer_impl (line 2040) | struct rem_mem_pointer_impl (line 2043) | struct rem_mem_pointer_impl (line 2054) | struct rem_mem_pointer_impl (line 2069) | struct rem_mem_pointer_impl (line 2072) | struct rem_mem_pointer_impl (line 2083) | struct rem_mem_pointer_impl (line 2098) | struct rem_mem_pointer_impl (line 2101) | struct rem_mem_pointer_impl (line 2112) | struct rem_mem_pointer_impl (line 2127) | struct rem_mem_pointer_impl (line 2130) | struct rem_mem_pointer_impl (line 2140) | struct rem_mem_pointer_impl (line 2155) | struct rem_mem_pointer_impl (line 2158) | struct rem_mem_pointer_impl (line 2169) | struct rem_mem_pointer_impl (line 2184) | struct rem_mem_pointer_impl (line 2187) | struct rem_mem_pointer_impl (line 2198) | struct rem_mem_pointer_impl (line 2213) | struct rem_mem_pointer_impl (line 2216) | struct rem_mem_pointer_impl (line 2227) | struct rem_mem_pointer_impl (line 2242) | struct rem_mem_pointer_impl (line 2245) | struct rem_mem_pointer_impl (line 2255) | struct rem_mem_pointer_impl (line 2270) | struct rem_mem_pointer_impl (line 2273) | struct rem_mem_pointer_impl (line 2284) | struct rem_mem_pointer_impl (line 2299) | struct rem_mem_pointer_impl (line 2302) | struct rem_mem_pointer_impl (line 2313) | struct rem_mem_pointer_impl (line 2328) | struct rem_mem_pointer_impl (line 2331) | struct rem_mem_pointer_impl (line 2342) | struct rem_mem_pointer_impl (line 2357) | struct rem_mem_pointer_impl (line 2360) | struct rem_mem_pointer_impl (line 2370) | struct rem_mem_pointer_impl (line 2385) | struct rem_mem_pointer_impl (line 2388) | struct rem_mem_pointer_impl (line 2399) | struct rem_mem_pointer_impl (line 2414) | struct rem_mem_pointer_impl (line 2417) | struct rem_mem_pointer_impl (line 2428) | struct rem_mem_pointer_impl (line 2443) | struct rem_mem_pointer_impl (line 2446) | struct rem_mem_pointer_impl (line 2457) | struct rem_mem_pointer_impl (line 2472) | struct rem_mem_pointer_impl (line 2475) | struct rem_mem_pointer_impl (line 2485) | struct rem_mem_pointer_impl (line 2500) | struct rem_mem_pointer_impl (line 2503) | struct rem_mem_pointer_impl (line 2514) | struct rem_mem_pointer_impl (line 2529) | struct rem_mem_pointer_impl (line 2532) | struct rem_mem_pointer_impl (line 2543) | struct rem_mem_pointer_impl (line 2558) | struct rem_mem_pointer_impl (line 2561) | struct rem_mem_pointer_impl (line 2572) | struct rem_mem_pointer_impl (line 2587) | struct rem_mem_pointer_impl (line 2590) | struct rem_mem_pointer_impl (line 2600) | struct rem_mem_pointer_impl (line 2615) | struct rem_mem_pointer_impl (line 2618) | struct rem_mem_pointer_impl (line 2629) | struct rem_mem_pointer_impl (line 2644) | struct rem_mem_pointer_impl (line 2647) | struct rem_mem_pointer_impl (line 2658) | struct rem_mem_pointer_impl (line 2673) | struct rem_mem_pointer_impl (line 2676) | struct rem_mem_pointer_impl (line 2687) | struct rem_mem_pointer_impl (line 2702) | struct rem_mem_pointer_impl (line 2705) | struct rem_mem_pointer_impl (line 2715) | struct rem_mem_pointer_impl (line 2730) | struct rem_mem_pointer_impl (line 2733) | struct rem_mem_pointer_impl (line 2744) | struct rem_mem_pointer_impl (line 2759) | struct rem_mem_pointer_impl (line 2762) | struct rem_mem_pointer_impl (line 2773) | struct rem_mem_pointer_impl (line 2788) | struct rem_mem_pointer_impl (line 2791) | struct rem_mem_pointer_impl (line 2802) | struct rem_mem_pointer_impl (line 2817) | struct rem_mem_pointer_impl (line 2820) | struct rem_mem_pointer_impl (line 2830) | struct rem_mem_pointer_impl (line 2845) | struct rem_mem_pointer_impl (line 2848) | struct rem_mem_pointer_impl (line 2859) | struct rem_mem_pointer_impl (line 2874) | struct rem_mem_pointer_impl (line 2877) | struct rem_mem_pointer_impl (line 2888) | struct rem_mem_pointer_impl (line 2903) | struct rem_mem_pointer_impl (line 2906) | struct rem_mem_pointer_impl (line 2917) | struct rem_mem_pointer_impl (line 2932) | struct rem_mem_pointer_impl (line 2935) | struct rem_mem_pointer_impl (line 2945) | struct rem_mem_pointer_impl (line 2960) | struct rem_mem_pointer_impl (line 2963) | struct rem_mem_pointer_impl (line 2974) | struct rem_mem_pointer_impl (line 2989) | struct rem_mem_pointer_impl (line 2992) | struct rem_mem_pointer_impl (line 3003) | struct rem_mem_pointer_impl (line 3018) | struct rem_mem_pointer_impl (line 3021) | struct rem_mem_pointer_impl (line 3032) | struct rem_mem_pointer_impl (line 3047) | struct rem_mem_pointer_impl (line 3050) | struct rem_mem_pointer_impl (line 3081) | struct rem_mem_pointer_impl (line 3084) | struct rem_mem_pointer_impl (line 3089) | struct rem_mem_pointer_impl (line 3092) | struct rem_mem_pointer_impl (line 3099) | struct rem_mem_pointer_impl (line 3102) | struct rem_mem_pointer_impl (line 3110) | struct rem_mem_pointer_impl (line 3113) | struct rem_mem_pointer_impl (line 3118) | struct rem_mem_pointer_impl (line 3121) | struct rem_mem_pointer_impl (line 3128) | struct rem_mem_pointer_impl (line 3131) | struct rem_mem_pointer_impl (line 3139) | struct rem_mem_pointer_impl (line 3142) | struct rem_mem_pointer_impl (line 3147) | struct rem_mem_pointer_impl (line 3150) | struct rem_mem_pointer_impl (line 3157) | struct rem_mem_pointer_impl (line 3160) | struct rem_mem_pointer_impl (line 3168) | struct rem_mem_pointer_impl (line 3171) | struct rem_mem_pointer_impl (line 3176) | struct rem_mem_pointer_impl (line 3179) | struct rem_mem_pointer_impl (line 3186) | struct rem_mem_pointer_impl (line 3189) | struct rem_mem_pointer_impl::va... function robust_cast (line 41) | typename boost::enable_if_c::value, FILE: src/graphlab/util/generics/shuffle.hpp type graphlab (line 37) | namespace graphlab { function inplace_shuffle (line 45) | void inplace_shuffle(Iterator begin, function outofplace_shuffle (line 79) | void outofplace_shuffle(Container &c, FILE: src/graphlab/util/generics/test_function_or_functor_type.hpp type graphlab (line 29) | namespace graphlab { type test_function_or_functor_1 (line 74) | struct test_function_or_functor_1 { type SFINAE1 (line 78) | struct SFINAE1 {} type test_function_or_const_functor_1 (line 99) | struct test_function_or_const_functor_1 { type SFINAE1 (line 103) | struct SFINAE1 {} type test_function_or_functor_2 (line 126) | struct test_function_or_functor_2 { type SFINAE1 (line 130) | struct SFINAE1 {} type test_function_or_const_functor_2 (line 152) | struct test_function_or_const_functor_2 { type SFINAE1 (line 156) | struct SFINAE1 {} FILE: src/graphlab/util/generics/vector_zip.hpp type graphlab (line 32) | namespace graphlab { function vector_zip (line 34) | std::vector > FILE: src/graphlab/util/hash_functions.hpp type graphlab (line 27) | namespace graphlab { class identity_hash (line 32) | class identity_hash{ FILE: src/graphlab/util/hashstream.hpp type graphlab (line 30) | namespace graphlab { type hashstream_impl (line 33) | namespace hashstream_impl { type hashstream_sink (line 35) | struct hashstream_sink { method hashstream_sink (line 39) | inline hashstream_sink(size_t unused = 0):hash(0),len(0) { } method hashstream_sink (line 41) | inline hashstream_sink(const hashstream_sink& other) : method size (line 46) | size_t size() const { return len; } method clear (line 50) | void clear() { method reserve (line 55) | void reserve(size_t new_buffer_size) { } type category (line 58) | struct category: public boost::iostreams::device_tag, method optimal_buffer_size (line 63) | inline std::streamsize optimal_buffer_size() const { return 0; } method advance (line 65) | inline std::streamsize advance(std::streamsize n) { method write (line 70) | inline std::streamsize write(const char* s, std::streamsize n) { method swap (line 78) | inline void swap(hashstream_sink &other) { FILE: src/graphlab/util/hdfs.cpp type graphlab (line 26) | namespace graphlab { function hdfs (line 29) | hdfs& hdfs::get_hdfs() { FILE: src/graphlab/util/hdfs.hpp type graphlab (line 40) | namespace graphlab { class hdfs (line 43) | class hdfs { class hdfs_device (line 49) | class hdfs_device { type category (line 52) | struct category : method hdfs_device (line 62) | hdfs_device() : filesystem(NULL), file(NULL) { } method hdfs_device (line 63) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 77) | void close(std::ios_base::openmode mode = std::ios_base::openmode(... method optimal_buffer_size (line 89) | inline std::streamsize optimal_buffer_size() const { return 0; } method read (line 91) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 94) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 97) | bool good() const { return file != NULL; } method hdfs_device (line 148) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 153) | void close() { } method read (line 154) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 159) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 164) | bool good() const { return false; } method hdfs (line 109) | hdfs(const std::string& host = "default", tPort port = 0) { method list_files (line 119) | inline std::vector list_files(const std::string& path) { method has_hadoop (line 132) | inline static bool has_hadoop() { return true; } class hdfs_device (line 143) | class hdfs_device { type category (line 52) | struct category : method hdfs_device (line 62) | hdfs_device() : filesystem(NULL), file(NULL) { } method hdfs_device (line 63) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 77) | void close(std::ios_base::openmode mode = std::ios_base::openmode(... method optimal_buffer_size (line 89) | inline std::streamsize optimal_buffer_size() const { return 0; } method read (line 91) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 94) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 97) | bool good() const { return file != NULL; } method hdfs_device (line 148) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 153) | void close() { } method read (line 154) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 159) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 164) | bool good() const { return false; } method hdfs (line 176) | hdfs(const std::string& host = "default", int port = 0) { method list_files (line 183) | inline std::vector list_files(const std::string& path) { method has_hadoop (line 190) | inline static bool has_hadoop() { return false; } class hdfs (line 140) | class hdfs { class hdfs_device (line 49) | class hdfs_device { type category (line 52) | struct category : method hdfs_device (line 62) | hdfs_device() : filesystem(NULL), file(NULL) { } method hdfs_device (line 63) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 77) | void close(std::ios_base::openmode mode = std::ios_base::openmode(... method optimal_buffer_size (line 89) | inline std::streamsize optimal_buffer_size() const { return 0; } method read (line 91) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 94) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 97) | bool good() const { return file != NULL; } method hdfs_device (line 148) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 153) | void close() { } method read (line 154) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 159) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 164) | bool good() const { return false; } method hdfs (line 109) | hdfs(const std::string& host = "default", tPort port = 0) { method list_files (line 119) | inline std::vector list_files(const std::string& path) { method has_hadoop (line 132) | inline static bool has_hadoop() { return true; } class hdfs_device (line 143) | class hdfs_device { type category (line 52) | struct category : method hdfs_device (line 62) | hdfs_device() : filesystem(NULL), file(NULL) { } method hdfs_device (line 63) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 77) | void close(std::ios_base::openmode mode = std::ios_base::openmode(... method optimal_buffer_size (line 89) | inline std::streamsize optimal_buffer_size() const { return 0; } method read (line 91) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 94) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 97) | bool good() const { return file != NULL; } method hdfs_device (line 148) | hdfs_device(const hdfs& hdfs_fs, const std::string& filename, method close (line 153) | void close() { } method read (line 154) | std::streamsize read(char* strm_ptr, std::streamsize n) { method write (line 159) | std::streamsize write(const char* strm_ptr, std::streamsize n) { method good (line 164) | bool good() const { return false; } method hdfs (line 176) | hdfs(const std::string& host = "default", int port = 0) { method list_files (line 183) | inline std::vector list_files(const std::string& path) { method has_hadoop (line 190) | inline static bool has_hadoop() { return false; } FILE: src/graphlab/util/hopscotch_map.hpp type graphlab (line 37) | namespace graphlab { class hopscotch_map (line 58) | class hopscotch_map { type hash_redirect (line 76) | struct hash_redirect{ method hash_redirect (line 78) | hash_redirect(Hash h): hashfun(h) { } type key_equal_redirect (line 83) | struct key_equal_redirect{ method key_equal_redirect (line 85) | key_equal_redirect(KeyEqual k): keyeq(k) { } type const_iterator (line 97) | struct const_iterator{ method const_iterator (line 111) | const_iterator():ptr(NULL) {} method const_iterator (line 114) | const_iterator operator++() { method const_iterator (line 126) | const_iterator operator++(int) { method reference (line 133) | reference operator*() { method pointer (line 138) | pointer operator->() { method const_iterator (line 154) | const_iterator(const hopscotch_map* map, type iterator (line 160) | struct iterator { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method container_type (line 247) | container_type* create_new_container(size_t size) { method destroy_all (line 251) | void destroy_all() { method rehash_to_new_container (line 258) | void rehash_to_new_container(size_t newsize = (size_t)(-1)) { method iterator (line 282) | iterator do_insert(const value_type &v) { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method hopscotch_map (line 308) | hopscotch_map(Hash hashfun = Hash(), method hopscotch_map (line 315) | hopscotch_map(const hopscotch_map& h): method rehash (line 323) | void rehash(size_t s) { method hasher (line 333) | hasher hash_function() const { method KeyEqual (line 337) | KeyEqual key_eq() const { method hopscotch_map (line 341) | hopscotch_map& operator=(const hopscotch_map& other) { method size_type (line 348) | size_type size() const { method iterator (line 352) | iterator begin() { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method iterator (line 356) | iterator end() { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method const_iterator (line 361) | const_iterator begin() const { method const_iterator (line 111) | const_iterator():ptr(NULL) {} method const_iterator (line 114) | const_iterator operator++() { method const_iterator (line 126) | const_iterator operator++(int) { method reference (line 133) | reference operator*() { method pointer (line 138) | pointer operator->() { method const_iterator (line 154) | const_iterator(const hopscotch_map* map, method const_iterator (line 365) | const_iterator end() const { method const_iterator (line 111) | const_iterator():ptr(NULL) {} method const_iterator (line 114) | const_iterator operator++() { method const_iterator (line 126) | const_iterator operator++(int) { method reference (line 133) | reference operator*() { method pointer (line 138) | pointer operator->() { method const_iterator (line 154) | const_iterator(const hopscotch_map* map, method insert (line 370) | std::pair insert(const value_type& v) { method iterator (line 377) | iterator insert(const_iterator hint, const value_type& v) { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method iterator (line 381) | iterator find(key_type const& k) { method iterator (line 174) | iterator():ptr(NULL) {} method iterator (line 182) | iterator operator++() { method iterator (line 196) | iterator operator++(int) { method reference (line 203) | reference operator*() { method pointer (line 208) | pointer operator->() { method iterator (line 223) | iterator(hopscotch_map* map, method const_iterator (line 391) | const_iterator find(key_type const& k) const { method const_iterator (line 111) | const_iterator():ptr(NULL) {} method const_iterator (line 114) | const_iterator operator++() { method const_iterator (line 126) | const_iterator operator++(int) { method reference (line 133) | reference operator*() { method pointer (line 138) | pointer operator->() { method const_iterator (line 154) | const_iterator(const hopscotch_map* map, method count (line 401) | size_t count(key_type const& k) const { method erase (line 407) | bool erase(iterator iter) { method erase (line 411) | bool erase(key_type const& k) { method swap (line 416) | void swap(hopscotch_map& other) { method mapped_type (line 423) | mapped_type& operator[](const key_type& i) { method clear (line 430) | void clear() { method capacity (line 436) | size_t capacity() const { method load_factor (line 441) | float load_factor() const { method save (line 445) | void save(oarchive &oarc) const { method load (line 455) | void load(iarchive &iarc) { method put (line 472) | void put(const value_type &v) { method put (line 477) | void put(const Key& k, const Value& v) { method get (line 481) | std::pair get(const Key& k) const { FILE: src/graphlab/util/hopscotch_set.hpp type graphlab (line 37) | namespace graphlab { class hopscotch_set (line 56) | class hopscotch_set { method container_type (line 92) | container_type* create_new_container(size_t size) { method destroy_all (line 96) | void destroy_all() { method container_type (line 102) | container_type* rehash_to_new_container(size_t newsize = (size_t)(-1... method iterator (line 121) | iterator do_insert(const value_type &v) { method hopscotch_set (line 139) | hopscotch_set(size_t initialsize = 32, method hopscotch_set (line 147) | hopscotch_set(const hopscotch_set& h): method rehash (line 155) | void rehash(size_t s) { method hasher (line 167) | hasher hash_function() const { method KeyEqual (line 171) | KeyEqual key_eq() const { method hopscotch_set (line 175) | hopscotch_set& operator=(const hopscotch_set& other) { method size_type (line 182) | size_type size() const { method iterator (line 186) | iterator begin() { method iterator (line 190) | iterator end() { method const_iterator (line 195) | const_iterator begin() const { method const_iterator (line 199) | const_iterator end() const { method insert (line 204) | std::pair insert(const value_type& v) { method iterator (line 211) | iterator insert(const_iterator hint, const value_type& v) { method iterator (line 215) | iterator find(value_type const& v) { method const_iterator (line 219) | const_iterator find(value_type const& v) const { method count (line 223) | size_t count(value_type const& v) const { method erase (line 228) | bool erase(iterator iter) { method erase (line 232) | bool erase(value_type const& v) { method swap (line 236) | void swap(hopscotch_set& other) { method clear (line 242) | void clear() { method capacity (line 248) | size_t capacity() const { method load_factor (line 253) | float load_factor() const { method save (line 257) | void save(oarchive &oarc) const { method load (line 267) | void load(iarchive &iarc) { FILE: src/graphlab/util/hopscotch_table.hpp type graphlab (line 39) | namespace graphlab { class hopscotch_table (line 58) | class hopscotch_table { type element (line 78) | struct element { method element (line 82) | element():hasdata(false), field(0) { } method next_powerof2 (line 93) | static uint64_t next_powerof2(uint64_t val) { method compute_hash (line 107) | size_t compute_hash(const value_type& d) const { method hopscotch_table (line 139) | hopscotch_table(size_t len, method hasher (line 150) | hasher hash_function() const { method equality_function (line 155) | equality_function key_eq() const { type const_iterator (line 164) | struct const_iterator { method const_iterator (line 176) | const_iterator():ptr(NULL) {} method const_iterator (line 178) | const_iterator operator++() { method const_iterator (line 186) | const_iterator operator++(int) { method reference (line 193) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 211) | const_iterator(const hopscotch_table* table, type iterator (line 223) | struct iterator { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, type insert_iterator (line 286) | struct insert_iterator{ method insert_iterator (line 291) | insert_iterator(hopscotch_table* c):cmap(c) {} method insert_iterator (line 293) | insert_iterator operator++() { method insert_iterator (line 296) | insert_iterator operator++(int) { method insert_iterator (line 300) | insert_iterator& operator*() { method insert_iterator (line 303) | insert_iterator& operator=(const insert_iterator& i) { method insert_iterator (line 308) | insert_iterator& operator=(const value_type& v) { method iterator (line 318) | iterator try_find_and_overwrite(const value_type& newdata, method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method iterator (line 334) | iterator insert_impl(const value_type& newdata, bool overwrite = tru... method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method const_iterator (line 420) | const_iterator find_impl(const value_type& key, size_t target) const { method const_iterator (line 176) | const_iterator():ptr(NULL) {} method const_iterator (line 178) | const_iterator operator++() { method const_iterator (line 186) | const_iterator operator++(int) { method reference (line 193) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 211) | const_iterator(const hopscotch_table* table, method iterator (line 437) | iterator find_impl(const value_type& key, size_t target) { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method iterator (line 449) | iterator insert(const value_type& newdata) { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method iterator (line 460) | iterator insert_do_not_overwrite(const value_type& newdata) { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method const_iterator (line 471) | const_iterator find(const value_type& key) const { method const_iterator (line 176) | const_iterator():ptr(NULL) {} method const_iterator (line 178) | const_iterator operator++() { method const_iterator (line 186) | const_iterator operator++(int) { method reference (line 193) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 211) | const_iterator(const hopscotch_table* table, method iterator (line 481) | iterator find(const value_type& key) { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method clear (line 487) | void clear() { method erase (line 499) | bool erase(iterator iter) { method erase (line 513) | bool erase(const value_type& key) { method iterator (line 518) | iterator begin() { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method const_iterator (line 528) | const_iterator begin() const { method const_iterator (line 176) | const_iterator():ptr(NULL) {} method const_iterator (line 178) | const_iterator operator++() { method const_iterator (line 186) | const_iterator operator++(int) { method reference (line 193) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 211) | const_iterator(const hopscotch_table* table, method iterator (line 538) | iterator end() { method iterator (line 235) | iterator():ptr(NULL) {} method iterator (line 243) | iterator operator++() { method iterator (line 251) | iterator operator++(int) { method reference (line 258) | reference operator*() { method pointer (line 262) | pointer operator->() { method iterator (line 276) | iterator(hopscotch_table* table, method const_iterator (line 543) | const_iterator end() const { method const_iterator (line 176) | const_iterator():ptr(NULL) {} method const_iterator (line 178) | const_iterator operator++() { method const_iterator (line 186) | const_iterator operator++(int) { method reference (line 193) | reference operator*() { method pointer (line 197) | pointer operator->() { method const_iterator (line 211) | const_iterator(const hopscotch_table* table, method count (line 548) | size_t count(const value_type& v) const { method contains (line 553) | bool contains(const value_type& v) const { method size (line 558) | size_t size() const { method capacity (line 563) | size_t capacity() const { method load_factor (line 567) | float load_factor() const { method hopscotch_table (line 573) | hopscotch_table& operator=(const hopscotch_table& other) { method put (line 586) | bool put(const T& t) { method put_do_not_overwrite (line 596) | bool put_do_not_overwrite(const T& t) { method get (line 609) | std::pair get(const T& t) const { FILE: src/graphlab/util/inplace_lf_queue.cpp type graphlab (line 25) | namespace graphlab { FILE: src/graphlab/util/inplace_lf_queue.hpp type graphlab (line 31) | namespace graphlab { class inplace_lf_queue (line 46) | class inplace_lf_queue { method inplace_lf_queue (line 48) | inline inplace_lf_queue():head(sentinel),tail(sentinel) { method end_of_dequeue_list (line 68) | inline const bool end_of_dequeue_list(char* ptr) { FILE: src/graphlab/util/inplace_lf_queue2.hpp type graphlab (line 31) | namespace graphlab { class inplace_lf_queue2 (line 47) | class inplace_lf_queue2 { method inplace_lf_queue2 (line 49) | inline inplace_lf_queue2():sentinel(new T), head(sentinel), tail(sen... method enqueue (line 57) | void enqueue(T* c) { method approx_size (line 70) | size_t approx_size() { method empty (line 74) | bool empty() const { method T (line 78) | T* dequeue_all() { method T (line 95) | static inline T* get_next(T* ptr) { method T (line 99) | static inline T** get_next_ptr(T* ptr) { method T (line 103) | T* end_of_dequeue_list() { method end_of_dequeue_list (line 107) | inline const bool end_of_dequeue_list(T* ptr) { FILE: src/graphlab/util/integer_mix.hpp type graphlab (line 27) | namespace graphlab { function integer_mix (line 30) | inline uint32_t integer_mix(uint32_t a) { FILE: src/graphlab/util/integer_selector.hpp type graphlab (line 27) | namespace graphlab { type u_integer_selector (line 30) | struct u_integer_selector { type u_integer_selector<1> (line 35) | struct u_integer_selector<1> { type u_integer_selector<2> (line 40) | struct u_integer_selector<2> { type u_integer_selector<4> (line 45) | struct u_integer_selector<4> { type u_integer_selector<8> (line 50) | struct u_integer_selector<8> { FILE: src/graphlab/util/lock_free_internal.hpp type graphlab (line 29) | namespace graphlab { type lock_free_internal (line 30) | namespace lock_free_internal { function index_type (line 38) | index_type& value() { function index_type (line 41) | index_type& counter() { FILE: src/graphlab/util/lock_free_pool.hpp type graphlab (line 33) | namespace graphlab { class lock_free_pool (line 35) | class lock_free_pool{ method lock_free_pool (line 50) | lock_free_pool(size_t poolsize = 0) { reset_pool(poolsize); } method reset_pool (line 53) | void reset_pool(size_t poolsize) { method T (line 75) | T* alloc() { method free (line 91) | void free(T* p) { FILE: src/graphlab/util/memory_info.cpp type graphlab (line 29) | namespace graphlab { type memory_info (line 30) | namespace memory_info { function available (line 32) | bool available() { function heap_bytes (line 42) | size_t heap_bytes() { function allocated_bytes (line 56) | size_t allocated_bytes() { function print_usage (line 71) | void print_usage(const std::string& label) { function log_usage (line 87) | void log_usage(const std::string& label) { FILE: src/graphlab/util/memory_info.hpp type graphlab (line 26) | namespace graphlab { type memory_info (line 35) | namespace memory_info { FILE: src/graphlab/util/mpi_tools.cpp type graphlab (line 27) | namespace graphlab { type mpi_tools (line 28) | namespace mpi_tools { function get_master_ranks (line 29) | void get_master_ranks(std::set& master_ranks) { FILE: src/graphlab/util/mpi_tools.hpp type graphlab (line 47) | namespace graphlab { type mpi_tools (line 48) | namespace mpi_tools { function init (line 55) | inline void init(int& argc, char**& argv) { function finalize (line 67) | inline void finalize() { function initialized (line 75) | inline bool initialized() { function rank (line 86) | inline size_t rank() { function size (line 97) | inline size_t size() { function all_gather (line 111) | void all_gather(const T& elem, std::vector& results) { function all2all (line 179) | void all2all(const std::vector& send_data, function gather (line 263) | void gather(size_t root, const T& elem) { function gather (line 317) | void gather(const T& elem, std::vector& results) { function bcast (line 390) | void bcast(const size_t& root, T& elem) { function send (line 453) | void send(const T& elem, const size_t id, const int tag = 0) { function recv (line 492) | void recv(T& elem, const size_t id, const int tag = 0) { FILE: src/graphlab/util/mutable_queue.hpp type graphlab (line 51) | namespace graphlab { class mutable_queue (line 85) | class mutable_queue { method left (line 108) | size_t left(size_t i) const { method right (line 113) | size_t right(size_t i) const { method parent (line 118) | size_t parent(size_t i) const { method Priority (line 123) | Priority priority_at(size_t i) { method less (line 128) | bool less(size_t i, size_t j) { method swap (line 133) | void swap(size_t i, size_t j) { method heapify (line 140) | void heapify(size_t i) { method mutable_queue (line 157) | mutable_queue() method mutable_queue (line 160) | mutable_queue(const mutable_queue& other) : method mutable_queue (line 163) | mutable_queue& operator=(const mutable_queue& other) { method size (line 170) | size_t size() const { method empty (line 175) | bool empty() const { method contains (line 180) | bool contains(const T& item) const { method push (line 185) | void push(T item, Priority priority) { method pop (line 205) | std::pair pop() { method Priority (line 216) | Priority get(T item) const { method Priority (line 224) | Priority operator[](T item) const { method update (line 232) | void update(T item, Priority priority) { method push_or_update (line 250) | void push_or_update(T item, Priority priority) { method insert_max (line 275) | bool insert_max(T item, Priority priority) { method insert_cumulative (line 304) | bool insert_cumulative(T item, Priority priority) { method clear (line 333) | void clear() { method remove (line 340) | bool remove(T item) { FILE: src/graphlab/util/net_util.cpp type graphlab (line 34) | namespace graphlab { function str_to_ip (line 37) | bool str_to_ip(const char* c, uint32_t& out) { function ip_to_str (line 42) | bool ip_to_str(uint32_t ip, std::string& out) { function get_local_ip_as_str (line 52) | std::string get_local_ip_as_str(bool print) { function get_local_ip (line 63) | uint32_t get_local_ip(bool print) { function get_free_tcp_port (line 166) | std::pair get_free_tcp_port() { FILE: src/graphlab/util/net_util.hpp type graphlab (line 29) | namespace graphlab { FILE: src/graphlab/util/random.cpp type graphlab (line 43) | namespace graphlab { type random (line 44) | namespace random { class nondet_generator (line 49) | class nondet_generator { method nondet_generator (line 51) | static nondet_generator& global() { method result_type (line 61) | result_type min BOOST_PREVENT_MACRO_SUBSTITUTION () const { return... method result_type (line 62) | result_type max BOOST_PREVENT_MACRO_SUBSTITUTION () const { return... method nondet_generator (line 64) | nondet_generator() { method result_type (line 71) | result_type operator()() { type source_registry (line 97) | struct source_registry { method source_registry (line 102) | static source_registry& global() { method seed (line 109) | void seed() { method nondet_seed (line 122) | void nondet_seed() { method time_seed (line 136) | void time_seed() { method seed (line 150) | void seed(const size_t number) { method register_generator (line 164) | void register_generator(generator* tls_ptr) { method unregister_source (line 177) | void unregister_source(generator* tls_ptr) { function destroy_tls_data (line 199) | void destroy_tls_data(void* ptr) { type tls_key_creator (line 214) | struct tls_key_creator { method tls_key_creator (line 216) | tls_key_creator() : TLS_RANDOM_SOURCE_KEY(0) { function pthread_key_t (line 223) | static pthread_key_t get_random_source_key() { function generator (line 243) | generator& get_source() { function seed (line 263) | void seed() { source_registry::global().seed(); } function nondet_seed (line 265) | void nondet_seed() { source_registry::global().nondet_seed(); } function time_seed (line 267) | void time_seed() { source_registry::global().time_seed(); } function seed (line 269) | void seed(const size_t seed_value) { function pdf2cdf (line 288) | void pdf2cdf(std::vector& pdf) { FILE: src/graphlab/util/random.hpp type graphlab (line 39) | namespace graphlab { type random (line 47) | namespace random { type distributions (line 55) | namespace distributions { type uniform (line 64) | struct uniform { method IntType (line 67) | static inline IntType sample(RealRNG& real_rng, type uniform (line 74) | struct uniform { method sample (line 77) | static inline double sample(RealRNG& real_rng, type uniform (line 84) | struct uniform { method sample (line 87) | static inline float sample(RealRNG& real_rng, class generator (line 100) | class generator { method generator (line 107) | generator() { method seed (line 112) | inline void seed() { method time_seed (line 125) | inline void time_seed() { method seed (line 130) | void seed(size_t number) { method seed (line 139) | void seed(generator& other){ method NumType (line 152) | inline NumType uniform(const NumType min, const NumType max) { method NumType (line 165) | inline NumType fast_uniform(const NumType min, const NumType max) { method gamma (line 178) | inline double gamma(const double alpha = double(1)) { method gaussian (line 191) | inline double gaussian(const double mean = double(0), method normal (line 204) | inline double normal(const double mean = double(0), method bernoulli (line 210) | inline bool bernoulli(const double p = double(0.5)) { method fast_bernoulli (line 218) | inline bool fast_bernoulli(const double p = double(0.5)) { method multinomial (line 231) | size_t multinomial(const std::vector& prb) { method multinomial_cdf (line 256) | inline size_t multinomial_cdf(const std::vector& cdf) { method permutation (line 267) | inline std::vector permutation(const size_t nelems) { method shuffle (line 278) | void shuffle(std::vector& vec) { shuffle(vec.begin(), vec.end()... method shuffle (line 284) | void shuffle(Iterator begin, Iterator end) { type shuffle_functor (line 294) | struct shuffle_functor { method shuffle_functor (line 296) | inline shuffle_functor(generator& gen) : gen(gen) { } function NumType (line 365) | inline NumType uniform(const NumType min, const NumType max) { function NumType (line 376) | inline NumType fast_uniform(const NumType min, const NumType max) { function rand01 (line 385) | inline double rand01() { return uniform(0, 1); } function rand (line 391) | inline int rand() { return fast_uniform(0, RAND_MAX); } function gamma (line 398) | inline double gamma(const double alpha = double(1)) { function gaussian (line 409) | inline double gaussian(const double mean = double(0), function normal (line 419) | inline double normal(const double mean = double(0), function bernoulli (line 428) | inline bool bernoulli(const double p = double(0.5)) { function fast_bernoulli (line 436) | inline bool fast_bernoulli(const double p = double(0.5)) { function multinomial (line 446) | inline size_t multinomial(const std::vector& prb) { function multinomial_cdf (line 456) | inline size_t multinomial_cdf(const std::vector& cdf) { function permutation (line 467) | inline std::vector permutation(const size_t nelems) { function shuffle (line 477) | inline void shuffle(std::vector& vec) { function shuffle (line 486) | inline void shuffle(Iterator begin, Iterator end) { FILE: src/graphlab/util/resizing_array_sink.hpp type graphlab (line 29) | namespace graphlab { class resizing_array_sink_ref (line 36) | class resizing_array_sink_ref { method resizing_array_sink_ref (line 45) | inline resizing_array_sink_ref(resizing_array_sink& ref): ras(&ref) { } method resizing_array_sink_ref (line 47) | inline resizing_array_sink_ref(const resizing_array_sink_ref& other) : method size (line 50) | inline size_t size() const { return ras->size(); } method clear (line 53) | inline void clear() { ras->clear(); } method optimal_buffer_size (line 55) | inline std::streamsize optimal_buffer_size() const { method relinquish (line 59) | inline void relinquish() { ras->relinquish(); } method advance (line 61) | inline void advance(std::streamsize n) { ras->advance(n); } method write (line 64) | inline std::streamsize write(const char* s, std::streamsize n) { FILE: src/graphlab/util/safe_circular_char_buffer.cpp type graphlab (line 28) | namespace graphlab { FILE: src/graphlab/util/safe_circular_char_buffer.hpp type graphlab (line 30) | namespace graphlab { class safe_circular_char_buffer (line 37) | class safe_circular_char_buffer { method is_done (line 54) | inline bool is_done() const { method reader_is_blocked (line 58) | inline bool reader_is_blocked() const { method reserved_size (line 73) | inline std::streamsize reserved_size() const { method begin_critical_section (line 124) | inline void begin_critical_section() { method end_critical_section (line 129) | inline void end_critical_section() { method end_critical_section_with_signal (line 135) | inline void end_critical_section_with_signal() { FILE: src/graphlab/util/small_map.hpp type graphlab (line 39) | namespace graphlab { class small_map (line 42) | class small_map { type max_type (line 44) | struct max_type { enum max_value { value = T1 < T2? T2 : T1 }; } type max_value (line 44) | enum max_value { value = T1 < T2? T2 : T1 } type less (line 45) | struct less { method small_map (line 67) | small_map() { } method small_map (line 70) | small_map(const key_type& key, const mapped_type& value) : method iterator (line 75) | inline iterator begin() { return set.begin(); } method iterator (line 78) | inline iterator end() { return set.end(); } method const_iterator (line 82) | inline const_iterator begin() const { return set.begin(); } method const_iterator (line 85) | inline const_iterator end() const { return set.end(); } method size (line 88) | inline size_t size() const { return set.size(); } method empty (line 91) | inline bool empty() const { return set.empty(); } method contains (line 95) | bool contains(const value_type& pair) const { method contains (line 100) | bool contains(const key_type& key) const { method has_key (line 109) | inline bool has_key(const key_type& key) { method contains (line 116) | bool contains(const small_map& other) const { method mapped_type (line 126) | inline const mapped_type& operator[](const key_type& key) const { method mapped_type (line 137) | inline mapped_type& operator[](const key_type& key) { method mapped_type (line 154) | inline mapped_type& safe_find(const key_type& key) { function foreach (line 192) | foreach(const pair_type& pair, map) { FILE: src/graphlab/util/small_set.hpp type graphlab (line 39) | namespace graphlab { class small_set (line 47) | class small_set { type sizes (line 56) | enum sizes {max_dim_type = MAX_DIM } type max_type (line 60) | struct max_type { enum max_value { value = T1 < T2? T2 : T1 }; } type max_value (line 60) | enum max_value { value = T1 < T2? T2 : T1 } type Equals (line 62) | struct Equals { method small_set (line 70) | small_set() : nelems(0) { } method small_set (line 73) | small_set(const T& elem) : nelems(1) { values[0] = elem; } method small_set (line 80) | small_set(const std::set& other) : nelems(other.size()) { method small_set (line 92) | small_set(const small_set& other) : method T (line 102) | inline T* begin() { return values; } method T (line 105) | inline T* end() { return values + nelems; } method T (line 109) | inline const T* begin() const { return values; } method T (line 112) | inline const T* end() const { return values + nelems; } method size (line 115) | inline size_t size() const { return nelems; } method empty (line 118) | inline bool empty() const { return size() == 0; } method contains (line 122) | bool contains(const T& elem) const { method contains (line 128) | bool contains(const small_set& other) const { method insert (line 162) | inline void insert(const T& elem) { method insert (line 168) | inline void insert(const T* begin, const T* end) { method erase (line 187) | void erase(const T& elem) { *this -= elem; } method T (line 191) | virtual const T& operator[](size_t index) const { method small_set (line 228) | inline small_set operator+(const T& elem) const { method small_set (line 255) | inline small_set& operator+=(const small_set& oth... method small_set (line 263) | inline small_set& operator+=(const T& elem) { method small_set (line 285) | small_set& operator-=(const small_set& other) { method small_set (line 303) | small_set operator-(const small_set& other) const { method small_set (line 320) | small_set operator*(const small_set& other) const { method small_set (line 335) | small_set operator*=(const small_set& other) { method load (line 341) | void load(iarchive& arc) { method save (line 351) | void save(oarchive& arc) const { method T (line 361) | inline T* absolute_end() { return values + MAX_DIM; } type safe_iterator (line 364) | struct safe_iterator : method safe_iterator (line 368) | safe_iterator(const safe_iterator& other) : method safe_iterator (line 370) | safe_iterator(T* begin, const T* end) : method safe_iterator (line 376) | inline safe_iterator& operator++() { ++begin; return *this; } method safe_iterator (line 377) | inline safe_iterator& operator++(int) { method T (line 387) | T& operator*() { ASSERT_LT(begin, end); return *begin; } FILE: src/graphlab/util/stl_util.hpp type graphlab (line 61) | namespace graphlab { function set_union (line 70) | std::set set_union(const std::set& a, const std::set& b) { function set_union (line 79) | std::set set_union(const std::set& a, const T& b) { function set_intersect (line 86) | std::set set_intersect(const std::set& a, const std::set& b) { function set_difference (line 95) | std::set set_difference(const std::set& a, const std::set& b) { function set_difference (line 105) | std::set set_difference(const std::set& a, const T& b) { function set_partition (line 113) | std::pair,std::set > function set_disjoint (line 122) | bool set_disjoint(const std::set& a, const std::set& b) { function set_equal (line 127) | bool set_equal(const std::set& a, const std::set& b) { function includes (line 133) | bool includes(const std::set& a, const std::set& b) { function is_subset (line 141) | bool is_subset(const std::set& a, const std::set& b) { function is_superset (line 146) | bool is_superset(const std::set& a,const std::set& b) { function T (line 163) | const T& safe_get(const std::map& map, function T (line 177) | const T safe_get(const std::map& map, function rekey (line 191) | std::map function remap (line 208) | std::map function remap (line 223) | void remap(std::map& map, function map_union (line 235) | std::map function map_intersect (line 251) | std::map function map_intersect (line 268) | std::map function map_difference (line 284) | std::map function keys (line 302) | std::set keys(const std::map& map) { function keys_as_vector (line 315) | std::vector keys_as_vector(const std::map& map) { function values (line 330) | std::set values(const std::map& map) { function values (line 340) | std::vector values(const std::map& m, function values (line 351) | std::vector values(const std::map& m, function make_identity_map (line 362) | std::map make_identity_map(const std::set& keys) { function trim (line 385) | inline std::string trim(const std::string& str) { function tostr (line 396) | std::string tostr(const T& t) { function T (line 406) | T fromstr(const std::string& str) { function pad_number (line 418) | inline std::string pad_number(const size_t number, function strsplit (line 442) | inline std::vector strsplit(const std::string& str, FILE: src/graphlab/util/synchronized_unordered_map.hpp type graphlab (line 30) | namespace graphlab { class synchronized_unordered_map (line 34) | class synchronized_unordered_map { method synchronized_unordered_map (line 50) | synchronized_unordered_map(size_t numblocks):data(numblocks), method find (line 58) | std::pair find(size_t key) { method find (line 71) | std::pair find(size_t key) const { method erase (line 81) | void erase(size_t key) { method erase_if (line 89) | void erase_if(size_t key, Predicate pred) { method value_type (line 98) | value_type& insert(size_t key, const value_type &val) { method insert_with_failure_detect (line 112) | std::pair insert_with_failure_detect(size_t key, const ... method clear (line 131) | void clear() { FILE: src/graphlab/util/synchronized_unordered_map2.hpp type graphlab (line 31) | namespace graphlab { class synchronized_unordered_map2 (line 38) | class synchronized_unordered_map2 { method synchronized_unordered_map2 (line 54) | synchronized_unordered_map2(size_t numblocks):data(numblocks), method find (line 62) | std::pair find(size_t key) { method find (line 73) | std::pair find(size_t key) const { method erase (line 81) | void erase(size_t key) { method erase_if (line 87) | void erase_if(size_t key, Predicate pred) { method value_type (line 94) | value_type& insert(size_t key, const value_type &val) { method read_critical_section (line 101) | void read_critical_section(size_t key) { method write_critical_section (line 105) | void write_critical_section(size_t key) { method release_critical_section (line 109) | void release_critical_section(size_t key) { method insert_with_failure_detect (line 118) | std::pair insert_with_failure_detect(size_t key, const ... method clear (line 135) | void clear() { FILE: src/graphlab/util/system_usage.hpp type graphlab (line 33) | namespace graphlab { FILE: src/graphlab/util/timer.cpp type graphlab (line 35) | namespace graphlab { class hundredms_timer (line 39) | class hundredms_timer { method hundredms_timer (line 41) | hundredms_timer() { type itimerval (line 53) | struct itimerval function alarm_wakeup (line 65) | void alarm_wakeup(int i) { type timespec (line 91) | struct timespec type timespec (line 102) | struct timespec function estimate_ticks_per_second (line 114) | unsigned long long estimate_ticks_per_second() { FILE: src/graphlab/util/timer.hpp type graphlab (line 32) | namespace graphlab { class timer (line 67) | class timer { method timer (line 78) | inline timer() { start(); } method start (line 83) | inline void start() { gettimeofday(&start_time_, NULL); } method current_time (line 91) | inline double current_time() const { method current_time_millis (line 108) | inline double current_time_millis() const { return current_time() * ... method sec_of_day (line 114) | static double sec_of_day() { method usec_of_day (line 126) | static size_t usec_of_day() { function rdtsc (line 165) | static inline unsigned long long rdtsc(void) function rdtsc (line 172) | static inline unsigned long long rdtsc(void) function rdtsc (line 179) | static inline unsigned long long rdtsc(void) { FILE: src/graphlab/util/tracepoint.cpp type graphlab (line 32) | namespace graphlab { FILE: src/graphlab/util/tracepoint.hpp type graphlab (line 34) | namespace graphlab{ type trace_count (line 36) | struct trace_count{ method trace_count (line 44) | inline trace_count(std::string name = "", method initialize (line 59) | inline void initialize(std::string n, method incorporate (line 70) | inline void incorporate(unsigned long long val) __attribute__((alwa... method incorporate (line 86) | inline void incorporate(const trace_count &val) __attribute__((alwa... method trace_count (line 102) | inline trace_count& operator+=(trace_count &val) { FILE: src/graphlab/util/uint128.hpp type graphlab (line 31) | namespace graphlab { function gl_uint128_t (line 44) | gl_uint128_t() { } function gl_uint128_t (line 51) | explicit gl_uint128_t(uint64_t val) { function gl_uint128_t (line 61) | inline gl_uint128_t fill_128b() { FILE: src/graphlab/util/union_find.hpp type graphlab (line 30) | namespace graphlab { class union_find (line 34) | class union_find { method is_root (line 38) | bool is_root(IDType i) { method union_find (line 43) | union_find() { } method init (line 44) | void init(IDType s) { method merge (line 52) | void merge(IDType i, IDType j) { method IDType (line 71) | IDType find(IDType i) { class concurrent_union_find (line 91) | class concurrent_union_find { method is_root (line 103) | bool is_root(uint32_t i) { method updateroot (line 107) | bool updateroot(uint32_t x, uint32_t oldrank, method concurrent_union_find (line 115) | concurrent_union_find() { } method init (line 116) | void init(uint32_t s) { method merge (line 124) | void merge(uint32_t x, uint32_t y) { method find (line 145) | uint32_t find(uint32_t x) { FILE: src/graphlab/util/web_util.cpp type graphlab (line 28) | namespace graphlab { type web_util (line 29) | namespace web_util { function url_decode (line 31) | std::string url_decode(const std::string& url) { function parse_query (line 55) | std::map parse_query(const std::string& qu... FILE: src/graphlab/util/web_util.hpp type graphlab (line 30) | namespace graphlab { type web_util (line 31) | namespace web_util { FILE: src/graphlab/vertex_program/context.hpp type graphlab (line 32) | namespace graphlab { class context (line 44) | class context : method context (line 75) | context(engine_type& engine, graph_type& graph) : method num_vertices (line 78) | size_t num_vertices() const { return graph.num_vertices(); } method num_edges (line 83) | size_t num_edges() const { return graph.num_edges(); } method procid (line 91) | size_t procid() const { return graph.procid(); } method num_procs (line 93) | size_t num_procs() const { return graph.numprocs(); } method elapsed_seconds (line 106) | float elapsed_seconds() const { return engine.elapsed_seconds(); } method iteration (line 111) | int iteration() const { return engine.iteration(); } method stop (line 116) | void stop() { engine.internal_stop(); } method signal (line 121) | void signal(const vertex_type& vertex, method signal_vid (line 131) | void signal_vid(vertex_id_type vid, method post_delta (line 140) | void post_delta(const vertex_type& vertex, method clear_gather_cache (line 148) | virtual void clear_gather_cache(const vertex_type& vertex) { FILE: src/graphlab/vertex_program/icontext.hpp type graphlab (line 33) | namespace graphlab { class icontext (line 57) | class icontext { method num_vertices (line 100) | virtual size_t num_vertices() const { return 0; } method num_edges (line 109) | virtual size_t num_edges() const { return 0; } method procid (line 121) | virtual size_t procid() const { return 0; } method num_procs (line 166) | virtual size_t num_procs() const { return 0; } method elapsed_seconds (line 173) | virtual float elapsed_seconds() const { return 0.0; } method iteration (line 181) | virtual int iteration() const { return -1; } method stop (line 193) | virtual void stop() { } method signal (line 213) | virtual void signal(const vertex_type& vertex, method signal_vid (line 227) | virtual void signal_vid(vertex_id_type gvid, method post_delta (line 254) | virtual void post_delta(const vertex_type& vertex, method clear_gather_cache (line 265) | virtual void clear_gather_cache(const vertex_type& vertex) { } FILE: src/graphlab/vertex_program/ivertex_program.hpp type graphlab (line 47) | namespace graphlab { class ivertex_program (line 279) | class ivertex_program { method init (line 536) | virtual void init(icontext_type& context, method edge_dir_type (line 578) | virtual edge_dir_type gather_edges(icontext_type& context, method gather_type (line 617) | virtual gather_type gather(icontext_type& context, method edge_dir_type (line 689) | virtual edge_dir_type scatter_edges(icontext_type& context, method scatter (line 723) | virtual void scatter(icontext_type& context, const vertex_type& vertex, method pre_local_gather (line 745) | virtual void pre_local_gather(gather_type&) const { method post_local_gather (line 764) | virtual void post_local_gather(gather_type&) const { FILE: src/graphlab/vertex_program/messages.hpp type graphlab (line 28) | namespace graphlab { type messages (line 30) | namespace messages { type sum_priority (line 35) | struct sum_priority : public graphlab::IS_POD_TYPE { method sum_priority (line 37) | sum_priority(const double value = 0) : value(value) { } method priority (line 38) | double priority() const { return value; } method sum_priority (line 39) | sum_priority& operator+=(const sum_priority& other) { type max_priority (line 48) | struct max_priority : public graphlab::IS_POD_TYPE { method max_priority (line 50) | max_priority(const double value = 0) : value(value) { } method priority (line 51) | double priority() const { return value; } method max_priority (line 52) | max_priority& operator+=(const max_priority& other) { FILE: src/graphlab/vertex_program/op_plus_eq_concept.hpp type graphlab (line 34) | namespace graphlab { class OpPlusEq (line 59) | class OpPlusEq : boost::Assignable, public boost::DefaultConstruct... method BOOST_CONCEPT_USAGE (line 61) | BOOST_CONCEPT_USAGE(OpPlusEq) { FILE: src/graphlab/zookeeper/key_value.cpp type graphlab (line 38) | namespace graphlab{ type zookeeper (line 39) | namespace zookeeper { type String_vector (line 192) | struct String_vector type String_vector (line 206) | struct String_vector FILE: src/graphlab/zookeeper/key_value.hpp type graphlab (line 37) | namespace graphlab{ type zookeeper (line 38) | namespace zookeeper { class key_value (line 66) | class key_value { type lazy_value (line 136) | struct lazy_value { method lazy_value (line 141) | lazy_value():has_value(false), stored_version(-1), remote_versio... method lazy_value (line 142) | lazy_value(const lazy_value& lv): FILE: src/graphlab/zookeeper/server_list.cpp type graphlab (line 34) | namespace graphlab{ type zookeeper (line 35) | namespace zookeeper { type String_vector (line 64) | struct String_vector type String_vector (line 112) | struct String_vector type String_vector (line 158) | struct String_vector FILE: src/graphlab/zookeeper/server_list.hpp type graphlab (line 35) | namespace graphlab{ type zookeeper (line 36) | namespace zookeeper { class server_list (line 43) | class server_list { FILE: src/graphlab/zookeeper/zookeeper_common.cpp type graphlab (line 38) | namespace graphlab{ type zookeeper (line 39) | namespace zookeeper { function free_String_vector (line 43) | void free_String_vector(struct String_vector* strings) { function String_vector_to_vector (line 55) | std::vector String_vector_to_vector( function print_stat (line 65) | void print_stat(int stat, function normalize_path (line 88) | std::string normalize_path(std::string prefix) { function create_dir (line 95) | int create_dir(zhandle_t* handle, const std::string& name, function delete_dir (line 105) | int delete_dir(zhandle_t* handle, const std::string& name, function create_ephemeral_node (line 115) | int create_ephemeral_node(zhandle_t* handle, function delete_node (line 126) | int delete_node(zhandle_t* handle, function get_sequence_node_path (line 136) | std::string get_sequence_node_path(const std::string& path, function delete_sequence_node (line 144) | int delete_sequence_node(zhandle_t* handle, function create_ephemeral_sequence_node (line 155) | std::pair create_ephemeral_sequence_node(zhandle_t* handle, function get_node_value (line 174) | std::pair get_node_value(zhandle_t* handle, FILE: src/graphlab/zookeeper/zookeeper_common.hpp type graphlab (line 34) | namespace graphlab{ type zookeeper (line 35) | namespace zookeeper { type String_vector (line 38) | struct String_vector type String_vector (line 42) | struct String_vector FILE: tests/arbitrary_signal_test.cpp class test_uf (line 35) | class test_uf: method edge_dir_type (line 39) | edge_dir_type method apply (line 44) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 48) | edge_dir_type scatter_edges(icontext_type& context, function main (line 58) | int main(int argc, char** argv) { FILE: tests/async_consistent_test.cpp class count_in_neighbors (line 35) | class count_in_neighbors : method edge_dir_type (line 39) | edge_dir_type method gather_type (line 43) | gather_type method apply (line 48) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 52) | edge_dir_type function test_in_neighbors (line 59) | void test_in_neighbors(graphlab::distributed_control& dc, class count_out_neighbors (line 73) | class count_out_neighbors : method edge_dir_type (line 77) | edge_dir_type method gather_type (line 81) | gather_type method apply (line 86) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 90) | edge_dir_type function test_out_neighbors (line 96) | void test_out_neighbors(graphlab::distributed_control& dc, class count_all_neighbors (line 110) | class count_all_neighbors : method init (line 114) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 119) | edge_dir_type method gather_type (line 123) | gather_type method apply (line 128) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 132) | edge_dir_type function test_all_neighbors (line 138) | void test_all_neighbors(graphlab::distributed_control& dc, class count_all_neighbors_slow (line 163) | class count_all_neighbors_slow : method init (line 167) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 172) | edge_dir_type method gather_type (line 176) | gather_type method apply (line 181) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 186) | edge_dir_type function agg_map (line 199) | size_t agg_map(agg_engine_type::icontext_type& context, function agg_finalize (line 204) | void agg_finalize(agg_engine_type::icontext_type& context, function agg_edge_map (line 210) | size_t agg_edge_map(agg_engine_type::icontext_type& context, function agg_edge_finalize (line 215) | void agg_edge_finalize(agg_engine_type::icontext_type& context, function identity_vertex_map (line 222) | size_t identity_vertex_map(agg_engine_type::vertex_type vtx) { function identity_edge_map (line 225) | size_t identity_edge_map(agg_engine_type::edge_type e) { function identity_vertex_map_context (line 230) | size_t identity_vertex_map_context(agg_engine_type::icontext_type& context, function identity_edge_map_context (line 234) | size_t identity_edge_map_context(agg_engine_type::icontext_type& context, function set_vertex_to_one (line 241) | void set_vertex_to_one(agg_engine_type::vertex_type vtx) { function set_edge_to_one (line 244) | void set_edge_to_one(agg_engine_type::edge_type e) { function vertex_plus_one (line 249) | void vertex_plus_one(agg_engine_type::vertex_type vtx) { function vertex_minus_one_context (line 254) | void vertex_minus_one_context(agg_engine_type::icontext_type& context, function edge_plus_one (line 259) | void edge_plus_one(agg_engine_type::edge_type e) { function edge_minus_one_context (line 264) | void edge_minus_one_context(agg_engine_type::icontext_type& context, function test_aggregator (line 269) | void test_aggregator(graphlab::distributed_control& dc, function main (line 313) | int main(int argc, char** argv) { FILE: tests/chandy_misra.cxx class ChandyMisraTest (line 35) | class ChandyMisraTest: public CxxTest::TestSuite { method test_cm (line 37) | void test_cm() { method test_parallel (line 117) | void test_parallel() { FILE: tests/csr_storage_test.cxx class csr_storage_test (line 30) | class csr_storage_test : public CxxTest::TestSuite { method csr_storage_test (line 44) | csr_storage_test() { method test_csr_storage (line 58) | void test_csr_storage() { method test_csr_storage2 (line 66) | void test_csr_storage2() { method dynamic_csr_storage_constructor_test (line 84) | void dynamic_csr_storage_constructor_test() { method dynamic_csr_storage_insertion_test (line 107) | void dynamic_csr_storage_insertion_test() { method test_dynamic_csr_storage_constructor (line 123) | void test_dynamic_csr_storage_constructor() { method test_dynamic_csr_storage_insertion (line 130) | void test_dynamic_csr_storage_insertion() { method dynamic_csr_storage_range_insertion_test (line 138) | void dynamic_csr_storage_range_insertion_test(size_t nkey, size_t nval) { method test_dynamic_csr_storage_range_insertion (line 165) | void test_dynamic_csr_storage_range_insertion() { method test_dynamic_csr_storage_stress_insertion (line 172) | void test_dynamic_csr_storage_stress_insertion() { method stress_insertion_test (line 182) | void stress_insertion_test(size_t nkey, size_t nval) { method check (line 215) | void check(csr_type& csr, method check_dcsr (line 231) | void check_dcsr(csr_type& csr, method get_keyin (line 250) | std::vector get_keyin() { return std::vector(_keyin); } method get_valin (line 252) | std::vector get_valin() { return std::vector(_va... method get_keyout (line 254) | std::vector get_keyout() { return std::vector(_keyou... method get_valout (line 256) | std::vector get_valout() { return std::vector(_v... FILE: tests/cuckootest.cpp function sanity_checks (line 35) | void sanity_checks() { function sanity_checks2 (line 88) | void sanity_checks2() { function randstring (line 139) | std::string randstring(size_t len) { function more_interesting_data_types_check (line 147) | void more_interesting_data_types_check() { function more_interesting_data_types_check2 (line 221) | void more_interesting_data_types_check2() { function benchmark (line 297) | void benchmark() { function benchmark_strings (line 380) | void benchmark_strings() { function save_load_test (line 458) | void save_load_test() { function cuckoo_set_sanity_checks (line 480) | void cuckoo_set_sanity_checks() { function main (line 523) | int main(int argc, char** argv) { FILE: tests/dc_consensus_test.cpp class simple_engine_test (line 37) | class simple_engine_test { method simple_engine_test (line 44) | simple_engine_test(distributed_control &dc):rmi(dc, this), cons(dc, 4) { method add_task_local (line 49) | void add_task_local(size_t i) { method task (line 54) | void task(size_t i) { method try_terminate (line 68) | bool try_terminate(size_t cpuid, std::pair &job) { method thread (line 86) | void thread(size_t cpuid) { method start_thread (line 98) | void start_thread() { function main (line 112) | int main(int argc, char ** argv) { FILE: tests/dc_fiber_consensus_test.cpp class simple_engine_test (line 38) | class simple_engine_test { method simple_engine_test (line 45) | simple_engine_test(distributed_control &dc):rmi(dc, this), cons(dc, NT... method add_task_local (line 50) | void add_task_local(size_t i) { method task (line 55) | void task(size_t i) { method try_terminate (line 69) | bool try_terminate(size_t cpuid, std::pair &job) { method thread (line 87) | void thread(size_t cpuid) { method start_thread (line 99) | void start_thread() { function main (line 113) | int main(int argc, char ** argv) { FILE: tests/dc_test_sequentialization.cpp class seq_test (line 36) | class seq_test { method seq_test (line 40) | seq_test(distributed_control &dc):rmi(dc, this), ctr(100,0) { method recv (line 44) | void recv(size_t idx, size_t val) { method run (line 50) | void run() { function main (line 61) | int main(int argc, char ** argv) { FILE: tests/dcsc_test.cpp function main (line 8) | int main(int argc, char** argv) { FILE: tests/dense_bitset_test.cxx class DenseBitsetTestSuite (line 29) | class DenseBitsetTestSuite : public CxxTest::TestSuite { method test_densebitset (line 31) | void test_densebitset(void) { method test_fixeddensebitset (line 98) | void test_fixeddensebitset(void) { FILE: tests/dht_performance_test.cpp function randstring (line 34) | std::string randstring(size_t len) { function main (line 45) | int main(int argc, char ** argv) { FILE: tests/distributed_chandy_misra_test.cpp type vertex_data (line 50) | struct vertex_data { method vertex_data (line 53) | vertex_data(double value = 1) : type edge_data (line 61) | struct edge_data { } function callback (line 72) | void callback(graphlab::vertex_id_type v) { function thread_stuff (line 84) | void thread_stuff() { function main (line 125) | int main(int argc, char** argv) { FILE: tests/distributed_graph_test.cpp class map_reduce (line 47) | class map_reduce method save (line 475) | void save(graphlab::oarchive& oarc) const { method load (line 478) | void load(graphlab::iarchive& iarc) { method map_reduce (line 481) | map_reduce& operator+=(const map_reduce& other) { type tests (line 49) | namespace tests{ class distributed_graph_test (line 50) | class distributed_graph_test { type vertex_data (line 52) | struct vertex_data: public graphlab::IS_POD_TYPE { method vertex_data (line 54) | vertex_data() : value(0) { } method vertex_data (line 55) | vertex_data(size_t n) : value(n) { } type edge_data (line 61) | struct edge_data: public graphlab::IS_POD_TYPE { method edge_data (line 64) | edge_data (int f = 0, int t = 0) : from(f), to(t) {} method test_add_vertex (line 73) | void test_add_vertex() { method test_add_edge (line 84) | void test_add_edge() { method test_dynamic_add_edge (line 95) | void test_dynamic_add_edge() { method test_save_load (line 110) | void test_save_load() { method test_add_vertex_impl (line 129) | void test_add_vertex_impl(Graph& g, size_t nverts) { method test_add_edge_impl (line 158) | void test_add_edge_impl(Graph& g, size_t nedges, bool use_dynamic = ... method test_save_load_impl (line 204) | void test_save_load_impl(Graph& g) { method check_edge_data (line 256) | void check_edge_data(Graph& g) { method check_adjacency (line 279) | void check_adjacency(Graph& g, type vertex_info (line 361) | struct vertex_info { method load (line 377) | void load(graphlab::iarchive& arc) { method save (line 386) | void save(graphlab::oarchive& arc) const { method check_vertex_info (line 397) | void check_vertex_info(Graph& g) { class map_reduce (line 472) | class map_reduce { method save (line 475) | void save(graphlab::oarchive& oarc) const { method load (line 478) | void load(graphlab::iarchive& iarc) { method map_reduce (line 481) | map_reduce& operator+=(const map_reduce& other) { function main (line 499) | int main(int argc, char** argv) { FILE: tests/distributed_ingress_test.cpp function main (line 40) | int main(int argc, char** argv) { FILE: tests/empty_test.cxx class empty_test (line 36) | class empty_test : public CxxTest::TestSuite { method test_empty (line 40) | void test_empty() { FILE: tests/engine_terminator_bench.cxx class increment_update (line 34) | class increment_update : public method foreach (line 39) | foreach(edge_type edge, context.out_edges()) { function make_graph (line 48) | void make_graph(graph_type &graph) { class EngineTerminatorTestSuite (line 59) | class EngineTerminatorTestSuite: public CxxTest::TestSuite { method test_engine_terminator (line 61) | void test_engine_terminator() { FILE: tests/fiber_test.cpp function threadfn (line 6) | void threadfn() { function threadfn2 (line 17) | void threadfn2() { function main (line 27) | int main(int argc, char** argv) { FILE: tests/fibo_fiber_test.cpp type fibonacci_compute_promise (line 6) | struct fibonacci_compute_promise { function fibonacci (line 14) | void fibonacci(fibonacci_compute_promise* promise) { function main (line 54) | int main(int argc, char** argv) { FILE: tests/hdfs_test.cpp function main (line 30) | int main(int argc, char **argv) { FILE: tests/hopscotch_test.cpp function hopscotch_map_sanity_checks (line 17) | void hopscotch_map_sanity_checks() { type bad_hasher (line 82) | struct bad_hasher { function hopscotch_high_collision_sanity_checks (line 90) | void hopscotch_high_collision_sanity_checks() { function benchmark (line 162) | void benchmark() { function main (line 241) | int main(int argc, char** argv) { FILE: tests/local_graph_test.cxx class local_graph_test (line 37) | class local_graph_test : public CxxTest::TestSuite { type vertex_data (line 39) | struct vertex_data { method vertex_data (line 41) | vertex_data() : value(0) { } method vertex_data (line 42) | vertex_data(size_t n) : value(n) { } type edge_data (line 45) | struct edge_data { method edge_data (line 48) | edge_data (int f = 0, int t = 0) : from(f), to(t) {} method test_add_vertex (line 54) | void test_add_vertex() { method test_add_edge (line 68) | void test_add_edge() { method test_dynamic_add_edge (line 81) | void test_dynamic_add_edge() { method test_powerlaw_graph (line 89) | void test_powerlaw_graph() { method test_edge_case (line 103) | void test_edge_case() { method test_sparse_graph (line 114) | void test_sparse_graph() { method test_grid_graph (line 124) | void test_grid_graph() { method test_add_vertex_impl (line 136) | void test_add_vertex_impl(Graph& g, size_t nverts) { method check_adjacency (line 164) | void check_adjacency(Graph& g, method check_edge_data (line 213) | void check_edge_data(Graph& g) { method test_add_edge_impl (line 233) | void test_add_edge_impl(Graph& g, size_t nedges, bool use_dynamic=fals... method test_edge_case_impl (line 277) | void test_edge_case_impl(Graph& g) { method test_sparse_graph_impl (line 288) | void test_sparse_graph_impl (Graph& g) { method test_grid_graph_impl (line 374) | void test_grid_graph_impl(Graph& g, bool verbose = false) { method test_powerlaw_graph_impl (line 521) | void test_powerlaw_graph_impl(Graph& g, size_t nverts, bool use_dynami... FILE: tests/lock_free_pushback.cxx function testthread (line 33) | void testthread(size_t range0, size_t range1) { class LockFreePushBack (line 39) | class LockFreePushBack : public CxxTest::TestSuite { method test_lockfree_push_back (line 42) | void test_lockfree_push_back(void) { FILE: tests/mini_web_server.cpp type mg_event (line 35) | enum mg_event type mg_connection (line 36) | struct mg_connection type mg_request_info (line 37) | struct mg_request_info function main (line 73) | int main(void) { FILE: tests/random_test.cxx function uniform_speed (line 41) | void uniform_speed(const size_t max_iter) { class thread_worker (line 58) | class thread_worker { method run (line 61) | void run() { class RandomTestSuite (line 93) | class RandomTestSuite: public CxxTest::TestSuite { method RandomTestSuite (line 98) | RandomTestSuite() : iterations(1E8) { } method test_nondet_generator (line 101) | void test_nondet_generator() { method test_random_number_generators (line 108) | void test_random_number_generators() { method test_shuffle (line 141) | void test_shuffle() { FILE: tests/scheduler_test.cxx type message_type (line 36) | struct message_type { method message_type (line 40) | explicit message_type(int value = 0, double pr = 0):value(value),pr(pr... method priority (line 42) | double priority() const { method message_type (line 45) | message_type& operator+=(const message_type& other) { function test_scheduler_basic_functionality_single_threaded (line 59) | void test_scheduler_basic_functionality_single_threaded() { function test_basic_functionality_thread (line 100) | void test_basic_functionality_thread(SchedulerType& sched, function test_scheduler_basic_functionality_parallel (line 146) | void test_scheduler_basic_functionality_parallel() { function test_scheduler_min_priority_thread (line 189) | void test_scheduler_min_priority_thread(SchedulerType& sched, function test_scheduler_min_priority_parallel (line 237) | void test_scheduler_min_priority_parallel() { class SerializeTestSuite (line 270) | class SerializeTestSuite : public CxxTest::TestSuite { method test_scheduler_basic_single_threaded (line 272) | void test_scheduler_basic_single_threaded() { method test_scheduler_basic_parallel (line 279) | void test_scheduler_basic_parallel() { method test_scheduler_min_priority (line 287) | void test_scheduler_min_priority() { FILE: tests/serializetests.cxx type A (line 45) | struct A{ method save (line 47) | void save(oarchive &a) const { method load (line 50) | void load(iarchive &a) { class TestClass (line 55) | class TestClass{ method save (line 61) | void save(oarchive &a) const { method load (line 64) | void load(iarchive &a) { type pod_class_1 (line 70) | struct pod_class_1: public graphlab::IS_POD_TYPE { type pod_class_2 (line 74) | struct pod_class_2 { class SerializeTestSuite (line 80) | class SerializeTestSuite : public CxxTest::TestSuite { method test_basic_datatype (line 85) | void test_basic_datatype(void) { method test_vector_serialization (line 143) | void test_vector_serialization(void) { method test_class_serialization (line 167) | void test_class_serialization(void) { method test_vector_of_classes (line 194) | void test_vector_of_classes(void) { method test_vector_of_strings (line 231) | void test_vector_of_strings(void) { method test_map_serialization (line 254) | void test_map_serialization(void) { method test_repeated_array_serialization (line 278) | void test_repeated_array_serialization(void) { method test_boost_unordered_map (line 321) | void test_boost_unordered_map(void) { method test_boost_unordered_set (line 343) | void test_boost_unordered_set(void) { method test_pod_method_1 (line 364) | void test_pod_method_1() { method test_pod_method_2 (line 391) | void test_pod_method_2() { FILE: tests/sfinae_function_test.cpp type ts (line 27) | struct ts{ function by_value (line 32) | void by_value(ts) { function by_const_value (line 35) | void by_const_value(const ts) { function by_reference (line 38) | void by_reference(ts&) { function by_const_reference (line 41) | void by_const_reference(const ts&) { type functor_by_value (line 45) | struct functor_by_value{ type functor_by_const_value (line 49) | struct functor_by_const_value{ type functor_by_reference (line 53) | struct functor_by_reference{ type functor_by_const_reference (line 57) | struct functor_by_const_reference{ type const_functor_by_value (line 62) | struct const_functor_by_value{ type const_functor_by_const_value (line 66) | struct const_functor_by_const_value{ type const_functor_by_reference (line 70) | struct const_functor_by_reference{ type const_functor_by_const_reference (line 74) | struct const_functor_by_const_reference{ type overload_functor_by_value (line 80) | struct overload_functor_by_value{ type overload_functor_by_const_value (line 85) | struct overload_functor_by_const_value{ type overload_functor_by_reference (line 90) | struct overload_functor_by_reference{ type overload_functor_by_const_reference (line 95) | struct overload_functor_by_const_reference{ function test_function_is_const_ref (line 106) | int test_function_is_const_ref(T t) { function main (line 114) | int main(int argc, char** argv) { FILE: tests/small_map_test.cxx class test_small_map (line 39) | class test_small_map : public CxxTest::TestSuite { method test_lookup (line 42) | void test_lookup() { FILE: tests/small_set_test.cxx class test_small_set (line 38) | class test_small_set : public CxxTest::TestSuite { method test_union (line 42) | void test_union() { method test_intersection (line 87) | void test_intersection() { method test_difference (line 132) | void test_difference() { method test_range_iteration (line 172) | void test_range_iteration() { FILE: tests/sort_test.cpp function main (line 7) | int main(int argc, char** argv) { FILE: tests/synchronous_engine_test.cpp class count_in_neighbors (line 35) | class count_in_neighbors : method edge_dir_type (line 39) | edge_dir_type method gather_type (line 43) | gather_type method apply (line 50) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 58) | edge_dir_type function test_in_neighbors (line 65) | void test_in_neighbors(graphlab::distributed_control& dc, class count_out_neighbors (line 90) | class count_out_neighbors : method edge_dir_type (line 94) | edge_dir_type method gather_type (line 98) | gather_type method apply (line 103) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 108) | edge_dir_type function test_out_neighbors (line 114) | void test_out_neighbors(graphlab::distributed_control& dc, class count_all_neighbors (line 138) | class count_all_neighbors : method edge_dir_type (line 142) | edge_dir_type method gather_type (line 146) | gather_type method apply (line 151) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 156) | edge_dir_type function test_all_neighbors (line 162) | void test_all_neighbors(graphlab::distributed_control& dc, class basic_messages (line 187) | class basic_messages : method init (line 193) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 198) | edge_dir_type method gather_type (line 203) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 208) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 219) | edge_dir_type method scatter (line 224) | void scatter(icontext_type& context, const vertex_type& vertex, function test_messages (line 231) | void test_messages(graphlab::distributed_control& dc, class count_aggregators (line 260) | class count_aggregators : method edge_dir_type (line 264) | edge_dir_type method gather_type (line 268) | gather_type method apply (line 275) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 281) | edge_dir_type function iteration_counter (line 287) | int iteration_counter(count_aggregators::icontext_type& context, function iteration_finalize (line 293) | void iteration_finalize(count_aggregators::icontext_type& context, function test_count_aggregators (line 301) | void test_count_aggregators(graphlab::distributed_control& dc, function main (line 321) | int main(int argc, char** argv) { FILE: tests/test_lock_free_pool.cxx function exec (line 31) | void exec() { class LockFreePoolTestSuite (line 47) | class LockFreePoolTestSuite: public CxxTest::TestSuite { method test_lock_free_pool (line 49) | void test_lock_free_pool() { FILE: tests/test_parsers.cpp function check_structure (line 29) | void check_structure(graph_type &graph) { function test_adj (line 68) | void test_adj(graphlab::distributed_control& dc) { function test_snap (line 75) | void test_snap(graphlab::distributed_control& dc) { function test_tsv (line 82) | void test_tsv(graphlab::distributed_control& dc) { function test_powerlaw (line 89) | void test_powerlaw(graphlab::distributed_control& dc) { function test_save_load (line 98) | void test_save_load(graphlab::distributed_control& dc) { function main (line 121) | int main(int argc, char** argv) { FILE: tests/test_vertex_set.cpp function select_out_degree_le (line 34) | bool select_out_degree_le(graph_type::vertex_type vtx, size_t ndeg) { function select_out_degree_eq (line 39) | bool select_out_degree_eq(graph_type::vertex_type vtx, size_t ndeg) { function select_vid_modulo (line 44) | bool select_vid_modulo(graph_type::vertex_type vtx, size_t divisor) { function is_divisible (line 49) | size_t is_divisible(graph_type::vertex_type vtx, size_t divisor) { function count_edges (line 53) | size_t count_edges(graph_type::edge_type e) { function set_to_one (line 57) | void set_to_one(graph_type::vertex_type vtx) { function vertex_data_identity (line 61) | int vertex_data_identity(graph_type::vertex_type vtx) { function main (line 67) | int main(int argc, char** argv) { FILE: tests/thread_tools.cxx function test_inc (line 37) | void test_inc() { function test_dec (line 42) | void test_dec() { function thread_assert_false (line 49) | void thread_assert_false() { function test_group_exception_forwarding (line 54) | void test_group_exception_forwarding(){ function test_pool (line 94) | void test_pool(){ function test_pool_exception_forwarding (line 111) | void test_pool_exception_forwarding(){ class ThreadToolsTestSuite (line 159) | class ThreadToolsTestSuite : public CxxTest::TestSuite { method test_thread_group_exception (line 161) | void test_thread_group_exception(void) { method test_thread_pool (line 165) | void test_thread_pool(void) { method test_thread_pool_exception (line 169) | void test_thread_pool_exception(void) { FILE: tests/union_find_test.cxx function add_even (line 30) | void add_even() { function add_odd (line 42) | void add_odd() { class UnionFindTest (line 54) | class UnionFindTest: public CxxTest::TestSuite { method test_union_find (line 56) | void test_union_find() { method test_union_find2 (line 91) | void test_union_find2() { FILE: toolkits/clustering/generate_synthetic.cpp function main (line 24) | int main(int argc, char** argv) { FILE: toolkits/clustering/graph_laplacian_for_sc.cpp type vertex_data (line 44) | struct vertex_data { method vertex_data (line 47) | vertex_data():x(), D_ii(0.0) {} method vertex_data (line 48) | explicit vertex_data(const std::vector& x_in) : method save (line 51) | void save(graphlab::oarchive& oarc) const { method load (line 58) | void load(graphlab::iarchive& iarc) { type edge_data (line 71) | struct edge_data{ method edge_data (line 74) | edge_data() : A_ij(0.0), nearest(false){} method save (line 75) | void save(graphlab::oarchive& oarc) const { method load (line 78) | void load(graphlab::iarchive& iarc) { function line_parser (line 87) | bool line_parser(graph_type& graph, const std::string& filename, function similarity (line 116) | float similarity(const std::vector& v1, const std::vector&... function calc_similarities (line 126) | void calc_similarities(graph_type::edge_type& edata) { function discard_small_similarity (line 132) | void discard_small_similarity(graph_type::edge_type& edata) { type top_t_similarity (line 139) | struct top_t_similarity{ method top_t_similarity (line 142) | top_t_similarity(): ids(number_of_nearest_neighbors, std::numeric_limi... method top_t_similarity (line 144) | top_t_similarity(size_t id, float sim): ids(number_of_nearest_neighbor... method top_t_similarity (line 150) | top_t_similarity& operator+=(const top_t_similarity& other){ method save (line 171) | void save(graphlab::oarchive& oarc) const { method load (line 178) | void load(graphlab::iarchive& iarc) { class t_nearest (line 197) | class t_nearest: public graphlab::ivertex_program& a, function sqr_distance (line 125) | double sqr_distance(const std::map& a, function vertex_loader (line 232) | bool vertex_loader(graph_type& graph, const std::string& fname, function vertex_loader_sparse (line 258) | bool vertex_loader_sparse(graph_type& graph, const std::string& fname, function vertex_loader_with_id (line 281) | bool vertex_loader_with_id(graph_type& graph, const std::string& fname, function vertex_loader_with_id_sparse (line 309) | bool vertex_loader_with_id_sparse(graph_type& graph, const std::string& ... function edge_loader (line 343) | bool edge_loader(graph_type& graph, const std::string& filename, type max_point_size_reducer (line 364) | struct max_point_size_reducer: public graphlab::IS_POD_TYPE { method max_point_size_reducer (line 367) | static max_point_size_reducer get_max_point_size(const graph_type::ver... method max_point_size_reducer (line 373) | max_point_size_reducer& operator+=(const max_point_size_reducer& other) { type min_point_size_reducer (line 379) | struct min_point_size_reducer: public graphlab::IS_POD_TYPE { method min_point_size_reducer (line 382) | static min_point_size_reducer get_min_point_size(const graph_type::ver... method min_point_size_reducer (line 388) | min_point_size_reducer& operator+=(const min_point_size_reducer& other) { function kmeans_pp_initialization (line 402) | void kmeans_pp_initialization(graph_type::vertex_type& v) { function kmeans_pp_initialization_sparse (line 411) | void kmeans_pp_initialization_sparse(graph_type::vertex_type& v) { type random_sample_reducer (line 425) | struct random_sample_reducer { method random_sample_reducer (line 429) | random_sample_reducer():weight(0) { } method random_sample_reducer (line 430) | random_sample_reducer(const std::vector& vtx, method random_sample_reducer (line 433) | static random_sample_reducer get_weight(const graph_type::vertex_type&... method random_sample_reducer (line 443) | random_sample_reducer& operator+=(const random_sample_reducer& other) { method save (line 460) | void save(graphlab::oarchive &oarc) const { method load (line 464) | void load(graphlab::iarchive& iarc) { type random_sample_reducer_sparse (line 469) | struct random_sample_reducer_sparse{ method random_sample_reducer_sparse (line 473) | random_sample_reducer_sparse():weight(0) { } method random_sample_reducer_sparse (line 474) | random_sample_reducer_sparse(const std::map& vtx, method random_sample_reducer_sparse (line 477) | static random_sample_reducer_sparse get_weight(const graph_type::verte... method random_sample_reducer_sparse (line 487) | random_sample_reducer_sparse& operator+=(const random_sample_reducer_s... method save (line 504) | void save(graphlab::oarchive &oarc) const { method load (line 508) | void load(graphlab::iarchive& iarc) { function kmeans_iteration (line 519) | void kmeans_iteration(graph_type::vertex_type& v) { type neighbor_info (line 564) | struct neighbor_info { method neighbor_info (line 567) | neighbor_info() : method neighbor_info (line 570) | neighbor_info(size_t clst, double weight) : method neighbor_info (line 575) | neighbor_info& operator+=(const neighbor_info& other) { method save (line 588) | void save(graphlab::oarchive& oarc) const { method load (line 591) | void load(graphlab::iarchive& iarc) { class cluster_assignment (line 597) | class cluster_assignment: public graphlab::ivertex_program >& ret, cons... function recover_labels (line 258) | int recover_labels(const std::string& prefix){ function main (line 282) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/adpredictor.cpp type data_role_type (line 41) | enum data_role_type { TRAIN = 0, VALIDATE = 1, PREDICT =2 } type vertex_data (line 46) | struct vertex_data : graphlab::IS_POD_TYPE{ method vertex_data (line 56) | vertex_data() { type edge_data (line 76) | struct edge_data : public graphlab::IS_POD_TYPE { method edge_data (line 93) | edge_data(float x_ij = 1, data_role_type role = TRAIN) : function v (line 112) | double v(double t){ function w (line 125) | double w(double t){ type gather_type (line 131) | struct gather_type: public graphlab::IS_POD_TYPE{ method gather_type (line 136) | gather_type(){ sigma = 0; mu = 0; mult_sigma = 1; } method gather_type (line 137) | gather_type& operator+=(const gather_type& other) { function ctr_predict (line 146) | float ctr_predict( const vertex_data& data, function gather_type (line 162) | gather_type adpredictor_map(graph_type::edge_type edge, graph_type::vert... method gather_type (line 136) | gather_type(){ sigma = 0; mu = 0; mult_sigma = 1; } method gather_type (line 137) | gather_type& operator+=(const gather_type& other) { function adpredictor_combine2 (line 173) | void adpredictor_combine2(gather_type &a, const gather_type & b, const v... function gather_type (line 180) | gather_type adpredictor_map2(graph_type::edge_type edge, graph_type::ver... method gather_type (line 136) | gather_type(){ sigma = 0; mu = 0; mult_sigma = 1; } method gather_type (line 137) | gather_type& operator+=(const gather_type& other) { function adpredictor_update (line 201) | void adpredictor_update(graph_type::vertex_type vertex) { function adpredictor_update2 (line 249) | void adpredictor_update2(graph_type::vertex_type vertex) { function gather_type (line 256) | gather_type count_vertices(const graph_type::vertex_type& vertex) { method gather_type (line 136) | gather_type(){ sigma = 0; mu = 0; mult_sigma = 1; } method gather_type (line 137) | gather_type& operator+=(const gather_type& other) { type model_saver (line 267) | struct model_saver { method save_vertex (line 272) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 280) | std::string save_edge(const edge_type& edge) const { type prediction_saver (line 285) | struct prediction_saver { method save_vertex (line 290) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 298) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 309) | inline bool graph_loader(graph_type& graph, function gather_type (line 364) | gather_type calc_error(const graph_type::vertex_type& vertex) { method gather_type (line 136) | gather_type(){ sigma = 0; mu = 0; mult_sigma = 1; } method gather_type (line 137) | gather_type& operator+=(const gather_type& other) { function main (line 374) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/als.cpp type vertex_data (line 82) | struct vertex_data { method vertex_data (line 98) | vertex_data() : nupdates(0), residual(1) { randomize(); } method randomize (line 100) | void randomize() { factor.resize(NLATENT); factor.setRandom(); } method save (line 102) | void save(graphlab::oarchive& arc) const { method load (line 106) | void load(graphlab::iarchive& arc) { type edge_data (line 119) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 128) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 137) | edge_data(float obs = 0, data_role_type role = TRAIN) : function stats_info (line 151) | stats_info count_edges(const graph_type::edge_type & edge){ function get_other_vertex (line 169) | inline graph_type::vertex_type class gather_type (line 195) | class gather_type { method gather_type (line 209) | gather_type() { } method gather_type (line 215) | gather_type(const vec_type& X, const double y) : method save (line 222) | void save(graphlab::oarchive& arc) const { arc << XtX << Xy; } method load (line 225) | void load(graphlab::iarchive& arc) { arc >> XtX >> Xy; } method gather_type (line 231) | gather_type& operator+=(const gather_type& other) { class als_vertex_program (line 281) | class als_vertex_program : method edge_dir_type (line 295) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 301) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 310) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 334) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 340) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 362) | static graphlab::empty signal_left(icontext_type& context, function graph_loader (line 378) | inline bool graph_loader(graph_type& graph, function extract_l2_error (line 423) | double extract_l2_error(const graph_type::edge_type & edge) { type error_aggregator (line 453) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 457) | error_aggregator() : method error_aggregator (line 459) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 464) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 473) | static void finalize(icontext_type& context, const error_aggregator& a... type prediction_saver (line 492) | struct prediction_saver { method save_vertex (line 495) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 498) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 514) | struct linear_model_saver_U { method save_vertex (line 520) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 530) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 535) | struct linear_model_saver_V { method save_vertex (line 541) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 551) | std::string save_edge(const edge_type& edge) const { function main (line 568) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/biassgd.cpp type vertex_data (line 58) | struct vertex_data { method vertex_data (line 73) | vertex_data() : nupdates(0), bias(0) { if (debug) pvec = vec_type::One... method randomize (line 75) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); } method save (line 77) | void save(graphlab::oarchive& arc) const { method load (line 81) | void load(graphlab::iarchive& arc) { type edge_data (line 92) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 101) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 110) | edge_data(float obs = 0, data_role_type role = PREDICT) : function get_other_vertex (line 131) | inline graph_type::vertex_type class gather_type (line 144) | class gather_type { method gather_type (line 150) | gather_type() { } method gather_type (line 154) | gather_type(const vec_type& X, double _bias) { method save (line 160) | void save(graphlab::oarchive& arc) const { arc << pvec << bias; } method load (line 163) | void load(graphlab::iarchive& arc) { arc >> pvec >> bias; } method gather_type (line 167) | gather_type& operator+=(const gather_type& other) { class biassgd_vertex_program (line 188) | class biassgd_vertex_program : method save (line 206) | void save(graphlab::oarchive& arc) const { method load (line 210) | void load(graphlab::iarchive& arc) { method edge_dir_type (line 215) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 221) | gather_type gather(icontext_type& context, const vertex_type& vertex, method init (line 269) | void init(icontext_type& context, method apply (line 277) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 295) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 301) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 316) | static graphlab::empty signal_left(icontext_type& context, type error_aggregator (line 325) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 330) | error_aggregator() : method error_aggregator (line 332) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 340) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 353) | static void finalize(icontext_type& context, const error_aggregator& a... function extract_l2_error (line 374) | double extract_l2_error(const graph_type::edge_type & edge) { type prediction_saver (line 387) | struct prediction_saver { method save_vertex (line 390) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 393) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 411) | struct linear_model_saver_U { method save_vertex (line 417) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 427) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 432) | struct linear_model_saver_V { method save_vertex (line 438) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 448) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_bias_U (line 453) | struct linear_model_saver_bias_U { method save_vertex (line 459) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 467) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_bias_V (line 471) | struct linear_model_saver_bias_V { method save_vertex (line 477) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 485) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 495) | inline bool graph_loader(graph_type& graph, function calc_global_mean (line 553) | double calc_global_mean(const graph_type::edge_type & edge){ function count_edges (line 559) | size_t count_edges(const graph_type::edge_type & edge){ function main (line 566) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/cdf.hpp function phi (line 35) | double phi(double x) FILE: toolkits/collaborative_filtering/cosamp.hpp function ivec (line 28) | ivec sort_union(ivec a, ivec b){ function vec (line 39) | vec CoSaMP(const mat & Phi, const vec & u, int K, int max_iter, double t... function test_cosamp (line 86) | void test_cosamp(){ FILE: toolkits/collaborative_filtering/eigen_serialization.hpp function BEGIN_OUT_OF_PLACE_SAVE (line 35) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_LOAD (line 48) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_SAVE (line 62) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::MatrixXd, mat) { function BEGIN_OUT_OF_PLACE_LOAD (line 77) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::MatrixXd, mat) { FILE: toolkits/collaborative_filtering/eigen_wrapper.hpp function debug_print_vec (line 53) | inline void debug_print_vec(const char * name,const vec& _vec, int len){ function debug_print_vec (line 61) | inline void debug_print_vec(const char * name,const double* _vec, int len){ function set_val (line 72) | inline void set_val(mat &A, int row, int col, data val){ function get_val (line 75) | inline double get_val(const mat &A, int row, int col){ function get_val (line 78) | inline int get_val(const imat &A, int row, int col){ function vec (line 81) | inline vec get_col(const mat& A, int col){ function vec (line 84) | inline vec get_row(const mat& A, int row){ function set_col (line 87) | inline void set_col(mat& A, int col, const vec & val){ function set_row (line 90) | inline void set_row(mat& A, int row, const vec & val){ function mat (line 94) | inline mat eye(int size){ function vec (line 97) | inline vec ones(int size){ function vec (line 100) | inline vec init_vec(const double * array, int size){ function mat (line 105) | inline mat init_mat(const char * string, int row, int col){ function imat (line 118) | inline imat init_imat(const char * string, int row, int col){ function vec (line 131) | inline vec init_vec(const char * string, int size){ function vec (line 146) | inline vec init_dbl_vec(const char * string, int size){ function vec (line 150) | inline vec zeros(int size){ function mat (line 153) | inline mat zeros(int rows, int cols){ function vec (line 156) | inline vec head(const vec& v, int num){ function vec (line 159) | inline vec mid(const vec&v, int start, int num){ function vec (line 162) | inline vec tail(const vec&v, int num){ function ivec (line 165) | inline ivec head(const ivec& v, int num){ function sort (line 168) | inline void sort(ivec &a){ function sort (line 171) | inline void sort(vec & a){ function ivec (line 174) | inline ivec sort_index(const vec&a){ function dot2 (line 188) | inline void dot2(const vec& x1, const vec& x3, mat & Q, int j, int len){ function ls_solve_chol (line 194) | inline bool ls_solve_chol(const mat &A, const vec &b, vec &result){ function ls_solve (line 199) | inline bool ls_solve(const mat &A, const vec &b, vec &result){ function chol (line 204) | inline bool chol(mat& sigma, mat& out){ function backslash (line 208) | inline bool backslash(const mat& A, const vec & b, vec & x){ function mat (line 212) | inline mat transpose(mat & A){ function mat (line 215) | inline mat randn(int dx, int dy){ function set_diag (line 218) | inline void set_diag(mat &A, vec & v){ function mat (line 221) | inline mat diag(vec & v){ function sumsum (line 226) | inline double sumsum(const mat & A){ function norm (line 229) | inline double norm(const mat &A, int pow=2){ function mat (line 232) | inline mat inv(const mat&A){ function inv (line 235) | inline bool inv(const mat&A, mat &out){ function mat (line 239) | inline mat outer_product(const vec&a, const vec&b){ function eig_sym (line 243) | inline bool eig_sym(const mat & T, vec & eigenvalues, mat & eigenvectors){ function vec (line 261) | inline vec elem_mult(const vec&a, const vec&b){ function sparse_vec (line 267) | inline sparse_vec elem_mult(const sparse_vec&a, const sparse_vec&b){ function sum (line 270) | inline double sum(const vec & a){ function min (line 273) | inline double min(const vec &a){ function max (line 276) | inline double max(const vec & a){ function vec (line 279) | inline vec randu(int size){ function randu (line 282) | inline double randu(){ function ivec (line 285) | inline ivec randi(int size, int from, int to){ function randi (line 291) | inline int randi(int from, int to){ function ivec (line 294) | inline ivec concat(const ivec&a, const ivec&b){ function del (line 299) | inline void del(ivec&a, int i){ function mat (line 303) | inline mat get_cols(const mat&A, ivec & cols){ function mat (line 309) | inline mat get_cols(const mat&A, int start_col, int end_col){ function set_val (line 318) | inline void set_val(vec & v, int pos, double val){ function dot (line 321) | inline double dot(const vec&a, const vec& b){ function vec (line 324) | inline vec reverse(vec& a){ function ivec (line 327) | inline ivec reverse(ivec& a){ class it_file (line 340) | class it_file{ method it_file (line 344) | it_file(const char * name){ method close (line 449) | void close(){ function set_size (line 455) | inline void set_size(sparse_vec &v, int size){ function set_new (line 458) | inline void set_new(sparse_vec&v, int ind, double val){ function nnz (line 461) | inline int nnz(sparse_vec& v){ function get_nz_index (line 464) | inline int get_nz_index(sparse_vec &v, sparse_vec::InnerIterator& i){ function get_nz_data (line 467) | inline double get_nz_data(sparse_vec &v, sparse_vec::InnerIterator& i){ function FOR_ITERATOR (line 484) | FOR_ITERATOR(i,a){ function trace (line 490) | inline double trace(const mat & a){ function get_nz_data (line 493) | inline double get_nz_data(sparse_vec &v, int i){ function print (line 504) | inline void print(sparse_vec & vec){ function vec (line 514) | inline vec pow(const vec&v, int exponent){ function dot_prod (line 520) | inline double dot_prod(sparse_vec &v1, sparse_vec & v2){ function dot_prod (line 523) | inline double dot_prod(const vec &v1, const vec & v2){ function dot_prod (line 526) | inline double dot_prod(sparse_vec &v1, const vec & v2){ function vec (line 533) | inline vec cumsum(vec& v){ function get_val (line 540) | inline double get_val(sparse_vec & v1, int i){ //TODO optimize performance function get_val (line 547) | inline double get_val(vec & v1, int i){ function set_div (line 550) | inline void set_div(sparse_vec&v, sparse_vec::InnerIterator i, double val){ function sparse_vec (line 553) | inline sparse_vec minus(sparse_vec &v1,sparse_vec &v2){ function vec (line 556) | inline vec minus( sparse_vec &v1, vec &v2){ function plus (line 563) | inline void plus( vec &v1, sparse_vec &v2){ function minus (line 568) | inline void minus( vec &v1, sparse_vec &v2){ function sparse_vec (line 573) | inline sparse_vec fabs( sparse_vec & dvec1){ function vec (line 581) | inline vec fabs( const vec & dvec1){ function abs_sum (line 588) | inline double abs_sum(const mat& A){ function abs_sum (line 595) | inline double abs_sum(const vec &v){ function sum (line 601) | inline double sum(const sparse_vec &v){ function vec (line 608) | inline vec sqrt(const vec & v){ function svd (line 615) | inline void svd(const mat & A, mat & U, mat & V, vec & singular_values){ FILE: toolkits/collaborative_filtering/implicit.hpp function uint (line 41) | uint add_implicit_edges4(int type, graph_type & graph, graphlab::distrib... function uint (line 66) | uint add_implicit_edges(int type, graph_type & graph, graphlab::distribu... function parse_implicit_command_line (line 90) | void parse_implicit_command_line(graphlab::command_line_options & clopts){ FILE: toolkits/collaborative_filtering/make_synthetic_als_data.cpp function main (line 31) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/math.hpp type math_info (line 44) | struct math_info{ method math_info (line 63) | math_info(){ method reset_offsets (line 67) | void reset_offsets(){ method increment_offset (line 79) | int increment_offset(){ class DistMat (line 89) | class DistMat method DistMat (line 524) | DistMat(const bipartite_graph_descriptor& _info) { method DistMat (line 530) | DistMat &operator*(const DistVec & v){ method DistMat (line 539) | DistMat &operator-(){ method DistMat (line 544) | DistMat &operator/(const DistVec & v){ method DistMat (line 549) | DistMat &operator+(){ method DistMat (line 553) | DistMat &operator+(const DistVec &v){ method DistMat (line 559) | DistMat &operator-(const DistVec &v){ method DistMat (line 567) | DistMat & _transpose(){ method DistMat (line 572) | DistMat & operator~(){ method DistMat (line 575) | DistMat & backslash(DistSlicedMat & U){ method set_use_diag (line 580) | void set_use_diag(bool use){ class DistDouble (line 90) | class DistDouble method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } class DistSlicedMat (line 91) | class DistSlicedMat method DistSlicedMat (line 369) | DistSlicedMat(int _start_offset, int _end_offset, bool _transpose, con... method init (line 383) | void init(){ method size (line 390) | int size(int dim){ return (dim == 1) ? (end-start) : (end_offset - sta... method set_cols (line 392) | void set_cols(int start_col, int end_col, const mat& pmat){ method mat (line 400) | mat get_cols(int start_col, int end_col){ method get_name (line 415) | std::string get_name(int pos){ method DistVec (line 421) | DistVec operator[](int pos){ class Axb (line 107) | class Axb : method gather (line 113) | double gather(icontext_type& context, const vertex_type& vertex, method apply (line 133) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 182) | edge_dir_type gather_edges(icontext_type& context, method edge_dir_type (line 190) | edge_dir_type scatter_edges(icontext_type& context, function init_lanczos_mapr (line 202) | void init_lanczos_mapr( graph_type::vertex_type& vertex) { function init_math (line 210) | void init_math(graph_type * _pgraph, bipartite_graph_descriptor & _info,... class DistVec (line 220) | class DistVec{ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { class DistSlicedMat (line 359) | class DistSlicedMat{ method DistSlicedMat (line 369) | DistSlicedMat(int _start_offset, int _end_offset, bool _transpose, con... method init (line 383) | void init(){ method size (line 390) | int size(int dim){ return (dim == 1) ? (end-start) : (end_offset - sta... method set_cols (line 392) | void set_cols(int start_col, int end_col, const mat& pmat){ method mat (line 400) | mat get_cols(int start_col, int end_col){ method get_name (line 415) | std::string get_name(int pos){ method DistVec (line 421) | DistVec operator[](int pos){ function assign_vec (line 433) | void assign_vec(graph_type::vertex_type & vertex){ function gather_type (line 439) | gather_type output_vector(const graph_type::vertex_type & vertex){ function select_in_range (line 448) | bool select_in_range(const graph_type::vertex_type & vertex){ function DistVec (line 451) | DistVec& DistVec::operator=(const DistVec & vec){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function DistVec (line 475) | DistVec& DistVec::operator=(const vec & pvec){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function vec (line 500) | vec DistVec::to_vec(int dmax, int doffset){ class DistMat (line 519) | class DistMat{ method DistMat (line 524) | DistMat(const bipartite_graph_descriptor& _info) { method DistMat (line 530) | DistMat &operator*(const DistVec & v){ method DistMat (line 539) | DistMat &operator-(){ method DistMat (line 544) | DistMat &operator/(const DistVec & v){ method DistMat (line 549) | DistMat &operator+(){ method DistMat (line 553) | DistMat &operator+(const DistVec &v){ method DistMat (line 559) | DistMat &operator-(const DistVec &v){ method DistMat (line 567) | DistMat & _transpose(){ method DistMat (line 572) | DistMat & operator~(){ method DistMat (line 575) | DistMat & backslash(DistSlicedMat & U){ method set_use_diag (line 580) | void set_use_diag(bool use){ function DistVec (line 586) | DistVec& DistVec::operator=(DistMat &mat){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function DistVec (line 606) | DistVec& DistVec::operator+(const DistMat &other){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function DistVec (line 611) | DistVec& DistVec::operator-(const DistMat & other){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function DistMat (line 620) | DistMat& DistVec::operator*(DistMat & v){ method DistMat (line 524) | DistMat(const bipartite_graph_descriptor& _info) { method DistMat (line 530) | DistMat &operator*(const DistVec & v){ method DistMat (line 539) | DistMat &operator-(){ method DistMat (line 544) | DistMat &operator/(const DistVec & v){ method DistMat (line 549) | DistMat &operator+(){ method DistMat (line 553) | DistMat &operator+(const DistVec &v){ method DistMat (line 559) | DistMat &operator-(const DistVec &v){ method DistMat (line 567) | DistMat & _transpose(){ method DistMat (line 572) | DistMat & operator~(){ method DistMat (line 575) | DistMat & backslash(DistSlicedMat & U){ method set_use_diag (line 580) | void set_use_diag(bool use){ class DistDouble (line 627) | class DistDouble{ method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } function DistDouble (line 672) | DistDouble DistVec::operator*(const DistVec & vec){ method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } function DistVec (line 691) | DistVec& DistVec::operator*(const DistDouble &dval){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { function size (line 697) | int size(DistMat & A, int pos){ function DistMat (line 702) | DistMat &DistMat::operator*(const DistDouble &d){ method DistMat (line 524) | DistMat(const bipartite_graph_descriptor& _info) { method DistMat (line 530) | DistMat &operator*(const DistVec & v){ method DistMat (line 539) | DistMat &operator-(){ method DistMat (line 544) | DistMat &operator/(const DistVec & v){ method DistMat (line 549) | DistMat &operator+(){ method DistMat (line 553) | DistMat &operator+(const DistVec &v){ method DistMat (line 559) | DistMat &operator-(const DistVec &v){ method DistMat (line 567) | DistMat & _transpose(){ method DistMat (line 572) | DistMat & operator~(){ method DistMat (line 575) | DistMat & backslash(DistSlicedMat & U){ method set_use_diag (line 580) | void set_use_diag(bool use){ function DistDouble (line 707) | DistDouble sqrt(DistDouble & dval){ method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } function gather_type (line 713) | gather_type calc_norm(const graph_type::vertex_type & vertex){ function DistDouble (line 720) | DistDouble norm(const DistVec &vec){ method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } function DistDouble (line 739) | DistDouble norm(DistMat & mat){ method DistDouble (line 632) | DistDouble() {} method DistDouble (line 633) | DistDouble(double _val) : val(_val) {} method DistVec (line 636) | DistVec& operator*(DistVec & dval){ method DistMat (line 640) | DistMat& operator*(DistMat & mat){ method DistDouble (line 645) | DistDouble operator/(const DistDouble dval){ method DistDouble (line 653) | DistDouble & operator=(const DistDouble & other){ method debug_print (line 661) | void debug_print(const char * name){ method toDouble (line 664) | double toDouble(){ method debug_print (line 667) | void debug_print(std::string name){ return debug_print(name.c_str()); } function vec (line 745) | vec diag(DistMat & mat){ function gather_type (line 756) | gather_type map_reduce_ortho(const graph_type::vertex_type & vertex){ function gather_type (line 770) | gather_type map_reduce_sum_power(const graph_type::vertex_type & vertex){ function divide_by_sum (line 776) | void divide_by_sum(graph_type::vertex_type& vertex){ function transform_ortho (line 783) | void transform_ortho(graph_type::vertex_type & vertex){ function selected_node (line 791) | bool selected_node(const graph_type::vertex_type& vertex){ function orthogonalize_vs_all (line 799) | double orthogonalize_vs_all(DistSlicedMat & mat, int _curoffset, double ... function DistVec (line 844) | DistVec& DistVec::operator/(const DistDouble & other){ method init (line 231) | void init(){ method size (line 238) | int size(){ return end-start; } method DistVec (line 240) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 249) | DistVec(const bipartite_graph_descriptor &_info, int _offset, bool _tr... method DistVec (line 261) | DistVec& operator-(){ method DistVec (line 265) | DistVec& operator-(const DistVec & other){ method DistVec (line 275) | DistVec& operator+(){ method DistVec (line 280) | DistVec& orthogonalize(){ method DistVec (line 285) | DistVec& operator+(const DistVec &other){ method DistVec (line 295) | DistVec& operator/(const DistVec &other){ method DistVec (line 301) | DistVec& operator/(double val){ method debug_print (line 315) | void debug_print(const char * name){ method debug_print (line 326) | void debug_print(std::string name){ return debug_print(name.c_str());} method DistVec (line 336) | DistVec& operator*(const double val){ method DistVec (line 345) | DistVec& _transpose() { FILE: toolkits/collaborative_filtering/nmf.cpp function isuser (line 47) | bool isuser(uint node){ type vertex_data (line 62) | struct vertex_data { method vertex_data (line 77) | vertex_data() { if (debug) pvec = vec::Ones(NLATENT); else randomize()... method randomize (line 79) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); } method save (line 81) | void save(graphlab::oarchive& arc) const { method load (line 85) | void load(graphlab::iarchive& arc) { type edge_data (line 96) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 105) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 114) | edge_data(float weight = 0, data_role_type role = PREDICT) : function get_other_vertex (line 136) | inline graph_type::vertex_type class gather_type (line 143) | class gather_type { method gather_type (line 148) | gather_type() { training_rmse = validation_rmse = 0; } method gather_type (line 149) | gather_type(const vec & _pvec, double _train_rmse, double _validation_... method reset (line 150) | void reset(){ pvec = vec::Zero(vertex_data::NLATENT); training_rmse = ... method save (line 151) | void save(graphlab::oarchive& arc) const { arc << pvec << training_rms... method load (line 152) | void load(graphlab::iarchive& arc) { arc >> pvec >> training_rmse >> v... method gather_type (line 153) | gather_type& operator+=(const gather_type& other) { function isuser_node (line 167) | bool isuser_node(const graph_type::vertex_type& vertex){ class nmf_vertex_program (line 173) | class nmf_vertex_program : method nmf_predict (line 185) | static float nmf_predict(const vertex_data& user, method edge_dir_type (line 203) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 210) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 228) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 243) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 249) | void scatter(icontext_type& context, const vertex_type& vertex, method verify_rows (line 253) | static void verify_rows(graph_type::vertex_type& vertex){ method gather_type (line 258) | static gather_type pre_iter(const graph_type::vertex_type & vertex){ method signal_left (line 267) | static graphlab::empty signal_left(icontext_type& context, method signal_right (line 273) | static graphlab::empty signal_right(icontext_type& context, function gather_type (line 281) | gather_type count_edges(nmf_vertex_program::icontext_type & context, con... method gather_type (line 148) | gather_type() { training_rmse = validation_rmse = 0; } method gather_type (line 149) | gather_type(const vec & _pvec, double _train_rmse, double _validation_... method reset (line 150) | void reset(){ pvec = vec::Zero(vertex_data::NLATENT); training_rmse = ... method save (line 151) | void save(graphlab::oarchive& arc) const { arc << pvec << training_rms... method load (line 152) | void load(graphlab::iarchive& arc) { arc >> pvec >> training_rmse >> v... method gather_type (line 153) | gather_type& operator+=(const gather_type& other) { type prediction_saver (line 295) | struct prediction_saver { method save_vertex (line 301) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 304) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 318) | struct linear_model_saver_U { method save_vertex (line 324) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 334) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 339) | struct linear_model_saver_V { method save_vertex (line 345) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 355) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 366) | inline bool graph_loader(graph_type& graph, function main (line 423) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/printouts.hpp function fabs2 (line 7) | inline double fabs2(double val){ function gather_type (line 14) | gather_type collect_vec(const graph_type::vertex_type& vertex) { function print_vec (line 27) | void print_vec(const char * name, const DistVec & vec, bool high = false){ function print_vec (line 44) | void print_vec(const char * name, const vec & pvec, bool high = false){ function print_mat (line 56) | void print_mat(const char * name, const mat & pmat, bool high = false){ function print_vec_pos (line 75) | void print_vec_pos(std::string name, vec & v, int i){ FILE: toolkits/collaborative_filtering/sgd.cpp function isuser (line 47) | bool isuser(uint node){ type vertex_data (line 63) | struct vertex_data { method vertex_data (line 77) | vertex_data() : nupdates(0) { if (debug) pvec = vec_type::Ones(NLATENT... method randomize (line 79) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); } method save (line 81) | void save(graphlab::oarchive& arc) const { method load (line 85) | void load(graphlab::iarchive& arc) { type edge_data (line 96) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 105) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 114) | edge_data(float obs = 0, data_role_type role = PREDICT) : function stats_info (line 128) | stats_info count_edges(const graph_type::edge_type & edge){ function get_other_vertex (line 148) | inline graph_type::vertex_type class gather_type (line 161) | class gather_type { method gather_type (line 173) | gather_type() { } method gather_type (line 179) | gather_type(const vec_type& X) { method save (line 184) | void save(graphlab::oarchive& arc) const { arc << pvec; } method load (line 187) | void load(graphlab::iarchive& arc) { arc >> pvec; } method gather_type (line 191) | gather_type& operator+=(const gather_type& other) { function isuser_node (line 206) | bool isuser_node(const graph_type::vertex_type& vertex){ class sgd_vertex_program (line 213) | class sgd_vertex_program : method save (line 228) | void save(graphlab::oarchive& arc) const { method load (line 232) | void load(graphlab::iarchive& arc) { method edge_dir_type (line 237) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 243) | gather_type gather(icontext_type& context, const vertex_type& vertex, method init (line 284) | void init(icontext_type& context, method apply (line 294) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 312) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 318) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 333) | static graphlab::empty signal_left(icontext_type& context, type error_aggregator (line 342) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 347) | error_aggregator() : method error_aggregator (line 349) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 355) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 370) | static void finalize(icontext_type& context, const error_aggregator& a... function extract_l2_error (line 390) | double extract_l2_error(const graph_type::edge_type & edge) { type prediction_saver (line 401) | struct prediction_saver { method save_vertex (line 407) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 410) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 424) | struct linear_model_saver_U { method save_vertex (line 430) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 440) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 445) | struct linear_model_saver_V { method save_vertex (line 451) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 461) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 472) | inline bool graph_loader(graph_type& graph, function main (line 533) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/sparse_als.cpp type vertex_data (line 92) | struct vertex_data { method vertex_data (line 108) | vertex_data() : nupdates(0), residual(1) { randomize(); } method randomize (line 110) | void randomize() { factor.resize(NLATENT); factor.setRandom(); } method save (line 112) | void save(graphlab::oarchive& arc) const { method load (line 116) | void load(graphlab::iarchive& arc) { type edge_data (line 129) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 138) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 147) | edge_data(float obs = 0, data_role_type role = PREDICT) : function stats_info (line 161) | stats_info count_edges(const graph_type::edge_type & edge){ function get_other_vertex (line 178) | inline graph_type::vertex_type class gather_type (line 204) | class gather_type { method gather_type (line 218) | gather_type() { } method gather_type (line 224) | gather_type(const vec& X, const double y) : method save (line 231) | void save(graphlab::oarchive& arc) const { arc << XtX << Xy; } method load (line 234) | void load(graphlab::iarchive& arc) { arc >> XtX >> Xy; } method gather_type (line 240) | gather_type& operator+=(const gather_type& other) { class als_vertex_program (line 290) | class als_vertex_program : method edge_dir_type (line 303) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 309) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 318) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 350) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 356) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 376) | static graphlab::empty signal_left(icontext_type& context, function graph_loader (line 390) | inline bool graph_loader(graph_type& graph, function extract_l2_error (line 435) | double extract_l2_error(const graph_type::edge_type & edge) { type error_aggregator (line 464) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 468) | error_aggregator() : method error_aggregator (line 471) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 476) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 485) | static void finalize(icontext_type& context, const error_aggregator& a... type prediction_saver (line 504) | struct prediction_saver { method save_vertex (line 507) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 510) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 524) | struct linear_model_saver_U { method save_vertex (line 530) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 540) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 545) | struct linear_model_saver_V { method save_vertex (line 551) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 561) | std::string save_edge(const edge_type& edge) const { function main (line 578) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/stats.hpp type stats_info (line 26) | struct stats_info{ method stats_info (line 32) | stats_info(){ method stats_info (line 36) | stats_info & operator+=(const stats_info & other){ method save (line 45) | void save(graphlab::oarchive& arc) const { arc << validation_edges << ... method load (line 48) | void load(graphlab::iarchive& arc) { arc >> validation_edges >> traini... FILE: toolkits/collaborative_filtering/svd.cpp type vertex_data (line 79) | struct vertex_data { method vertex_data (line 88) | vertex_data() : A_ii(0) { randomize(); } method randomize (line 90) | void randomize() { pvec.resize(data_size); pvec.setRandom(); } method save (line 92) | void save(graphlab::oarchive& arc) const { method load (line 96) | void load(graphlab::iarchive& arc) { class gather_type (line 102) | class gather_type { method gather_type (line 107) | gather_type() { training_rmse = validation_rmse = 0; } method save (line 108) | void save(graphlab::oarchive& arc) const { arc << pvec << training_rms... method load (line 109) | void load(graphlab::iarchive& arc) { arc >> pvec >> training_rmse >> v... method gather_type (line 110) | gather_type& operator+=(const gather_type& other) { type edge_data (line 127) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 136) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 145) | edge_data(double obs = 0, data_role_type role = PREDICT) : function get_other_vertex (line 162) | inline graph_type::vertex_type get_other_vertex(graph_type::edge_type& e... type prediction_saver (line 183) | struct prediction_saver { method save_vertex (line 186) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 189) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 206) | struct linear_model_saver_U { method save_vertex (line 213) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 224) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 229) | struct linear_model_saver_V { method save_vertex (line 235) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 245) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 255) | inline bool graph_loader(graph_type& graph, function init_lanczos (line 310) | void init_lanczos(graph_type * g, bipartite_graph_descriptor & info){ function swork_vec (line 327) | void swork_vec(graph_type::vertex_type & vertex){ function compute_ritz (line 334) | void compute_ritz(graph_type::vertex_type & vertex){ function lanczos (line 354) | void lanczos(bipartite_graph_descriptor & info, timer & mytimer, vec & e... function start_engine (line 581) | void start_engine(){ function write_output_vector (line 587) | void write_output_vector(const std::string datafile, const vec & output,... function main (line 603) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/svdpp.cpp type vertex_data (line 68) | struct vertex_data { method vertex_data (line 84) | vertex_data() : nupdates(0) { randomize(); } method randomize (line 86) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); weight.resi... method save (line 88) | void save(graphlab::oarchive& arc) const { method load (line 92) | void load(graphlab::iarchive& arc) { type edge_data (line 103) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 112) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 121) | edge_data(float obs = 0, data_role_type role = PREDICT) : function get_other_vertex (line 142) | inline graph_type::vertex_type class gather_type (line 169) | class gather_type { method gather_type (line 184) | gather_type() { } method gather_type (line 190) | gather_type(const vec_type& X, const vec_type & _weight, double _bias) { method save (line 197) | void save(graphlab::oarchive& arc) const { arc << pvec << bias << weig... method load (line 200) | void load(graphlab::iarchive& arc) { arc >> pvec >> bias >> weight; } method gather_type (line 206) | gather_type& operator+=(const gather_type& other) { class svdpp_vertex_program (line 233) | class svdpp_vertex_program : method save (line 251) | void save(graphlab::oarchive& arc) const { method load (line 255) | void load(graphlab::iarchive& arc) { method edge_dir_type (line 260) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 265) | gather_type gather(icontext_type& context, const vertex_type& vertex, method init (line 329) | void init(icontext_type& context, method apply (line 346) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 379) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 385) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 400) | static graphlab::empty signal_left(icontext_type& context, type error_aggregator (line 409) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 414) | error_aggregator() : method error_aggregator (line 416) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 424) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 437) | static void finalize(icontext_type& context, const error_aggregator& a... function extract_l2_error (line 463) | double extract_l2_error(const graph_type::edge_type & edge) { type prediction_saver (line 476) | struct prediction_saver { method save_vertex (line 479) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 482) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 498) | struct linear_model_saver_U { method save_vertex (line 504) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 514) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 519) | struct linear_model_saver_V { method save_vertex (line 525) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 535) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_bias_U (line 540) | struct linear_model_saver_bias_U { method save_vertex (line 546) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 554) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_bias_V (line 558) | struct linear_model_saver_bias_V { method save_vertex (line 564) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 572) | std::string save_edge(const edge_type& edge) const { function graph_loader (line 584) | inline bool graph_loader(graph_type& graph, function calc_global_mean (line 644) | double calc_global_mean(const graph_type::edge_type & edge){ function count_edges (line 650) | size_t count_edges(const graph_type::edge_type & edge){ function main (line 657) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/types.hpp type bipartite_graph_descriptor (line 9) | struct bipartite_graph_descriptor { method bipartite_graph_descriptor (line 14) | bipartite_graph_descriptor() : rows(0), cols(0), nonzeros(0), force_no... method is_square (line 17) | bool is_square() const { return rows == cols && !force_non_square; } method get_start_node (line 19) | int get_start_node(bool _rows) const { if (is_square()) return 0; else... method get_end_node (line 21) | int get_end_node(bool _rows) const { if (is_square()) return rows; els... method num_nodes (line 23) | int num_nodes(bool _rows) const { if (_rows) return rows; else return ... method total (line 25) | int total() const { if (is_square()) return rows; else return rows+col... method is_row_node (line 27) | bool is_row_node(int id) const { return id < rows; } method toprint (line 29) | bool toprint(int id) const { return (id == 0) || (id == rows - 1) || (... FILE: toolkits/collaborative_filtering/wals.cpp type vertex_data (line 86) | struct vertex_data { method vertex_data (line 102) | vertex_data() : nupdates(0), residual(1) { randomize(); } method randomize (line 104) | void randomize() { factor.resize(NLATENT); factor.setRandom(); } method save (line 106) | void save(graphlab::oarchive& arc) const { method load (line 110) | void load(graphlab::iarchive& arc) { type edge_data (line 123) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 132) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 144) | edge_data(float obs = 0, data_role_type role = TRAIN, float weight = 1) : function stats_info (line 158) | stats_info count_edges(const graph_type::edge_type & edge){ function get_other_vertex (line 176) | inline graph_type::vertex_type class gather_type (line 202) | class gather_type { method gather_type (line 221) | gather_type() { } method gather_type (line 227) | gather_type(const vec_type& X, const double y, const float weight) : method save (line 234) | void save(graphlab::oarchive& arc) const { arc << XtX << Xy << weight; } method load (line 237) | void load(graphlab::iarchive& arc) { arc >> XtX >> Xy >> weight; } method gather_type (line 243) | gather_type& operator+=(const gather_type& other) { class als_vertex_program (line 293) | class als_vertex_program : method edge_dir_type (line 306) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 312) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 321) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 341) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 347) | void scatter(icontext_type& context, const vertex_type& vertex, method signal_left (line 367) | static graphlab::empty signal_left(icontext_type& context, function graph_loader (line 381) | inline bool graph_loader(graph_type& graph, function extract_l2_error (line 423) | double extract_l2_error(const graph_type::edge_type & edge) { type error_aggregator (line 452) | struct error_aggregator : public graphlab::IS_POD_TYPE { method error_aggregator (line 456) | error_aggregator() : method error_aggregator (line 458) | error_aggregator& operator+=(const error_aggregator& other) { method error_aggregator (line 463) | static error_aggregator map(icontext_type& context, const graph_type::... method finalize (line 472) | static void finalize(icontext_type& context, const error_aggregator& a... type prediction_saver (line 491) | struct prediction_saver { method save_vertex (line 494) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 497) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 512) | struct linear_model_saver_U { method save_vertex (line 518) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 528) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 533) | struct linear_model_saver_V { method save_vertex (line 539) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 549) | std::string save_edge(const edge_type& edge) const { function main (line 566) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/warp_als_coord.cpp function isuser (line 52) | bool isuser(uint node){ type vertex_data (line 68) | struct vertex_data { method vertex_data (line 84) | vertex_data() : t(0),z(0) { if (debug) pvec = vec_type::Ones(NLATENT);... method randomize (line 86) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); } method save (line 88) | void save(graphlab::oarchive& arc) const { method load (line 92) | void load(graphlab::iarchive& arc) { function hash_value (line 97) | std::size_t hash_value(vertex_data const& b) { type edge_data (line 107) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 116) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 128) | edge_data(float obs = 0, data_role_type role = PREDICT) : function hash_value (line 133) | std::size_t hash_value(edge_data const& b) { function isuser_node (line 145) | bool isuser_node(const graph_type::vertex_type& vertex){ function graph_loader (line 155) | inline bool graph_loader(graph_type& graph, class gather_type (line 182) | class gather_type { method gather_type (line 187) | gather_type() { method gather_type (line 192) | gather_type(double numerator, double denominator) : numerator(numerator), method save (line 197) | void save(graphlab::oarchive& arc) const { arc << numerator << denomin... method load (line 200) | void load(graphlab::iarchive& arc) { arc >> numerator >> denominator; } method gather_type (line 205) | gather_type& operator+=(const gather_type& other) { function gather_type (line 215) | gather_type als_coord_map(const graph_type::vertex_type& center, method gather_type (line 187) | gather_type() { method gather_type (line 192) | gather_type(double numerator, double denominator) : numerator(numerator), method save (line 197) | void save(graphlab::oarchive& arc) const { arc << numerator << denomin... method load (line 200) | void load(graphlab::iarchive& arc) { arc >> numerator >> denominator; } method gather_type (line 205) | gather_type& operator+=(const gather_type& other) { function als_coord_transform (line 236) | void als_coord_transform(const graph_type::vertex_type& center, function als_coord_combine (line 246) | void als_coord_combine(gather_type& v1, const gather_type& v2) { function als_coord_function (line 251) | void als_coord_function(engine_type::context_type& context, function extract_l2_error (line 274) | double extract_l2_error(const graph_type::edge_type & edge) { type prediction_saver (line 288) | struct prediction_saver { method save_vertex (line 291) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 294) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_U (line 310) | struct linear_model_saver_U { method save_vertex (line 316) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 326) | std::string save_edge(const edge_type& edge) const { type linear_model_saver_V (line 331) | struct linear_model_saver_V { method save_vertex (line 337) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 347) | std::string save_edge(const edge_type& edge) const { function main (line 354) | int main(int argc, char** argv) { FILE: toolkits/collaborative_filtering/warp_nmf.cpp function isuser (line 49) | bool isuser(uint node){ type vertex_data (line 65) | struct vertex_data { method vertex_data (line 80) | vertex_data() { if (debug) pvec = vec_type::Ones(NLATENT); else random... method randomize (line 82) | void randomize() { pvec.resize(NLATENT); pvec.setRandom(); } method save (line 84) | void save(graphlab::oarchive& arc) const { method load (line 88) | void load(graphlab::iarchive& arc) { function hash_value (line 93) | std::size_t hash_value(vertex_data const& b) { type edge_data (line 103) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 112) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 121) | edge_data(float obs = 0, data_role_type role = PREDICT) : function hash_value (line 126) | std::size_t hash_value(edge_data const& b) { function isuser_node (line 143) | bool isuser_node(const graph_type::vertex_type& vertex){ function graph_loader (line 152) | inline bool graph_loader(graph_type& graph, function vertex_delta (line 179) | void vertex_delta(graph_type::vertex_type& vtx, const vec_type& delta) { function nmf_function (line 187) | void nmf_function(engine_type::context_type& context, function vec_type (line 198) | vec_type count_edges(const graph_type::edge_type& edge) { function verify_rows (line 211) | void verify_rows( function vec_type (line 217) | vec_type pre_iter( const graph_type::vertex_type & vertex){ function sync_function (line 222) | void sync_function(engine_type::context_type& context, function extract_l2_error (line 230) | double extract_l2_error(const graph_type::edge_type & edge) { function main (line 243) | int main(int argc, char** argv) { FILE: toolkits/computer_vision/eigen_serialization.hpp function BEGIN_OUT_OF_PLACE_SAVE (line 31) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_LOAD (line 40) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_SAVE (line 50) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::MatrixXd, mat) { function BEGIN_OUT_OF_PLACE_LOAD (line 60) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::MatrixXd, mat) { FILE: toolkits/computer_vision/gcgraph.hpp class GCGraph (line 45) | class GCGraph class Vtx (line 58) | class Vtx class Edge (line 69) | class Edge function TWeight (line 153) | TWeight GCGraph::maxFlow() FILE: toolkits/computer_vision/grabcut.cpp function help (line 29) | void help() function getBinMask (line 59) | void getBinMask( const Mat& comMask, Mat& binMask ) class GCApplication (line 68) | class GCApplication method getIterCount (line 80) | int getIterCount() const { return iterCount; } function on_mouse (line 291) | void on_mouse( int event, int x, int y, int flags, void* param ) function main (line 296) | int main( int argc, char** argv ) FILE: toolkits/computer_vision/opencv_serialization.hpp function BEGIN_OUT_OF_PLACE_SAVE (line 32) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::Size, img_size) function BEGIN_OUT_OF_PLACE_LOAD (line 38) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::Size, img_size) function BEGIN_OUT_OF_PLACE_SAVE (line 46) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::Point2f, pt) function BEGIN_OUT_OF_PLACE_LOAD (line 52) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::Point2f, pt) function BEGIN_OUT_OF_PLACE_SAVE (line 60) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::KeyPoint, keypoint) function BEGIN_OUT_OF_PLACE_LOAD (line 68) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::KeyPoint, keypoint) function BEGIN_OUT_OF_PLACE_SAVE (line 78) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::Mat, mat) function BEGIN_OUT_OF_PLACE_LOAD (line 91) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::Mat, mat) function BEGIN_OUT_OF_PLACE_SAVE (line 107) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::detail::ImageFeatures, features) function BEGIN_OUT_OF_PLACE_LOAD (line 115) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::detail::ImageFeatures, features) function BEGIN_OUT_OF_PLACE_SAVE (line 125) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::DMatch, match) function BEGIN_OUT_OF_PLACE_LOAD (line 132) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::DMatch, match) function BEGIN_OUT_OF_PLACE_SAVE (line 141) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::detail::MatchesInfo, matchesinfo) function BEGIN_OUT_OF_PLACE_LOAD (line 151) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::detail::MatchesInfo, matchesinfo) function BEGIN_OUT_OF_PLACE_SAVE (line 163) | BEGIN_OUT_OF_PLACE_SAVE(arc, cv::detail::CameraParams, camera) function BEGIN_OUT_OF_PLACE_LOAD (line 171) | BEGIN_OUT_OF_PLACE_LOAD(arc, cv::detail::CameraParams, camera) FILE: toolkits/computer_vision/seam_finders_gr.hpp type cv (line 49) | namespace cv { type detail (line 50) | namespace detail { class GraphCutSeamFinder::Impl (line 159) | class GraphCutSeamFinder::Impl : public PairwiseSeamFinder method Impl (line 162) | Impl(int cost_type, float terminal_cost, float bad_region_penalty) FILE: toolkits/computer_vision/stitch_full_main.cpp function main (line 38) | int main(int argc, char** argv) FILE: toolkits/computer_vision/stitch_grlab.hpp type vertex_data (line 81) | struct vertex_data method vertex_data (line 106) | vertex_data() : empty(true) method save (line 109) | void save(graphlab::oarchive& arc) const method load (line 117) | void load(graphlab::iarchive& arc) method vertex_data (line 126) | vertex_data operator+ (vertex_data& othervertex) method vertex_data (line 144) | vertex_data& operator+= (const vertex_data& othervertex) type edge_data (line 161) | struct edge_data method edge_data (line 168) | edge_data() : empty(true) method save (line 171) | void save(graphlab::oarchive& arc) const method load (line 175) | void load(graphlab::iarchive& arc) method edge_data (line 180) | edge_data operator+ (edge_data& otheredge) method edge_data (line 198) | edge_data& operator+= (const edge_data& otheredge) class stitch_vertex_program (line 244) | class stitch_vertex_program : method stitch_vertex_program (line 253) | stitch_vertex_program() { } method edge_dir_type (line 255) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 262) | gather_type gather(icontext_type& context, const vertex_type& target_v... method apply (line 268) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 278) | edge_dir_type scatter_edges(icontext_type& context, FILE: toolkits/computer_vision/stitch_main.cpp function main (line 35) | int main(int argc, char** argv) FILE: toolkits/computer_vision/stitch_main.hpp function graph_loader (line 43) | bool graph_loader(graphlab::distributed_control& dc, graph_type& graph, ... function graph_loader (line 116) | bool graph_loader(graph_type& graph, string img_dir, vector compile_vertices(engine_type::icontext_type& context, function compile_edges (line 887) | vector compile_edges(engine_type::icontext_type& context, FILE: toolkits/computer_vision/stitch_opts.hpp type Options (line 52) | struct Options method Options (line 112) | Options(): FILE: toolkits/computer_vision/stitching.cpp function main (line 37) | int main(int argc, char* argv[]) function printUsage (line 57) | void printUsage() function parseCmdArgs (line 71) | int parseCmdArgs(int argc, char** argv) FILE: toolkits/computer_vision/stitching_detailed.cpp function printUsage (line 41) | void printUsage() function parseCmdArgs (line 122) | int parseCmdArgs(int argc, char** argv) function main (line 302) | int main(int argc, char* argv[]) FILE: toolkits/computer_vision/utils.hpp function T (line 43) | inline T operator*(const std::vector& a, const std::vector& b) function WriteToFile (line 172) | void WriteToFile(std::string fname, std::vector vecx) FILE: toolkits/extensions/MurmurHash3.cpp function rotl32 (line 34) | inline uint32_t rotl32 ( uint32_t x, int8_t r ) function rotl64 (line 39) | inline uint64_t rotl64 ( uint64_t x, int8_t r ) function FORCE_INLINE (line 55) | FORCE_INLINE uint32_t getblock ( const uint32_t * p, int i ) function FORCE_INLINE (line 60) | FORCE_INLINE uint64_t getblock ( const uint64_t * p, int i ) function FORCE_INLINE (line 68) | FORCE_INLINE uint32_t fmix ( uint32_t h ) function FORCE_INLINE (line 81) | FORCE_INLINE uint64_t fmix ( uint64_t k ) function MurmurHash3_x86_32 (line 94) | void MurmurHash3_x86_32 ( const void * key, int len, function MurmurHash3_x86_128 (line 150) | void MurmurHash3_x86_128 ( const void * key, const int len, function MurmurHash3_x64_128 (line 255) | void MurmurHash3_x64_128 ( const void * key, const int len, FILE: toolkits/extensions/extension.cpp type graphlab (line 7) | namespace graphlab { type extension (line 8) | namespace extension { function var (line 10) | var& operator+=(var& value, const var& other) { FILE: toolkits/extensions/extension_data.hpp type graphlab (line 15) | namespace graphlab { type extension (line 16) | namespace extension { function T (line 32) | inline const T& get(const var& v) { function T (line 46) | inline T& get(var& v) { function key_id_type (line 106) | inline key_id_type get_id_from_name(const char* key) { function key_id_type (line 112) | inline key_id_type get_id_from_name(const std::string& key) { function key_id_type (line 118) | inline key_id_type get_id_from_name(key_id_type key) { type vars (line 129) | struct vars { method vars (line 133) | vars() { } method clear (line 137) | void clear() { method vars (line 146) | vars& operator=(const vars& v) { method save (line 154) | void save(oarchive& oarc) const { method load (line 163) | void load(iarchive& iarc) { method var (line 172) | var& operator()(const std::string& key) { method var (line 175) | const var& operator()(const std::string& key) const { method var (line 178) | var& operator()(const char* key) { method var (line 181) | const var& operator()(const char* key) const { method var (line 184) | var& operator()(key_id_type key) { method var (line 187) | const var& operator()(key_id_type key) const { method var (line 191) | var& field(const std::string& _key) { method var (line 196) | const var& field(const std::string& _key) const { method var (line 201) | var& field(const char* _key) { method var (line 205) | const var& field(const char* _key) const { method var (line 210) | var& field(key_id_type key) { method var (line 228) | const var& field(key_id_type key) const { type extension (line 90) | namespace extension { function T (line 32) | inline const T& get(const var& v) { function T (line 46) | inline T& get(var& v) { function key_id_type (line 106) | inline key_id_type get_id_from_name(const char* key) { function key_id_type (line 112) | inline key_id_type get_id_from_name(const std::string& key) { function key_id_type (line 118) | inline key_id_type get_id_from_name(key_id_type key) { type vars (line 129) | struct vars { method vars (line 133) | vars() { } method clear (line 137) | void clear() { method vars (line 146) | vars& operator=(const vars& v) { method save (line 154) | void save(oarchive& oarc) const { method load (line 163) | void load(iarchive& iarc) { method var (line 172) | var& operator()(const std::string& key) { method var (line 175) | const var& operator()(const std::string& key) const { method var (line 178) | var& operator()(const char* key) { method var (line 181) | const var& operator()(const char* key) const { method var (line 184) | var& operator()(key_id_type key) { method var (line 187) | const var& operator()(key_id_type key) const { method var (line 191) | var& field(const std::string& _key) { method var (line 196) | const var& field(const std::string& _key) const { method var (line 201) | var& field(const char* _key) { method var (line 205) | const var& field(const char* _key) const { method var (line 210) | var& field(key_id_type key) { method var (line 228) | const var& field(key_id_type key) const { function BEGIN_OUT_OF_PLACE_SAVE (line 64) | BEGIN_OUT_OF_PLACE_SAVE(oarc, graphlab::extension::var, value) { function BEGIN_OUT_OF_PLACE_LOAD (line 77) | BEGIN_OUT_OF_PLACE_LOAD(iarc, graphlab::extension::var, value) { type graphlab (line 90) | namespace graphlab { namespace extension { type extension (line 16) | namespace extension { function T (line 32) | inline const T& get(const var& v) { function T (line 46) | inline T& get(var& v) { function key_id_type (line 106) | inline key_id_type get_id_from_name(const char* key) { function key_id_type (line 112) | inline key_id_type get_id_from_name(const std::string& key) { function key_id_type (line 118) | inline key_id_type get_id_from_name(key_id_type key) { type vars (line 129) | struct vars { method vars (line 133) | vars() { } method clear (line 137) | void clear() { method vars (line 146) | vars& operator=(const vars& v) { method save (line 154) | void save(oarchive& oarc) const { method load (line 163) | void load(iarchive& iarc) { method var (line 172) | var& operator()(const std::string& key) { method var (line 175) | const var& operator()(const std::string& key) const { method var (line 178) | var& operator()(const char* key) { method var (line 181) | const var& operator()(const char* key) const { method var (line 184) | var& operator()(key_id_type key) { method var (line 187) | const var& operator()(key_id_type key) const { method var (line 191) | var& field(const std::string& _key) { method var (line 196) | const var& field(const std::string& _key) const { method var (line 201) | var& field(const char* _key) { method var (line 205) | const var& field(const char* _key) const { method var (line 210) | var& field(key_id_type key) { method var (line 228) | const var& field(key_id_type key) const { type extension (line 90) | namespace extension { function T (line 32) | inline const T& get(const var& v) { function T (line 46) | inline T& get(var& v) { function key_id_type (line 106) | inline key_id_type get_id_from_name(const char* key) { function key_id_type (line 112) | inline key_id_type get_id_from_name(const std::string& key) { function key_id_type (line 118) | inline key_id_type get_id_from_name(key_id_type key) { type vars (line 129) | struct vars { method vars (line 133) | vars() { } method clear (line 137) | void clear() { method vars (line 146) | vars& operator=(const vars& v) { method save (line 154) | void save(oarchive& oarc) const { method load (line 163) | void load(iarchive& iarc) { method var (line 172) | var& operator()(const std::string& key) { method var (line 175) | const var& operator()(const std::string& key) const { method var (line 178) | var& operator()(const char* key) { method var (line 181) | const var& operator()(const char* key) const { method var (line 184) | var& operator()(key_id_type key) { method var (line 187) | const var& operator()(key_id_type key) const { method var (line 191) | var& field(const std::string& _key) { method var (line 196) | const var& field(const std::string& _key) const { method var (line 201) | var& field(const char* _key) { method var (line 205) | const var& field(const char* _key) const { method var (line 210) | var& field(key_id_type key) { method var (line 228) | const var& field(key_id_type key) const { FILE: toolkits/extensions/extension_gas.hpp type graphlab (line 9) | namespace graphlab { type extension (line 10) | namespace extension{ type gas_op_descriptor (line 13) | struct gas_op_descriptor{ type gather_var (line 29) | struct gather_var { method gather_var (line 34) | gather_var():descriptor_id(-1), combiner_op(NULL) { } method var (line 35) | var& operator+=(const var& other) { method var (line 40) | var& operator+=(const gather_var& other) { method save (line 46) | inline void save(graphlab::oarchive& oarc) const { method load (line 50) | inline void load(graphlab::iarchive& iarc) { type message_type (line 61) | struct message_type: public graphlab::IS_POD_TYPE { method message_type (line 63) | message_type(): descriptor(-1){ } method message_type (line 64) | message_type(descriptor_id_type d): descriptor(d) { } method message_type (line 65) | message_type& operator+=(const message_type& other) { type extension_update_functor (line 70) | struct extension_update_functor: method extension_update_functor (line 79) | extension_update_functor():descriptor_id(-1) { method extension_update_functor (line 82) | extension_update_functor(size_t id):descriptor_id(id) { } method init (line 84) | inline void init(icontext_type& context, method edge_dir_type (line 91) | edge_dir_type gather_edges(icontext_type& context, method gather_var (line 103) | inline gather_var gather(icontext_type& context, method apply (line 122) | inline void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 131) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 143) | inline void scatter(icontext_type& context, const vertex_type& ver... method save (line 161) | inline void save(graphlab::oarchive& oarc) const { method load (line 165) | inline void load(graphlab::iarchive& iarc) { FILE: toolkits/extensions/extension_gas_base_types.hpp type graphlab (line 5) | namespace graphlab { type extension (line 6) | namespace extension { type edge_direction (line 8) | enum edge_direction { type combiner_functor (line 18) | struct combiner_functor { type gather_functor (line 24) | struct gather_functor { type gather_select_functor (line 32) | struct gather_select_functor { method edge_dir_type (line 33) | virtual edge_dir_type operator()(const vars& center) { type apply_functor (line 39) | struct apply_functor { type scatter_select_functor (line 46) | struct scatter_select_functor { method edge_dir_type (line 47) | virtual edge_dir_type operator()(const vars& center) { type scatter_functor (line 54) | struct scatter_functor { FILE: toolkits/extensions/extension_gas_lambda_wrapper.hpp type graphlab (line 13) | namespace graphlab { type extension (line 14) | namespace extension { type transform_field_wrapper (line 18) | struct transform_field_wrapper { method transform_field_wrapper (line 23) | transform_field_wrapper(Functor* f, FieldType field): type map_field_wrapper (line 34) | struct map_field_wrapper { method map_field_wrapper (line 39) | map_field_wrapper(Functor* f, FieldType field): method var (line 42) | var operator()(internal_graph_type::vertex_type& vtx) { type generic_combiner (line 51) | struct generic_combiner: public combiner_functor { type generic_gather_select (line 59) | struct generic_gather_select : public gather_select_functor { method edge_dir_type (line 61) | edge_dir_type operator()(const vars& center) { type generic_gather (line 68) | struct generic_gather : public gather_functor { method var (line 70) | var operator()(const vars& center, type generic_apply (line 79) | struct generic_apply : public apply_functor { type generic_scatter_select (line 88) | struct generic_scatter_select : public scatter_select_functor { method edge_dir_type (line 90) | edge_dir_type operator()(const vars& center) { type generic_scatter (line 97) | struct generic_scatter : public scatter_functor { FILE: toolkits/extensions/extension_graph.cpp type graphlab (line 4) | namespace graphlab { type extension (line 5) | namespace extension { FILE: toolkits/extensions/extension_graph.hpp type graphlab (line 8) | namespace graphlab { type dc_impl (line 9) | namespace dc_impl { type extension (line 12) | namespace extension { type extension_graph_writer (line 14) | struct extension_graph_writer{ method extension_graph_writer (line 16) | extension_graph_writer(std::string field):field(field) { } method save_vertex (line 17) | std::string save_vertex(internal_graph_type::vertex_type v) { method save_edge (line 23) | std::string save_edge(internal_graph_type::edge_type e) { class extension_graph (line 31) | class extension_graph { method extension_graph (line 38) | extension_graph() method extension_graph (line 43) | extension_graph(distributed_control& dc, method transform_field (line 48) | void transform_field(FieldType field, method load_structure (line 70) | void load_structure(std::string prefix, std::string format) { method save_vertices (line 76) | void save_vertices(std::string prefix, std::string field) { method internal_graph_type (line 83) | internal_graph_type& graph() { method finalize (line 87) | void finalize() { method GAS (line 106) | void GAS(GatherType gather, method GAS (line 146) | void GAS(GatherSelectType gatherselect, FILE: toolkits/extensions/extension_main.cpp function actual_main (line 8) | int actual_main(int argc, char** argv) { function main (line 26) | int main(int argc, char** argv) { function __wrap_main (line 30) | int __wrap_main(int argc, char** argv) { FILE: toolkits/extensions/extension_pagerank.cpp type graphlab (line 3) | namespace graphlab { type extension (line 4) | namespace extension { function pagerank (line 6) | void pagerank(extension_graph& graph, FILE: toolkits/extensions/extensions.hpp type graphlab (line 14) | namespace graphlab { type extension (line 15) | namespace extension { FILE: toolkits/extensions/pagerank_extension_driver.cpp function main (line 5) | int main(int argc, char** argv) { FILE: toolkits/graph_algorithms/betweeness.cpp class DjikstraNode (line 36) | class DjikstraNode { method DjikstraNode (line 43) | DjikstraNode(){ method save (line 50) | void save(graphlab::oarchive& oarc) const { method load (line 54) | void load(graphlab::iarchive& iarc) { class PrestigeAnalysisNode (line 66) | class PrestigeAnalysisNode { method PrestigeAnalysisNode (line 74) | PrestigeAnalysisNode(){ method save (line 81) | void save(graphlab::oarchive& oarc) const { method load (line 85) | void load(graphlab::iarchive& iarc) { class Gather (line 97) | class Gather { method Gather (line 103) | Gather(){ method Gather (line 109) | Gather& operator+=(const Gather& other){ method save (line 125) | void save(graphlab::oarchive& oarc) const { method load (line 129) | void load(graphlab::iarchive& iarc) { class GatherMultiTree (line 140) | class GatherMultiTree { method GatherMultiTree (line 145) | GatherMultiTree(){ method GatherMultiTree (line 149) | GatherMultiTree& operator+=(const GatherMultiTree& other){ method save (line 153) | void save(graphlab::oarchive& oarc) const { method load (line 157) | void load(graphlab::iarchive& iarc) { function line_parser (line 174) | bool line_parser(graph_type& graph, const std::string& filename, const s... class ClearBooleans (line 200) | class ClearBooleans : method edge_dir_type (line 204) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 208) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 213) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 223) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 227) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... class DjikstraAlgorithm (line 244) | class DjikstraAlgorithm : method edge_dir_type (line 250) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 254) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 274) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 303) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 321) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type betweeness_writer (line 341) | struct betweeness_writer { method save_vertex (line 342) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 354) | std::string save_edge (graph_type::edge_type e) { return ""; } function selectVertices (line 361) | bool selectVertices(const graph_type::vertex_type& vertex){ class BetweenessGather (line 376) | class BetweenessGather{ method save (line 381) | void save(graphlab::oarchive& oarc) const { method load (line 385) | void load(graphlab::iarchive& iarc) { method BetweenessGather (line 389) | BetweenessGather& operator+=(const BetweenessGather& gather){ class BetweenessAlgorithm (line 418) | class BetweenessAlgorithm : method edge_dir_type (line 424) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method BetweenessGather (line 428) | BetweenessGather gather(icontext_type& context, const vertex_type& ver... method apply (line 443) | void apply(icontext_type& context, vertex_type& vertex, const Betweene... method edge_dir_type (line 460) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 477) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... function main (line 489) | int main (int argc, char** argv){ FILE: toolkits/graph_algorithms/closeness.cpp class DjikstraNode (line 35) | class DjikstraNode { method DjikstraNode (line 42) | DjikstraNode(){ method save (line 49) | void save(graphlab::oarchive& oarc) const { method load (line 53) | void load(graphlab::iarchive& iarc) { class PrestigeAnalysisNode (line 66) | class PrestigeAnalysisNode { method PrestigeAnalysisNode (line 74) | PrestigeAnalysisNode(){ method save (line 81) | void save(graphlab::oarchive& oarc) const { method load (line 85) | void load(graphlab::iarchive& iarc) { class Gather (line 98) | class Gather { method Gather (line 104) | Gather(){ method Gather (line 110) | Gather& operator+=(const Gather& other){ method save (line 126) | void save(graphlab::oarchive& oarc) const { method load (line 130) | void load(graphlab::iarchive& iarc) { class GatherMultiTree (line 142) | class GatherMultiTree { method GatherMultiTree (line 147) | GatherMultiTree(){ method GatherMultiTree (line 151) | GatherMultiTree& operator+=(const GatherMultiTree& other){ method save (line 155) | void save(graphlab::oarchive& oarc) const { method load (line 159) | void load(graphlab::iarchive& iarc) { function line_parser (line 176) | bool line_parser(graph_type& graph, const std::string& filename, const s... class ClearBooleans (line 203) | class ClearBooleans : method edge_dir_type (line 207) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 211) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 216) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 226) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 230) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... class DjikstraAlgorithm (line 250) | class DjikstraAlgorithm : method edge_dir_type (line 256) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 260) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 280) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 309) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 327) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type closeness_writer (line 347) | struct closeness_writer { method save_vertex (line 348) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 360) | std::string save_edge (graph_type::edge_type e) { return ""; } function selectVertices (line 367) | bool selectVertices(const graph_type::vertex_type& vertex){ class ClosenessGather (line 384) | class ClosenessGather{ method save (line 389) | void save(graphlab::oarchive& oarc) const { method load (line 393) | void load(graphlab::iarchive& iarc) { method ClosenessGather (line 397) | ClosenessGather& operator+=(const ClosenessGather& gather){ class ClosenessAlgorithm (line 429) | class ClosenessAlgorithm : method edge_dir_type (line 435) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method ClosenessGather (line 439) | ClosenessGather gather(icontext_type& context, const vertex_type& vert... method apply (line 454) | void apply(icontext_type& context, vertex_type& vertex, const Closenes... method edge_dir_type (line 470) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 487) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... function main (line 499) | int main (int argc, char** argv){ FILE: toolkits/graph_algorithms/djikstra.cpp class DjikstraNode (line 35) | class DjikstraNode { method DjikstraNode (line 42) | DjikstraNode(){ method save (line 49) | void save(graphlab::oarchive& oarc) const { method load (line 53) | void load(graphlab::iarchive& iarc) { class PrestigeAnalysisNode (line 65) | class PrestigeAnalysisNode { method PrestigeAnalysisNode (line 73) | PrestigeAnalysisNode(){ method save (line 80) | void save(graphlab::oarchive& oarc) const { method load (line 84) | void load(graphlab::iarchive& iarc) { class Gather (line 96) | class Gather { method Gather (line 102) | Gather(){ method Gather (line 108) | Gather& operator+=(const Gather& other){ method save (line 124) | void save(graphlab::oarchive& oarc) const { method load (line 128) | void load(graphlab::iarchive& iarc) { class GatherMultiTree (line 139) | class GatherMultiTree { method GatherMultiTree (line 144) | GatherMultiTree(){ method GatherMultiTree (line 148) | GatherMultiTree& operator+=(const GatherMultiTree& other){ method save (line 152) | void save(graphlab::oarchive& oarc) const { method load (line 156) | void load(graphlab::iarchive& iarc) { function line_parser (line 173) | bool line_parser(graph_type& graph, const std::string& filename, const s... class ClearBooleans (line 199) | class ClearBooleans : method edge_dir_type (line 203) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 207) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 212) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 222) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 226) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... class DjikstraAlgorithm (line 243) | class DjikstraAlgorithm : method edge_dir_type (line 249) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 253) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 273) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 302) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 320) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type djikstra_writer (line 336) | struct djikstra_writer { method save_vertex (line 337) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 347) | std::string save_edge (graph_type::edge_type e) { return ""; } function selectVertices (line 358) | bool selectVertices(const graph_type::vertex_type& vertex){ function main (line 369) | int main(int argc, char** argv) { FILE: toolkits/graph_algorithms/prestige.cpp class DjikstraNode (line 36) | class DjikstraNode { method DjikstraNode (line 43) | DjikstraNode(){ method save (line 50) | void save(graphlab::oarchive& oarc) const { method load (line 54) | void load(graphlab::iarchive& iarc) { class PrestigeAnalysisNode (line 66) | class PrestigeAnalysisNode { method PrestigeAnalysisNode (line 74) | PrestigeAnalysisNode(){ method save (line 81) | void save(graphlab::oarchive& oarc) const { method load (line 85) | void load(graphlab::iarchive& iarc) { class Gather (line 97) | class Gather { method Gather (line 103) | Gather(){ method Gather (line 109) | Gather& operator+=(const Gather& other){ method save (line 125) | void save(graphlab::oarchive& oarc) const { method load (line 129) | void load(graphlab::iarchive& iarc) { class GatherMultiTree (line 140) | class GatherMultiTree { method GatherMultiTree (line 145) | GatherMultiTree(){ method GatherMultiTree (line 149) | GatherMultiTree& operator+=(const GatherMultiTree& other){ method save (line 153) | void save(graphlab::oarchive& oarc) const { method load (line 157) | void load(graphlab::iarchive& iarc) { function line_parser (line 173) | bool line_parser(graph_type& graph, const std::string& filename, const s... class ClearBooleans (line 199) | class ClearBooleans : method edge_dir_type (line 203) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 207) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 212) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 222) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 226) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... class DjikstraAlgorithm (line 244) | class DjikstraAlgorithm : method edge_dir_type (line 250) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method gather_type (line 254) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 274) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 303) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 321) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type djikstra_writer (line 341) | struct djikstra_writer { method save_vertex (line 342) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 354) | std::string save_edge (graph_type::edge_type e) { return ""; } function selectVertices (line 361) | bool selectVertices(const graph_type::vertex_type& vertex){ class PrestigeGather (line 378) | class PrestigeGather{ method save (line 383) | void save(graphlab::oarchive& oarc) const { method load (line 387) | void load(graphlab::iarchive& iarc) { method PrestigeGather (line 391) | PrestigeGather& operator+=(const PrestigeGather& gather){ class PrestigeAlgorithm (line 419) | class PrestigeAlgorithm : method edge_dir_type (line 425) | edge_dir_type gather_edges(icontext_type& context, const vertex_type& ... method PrestigeGather (line 429) | PrestigeGather gather(icontext_type& context, const vertex_type& verte... method apply (line 444) | void apply(icontext_type& context, vertex_type& vertex, const Prestige... method edge_dir_type (line 460) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 477) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... function main (line 489) | int main (int argc, char** argv){ FILE: toolkits/graph_analytics/TSC.cpp class node (line 51) | class node { method node (line 57) | node(): w(0.0),TSC(0.0),prev(0.0){} method load (line 58) | void load(graphlab::iarchive& infile) { method save (line 61) | void save(graphlab::oarchive& outfile) const { class edge (line 68) | class edge { method edge (line 71) | edge(): weight(1.0) {} method edge (line 72) | edge(double weight) : weight(weight) {} method save (line 75) | void save(graphlab::oarchive& outfile) const { method load (line 79) | void load(graphlab::iarchive& infile) { class max_finder (line 94) | class max_finder{ method max_finder (line 97) | max_finder& operator+=(const max_finder& other){ method max_finder (line 104) | max_finder(): data(std::numeric_limits::max()) {} method max_finder (line 105) | max_finder(double x): data(x) {} method load (line 106) | void load(graphlab::iarchive& infile) { method save (line 109) | void save(graphlab::oarchive& outfile) const { function arnoldi_map (line 121) | double arnoldi_map(graph_type::edge_type e, function arnoldi_combine (line 126) | void arnoldi_combine(double& v1, const double& v2) { function AVj_to_w (line 129) | void AVj_to_w(graph_type::vertex_type& v) { function w_to_v (line 138) | void w_to_v(graph_type::vertex_type& v){ function scale_w (line 143) | void scale_w(graph_type::vertex_type& v, double scale_factor){ function print_TSC (line 148) | void print_TSC(graph_type::vertex_type& v){ function print_w (line 153) | void print_w(graph_type::vertex_type& v){ function initialize_column (line 159) | void initialize_column(graph_type::vertex_type& v, int i,int m) { function initialize_TSC (line 169) | void initialize_TSC(graph_type::vertex_type& v, int m) { function sum_w (line 175) | double sum_w(const graph_type::vertex_type& v){ function w_dot_V (line 180) | double w_dot_V(const graph_type::vertex_type& v, int i){ function w_minus_hdot (line 185) | void w_minus_hdot(graph_type::vertex_type& v, int i, double hdot) { function accumulate_hleft (line 191) | void accumulate_hleft(graph_type::vertex_type&v){ function total_error (line 206) | double total_error(const graph_type::vertex_type& v){ function max_finder (line 211) | max_finder max_error(const graph_type::vertex_type& v){ method max_finder (line 97) | max_finder& operator+=(const max_finder& other){ method max_finder (line 104) | max_finder(): data(std::numeric_limits::max()) {} method max_finder (line 105) | max_finder(double x): data(x) {} method load (line 106) | void load(graphlab::iarchive& infile) { method save (line 109) | void save(graphlab::oarchive& outfile) const { function main (line 217) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/approximate_diameter.cpp function myrand (line 35) | float myrand() { function hash_value (line 40) | size_t hash_value() { type vdata (line 50) | struct vdata { method vdata (line 56) | vdata() : method create_bitmask (line 60) | void create_bitmask(size_t id) { method create_hashed_bitmask (line 69) | void create_hashed_bitmask(size_t id) { method save (line 81) | void save(graphlab::oarchive& oarc) const { method load (line 94) | void load(graphlab::iarchive& iarc) { function initialize_vertex (line 124) | void initialize_vertex(graph_type::vertex_type& v) { function initialize_vertex_with_hash (line 128) | void initialize_vertex_with_hash(graph_type::vertex_type& v) { function bitwise_or (line 133) | void bitwise_or(std::vector >& v1, type bitmask_gatherer (line 145) | struct bitmask_gatherer { method bitmask_gatherer (line 148) | bitmask_gatherer() : method bitmask_gatherer (line 151) | explicit bitmask_gatherer(const std::vector > & in_b) : method bitmask_gatherer (line 159) | bitmask_gatherer& operator+=(const bitmask_gatherer& other) { method save (line 164) | void save(graphlab::oarchive& oarc) const { method load (line 174) | void load(graphlab::iarchive& iarc) { class one_hop (line 194) | class one_hop: public graphlab::ivertex_program > bitmask) { function absolute_vertex_data_with_hash (line 268) | size_t absolute_vertex_data_with_hash( function main (line 274) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/connected_component.cpp type vdata (line 34) | struct vdata { method vdata (line 36) | vdata() : method save (line 40) | void save(graphlab::oarchive& oarc) const { method load (line 43) | void load(graphlab::iarchive& iarc) { function initialize_vertex (line 51) | void initialize_vertex(graph_type::vertex_type& v) { type min_message (line 56) | struct min_message { method min_message (line 58) | explicit min_message(uint64_t v) : method min_message (line 61) | min_message() : method min_message (line 64) | min_message& operator+=(const min_message& other) { method save (line 69) | void save(graphlab::oarchive& oarc) const { method load (line 72) | void load(graphlab::iarchive& iarc) { class label_propagation (line 77) | class label_propagation: public graphlab::ivertex_program& vec) { method save (line 184) | void save(graphlab::oarchive& oarc) const { method clear (line 191) | void clear() { method size (line 199) | size_t size() const { method load (line 203) | void load(graphlab::iarchive& iarc) { type counting_inserter (line 221) | struct counting_inserter { method counting_inserter (line 223) | counting_inserter(size_t* i):i(i) { } method counting_inserter (line 224) | counting_inserter& operator++() { type empty_val (line 232) | struct empty_val { method empty_val (line 233) | empty_val operator=(const T&) { return empty_val(); } method empty_val (line 236) | empty_val operator*() { method empty_val (line 233) | empty_val operator=(const T&) { return empty_val(); } function count_set_intersect (line 247) | static uint32_t count_set_intersect( type triangle_count (line 288) | struct triangle_count: public graphlab::IS_POD_TYPE { method triangle_count (line 289) | triangle_count(): out_triangles(0), in_triangles(0), method triangle_count (line 330) | triangle_count& operator+=(const triangle_count& other) { type vertex_data_type (line 343) | struct vertex_data_type { method vertex_data_type (line 344) | vertex_data_type(){ } method save (line 351) | void save(graphlab::oarchive &oarc) const { method load (line 354) | void load(graphlab::iarchive &iarc) { type edge_triangle_count (line 364) | struct edge_triangle_count: public graphlab::IS_POD_TYPE { method edge_triangle_count (line 365) | edge_triangle_count(): s_s(0), st_st(0), method edge_triangle_count (line 373) | edge_triangle_count & operator+=(const edge_triangle_count& other) { type set_union_gather (line 406) | struct set_union_gather { method set_union_gather (line 410) | set_union_gather():v(-1) { method size (line 413) | size_t size() const { method set_union_gather (line 421) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 448) | void save(graphlab::oarchive& oarc) const { method load (line 455) | void load(graphlab::iarchive& iarc) { type set_union_pair (line 466) | struct set_union_pair{ method set_union_pair (line 470) | set_union_pair& operator+=(const set_union_pair& other) { method save (line 476) | void save(graphlab::oarchive& oarc) const { method load (line 481) | void load(graphlab::iarchive& iarc) { class triangle_count_program (line 501) | class triangle_count_program : method edge_dir_type (line 510) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 519) | gather_type gather(icontext_type& context, method apply (line 541) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 576) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 588) | void scatter(icontext_type& context, class get_per_vertex_count (line 614) | class get_per_vertex_count : method edge_dir_type (line 620) | edge_dir_type gather_edges(icontext_type& context, method triangle_count (line 625) | triangle_count gather(icontext_type& context, method apply (line 644) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 652) | edge_dir_type scatter_edges(icontext_type& context, function triangle_count (line 666) | triangle_count get_vertex_counts(const graph_type::vertex_type& v) { method triangle_count (line 289) | triangle_count(): out_triangles(0), in_triangles(0), method triangle_count (line 330) | triangle_count& operator+=(const triangle_count& other) { type save_triangle_count (line 673) | struct save_triangle_count{ method save_vertex (line 674) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 687) | std::string save_edge(graph_type::edge_type e) { function main (line 693) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/eigen_vector_normalization.cpp function normalize_eivec (line 16) | void normalize_eivec(std::vector& vec) { type evec_vertex_data (line 27) | struct evec_vertex_data { method evec_vertex_data (line 29) | evec_vertex_data() : method save (line 32) | void save(graphlab::oarchive& oarc) const { method load (line 35) | void load(graphlab::iarchive& iarc) { type evec_edge_data (line 40) | struct evec_edge_data { method evec_edge_data (line 42) | evec_edge_data() : method evec_edge_data (line 45) | explicit evec_edge_data(float in_val) : method save (line 48) | void save(graphlab::oarchive& oarc) const { method load (line 51) | void load(graphlab::iarchive& iarc) { function evec_line_parser (line 59) | bool evec_line_parser(evec_graph_type& graph, const std::string& filename, type id_and_val (line 79) | struct id_and_val { method id_and_val (line 83) | id_and_val() : method id_and_val (line 86) | id_and_val(size_t id, float val) : method id_and_val (line 92) | id_and_val& operator+=(const id_and_val& other) { method save (line 100) | void save(graphlab::oarchive& oarc) const { method load (line 108) | void load(graphlab::iarchive& iarc) { class aggregate_values (line 127) | class aggregate_values: public graphlab::ivertex_program, pub... method add_rows (line 86) | add_rows() { method init (line 89) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 94) | edge_dir_type gather_edges(icontext_type& context, method gather (line 100) | float gather(icontext_type& context, const vertex_type& vertex, method apply (line 106) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 111) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 115) | void scatter(icontext_type& context, const vertex_type& vertex, function inverse_square_root (line 121) | void inverse_square_root(graph_type::vertex_type& v) { function multiply_D (line 126) | void multiply_D(graph_type::edge_type& e) { type max_degree (line 133) | struct max_degree{ method max_degree (line 135) | max_degree(): degree(0.0){} method max_degree (line 136) | explicit max_degree(float in_degree): degree(in_degree){} method max_degree (line 138) | max_degree& operator+=(const max_degree& other){ method save (line 142) | void save(graphlab::oarchive& oarc) const { method load (line 145) | void load(graphlab::iarchive& iarc) { function max_degree (line 149) | max_degree create_max_degree(const graph_type::vertex_type& vertex) { method max_degree (line 135) | max_degree(): degree(0.0){} method max_degree (line 136) | explicit max_degree(float in_degree): degree(in_degree){} method max_degree (line 138) | max_degree& operator+=(const max_degree& other){ method save (line 142) | void save(graphlab::oarchive& oarc) const { method load (line 145) | void load(graphlab::iarchive& iarc) { function normalize_weight (line 155) | void normalize_weight(graph_type::edge_type& e) { function normalize_degree (line 158) | void normalize_degree(graph_type::vertex_type& v) { type max_vid (line 162) | struct max_vid{ method max_vid (line 164) | max_vid(): vid(0){} method max_vid (line 165) | explicit max_vid(size_t in_vid): vid(in_vid){} method max_vid (line 167) | max_vid& operator+=(const max_vid& other){ method save (line 171) | void save(graphlab::oarchive& oarc) const { method load (line 174) | void load(graphlab::iarchive& iarc) { function max_vid (line 178) | max_vid absolute_vertex_data(const graph_type::vertex_type& vertex) { method max_vid (line 164) | max_vid(): vid(0){} method max_vid (line 165) | explicit max_vid(size_t in_vid): vid(in_vid){} method max_vid (line 167) | max_vid& operator+=(const max_vid& other){ method save (line 171) | void save(graphlab::oarchive& oarc) const { method load (line 174) | void load(graphlab::iarchive& iarc) { class graph_writer_normalized_cut (line 182) | class graph_writer_normalized_cut { method graph_writer_normalized_cut (line 184) | graph_writer_normalized_cut(){} method save_vertex (line 185) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 194) | std::string save_edge(graph_type::edge_type e) { class graph_writer_ratio_cut (line 205) | class graph_writer_ratio_cut { method graph_writer_ratio_cut (line 207) | graph_writer_ratio_cut(){} method save_vertex (line 208) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 217) | std::string save_edge(graph_type::edge_type e) { function main (line 229) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/http/twitter_triangles.js function update_domain (line 15) | function update_domain(form) { function refresh (line 21) | function refresh() { function get_top_users (line 33) | function get_top_users() { function get_user_profiles (line 45) | function get_user_profiles(data) { function process_ids (line 84) | function process_ids(data) { function render_page (line 93) | function render_page() { function reloadStylesheets (line 127) | function reloadStylesheets() { FILE: toolkits/graph_analytics/kcore.cpp class k_core (line 70) | class k_core : method k_core (line 85) | k_core():msg(0),just_deleted(false) { } method init (line 90) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 97) | edge_dir_type gather_edges(icontext_type& context, method apply (line 109) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 123) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 133) | void scatter(icontext_type& context, function initialize_vertex_values (line 153) | void initialize_vertex_values(graph_type::vertex_type& v) { function signal_vertices_at_k (line 162) | graphlab::empty signal_vertices_at_k(engine_type::icontext_type& ctx, function count_active_vertices (line 173) | size_t count_active_vertices(const graph_type::vertex_type& vertex) { function double_count_active_edges (line 181) | size_t double_count_active_edges(const graph_type::vertex_type& vertex) { type save_core_at_k (line 192) | struct save_core_at_k { method save_vertex (line 193) | std::string save_vertex(graph_type::vertex_type) { return ""; } method save_edge (line 194) | std::string save_edge(graph_type::edge_type e) { function main (line 203) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/pagerank.cpp function init_vertex (line 52) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } class pagerank (line 76) | class pagerank : method edge_dir_type (line 85) | edge_dir_type gather_edges(icontext_type& context, method gather (line 92) | double gather(icontext_type& context, const vertex_type& vertex, method apply (line 98) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 108) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 122) | void scatter(icontext_type& context, const vertex_type& vertex, method save (line 135) | void save(graphlab::oarchive& oarc) const { method load (line 142) | void load(graphlab::iarchive& iarc) { type pagerank_writer (line 153) | struct pagerank_writer { method save_vertex (line 154) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 159) | std::string save_edge(graph_type::edge_type e) { return ""; } function map_rank (line 163) | double map_rank(const graph_type::vertex_type& v) { return v.data(); } function pagerank_sum (line 166) | double pagerank_sum(graph_type::vertex_type v) { function main (line 170) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/partitioning.cpp function get_arg_str_without (line 35) | std::string get_arg_str_without(int argc, char** argv, function call_graph_laplacian (line 60) | bool call_graph_laplacian(const std::string& mpi_args, function make_initial_vector_file (line 82) | void make_initial_vector_file(const std::string& filename, const size_t ... function call_svd (line 90) | bool call_svd(const std::string& mpi_args, const std::string& filename, function call_eigen_vector_normalization (line 121) | bool call_eigen_vector_normalization(const std::string& mpi_args, function call_kmeans (line 143) | bool call_kmeans(const std::string& mpi_args, const std::string& filename, function get_lanczos_rank (line 166) | int get_lanczos_rank(const size_t num_clusters, const size_t num_data) { function main (line 186) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/saturation_ordered_coloring.cpp function save (line 46) | void save(graphlab::oarchive& oarc) const { function load (line 51) | void load(graphlab::iarchive& iarc) { type set_union_gather (line 85) | struct set_union_gather { method set_union_gather (line 92) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 100) | void save(graphlab::oarchive& oarc) const { method load (line 105) | void load(graphlab::iarchive& iarc) { class graph_coloring (line 119) | class graph_coloring: method edge_dir_type (line 126) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 135) | gather_type gather(icontext_type& context, method apply (line 150) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 163) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 175) | void scatter(icontext_type& context, function initialize_vertex_values (line 197) | void initialize_vertex_values(graph_type::vertex_type& v) { function calculate_saturation (line 202) | void calculate_saturation(graph_type::vertex_type& v) { type save_colors (line 219) | struct save_colors{ method save_vertex (line 220) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 224) | std::string save_edge(graph_type::edge_type e) { function signal_vertices_at_saturation (line 231) | graphlab::empty signal_vertices_at_saturation (engine_type::icontext_typ... function signal_uncolored (line 239) | graphlab::empty signal_uncolored (engine_type::icontext_type& ctx, type max_deg_vertex_reducer (line 247) | struct max_deg_vertex_reducer: public graphlab::IS_POD_TYPE { method max_deg_vertex_reducer (line 250) | max_deg_vertex_reducer& operator+=(const max_deg_vertex_reducer& other) { function max_deg_vertex_reducer (line 258) | max_deg_vertex_reducer find_max_deg_vertex(const graph_type::vertex_type... method max_deg_vertex_reducer (line 250) | max_deg_vertex_reducer& operator+=(const max_deg_vertex_reducer& other) { function validate_conflict (line 273) | size_t validate_conflict(graph_type::edge_type& edge) { function main (line 278) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/simple_coloring.cpp type set_union_gather (line 49) | struct set_union_gather { method set_union_gather (line 56) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 64) | void save(graphlab::oarchive& oarc) const { method load (line 69) | void load(graphlab::iarchive& iarc) { class graph_coloring (line 84) | class graph_coloring: method edge_dir_type (line 91) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 100) | gather_type gather(icontext_type& context, method apply (line 116) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 130) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 142) | void scatter(icontext_type& context, type save_colors (line 159) | struct save_colors{ method save_vertex (line 160) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 164) | std::string save_edge(graph_type::edge_type e) { function validate_conflict (line 175) | size_t validate_conflict(graph_type::edge_type& edge) { function main (line 180) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/simple_undirected_triangle_count.cpp type vertex_data_type (line 80) | struct vertex_data_type { method vertex_data_type (line 81) | vertex_data_type():num_triangles(0) { } method save (line 88) | void save(graphlab::oarchive &oarc) const { method load (line 91) | void load(graphlab::iarchive &iarc) { type set_union_gather (line 118) | struct set_union_gather { method set_union_gather (line 125) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 133) | void save(graphlab::oarchive& oarc) const { method load (line 138) | void load(graphlab::iarchive& iarc) { class triangle_count (line 156) | class triangle_count : method edge_dir_type (line 163) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 172) | gather_type gather(icontext_type& context, method apply (line 190) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 200) | edge_dir_type scatter_edges(icontext_type& context, method count_set_intersect (line 209) | static size_t count_set_intersect( method scatter (line 224) | void scatter(icontext_type& context, class get_per_vertex_count (line 246) | class get_per_vertex_count : method edge_dir_type (line 252) | edge_dir_type gather_edges(icontext_type& context, method gather (line 257) | size_t gather(icontext_type& context, method apply (line 267) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 273) | edge_dir_type scatter_edges(icontext_type& context, function get_edge_data (line 286) | size_t get_edge_data(const graph_type::edge_type& e) { type save_triangle_count (line 295) | struct save_triangle_count{ method save_vertex (line 296) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 300) | std::string save_edge(graph_type::edge_type e) { function main (line 306) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/sssp.cpp type vertex_data (line 39) | struct vertex_data : graphlab::IS_POD_TYPE { method vertex_data (line 41) | vertex_data(distance_type dist = std::numeric_limits::m... type edge_data (line 50) | struct edge_data : graphlab::IS_POD_TYPE { method edge_data (line 52) | edge_data(distance_type dist = 1) : dist(dist) { } function get_other_vertex (line 66) | inline graph_type::vertex_type type min_distance_type (line 82) | struct min_distance_type : graphlab::IS_POD_TYPE { method min_distance_type (line 84) | min_distance_type(distance_type dist = method min_distance_type (line 86) | min_distance_type& operator+=(const min_distance_type& other) { class sssp (line 96) | class sssp : method init (line 106) | void init(icontext_type& context, const vertex_type& vertex, method edge_dir_type (line 114) | edge_dir_type gather_edges(icontext_type& context, method apply (line 133) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 145) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 155) | void scatter(icontext_type& context, const vertex_type& vertex, type shortest_path_writer (line 174) | struct shortest_path_writer { method save_vertex (line 175) | std::string save_vertex(const graph_type::vertex_type& vtx) { method save_edge (line 180) | std::string save_edge(graph_type::edge_type e) { return ""; } type max_deg_vertex_reducer (line 185) | struct max_deg_vertex_reducer: public graphlab::IS_POD_TYPE { method max_deg_vertex_reducer (line 188) | max_deg_vertex_reducer& operator+=(const max_deg_vertex_reducer& other) { function max_deg_vertex_reducer (line 196) | max_deg_vertex_reducer find_max_deg_vertex(const graph_type::vertex_type... method max_deg_vertex_reducer (line 188) | max_deg_vertex_reducer& operator+=(const max_deg_vertex_reducer& other) { function main (line 203) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/undirected_triangle_count.cpp function radix_sort (line 102) | void radix_sort(graphlab::vertex_id_type *array, int offset, int end, in... type vid_vector (line 152) | struct vid_vector{ method vid_vector (line 155) | vid_vector(): cset(NULL) { } method vid_vector (line 156) | vid_vector(const vid_vector& v):cset(NULL) { method vid_vector (line 160) | vid_vector& operator=(const vid_vector& v) { method assign (line 195) | void assign(const std::vector& vec) { method save (line 218) | void save(graphlab::oarchive& oarc) const { method clear (line 225) | void clear() { method size (line 233) | size_t size() const { method load (line 237) | void load(graphlab::iarchive& iarc) { type counting_inserter (line 255) | struct counting_inserter { method counting_inserter (line 257) | counting_inserter(size_t* i):i(i) { } method counting_inserter (line 258) | counting_inserter& operator++() { type empty_val (line 266) | struct empty_val { method empty_val (line 267) | empty_val operator=(const T&) { return empty_val(); } method empty_val (line 270) | empty_val operator*() { method empty_val (line 267) | empty_val operator=(const T&) { return empty_val(); } function count_set_intersect (line 281) | static uint32_t count_set_intersect( type vertex_data_type (line 326) | struct vertex_data_type { method vertex_data_type (line 327) | vertex_data_type(): num_triangles(0){ } method save (line 333) | void save(graphlab::oarchive &oarc) const { method load (line 336) | void load(graphlab::iarchive &iarc) { type set_union_gather (line 359) | struct set_union_gather { method set_union_gather (line 363) | set_union_gather():v(-1) { method size (line 366) | size_t size() const { method set_union_gather (line 374) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 401) | void save(graphlab::oarchive& oarc) const { method load (line 408) | void load(graphlab::iarchive& iarc) { class triangle_count (line 432) | class triangle_count : method edge_dir_type (line 441) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 450) | gather_type gather(icontext_type& context, method apply (line 474) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 495) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 507) | void scatter(icontext_type& context, class get_per_vertex_count (line 529) | class get_per_vertex_count : method edge_dir_type (line 535) | edge_dir_type gather_edges(icontext_type& context, method gather (line 540) | size_t gather(icontext_type& context, method apply (line 550) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 557) | edge_dir_type scatter_edges(icontext_type& context, function get_edge_data (line 571) | size_t get_edge_data(const graph_type::edge_type& e) { type save_triangle_count (line 578) | struct save_triangle_count{ method save_vertex (line 579) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 589) | std::string save_edge(graph_type::edge_type e) { function main (line 595) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/warp_bond_percolation.cpp type vertex_data (line 46) | struct vertex_data : public graphlab::IS_POD_TYPE{ method vertex_data (line 48) | vertex_data(): comp_id(-1) {} function hash_value (line 51) | std::size_t hash_value(vertex_data const& b) { type edge_data (line 61) | struct edge_data : public graphlab::IS_POD_TYPE { method edge_data (line 64) | edge_data(unsigned int id) : id(id) { comp_id = id; } method edge_data (line 65) | edge_data(){ id = comp_id = -1; } function hash_value (line 69) | std::size_t hash_value(edge_data const& b) { function graph_loader (line 87) | inline bool graph_loader(graph_type& graph, function count_component (line 104) | size_t count_component(const graph_type::edge_type & edge) { function bond_percolation_map (line 112) | unsigned int bond_percolation_map(const graph_type::vertex_type& center, function bond_percolation_combine (line 125) | void bond_percolation_combine(unsigned int& v1, const unsigned int& v2) { function bond_percolation_function (line 133) | void bond_percolation_function(engine_type::context_type& context, FILE: toolkits/graph_analytics/warp_coloring.cpp type edge_data_type (line 40) | struct edge_data_type : public graphlab::IS_POD_TYPE { type set_union_gather (line 73) | struct set_union_gather { method set_union_gather (line 80) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 88) | void save(graphlab::oarchive& oarc) const { method load (line 93) | void load(graphlab::iarchive& iarc) { function set_union_gather (line 104) | set_union_gather unique_color_map(const graph_type::vertex_type& center, method set_union_gather (line 80) | set_union_gather& operator+=(const set_union_gather& other) { method save (line 88) | void save(graphlab::oarchive& oarc) const { method load (line 93) | void load(graphlab::iarchive& iarc) { function unique_color_combine (line 113) | void unique_color_combine(set_union_gather& v1, const set_union_gather& ... function schedule_neighbors_if_change (line 118) | void schedule_neighbors_if_change(const graph_type::vertex_type& center, function initialize_chandy_misra (line 131) | void initialize_chandy_misra(graph_type::edge_type& edge) { function lock_if_owned_map (line 141) | size_t lock_if_owned_map(const graph_type::vertex_type& center, function lock_if_owned_combine (line 158) | void lock_if_owned_combine(size_t& v1, const size_t& v2) { function stop_eating (line 164) | void stop_eating(const graph_type::vertex_type& center, function unlock_forks_maintain_request (line 181) | void unlock_forks_maintain_request(const graph_type::vertex_type& center, function update_function (line 202) | void update_function(engine_type::context_type& context, function validate_conflict (line 244) | size_t validate_conflict(graph_type::edge_type& edge) { function main (line 250) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/warp_pagerank.cpp function init_vertex (line 53) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } type pagerank_writer (line 61) | struct pagerank_writer { method save_vertex (line 62) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 67) | std::string save_edge(graph_type::edge_type e) { return ""; } function pagerank_map (line 71) | double pagerank_map(const graph_type::vertex_type& v) { function pagerank_combine (line 75) | void pagerank_combine(double& v1, const double& v2) { function update_function (line 79) | void update_function(engine_type::context_type& context, function pagerank_sum (line 92) | double pagerank_sum(graph_type::vertex_type v) { function main (line 97) | int main(int argc, char** argv) { FILE: toolkits/graph_analytics/warp_pagerank2.cpp function init_vertex (line 53) | void init_vertex(graph_type::vertex_type& vertex) { vertex.data() = 1; } type pagerank_writer (line 61) | struct pagerank_writer { method save_vertex (line 62) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 67) | std::string save_edge(graph_type::edge_type e) { return ""; } function pagerank_map (line 71) | float pagerank_map(const graph_type::vertex_type& v) { function pagerank_combine (line 75) | void pagerank_combine(float& v1, const float& v2) { function update_function (line 79) | void update_function(engine_type::context_type& context, function pagerank_sum (line 85) | float pagerank_sum(graph_type::vertex_type v) { function main (line 90) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/ad3_qp.hpp type ad3_vertex_program (line 59) | struct ad3_vertex_program:public admm_vertex_program { method Maximize (line 69) | void Maximize(vertex_type& vertex, vec additional_log_potentials, vec ... method DeleteConfiguration (line 98) | void DeleteConfiguration(Configuration *configuration) { method DeleteConfiguration (line 103) | void DeleteConfiguration(vector configuration) { method InvertAfterInsertion (line 113) | bool InvertAfterInsertion(vertex_type& vertex, vector & inver... method InvertAfterRemoval (line 175) | void InvertAfterRemoval(vector &inverse_A_,const vector *similarities, method SolveQP_dense (line 353) | void SolveQP_dense(vertex_type& vertex,const gather_type& total, method InsertionSort (line 651) | void InsertionSort(pair arr[], int length) { method project_onto_budget_constraint_cached (line 667) | int project_onto_budget_constraint_cached(vec& x, method project_onto_budget_constraint (line 748) | int project_onto_budget_constraint(vec& x, int d, double budget) { method SolveQP_budget (line 814) | void SolveQP_budget(vertex_type& vertex,const gather_type& total, method SolveMAP_budget (line 844) | void SolveMAP_budget(vertex_type& vertex,const gather_type& total, method SolveMAP_dense (line 898) | void SolveMAP_dense(vertex_type& vertex,const gather_type& total, method project_onto_simplex_cached (line 918) | int project_onto_simplex_cached(vec& x, int d, double r, method SolveQP_xor (line 960) | void SolveQP_xor(vertex_type& vertex,const gather_type& total, method SolveMAP_xor (line 976) | void SolveMAP_xor(vertex_type& vertex,const gather_type& total, method compute_beliefs (line 993) | void compute_beliefs(vertex_type& vertex,const gather_type& total, method SolveMAP (line 1008) | void SolveMAP(vertex_type& vertex,const gather_type& total, type bethe_admm_vertex_program (line 1033) | struct bethe_admm_vertex_program:public admm_vertex_program { method compute_grad_phi (line 1037) | void compute_grad_phi(vertex_type& vertex,vec& unary_beliefs, method run_bp (line 1062) | void run_bp(vertex_type& vertex, vec& unary_pots, vec& factor_pots, method adjust_beliefs (line 1122) | void adjust_beliefs(vertex_type& vertex){ method exponentiate (line 1139) | void exponentiate(vec& potential_vector){ method softmax (line 1146) | void softmax(vertex_type& vertex, vec& unary_pots, vec& unary_margs){ method compute_beliefs (line 1149) | void compute_beliefs(vertex_type& vertex,const gather_type& total, method SolveMAP_dense (line 1178) | void SolveMAP_dense(vertex_type& vertex,const gather_type& total, method SolveMAP_xor (line 1194) | void SolveMAP_xor(vertex_type& vertex,const gather_type& total, method SolveMAP (line 1210) | void SolveMAP(vertex_type& vertex,const gather_type& total, FILE: toolkits/graphical_models/dd_grlab.hpp type dd_global_vars (line 63) | struct dd_global_vars { method dd_global_vars (line 73) | dd_global_vars(): old_dual(200), primal_best(-1e10), type vertex_data (line 93) | struct vertex_data method vertex_data (line 129) | vertex_data(): method load (line 140) | void load(graphlab::iarchive& arc) method save (line 154) | void save(graphlab::oarchive& arc) const type edge_data (line 175) | struct edge_data method load (line 182) | void load(graphlab::iarchive& arc) { method save (line 185) | void save(graphlab::oarchive& arc) const { type gather_type (line 197) | struct gather_type method gather_type (line 204) | gather_type():sq_norm_g(0){} method gather_type (line 207) | gather_type(factor_type f, vector nc = vector (), int sg = 0, method load (line 210) | void load(graphlab::iarchive& arc) { method save (line 215) | void save(graphlab::oarchive& arc) const { method gather_type (line 221) | gather_type& operator+=(const gather_type& other) type objective (line 239) | struct objective method objective (line 242) | objective(): primal(0), dual(0), primal_rel(0), sum_sq_norm_g(0), tota... method load (line 244) | void load(graphlab::iarchive& arc) { method save (line 249) | void save(graphlab::oarchive& arc) const { method objective (line 255) | objective& operator+=(const objective& other) type dd_vertex_program (line 276) | struct dd_vertex_program : method get_configuration_index (line 285) | int get_configuration_index(const graph_type::vertex_type& vertex, method get_configuration_states (line 301) | void get_configuration_states(const graph_type::vertex_type& vertex, method update_stepsize (line 323) | double update_stepsize(icontext_type& context, int type, double old_du... method vertex_type (line 344) | inline vertex_type get_other_vertex(edge_type& edge, type dd_vertex_program_symmetric (line 375) | struct dd_vertex_program_symmetric : public dd_vertex_program { method edge_dir_type (line 380) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 403) | gather_type gather(icontext_type& context, const vertex_type& vertex, ... method apply (line 488) | void apply(icontext_type& context, vertex_type& vertex, const gather_t... method edge_dir_type (line 562) | edge_dir_type scatter_edges(icontext_type& context, const vertex_type&... method scatter (line 573) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... type dd_vertex_program_projected (line 670) | struct dd_vertex_program_projected : public dd_vertex_program { method edge_dir_type (line 677) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 699) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 760) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 807) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 820) | void scatter(icontext_type& context, const vertex_type& vertex, type admm_vertex_program (line 885) | struct admm_vertex_program:public dd_vertex_program { method edge_dir_type (line 900) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 923) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 1012) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 1083) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 1097) | void scatter(icontext_type& context, const vertex_type& vertex, function objective (line 1176) | objective sum(dd_vertex_program::icontext_type& context, const dd_vertex... method objective (line 242) | objective(): primal(0), dual(0), primal_rel(0), sum_sq_norm_g(0), tota... method load (line 244) | void load(graphlab::iarchive& arc) { method save (line 249) | void save(graphlab::oarchive& arc) const { method objective (line 255) | objective& operator+=(const objective& other) function print_obj (line 1191) | void print_obj(dd_vertex_program::icontext_type& context, objective tota... FILE: toolkits/graphical_models/dd_main.cpp function main (line 39) | int main(int argc, char** argv) FILE: toolkits/graphical_models/dd_main.hpp function loadUAIfile (line 51) | void loadUAIfile(graphlab::distributed_control& dc, graph_type& graph, s... function line_parser (line 239) | bool line_parser(graph_type& graph, const std::string& filename, const s... function compute_degree (line 335) | void compute_degree(graph_type::vertex_type& vertex) function dist_unary_potentials (line 341) | void dist_unary_potentials(graph_type::edge_type& edge) type gather_potentials (line 346) | struct gather_potentials{ method load (line 350) | void load(graphlab::iarchive& arc) { method save (line 353) | void save(graphlab::oarchive& arc) const { method gather_potentials (line 357) | gather_potentials& operator+=(const gather_potentials& other) type compute_degree_budget (line 369) | struct compute_degree_budget : method edge_dir_type (line 374) | edge_dir_type gather_edges(icontext_type& context, method gather_potentials (line 379) | gather_potentials gather(icontext_type& context, const vertex_type& ve... method apply (line 419) | void apply(icontext_type& context, vertex_type& vertex, const gather_p... method edge_dir_type (line 428) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 433) | void scatter(icontext_type& context, const vertex_type& vertex, edge_t... class graph_writer (line 461) | class graph_writer { method save_vertex (line 463) | std::string save_vertex(graph_type::vertex_type v) { method save_edge (line 469) | std::string save_edge(graph_type::edge_type e) { return ""; } function run_dd_symmetric (line 477) | void run_dd_symmetric(graphlab::distributed_control& dc, graph_type& graph, function run_dd_projected (line 503) | void run_dd_projected(graphlab::distributed_control& dc, graph_type& graph, function run_ad3 (line 532) | void run_ad3(graphlab::distributed_control& dc, graph_type& graph, function run_bethe_admm (line 563) | void run_bethe_admm(graphlab::distributed_control& dc, graph_type& graph, FILE: toolkits/graphical_models/dd_opts.hpp type Options (line 41) | struct Options method Options (line 66) | Options(): FILE: toolkits/graphical_models/deprecated/factors/binary_factor.hpp class binary_factor (line 56) | class binary_factor { method binary_factor (line 60) | binary_factor(uint32_t var1 = 0, method binary_factor (line 67) | binary_factor(const binary_factor& other) : method binary_factor (line 72) | binary_factor& operator=(const binary_factor& other) { method resize (line 81) | void resize(uint16_t arity1, uint16_t arity2) { method normalize (line 143) | inline void normalize() { method set_as_agreement (line 171) | void set_as_agreement(double lambda) { method set_as_laplace (line 180) | void set_as_laplace(double lambda) { method mk_derivative (line 193) | double mk_derivative() const { method ihler_dynamic_range (line 213) | double ihler_dynamic_range() const { method printP (line 222) | void printP(std::ostream& out) const { method save (line 236) | void save(graphlab::oarchive &oarc) const { method load (line 243) | void load(graphlab::iarchive &iarc) { FILE: toolkits/graphical_models/deprecated/factors/factor_test.cxx class factor_tests (line 37) | class factor_tests : public CxxTest::TestSuite { method test_variables (line 40) | void test_variables() { method test_domain (line 58) | void test_domain() { method test_assignment (line 93) | void test_assignment() { method test_table_factor (line 154) | void test_table_factor() { method test_unary_binary_factors (line 265) | void test_unary_binary_factors() { method test_bench_marginalize (line 288) | void test_bench_marginalize() { method test_bench_condition (line 321) | void test_bench_condition() { FILE: toolkits/graphical_models/deprecated/factors/unary_factor.hpp class unary_factor (line 61) | class unary_factor { method unary_factor (line 67) | unary_factor(uint32_t var = 0, uint16_t arity = 0) : method resize (line 85) | inline void resize(uint16_t arity) { method arity (line 91) | uint16_t arity() const { return (uint16_t)_data.size(); } method size (line 92) | size_t size() const { return _data.size(); } method empty (line 93) | bool empty() const { return _data.empty(); } method uniform (line 109) | inline void uniform(double value = 0) { method normalize (line 115) | inline void normalize() { method unary_factor (line 136) | inline unary_factor& operator*=(const unary_factor& other) { method unary_factor (line 144) | inline unary_factor& operator+=(const unary_factor& other) { method unary_factor (line 153) | inline unary_factor& operator/=(const unary_factor& other) { method convolve (line 161) | inline void convolve(const binary_factor& bin_fact, method condition (line 178) | inline void condition(const binary_factor& bin_fact, method damp (line 188) | inline void damp(const unary_factor& other, double damping) { method residual (line 200) | inline double residual(const unary_factor& other) const { method max_asg (line 211) | inline size_t max_asg() const { method expectation (line 224) | inline double expectation() const { method sample (line 235) | inline size_t sample() const { method save (line 252) | void save(graphlab::oarchive &oarc) const { method load (line 255) | void load(graphlab::iarchive &iarc) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/chromatic_sampler.cpp function foreach (line 37) | foreach(const factor_id_t factor_id, vdata.factor_ids) { function run_chromatic_sampler (line 70) | void run_chromatic_sampler(graphlab::core&... FILE: toolkits/graphical_models/deprecated/gibbs_sampling/chromatic_sampler.hpp class gibbs_update (line 28) | class gibbs_update : function get_nsamples (line 35) | inline size_t get_nsamples(const mrf_vertex_data& vdata) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/factorized_model.cpp function factor_t (line 32) | factor_t& factorized_model::add_factor(const factor_t& factor) { function factor_t (line 46) | factor_t& factorized_model::add_factor(const domain_t& vars) { function foreach (line 233) | foreach(variable_t var, _variables) { function foreach (line 237) | foreach(const factor_t& factor, _factors) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/factorized_model.hpp class factorized_model (line 66) | class factorized_model { method getline (line 77) | inline bool getline(std::ifstream& fin, method trim (line 86) | inline std::string trim(const std::string& str) { method factor_map_t (line 107) | const factor_map_t& factors() const { return _factors; } FILE: toolkits/graphical_models/deprecated/gibbs_sampling/image.hpp class image (line 32) | class image { method image (line 38) | image() : _rows(0), _cols(0), data(0,0) { } method image (line 41) | image(size_t rows, size_t cols) : method rows (line 47) | size_t rows() const { return _rows; } method cols (line 50) | size_t cols() const { return _cols; } method pixels (line 53) | size_t pixels() const { return _rows * _cols; } method pixel (line 57) | double pixel(size_t i, size_t j) const { return data[vertid(i,j)]; } method pixel (line 61) | double pixel(size_t i) const { return data.at(i); } method vertid (line 66) | static size_t vertid(size_t rows, size_t cols, size_t i, size_t j) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/jt_splash_sampler.cpp function run_jtsplash_sampler (line 43) | void run_jtsplash_sampler(mrf_graph_type& mrf_graph, function foreach (line 173) | foreach(size_t factor_id, vdata.factor_ids) { function foreach (line 202) | foreach(edge_id_t in_eid, context.in_edge_ids()) { function foreach (line 227) | foreach(edge_id_t out_eid, context.out_edge_ids()) { function foreach (line 279) | foreach(edge_id_t out_eid, context.out_edge_ids()) { function foreach (line 358) | foreach(edge_id_t out_eid, context.out_edge_ids()) { function foreach (line 499) | foreach(edge_id_t in_eid, in_eids) { function foreach (line 525) | foreach(edge_id_t in_eid, scope.in_edge_ids()) { function foreach (line 597) | foreach(edge_id_t ineid, mrf.in_edge_ids(vid)) { function foreach (line 618) | foreach(size_t factor_id, vdata.factor_ids) { function foreach (line 682) | foreach(edge_id_t ineid, mrf.in_edge_ids(vid)) { function foreach (line 707) | foreach(size_t factor_id, vdata.factor_ids) { function foreach (line 776) | foreach(edge_id_t ineid, mrf.in_edge_ids(vid)) { function foreach (line 798) | foreach(size_t factor_id, vdata.factor_ids) { function foreach (line 925) | foreach(edge_id_t eid, mrf.out_edge_ids(next_vertex)) { function foreach (line 1009) | foreach(edge_id_t eid, mrf.out_edge_ids(next_vertex)) { function foreach (line 1167) | foreach(const jt_worker* worker, workers) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/jt_splash_sampler.hpp type splash_settings (line 56) | struct splash_settings { method splash_settings (line 66) | splash_settings() : class jtree_update (line 102) | class jtree_update : method jtree_update (line 106) | jtree_update(mrf_graph_type* mrf_ptr = NULL) : mrf_ptr(mrf_ptr) { } type termination_condition (line 114) | struct termination_condition { class jt_builder (line 134) | class jt_builder : type splash_state (line 139) | struct splash_state { class jt_splash_sampler (line 222) | class jt_splash_sampler { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/junction_tree.cpp function foreach (line 56) | foreach(const edge_id_type ineid, mrf.in_edge_ids(elim_vertex)) { function foreach (line 102) | foreach(vertex_id_t vid, tmp_verts) { function foreach (line 111) | foreach(vertex_id_t vid, tmp_verts) { function foreach (line 153) | foreach(vertex_id_t vid, tmp_verts) { function foreach (line 198) | foreach(const jtree_list::elim_clique& clique, cliques) { function rev_foreach (line 233) | rev_foreach(const jtree_list::elim_clique& clique, cliques) { type jtgraph_node (line 249) | struct jtgraph_node { function test_rip (line 273) | void test_rip(const jtgraph_type& graph) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/junction_tree.hpp type jtree_vertex_data (line 62) | struct jtree_vertex_data method jtree_vertex_data (line 77) | jtree_vertex_data() : parent(-1), calibrated(false), sampled(false) { } type jtree_edge_data (line 63) | struct jtree_edge_data method jtree_edge_data (line 86) | jtree_edge_data() : type jtree_vertex_data (line 68) | struct jtree_vertex_data { method jtree_vertex_data (line 77) | jtree_vertex_data() : parent(-1), calibrated(false), sampled(false) { } type jtree_edge_data (line 81) | struct jtree_edge_data { method jtree_edge_data (line 86) | jtree_edge_data() : type jtree_list (line 103) | struct jtree_list { type elim_clique (line 104) | struct elim_clique { method elim_clique (line 111) | elim_clique() : parent(-1) { } method contains (line 123) | inline bool contains(const mrf_graph_type::vertex_id_type vid) const { method elim_time_lookup (line 127) | inline mrf_graph_type::vertex_id_type method clear (line 135) | inline void clear() { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/make_denoise_alchemy.cpp function construct_denoise_graph (line 39) | void construct_denoise_graph(image& img, function main (line 51) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/matlab/gibbs_sampler_impl.cpp type options (line 66) | struct options { method options (line 82) | options(matwrap args = matwrap(NULL)) : method print (line 192) | void print() { function add_factor (line 229) | void add_factor(factorized_model& model, function build_factorized_model (line 289) | void build_factorized_model(factorized_model& model, matwrap factors) { type result_collector (line 306) | struct result_collector { method result_collector (line 313) | result_collector(matwrap samples = NULL, function collector_sync (line 323) | void collector_sync(mrf_gl::iscope& scope, function collector_apply (line 357) | void collector_apply(graphlab::any& current_data, function collector_merge (line 363) | void collector_merge(graphlab::any& merge_dest, function nsamples_terminator (line 370) | bool nsamples_terminator() { function run_chromatic_sampler (line 383) | void run_chromatic_sampler(mrf_gl::core& core, function run_jt_splash_sampler (line 401) | void run_jt_splash_sampler(mrf_gl::core& core, function mexFunction (line 449) | void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prh... FILE: toolkits/graphical_models/deprecated/gibbs_sampling/matlab/matwrap.hpp function safe_assert (line 35) | void safe_assert(const bool value, const char* msg) { function flush_screen (line 41) | void flush_screen() { type matwrap (line 49) | struct matwrap { method matwrap (line 53) | matwrap(mxArray* array = NULL) : array(array) { } method is_null (line 57) | bool is_null() const { return array == NULL; } method matwrap (line 59) | matwrap get_property(const char* property) const { method T (line 71) | T* get_data() { method set_cell_index2d (line 87) | void set_cell_index2d(const size_t i, const size_t j, method matwrap (line 93) | matwrap get_cell_index2d(const size_t i, const size_t j) { method matwrap (line 99) | matwrap get_field(const char* fieldname) const { method get_number_of_fields (line 105) | int get_number_of_fields() const { return mxGetNumberOfFields(array); } method matwrap (line 107) | matwrap get_field(const int field_id) const { method get_field_number (line 114) | int get_field_number(const char* field_name) const { method is_class (line 120) | bool is_class(const char* classname) const { method size (line 132) | size_t size() const { method matwrap (line 137) | matwrap get_cell(size_t index) const { method is_cell (line 144) | bool is_cell() const { method is_struct (line 149) | bool is_struct() const { method is_double (line 154) | bool is_double() const { method is_uint32 (line 160) | bool is_uint32() const { method is_string (line 165) | bool is_string() const { method as_string (line 171) | void as_string(char* str_buffer, size_t buffer_len) { method mwSize (line 177) | const mwSize* get_dimensions() const { method rows (line 182) | size_t rows() const { method cols (line 187) | size_t cols() const { method mwSize (line 193) | const mwSize get_num_dimensions() const { method matwrap (line 209) | static matwrap create_matrix(size_t m, size_t n) { method matwrap (line 213) | static matwrap create_cell(size_t m, size_t n) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/mrf.cpp function save_beliefs (line 37) | void save_beliefs(const mrf_graph_type& mrf, function save_asg (line 66) | void save_asg(const mrf_graph_type& mrf, function mrf_from_factorized_model (line 83) | void mrf_from_factorized_model(const factorized_model& model, function unnormalized_loglikelihood (line 161) | double unnormalized_loglikelihood(const mrf_graph_type& mrf) { function draw_mrf (line 196) | void draw_mrf(const size_t experiment_id, FILE: toolkits/graphical_models/deprecated/gibbs_sampling/mrf.hpp type mrf_vertex_data (line 50) | struct mrf_vertex_data { type tree_info_type (line 64) | struct tree_info_type { method tree_info_type (line 69) | tree_info_type () : method save (line 71) | void save(graphlab::oarchive& arc) const { method load (line 74) | void load(graphlab::iarchive& arc) { method mrf_vertex_data (line 80) | mrf_vertex_data() : asg(0), nsamples(0), nchanges(0) { } method mrf_vertex_data (line 81) | mrf_vertex_data(const variable_t& variable, method save (line 94) | void save(graphlab::oarchive& arc) const { method load (line 98) | void load(graphlab::iarchive& arc) { type mrf_edge_data (line 109) | struct mrf_edge_data { method save (line 111) | void save(graphlab::oarchive &arc) const { } method load (line 112) | void load(graphlab::iarchive &arc) { } FILE: toolkits/graphical_models/deprecated/gibbs_sampling/pgibbs_tls.cpp function pgibbs_tls (line 25) | pgibbs_tls* create_pgibbs_tls() { function pgibbs_tls (line 33) | pgibbs_tls& get_pgibbs_tls() { function destroy_pgibbs_tls (line 43) | void destroy_pgibbs_tls(void* ptr) { type pgibbs_tls_key_creater (line 51) | struct pgibbs_tls_key_creater { method pgibbs_tls_key_creater (line 52) | pgibbs_tls_key_creater( ) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/pgibbs_tls.hpp type pgibbs_tls (line 46) | struct pgibbs_tls { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/run_statistics.hpp type run_statistics (line 27) | struct run_statistics { method run_statistics (line 33) | run_statistics() : method run_statistics (line 36) | run_statistics(const mrf_graph_type& mrf) : method print (line 51) | void print() const { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/sampler.cpp function main (line 103) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/deprecated/gibbs_sampling/util.cpp function file_line_count (line 35) | size_t file_line_count(const std::string& experiment_file) { function make_filename (line 45) | std::string make_filename(const std::string& base, FILE: toolkits/graphical_models/deprecated/kernelbp/old/BallTreeDensity.cpp function mexFunction (line 32) | void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *prh... FILE: toolkits/graphical_models/deprecated/kernelbp/old/cpp/BallTree.h function class (line 65) | class BallTree { FILE: toolkits/graphical_models/deprecated/kernelbp/old/cpp/BallTreeClass.cc function mxArray (line 463) | mxArray* BallTree::createInMatlab(const mxArray* _pointsMatrix, const mx... function mxArray (line 474) | mxArray* BallTree::matlabMakeStruct(const mxArray* _pointsMatrix, const ... FILE: toolkits/graphical_models/deprecated/kernelbp/old/cpp/BallTreeDensity.h function class (line 42) | class BallTreeDensity : public BallTree { function bwUniform (line 73) | bool bwUniform(void) const { return multibandwidth==0; } function evaluate (line 85) | void evaluate(double* p, double maxErr) const { evaluate(*this,p,maxErr... function maxDistKer (line 126) | double maxDistKer(BallTree::index dRoot, const BallTree& atTree, BallTre... function minDistKer (line 135) | double minDistKer(BallTree::index dRoot, const BallTree& atTree, BallTre... FILE: toolkits/graphical_models/deprecated/kernelbp/old/cpp/BallTreeDensityClass.cc function pushDownLocal (line 52) | void pushDownLocal(const BallTree& atTree, const BallTree::index aRoot) function pushDownAll (line 63) | void pushDownAll(const BallTree& locations) function recurseMinMax (line 77) | void recurseMinMax(const BallTree& atTree, const BallTree::index aRoot) function mxArray (line 506) | mxArray* BallTreeDensity::createInMatlab(const mxArray* _pointsMatrix, c... function mxArray (line 517) | mxArray* BallTreeDensity::matlabMakeStruct(const mxArray* _pointsMatrix,... FILE: toolkits/graphical_models/deprecated/kernelbp/old/cpp/kernels.h function minDistGauss (line 31) | double BallTreeDensity::minDistGauss(BallTree::index dRoot, function maxDistGauss (line 51) | double BallTreeDensity::maxDistGauss(BallTree::index dRoot, function minDistLaplace (line 74) | double BallTreeDensity::minDistLaplace(BallTree::index dRoot, function maxDistLaplace (line 94) | double BallTreeDensity::maxDistLaplace(BallTree::index dRoot, function minDistEpanetch (line 120) | double BallTreeDensity::minDistEpanetch(BallTree::index dRoot, function maxDistEpanetch (line 141) | double BallTreeDensity::maxDistEpanetch(BallTree::index dRoot, function dKdX_p (line 171) | void BallTreeDensity::dKdX_p(BallTree::index dRoot,const BallTree& atTree, FILE: toolkits/graphical_models/deprecated/kernelbp/old/denoise.cpp type edge_data (line 56) | struct edge_data: public graphlab::unsupported_serialize { type vertex_data (line 62) | struct vertex_data: public graphlab::unsupported_serialize { method vertex_data (line 66) | vertex_data(){ rounds = 0;} function image_compare_mae (line 76) | double image_compare_mae(image &trueimg, image &infered) { function image_compare_rmse (line 122) | double image_compare_rmse(image &trueimg, image &infered) { function nbp_update (line 169) | void nbp_update(gl_types::iscope& scope, function construct_graph (line 265) | void construct_graph(image& img, function main (line 329) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/deprecated/kernelbp/old/image.hpp class image (line 40) | class image { method image (line 46) | image() : _rows(0), _cols(0), data(0,0) { } method image (line 49) | image(size_t rows, size_t cols) : method rows (line 55) | inline size_t rows() const { return _rows; } method cols (line 58) | inline size_t cols() const { return _cols; } method pixels (line 61) | inline size_t pixels() const { return _rows * _cols; } method pixel (line 65) | inline double pixel(size_t i, size_t j) const { return data[vertid(i,j... method pixel (line 69) | inline double pixel(size_t i) const { return data.at(i); } method vertid (line 73) | inline static size_t vertid(size_t rows, size_t cols, size_t i, size_t... method save_vec (line 87) | inline void save_vec(const char* filename) const { method min (line 104) | inline double min() { method max (line 108) | inline double max() { method save (line 112) | inline void save(graphlab::oarchive &oarc) const { method load (line 118) | inline void load(graphlab::iarchive &iarc) { FILE: toolkits/graphical_models/deprecated/kernelbp/old/kde.h type itpp (line 32) | typedef itpp::Mat uimat; function square (line 34) | inline double square(const double v) { function log_likelihood (line 41) | inline double log_likelihood(double u, double sigma, double x){ function class (line 48) | class kde{ function kde (line 96) | kde marginal(int dim){ function normalize_weights (line 109) | void normalize_weights(){ function likelihood (line 139) | double likelihood(const double &d) const{ function verify (line 152) | void verify() const{ function kde (line 185) | kde sample(itpp::imat & ind,itpp::vec & _weights){ function kde (line 206) | kde sample(){ function matlab_print (line 217) | static void matlab_print(const itpp::ivec & data){ function matlab_print (line 222) | static void matlab_print(const itpp::vec & data){ function matlab_print (line 227) | static void matlab_print(const itpp::mat & data){ function matlab_print (line 236) | static void matlab_print(const itpp::imat & data){ function matlab_print (line 248) | void matlab_print(){ function ROT (line 297) | void ROT(){ function test_marginal (line 313) | inline void test_marginal(){ function test_max (line 336) | inline void test_max(){ function test_sample (line 353) | inline void test_sample(){ function test_sample2 (line 368) | inline void test_sample2(){ function test_ROT (line 384) | inline void test_ROT(){ FILE: toolkits/graphical_models/deprecated/kernelbp/old/prob.hpp function randv (line 36) | void randv(int n, vec & ret){ function mat (line 42) | mat randn1(int Dx, int Dy){ FILE: toolkits/graphical_models/deprecated/kernelbp/old/prodSampleEpsilon.hpp class prodSampleEpsilon (line 40) | class prodSampleEpsilon{ method prodSampleEpsilon (line 68) | prodSampleEpsilon(){ method mexFunction (line 87) | void mexFunction(int nlhs, mxArray *plhs[], int nrhs, const mxArray *p... method kde (line 158) | kde prodSampleEpsilonRun(unsigned int _Ndens, //number of densities to... method normConstant (line 244) | double normConstant(void) { method minDistProd (line 273) | double minDistProd(const BallTreeDensity& bt1, BallTree::index i, method maxDistProd (line 292) | double maxDistProd(const BallTreeDensity& bt1, BallTree::index i, method computeSigVals (line 312) | void computeSigVals(void) { method multiEvalRecursive (line 338) | void multiEvalRecursive(void) { method multiEval (line 430) | void multiEval(void) { function test_product (line 456) | inline void test_product(){ FILE: toolkits/graphical_models/deprecated/loopybp_denoise.cpp type vertex_data (line 75) | struct vertex_data : graphlab::IS_POD_TYPE { method vertex_data (line 78) | vertex_data(float obs_color = 0, uint16_t true_color = 0) : class edge_data (line 87) | class edge_data { method message_idx (line 89) | size_t message_idx(size_t source_id, size_t target_id, bool is_new) { method edge_data (line 93) | edge_data() { } method edge_data (line 94) | edge_data(graphlab::vertex_id_type v1, method unary_factor (line 107) | unary_factor& message(size_t source_id, size_t target_id) { method unary_factor (line 110) | unary_factor& old_message(size_t source_id, size_t target_id) { method update_old (line 113) | void update_old(size_t source_id, size_t target_id) { method save (line 116) | void save(graphlab::oarchive& arc) const { method load (line 119) | void load(graphlab::iarchive& arc) { type factor_product (line 135) | struct factor_product { method factor_product (line 137) | factor_product(const unary_factor& factor = unary_factor()) : method factor_product (line 139) | factor_product& operator+=(const factor_product& other) { method save (line 144) | void save(graphlab::oarchive& arc) const { arc << factor; } method load (line 145) | void load(graphlab::iarchive& arc) { arc >> factor; } class bp_vertex_program (line 153) | class bp_vertex_program : method save (line 162) | void save(graphlab::oarchive& arc) const { arc << belief; } method load (line 163) | void load(graphlab::iarchive& arc) { arc >> belief; } method edge_dir_type (line 169) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 178) | gather_type gather(icontext_type& context, method apply (line 190) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 206) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 214) | void scatter(icontext_type& context, const vertex_type& vertex, method unary_factor (line 242) | unary_factor make_potential(const vertex_type& vertex) const { method vertex_type (line 257) | vertex_type get_other_vertex(edge_type& edge, type merge_reduce (line 280) | struct merge_reduce { method save (line 282) | void save(graphlab::oarchive& arc) const { arc << values; } method load (line 283) | void load(graphlab::iarchive& arc) { arc >> values; } method merge_reduce (line 284) | merge_reduce& operator+=(const merge_reduce& other) { function merge_reduce_type (line 294) | merge_reduce_type pred_map_function(graph_type::vertex_type vertex) { function merge_reduce_type (line 300) | merge_reduce_type obs_map_function(graph_type::vertex_type vertex) { function main (line 317) | int main(int argc, char** argv) { function sub2ind (line 481) | graphlab::vertex_id_type sub2ind(size_t rows, size_t cols, function ind2sub (line 486) | std::pair ind2sub(size_t rows, size_t cols, function create_synthetic_mrf (line 492) | void create_synthetic_mrf(graphlab::distributed_control& dc, function save_image (line 540) | void save_image(const size_t rows, const size_t cols, FILE: toolkits/graphical_models/eigen_serialization.hpp function BEGIN_OUT_OF_PLACE_SAVE (line 31) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_LOAD (line 40) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::VectorXd, vec) { function BEGIN_OUT_OF_PLACE_SAVE (line 50) | BEGIN_OUT_OF_PLACE_SAVE(arc, Eigen::MatrixXd, mat) { function BEGIN_OUT_OF_PLACE_LOAD (line 60) | BEGIN_OUT_OF_PLACE_LOAD(arc, Eigen::MatrixXd, mat) { FILE: toolkits/graphical_models/factors/bp_graph_data.h function namespace (line 38) | namespace belief_prop { type graphlab (line 124) | typedef graphlab::dense_table msg_type; function message_idx (line 128) | size_t message_idx(size_t source_id, size_t target_id, bool is_new) { function update_old (line 150) | void update_old(size_t source_id, size_t target_id) { function save (line 153) | void save(graphlab::oarchive& arc) const { function load (line 156) | void load(graphlab::iarchive& arc) { FILE: toolkits/graphical_models/factors/bp_vertex_program.hpp type belief_prop (line 45) | namespace belief_prop { class factor_product (line 53) | class factor_product { method factor_product (line 61) | factor_product(const factor_type& factor = factor_type()) : method factor_product (line 63) | factor_product& operator+=(const factor_product& other) { method save (line 68) | void save(graphlab::oarchive& arc) const { arc << factor; } method load (line 69) | void load(graphlab::iarchive& arc) { arc >> factor; } class bp_vertex_program (line 81) | class bp_vertex_program : method bp_vertex_program (line 116) | bp_vertex_program() { } method edge_dir_type (line 122) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 131) | gather_type gather(icontext_type& context, method apply (line 161) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 198) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 206) | void scatter(icontext_type& context, const vertex_type& vertex, method save (line 290) | void save(graphlab::oarchive& arc) const { arc << gather_type(); } method load (line 293) | void load(graphlab::iarchive& arc) { arc >> cache; } method gather_type (line 301) | gather_type& init_factor(const factor_type& other) const { method gather_type (line 316) | gather_type& repmat(const msg_type& msg, const vertex_data_t& vdata)... method vertex_type (line 329) | const vertex_type get_other_vertex(edge_type& edge, FILE: toolkits/graphical_models/factors/dense_table.hpp type graphlab (line 64) | namespace graphlab { class dense_table_impl (line 80) | class dense_table_impl : public table_base { method dense_table_impl (line 89) | dense_table_impl() { } method dense_table_impl (line 93) | dense_table_impl(const domain_type& dom) : method dense_table_impl (line 97) | dense_table_impl(const std::vector &args) { method dense_table_impl (line 107) | dense_table_impl(const domain_type& dom, const std::vector &... method dense_table_impl (line 123) | dense_table_impl(const std::vector& vars, method dense_table_impl (line 148) | dense_table_impl(const variable_type &var) { method dense_table_impl (line 154) | dense_table_impl(const variable_type& var, std::vector& logd) { method dense_table_impl (line 162) | dense_table_impl(const variable_type& var, double const* const begin, method dense_table_impl (line 173) | dense_table_impl(const dense_table_impl& other) : method dense_table_impl (line 180) | dense_table_impl& operator=(const dense_table_impl& other) { method set_data (line 190) | void set_data(const std::vector &data) { method set_data (line 200) | void set_data(const double data[], const size_t n) { type isless (line 211) | struct isless { method isless (line 213) | isless(const double& val) : _val(val) { } method dense_table_impl (line 224) | dense_table_impl& copy_onto(const dense_table_impl& other) { method set_args (line 234) | void set_args(const domain_type& args) { method set_domain (line 238) | void set_domain(const domain_type& args) { method domain_type (line 242) | inline const domain_type& args() const { method domain_type (line 245) | inline const domain_type& domain() const { method set_logP (line 272) | inline void set_logP(const size_t index, const double& val) { method set_logP (line 281) | void set_logP(const assignment_type& asg, const double& val) { method size (line 295) | size_t size() const { method numel (line 299) | virtual size_t numel() const { return size(); } method num_vars (line 301) | size_t num_vars() const { return _args.num_vars(); } method ndims (line 302) | virtual size_t ndims() const { return num_vars(); } method zero (line 304) | virtual void zero() { std::fill(_data.begin(), _data.end(), 0); } method uniform (line 306) | void uniform() { method uniform (line 310) | void uniform(double value) { method normalize (line 315) | void normalize() { method shift_normalize (line 344) | void shift_normalize() { method is_finite (line 358) | bool is_finite() const { method dense_table_impl (line 370) | dense_table_impl& operator*=(const dense_table_impl& other) { method dense_table_impl (line 382) | dense_table_impl& operator+=(const dense_table_impl& other) { method dense_table_impl (line 388) | dense_table_impl& operator/=(const dense_table_impl& other) { type divides (line 400) | struct divides { type multiplies (line 405) | struct multiplies { type plus (line 410) | struct plus { method dense_table_impl (line 420) | inline dense_table_impl& for_each_assignment(const dense_table_impl&... method convolve (line 449) | void convolve(const dense_table_impl& joint, method condition (line 477) | void condition(const dense_table_impl& other, method times_condition (line 500) | void times_condition(const dense_table_impl& other, method marginalize (line 528) | void marginalize(dense_table_impl& msg) const { method MAP (line 565) | void MAP(dense_table_impl& msg) const { method damp (line 596) | void damp(const dense_table_impl& other, const double& damping) { method linf_diff (line 616) | double linf_diff(const dense_table_impl& other) const { method l1_diff (line 632) | double l1_diff(const dense_table_impl& other) const { method l1_logdiff (line 645) | double l1_logdiff(const dense_table_impl& other) const { method assignment_type (line 655) | assignment_type max_asg() const { method max_index (line 671) | size_t max_index() const { method expectation (line 678) | inline void expectation(std::vector& values) const { method assignment_type (line 699) | inline assignment_type sample() const { method set_as_agreement (line 720) | void set_as_agreement(const double& lambda) { method set_as_laplace (line 733) | void set_as_laplace(const double& lambda) { method load (line 745) | void load(graphlab::iarchive& arc) { method save (line 750) | void save(graphlab::oarchive& arc) const { class dense_table (line 769) | class dense_table : public dense_table_impl { method dense_table (line 784) | dense_table() : dense_table_impl_t() { } method dense_table (line 787) | dense_table(const domain_type& dom) : method dense_table (line 791) | dense_table(const domain_type& dom, const std::vector &data) : method dense_table (line 795) | dense_table(const std::vector &args) : method dense_table (line 799) | dense_table(const std::vector &args, method dense_table (line 806) | dense_table(const variable_type &var) : dense_table_impl_t(var) { } method dense_table (line 809) | dense_table(const variable_type& var, std::vector& logd) : method dense_table (line 813) | dense_table(const variable_type& var, method dense_table (line 818) | dense_table(const dense_table& other) : method dense_table (line 825) | dense_table& operator=(const dense_table& other) { method dense_table (line 857) | virtual dense_table& deep_copy(const table_base_t& base) { method dense_table (line 874) | virtual dense_table& copy_onto(const table_base_t& base) { method variable_type (line 889) | virtual const variable_type& var(const size_t index) const { method dense_table (line 908) | virtual dense_table& times_equals(const table_base_t& base) { method dense_table (line 923) | virtual dense_table& divide_equals(const table_base_t& base) { method times (line 938) | virtual void times(const table_base_t& base, method divide (line 955) | virtual void divide(const table_base_t& base, method marginalize (line 973) | virtual void marginalize(table_base_t& base) const { method MAP (line 987) | virtual void MAP(table_base_t& base) const { method load (line 1000) | virtual void load(graphlab::iarchive& arc) { method save (line 1004) | virtual void save(graphlab::oarchive& arc) const { FILE: toolkits/graphical_models/factors/discrete_assignment.hpp type graphlab (line 33) | namespace graphlab { class discrete_assignment (line 44) | class discrete_assignment { method discrete_assignment (line 56) | discrete_assignment() : _index(0) { } method discrete_assignment (line 59) | explicit discrete_assignment(const domain_type& args) : method discrete_assignment (line 66) | discrete_assignment(const variable_type& v1, size_t asg1) : method discrete_assignment (line 73) | discrete_assignment(const variable_type& v1, size_t asg1, method discrete_assignment (line 83) | discrete_assignment(const std::vector& vars, method discrete_assignment (line 97) | discrete_assignment(const domain_type& args, size_t index) : method discrete_assignment (line 108) | discrete_assignment(const domain_type& args, method iterator (line 118) | iterator begin() { return &(_asgs[0]); } method iterator (line 119) | iterator end() { return &(_asgs[_args.num_vars()]); } method const_iterator (line 120) | const_iterator begin() const { return &(_asgs[0]); } method const_iterator (line 121) | const_iterator end() const { return &(_asgs[_args.num_vars()]); } method discrete_assignment (line 169) | inline discrete_assignment operator&(const discrete_assignment& othe... method discrete_assignment (line 199) | inline discrete_assignment& operator&=(const discrete_assignment& ot... method discrete_assignment (line 206) | discrete_assignment& operator++() { method discrete_assignment (line 221) | const discrete_assignment& make_end() { method uniform_sample (line 229) | void uniform_sample() { method domain_type (line 235) | inline const domain_type& args() const { return _args; } method num_vars (line 238) | inline size_t num_vars() const { return _args.num_vars(); } method size (line 241) | inline size_t size() const { return _args.size(); } method asg (line 244) | size_t asg(const variable_type& var) const { method set_asg (line 247) | void set_asg(const variable_type& var, size_t value) { method asg (line 252) | size_t asg(size_t var_id) const { method asg_at (line 258) | size_t asg_at(size_t index) const { method set_asg (line 263) | void set_asg(size_t var_id, size_t value, bool recompute=true) { method set_asg_at (line 271) | void set_asg_at(size_t index, size_t value, bool recompute=true) { method linear_index (line 281) | inline size_t linear_index() const { return _index; } method set_index (line 285) | void set_index(size_t index) { method discrete_assignment (line 318) | discrete_assignment restrict(const domain_type& sub_domain) const { method update (line 341) | void update(const discrete_assignment& other) { method load (line 358) | void load(graphlab::iarchive& arc) { method save (line 364) | void save(graphlab::oarchive& arc) const { method recompute_linear_index (line 384) | void recompute_linear_index() { method recompute_asgs (line 396) | void recompute_asgs() { FILE: toolkits/graphical_models/factors/discrete_bounds.hpp type graphlab (line 29) | namespace graphlab { class discrete_bounds (line 36) | class discrete_bounds { method discrete_bounds (line 39) | discrete_bounds() : _num_vars(0) { } method discrete_bounds (line 42) | discrete_bounds(const discrete_variable& v1) : method discrete_bounds (line 50) | discrete_bounds(const discrete_variable& v1, const discrete_variable... method discrete_bounds (line 65) | discrete_bounds(const discrete_variable& v1, method discrete_bounds (line 103) | explicit discrete_bounds(const std::vector& vars) : method discrete_bounds (line 114) | explicit discrete_bounds(const std::set& vars) : method discrete_bounds (line 122) | discrete_bounds(const discrete_bounds& other) : method discrete_bounds (line 130) | discrete_bounds& operator=(const discrete_bounds& other) { method discrete_bounds (line 157) | discrete_bounds& operator+=(const discrete_variable& var) { method discrete_bounds (line 167) | discrete_bounds& operator+=(const discrete_bounds& other) { method discrete_bounds (line 196) | discrete_bounds operator+(const discrete_variable& var) const { method discrete_bounds (line 202) | discrete_bounds operator+(const discrete_bounds& other) const { method discrete_bounds (line 209) | discrete_bounds& operator-=(const discrete_bounds& other) { method discrete_bounds (line 226) | discrete_bounds operator-(const discrete_bounds& other) const { method discrete_bounds (line 231) | discrete_bounds intersect(const discrete_bounds& other) const { method num_vars (line 250) | inline size_t num_vars() const { return _num_vars; } method discrete_variable (line 253) | inline const discrete_variable& var(size_t index) const { method var_location (line 260) | size_t var_location(discrete_variable var) const { method var_location (line 264) | size_t var_location(size_t var_id) const { method vars_location (line 274) | std::vector vars_location(const discrete_bounds& other) const { method vars_location (line 294) | std::vector vars_location(const std::vector { method discrete_domain (line 48) | discrete_domain() : method discrete_domain (line 52) | discrete_domain(const discrete_variable& v1) : method discrete_domain (line 56) | discrete_domain(const discrete_variable& v1, const discrete_variable... method discrete_domain (line 60) | discrete_domain(const discrete_variable& v1, method discrete_domain (line 66) | explicit discrete_domain(const std::vector& varia... method discrete_domain (line 70) | explicit discrete_domain(const std::set& variable... method discrete_domain (line 73) | discrete_domain(const discrete_domain& other) : method discrete_domain (line 76) | discrete_domain(const bounds_type& other) : method discrete_domain (line 82) | discrete_domain& operator=(const discrete_domain& other) { class ConstIterator (line 90) | class ConstIterator method ConstIterator (line 170) | explicit ConstIterator(const domain_type& dom) { method ConstIterator (line 174) | explicit ConstIterator(const assignment_type& asg) : _asg(asg) { } method ConstIterator (line 175) | ConstIterator(const Iterator& other) : _asg(other._asg) { } method ConstIterator (line 177) | ConstIterator& operator=(const ConstIterator& other) { method reference_custom (line 189) | reference_custom operator*() const { method pointer_custom (line 192) | pointer_custom operator->() const { method ConstIterator (line 195) | ConstIterator& operator++() { method ConstIterator (line 199) | ConstIterator operator++(int) { class Iterator (line 97) | class Iterator : method Iterator (line 117) | explicit Iterator(const domain_type& dom) { method Iterator (line 121) | explicit Iterator(const assignment_type& asg) : _asg(asg) { } method Iterator (line 122) | Iterator& operator=(const Iterator& other) { method reference_custom (line 135) | reference_custom operator*() { method pointer_custom (line 138) | pointer_custom operator->() { method Iterator (line 143) | Iterator& operator++() { method Iterator (line 147) | Iterator operator++(int) { class ConstIterator (line 154) | class ConstIterator : method ConstIterator (line 170) | explicit ConstIterator(const domain_type& dom) { method ConstIterator (line 174) | explicit ConstIterator(const assignment_type& asg) : _asg(asg) { } method ConstIterator (line 175) | ConstIterator(const Iterator& other) : _asg(other._asg) { } method ConstIterator (line 177) | ConstIterator& operator=(const ConstIterator& other) { method reference_custom (line 189) | reference_custom operator*() const { method pointer_custom (line 192) | pointer_custom operator->() const { method ConstIterator (line 195) | ConstIterator& operator++() { method ConstIterator (line 199) | ConstIterator operator++(int) { method Iterator (line 206) | Iterator begin() const { method Iterator (line 117) | explicit Iterator(const domain_type& dom) { method Iterator (line 121) | explicit Iterator(const assignment_type& asg) : _asg(asg) { } method Iterator (line 122) | Iterator& operator=(const Iterator& other) { method reference_custom (line 135) | reference_custom operator*() { method pointer_custom (line 138) | pointer_custom operator->() { method Iterator (line 143) | Iterator& operator++() { method Iterator (line 147) | Iterator operator++(int) { method Iterator (line 210) | Iterator end() const { method Iterator (line 117) | explicit Iterator(const domain_type& dom) { method Iterator (line 121) | explicit Iterator(const assignment_type& asg) : _asg(asg) { } method Iterator (line 122) | Iterator& operator=(const Iterator& other) { method reference_custom (line 135) | reference_custom operator*() { method pointer_custom (line 138) | pointer_custom operator->() { method Iterator (line 143) | Iterator& operator++() { method Iterator (line 147) | Iterator operator++(int) { FILE: toolkits/graphical_models/factors/discrete_variable.hpp type graphlab (line 38) | namespace graphlab { class discrete_variable (line 42) | class discrete_variable { method discrete_variable (line 49) | discrete_variable() : id_(0), nasgs_(0) { } method discrete_variable (line 53) | discrete_variable(id_type id, index_type nasgs) : method discrete_variable (line 56) | discrete_variable(const discrete_variable& other) : method discrete_variable (line 59) | discrete_variable& operator=(const discrete_variable& other) { method id_type (line 68) | inline id_type& id() { return id_; } method id_type (line 70) | inline const id_type& id() const { return id_; } method index_type (line 72) | inline index_type& size() { return nasgs_; } method index_type (line 74) | inline const index_type& size() const { return nasgs_; } method load (line 89) | void load(graphlab::iarchive& arc) { method save (line 93) | void save(graphlab::oarchive& arc) const { FILE: toolkits/graphical_models/factors/factor_graph.hpp type belief_prop (line 47) | namespace belief_prop { class factor_graph (line 85) | class factor_graph { method factor_graph (line 98) | factor_graph() : _unique_var_id(0) { } method variable_type (line 103) | variable_type add_variable(const size_t n_labels, method dense_table_t (line 138) | dense_table_t& belief_for_variable(const variable_type& var) { method dense_table_t (line 148) | dense_table_t& belief_for_var(const variable_type& var) { method dense_table_t (line 154) | const dense_table_t& belief_for_variable(const variable_type& var) c... method dense_table_t (line 165) | const dense_table_t& belief_for_var(const variable_type& var) const { method dense_table_t (line 173) | dense_table_t& prior_for_variable(const variable_type& var) { method dense_table_t (line 186) | const dense_table_t& prior_for_variable(const variable_type& var) co... method set_prior_for_variable (line 198) | void set_prior_for_variable(const variable_type& var, method set_belief_for_variable (line 210) | void set_belief_for_variable(const variable_type& var, method set_prior_for_variable (line 222) | void set_prior_for_variable(const variable_type& var, method set_belief_for_variable (line 230) | void set_belief_for_variable(const variable_type& var, method variable_type (line 238) | variable_type get_variable(const size_t id) { method vertex_data_t (line 246) | const vertex_data_t& add_vertex(const variable_type &variable, method factor_type (line 275) | factor_type uniform_factor_from_factor(const factor_type& factor) { method add_factor (line 287) | void add_factor(const table_base_t& factor, method num_factors (line 322) | size_t num_factors() const { method num_variables (line 327) | size_t num_variables() const { method save_graph_summary (line 347) | void save_graph_summary(const std::string& filename) { method make_bp_graph (line 394) | void make_bp_graph(graph_type_t& graph, method pull_beliefs_for_variables (line 467) | void pull_beliefs_for_variables(graph_type_t& graph) { type aggregate_vertex_data (line 503) | struct aggregate_vertex_data { method aggregate_vertex_data (line 506) | aggregate_vertex_data() { } method aggregate_vertex_data (line 508) | aggregate_vertex_data operator()(const typename graph_type_t::vert... method aggregate_vertex_data (line 520) | aggregate_vertex_data& operator+=(const aggregate_vertex_data& oth... method size (line 525) | unsigned size() { return agg.size(); } method save (line 527) | void save(graphlab::oarchive& arc) const { arc << agg; } method load (line 528) | void load(graphlab::iarchive& arc) { arc >> agg; } method print_variable (line 532) | void print_variable(const variable_type& var, const std::vector& args) : method fast_discrete_assignment (line 60) | fast_discrete_assignment(const discrete_assignment& asg) : method num_vars (line 77) | size_t num_vars() const { return _num_vars; } method discrete_variable (line 80) | discrete_variable var(size_t i) const { return _vars[i]; } method linear_index (line 83) | size_t linear_index() const { return _index; } method fast_discrete_assignment (line 86) | fast_discrete_assignment& operator++() { method set_index (line 104) | void set_index(size_t index) { method asg (line 109) | size_t asg(size_t var_id) const { method set_asg (line 115) | void set_asg(size_t var_id, size_t value) { method make_end (line 133) | void make_end() { method transpose_to_start (line 140) | void transpose_to_start(const discrete_domain& sub_domain) { method recompute_linear_index (line 181) | void recompute_linear_index() { method recompute_asgs (line 193) | void recompute_asgs() { method var_location (line 204) | size_t var_location(size_t var_id) const { FILE: toolkits/graphical_models/factors/sparse_index.hpp type graphlab (line 31) | namespace graphlab { class sparse_index (line 36) | class sparse_index { method sparse_index (line 42) | sparse_index() : _num_vars(0) { } method sparse_index (line 43) | explicit sparse_index(size_t num_vars) : method sparse_index (line 50) | sparse_index(size_t const* const begin, size_t const* const end) { method sparse_index (line 56) | explicit sparse_index(std::vector asg) : method iterator (line 101) | iterator begin() { return &_asg[0]; } method iterator (line 102) | iterator end() { return &_asg[_num_vars]; } method const_iterator (line 103) | const_iterator begin() const { return &_asg[0]; } method const_iterator (line 104) | const_iterator end() const { return &_asg[_num_vars]; } method asg_at (line 111) | inline size_t asg_at(const size_t index) const { method set_asg_at (line 119) | inline void set_asg_at(const size_t index, const size_t value) { method num_vars (line 124) | inline size_t num_vars() const { return _num_vars; } method load (line 126) | void load(graphlab::iarchive& arc) { method save (line 132) | void save(graphlab::oarchive& arc) const { FILE: toolkits/graphical_models/factors/sparse_table.hpp type graphlab (line 44) | namespace graphlab { class sparse_table (line 54) | class sparse_table : public table_base { method sparse_table (line 74) | sparse_table() { } method sparse_table (line 77) | sparse_table(const domain_t& dom) { method sparse_table (line 87) | sparse_table(const domain_t& dom, const sparse_data_t& data) { method sparse_table (line 100) | sparse_table(const std::vector& vars, method sparse_table (line 126) | sparse_table(const variable_t& args) { method sparse_table (line 132) | sparse_table(const std::vector& args) { method sparse_table (line 139) | sparse_table(const sparse_table& other) : method sparse_table (line 147) | sparse_table& operator=(const sparse_table& other) { method sparse_table (line 161) | sparse_table& copy_onto(const sparse_table& other) { method set_domain (line 188) | void set_domain(const domain_t& args) { method domain_t (line 192) | const domain_t& domain() const { method variable_t (line 222) | virtual const variable_t& var(const size_t index) const { method var_location (line 229) | size_t var_location(const variable_t& var) { method ndims (line 234) | virtual size_t ndims() const { return args().num_vars(); } method numel (line 236) | virtual size_t numel() const { return args().size(); } method nnz (line 238) | size_t nnz() const { return _dataAtAsg.size(); } method zero (line 241) | virtual void zero() { method remove_logP (line 251) | inline void remove_logP(const sparse_index_t& asg) { method __set_logP (line 263) | inline void __set_logP(double& tbl_ref, const double& val) { method set_logP (line 267) | inline void set_logP(const size_t linear_index, const double& val) { method set_logP (line 270) | inline void set_logP(const std::vector& asg, const double& v... method set_logP (line 273) | inline void set_logP(const sparse_index_t& asg, const double& val) { method logP (line 280) | inline double logP(const sparse_index_t& asg) const { method set_logP (line 296) | inline void set_logP(const assignment_t& asg, const double& val) { method remove_logP (line 301) | inline void remove_logP(const assignment_t& asg) { method logP (line 307) | inline double logP(const size_t linear_index) const { method logP (line 311) | inline double logP(const assignment_t& asg) const { method sparse_table (line 318) | sparse_table& operator/=(const dense_table_t& other) { method sparse_table (line 325) | sparse_table& operator*=(const dense_table_t& other) { method sparse_table (line 331) | sparse_table& operator/=(const sparse_table& other) { method sparse_table (line 336) | sparse_table& operator*=(const sparse_table& other) { type divides (line 341) | struct divides { type multiplies (line 346) | struct multiplies { method sparse_table (line 353) | inline sparse_table& for_each_assignment(const dense_table_t& other,... method sparse_table (line 373) | sparse_table& for_each_assignment(const sparse_table& other, const F... method marginalize (line 453) | void marginalize(dense_table_t& msg) const { method MAP (line 517) | void MAP(dense_table_t& msg) const { method intersect (line 561) | void intersect(const sparse_table& other) { method linear_index (line 568) | size_t linear_index(const sparse_index_t& asg) const { method validate_asg (line 581) | bool validate_asg(const sparse_index_t& asg) const { method sparse_index_t (line 591) | sparse_index_t compute_asg(const size_t index) const { method assignment_t (line 606) | assignment_t end_asg() { method as_dense_table (line 614) | void as_dense_table(dense_table_t& other) const { method compact_data_t (line 624) | compact_data_t as_vector() const { method keyset (line 636) | std::vector keyset() const { method sparse_table (line 649) | virtual sparse_table& deep_copy(const table_base_t& base) { method sparse_table (line 663) | virtual sparse_table& copy_onto(const table_base_t& base) { method sparse_table (line 696) | virtual sparse_table& times_equals(const table_base_t& base) { method sparse_table (line 719) | virtual sparse_table& divide_equals(const table_base_t& base) { method times (line 742) | virtual void times(const table_base_t& base, method divide (line 759) | virtual void divide(const table_base_t& base, method marginalize (line 775) | virtual void marginalize(table_base_t& base) const { method MAP (line 787) | virtual void MAP(table_base_t& base) const { method load (line 825) | virtual void load(graphlab::iarchive& arc) { method save (line 829) | virtual void save(graphlab::oarchive& arc) const { type less_than_by_index (line 836) | struct less_than_by_index { method less_than_by_index (line 837) | less_than_by_index(size_t ind) : _sorting_ind(ind) { } method less_than (line 858) | inline bool less_than(const sparse_index_t& a, method permute (line 866) | void permute(T& data) const { method permute (line 873) | void permute( const size_t sorting_ind, T& data ) const { method permute (line 880) | void permute( const std::vector& sorting_inds, T& data ) con... method domain_t (line 892) | domain_t& sub_domain) const method map_left_intersection (line 913) | void map_left_intersection( method compact_view_t (line 937) | compact_view_t as_vector_view() { method compact_const_view_t (line 948) | compact_const_view_t as_vector_view() const { method domain_t (line 961) | inline const domain_t& args() const { return _args; } method assignment_t (line 963) | inline assignment_t as_assignment(const sparse_index_t &asg) const { method sparse_index_t (line 968) | inline sparse_index_t as_sparse_index(const assignment_t &asg) const { FILE: toolkits/graphical_models/factors/table_base.hpp type graphlab (line 44) | namespace graphlab { class table_base (line 48) | class table_base { method APPROX_LOG_ZERO (line 54) | static inline double APPROX_LOG_ZERO() { FILE: toolkits/graphical_models/factors/table_factor.hpp type graphlab (line 51) | namespace graphlab { class table_factor (line 65) | class table_factor { type table_storage_t (line 75) | enum table_storage_t { nil, DENSE_TABLE, SPARSE_TABLE } method table_factor (line 77) | table_factor() : _table_storage(table_factor::nil), _table(NULL) { } method table_factor (line 79) | table_factor(table_storage_t storage) : method table_factor (line 85) | table_factor(const table_factor& other) : method table_factor (line 97) | table_factor(table_storage_t storage, typename table_base_t::const_p... method table_factor (line 107) | table_factor(table_storage_t storage, const table_base_t& base) : method table_factor (line 116) | table_factor(typename table_base_t::const_ptr base) : method table_factor (line 127) | table_factor(const table_base_t& base) : method table_factor (line 143) | table_factor& operator=(const table_factor& other) { method table_factor (line 173) | table_factor& operator*=(const table_factor& other) { method table_factor (line 181) | table_factor& operator/=(const table_factor& other) { method table_factor (line 189) | table_factor operator*(const table_factor& other) const { method table_factor (line 200) | table_factor operator/(const table_factor& other) const { method table_base_t (line 211) | table_base_t const * table() const { method table_base_t (line 217) | table_base_t* table() { method load (line 223) | void load(graphlab::iarchive& arc) { method save (line 229) | void save(graphlab::oarchive& arc) const { method table_factor (line 236) | table_factor(table_storage_t storage, table_base_t *const *const bas... method determine_storage_t (line 242) | void determine_storage_t(const table_base_t& base) { method alloc (line 255) | void alloc() { method alloc_table (line 260) | void alloc_table(table_storage_t storage, table_base_t** base) { method table_storage_t (line 280) | table_storage_t table_storage() const { return _table_storage; } FILE: toolkits/graphical_models/factors/tests/denoise/denoise.cpp type clopts_vals (line 72) | struct clopts_vals { method clopts_vals (line 73) | clopts_vals(double bound = 1E-4, double damping = 0.3, std::string exe... function main (line 92) | int main(int argc, char** argv) { function setup_cli (line 298) | int setup_cli(graphlab::command_line_options& clopts, clopts_vals& clvals, function run_engine (line 323) | void run_engine(graphlab::distributed_control& dc, FILE: toolkits/graphical_models/factors/tests/test_MAD_relation/test_MAD_relation.cpp type clopts_vals (line 64) | struct clopts_vals { method clopts_vals (line 65) | clopts_vals(double bound = 1E-4, double damping = 0.0, std::string exe... function main (line 87) | int main(int argc, char** argv) { function setup_cli (line 203) | int setup_cli(graphlab::command_line_options& clopts, clopts_vals& clvals, function run_engine (line 228) | void run_engine(graphlab::distributed_control& dc, function compute_labels (line 258) | std::vector compute_labels(size_t n_labels, function compute_normal_dist (line 270) | void compute_normal_dist(double mean, double std_dev, FILE: toolkits/graphical_models/factors/tests/test_bool_var/test_bool_var.cpp type clopts_vals (line 62) | struct clopts_vals { method clopts_vals (line 63) | clopts_vals(double bound = 1E-4, double damping = 0.0, std::string exe... function main (line 80) | int main(int argc, char** argv) { function setup_cli (line 141) | int setup_cli(graphlab::command_line_options& clopts, clopts_vals& clvals, function run_engine (line 165) | void run_engine(graphlab::distributed_control& dc, FILE: toolkits/graphical_models/factors/tests/test_bool_var/test_cat_bool_joint.cpp type clopts_vals (line 64) | struct clopts_vals { method clopts_vals (line 65) | clopts_vals(double bound = 1E-4, double damping = 0.0, function main (line 85) | int main(int argc, char** argv) { function setup_cli (line 179) | int setup_cli(graphlab::command_line_options& clopts, clopts_vals& opts, function run_engine (line 209) | void run_engine(graphlab::distributed_control& dc, FILE: toolkits/graphical_models/factors/tests/test_dense_table/test_dense_table.cpp function dense_table_t (line 50) | dense_table_t create_rand_dense_table(unsigned v0_id, unsigned v1_id, un... function create_rand_data_vector (line 82) | std::vector create_rand_data_vector(size_t d0, size_t d1, size_t... function create_data_vector (line 97) | void create_data_vector(std::vector &data) function testDataReorder (line 109) | void testDataReorder(unsigned v0_id, unsigned v1_id, unsigned v2_id) { function dense_table_t (line 148) | dense_table_t create_dense_table(unsigned v0_id, unsigned v1_id, unsigne... function multiplyTest (line 169) | void multiplyTest(unsigned v0_id, unsigned v1_id, unsigned v2_id) function main (line 205) | int main() { FILE: toolkits/graphical_models/factors/tests/test_sparse_table/test_neg_relation.cpp type clopts_vals (line 65) | struct clopts_vals { method clopts_vals (line 66) | clopts_vals(double bound = 1E-4, double damping = 0.0, std::string exe... function main (line 88) | int main(int argc, char** argv) { function setup_cli (line 187) | int setup_cli(graphlab::command_line_options& clopts, clopts_vals& clvals, function run_engine (line 212) | void run_engine(graphlab::distributed_control& dc, function compute_labels (line 242) | std::vector compute_labels(size_t n_labels, function compute_normal_dist (line 254) | void compute_normal_dist(double mean, double std_dev, FILE: toolkits/graphical_models/factors/tests/test_sparse_table/test_sparse_table.cpp function sparse_table_t (line 52) | sparse_table_t create_rand_sparse_table(unsigned v0_id, unsigned v1_id, ... function create_data_vector (line 84) | void create_data_vector(std::vector > &data, function testDataReorder (line 126) | void testDataReorder(unsigned v0_id, unsigned v1_id, unsigned v2_id) { function sparse_table_t (line 172) | sparse_table_t create_sparse_table(unsigned v0_id, unsigned v1_id, unsig... function multiplyTest (line 205) | void multiplyTest(unsigned v0_id, unsigned v1_id, unsigned v2_id, dense_... function main (line 251) | int main() { FILE: toolkits/graphical_models/lbp_structured_prediction.cpp type vertex_data (line 168) | struct vertex_data { method load (line 171) | void load(graphlab::iarchive& arc) { arc >> belief >> potential; } method save (line 172) | void save(graphlab::oarchive& arc) const { arc << belief << potential; } class edge_data (line 183) | class edge_data { method message_idx (line 199) | size_t message_idx(size_t source_id, size_t target_id, bool is_new) { method edge_data (line 205) | edge_data(const double w = 1) : weight_(w) { } method factor_type (line 211) | factor_type& message(size_t source_id, size_t target_id) { method factor_type (line 217) | factor_type& old_message(size_t source_id, size_t target_id) { method update_old (line 224) | void update_old(size_t source_id, size_t target_id) { method initialize (line 237) | void initialize(size_t source_id, size_t nsource, size_t target_id, si... method save (line 244) | void save(graphlab::oarchive& arc) const { method load (line 248) | void load(graphlab::iarchive& arc) { type bp_vertex_program (line 278) | struct bp_vertex_program : method edge_dir_type (line 287) | edge_dir_type gather_edges(icontext_type& context, method factor_type (line 296) | factor_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 315) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 337) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 345) | void scatter(icontext_type& context, const vertex_type& vertex, method convolve (line 386) | inline void convolve(const factor_type& cavity, const double& weight, method vertex_type (line 404) | inline vertex_type get_other_vertex(edge_type& edge, function vertex_loader (line 426) | bool vertex_loader(graph_type& graph, const std::string& fname, function edge_loader (line 492) | bool edge_loader(graph_type& graph, const std::string& fname, function edge_initializer (line 523) | void edge_initializer(graph_type::edge_type& edge) { type belief_prediction_saver (line 539) | struct belief_prediction_saver { method save_vertex (line 542) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 554) | std::string save_edge(const edge_type& edge) const { type map_prediction_saver (line 564) | struct map_prediction_saver { method save_vertex (line 567) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 574) | std::string save_edge(const edge_type& edge) const { function main (line 583) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/mplp_denoise.cpp type vertex_data (line 94) | struct vertex_data { method vertex_data (line 123) | vertex_data(): i(-1), j(-1), deg_i(0), deg_j(0), method save (line 132) | void save(graphlab::oarchive& arc) const method load (line 145) | void load(graphlab::iarchive& arc) type gather_type (line 205) | struct gather_type method gather_type (line 209) | gather_type& operator+=(const gather_type& other) method save (line 223) | void save(graphlab::oarchive& arc) const method load (line 227) | void load(graphlab::iarchive& arc) class mplp_vertex_program (line 239) | class mplp_vertex_program : method mplp_vertex_program (line 247) | mplp_vertex_program() : priority(0) { } method init_vertex_data (line 256) | static void init_vertex_data(icontext_type& context, vertex_type& vertex) method edge_dir_type (line 336) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 343) | gather_type gather(icontext_type& context, const vertex_type& target_v... method apply (line 366) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 551) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 560) | void scatter(icontext_type& context, const vertex_type& vertex, method vector (line 570) | static vector make_unary_potential(const vertex_type& vertex, method vertex_type (line 589) | vertex_type get_other_vertex(edge_type& edge, function get_energy_fun (line 611) | double get_energy_fun(mplp_vertex_program::icontext_type& context, const... function finalize_fun (line 626) | void finalize_fun(mplp_vertex_program::icontext_type& context, double to... function pixel_ind (line 635) | graphlab::vertex_id_type pixel_ind(size_t rows, size_t cols, function factor_ind (line 641) | graphlab::vertex_id_type factor_ind(size_t rows, size_t cols, function factor_ind2 (line 647) | graphlab::vertex_id_type factor_ind2(size_t rows, size_t cols, function create_synthetic_cluster_graph (line 662) | void create_synthetic_cluster_graph(graphlab::distributed_control& dc, function initialize_theta_ij (line 821) | void initialize_theta_ij(const std::string& smoothing, type merge_reduce (line 843) | struct merge_reduce { method save (line 845) | void save(graphlab::oarchive& arc) const { arc << values; } method load (line 846) | void load(graphlab::iarchive& arc) { arc >> values; } method merge_reduce (line 847) | merge_reduce& operator+=(const merge_reduce& other) { function merge_reduce_type (line 856) | merge_reduce_type pred_map_function(graph_type::vertex_type vertex) { function merge_reduce_type (line 863) | merge_reduce_type obs_map_function(graph_type::vertex_type vertex) { function ind2sub (line 873) | std::pair ind2sub(size_t rows, size_t cols, function save_image (line 897) | void save_image(const size_t rows, const size_t cols, function main (line 923) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/mplp_structured_prediction.cpp type vertex_data (line 152) | struct vertex_data { method load (line 155) | void load(graphlab::iarchive& arc) { arc >> belief >> potential; } method save (line 156) | void save(graphlab::oarchive& arc) const { arc << belief << potential; } class edge_data (line 167) | class edge_data { method message_idx (line 183) | size_t message_idx(size_t source_id, size_t target_id, bool is_new) { method edge_data (line 189) | edge_data(const double w = 1) : weight_(w) { } method factor_type (line 195) | factor_type& message(size_t source_id, size_t target_id) { method factor_type (line 201) | factor_type& old_message(size_t source_id, size_t target_id) { method update_old (line 208) | void update_old(size_t source_id, size_t target_id) { method initialize (line 221) | void initialize(size_t source_id, size_t nsource, size_t target_id, si... method save (line 228) | void save(graphlab::oarchive& arc) const { method load (line 232) | void load(graphlab::iarchive& arc) { type bp_vertex_program (line 262) | struct bp_vertex_program : method edge_dir_type (line 271) | edge_dir_type gather_edges(icontext_type& context, method factor_type (line 280) | factor_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 299) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 321) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 329) | void scatter(icontext_type& context, const vertex_type& vertex, method convolve (line 370) | inline void convolve(const factor_type& cavity, const double& weight, method vertex_type (line 388) | inline vertex_type get_other_vertex(edge_type& edge, function vertex_loader (line 410) | bool vertex_loader(graph_type& graph, const std::string& fname, function edge_loader (line 476) | bool edge_loader(graph_type& graph, const std::string& fname, function edge_initializer (line 507) | void edge_initializer(graph_type::edge_type& edge) { type belief_prediction_saver (line 523) | struct belief_prediction_saver { method save_vertex (line 526) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 538) | std::string save_edge(const edge_type& edge) const { type map_prediction_saver (line 548) | struct map_prediction_saver { method save_vertex (line 551) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 558) | std::string save_edge(const edge_type& edge) const { function main (line 567) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/profile_lbp_synthetic.cpp function factor_type (line 125) | factor_type make_node_potential(size_t vid) { type vertex_data (line 148) | struct vertex_data { method load (line 150) | void load(graphlab::iarchive& arc) { arc >> belief; } method save (line 151) | void save(graphlab::oarchive& arc) const { arc << belief; } class edge_data (line 162) | class edge_data { method message_idx (line 178) | size_t message_idx(size_t source_id, size_t target_id, bool is_new) { method edge_data (line 184) | edge_data(const double w = 1) : weight_(w) { } method factor_type (line 190) | factor_type& message(size_t source_id, size_t target_id) { method factor_type (line 196) | factor_type& old_message(size_t source_id, size_t target_id) { method update_old (line 203) | void update_old(size_t source_id, size_t target_id) { method initialize (line 216) | void initialize(size_t source_id, size_t nsource, size_t target_id, si... method save (line 223) | void save(graphlab::oarchive& arc) const { method load (line 227) | void load(graphlab::iarchive& arc) { type bp_vertex_program (line 260) | struct bp_vertex_program : method edge_dir_type (line 269) | edge_dir_type gather_edges(icontext_type& context, method factor_type (line 278) | factor_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 296) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 317) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 325) | void scatter(icontext_type& context, const vertex_type& vertex, method convolve (line 373) | inline void convolve(const factor_type& cavity, const double& weight, method vertex_type (line 391) | inline vertex_type get_other_vertex(edge_type& edge, function edge_loader (line 411) | bool edge_loader(graph_type& graph, const std::string& fname, function edge_initializer (line 445) | void edge_initializer(graph_type::edge_type& edge) { type belief_prediction_saver (line 461) | struct belief_prediction_saver { method save_vertex (line 464) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 476) | std::string save_edge(const edge_type& edge) const { type map_prediction_saver (line 486) | struct map_prediction_saver { method save_vertex (line 489) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 496) | std::string save_edge(const edge_type& edge) const { function main (line 505) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/profile_lbp_synthetic2.cpp function factor_type (line 125) | factor_type make_node_potential(size_t vid) { type vertex_data (line 148) | struct vertex_data { method load (line 150) | void load(graphlab::iarchive& arc) { arc >> belief; } method save (line 151) | void save(graphlab::oarchive& arc) const { arc << belief; } class edge_data (line 162) | class edge_data { method message_idx (line 178) | size_t message_idx(size_t source_id, size_t target_id) { method edge_data (line 184) | edge_data(const double w = 1) : weight_(w) { } method factor_type (line 190) | factor_type& message(size_t source_id, size_t target_id) { method initialize (line 203) | void initialize(size_t source_id, size_t nsource, size_t target_id, si... method save (line 208) | void save(graphlab::oarchive& arc) const { method load (line 212) | void load(graphlab::iarchive& arc) { type bp_vertex_program (line 245) | struct bp_vertex_program : method bp_vertex_program (line 250) | bp_vertex_program() : residual(0) { } method edge_dir_type (line 256) | edge_dir_type gather_edges(icontext_type& context, method factor_type (line 265) | factor_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 288) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 312) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 322) | void scatter(icontext_type& context, const vertex_type& vertex, method convolve (line 343) | inline void convolve(const factor_type& cavity, const double& weight, method vertex_type (line 361) | inline vertex_type get_other_vertex(edge_type& edge, function edge_loader (line 381) | bool edge_loader(graph_type& graph, const std::string& fname, function edge_initializer (line 415) | void edge_initializer(graph_type::edge_type& edge) { type belief_prediction_saver (line 431) | struct belief_prediction_saver { method save_vertex (line 434) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 446) | std::string save_edge(const edge_type& edge) const { type map_prediction_saver (line 456) | struct map_prediction_saver { method save_vertex (line 459) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 466) | std::string save_edge(const edge_type& edge) const { function main (line 475) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/synthetic_image_data.cpp type pixel (line 58) | struct pixel { method pixel (line 61) | pixel(uint32_t ind = 0, double value = 0) : function sub2ind (line 67) | graphlab::vertex_id_type sub2ind(uint16_t r, uint16_t c) { function make_data (line 76) | void make_data(const uint16_t rows, const uint16_t cols, function read_data (line 138) | void read_data(const std::string& pred_img_fn) { function main (line 193) | int main(int argc, char** argv) { FILE: toolkits/graphical_models/utils.hpp function T (line 43) | inline T operator*(const std::vector& a, const std::vector& b) function WriteToFile (line 172) | void WriteToFile(std::string fname, std::vector vecx) FILE: toolkits/linear_solvers/jacobi.cpp type jacobi_fields (line 36) | enum jacobi_fields{ type vertex_data (line 57) | struct vertex_data { method vertex_data (line 62) | vertex_data(): A_ii(1) { //: y(0), Aii(1), pvec[JACOBI_X](0), pvec[JAC... method save (line 67) | void save(graphlab::oarchive& arc) const { method load (line 71) | void load(graphlab::iarchive& arc) { class gather_type (line 76) | class gather_type { method gather_type (line 81) | gather_type() { training_rmse= validation_rmse = 0; } method save (line 82) | void save(graphlab::oarchive& arc) const { arc << pvec << training_rms... method load (line 83) | void load(graphlab::iarchive& arc) { arc >> pvec >> training_rmse >> v... method gather_type (line 84) | gather_type& operator+=(const gather_type& other) { type edge_data (line 97) | struct edge_data : public graphlab::IS_POD_TYPE { type data_role_type (line 100) | enum data_role_type { TRAIN, VALIDATE, PREDICT } method edge_data (line 102) | edge_data(double obs = 1, data_role_type role = TRAIN) : function get_other_vertex (line 119) | inline graph_type::vertex_type function verify_values (line 132) | void verify_values(int unittest, double residual){ function graph_loader (line 140) | inline bool graph_loader(graph_type& graph, type linear_model_saver (line 183) | struct linear_model_saver { method linear_model_saver (line 188) | linear_model_saver(int pos): pos(pos) {} method save_vertex (line 190) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 197) | std::string save_edge(const edge_type& edge) const { function start_engine (line 203) | void start_engine(){ function main (line 209) | int main(int argc, char** argv) { FILE: toolkits/topic_modeling/cgs_lda.cpp function factor_type (line 71) | inline factor_type& operator+=(factor_type& lvalue, type top_words_type (line 193) | struct top_words_type { method top_words_type (line 196) | top_words_type() : method json_header_string (line 198) | inline std::string json_header_string() const { function word_cloud_callback (line 215) | std::pair type vertex_data (line 241) | struct vertex_data { method vertex_data (line 248) | vertex_data() : nupdates(0), nchanges(0), factor(NTOPICS) { } method save (line 249) | void save(graphlab::oarchive& arc) const { method load (line 252) | void load(graphlab::iarchive& arc) { type edge_data (line 262) | struct edge_data { method edge_data (line 267) | edge_data(size_t ntokens = 0) : nchanges(0), assignment(ntokens, NULL_... method save (line 268) | void save(graphlab::oarchive& arc) const { arc << nchanges << assignme... method load (line 269) | void load(graphlab::iarchive& arc) { arc >> nchanges >> assignment; } function eparser (line 292) | bool eparser(edge_data& ed, const std::string& line){ function vparser (line 307) | bool vparser(vertex_data& vd, const std::string& line){ function graph_loader (line 322) | bool graph_loader(graph_type& graph, const std::string& fname, function is_word (line 369) | inline bool is_word(const graph_type::vertex_type& vertex) { function is_doc (line 380) | inline bool is_doc(const graph_type::vertex_type& vertex) { function count_tokens (line 387) | inline size_t count_tokens(const graph_type::edge_type& edge) { function get_other_vertex (line 395) | inline graph_type::vertex_type type gather_type (line 415) | struct gather_type { method gather_type (line 418) | gather_type() : nchanges(0) { } method gather_type (line 419) | gather_type(uint32_t nchanges) : factor(NTOPICS), nchanges(nchanges) { } method save (line 420) | void save(graphlab::oarchive& arc) const { arc << factor << nchanges; } method load (line 421) | void load(graphlab::iarchive& arc) { arc >> factor >> nchanges; } method gather_type (line 422) | gather_type& operator+=(const gather_type& other) { class cgs_lda_vertex_program (line 441) | class cgs_lda_vertex_program : method edge_dir_type (line 453) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 461) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 477) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 496) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 517) | void scatter(icontext_type& context, const vertex_type& vertex, class topk_aggregator (line 584) | class topk_aggregator { method topk_aggregator (line 590) | topk_aggregator(size_t nchanges = 0, size_t nupdates = 0) : method save (line 593) | void save(graphlab::oarchive& arc) const { arc << top_words << nchange... method load (line 594) | void load(graphlab::iarchive& arc) { arc >> top_words >> nchanges; } method topk_aggregator (line 597) | topk_aggregator& operator+=(const topk_aggregator& other) { method topk_aggregator (line 613) | static topk_aggregator map(icontext_type& context, method finalize (line 631) | static void finalize(icontext_type& context, type global_counts_aggregator (line 674) | struct global_counts_aggregator { method factor_type (line 676) | static factor_type map(icontext_type& context, const vertex_type& vert... method finalize (line 680) | static void finalize(icontext_type& context, const factor_type& total) { class log_gamma (line 696) | class log_gamma { method log_gamma (line 700) | log_gamma(): offset(1.0) {} method init (line 702) | void init(const double& new_offset, const size_t& buckets) { class likelihood_aggregator (line 752) | class likelihood_aggregator : public graphlab::IS_POD_TYPE { method likelihood_aggregator (line 757) | likelihood_aggregator() : lik_words_given_topics(0), lik_topics(0) { } method likelihood_aggregator (line 759) | likelihood_aggregator& operator+=(const likelihood_aggregator& other) { method likelihood_aggregator (line 765) | static likelihood_aggregator method finalize (line 790) | static void finalize(icontext_type& context, const likelihood_aggregat... type signal_only (line 820) | struct signal_only { method docs (line 825) | static graphlab::empty method words (line 835) | static graphlab::empty function load_and_initialize_graph (line 889) | bool load_and_initialize_graph(graphlab::distributed_control& dc, function load_dictionary (line 956) | bool load_dictionary(const std::string& fname) { type count_saver (line 1006) | struct count_saver { method count_saver (line 1008) | count_saver(bool save_words) : save_words(save_words) { } method save_vertex (line 1011) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 1033) | std::string save_edge(const edge_type& edge) const { function main (line 1058) | int main(int argc, char** argv) { FILE: toolkits/topic_modeling/cgs_lda_mimno_experimental.cpp function factor_type (line 71) | inline factor_type& operator+=(factor_type& lvalue, type top_words_type (line 190) | struct top_words_type { method top_words_type (line 193) | top_words_type() : method json_header_string (line 195) | inline std::string json_header_string() const { function word_cloud_callback (line 212) | std::pair type vertex_data (line 238) | struct vertex_data { method vertex_data (line 247) | vertex_data() : nupdates(0), nchanges(0), factor(NTOPICS),MIMNO_R(0) { } method save (line 248) | void save(graphlab::oarchive& arc) const { method load (line 262) | void load(graphlab::iarchive& arc) { type edge_data (line 280) | struct edge_data { method edge_data (line 285) | edge_data(size_t ntokens = 0) : nchanges(0), assignment(ntokens, NULL_... method save (line 286) | void save(graphlab::oarchive& arc) const { arc << nchanges << assignme... method load (line 287) | void load(graphlab::iarchive& arc) { arc >> nchanges >> assignment; } function eparser (line 310) | bool eparser(edge_data& ed, const std::string& line){ function vparser (line 325) | bool vparser(vertex_data& vd, const std::string& line){ function graph_loader (line 340) | bool graph_loader(graph_type& graph, const std::string& fname, function is_word (line 387) | inline bool is_word(const graph_type::vertex_type& vertex) { function is_doc (line 398) | inline bool is_doc(const graph_type::vertex_type& vertex) { function count_tokens (line 405) | inline size_t count_tokens(const graph_type::edge_type& edge) { function get_other_vertex (line 413) | inline graph_type::vertex_type type gather_type (line 433) | struct gather_type { method gather_type (line 436) | gather_type() : nchanges(0) { } method gather_type (line 437) | gather_type(uint32_t nchanges) : factor(NTOPICS), nchanges(nchanges) { } method save (line 438) | void save(graphlab::oarchive& arc) const { method load (line 452) | void load(graphlab::iarchive& arc) { method gather_type (line 463) | gather_type& operator+=(const gather_type& other) { class cgs_lda_vertex_program (line 482) | class cgs_lda_vertex_program : method edge_dir_type (line 495) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 503) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 519) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 545) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 566) | void scatter(icontext_type& context, const vertex_type& vertex, class topk_aggregator (line 707) | class topk_aggregator { method topk_aggregator (line 713) | topk_aggregator(size_t nchanges = 0, size_t nupdates = 0) : method save (line 716) | void save(graphlab::oarchive& arc) const { arc << top_words << nchange... method load (line 717) | void load(graphlab::iarchive& arc) { arc >> top_words >> nchanges; } method topk_aggregator (line 720) | topk_aggregator& operator+=(const topk_aggregator& other) { method topk_aggregator (line 736) | static topk_aggregator map(icontext_type& context, method finalize (line 754) | static void finalize(icontext_type& context, type global_counts_aggregator (line 797) | struct global_counts_aggregator { method factor_type (line 799) | static factor_type map(icontext_type& context, const vertex_type& vert... method finalize (line 803) | static void finalize(icontext_type& context, const factor_type& total) { class likelihood_aggregator (line 832) | class likelihood_aggregator : public graphlab::IS_POD_TYPE { method likelihood_aggregator (line 837) | likelihood_aggregator() : lik_words_given_topics(0), lik_topics(0) { } method likelihood_aggregator (line 839) | likelihood_aggregator& operator+=(const likelihood_aggregator& other) { method likelihood_aggregator (line 845) | static likelihood_aggregator method finalize (line 868) | static void finalize(icontext_type& context, const likelihood_aggregat... type signal_only (line 896) | struct signal_only { method docs (line 901) | static graphlab::empty method words (line 911) | static graphlab::empty function load_and_initialize_graph (line 965) | bool load_and_initialize_graph(graphlab::distributed_control& dc, function load_dictionary (line 1024) | bool load_dictionary(const std::string& fname) { type count_saver (line 1074) | struct count_saver { method count_saver (line 1076) | count_saver(bool save_words) : save_words(save_words) { } method save_vertex (line 1079) | std::string save_vertex(const vertex_type& vertex) const { method save_edge (line 1101) | std::string save_edge(const edge_type& edge) const { function main (line 1126) | int main(int argc, char** argv) { FILE: toolkits/topic_modeling/deprecated/cgs_lda.cpp type gather_type (line 37) | struct gather_type { method gather_type (line 43) | gather_type() { } method gather_type (line 45) | gather_type(const graph_type::edge_type& edge, method save (line 53) | void save(graphlab::oarchive& arc) const { arc << neighborhood_map; } method load (line 55) | void load(graphlab::iarchive& arc) { arc >> neighborhood_map; } method gather_type (line 57) | gather_type& operator+=(const gather_type& other) { class cgs_lda_vertex_program (line 68) | class cgs_lda_vertex_program : method save (line 74) | void save(graphlab::oarchive& arc) const { method load (line 78) | void load(graphlab::iarchive& arc) { method edge_dir_type (line 83) | edge_dir_type gather_edges(icontext_type& context, method gather_type (line 88) | gather_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 94) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 164) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 169) | void scatter(icontext_type& context, const vertex_type& vertex, function main (line 203) | int main(int argc, char** argv) { FILE: toolkits/topic_modeling/deprecated/cvb0_lda_common.cpp function graph_loader (line 40) | bool graph_loader(graph_type& graph, const std::string& fname, function load_dictionary (line 73) | bool load_dictionary(const std::string& fname) { function load_and_initialize_graph (line 118) | bool load_and_initialize_graph(graphlab::distributed_control& dc, FILE: toolkits/topic_modeling/deprecated/cvb0_lda_common.hpp function factor_type (line 47) | inline factor_type& operator+=(factor_type& lvalue, const factor_type& r... type vertex_data (line 62) | struct vertex_data { method vertex_data (line 66) | vertex_data() : nupdates(0), nchanges(0) { } method save (line 67) | void save(graphlab::oarchive& arc) const { method load (line 70) | void load(graphlab::iarchive& arc) { type edge_data (line 79) | struct edge_data { method edge_data (line 81) | edge_data(uint32_t count = 0) : count(count), belief(NTOPICS) { } method save (line 82) | void save(graphlab::oarchive& arc) const { method load (line 85) | void load(graphlab::iarchive& arc) { function initialize_vertex_data (line 103) | inline void initialize_vertex_data(graph_type::vertex_type& vertex) { function is_word (line 119) | inline bool is_word(const graph_type::vertex_type& vertex) { function is_doc (line 123) | inline bool is_doc(const graph_type::vertex_type& vertex) { function get_other_vertex (line 127) | inline graph_type::vertex_type class topk_aggregator (line 135) | class topk_aggregator { method topk_aggregator (line 142) | topk_aggregator(size_t nchanges = 0, size_t nupdates = 0) : method save (line 145) | void save(graphlab::oarchive& arc) const { method load (line 148) | void load(graphlab::iarchive& arc) { method topk_aggregator (line 152) | topk_aggregator& operator+=(const topk_aggregator& other) { method topk_aggregator (line 168) | static topk_aggregator map(icontext_type& context, method finalize (line 185) | static void finalize(icontext_type& context, type global_counts_aggregator (line 207) | struct global_counts_aggregator { method factor_type (line 209) | static factor_type map(IContext& context, const vertex_type& vertex) { method finalize (line 213) | static void finalize(IContext& context, const factor_type& total) { type selective_signal (line 224) | struct selective_signal { method docs (line 225) | static graphlab::empty method words (line 230) | static graphlab::empty FILE: toolkits/topic_modeling/deprecated/fast_cvb0_lda.cpp class cvb0_lda_vertex_program (line 32) | class cvb0_lda_vertex_program : method edge_dir_type (line 37) | edge_dir_type gather_edges(icontext_type& context, method factor_type (line 42) | factor_type gather(icontext_type& context, const vertex_type& vertex, method apply (line 94) | void apply(icontext_type& context, vertex_type& vertex, method edge_dir_type (line 106) | edge_dir_type scatter_edges(icontext_type& context, method scatter (line 111) | void scatter(icontext_type& context, const vertex_type& vertex, function main (line 133) | int main(int argc, char** argv) { FILE: toolkits/topic_modeling/http/lda_visualizer.js function update_domain (line 10) | function update_domain(form) { function get_top_words (line 23) | function get_top_words() { function process_top_words (line 35) | function process_top_words(data) { FILE: toolkits/topic_modeling/lda_sequential_cgs.cpp type token_type (line 46) | struct token_type { method token_type (line 49) | token_type(const word_id_type& word = 0, const doc_id_type& doc = 0) : type corpus_type (line 57) | struct corpus_type { method corpus_type (line 63) | corpus_type(const std::string& dictionary_fname, method load_dictionary (line 72) | void load_dictionary(const std::string& fname) { method load_counts (line 82) | void load_counts(const std::string& fname) { method shuffle_tokens (line 108) | void shuffle_tokens() { graphlab::random::shuffle(tokens); } class matrix (line 114) | class matrix { method linear_index (line 119) | const size_t linear_index(const size_t& i, const size_t& j) const { method matrix (line 125) | matrix(const size_t& rows, const size_t& cols, const T& zero = T(0)) : method T (line 127) | const T& operator()(const size_t& i, const size_t& j) const { method rows (line 130) | size_t rows() const { return _rows; } method cols (line 131) | size_t cols() const { return _cols; } method T (line 132) | T& operator()(const size_t& i, const size_t& j) { method T (line 135) | const T& operator()(const size_t& i) const { method T (line 139) | T& operator()(const size_t& i) { method zeros (line 143) | void zeros() { method T (line 151) | T sum() const { class collapsed_gibbs (line 160) | class collapsed_gibbs { method collapsed_gibbs (line 176) | collapsed_gibbs(const corpus_type& corpus, method iterate (line 188) | void iterate() { function log_likelihood (line 238) | double log_likelihood(const double& alpha, const double& beta, function display_top (line 281) | void display_top(const corpus_type& corpus, function main (line 311) | int main(int argc, char** argv) {