#region License Information
/* HeuristicLab
* Copyright (C) 2002-2008 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 .
*/
#endregion
using System;
using System.Collections.Generic;
using System.Text;
using System.Xml;
using HeuristicLab.Data;
namespace HeuristicLab.Permutation {
///
/// The base class for a permutation, which is an ordered combination.
///
public class Permutation : IntArrayData {
///
/// Initializes a new instance of .
///
public Permutation()
: base() {
}
///
/// Initializes a new instance of with the given
/// array.
///
/// The permutation array to assign.
public Permutation(int[] permutation)
: base(permutation) {
}
///
/// Clones the current instance.
///
/// A dictionary of all already cloned objects. (Needed to
/// avoid cycles.)
/// The cloned object as .
public override object Clone(IDictionary clonedObjects) {
Permutation clone = new Permutation((int[])Data.Clone());
clonedObjects.Add(Guid, clone);
return clone;
}
}
}