public int hasheq()
{
if (_hasheq == 0)
{
_hasheq = Util.hashCombine(Murmur3.HashString(_name), Util.hasheq(_ns));
}
return(_hasheq);
}
public int hasheq()
{
ISeq s = seq();
if (s == null)
{
return(1);
}
return(Util.hasheq(s));
}
public int hasheq()
{
int hash = 1;
foreach (object o in this)
{
hash = 31 * hash + Util.hasheq(o);
}
return(hash);
}
public int hasheq()
{
int hash = 0;
for (ISeq s = this.seq(); s != null; s = s.next())
{
IMapEntry e = (IMapEntry)s.first();
hash += Util.hasheq(e.key()) ^ Util.hasheq(e.val());
}
return(hash);
}
public static int mapHasheq(IPersistentMap m)
{
int hash = 0;
for (ISeq s = m.seq(); s != null; s = s.next())
{
IMapEntry e = (IMapEntry)s.first();
hash += Util.hasheq(e.key()) ^ Util.hasheq(e.val());
}
return(hash);
}
public int hasheq()
{
int hash = 0;
for (ISeq s = seq(); s != null; s = s.next())
{
object e = s.first();
hash += Util.hasheq(e);
}
return(hash);
}
public int hasheq()
{
int hash = 1;
for (ISeq s = seq(); s != null; s = s.next())
{
hash = 31 * hash + Util.hasheq(s.first());
}
return(hash);
}
public static uint HashOrderedU(IEnumerable xs)
{
int n = 0;
uint hash = 1;
foreach (Object x in xs)
{
hash = 31 * hash + unchecked ((uint)Util.hasheq(x));
++n;
}
return(FinalizeCollHash(hash, n));
}
public int hasheq()
{
if (_hasheq == -1)
{
int hash = 1;
for (ISeq s = seq(); s != null; s = s.next())
{
hash = 31 * hash + Util.hasheq(s.first());
}
_hasheq = hash;
}
return(_hasheq);
}
public int hasheq()
{
if (_hasheq == -1)
{
int hash = 1;
foreach (object o in this)
{
hash = 31 * hash + Util.hasheq(o);
}
_hasheq = hash;
}
return(_hasheq);
}
public int hasheq()
{
if (_hasheq == -1)
{
int hash = 0;
for (ISeq s = seq(); s != null; s = s.next())
{
object e = s.first();
hash += Util.hasheq(e);
}
_hasheq = hash;
}
return(_hasheq);
}
public int hasheq()
{
if (_hasheq == -1)
{
int n;
int hash = 1;
for (n = 0; n < count(); ++n)
{
hash = 31 * hash + Util.hasheq(nth(n));
}
_hasheq = Murmur3.MixCollHash(hash, n);
}
return(_hasheq);
}
public int hasheq()
{
int hash = _hasheq;
if (hash == 0)
{
int n;
hash = 1;
for (n = 0; n < count(); ++n)
{
hash = 31 * hash + Util.hasheq(nth(n));
}
_hasheq = hash = Murmur3.MixCollHash(hash, n);
}
return(hash);
}
/// <summary>
/// Compute the hash code for the symbol.
/// </summary>
/// <returns>The hash code.</returns>
private int ComputeHashCode()
{
return(Util.hashCombine(Util.hasheq(_name), Util.hasheq(_ns)));
}