fc2413e9a8
...tweaking the code slightly to guarantee that j will always be non-negative Change-Id: Ie8ba450884cc8b12e0caa79b4d75f95dd96cc120 Reviewed-on: https://gerrit.libreoffice.org/c/core/+/132993 Tested-by: Jenkins Reviewed-by: Stephan Bergmann <sbergman@redhat.com>
81 lines
2.3 KiB
C++
81 lines
2.3 KiB
C++
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
|
|
/*
|
|
* This file is part of the LibreOffice project.
|
|
*
|
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
|
*
|
|
* This file incorporates work covered by the following license notice:
|
|
*
|
|
* Licensed to the Apache Software Foundation (ASF) under one or more
|
|
* contributor license agreements. See the NOTICE file distributed
|
|
* with this work for additional information regarding copyright
|
|
* ownership. The ASF licenses this file to you under the Apache
|
|
* License, Version 2.0 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.apache.org/licenses/LICENSE-2.0 .
|
|
*/
|
|
|
|
#include <sal/config.h>
|
|
|
|
#include <cstddef>
|
|
|
|
#include <sal/types.h>
|
|
#include <cppunit/TestAssert.h>
|
|
#include <cppunit/TestFixture.h>
|
|
#include <cppunit/extensions/HelperMacros.h>
|
|
#include <cppunit/plugin/TestPlugIn.h>
|
|
|
|
#include "../source/cache.hxx"
|
|
|
|
namespace {
|
|
|
|
class Test: public CppUnit::TestFixture {
|
|
private:
|
|
CPPUNIT_TEST_SUITE(Test);
|
|
CPPUNIT_TEST(testNothingLostFromLruList);
|
|
CPPUNIT_TEST_SUITE_END();
|
|
|
|
void testNothingLostFromLruList();
|
|
};
|
|
|
|
// cf. jurt/test/com/sun/star/lib/uno/protocols/urp/Cache_Test.java:
|
|
void Test::testNothingLostFromLruList() {
|
|
int a[8];
|
|
for (std::size_t i = 0; i != std::size(a); ++i) {
|
|
for (std::size_t j = 0; j != i; ++j) {
|
|
a[j] = 0;
|
|
}
|
|
for (;;) {
|
|
binaryurp::Cache< int > c(4);
|
|
for (std::size_t k = 0; k != i; ++k) {
|
|
bool f;
|
|
c.add(a[k], &f);
|
|
}
|
|
bool f;
|
|
CPPUNIT_ASSERT_EQUAL(
|
|
6,
|
|
c.add(-1, &f) + c.add(-2, &f) + c.add(-3, &f) + c.add(-4, &f));
|
|
std::size_t j = i;
|
|
while (j != 0 && a[j - 1] == 3) {
|
|
--j;
|
|
}
|
|
if (j == 0) {
|
|
break;
|
|
}
|
|
++a[j - 1];
|
|
for (std::size_t k = j; k != i; ++k) {
|
|
a[k] = 0;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
CPPUNIT_TEST_SUITE_REGISTRATION(Test);
|
|
|
|
}
|
|
|
|
CPPUNIT_PLUGIN_IMPLEMENT();
|
|
|
|
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|