1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279
|
// Permission is hereby granted, free of charge, to any person obtaining
// a copy of this software and associated documentation files (the
// "Software"), to deal in the Software without restriction, including
// without limitation the rights to use, copy, modify, merge, publish,
// distribute, sublicense, and/or sell copies of the Software, and to
// permit persons to whom the Software is furnished to do so, subject to
// the following conditions:
//
// The above copyright notice and this permission notice shall be
// included in all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
// EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
// NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
// LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
// OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
//
// Copyright (c) 2008 Novell, Inc.
//
// Authors:
// Andreia Gaita (avidigal@novell.com)
//
using System;
using System.Collections;
using Mono.WebBrowser;
using Mono.WebBrowser.DOM;
namespace Mono.Mozilla.DOM
{
internal class WindowCollection : DOMObject, IWindowCollection
{
protected nsIDOMWindowCollection unmanagedWindows;
protected IWindow [] windows;
protected int windowCount;
public WindowCollection (WebBrowser control, nsIDOMWindowCollection windowCol) : base (control)
{
if (control.platform != control.enginePlatform)
unmanagedWindows = nsDOMWindowCollection.GetProxy (control, windowCol);
else
unmanagedWindows = windowCol;
}
public WindowCollection (WebBrowser control) : base (control)
{
windows = new Window[0];
}
#region IDisposable Members
protected override void Dispose (bool disposing)
{
if (!disposed) {
if (disposing) {
Clear ();
}
}
base.Dispose(disposing);
}
#endregion
#region Helpers
protected void Clear ()
{
if (windows != null) {
for (int i = 0; i < windowCount; i++) {
windows[i] = null;
}
windowCount = 0;
windows = null;
}
}
internal void Load ()
{
Clear ();
uint count;
unmanagedWindows.getLength (out count);
Window[] tmpwindows = new Window[count];
for (int i = 0; i < count;i++) {
nsIDOMWindow window;
unmanagedWindows.item ((uint)i, out window);
tmpwindows[windowCount++] = new Window (control, (nsIDOMWindow)window);
}
windows = new Window[windowCount];
Array.Copy (tmpwindows, windows, windowCount);
}
#endregion
#region IEnumerable members
public IEnumerator GetEnumerator ()
{
return new WindowEnumerator (this);
}
#endregion
#region ICollection members
public void CopyTo (Array dest, int index)
{
if (windows != null) {
Array.Copy (windows, 0, dest, index, windowCount);
}
}
public int Count {
get {
if (unmanagedWindows != null && windows == null)
Load ();
return windowCount;
}
}
object ICollection.SyncRoot {
get { return this; }
}
bool ICollection.IsSynchronized {
get { return false; }
}
#endregion
#region IList members
public bool IsReadOnly
{
get { return false;}
}
bool IList.IsFixedSize
{
get { return false;}
}
void IList.RemoveAt (int index)
{
RemoveAt (index);
}
public void RemoveAt (int index)
{
if (index > windowCount || index < 0)
return;
Array.Copy (windows, index + 1, windows, index, (windowCount - index) - 1);
windowCount--;
windows[windowCount] = null;
}
public void Remove (IWindow window)
{
this.RemoveAt (IndexOf (window));
}
void IList.Remove (object window)
{
Remove (window as IWindow);
}
public void Insert (int index, IWindow value)
{
if (index > windowCount)
index = windowCount;
IWindow[] tmp = new Window[windowCount+1];
if (index > 0)
Array.Copy (windows, 0, tmp, 0, index);
tmp[index] = value;
if (index < windowCount)
Array.Copy (windows, index, tmp, index + 1, (windowCount - index));
windows = tmp;
windowCount++;
}
void IList.Insert (int index, object value)
{
this.Insert (index, value as IWindow);
}
public int IndexOf (IWindow window)
{
return Array.IndexOf (windows, window);
}
int IList.IndexOf (object window)
{
return IndexOf (window as IWindow);
}
public bool Contains (IWindow window)
{
return this.IndexOf (window) != -1;
}
bool IList.Contains (object window)
{
return Contains (window as IWindow);
}
void IList.Clear ()
{
this.Clear ();
}
public int Add (IWindow window)
{
this.Insert (windowCount + 1, window as IWindow);
return windowCount - 1;
}
int IList.Add (object window)
{
return Add (window as IWindow);
}
object IList.this [int index] {
get {
return this [index];
}
set {
this [index] = value as IWindow;
}
}
public IWindow this [int index] {
get {
if (index < 0 || index >= windowCount)
throw new ArgumentOutOfRangeException ("index");
return windows [index];
}
set {
if (index < 0 || index >= windowCount)
throw new ArgumentOutOfRangeException ("index");
windows [index] = value as IWindow;
}
}
#endregion
public override int GetHashCode () {
if (this.unmanagedWindows != null)
return this.unmanagedWindows.GetHashCode ();
return base.GetHashCode ();
}
internal class WindowEnumerator : IEnumerator {
private WindowCollection collection;
private int index = -1;
public WindowEnumerator (WindowCollection collection)
{
this.collection = collection;
}
public object Current {
get {
if (index == -1)
return null;
return collection [index];
}
}
public bool MoveNext ()
{
if (index + 1 >= collection.Count)
return false;
index++;
return true;
}
public void Reset ()
{
index = -1;
}
}
}
}
|