2010-05-13 05:35:19 +08:00
|
|
|
//===- llvm/unittest/ADT/APInt.cpp - APInt unit tests ---------------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/ADT/ilist.h"
|
Add an assertion for a likely ilist::splice() contract violation.
The single-element ilist::splice() function supports a noop move:
List.splice(I, List, I);
The corresponding std::list function doesn't allow that, so add a unit
test to document that behavior.
This also means that
List.splice(I, List, F);
is somewhat surprisingly not equivalent to
List.splice(I, List, F, next(F));
This patch adds an assertion to catch the illegal case I == F above.
Alternatively, we could make I == F a legal noop, but that would make
ilist differ even more from std::list.
llvm-svn: 170443
2012-12-19 03:28:37 +08:00
|
|
|
#include "llvm/ADT/STLExtras.h"
|
2013-01-02 18:26:28 +08:00
|
|
|
#include "llvm/ADT/ilist_node.h"
|
2012-12-04 18:23:08 +08:00
|
|
|
#include "gtest/gtest.h"
|
|
|
|
#include <ostream>
|
2010-05-13 05:35:19 +08:00
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
struct Node : ilist_node<Node> {
|
|
|
|
int Value;
|
|
|
|
|
|
|
|
Node() {}
|
|
|
|
Node(int _Value) : Value(_Value) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
TEST(ilistTest, Basic) {
|
|
|
|
ilist<Node> List;
|
|
|
|
List.push_back(Node(1));
|
|
|
|
EXPECT_EQ(1, List.back().Value);
|
|
|
|
EXPECT_EQ(0, List.back().getPrevNode());
|
|
|
|
EXPECT_EQ(0, List.back().getNextNode());
|
|
|
|
|
|
|
|
List.push_back(Node(2));
|
|
|
|
EXPECT_EQ(2, List.back().Value);
|
|
|
|
EXPECT_EQ(2, List.front().getNextNode()->Value);
|
|
|
|
EXPECT_EQ(1, List.back().getPrevNode()->Value);
|
2010-05-14 02:35:02 +08:00
|
|
|
|
|
|
|
const ilist<Node> &ConstList = List;
|
|
|
|
EXPECT_EQ(2, ConstList.back().Value);
|
|
|
|
EXPECT_EQ(2, ConstList.front().getNextNode()->Value);
|
|
|
|
EXPECT_EQ(1, ConstList.back().getPrevNode()->Value);
|
2010-05-13 05:35:19 +08:00
|
|
|
}
|
|
|
|
|
Add an assertion for a likely ilist::splice() contract violation.
The single-element ilist::splice() function supports a noop move:
List.splice(I, List, I);
The corresponding std::list function doesn't allow that, so add a unit
test to document that behavior.
This also means that
List.splice(I, List, F);
is somewhat surprisingly not equivalent to
List.splice(I, List, F, next(F));
This patch adds an assertion to catch the illegal case I == F above.
Alternatively, we could make I == F a legal noop, but that would make
ilist differ even more from std::list.
llvm-svn: 170443
2012-12-19 03:28:37 +08:00
|
|
|
TEST(ilistTest, SpliceOne) {
|
|
|
|
ilist<Node> List;
|
|
|
|
List.push_back(1);
|
|
|
|
|
|
|
|
// The single-element splice operation supports noops.
|
|
|
|
List.splice(List.begin(), List, List.begin());
|
|
|
|
EXPECT_EQ(1u, List.size());
|
|
|
|
EXPECT_EQ(1, List.front().Value);
|
|
|
|
EXPECT_TRUE(llvm::next(List.begin()) == List.end());
|
|
|
|
|
|
|
|
// Altenative noop. Move the first element behind itself.
|
|
|
|
List.push_back(2);
|
|
|
|
List.push_back(3);
|
|
|
|
List.splice(llvm::next(List.begin()), List, List.begin());
|
|
|
|
EXPECT_EQ(3u, List.size());
|
|
|
|
EXPECT_EQ(1, List.front().Value);
|
|
|
|
EXPECT_EQ(2, llvm::next(List.begin())->Value);
|
|
|
|
EXPECT_EQ(3, List.back().Value);
|
|
|
|
}
|
|
|
|
|
2010-05-13 05:35:19 +08:00
|
|
|
}
|