File: segmentlist.h

package info (click to toggle)
musescore3 3.2.3%2Bdfsg2-11
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 210,672 kB
  • sloc: cpp: 291,093; xml: 200,238; sh: 3,779; ansic: 1,447; python: 393; makefile: 240; perl: 82; pascal: 79
file content (82 lines) | stat: -rw-r--r-- 2,727 bytes parent folder | download | duplicates (4)
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
//=============================================================================
//  MuseScore
//  Music Composition & Notation
//
//  Copyright (C) 2011 Werner Schweer
//
//  This program is free software; you can redistribute it and/or modify
//  it under the terms of the GNU General Public License version 2
//  as published by the Free Software Foundation and appearing in
//  the file LICENCE.GPL
//=============================================================================

#ifndef __SEGMENTLIST_H__
#define __SEGMENTLIST_H__

#include "segment.h"

namespace Ms {

class Segment;

//---------------------------------------------------------
//   SegmentList
//---------------------------------------------------------

class SegmentList {
      Segment* _first;        ///< First item of segment list
      Segment* _last;         ///< Last item of segment list
      int _size;              ///< Number of items in segment list

   public:
      SegmentList()                        { clear(); }
      void clear()                         { _first = _last = 0; _size = 0; }
#ifndef NDEBUG
      void check();
#else
      void check() {}
#endif
      SegmentList clone() const;
      int size() const                     { return _size;        }

      Segment* first() const               { return _first;       }
      Segment* first(SegmentType) const;
      Segment* first(ElementFlag) const;

      Segment* last() const                { return _last;        }
      Segment* firstCRSegment() const;
      void remove(Segment*);
      void push_back(Segment*);
      void push_front(Segment*);
      void insert(Segment* e, Segment* el);  // insert e before el

      class iterator {
            Segment* p;
         public:
            iterator(Segment* s) { p = s; }
            iterator operator++() { iterator i(p); p = p->next(); return i; }
            bool operator !=(const iterator& i) const { return p != i.p; }
            Segment& operator*() { return *p; }
            };
      class const_iterator {
            const Segment* p;
         public:
            const_iterator(const Segment* s) { p = s; }
            const_iterator operator++() { const_iterator i(p); p = p->next(); return i; }
            bool operator !=(const const_iterator& i) const { return p != i.p; }
            const Segment& operator*() const { return *p; }
            };

      iterator begin()             { return _first; }
      iterator end()               { return 0; }
      const_iterator begin() const { return _first; }
      const_iterator end() const   { return 0; }
      };

// Segment* begin(SegmentList& l) { return l.first(); }
// Segment* end(SegmentList&) { return 0; }


}     // namespace Ms
#endif