DGtal  0.9.3
Functions
testContainerTraits.cpp File Reference
#include <vector>
#include <list>
#include <deque>
#include <set>
#include <map>
#include <boost/unordered_set.hpp>
#include <boost/unordered_map.hpp>
#include <forward_list>
#include <array>
#include <unordered_set>
#include <unordered_map>
#include "DGtal/base/Common.h"
#include "DGtal/base/ContainerTraits.h"
#include "DGtalCatch.h"
Include dependency graph for testContainerTraits.cpp:

Go to the source code of this file.

Functions

 TEST_CASE ("int container traits", "[int][traits]")
 
 TEST_CASE ("std::vector<> container traits", "[vector][traits]")
 
 TEST_CASE ("std::list<> container traits", "[list][traits]")
 
 TEST_CASE ("std::deque<> container traits", "[deque][traits]")
 
 TEST_CASE ("std::forward_list<> container traits", "[forward_list][traits]")
 
 TEST_CASE ("std::array<> container traits", "[array][traits]")
 
 TEST_CASE ("std::set<> container traits", "[set][traits]")
 
 TEST_CASE ("std::multiset<> container traits", "[multiset][traits]")
 
 TEST_CASE ("std::map<> container traits", "[map][traits]")
 
 TEST_CASE ("std::multimap<> container traits", "[multimap][traits]")
 
 TEST_CASE ("boost::unordered_set<> container traits", "[unordered_set][traits]")
 
 TEST_CASE ("boost::unordered_map<> container traits", "[unordered_map][traits]")
 
 TEST_CASE ("boost::unordered_multiset<> container traits", "[unordered_multiset][traits]")
 
 TEST_CASE ("boost::unordered_multimap<> container traits", "[unordered_multimap][traits]")
 
 TEST_CASE ("std::unordered_set<> container traits", "[unordered_set][traits]")
 
 TEST_CASE ("std::unordered_multiset<> container traits", "[unordered_multiset][traits]")
 
 TEST_CASE ("std::unordered_map<> container traits", "[unordered_map][traits]")
 
 TEST_CASE ("std::unordered_multimap<> container traits", "[unordered_multimap][traits]")
 

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author
Jacques-Olivier Lachaud (jacqu.nosp@m.es-o.nosp@m.livie.nosp@m.r.la.nosp@m.chaud.nosp@m.@uni.nosp@m.v-sav.nosp@m.oie..nosp@m.fr ) Laboratory of Mathematics (CNRS, UMR 5127), University of Savoie, France
Date
2015/08/28

This file is part of the DGtal library

Definition in file testContainerTraits.cpp.

Function Documentation

◆ TEST_CASE() [1/18]

TEST_CASE ( "int container traits"  ,
""  [int][traits] 
)

Definition at line 53 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

54 {
55  typedef int Container;
56  SECTION( "Checking container traits" )
57  {
67  }
68 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [2/18]

TEST_CASE ( "std::vector<> container traits"  ,
""  [vector][traits] 
)

Definition at line 70 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

71 {
72  typedef std::vector<int> Container;
73  SECTION( "Checking container traits" )
74  {
84  }
85 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [3/18]

TEST_CASE ( "std::list<> container traits"  ,
""  [list][traits] 
)

Definition at line 87 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

88 {
89  typedef std::list<int> Container;
90  SECTION( "Checking container traits" )
91  {
101  }
102 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [4/18]

TEST_CASE ( "std::deque<> container traits"  ,
""  [deque][traits] 
)

Definition at line 104 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

105 {
106  typedef std::deque<int> Container;
107  SECTION( "Checking container traits" )
108  {
118  }
119 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [5/18]

TEST_CASE ( "std::forward_list<> container traits"  ,
""  [forward_list][traits] 
)

Definition at line 121 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

122 {
123  typedef std::forward_list<int> Container;
124  SECTION( "Checking container traits" )
125  {
135  }
136 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [6/18]

TEST_CASE ( "std::array<> container traits"  ,
""  [array][traits] 
)

Definition at line 138 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

139 {
140  typedef std::array<int, 10> Container;
141  SECTION( "Checking container traits" )
142  {
152  }
153 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [7/18]

TEST_CASE ( "std::set<> container traits"  ,
""  [set][traits] 
)

Definition at line 155 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

156 {
157  typedef std::set<int> Container;
158  SECTION( "Checking container traits" )
159  {
169  }
170 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [8/18]

TEST_CASE ( "std::multiset<> container traits"  ,
""  [multiset][traits] 
)

Definition at line 172 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

173 {
174  typedef std::multiset<int> Container;
175  SECTION( "Checking container traits" )
176  {
186  }
187 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [9/18]

TEST_CASE ( "std::map<> container traits"  ,
""  [map][traits] 
)

Definition at line 189 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

190 {
191  typedef std::map<int,int> Container;
192  SECTION( "Checking container traits" )
193  {
203  }
204 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [10/18]

TEST_CASE ( "std::multimap<> container traits"  ,
""  [multimap][traits] 
)

Definition at line 206 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

207 {
208  typedef std::multimap<int,int> Container;
209  SECTION( "Checking container traits" )
210  {
220  }
221 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [11/18]

TEST_CASE ( "boost::unordered_set<> container traits"  ,
""  [unordered_set][traits] 
)

Definition at line 223 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

224 {
225  typedef boost::unordered_set<int> Container;
226  SECTION( "Checking container traits" )
227  {
237  }
238 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [12/18]

TEST_CASE ( "boost::unordered_map<> container traits"  ,
""  [unordered_map][traits] 
)

Definition at line 240 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

241 {
242  typedef boost::unordered_map<int,int> Container;
243  SECTION( "Checking container traits" )
244  {
254  }
255 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [13/18]

TEST_CASE ( "boost::unordered_multiset<> container traits"  ,
""  [unordered_multiset][traits] 
)

Definition at line 257 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

258 {
259  typedef boost::unordered_multiset<int> Container;
260  SECTION( "Checking container traits" )
261  {
271  }
272 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [14/18]

TEST_CASE ( "boost::unordered_multimap<> container traits"  ,
""  [unordered_multimap][traits] 
)

Definition at line 274 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

275 {
276  typedef boost::unordered_multimap<int,int> Container;
277  SECTION( "Checking container traits" )
278  {
288  }
289 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [15/18]

TEST_CASE ( "std::unordered_set<> container traits"  ,
""  [unordered_set][traits] 
)

Definition at line 291 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

292 {
293  typedef std::unordered_set<int> Container;
294  SECTION( "Checking container traits" )
295  {
305  }
306 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [16/18]

TEST_CASE ( "std::unordered_multiset<> container traits"  ,
""  [unordered_multiset][traits] 
)

Definition at line 307 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

308 {
309  typedef std::unordered_multiset<int> Container;
310  SECTION( "Checking container traits" )
311  {
321  }
322 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [17/18]

TEST_CASE ( "std::unordered_map<> container traits"  ,
""  [unordered_map][traits] 
)

Definition at line 324 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

325 {
326  typedef std::unordered_map<int,int> Container;
327  SECTION( "Checking container traits" )
328  {
338  }
339 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")

◆ TEST_CASE() [18/18]

TEST_CASE ( "std::unordered_multimap<> container traits"  ,
""  [unordered_multimap][traits] 
)

Definition at line 341 of file testContainerTraits.cpp.

References REQUIRE(), and SECTION().

342 {
343  typedef std::unordered_multimap<int,int> Container;
344  SECTION( "Checking container traits" )
345  {
355  }
356 }
REQUIRE(domain.isInside(aPoint))
SECTION("Testing constant forward iterators")