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/config.h>
  21
  22 #include <cstddef>
  23
  24 #include <sal/types.h>
  25 #include <cppunit/TestAssert.h>
  26 #include <cppunit/TestFixture.h>
  27 #include <cppunit/extensions/HelperMacros.h>
  28 #include <cppunit/plugin/TestPlugIn.h>
  29
  30 #include "../source/cache.hxx"
  31
  32 namespace {
  33
  34 class Test: public CppUnit::TestFixture {
  35 private:
  36     CPPUNIT_TEST_SUITE(Test);
  37     CPPUNIT_TEST(testNothingLostFromLruList);
  38     CPPUNIT_TEST_SUITE_END();
  39
  40     void testNothingLostFromLruList();
  41 };
  42
  43 // cf. jurt/test/com/sun/star/lib/uno/protocols/urp/Cache_Test.java:
  44 void Test::testNothingLostFromLruList() {
  45     int a[8];
  46     for (std::size_t i = 0; i != std::size(a); ++i) {
  47         for (std::size_t j = 0; j != i; ++j) {
  48             a[j] = 0;
  49         }
  50         for (;;) {
  51             binaryurp::Cache< int > c(4);
  52             for (std::size_t k = 0; k != i; ++k) {
  53                 bool f;
  54                 c.add(a[k], &f);
  55             }
  56             bool f;
  57             CPPUNIT_ASSERT_EQUAL(
  58                 6,
  59                 c.add(-1, &f) + c.add(-2, &f) + c.add(-3, &f) + c.add(-4, &f));
  60             std::size_t j = i;
  61             while (j != 0 && a[j - 1] == 3) {
  62                 --j;
  63             }
  64             if (j == 0) {
  65                 break;
  66             }
  67             ++a[j - 1];
  68             for (std::size_t k = j; k != i; ++k) {
  69                 a[k] = 0;
  70             }
  71         }
  72     }
  73 }
  74
  75 CPPUNIT_TEST_SUITE_REGISTRATION(Test);
  76
  77 }
  78
  79 CPPUNIT_PLUGIN_IMPLEMENT();
  80
  81 /* vim:set shiftwidth=4 softtabstop=4 expandtab: */