Package org.fastlsh.util

Examples of org.fastlsh.util.LexicographicBitSetComparator

81
82
83
84
85
86
87
88
89
90
91
        al.add(new Signature(2,b2));
        al.add(new Signature(4,b4));
        al.add(new Signature(3,b3));
        al.add(new Signature(5,b5));
       
        Collections.sort(al, new LexicographicBitSetComparator());
        Assert.assertEquals(4, al.get(0).id);
        Assert.assertEquals(3, al.get(1).id);
        Assert.assertEquals(2, al.get(2).id);
        Assert.assertEquals(1, al.get(3).id);
        Assert.assertEquals(5, al.get(4).id);
View Full Code Here
114
115
116
117
118
119
120
121
122
123
124
        al.add(new Signature(1,b1));
        al.add(new Signature(2,b2));
        al.add(new Signature(4,b4));
        al.add(new Signature(3,b3));
       
        Collections.sort(al, new LexicographicBitSetComparator());
        Assert.assertEquals(2, al.get(0).id);
        Assert.assertEquals(3, al.get(1).id);
        Assert.assertEquals(4, al.get(2).id);
        Assert.assertEquals(1, al.get(3).id);
       
View Full Code Here
153
154
155
156
157
158
159
160
161
162
163
        al.add(new Signature(1,b1));
        al.add(new Signature(2,b2));
        al.add(new Signature(4,b4));
        al.add(new Signature(3,b3));
       
        Collections.sort(al, new LexicographicBitSetComparator());
        Assert.assertEquals(2, al.get(0).id);
        Assert.assertEquals(3, al.get(1).id);
        Assert.assertEquals(4, al.get(2).id);
        Assert.assertEquals(1, al.get(3).id);
        Assert.assertEquals(11, al.get(4).id);
View Full Code Here
67
68
69
70
71
72
73
   
    public static void permuteAndSort(Permuter p, Signature [] sigs)
    {
        p.reset();
        for(int i = 0, max = sigs.length; i < max; i++) sigs[i] = new Signature(sigs[i].id, p.permute(sigs[i].bits));
        Arrays.sort(sigs, new LexicographicBitSetComparator());
    }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
        long end = System.currentTimeMillis();
        System.out.println("Took: " + (end - start) + " millis to initialize " + numBitSets + " bitsets of cardinality " + cardinality + ".");

        Permuter permuter = new Permuter(cardinality);
        PermutationIndexWriter.permuteAndSort(permuter, bitSets);
        LexicographicBitSetComparator comparator = new LexicographicBitSetComparator();
        start = System.currentTimeMillis();
        Arrays.sort(bitSets, comparator);
        end = System.currentTimeMillis();
       
        System.out.println("Took: " + (end - start) + " millis to sort " + numBitSets + " bitsets of cardinality " + cardinality + ".");
View Full Code Here
117
118
119
120
121
122
123
124
125
126
127
        }
    }

    public static boolean areSame(Signature[] sigs1, Signature[] sigs2)
    {
        Comparator<Signature> comp = new LexicographicBitSetComparator();
        Arrays.sort(sigs1, comp);
        Arrays.sort(sigs2, comp);
        for (int i = 0, m = sigs1.length; i < m; i++)
        {
            if (sigs1[i].id != sigs2[i].id)
View Full Code Here
TOP

Related Classes of org.fastlsh.util.LexicographicBitSetComparator

  • org.fastlsh.index.IndexUtils
  • org.fastlsh.index.PermutationIndexWriter
  • org.fastlsh.index.SortSpeedBenchMark
  • org.fastlsh.util.BitSetSortTest
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.