|
1 /* |
|
2 * Copyright (c) 2010 Nokia Corporation and/or its subsidiary(-ies). |
|
3 * All rights reserved. |
|
4 * |
|
5 * Redistribution and use in source and binary forms, with or without |
|
6 * modification, are permitted provided that the following conditions are met: |
|
7 * |
|
8 * - Redistributions of source code must retain the above copyright notice, |
|
9 * this list of conditions and the following disclaimer. |
|
10 * - Redistributions in binary form must reproduce the above copyright notice, |
|
11 * this list of conditions and the following disclaimer in the documentation |
|
12 * and/or other materials provided with the distribution. |
|
13 * - Neither the name of Nokia Corporation nor the names of its contributors |
|
14 * may be used to endorse or promote products derived from this software |
|
15 * without specific prior written permission. |
|
16 * |
|
17 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
18 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
21 * LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
22 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
23 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
24 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
25 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
26 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
27 * POSSIBILITY OF SUCH DAMAGE. |
|
28 * |
|
29 * Initial Contributors: |
|
30 * Nokia Corporation - initial contribution. |
|
31 * |
|
32 * Contributors: |
|
33 * |
|
34 * Description: |
|
35 * |
|
36 */ |
|
37 |
|
38 using System; |
|
39 using System.Text; |
|
40 using System.Collections; |
|
41 using System.Collections.Generic; |
|
42 using HeapLib.Cells; |
|
43 |
|
44 namespace HeapLib.Array |
|
45 { |
|
46 public class HeapCellArrayUnsorted : HeapCellArrayBase |
|
47 { |
|
48 #region Constructors & destructor |
|
49 public HeapCellArrayUnsorted() |
|
50 : this( 100 ) |
|
51 { |
|
52 } |
|
53 |
|
54 public HeapCellArrayUnsorted( HeapCellArrayBase aCopyFrom ) |
|
55 : this( aCopyFrom.Count ) |
|
56 { |
|
57 foreach ( HeapCell cell in aCopyFrom ) |
|
58 { |
|
59 Add( cell ); |
|
60 } |
|
61 } |
|
62 |
|
63 public HeapCellArrayUnsorted( int aGranularity ) |
|
64 { |
|
65 iItems = new List< HeapCell >( aGranularity ); |
|
66 } |
|
67 #endregion |
|
68 |
|
69 #region API |
|
70 public override void Clear() |
|
71 { |
|
72 iItems.Clear(); |
|
73 } |
|
74 |
|
75 public override void Add( HeapCell aCell ) |
|
76 { |
|
77 iItems.Add( aCell ); |
|
78 } |
|
79 |
|
80 public override void Remove( HeapCell aCell ) |
|
81 { |
|
82 int index = CellIndex( aCell ); |
|
83 if ( index >= 0 ) |
|
84 { |
|
85 iItems.RemoveAt( index ); |
|
86 } |
|
87 } |
|
88 |
|
89 public override int CellIndex( HeapCell aCell ) |
|
90 { |
|
91 int index = iItems.IndexOf( aCell ); |
|
92 return index; |
|
93 } |
|
94 #endregion |
|
95 |
|
96 #region Properties |
|
97 public override int Count |
|
98 { |
|
99 get { return iItems.Count; } |
|
100 } |
|
101 |
|
102 public override HeapCell this[ int aIndex ] |
|
103 { |
|
104 get |
|
105 { |
|
106 HeapCell ret = iItems[ aIndex ]; |
|
107 return ret; |
|
108 } |
|
109 } |
|
110 #endregion |
|
111 |
|
112 #region Data members |
|
113 private List< HeapCell > iItems = new List< HeapCell >(); |
|
114 #endregion |
|
115 } |
|
116 } |