Branch data Line data Source code
1 : : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : : /*
3 : : * This file is part of the LibreOffice project.
4 : : *
5 : : * This Source Code Form is subject to the terms of the Mozilla Public
6 : : * License, v. 2.0. If a copy of the MPL was not distributed with this
7 : : * file, You can obtain one at http://mozilla.org/MPL/2.0/.
8 : : *
9 : : * This file incorporates work covered by the following license notice:
10 : : *
11 : : * Licensed to the Apache Software Foundation (ASF) under one or more
12 : : * contributor license agreements. See the NOTICE file distributed
13 : : * with this work for additional information regarding copyright
14 : : * ownership. The ASF licenses this file to you under the Apache
15 : : * License, Version 2.0 (the "License"); you may not use this file
16 : : * except in compliance with the License. You may obtain a copy of
17 : : * the License at http://www.apache.org/licenses/LICENSE-2.0 .
18 : : */
19 : :
20 : : #include <sal/types.h>
21 : : #include "cppunit/TestAssert.h"
22 : : #include "cppunit/TestFixture.h"
23 : : #include "cppunit/extensions/HelperMacros.h"
24 : : #include "cppunit/plugin/TestPlugIn.h"
25 : :
26 : : #include "../source/cache.hxx"
27 : :
28 : : namespace {
29 : :
30 [ - + ]: 15 : class Test: public CppUnit::TestFixture {
31 : : private:
32 [ + - ][ + - ]: 10 : CPPUNIT_TEST_SUITE(Test);
[ + - ][ + - ]
[ # # ]
33 [ + - ][ + - ]: 5 : CPPUNIT_TEST(testNothingLostFromLruList);
[ + - ][ + - ]
[ + - ][ + - ]
[ + - ]
34 [ + - ][ + - ]: 10 : CPPUNIT_TEST_SUITE_END();
[ + - ][ + - ]
[ + - ][ + - ]
[ + - ][ + - ]
35 : :
36 : : void testNothingLostFromLruList();
37 : : };
38 : :
39 : : // cf. jurt/test/com/sun/star/lib/uno/protocols/urp/Cache_Test.java:
40 : 5 : void Test::testNothingLostFromLruList() {
41 : : int a[8];
42 [ + + ]: 45 : for (int i = 0; i != sizeof a / sizeof a[0]; ++i) {
43 [ + + ]: 180 : for (int j = 0; j != i; ++j) {
44 : 140 : a[j] = 0;
45 : : }
46 : 109185 : for (;;) {
47 [ + - ]: 109225 : binaryurp::Cache< int > c(4);
48 [ + + ]: 837405 : for (int k = 0; k != i; ++k) {
49 : : bool f;
50 [ + - ]: 728180 : c.add(a[k], &f);
51 : : }
52 : : bool f;
53 [ + - ][ + - ]: 218450 : CPPUNIT_ASSERT_EQUAL(
[ + - ][ + - ]
[ + - ][ + - ]
[ + - ][ + - ]
54 : : 6,
55 [ + - ]: 109225 : c.add(-1, &f) + c.add(-2, &f) + c.add(-3, &f) + c.add(-4, &f));
56 : 109225 : int j = i - 1;
57 [ + + ][ + + ]: 145620 : while (j >= 0 && a[j] == 3) {
[ + + ]
58 : 36395 : --j;
59 : : }
60 [ + + ]: 109225 : if (j < 0) {
61 : : break;
62 : : }
63 : 109185 : ++a[j];
64 [ + + ]: 145440 : for (int k = j + 1; k != i; ++k) {
65 : 36255 : a[k] = 0;
66 : : }
67 [ + + ]: 109225 : }
68 : : }
69 : 5 : }
70 : :
71 : 5 : CPPUNIT_TEST_SUITE_REGISTRATION(Test);
72 : :
73 : : }
74 : :
75 [ + - ][ + - ]: 20 : CPPUNIT_PLUGIN_IMPLEMENT();
[ + - ][ + - ]
[ + - ][ # # ]
76 : :
77 : : /* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|