BigBlueButton/bigbluebutton-Github
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

add file

Browse Source 
git-svn-id: http://bigbluebutton.googlecode.com/svn/trunk@3000 af16638f-c34d-0410-8cfa-b39d5352b314
This commit is contained in:
Richard Alam 2009-11-12 20:41:14 +00:00
parent 8f7643be48
commit a7e87a4ba7
1 changed files with 251 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

251
bbb-voice/src/main/java/org/zoolu/sip/provider/SpcHashtable.java Normal file
View File

@ -0,0 +1,251 @@
/*
* Copyright (C) 2008 Greg Dorfuss - mhspot.com
*
* This source code is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This source code is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this source code; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*
* Based on mjsip 1.6 software and skype4java
*
* Author(s):
* Greg Dorfuss
*/
package org.zoolu.sip.provider;
import java.util.Hashtable;
/*
* special Hashtable that allows dupelicates of specified keys
*
*/
public class SpcHashtable extends Hashtable<Object,Object>
{
static final long serialVersionUID = 2423442L;
Hashtable dupeKeysList=null;
SpcHashtable (Hashtable dupeKeys)
{
super();
if (dupeKeys!=null)
dupeKeysList=dupeKeys;
else
dupeKeysList=new Hashtable();
}
public synchronized Object put(Object key,Object val)
{
if (dupeKeysList.containsKey(key))
{
Hashtable vect=null;
if (this.containsKey(key))
{
vect=(Hashtable) super.get(key);
vect.put(val.hashCode(),val);
}
else
{
vect=new Hashtable();
vect.put(val.hashCode(),val);
}
return super.put(key, vect);
}
else
return super.put(key, val);
}
public synchronized Object get(Object key)
{
if (dupeKeysList.containsKey(key))
{
// gets any entry
Hashtable vect=(Hashtable) super.get(key);
if (vect==null || vect.isEmpty())
return null;
else
return vect.get(vect.keys().nextElement());
}
else
return super.get(key);
}
/*
* Gets a specific object
*
*/
public synchronized Object get(Object key,Object val)
{
if (dupeKeysList.containsKey(key))
{
Hashtable vect=(Hashtable) super.get(key);
if (vect==null)
return null;
else
return vect.get(val.hashCode());
}
else
{
if (super.get(key)==val)
return super.get(key);
else
return null;
}
}
public synchronized Object remove(Object key)
{
if (dupeKeysList.containsKey(key))
{
// removes a single entry - could be any entry
Hashtable vect=(Hashtable) super.get(key);
if (vect==null || vect.isEmpty())
return null;
else
{
Object retVal=vect.remove(vect.keys().nextElement());
if (vect.size()==0)
super.remove(key);
return retVal;
}
}
else
return super.remove(key);
}
public synchronized boolean containsPair(Object key,Object val)
{
// checks for a specific pair
if (dupeKeysList.containsKey(key))
{
Hashtable vect=(Hashtable) super.get(key);
if (vect!=null && vect.containsKey(val.hashCode()))
return true;
}
else
{
if (super.containsKey(key) && super.get(key)==val)
return true;
}
return false;
}
public synchronized boolean removePair(Object key,Object val)
{
// removes a specific pair
if (dupeKeysList.containsKey(key))
{
Hashtable vect=(Hashtable) super.get(key);
if (vect!=null && vect.containsKey(val.hashCode()))
{
vect.remove(val.hashCode());
if (vect.size()==0)
super.remove(key);
return true;
}
}
else
{
if (super.containsKey(key) && super.get(key)==val)
{
super.remove(key);
return true;
}
}
return false;
}
public static void main( String [] args)
{
Hashtable<Object,Object> dupeKeys=new Hashtable<Object,Object>();
StringBuffer dupeKey=new StringBuffer("DupeKey");
StringBuffer regKey=new StringBuffer("RegKey");
dupeKeys.put(dupeKey, "");
SpcHashtable myHash= new SpcHashtable(dupeKeys);
StringBuffer ps[]=new StringBuffer[5];
for (int o=0;o<5;o++)
{
ps[o]=new StringBuffer(o+":dssfdfsd");
}
for (int o=0;o<ps.length;o++)
{
myHash.put(dupeKey, ps[o]);
}
myHash.put(regKey, new StringBuffer("stuff"));
System.out.println(myHash.toString());
System.out.println("hashsize="+myHash.size());
System.out.println("hasdupekey="+myHash.containsKey(dupeKey));
System.out.println("hasregkey="+myHash.containsKey(regKey));
System.out.println("");
StringBuffer gtps=(StringBuffer) myHash.get(dupeKey);
System.out.println("gtps="+gtps);
System.out.println("");
System.out.println("getPair3="+myHash.get(dupeKey,ps[3]));
System.out.println("removePair3="+myHash.removePair(dupeKey,ps[3]));
System.out.println("getPair3="+myHash.get(dupeKey,ps[3]));
System.out.println("");
myHash.remove(dupeKey);
System.out.println("removedAPair");
System.out.println(myHash.toString());
for (int o=0;o<ps.length;o++)
{
System.out.println("---------------");
StringBuffer tps=(StringBuffer) myHash.get(dupeKey);
System.out.println("ps="+tps);
System.out.println("removePair"+o+"="+myHash.removePair(dupeKey,ps[o]));
System.out.println("hasdupekey="+myHash.containsKey(dupeKey));
}
System.out.println("");
System.out.println(myHash.toString());
System.out.println("hashsize="+myHash.size());
System.out.println("getRegKey="+myHash.get(regKey).toString());
System.out.println("hasregkey="+myHash.containsKey(regKey));
}
}