Ne.app NeANT
The Ne.app NeANT User module of the NeANT distribution.
Macros | Functions
23.list.erase.cpp File Reference
#include <list>
#include <cstddef>
#include <stdexcept>
#include <rw_lists.h>
#include <rw_driver.h>
#include <rw_allocator.h>
#include <rw_char.h>
#include <rw_new.h>
Include dependency graph for 23.list.erase.cpp:

Go to the source code of this file.

Macros

#define Erase(sig)   ListIds::erase_ ## sig
 
#define TEST(str, off, size, res)
 
#define TEST(str, off, res)
 
#define TEST(str, res)
 
#define TEST(str, res)
 
#define TEST(sig)
 
#define TEST(sig)
 

Functions

template<class InputIterator , class Distance >
void _rw_advance (InputIterator &it, Distance dist)
 
template<class InputIterator >
std::size_t _rw_distance (InputIterator first, InputIterator last)
 
template<class T , class Allocator >
void test_erase (T *, Allocator *, const ContainerTestCaseData< T > &tdata)
 
 DEFINE_CONTAINER_TEST_FUNCTIONS (test_erase)
 
int main (int argc, char **argv)
 

Macro Definition Documentation

◆ Erase

#define Erase (   sig)    ListIds::erase_ ## sig

23.list.erase.cpp - test exercising [lib.list::erase]

$Id$

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

Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.

Definition at line 40 of file 23.list.erase.cpp.

◆ TEST [1/6]

#define TEST (   sig)
Value:
{ \
Erase (sig), sig ## _test_cases, \
sizeof sig ## _test_cases / sizeof *sig ## _test_cases \
}

◆ TEST [2/6]

#define TEST (   sig)
Value:
{ \
ListIds::sig ## _void, sig ## _test_cases, \
sizeof sig ## _test_cases / sizeof *sig ## _test_cases \
}

◆ TEST [3/6]

#define TEST (   str,
  off,
  res 
)
Value:
{ \
__LINE__, off, -1, -1, -1, -1, str, sizeof str - 1, \
0, 0, res, sizeof res - 1, 0 }
#define res
Definition 17.names.cpp:531
#define off
Definition 17.names.cpp:507
const char * str
Definition exec.cpp:170

◆ TEST [4/6]

#define TEST (   str,
  off,
  size,
  res 
)
Value:
{ \
__LINE__, off, size, -1, -1, -1, str, sizeof str - 1, \
0, 0, res, sizeof res - 1, 0 }

◆ TEST [5/6]

#define TEST (   str,
  res 
)
Value:
{ \
__LINE__, -1, -1, -1, -1, -1, str, sizeof str - 1, \
0, 0, res, sizeof res - 1, 0 }

◆ TEST [6/6]

#define TEST (   str,
  res 
)
Value:
{ \
__LINE__, -1, -1, -1, -1, -1, str, sizeof str - 1, \
0, 0, res, sizeof res - 1, 0 }

Function Documentation

◆ _rw_advance()

template<class InputIterator , class Distance >
void _rw_advance ( InputIterator &  it,
Distance  dist 
)
inline

Definition at line 248 of file 23.list.erase.cpp.

◆ _rw_distance()

template<class InputIterator >
std::size_t _rw_distance ( InputIterator  first,
InputIterator  last 
)
inline

Definition at line 258 of file 23.list.erase.cpp.

◆ DEFINE_CONTAINER_TEST_FUNCTIONS()

DEFINE_CONTAINER_TEST_FUNCTIONS ( test_erase  )

◆ main()

int main ( int  argc,
char **  argv 
)

Definition at line 468 of file 23.list.erase.cpp.

◆ test_erase()

template<class T , class Allocator >
void test_erase ( T *  ,
Allocator *  ,
const ContainerTestCaseData< T > &  tdata 
)

Definition at line 269 of file 23.list.erase.cpp.