Package org.apache.jackrabbit.oak.plugins.index.property.strategy.OrderedContentMirrorStoreStrategy

Examples of org.apache.jackrabbit.oak.plugins.index.property.strategy.OrderedContentMirrorStoreStrategy.OrderedChildNodeEntry

3068
3069
3070
3071
3072
3073
3074
3075
3076
3077
3078
3079
3080
3081
3082
3083
3084
3085
3086
3087
3088
3089
3090
3091
3092
3093
3094
3095
3096
3097
3098
3099
3100
3101
3102
3103
3104
3105
3106
3107
3108
3109
3110
3111
3112
3113
3114
3115
3116
3117
3118
3119
3120
3121
3122
3123
3124
3125
3126
3127
3128
3129
3130
3131
3132
3133
3134
        printSkipList(index);

        // testing the exception in case of wrong parameters
        String searchFor = "wedontcareaswetesttheexception";
        NodeState node = index.getChildNode(searchFor);
        ChildNodeEntry entry = new OrderedChildNodeEntry(
            searchFor, node);
        ChildNodeEntry[] wl = new ChildNodeEntry[0];
        ChildNodeEntry item = null;
        ChildNodeEntry lane0, lane1, lane2, lane3;
       
        try {
            item = store.seek(index,
                new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
            fail("With a wrong size for the lane it should have raised an exception");
        } catch (IllegalArgumentException e) {
            // so far so good. It was expected
        }
       
        // testing equality
        searchFor = n12;
        lane3 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane2 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane1 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane0 = new OrderedChildNodeEntry(n11, index.getChildNode(n11));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n08;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane1 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane0 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n06;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n03, index.getChildNode(n03));
        lane1 = new OrderedChildNodeEntry(n05, index.getChildNode(n05));
        lane0 = new OrderedChildNodeEntry(n05, index.getChildNode(n05));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
View Full Code Here
3195
3196
3197
3198
3199
3200
3201
3202
3203
3204
3205
3206
3207
3208
3209
3210
3211
3212
3213
3214
3215
3216
3217
3218
3219
3220
3221
3222
3223
3224
3225
3226
3227
3228
3229
3230
3231
3232
3233
3234
3235
3236
3237
3238
3239
3240
3241
3242
3243
3244
3245
3246
3247
3248
3249
3250
3251
3252
3253
3254
3255
3256
3257
3258
3259
3260
3261
        printSkipList(index);
       
        // testing the exception in case of wrong parameters
        String searchFor = "wedontcareaswetesttheexception";
        NodeState node = index.getChildNode(searchFor);
        ChildNodeEntry entry = new OrderedChildNodeEntry(
            searchFor, node);
        ChildNodeEntry[] wl = new ChildNodeEntry[0];
        ChildNodeEntry item = null;
        ChildNodeEntry lane0, lane1, lane2, lane3;
       
        try {
            item = store.seek(index,
                new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
            fail("With a wrong size for the lane it should have raised an exception");
        } catch (IllegalArgumentException e) {
            // so far so good. It was expected
        }
       
        // testing equality
        searchFor = n12;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane1 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane0 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n08;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane1 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane0 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n06;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane1 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane0 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
View Full Code Here
3323
3324
3325
3326
3327
3328
3329
3330
3331
3332
3333
3334
3335
3336
3337
3338
        String searchfor;
        ChildNodeEntry entry;
       
        searchfor = "b";
        predicate = new PredicateLessThan(searchfor, true);
        entry = new OrderedChildNodeEntry("a", EmptyNodeState.EMPTY_NODE);
        assertTrue(predicate.apply(entry));

        searchfor = "a";
        predicate = new PredicateLessThan(searchfor, true);
        entry = new OrderedChildNodeEntry("b", EmptyNodeState.EMPTY_NODE);
        assertFalse(predicate.apply(entry));

        searchfor = "a";
        predicate = new PredicateLessThan(searchfor, true);
        entry = null;
View Full Code Here
3130
3131
3132
3133
3134
3135
3136
3137
3138
3139
3140
3141
3142
3143
3144
3145
3146
3147
3148
3149
3150
3151
3152
3153
3154
3155
3156
3157
3158
3159
3160
3161
3162
3163
3164
3165
3166
3167
3168
3169
3170
3171
3172
3173
3174
3175
3176
3177
3178
3179
3180
3181
3182
3183
3184
3185
3186
3187
3188
3189
3190
3191
3192
3193
3194
3195
3196
        printSkipList(index);

        // testing the exception in case of wrong parameters
        String searchFor = "wedontcareaswetesttheexception";
        NodeState node = index.getChildNode(searchFor);
        ChildNodeEntry entry = new OrderedChildNodeEntry(
            searchFor, node);
        ChildNodeEntry[] wl = new ChildNodeEntry[0];
        ChildNodeEntry item = null;
        ChildNodeEntry lane0, lane1, lane2, lane3;
       
        try {
            item = store.seek(index,
                new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
            fail("With a wrong size for the lane it should have raised an exception");
        } catch (IllegalArgumentException e) {
            // so far so good. It was expected
        }
       
        // testing equality
        searchFor = n12;
        lane3 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane2 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane1 = new OrderedChildNodeEntry(n10, index.getChildNode(n10));
        lane0 = new OrderedChildNodeEntry(n11, index.getChildNode(n11));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n08;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane1 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane0 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n06;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n03, index.getChildNode(n03));
        lane1 = new OrderedChildNodeEntry(n05, index.getChildNode(n05));
        lane0 = new OrderedChildNodeEntry(n05, index.getChildNode(n05));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
View Full Code Here
3257
3258
3259
3260
3261
3262
3263
3264
3265
3266
3267
3268
3269
3270
3271
3272
3273
3274
3275
3276
3277
3278
3279
3280
3281
3282
3283
3284
3285
3286
3287
3288
3289
3290
3291
3292
3293
3294
3295
3296
3297
3298
3299
3300
3301
3302
3303
3304
3305
3306
3307
3308
3309
3310
3311
3312
3313
3314
3315
3316
3317
3318
3319
3320
3321
3322
3323
        printSkipList(index);
       
        // testing the exception in case of wrong parameters
        String searchFor = "wedontcareaswetesttheexception";
        NodeState node = index.getChildNode(searchFor);
        ChildNodeEntry entry = new OrderedChildNodeEntry(
            searchFor, node);
        ChildNodeEntry[] wl = new ChildNodeEntry[0];
        ChildNodeEntry item = null;
        ChildNodeEntry lane0, lane1, lane2, lane3;
       
        try {
            item = store.seek(index,
                new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
            fail("With a wrong size for the lane it should have raised an exception");
        } catch (IllegalArgumentException e) {
            // so far so good. It was expected
        }
       
        // testing equality
        searchFor = n12;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane1 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane0 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n08;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane1 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane0 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
        assertEquals(OrderedIndex.LANES, wl.length);
        assertEquals("Wrong lane", lane0, wl[0]);
        assertEquals("Wrong lane", lane1, wl[1]);
        assertEquals("Wrong lane", lane2, wl[2]);
        assertEquals("Wrong lane", lane3, wl[3]);
        assertEquals("Wrong item returned", entry, item);

        searchFor = n06;
        lane3 = new OrderedChildNodeEntry(START, index.getChildNode(START));
        lane2 = new OrderedChildNodeEntry(n09, index.getChildNode(n09));
        lane1 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        lane0 = new OrderedChildNodeEntry(n07, index.getChildNode(n07));
        entry = new OrderedChildNodeEntry(searchFor,
            index.getChildNode(searchFor));
        wl = new ChildNodeEntry[OrderedIndex.LANES];
        item = store.seek(index,
            new OrderedContentMirrorStoreStrategy.PredicateEquals(searchFor), wl);
        assertNotNull(wl);
View Full Code Here
3385
3386
3387
3388
3389
3390
3391
3392
3393
3394
3395
3396
3397
3398
3399
3400
        String searchfor;
        ChildNodeEntry entry;
       
        searchfor = "b";
        predicate = new PredicateLessThan(searchfor, true);
        entry = new OrderedChildNodeEntry("a", EmptyNodeState.EMPTY_NODE);
        assertTrue(predicate.apply(entry));

        searchfor = "a";
        predicate = new PredicateLessThan(searchfor, true);
        entry = new OrderedChildNodeEntry("b", EmptyNodeState.EMPTY_NODE);
        assertFalse(predicate.apply(entry));

        searchfor = "a";
        predicate = new PredicateLessThan(searchfor, true);
        entry = null;
View Full Code Here
TOP

Related Classes of org.apache.jackrabbit.oak.plugins.index.property.strategy.OrderedContentMirrorStoreStrategy.OrderedChildNodeEntry

  • org.apache.jackrabbit.oak.plugins.index.property.strategy.OrderedContentMirrorStorageStrategyTest
    • 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.