xref: /aoo42x/main/binaryurp/qa/test-cache.cxx (revision e5230ffa)
1 /**************************************************************
2  *
3  * Licensed to the Apache Software Foundation (ASF) under one
4  * or more contributor license agreements.  See the NOTICE file
5  * distributed with this work for additional information
6  * regarding copyright ownership.  The ASF licenses this file
7  * to you under the Apache License, Version 2.0 (the
8  * "License"); you may not use this file except in compliance
9  * with the License.  You may obtain a copy of the License at
10  *
11  *   http://www.apache.org/licenses/LICENSE-2.0
12  *
13  * Unless required by applicable law or agreed to in writing,
14  * software distributed under the License is distributed on an
15  * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
16  * KIND, either express or implied.  See the License for the
17  * specific language governing permissions and limitations
18  * under the License.
19  *
20  *************************************************************/
21 
22 
23 
24 #include "sal/config.h"
25 
26 #include "gtest/gtest.h"
27 
28 #include "../source/cache.hxx"
29 
30 namespace {
31 
32 class Test: public ::testing::Test {
33 public:
34 };
35 
36 // cf. jurt/test/com/sun/star/lib/uno/protocols/urp/Cache_Test.java:
TEST_F(Test,testNothingLostFromLruList)37 TEST_F(Test, testNothingLostFromLruList) {
38     int a[8];
39     for (int i = 0; i != sizeof a / sizeof a[0]; ++i) {
40         for (int j = 0; j != i; ++j) {
41             a[j] = 0;
42         }
43         for (;;) {
44             binaryurp::Cache< int > c(4);
45             for (int k = 0; k != i; ++k) {
46                 bool f;
47                 c.add(a[k], &f);
48             }
49             bool f;
50             ASSERT_EQ(
51                 6,
52                 c.add(-1, &f) + c.add(-2, &f) + c.add(-3, &f) + c.add(-4, &f));
53             int j = i - 1;
54             while (j >= 0 && a[j] == 3) {
55                 --j;
56             }
57             if (j < 0) {
58                 break;
59             }
60             ++a[j];
61             for (int k = j + 1; k != i; ++k) {
62                 a[k] = 0;
63             }
64         }
65     }
66 }
67 
68 
69 }
70