File: AllocateIterator.hpp

package info (click to toggle)
bedops 2.4.41%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 21,148 kB
  • sloc: ansic: 28,562; cpp: 15,359; sh: 2,704; makefile: 2,687; xml: 1,669; python: 1,582; csh: 823; perl: 365; java: 172
file content (101 lines) | stat: -rw-r--r-- 2,875 bytes parent folder | download | duplicates (2)
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
/*
  Author:  Shane Neph & Scott Kuehn
  Date:    Tue Aug 28 09:36:24 PDT 2007
*/
//
//    BEDOPS
//    Copyright (C) 2011-2022 Shane Neph, Scott Kuehn and Alex Reynolds
//
//    This program is free software; you can redistribute it and/or modify
//    it under the terms of the GNU General Public License as published by
//    the Free Software Foundation; either version 2 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, write to the Free Software Foundation, Inc.,
//    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
//

#ifndef SPECIAL_ALLOCATE_NEW_ITERATOR_HPP
#define SPECIAL_ALLOCATE_NEW_ITERATOR_HPP

#include <iterator>
#include <cstddef>
#include <cstdio>

namespace Ext {

  template <class _Tp>
  class allocate_iterator;

  template <class _Tp>
  class allocate_iterator<_Tp*> {

  public:
    typedef std::forward_iterator_tag iterator_category;
    typedef _Tp*                      value_type;
    typedef std::ptrdiff_t            difference_type;
    typedef _Tp**                     pointer;
    typedef _Tp*&                     reference;

    allocate_iterator() : _M_ok(false), fp_(NULL), _M_value(0) {}
    allocate_iterator(FILE* fp) /* this ASSUMES fp is open and meaningful */
      : _M_ok(fp && !std::feof(fp)), fp_(fp), _M_value(_M_ok ? new _Tp(fp) : 0)
      {
        _M_ok = (_M_ok && fp && !std::feof(fp));
        if ( !_M_ok && fp_ )
          fp_ = NULL;
      }

    reference operator*() { return _M_value; }
    pointer operator->() { return &(operator*()); }

    allocate_iterator& operator++() { 
      if ( _M_ok ) {
        _M_value = (new _Tp(fp_));
        _M_ok = !std::feof(fp_);
      }
      return *this;
    }

    allocate_iterator operator++(int)  {
      allocate_iterator __tmp = *this;
      if ( _M_ok ) {
        _M_value = (new _Tp(fp_));
        _M_ok = !std::feof(fp_);
      }
      return __tmp;
    }

    bool _M_equal(const allocate_iterator& __x) const
      { return ( (_M_ok == __x._M_ok) && (!_M_ok || fp_ == __x.fp_) ); }


  private:
    bool _M_ok;
    FILE* fp_;
    _Tp* _M_value;
  };

  template <class _Tp>
  inline bool 
  operator==(const allocate_iterator<_Tp>& __x,
             const allocate_iterator<_Tp>& __y) {
    return __x._M_equal(__y);
  }

  template <class _Tp>
  inline bool 
  operator!=(const allocate_iterator<_Tp>& __x,
             const allocate_iterator<_Tp>& __y) {
    return !__x._M_equal(__y);
  }

} // namespace Ext

#endif // SPECIAL_ALLOCATE_NEW_ITERATOR_HPP