mirror of
https://github.com/apple/swift.git
synced 2025-12-14 20:36:38 +01:00
90 lines
2.4 KiB
C++
90 lines
2.4 KiB
C++
//===--- SuccessorMapTest.cpp ---------------------------------------------===//
|
|
//
|
|
// This source file is part of the Swift.org open source project
|
|
//
|
|
// Copyright (c) 2014 - 2017 Apple Inc. and the Swift project authors
|
|
// Licensed under Apache License v2.0 with Runtime Library Exception
|
|
//
|
|
// See https://swift.org/LICENSE.txt for license information
|
|
// See https://swift.org/CONTRIBUTORS.txt for the list of Swift project authors
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "swift/Basic/SuccessorMap.h"
|
|
#include "gtest/gtest.h"
|
|
|
|
using namespace swift;
|
|
|
|
int *const MissingValue = nullptr;
|
|
|
|
TEST(SuccessorMapTest, T1) {
|
|
SuccessorMap<int, int> map;
|
|
|
|
map.validate();
|
|
EXPECT_EQ(MissingValue, map.findLeastUpperBound(27));
|
|
|
|
map.insert(6, 17);
|
|
map.validate();
|
|
EXPECT_EQ(MissingValue, map.findLeastUpperBound(7));
|
|
EXPECT_EQ(17, *map.findLeastUpperBound(5));
|
|
map.validate();
|
|
|
|
map.insert(7, 21);
|
|
map.validate();
|
|
EXPECT_EQ(MissingValue, map.findLeastUpperBound(8));
|
|
EXPECT_EQ(17, *map.findLeastUpperBound(5));
|
|
|
|
map.insert(5, 25);
|
|
map.validate();
|
|
EXPECT_EQ(MissingValue, map.findLeastUpperBound(8));
|
|
EXPECT_EQ(25, *map.findLeastUpperBound(0));
|
|
map.validate();
|
|
|
|
map.insert(1, 3);
|
|
map.validate();
|
|
EXPECT_EQ(3, *map.findLeastUpperBound(0));
|
|
EXPECT_EQ(25, *map.findLeastUpperBound(2));
|
|
map.validate();
|
|
|
|
map.insert(3, 15);
|
|
map.validate();
|
|
EXPECT_EQ(3, *map.findLeastUpperBound(0));
|
|
EXPECT_EQ(15, *map.findLeastUpperBound(2));
|
|
EXPECT_EQ(25, *map.findLeastUpperBound(4));
|
|
map.validate();
|
|
}
|
|
|
|
TEST(SuccessorMapTest, T2) {
|
|
SuccessorMap<int, int> map;
|
|
map.insert(197838, 542428);
|
|
map.validate();
|
|
map.insert(668575, 820413);
|
|
map.validate();
|
|
map.insert(544719, 105904);
|
|
map.validate();
|
|
map.insert(605652, 154894);
|
|
map.validate();
|
|
map.insert(319462, 474093);
|
|
EXPECT_EQ(154894, *map.findLeastUpperBound(600000));
|
|
EXPECT_EQ(474093, *map.findLeastUpperBound(300000));
|
|
}
|
|
|
|
TEST(SuccessorMapTest, T3) {
|
|
SuccessorMap<int, int> map;
|
|
map.insert(864753, 848275);
|
|
map.validate();
|
|
map.insert(359283, 606460);
|
|
map.validate();
|
|
map.insert(31760, 149173);
|
|
map.validate();
|
|
map.insert(963845, 514568);
|
|
map.validate();
|
|
map.insert(34076, 768766);
|
|
map.validate();
|
|
map.insert(843809, 706405);
|
|
map.validate();
|
|
map.insert(307612, 981256);
|
|
map.validate();
|
|
EXPECT_EQ(848275, *map.findLeastUpperBound(859432));
|
|
}
|