/// <summary>
/// Find dictionary items around the specified key value
/// </summary>
/// <typeparam name="K">
/// The dictionary Key type; must implement <see cref="IComparable<K>"/>
/// </typeparam>
/// <typeparam name="V">
/// The dictionary Value type
/// </typeparam>
/// <param name="dictionary">
/// The dictionary to cut
/// </param>
/// <param name="cutKey">
/// The key value around which to find items in the dictionary
/// </param>
/// <param name="lowItem">
/// On output - value of the immediate predecessor of <paramref name="cutKey"/>; the value's key will always be
/// strictly less than <paramref name="cutKey"/>; if node exists, <code>default(V)</code> is returned
/// (for reference types it's <see langword="null"/>);
/// </param>
/// <param name="highItem">
/// On output - value of the immediate successor of <paramref name="cutKey"/>; the value's key will always be
/// strictly greater than <paramref name="cutKey"/>; if node exists, <code>default(V)</code> is returned
/// (for reference types it's <see langword="null"/>);
/// </param>
/// <returns>
/// <see langword="true"/> if a value with exact same key as <paramref name="cutKey"/> exists in the <paramref name="dictionary"/>;
/// <see langword="false"/> otherwise
/// </returns>
public static bool CutTreeDictionary <K, V>(C5.ISortedDictionary <K, V> dictionary, K cutKey, out V lowItem, out V highItem)
where K : IComparable <K>
{
C5.KeyValuePair <K, V> lowEntry;
C5.KeyValuePair <K, V> highEntry;
bool lowExists;
bool highExists;
bool retval = dictionary.Cut(cutKey, out lowEntry, out lowExists, out highEntry, out highExists);
if (lowExists)
{
lowItem = lowEntry.Value;
}
else
{
lowItem = default(V);
}
if (highExists)
{
highItem = highEntry.Value;
}
else
{
highItem = default(V);
}
return(retval);
}
/// <summary>
/// Weak get value from dictionary by key
/// </summary>
/// <typeparam name="K">
/// The dictionary Key type; must implement <see cref="IComparable<K>"/>
/// </typeparam>
/// <typeparam name="V">
/// The dictionary Value type
/// </typeparam>
/// <param name="dictionary">
/// The dictionary from which to get value
/// </param>
/// <param name="key">
/// The key value
/// </param>
/// <returns>
/// <code>default(V)</code> if the key does not exist in the <paramref name="dictionary"/>
/// otherwise the value with the <paramref name="key"/>
/// </returns>
public static V WeakGetByKey <K, V>(C5.ISortedDictionary <K, V> dictionary, K key)
where K : IComparable <K>
{
V retval = default(V);
dictionary.Find(key, out retval);
return(retval);
}
public static V GetSuccessor <K, V>(C5.ISortedDictionary <K, V> dictionary, K key)
where K : IComparable <K>
{
C5.KeyValuePair <K, V> successor;
V retval;
if (dictionary.TrySuccessor(key, out successor))
{
retval = successor.Value;
}
else
{
retval = default(V);
}
return(retval);
}
