HomeSort by relevance Sort by last modified time
    Searched defs:membership (Results 1 - 4 of 4) sorted by null

  /external/ceres-solver/internal/ceres/
single_linkage_clustering_test.cc 60 HashMap<int, int> membership; local
61 ComputeSingleLinkageClustering(options, graph, &membership);
62 EXPECT_EQ(membership.size(), kNumVertices);
64 EXPECT_EQ(membership[1], membership[0]);
65 EXPECT_EQ(membership[2], membership[0]);
66 EXPECT_EQ(membership[3], membership[0]);
67 EXPECT_NE(membership[4], membership[0])
89 HashMap<int, int> membership; local
119 HashMap<int, int> membership; local
    [all...]
visibility_based_preconditioner.cc 195 HashMap<int, int> membership; local
207 &membership);
215 &membership);
222 FlattenMembershipMap(membership, &cluster_membership_);
244 // checking membership of (cluster1, cluster2) in cluster_pairs_.
589 // Iterate over the cluster membership map and update the
  /external/libvorbis/vq/
bookutil.c 340 long *membership=_ogg_malloc(vals*sizeof(long)); local
344 for(i=0;i<vals;i++)membership[i]=i;
358 first=membership[j];
362 if((least==-1 || hist[j]<=least) && membership[j]!=first){
364 second=membership[j];
374 if(membership[j]==first || membership[j]==second){
375 membership[j]=first;
381 if(membership[i]!=membership[i+1])
    [all...]
  /external/chromium_org/v8/src/compiler/
scheduler.cc 784 // Computes loop membership from the backedges of the control flow graph.
791 // Compute loop membership starting from backedges.
812 // Propagate loop membership backwards. All predecessors of M up to the
849 bool membership = loops[i].members->Contains(bid); local
851 PrintF(membership ? " |" : " ");
    [all...]

Completed in 377 milliseconds