|
/********************************************************************************
* This file is part of NRtfTree.
*
* NRtfTree 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 2 of the License, or
* (at your option) any later version.
*
* NRtfTree 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 NRtfTree; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
********************************************************************************/
/********************************************************************************
* Library: NRtfTree
* Version: v0.2.1
* Class: ImageNode
* Copyright: 2005 Salvador Gomez
* Home Page: http://www.sgoliver.net
* SF Project: http://nrtftree.sourceforge.net
* http://sourceforge.net/projects/nrtftree
* Date: 10/12/2006
* Description: Colecci�n de nodos de un �rbol RTF.
* ******************************************************************************/
using System;
using System.Collections;
namespace Net.Sgoliver.NRtfTree
{
namespace Core
{
/// <summary>
/// Colecci�n de nodos de un documento RTF.
/// </summary>
public class RtfNodeCollection : CollectionBase
{
#region M�todos Publicos
/// <summary>
/// A�ade un nuevo nodo a la colecci�n actual.
/// </summary>
/// <param name="node">Nuevo nodo a a�adir.</param>
/// <returns>Posici�n en la que se ha insertado el nuevo nodo.</returns>
public int Add(RtfTreeNode node)
{
InnerList.Add(node);
return (InnerList.Count - 1);
}
/// <summary>
/// Indizador de la clase RtfNodeCollection.
/// Devuelve el nodo que ocupa la posici�n 'index' dentro de la colecci�n.
/// </summary>
public RtfTreeNode this[int index]
{
get
{
return (RtfTreeNode)InnerList[index];
}
set
{
InnerList[index] = value;
}
}
/// <summary>
/// Devuelve el �ndice del nodo pasado como par�metro dentro de la lista de nodos de la colecci�n.
/// </summary>
/// <param name="node">Nodo a buscar en la colecci�n.</param>
/// <returns>Indice del nodo buscado. Devolver� el valor -1 en caso de no encontrarse el nodo dentro de la colecci�n.</returns>
public int IndexOf(RtfTreeNode node)
{
return InnerList.IndexOf(node);
}
/// <summary>
/// A�ade al final de la colecci�n una nueva lista de nodos.
/// </summary>
/// <param name="collection">Nueva lista de nodos a a�adir a la colecci�n actual.</param>
public void AddRange(RtfNodeCollection collection)
{
InnerList.AddRange(collection);
}
#endregion
}
}
}
|
By viewing downloads associated with this article you agree to the Terms of Service and the article's licence.
If a file you wish to view isn't highlighted, and is a text file (not binary), please
let us know and we'll add colourisation support for it.