/external/ceres-solver/internal/ceres/ |
H A D | 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[ 89 HashMap<int, int> membership; local 119 HashMap<int, int> membership; local [all...] |
H A D | single_linkage_clustering.cc | 48 HashMap<int, int>* membership) { 49 CHECK_NOTNULL(membership)->clear(); 56 (*membership)[*it] = *it; 77 const int c1 = FindConnectedComponent(vertex1, membership); 78 const int c2 = FindConnectedComponent(vertex2, membership); 85 (*membership)[c2] = c1; 87 (*membership)[c1] = c2; 95 for (HashMap<int, int>::iterator it = membership->begin(); 96 it != membership->end(); 98 it->second = FindConnectedComponent(it->first, membership); 45 ComputeSingleLinkageClustering( const SingleLinkageClusteringOptions& options, const Graph<int>& graph, HashMap<int, int>* membership) argument [all...] |
H A D | single_linkage_clustering.h | 59 // membership upon return will contain a mapping from the vertices of 68 HashMap<int, int>* membership);
|
H A D | canonical_views_clustering.h | 95 // as the canonical views/cluster centers, and membership is a map 106 HashMap<int, int>* membership);
|
H A D | canonical_views_clustering.cc | 57 // as the canonical views/cluster centers, and membership is a map 66 IntMap* membership); 74 IntMap* membership) const; 90 IntMap* membership) { 93 cv.ComputeClustering(options, graph, centers, membership); 103 IntMap* membership) { 106 CHECK_NOTNULL(membership)->clear(); 142 ComputeClusterMembership(*centers, membership); 216 IntMap* membership) const { 217 CHECK_NOTNULL(membership) 86 ComputeCanonicalViewsClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument 99 ComputeClustering( const CanonicalViewsClusteringOptions& options, const Graph<int>& graph, vector<int>* centers, IntMap* membership) argument [all...] |
H A D | 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/srec/seti/sltsEngine/include/ |
H A D | lts_seq_internal.h | 67 unsigned short membership[16]; // UCHAR_MAX/sizeof(unsigned short)/8 member in struct:LQUESTION 133 unsigned short membership[16]; // UCHAR_MAX/sizeof(unsigned short)/8 member in struct:LTS
|
/external/libvorbis/vq/ |
H A D | 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[ [all...] |
/external/wpa_supplicant_8/hostapd/src/drivers/ |
H A D | driver_wired.c | 57 int membership, multi, iff_allmulti, iff_up; member in struct:wpa_driver_wired_data 243 "membership"); 568 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 570 drv->membership = 1; 572 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 614 if (drv->membership &&
|
H A D | driver_macsec_qca.c | 64 int membership, multi, iff_allmulti, iff_up; member in struct:macsec_qca_data 341 "%s: Added multicast membership with packet socket", 343 drv->membership = 1; 346 "%s: Added multicast membership with SIOCADDMULTI", 387 if (drv->membership &&
|
/external/wpa_supplicant_8/src/drivers/ |
H A D | driver_wired.c | 57 int membership, multi, iff_allmulti, iff_up; member in struct:wpa_driver_wired_data 243 "membership"); 568 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 570 drv->membership = 1; 572 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 614 if (drv->membership &&
|
H A D | driver_macsec_qca.c | 64 int membership, multi, iff_allmulti, iff_up; member in struct:macsec_qca_data 341 "%s: Added multicast membership with packet socket", 343 drv->membership = 1; 346 "%s: Added multicast membership with SIOCADDMULTI", 387 if (drv->membership &&
|
/external/wpa_supplicant_8/wpa_supplicant/src/drivers/ |
H A D | driver_wired.c | 57 int membership, multi, iff_allmulti, iff_up; member in struct:wpa_driver_wired_data 243 "membership"); 568 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 570 drv->membership = 1; 572 wpa_printf(MSG_DEBUG, "%s: Added multicast membership with " 614 if (drv->membership &&
|
H A D | driver_macsec_qca.c | 64 int membership, multi, iff_allmulti, iff_up; member in struct:macsec_qca_data 341 "%s: Added multicast membership with packet socket", 343 drv->membership = 1; 346 "%s: Added multicast membership with SIOCADDMULTI", 387 if (drv->membership &&
|
/external/srec/seti/sltsEngine/src/ |
H A D | run_seq_lts.c | 86 #define in_list(myV, myQ) (bitarray_read_bit( myQ->membership, myV)) 219 bitarray_populate_from_list( questions[i]->membership, (char*) questions[i]->list, questions[i]->num_list); 790 bitarray_populate_from_list( lts->membership, lts->strings[i], len);
|
/external/qemu/disas/ |
H A D | mips.c | 279 unsigned long membership; member in struct:mips_opcode 624 /* Test for membership in an ISA including chip specific ISAs. INSN 631 (((insn)->membership & isa) != 0 \ 632 || (cpu == CPU_R4650 && ((insn)->membership & INSN_4650) != 0) \ 633 || (cpu == CPU_RM7000 && ((insn)->membership & INSN_4650) != 0) \ 634 || (cpu == CPU_RM9000 && ((insn)->membership & INSN_4650) != 0) \ 635 || (cpu == CPU_R4010 && ((insn)->membership & INSN_4010) != 0) \ 636 || (cpu == CPU_VR4100 && ((insn)->membership & INSN_4100) != 0) \ 637 || (cpu == CPU_R3900 && ((insn)->membership & INSN_3900) != 0) \ 639 && ((insn)->membership [all...] |
/external/chromium_org/v8/src/compiler/ |
H A D | 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 ? " |" : " ");
|
/external/chromium_org/third_party/sqlite/src/src/ |
H A D | expr.c | 1376 ** either to test for membership of the (...) set or to iterate through 1400 ** for fast set membership tests. In this case an epheremal table must 1404 ** When the b-tree is being used for membership tests, the calling function 1564 ** for membership testing only. There is no need to initialize any 1849 /* If the set membership test fails, then the result of the
|
/external/chromium_org/third_party/sqlite/amalgamation/ |
H A D | sqlite3.c | [all...] |