source: branches/HeuristicLab.Problems.GPDL/HeuristicLab.Grammars/3.3/Sequence.cs @ 10051

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2013 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
 *
 * This file is part of HeuristicLab.
 *
 * HeuristicLab 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 3 of the License, or
 * (at your option) any later version.
 *
 * HeuristicLab 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 HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
 */
#endregion

using System.Collections.Generic;
using System.Linq;
using System.Text;
using HeuristicLab.PluginInfrastructure;

namespace HeuristicLab.Grammars {
  public class Sequence : List<ISymbol> {
    public Sequence()
      : base() {
    }

    public Sequence(IEnumerable<ISymbol> seq)
      : base() {
      this.AddRange(seq);
    }
    public IEnumerator<ISymbol> GetEnumerator() {
      return (IEnumerator<ISymbol>)base.GetEnumerator();
    }

    public override bool Equals(object obj) {
      if (obj == this) return true;
      Sequence other = obj as Sequence;
      if (other == null || Count != other.Count) return false;
      return this.SequenceEqual(other);
    }

    public override int GetHashCode() {
      return this.Aggregate(0, (h, s) => h + s.GetHashCode());
    }

    public override string ToString() {
      var b = new StringBuilder();
      ForEach(s => b.AppendFormat("{0} ", s));
      return b.ToString();
    }
  }
}