forked from jasder/antlr
67 lines
2.5 KiB
C#
67 lines
2.5 KiB
C#
/*
|
|
* [The "BSD license"]
|
|
* Copyright (c) 2013 Terence Parr
|
|
* Copyright (c) 2013 Sam Harwell
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
*
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. The name of the author may not be used to endorse or promote products
|
|
* derived from this software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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 Antlr4.Runtime.Misc;
|
|
using Sharpen;
|
|
|
|
namespace Antlr4.Runtime.Misc
|
|
{
|
|
[System.Serializable]
|
|
public class MultiMap<K, V> : LinkedHashMap<K, IList<V>>
|
|
{
|
|
private const long serialVersionUID = -4956746660057462312L;
|
|
|
|
public virtual void Map(K key, V value)
|
|
{
|
|
IList<V> elementsForKey = Get(key);
|
|
if (elementsForKey == null)
|
|
{
|
|
elementsForKey = new List<V>();
|
|
base.Put(key, elementsForKey);
|
|
}
|
|
elementsForKey.AddItem(value);
|
|
}
|
|
|
|
public virtual IList<Tuple<K, V>> GetPairs()
|
|
{
|
|
IList<Tuple<K, V>> pairs = new List<Tuple<K, V>>();
|
|
foreach (K key in Keys)
|
|
{
|
|
foreach (V value in Get(key))
|
|
{
|
|
pairs.AddItem(Tuple.Create(key, value));
|
|
}
|
|
}
|
|
return pairs;
|
|
}
|
|
}
|
|
}
|