mcs/class/Mono.CodeContracts/Mono.CodeContracts.Static.DataStructures.Patricia/LeafNode.cs

   1 //
   2 // LeafNode.cs
   3 //
   4 // Authors:
   5 //      Alexander Chebaturkin (chebaturkin@gmail.com)
   6 //
   7 // Copyright (C) 2012 Alexander Chebaturkin
   8 //
   9 // Permission is hereby granted, free of charge, to any person obtaining
  10 // a copy of this software and associated documentation files (the
  11 // "Software"), to deal in the Software without restriction, including
  12 // without limitation the rights to use, copy, modify, merge, publish,
  13 // distribute, sublicense, and/or sell copies of the Software, and to
  14 // permit persons to whom the Software is furnished to do so, subject to
  15 // the following conditions:
  16 //
  17 // The above copyright notice and this permission notice shall be
  18 // included in all copies or substantial portions of the Software.
  19 //
  20 // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  21 // EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  22 // MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  23 // NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
  24 // LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
  25 // OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
  26 // WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  27 //
  28
  29 using System;
  30 using System.Collections.Generic;
  31 using System.IO;
  32 using System.Text;
  33
  34 namespace Mono.CodeContracts.Static.DataStructures.Patricia
  35 {
  36         public class LeafNode<T> : PatriciaTrieNode<T>
  37     {
  38         private readonly int _key;
  39
  40         public override bool Contains(int key)
  41         {
  42             return key == _key;
  43         }
  44
  45         public override int Key { get { return _key; } }
  46         public override int Count { get { return 1; } }
  47         public T Value { get; private set; }
  48
  49         public LeafNode(int key, T value)
  50         {
  51             _key = key;
  52             Value = value;
  53         }
  54
  55         public override IImmutableIntMap<T> Add(int key, T value)
  56         {
  57             if (key == Key)
  58                 return new LeafNode<T>(key, value);
  59
  60             return Join(new LeafNode<T>(key, value), this);
  61         }
  62
  63         public override IImmutableIntMap<T> Remove(int key)
  64         {
  65             if (key == this.Key)
  66                 return EmptyNode<T>.Instance;
  67
  68             return this;
  69         }
  70
  71         public override void Visit(Action<T> action)
  72         {
  73             action(Value);
  74         }
  75
  76         public override void Visit(Action<int, T> action)
  77         {
  78             action(Key, Value);
  79         }
  80
  81         protected internal override void FillKeysTo(List<int> list)
  82         {
  83             list.Add(_key);
  84         }
  85
  86         protected internal override void FillValuesTo(List<T> list)
  87         {
  88             list.Add(Value);
  89         }
  90
  91         protected internal override void AppendToBuilder(StringBuilder sb)
  92         {
  93             sb.AppendFormat("{0}->'{1}' ", _key, Value);
  94         }
  95
  96         protected internal override void Dump(TextWriter tw, string prefix)
  97         {
  98             tw.WriteLine(prefix + "<Leaf Key={0} Value='{1}' />", _key, Value);
  99         }
 100
 101         public override T Lookup(int key)
 102         {
 103             return key == _key ? Value : default(T);
 104         }
 105     }
 106 }