How to use the java.util.Hashtable function in java

To help you get started, we’ve selected a few java examples, based on popular ways it is used in public projects.

Secure your code as it's written. Use Snyk Code to scan source code in minutes - no build needed - and fix issues immediately.

github wolverton-research-group / qmpy / qmpy / web / static / js / jsmol / j2s / java / util / Hashtable.js View on Github external
function(a){
this.key=a;
this.start=this.b$["java.util.Hashtable"].lastSlot+1;
},"~B");
$_V(c$,"hasMoreElements",
github java2script / java2script / sources / net.sf.j2s.lib / j2slib / java / util / Hashtable.js View on Github external
function(a){
return this.b$["java.util.Hashtable"].containsKey(a);
},"~O");
$_V(c$,"remove",
github wolverton-research-group / qmpy / qmpy / web / static / js / jsmol / j2s / java / util / Hashtable.js View on Github external
function(){
if(this.expectedModCount==this.b$["java.util.Hashtable"].modCount){
if(this.canRemove){
this.canRemove=false;
{
var a=false;
var b=this.b$["java.util.Hashtable"].elementData[this.lastPosition];
if(b===this.lastEntry){
this.b$["java.util.Hashtable"].elementData[this.lastPosition]=b.next;
a=true;
}else{
while(b!=null&&b.next!==this.lastEntry){
b=b.next;
}
if(b!=null){
b.next=this.lastEntry.next;
a=true;
}}if(a){
this.b$["java.util.Hashtable"].modCount++;
this.b$["java.util.Hashtable"].elementCount--;
this.expectedModCount++;
return;
}}}else{
throw new IllegalStateException();
}}throw new java.util.ConcurrentModificationException();
github java2script / java2script / sources / net.sf.j2s.lib / j2slib / java / util / Hashtable.js View on Github external
function(){
return this.b$["java.util.Hashtable"].getIterator(0);
});
$_V(c$,"size",
github java2script / java2script / sources / net.sf.j2s.lib / j2slib / java / util / Hashtable.js View on Github external
function(){
if(!this.iterator)throw new UnsupportedOperationException();
if(this.lastReturned==null)throw new IllegalStateException("Hashtable Enumerator");
if(this.b$["java.util.Hashtable"].modCount!=this.expectedModCount)throw new java.util.ConcurrentModificationException();
{
var a=this.b$["java.util.Hashtable"].table;
var b=(this.lastReturned.hash&0x7FFFFFFF)%a.length;
for(var c=a[b],d=null;c!=null;d=c,c=c.next){
if(c==this.lastReturned){
this.b$["java.util.Hashtable"].modCount++;
this.expectedModCount++;
if(d==null)a[b]=c.next;
else d.next=c.next;
this.b$["java.util.Hashtable"].count--;
this.lastReturned=null;
return;
}}
throw new java.util.ConcurrentModificationException();
}});
c$=$_P();
github wolverton-research-group / qmpy / qmpy / web / static / js / jsmol / j2s / java / util / Hashtable.js View on Github external
function(object){
return this.b$["java.util.Hashtable"].contains(object);
},"~O");
$_V(c$,"size",
github java2script / java2script / sources / net.sf.j2s.lib / j2slib / java / util / Hashtable.js View on Github external
function(a){
return this.b$["java.util.Hashtable"].remove(a)!=null;
},"~O");
$_V(c$,"clear",
github wolverton-research-group / qmpy / qmpy / web / static / js / jsmol / j2s / java / util / Hashtable.js View on Github external
function(key){
if(this.b$["java.util.Hashtable"].containsKey(key)){
this.b$["java.util.Hashtable"].remove(key);
return true;
}return false;
},"~O");
$_V(c$,"iterator",
github wolverton-research-group / qmpy / qmpy / web / static / js / jsmol / j2s / java / util / Hashtable.js View on Github external
function(object){
if(this.contains(object)){
this.b$["java.util.Hashtable"].remove((object).getKey());
return true;
}return false;
},"~O");
$_M(c$,"contains",