Types & classes — github.com/GraphChi/graphchi-cpp

CodeHub MCPcopy Create free account

hub / github.com/GraphChi/graphchi-cpp / types & classes

Types & classes430 in github.com/GraphChi/graphchi-cpp

⨍ Functions 2,289◇ Types & classes 430

↓ 11 callersClassmetrics_entry

Data structure for storing metric entries NOTE: This data structure is not very optimal, should of course use inheritance. But for this purpose, it wo

src/metrics/metrics.hpp:52

↓ 4 callersClassSCCinfo

example_apps/stronglyconnectedcomponents.cpp:94

↓ 4 callersClassnull_stream

src/logger/logger.hpp:509

↓ 4 callersClassvec

Describes a string (chunk of memory).

src/external/vpiotr-mongoose-cpp/mongoose.c:363

↓ 3 callersClassempty

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:40

↓ 3 callersClassiotask

src/io/stripedio.hpp:92

↓ 3 callersClassshard_index

src/graphchi_types.hpp:61

↓ 3 callersClassvertex_data_libfm

toolkits/collaborative_filtering/libfm.cpp:84

↓ 2 callersClassIndexTranslator

toolkits/collaborative_filtering/climf_script/prepare_epinions.py:40

↓ 2 callersClassMMWriter

toolkits/collaborative_filtering/climf_script/prepare_epinions.py:50

↓ 2 callersClassedge_data

* \brief The edge data represents the individual tokens (word,doc) * pairs and their assignment to topics. */

graphlab_toolkit_ports/lda/cgs_lda_vertexprogram.hpp:215

↓ 2 callersClassgather_type

* \brief The gather type used to construct XtX and Xty needed for the ALS * update * * To compute the ALS update we need to compute the sum of *

example_apps/matrix_factorization/graphlab_gas/als_vertex_program.hpp:195

↓ 2 callersClasssocket

Describes listening socket, or socket which was accept()-ed by the master thread and queued for future handling by the worker thread.

src/external/vpiotr-mongoose-cpp/mongoose.c:377

↓ 2 callersClassstat

src/api/chifilenames.hpp:442

↓ 1 callersClassConnection

A wrapper class for all functions that take struct mg_connection * as the first argument.

src/external/vpiotr-mongoose-cpp/bindings/python/mongoose.py:81

↓ 1 callersClassSplit

toolkits/collaborative_filtering/climf_script/prepare_epinions.py:7

↓ 1 callersClassdense_adj

toolkits/collaborative_filtering/itemcf.cpp:100

↓ 1 callersClassdense_adj

example_apps/trianglecounting.cpp:126

↓ 1 callersClassedge

example_apps/demotools/create_streaminggraph_demofiles.cpp:21

↓ 1 callersClassedge_data

* \brief The edge data stores the entry in the matrix. * * In addition the edge data also stores the most recent error estimate. */

example_apps/matrix_factorization/graphlab_gas/als_vertex_program.hpp:98

↓ 1 callersClassgather_type

* \brief The gather type for the collapsed Gibbs sampler is used to * collect the topic counts on adjacent edges so that the apply * function can co

graphlab_toolkit_ports/lda/cgs_lda_vertexprogram.hpp:319

↓ 1 callersClassindex_val

toolkits/collaborative_filtering/itemcf.cpp:298

↓ 1 callersClassindex_val

toolkits/collaborative_filtering/itemcf2.cpp:305

↓ 1 callersClassindexentry

src/shards/slidingshard.hpp:147

↓ 1 callersClassindexentry

src/shards/dynamicdata/slidingshard.hpp:134

↓ 1 callersClassrbm_movie

* bi = pvec = rbm_bins * DOUBLE * w = weight = rbm_bins * D * Double */

toolkits/collaborative_filtering/rbm.cpp:106

↓ 1 callersClassrbm_movie

* ni = bias = DOUBLE * bi = pvec = rbm_bins * DOUBLE * w = weight = rbm_bins * D * Double */

toolkits/collaborative_filtering/rating2.cpp:126

↓ 1 callersClassrbm_user

* h = pvec = D * DOUBLE * h0 = weight = D * DOUBLE * h1 = weight+D = D * DOUBLE */

toolkits/collaborative_filtering/rbm.cpp:82

↓ 1 callersClassrbm_user

* h = pvec = D * DOUBLE * h0 = weight = D * DOUBLE * h1 = weight+D = D * DOUBLE */

toolkits/collaborative_filtering/rating2.cpp:101

↓ 1 callersClassstat

src/external/vpiotr-mongoose-cpp/mongoose.c:1211

↓ 1 callersClassstat

src/external/vpiotr-mongoose-cpp/main.c:130

↓ 1 callersClassstripe_chunk

src/io/stripedio.hpp:129

↓ 1 callersClasstime_svdpp_movie

toolkits/collaborative_filtering/timesvdpp.cpp:111

↓ 1 callersClasstime_svdpp_time

toolkits/collaborative_filtering/timesvdpp.cpp:131

↓ 1 callersClasstime_svdpp_usr

toolkits/collaborative_filtering/timesvdpp.cpp:85

↓ 1 callersClasstimer

* \ingroup util * * \brief A simple class that can be used for benchmarking/timing up * to microsecond resolution. * * Standard Usage

toolkits/collaborative_filtering/timer.hpp:64

↓ 1 callersClassvertex_data

* \brief The vertex data represents each term and document in the * corpus and contains the counts of tokens in each topic. */

graphlab_toolkit_ports/lda/cgs_lda_vertexprogram.hpp:200

ClassALSEdgeFactorsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

example_apps/matrix_factorization/als_edgefactors.cpp:84

ClassALSVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/als_tensor.cpp:107

ClassALSVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/als_coord.cpp:93

ClassALSVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/als.cpp:116

ClassALSVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/sparse_als.cpp:104

ClassALSVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

example_apps/matrix_factorization/als_vertices_inmem.cpp:85

ClassAcceptMinimum

example_apps/minimumspanningforest.cpp:98

ClassAdPredictorValidationProgram

* program for computing the validation error (optional) */

toolkits/classification/adpredictor.cpp:139

ClassAdPredictorVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/classification/adpredictor.cpp:189

ClassAdjConverter

example_apps/convert_to_adjacency.cpp:49

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/math.hpp:94

ClassBIASSGDVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/biassgd2.cpp:108

ClassBIASSGDVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/biassgd.cpp:104

EnumBLOCK_ACTION

src/io/stripedio.hpp:80

ClassBaselineVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/baseline.cpp:106

ClassBoruvskaStarContractionStep

example_apps/minimumspanningforest.cpp:126

ClassCOEMVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/text_analysis/coem.cpp:97

ClassCommunityDetectionProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

example_apps/communitydetection.cpp:100

ClassConnectedComponentsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/graph_analytics/connectedcomponents.cpp:71

ClassConnectedComponentsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/graph_analytics/inmemconncomps.cpp:71

ClassConnectedComponentsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/graph_analytics/bond_percolation.cpp:72

ClassConnectedComponentsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

example_apps/connectedcomponents.cpp:69

ClassConnectedComponentsProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

example_apps/inmemconncomps.cpp:61

ClassContractionStep

example_apps/minimumspanningforest.cpp:267

ClassContractionStep

Simple contraction step that just outputs the non-deleted edges. Would be better done automatically, but the dynamic engine is a bit flaky. */

example_apps/stronglyconnectedcomponents.cpp:296

EnumContractionType

example_apps/minimumspanningforest.cpp:41

src/external/vpiotr-mongoose-cpp/mongoose.c:156

EnumDISTANCE_METRICS

toolkits/collaborative_filtering/itemcf3.cpp:64

EnumDISTANCE_METRICS

toolkits/collaborative_filtering/itemcf.cpp:52

EnumDISTANCE_METRICS

toolkits/collaborative_filtering/itemcf2.cpp:72

ClassDistDouble

toolkits/collaborative_filtering/math.hpp:171

toolkits/collaborative_filtering/math.hpp:170

ClassDistSlicedMat

toolkits/collaborative_filtering/math.hpp:350

toolkits/collaborative_filtering/math.hpp:173

ClassDuplicateEdgeFilter

src/preprocessing/sharder.hpp:77

ClassDynamicDataLoaderTestProgram

* Smoke test. */

src/tests/test_dynamicedata_loader.cpp:54

ClassDynamicDataSmokeTestProgram

* Smoke test. */

src/tests/dynamicdata_smoketest.cpp:49

ClassEdgeCountProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/graph_analytics/inmemconncomps.cpp:135

ClassFunctionalProgramProxyBulkSync

src/api/functional/functional_bulksync.hpp:131

ClassFunctionalProgramProxySemisync

src/api/functional/functional_semisync.hpp:133

ClassGensgdVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/gensgd.cpp:756

ClassGraphChiProgram

src/api/graphchi_program.hpp:42

ClassGraphLabEdgeAggregatorWrapper

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:651

ClassGraphLabEdgeWrapper

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:309

ClassGraphLabVertexWrapper

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:306

ClassGraphLabWrapper

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:528

ClassIS_POD_TYPE

src/api/graphlab2_1_GAS_api/graphchi_graphlabv2_1.hpp:39

ClassItemDistanceProgram

toolkits/collaborative_filtering/itemcf3.cpp:253

ClassItemDistanceProgram

toolkits/collaborative_filtering/itemsim2rating.cpp:249

ClassItemDistanceProgram

toolkits/collaborative_filtering/itemsim2rating2.cpp:254

ClassItemDistanceProgram

toolkits/collaborative_filtering/itemcf.cpp:310

ClassItemDistanceProgram

toolkits/collaborative_filtering/itemcf2.cpp:318

ClassKcoresProgram

toolkits/graph_analytics/kcores.cpp:81

ClassLIBFMVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/collaborative_filtering/libfm.cpp:171

ClassLPVerticesInMemProgram

* GraphChi programs need to subclass GraphChiProgram<vertex-type, edge-type> * class. The main logic is usually in the update function. */

toolkits/graph_analytics/label_propagation.cpp:73

ClassMD5Context

src/external/vpiotr-mongoose-cpp/mongoose.c:1795

ClassMMOutputter

example_apps/matrix_factorization/als.hpp:221

ClassMMOutputter2

struct for writing the output feature vectors into file

toolkits/collaborative_filtering/baseline.cpp:163

ClassMMOutputter_ids

toolkits/collaborative_filtering/rating2.cpp:415

ClassMMOutputter_ids

toolkits/collaborative_filtering/rating.cpp:305

ClassMMOutputter_mat

toolkits/collaborative_filtering/io.hpp:186

ClassMMOutputter_ratings

toolkits/collaborative_filtering/rating2.cpp:393

ClassMMOutputter_ratings

toolkits/collaborative_filtering/rating.cpp:283

next →1–100 of 430, ranked by callers