File: count_allocator.hpp

package info (click to toggle)
boost1.83 1.83.0-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 545,632 kB
  • sloc: cpp: 3,857,086; xml: 125,552; ansic: 34,414; python: 25,887; asm: 5,276; sh: 4,799; ada: 1,681; makefile: 1,629; perl: 1,212; pascal: 1,139; sql: 810; yacc: 478; ruby: 102; lisp: 24; csh: 6
file content (61 lines) | stat: -rw-r--r-- 1,692 bytes parent folder | download | duplicates (11)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
/* Used in Boost.MultiIndex tests.
 *
 * Copyright 2003-2020 Joaquin M Lopez Munoz.
 * Distributed under the Boost Software License, Version 1.0.
 * (See accompanying file LICENSE_1_0.txt or copy at
 * http://www.boost.org/LICENSE_1_0.txt)
 *
 * See http://www.boost.org/libs/multi_index for library home page.
 */

#ifndef BOOST_MULTI_INDEX_TEST_COUNT_ALLOCATOR_HPP
#define BOOST_MULTI_INDEX_TEST_COUNT_ALLOCATOR_HPP

#include <boost/config.hpp> /* keep it first to prevent nasty warns in MSVC */
#include <memory>

template<typename T>
struct count_allocator:std::allocator<T>
{
  typedef std::allocator<T> super;
  template<class U>
  struct rebind{typedef count_allocator<U> other;};

  count_allocator(std::size_t& element_count,std::size_t& allocator_count):
    pelement_count(&element_count),pallocator_count(&allocator_count)
    {++(*pallocator_count);}
  count_allocator(const count_allocator<T>& x):
    super(x),
    pelement_count(x.pelement_count),pallocator_count(x.pallocator_count)
    {++(*pallocator_count);}
  template<class U>count_allocator(const count_allocator<U>& x):
    super(x),
    pelement_count(x.pelement_count),pallocator_count(x.pallocator_count)
    {++(*pallocator_count);}
  ~count_allocator()
    {--(*pallocator_count);}

  count_allocator& operator=(const count_allocator<T>& x)
  {
    pelement_count=x.pelement_count;
    pallocator_count=x.pallocator_count;
    return *this;
  }

  T* allocate(std::size_t n)
  {
    *pelement_count+=n;
    return super::allocate(n);
  }

  void deallocate(T* p,std::size_t n)
  {
    super::deallocate(p,n);
    *pelement_count-=n;
  }

  std::size_t* pelement_count;
  std::size_t* pallocator_count;
};

#endif