binaryurp/qa/test-cache.cxx

   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 class Test: public CppUnit::TestFixture {
  31 private:
  32     CPPUNIT_TEST_SUITE(Test);
  33     CPPUNIT_TEST(testNothingLostFromLruList);
  34     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 void Test::testNothingLostFromLruList() {
  41     int a[8];
  42     for (int i = 0; i != int(SAL_N_ELEMENTS(a)); ++i) {
  43         for (int j = 0; j != i; ++j) {
  44             a[j] = 0;
  45         }
  46         for (;;) {
  47             binaryurp::Cache< int > c(4);
  48             for (int k = 0; k != i; ++k) {
  49                 bool f;
  50                 c.add(a[k], &f);
  51             }
  52             bool f;
  53             CPPUNIT_ASSERT_EQUAL(
  54                 6,
  55                 c.add(-1, &f) + c.add(-2, &f) + c.add(-3, &f) + c.add(-4, &f));
  56             int j = i - 1;
  57             while (j >= 0 && a[j] == 3) {
  58                 --j;
  59             }
  60             if (j < 0) {
  61                 break;
  62             }
  63             ++a[j];
  64             for (int k = j + 1; k != i; ++k) {
  65                 a[k] = 0;
  66             }
  67         }
  68     }
  69 }
  70
  71 CPPUNIT_TEST_SUITE_REGISTRATION(Test);
  72
  73 }
  74
  75 CPPUNIT_PLUGIN_IMPLEMENT();
  76
  77 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */