PageRenderTime 44ms CodeModel.GetById 18ms RepoModel.GetById 0ms app.codeStats 0ms

/source/library/Interlace/AdornedText/Blocks/BlockSequence.cs

https://bitbucket.org/VahidN/interlace
C# | 91 lines | 51 code | 15 blank | 25 comment | 4 complexity | 354d58d8c21c611c511e9d9bfd0506e4 MD5 | raw file
  1. #region Using Directives and Copyright Notice
  2. // Copyright (c) 2007-2010, Computer Consultancy Pty Ltd
  3. // All rights reserved.
  4. //
  5. // Redistribution and use in source and binary forms, with or without
  6. // modification, are permitted provided that the following conditions are met:
  7. // * Redistributions of source code must retain the above copyright
  8. // notice, this list of conditions and the following disclaimer.
  9. // * Redistributions in binary form must reproduce the above copyright
  10. // notice, this list of conditions and the following disclaimer in the
  11. // documentation and/or other materials provided with the distribution.
  12. // * Neither the name of the Computer Consultancy Pty Ltd nor the
  13. // names of its contributors may be used to endorse or promote products
  14. // derived from this software without specific prior written permission.
  15. //
  16. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
  17. // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  18. // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  19. // ARE DISCLAIMED. IN NO EVENT SHALL COMPUTER CONSULTANCY PTY LTD BE LIABLE
  20. // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  21. // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
  22. // SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  23. // CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  24. // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  25. // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH
  26. // DAMAGE.
  27. using System;
  28. using System.Collections.Generic;
  29. using System.ComponentModel;
  30. using System.Text;
  31. using Interlace.Collections;
  32. #endregion
  33. namespace Interlace.AdornedText
  34. {
  35. public class BlockSequence : Block
  36. {
  37. TrackedBindingList<Block> _blocks;
  38. public BlockSequence()
  39. {
  40. _blocks = new TrackedBindingList<Block>();
  41. _blocks.Added += new EventHandler<TrackedBindingListEventArgs<Block>>(_blocks_Added);
  42. _blocks.Removed += new EventHandler<TrackedBindingListEventArgs<Block>>(_blocks_Removed);
  43. }
  44. void _blocks_Added(object sender, TrackedBindingListEventArgs<Block> e)
  45. {
  46. e.Item.Parent = this;
  47. }
  48. void _blocks_Removed(object sender, TrackedBindingListEventArgs<Block> e)
  49. {
  50. e.Item.Parent = null;
  51. }
  52. public IList<Block> Blocks
  53. {
  54. get { return _blocks; }
  55. }
  56. public void ReplaceBlock(Block existingBlock, Block replacementBlockOrNull)
  57. {
  58. int index = _blocks.IndexOf(existingBlock);
  59. if (index == -1) throw new ArgumentException("The existing block does not exist in the block sequence.", "existingBlock");
  60. if (replacementBlockOrNull == null)
  61. {
  62. _blocks.RemoveAt(index);
  63. }
  64. else
  65. {
  66. _blocks[index] = replacementBlockOrNull;
  67. }
  68. }
  69. public override void Visit(NodeVisitor visitor)
  70. {
  71. visitor.VisitBlockSequence(this);
  72. foreach (Block block in _blocks) block.Visit(visitor);
  73. base.Visit(visitor);
  74. }
  75. }
  76. }