Package thread.caches

Examples of thread.caches.KeyObject

25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
        fill();
        UserOfCache.createInstance(new AdaptiveReplacementUsed<KeyObject, ValueObject>(), storage);
        int a = 0, b = 0, c = 0, d = 0;
        for (int i = 0; i < 100; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                a++;
            }else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                b++;
            }else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                c++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                d++;
            }
        }

        System.out.println("a " + a);
        System.out.println("b = " + b);
        System.out.println("c = " + c);
        System.out.println("d = " + d);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(10, keys.size());
        assertEquals( 3 + "", keys.get(9).getKey());
        assertEquals( 5 + "", keys.get(8).getKey());
        assertEquals( 8 + "", keys.get(7).getKey());
        System.out.println(keys);
        assertTrue(keys.containsAll(Arrays.asList(f)));
        Queue<CountKey<KeyObject>> queue = new PriorityQueue<CountKey<KeyObject>>(10);
        for (KeyObject k : keys) {
            CountKey<KeyObject> countKey = new CountKey<KeyObject>(k);
            if (k.getKey().equals("5")) countKey.incrementCount();
            queue.offer(countKey);
        }
        System.out.println("------------------------------------");
        System.out.println(queue);
        CountKey countKey5 = new CountKey<KeyObject>(new KeyObject("5"));
        countKey5.incrementCount();
        CountKey countKey87 = new CountKey<KeyObject>(new KeyObject("86"));
        assertEquals(1, countKey5.compareTo(countKey87));
    }
View Full Code Here
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
        fill();
        UserOfCache.createInstance(new AdaptiveReplacementUsed<KeyObject, ValueObject>(), storage);
        int a = 0, b = 0, c = 0, d = 0;
        for (int i = 0; i < 100; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                a++;
            }else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                b++;
            }else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                c++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                d++;
            }
        }
        Random random = new Random();
        random.nextInt(100);
        for (int i = 0; i < 500; i++){
            int k = random.nextInt(99);
            //System.out.println("i= " + i + "; k = " + k);
             UserOfCache.get(new KeyObject(k + ""));

        }
        System.out.println("a " + a);
        System.out.println("b = " + b);
        System.out.println("c = " + c);
        System.out.println("d = " + d);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(10, keys.size());
        assertEquals( 3 + "", keys.get(9).getKey());
        assertEquals( 5 + "", keys.get(8).getKey());
        assertEquals( 8 + "", keys.get(7).getKey());
        System.out.println(keys);
        assertTrue(keys.containsAll(Arrays.asList(f)));
        Queue<CountKey<KeyObject>> queue = new PriorityQueue<CountKey<KeyObject>>(10);
        for (KeyObject k : keys) {
            CountKey<KeyObject> countKey = new CountKey<KeyObject>(k);
            if (k.getKey().equals("5")) countKey.incrementCount();
            queue.offer(countKey);
        }
        System.out.println("------------------------------------");
        System.out.println(queue);
        CountKey countKey5 = new CountKey<KeyObject>(new KeyObject("5"));
        countKey5.incrementCount();
        CountKey countKey87 = new CountKey<KeyObject>(new KeyObject("86"));
        assertEquals(1, countKey5.compareTo(countKey87));
    }
View Full Code Here
129
130
131
132
133
134
135
136
137
138
139
        List<KeyObject> consumer = new ArrayList<KeyObject>();
        storage = new ArrayList<ValueObject>();
        Random random = new Random();
        random.nextInt(100);
        for (int i = 0; i < 100; i++) {
            KeyObject keyObject = new KeyObject(i + "");

            ValueObject valueObject = new ValueObject(keyObject, i + " data ");
            storage.add(valueObject);
        }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
    @Test
    public void simpleTest() {
        int usingOf3 = 0, usingOf5 = 0, usingOf8 = 0, usingOfOthers = 0;
        for (int i = 0; i < 100; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                usingOf3++;
            } else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                usingOf5++;
            } else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                usingOf8++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                usingOfOthers++;
            }
        }

        System.out.println("usingOf3 " + usingOf3);
        System.out.println("usingOf5 = " + usingOf5);
        System.out.println("usingOf8 = " + usingOf8);
        System.out.println("others = " + usingOfOthers);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(10, keys.size());
        System.out.println(keys);
        assertTrue(keys.containsAll(Arrays.asList(f)));
    }
View Full Code Here
52
53
54
55
56
57
58
59
60
61
62
    protected  List<ValueObject> fillStorage() {
        List<ValueObject> storage = new ArrayList< >();
        Random random = new Random();
        random.nextInt(100);
        for (int i = 0; i < 100; i++) {
            KeyObject keyObject = new KeyObject(i + "");

            ValueObject valueObject = new ValueObject(keyObject, i + " data ");
            storage.add(valueObject);
        }
        return storage;
View Full Code Here
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
        UserOfCache.createInstance(new LeastRecentlyUsed2<KeyObject, ValueObject>(), storage);
        int a = 0, b = 0, c = 0, d = 0;
        for (int j = 0; j < 3; j++)
            for (int i = 0; i < 100; i++) {
                if (i % 3 == 0) {
                    UserOfCache.get(new KeyObject(3 + ""));
                    a++;
                } else if (i % 5 == 0) {
                    UserOfCache.get(new KeyObject(5 + ""));
                    b++;
                } else if (i % 8 == 0) {
                    UserOfCache.get(new KeyObject(8 + ""));
                    c++;
                } else {
                    UserOfCache.get(new KeyObject(i + ""));
                    d++;
                }
            }

        System.out.println("a " + a);
        System.out.println("b = " + b);
        System.out.println("c = " + c);
        System.out.println("d = " + d);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(3, keys.size());
//        assertEquals( 3 + "", keys.get(9).getKey());
//        assertEquals( 5 + "", keys.get(8).getKey());
//        assertEquals( 8 + "", keys.get(7).getKey());
        System.out.println(keys);
View Full Code Here
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
        fill();
        UserOfCache.createInstance(new LeastRecentlyUsed2<KeyObject, ValueObject>(), storage);
        int a = 0, b = 0, c = 0, d = 0;
        for (int i = 0; i < 100; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                a++;
            } else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                b++;
            } else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                c++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                d++;
            }

        }
        for (int j = 0; j < 2; j++)
        for (int i = 0; i < 20; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                a++;
            } else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                b++;
            } else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                c++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                d++;
            }
        }

        System.out.println("a " + a);
        System.out.println("b = " + b);
        System.out.println("c = " + c);
        System.out.println("d = " + d);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(10, keys.size());
//        assertEquals( 3 + "", keys.get(9).getKey());
//        assertEquals( 5 + "", keys.get(8).getKey());
//        assertEquals( 8 + "", keys.get(7).getKey());
        System.out.println(keys);
View Full Code Here
119
120
121
122
123
124
125
126
127
128
129
        List<KeyObject> consumer = new ArrayList<KeyObject>();
        storage = new ArrayList<ValueObject>();
        Random random = new Random();
        random.nextInt(100);
        for (int i = 0; i < 100; i++) {
            KeyObject keyObject = new KeyObject(i + "");

            ValueObject valueObject = new ValueObject(keyObject, i + " data ");
            storage.add(valueObject);
        }
View Full Code Here
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
        fill();
        UserOfCache.createInstance(new LeastFrequentlyUsed<KeyObject, ValueObject>(), storage);
        int a = 0, b = 0, c = 0, d = 0;
        for (int i = 0; i < 100; i++) {
            if (i % 3 == 0) {
                UserOfCache.get(new KeyObject(3 + ""));
                a++;
            }else if (i % 5 == 0) {
                UserOfCache.get(new KeyObject(5 + ""));
                b++;
            }else if (i % 8 == 0) {
                UserOfCache.get(new KeyObject(8 + ""));
                c++;
            } else {
                UserOfCache.get(new KeyObject(i + ""));
                d++;
            }
        }

        System.out.println("a " + a);
        System.out.println("b = " + b);
        System.out.println("c = " + c);
        System.out.println("d = " + d);

        List<KeyObject> keys = UserOfCache.getAllCache();
        KeyObject[] f = {new KeyObject("3"), new KeyObject("5"), new KeyObject("8")};
        assertEquals(10, keys.size());
        assertEquals( 3 + "", keys.get(9).getKey());
        assertEquals( 5 + "", keys.get(8).getKey());
        assertEquals( 8 + "", keys.get(7).getKey());
        System.out.println(keys);
        assertTrue(keys.containsAll(Arrays.asList(f)));
        Queue<CountKey<KeyObject>> queue = new PriorityQueue<CountKey<KeyObject>>(10);
        for (KeyObject k : keys) {
            CountKey<KeyObject> countKey = new CountKey<KeyObject>(k);
            if (k.getKey().equals("5")) countKey.incrementCount();
            queue.offer(countKey);
        }
        System.out.println("------------------------------------");
        System.out.println(queue);
        CountKey countKey5 = new CountKey<KeyObject>(new KeyObject("5"));
        countKey5.incrementCount();
        CountKey countKey87 = new CountKey<KeyObject>(new KeyObject("86"));
        assertEquals(1, countKey5.compareTo(countKey87));
    }
View Full Code Here
71
72
73
74
75
76
77
78
79
80
81
        List<KeyObject> consumer = new ArrayList<KeyObject>();
        storage = new ArrayList<ValueObject>();
        Random random = new Random();
        random.nextInt(100);
        for (int i = 0; i < 100; i++) {
            KeyObject keyObject = new KeyObject(i + "");

            ValueObject valueObject = new ValueObject(keyObject, i + " data ");
            storage.add(valueObject);
        }
View Full Code Here
TOP

Related Classes of thread.caches.KeyObject

  • collections.queue.PriorityQueueTest
  • thread.caches.arc.CacheTest
  • thread.caches.lfu.CacheTest
  • thread.caches.lru.AbstractLinkedListLRUCacheTest
  • thread.caches.lru2.CacheTest
    • 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.