CircularArray.cs :  » Build-Systems » CruiseControl.NET » ThoughtWorks » CruiseControl » Core » Logging » C# / CSharp Open Source

Home
C# / CSharp Open Source
1.2.6.4 mono .net core
2.2.6.4 mono core
3.Aspect Oriented Frameworks
4.Bloggers
5.Build Systems
6.Business Application
7.Charting Reporting Tools
8.Chat Servers
9.Code Coverage Tools
10.Content Management Systems CMS
11.CRM ERP
12.Database
13.Development
14.Email
15.Forum
16.Game
17.GIS
18.GUI
19.IDEs
20.Installers Generators
21.Inversion of Control Dependency Injection
22.Issue Tracking
23.Logging Tools
24.Message
25.Mobile
26.Network Clients
27.Network Servers
28.Office
29.PDF
30.Persistence Frameworks
31.Portals
32.Profilers
33.Project Management
34.RSS RDF
35.Rule Engines
36.Script
37.Search Engines
38.Sound Audio
39.Source Control
40.SQL Clients
41.Template Engines
42.Testing
43.UML
44.Web Frameworks
45.Web Service
46.Web Testing
47.Wiki Engines
48.Windows Presentation Foundation
49.Workflows
50.XML Parsers
C# / C Sharp
C# / C Sharp by API
C# / CSharp Tutorial
C# / CSharp Open Source » Build Systems » CruiseControl.NET 
CruiseControl.NET » ThoughtWorks » CruiseControl » Core » Logging » CircularArray.cs

using System;
using System.Collections;
using System.Text;

namespace ThoughtWorks.CruiseControl.Core.Logging{
  public class CircularArray : IEnumerable
  {
    private const int AssumedAverageLineLength = 80;
    private static readonly EnumeratorDirection DefaultDirection = EnumeratorDirection.Forward;
    private int currentIndex = 0;
    private object[] items;
    private bool isFull;

    public CircularArray(int capacity)
    {
      this.items = new object[capacity];
    }

    public void Add(object item)
    {
      items[currentIndex] = item;
      currentIndex = IncrementIndex(currentIndex);
    }

    public object this[int index]
    {
      get { return items[index]; }
    }

    private int IncrementIndex(int index)
    {
      int nextIndex = (index + 1)%items.Length;
      if (nextIndex == 0) isFull = true;
      return nextIndex;
    }

    public override string ToString()
    {
      return ToString(DefaultDirection);
    }

    public string ToString(EnumeratorDirection direction)
    {
      StringBuilder builder = new StringBuilder(items.GetUpperBound(0)*AssumedAverageLineLength);
      IEnumerator enumerator = new CircularArrayEnumerator(this, direction);
      while (enumerator.MoveNext())
      {
        if (builder.Length > 0) builder.Append(Environment.NewLine);
        builder.Append(enumerator.Current);
      }
      return builder.ToString();
    }

    public IEnumerator GetEnumerator()
    {
      return new CircularArrayEnumerator(this, DefaultDirection);
    }
  
    internal class CircularArrayEnumerator : IEnumerator
    {
      private const int InitialIndex = -1;
      private readonly CircularArray array;
      private readonly EnumeratorDirection direction;
      private int index = InitialIndex;

      public CircularArrayEnumerator(CircularArray array, EnumeratorDirection direction)
      {
        this.array = array;
        this.direction = direction;
      }

      public bool MoveNext()
      {
        if (array.currentIndex == 0 && ! array.isFull) return false;  // array is empty
        if (index == InitialIndex)
        {
          index = StartIndex();
          return true;
        }

        if (direction == EnumeratorDirection.Backward)
        {
          index = Decrement(index);
          return index != StartIndex();          
        }
        else
        {
          index = Increment(index);
          return index != StartIndex();                    
        }
      }

      private int StartIndex()
      {
        return (direction == EnumeratorDirection.Backward) ? Decrement(array.currentIndex) : Increment(array.currentIndex - 1);
      }

      private int Increment(int index)
      {
        if (! array.isFull && index == array.currentIndex - 1) return 0;
        return (index + 1) % array.items.Length;
      }

      private int Decrement(int currentIndex)
      {
        if (! array.isFull && currentIndex == 0) return array.currentIndex - 1;
        return (currentIndex - 1 + array.items.Length) % array.items.Length;
      }

      public void Reset()
      {
        throw new NotImplementedException();
      }

      public object Current
      {
        get { return array[index]; }
      }
    }
  }
}
www.java2v.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.