corrade-vassal – Rev 1
?pathlinks?
/*
* Copyright (c) 2006-2014, openmetaverse.org
* All rights reserved.
*
* - Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* - Redistributions of source code must retain the above copyright notice, this
* list of conditions and the following disclaimer.
* - Neither the name of the openmetaverse.org nor the names
* of its contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*/
using System;
using System.Collections.Generic;
using System.Text;
namespace OpenMetaverse
{
public class InventoryNodeDictionary: IComparer<UUID>
{
protected SortedDictionary<UUID, InventoryNode> SDictionary;
protected Dictionary<UUID, InventoryNode> Dictionary = new Dictionary<UUID, InventoryNode>();
protected InventoryNode parent;
protected object syncRoot = new object();
public int Compare(UUID id1, UUID id2)
{
InventoryNode n1 = Get(id1);
InventoryNode n2 = Get(id2);
int diff = NullCompare(n1, n2);
if (diff != 0) return diff;
if (n1 == null) return id1.CompareTo(id2);
DateTime t1 = n1.ModifyTime;
DateTime t2 = n2.ModifyTime;
diff = t1.CompareTo(t2);
if (diff != 0) return diff;
var d1 = n1.Data;
var d2 = n2.Data;
diff = NullCompare(d1, d2);
if (diff != 0) return diff;
if (d1 != null)
{
diff = NullCompare(d1.Name, d2.Name);
if (diff != 0) return diff;
if (d1.Name != null)
{
// both are not null.. due to NullCoimpare code
diff = d1.Name.CompareTo(d2.Name);
if (diff != 0) return diff;
}
}
return id1.CompareTo(id2);
}
private InventoryNode Get(UUID uuid)
{
InventoryNode val;
if (Dictionary.TryGetValue(uuid, out val))
{
return val;
}
return null;
}
static int NullCompare(object o1, object o2)
{
return ReferenceEquals(o1, null).CompareTo(ReferenceEquals(o2, null));
}
public InventoryNode Parent
{
get { return parent; }
set { parent = value; }
}
public object SyncRoot { get { return syncRoot; } }
public int Count { get { return Dictionary.Count; } }
public InventoryNodeDictionary(InventoryNode parentNode)
{
if (Settings.SORT_INVENTORY) SDictionary = new SortedDictionary<UUID, InventoryNode>(this);
parent = parentNode;
}
public InventoryNode this[UUID key]
{
get { return (InventoryNode)this.Dictionary[key]; }
set
{
value.Parent = parent;
lock (syncRoot)
{
Dictionary[key] = value;
if (Settings.SORT_INVENTORY) this.SDictionary[key] = value;
}
}
}
public ICollection<UUID> Keys
{
get
{
if (Settings.SORT_INVENTORY) return this.SDictionary.Keys;
return Dictionary.Keys;
}
}
public ICollection<InventoryNode> Values
{
get
{
if (Settings.SORT_INVENTORY) return this.SDictionary.Values;
return this.Dictionary.Values;
}
}
public void Add(UUID key, InventoryNode value)
{
value.Parent = parent;
lock (syncRoot)
{
Dictionary[key] = value;
if (Settings.SORT_INVENTORY) this.SDictionary.Add(key, value);
}
}
public void Remove(UUID key)
{
lock (syncRoot)
{
this.Dictionary.Remove(key);
if (Settings.SORT_INVENTORY) this.SDictionary.Remove(key);
}
}
public bool Contains(UUID key)
{
return this.Dictionary.ContainsKey(key);
}
internal void Sort()
{
if (Settings.SORT_INVENTORY)
{
// TODO resort SDictionary now that more data has come?
}
}
}
}