interlace /source/library/Interlace/AdornedText/Spans/SequenceSpan.cs

Language C# Lines 105
MD5 Hash 6e230344a14dccfa6651de51947f0e2a Estimated Cost $1,458 (why?)
Repository https://bitbucket.org/VahidN/interlace.git View Raw File View Project SPDX
  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
102
103
104
#region Using Directives and Copyright Notice

// Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
// All rights reserved.
// 
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//     * Redistributions of source code must retain the above copyright
//       notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above copyright
//       notice, this list of conditions and the following disclaimer in the
//       documentation and/or other materials provided with the distribution.
//     * Neither the name of the Computer Consultancy Pty Ltd nor the
//       names of its contributors may be used to endorse or promote products
//       derived from this software without specific prior written permission.
// 
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" 
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 
// ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE 
// FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 
// DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR 
// SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER 
// CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 
// LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 
// OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
// DAMAGE.

using System;
using System.Collections.Generic;
using System.Collections.ObjectModel;
using System.Text;

using Interlace.Collections;

#endregion

namespace Interlace.AdornedText
{
    public class SequenceSpan : Span, ISpanContainer
    {
        TrackedCollection<Span> _spans;

        public SequenceSpan()
        {
            _spans = new TrackedCollection<Span>();
            _spans.Added += new EventHandler<TrackedCollectionEventArgs<Span>>(_spans_Added);
            _spans.Removed += new EventHandler<TrackedCollectionEventArgs<Span>>(_spans_Removed);
        }

        void _spans_Added(object sender, TrackedCollectionEventArgs<Span> e)
        {
            e.Item.Parent = this;
        }

        void _spans_Removed(object sender, TrackedCollectionEventArgs<Span> e)
        {
            e.Item.Parent = null;
        }

        public IEnumerable<Span> ContainedSpans
        {
            get { return _spans; }
        }

        public void ReplaceSpan(Span existingSpan, Span replacementSpan)
        {
            int index = _spans.IndexOf(existingSpan);

            if (index == -1) throw new ArgumentException("The existing span is not contained in this container.", "existingSpan");

            if (replacementSpan != null)
            {
                _spans[index] = replacementSpan;
            }
            else
            {
                _spans.RemoveAt(index);
            }
        }

        public Collection<Span> Spans
        {
            get { return _spans; }
        }

        public Block Block
        {
            get
            {
                return Parent.Block;
            }
        }

        public override void Visit(NodeVisitor visitor)
        {
            visitor.VisitSequenceSpan(this);

            foreach (Span item in _spans) item.Visit(visitor);

            base.Visit(visitor);
        }
    }
}
Back to Top