1
0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-11-22 18:54:02 +01:00
llvm-mirror/unittests/Support/IndexedAccessorTest.cpp
River Riddle d59032fedc [llvm][STLExtras] Move various iterator/range utilities from MLIR to LLVM
This revision moves the various range utilities present in MLIR to LLVM to enable greater reuse. This revision moves the following utilities:

* indexed_accessor_*
This is set of utility iterator/range base classes that allow for building a range class where the iterators are represented by an object+index pair.

* make_second_range
Given a range of pairs, returns a range iterating over the `second` elements.

* hasSingleElement
Returns if the given range has 1 element. size() == 1 checks end up being very common, but size() is not always O(1) (e.g., ilist). This method provides O(1) checks for those cases.

Differential Revision: https://reviews.llvm.org/D78064
2020-04-14 15:14:40 -07:00

50 lines
1.8 KiB
C++

//===- IndexedAccessorTest.cpp - Indexed Accessor Tests -------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
#include "llvm/ADT/ArrayRef.h"
#include "llvm/ADT/STLExtras.h"
#include "gmock/gmock.h"
using namespace llvm;
using namespace llvm::detail;
namespace {
/// Simple indexed accessor range that wraps an array.
template <typename T>
struct ArrayIndexedAccessorRange
: public indexed_accessor_range<ArrayIndexedAccessorRange<T>, T *, T> {
ArrayIndexedAccessorRange(T *data, ptrdiff_t start, ptrdiff_t numElements)
: indexed_accessor_range<ArrayIndexedAccessorRange<T>, T *, T>(
data, start, numElements) {}
using indexed_accessor_range<ArrayIndexedAccessorRange<T>, T *,
T>::indexed_accessor_range;
/// See `llvm::indexed_accessor_range` for details.
static T &dereference(T *data, ptrdiff_t index) { return data[index]; }
};
} // end anonymous namespace
template <typename T>
static void compareData(ArrayIndexedAccessorRange<T> range,
ArrayRef<T> referenceData) {
ASSERT_TRUE(referenceData.size() == range.size());
ASSERT_TRUE(std::equal(range.begin(), range.end(), referenceData.begin()));
}
namespace {
TEST(AccessorRange, SliceTest) {
int rawData[] = {0, 1, 2, 3, 4};
ArrayRef<int> data = llvm::makeArrayRef(rawData);
ArrayIndexedAccessorRange<int> range(rawData, /*start=*/0, /*numElements=*/5);
compareData(range, data);
compareData(range.slice(2, 3), data.slice(2, 3));
compareData(range.slice(0, 5), data.slice(0, 5));
}
} // end anonymous namespace