| Package | Description |
|---|---|
| it.unimi.dsi.fastutil.booleans |
Provides type-specific classes for boolean elements or keys.
|
| it.unimi.dsi.fastutil.bytes |
Provides type-specific classes for byte elements or keys.
|
| it.unimi.dsi.fastutil.chars |
Provides type-specific classes for character elements or keys.
|
| it.unimi.dsi.fastutil.doubles |
Provides type-specific classes for double elements or keys.
|
| it.unimi.dsi.fastutil.floats |
Provides type-specific classes for float elements or keys.
|
| it.unimi.dsi.fastutil.ints |
Provides type-specific classes for integer elements or keys.
|
| it.unimi.dsi.fastutil.longs |
Provides type-specific classes for long elements or keys.
|
| it.unimi.dsi.fastutil.objects |
Provides type-specific classes for object elements or keys.
|
| it.unimi.dsi.fastutil.shorts |
Provides type-specific classes for short elements or keys.
|
| Modifier and Type | Class and Description |
|---|---|
class |
BooleanOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Byte2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Byte2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Byte2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Byte2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
ByteLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ByteLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ByteOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
ByteOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Char2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Char2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Char2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Char2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
CharLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
CharLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
CharOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
CharOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Double2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Double2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Double2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Double2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
DoubleLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
DoubleLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
DoubleOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
DoubleOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
DoubleOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Float2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Float2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Float2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Float2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
FloatLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
FloatLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
FloatOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
FloatOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
FloatOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Int2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Int2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Int2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Int2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
IntLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
IntLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
IntOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
IntOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
IntOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Long2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Long2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Long2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Long2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
LongLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
LongLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
LongOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
LongOpenHashBigSet
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
LongOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Object2BooleanLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2BooleanLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2BooleanOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2BooleanOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2ByteLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ByteLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ByteOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2ByteOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2CharLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2CharLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2CharOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2CharOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2DoubleLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2DoubleLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2DoubleOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2DoubleOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2FloatLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2FloatLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2FloatOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2FloatOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2IntLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2IntLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2IntOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2IntOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2LongLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2LongLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2LongOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2LongOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2ObjectLinkedOpenCustomHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ObjectLinkedOpenHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ObjectOpenCustomHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2ObjectOpenHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2ReferenceLinkedOpenCustomHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ReferenceLinkedOpenHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ReferenceOpenCustomHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2ReferenceOpenHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Object2ShortLinkedOpenCustomHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ShortLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Object2ShortOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Object2ShortOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
ObjectLinkedOpenCustomHashSet<K>
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ObjectLinkedOpenHashSet<K>
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ObjectOpenCustomHashSet<K>
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
ObjectOpenHashBigSet<K>
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
ObjectOpenHashSet<K>
A type-specific hash set with with a fast, small-footprint implementation.
|
class |
Reference2BooleanLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2BooleanOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2BooleanOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2ByteLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2ByteOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2ByteOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2CharLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2CharOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2CharOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2DoubleLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2DoubleOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2DoubleOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2FloatLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2FloatOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2FloatOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2IntLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2IntOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2IntOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2LongLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2LongOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2LongOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2ObjectLinkedOpenHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2ObjectOpenCustomHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2ObjectOpenHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2ReferenceLinkedOpenHashMap<K,V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2ReferenceOpenCustomHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2ReferenceOpenHashMap<K,V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Reference2ShortLinkedOpenHashMap<K>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Reference2ShortOpenCustomHashMap<K>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Reference2ShortOpenHashMap<K>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
ReferenceLinkedOpenHashSet<K>
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ReferenceOpenHashBigSet<K>
A type-specific hash big set with with a fast, small-footprint implementation.
|
class |
ReferenceOpenHashSet<K>
A type-specific hash set with with a fast, small-footprint implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
Short2BooleanLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2BooleanOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2BooleanOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2ByteLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2ByteOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2ByteOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2CharLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2CharOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2CharOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2DoubleLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2DoubleOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2DoubleOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2FloatLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2FloatOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2FloatOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2IntLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2IntOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2IntOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2LongLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2LongOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2LongOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2ObjectLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2ObjectOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2ObjectOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2ReferenceLinkedOpenHashMap<V>
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2ReferenceOpenCustomHashMap<V>
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2ReferenceOpenHashMap<V>
A type-specific hash map with a fast, small-footprint implementation.
|
class |
Short2ShortLinkedOpenHashMap
A type-specific linked hash map with with a fast, small-footprint implementation.
|
class |
Short2ShortOpenCustomHashMap
A type-specific hash map with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
Short2ShortOpenHashMap
A type-specific hash map with a fast, small-footprint implementation.
|
class |
ShortLinkedOpenCustomHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ShortLinkedOpenHashSet
A type-specific linked hash set with with a fast, small-footprint implementation.
|
class |
ShortOpenCustomHashSet
A type-specific hash set with a fast, small-footprint implementation whose hashing strategy
is specified at creation time.
|
class |
ShortOpenHashSet
A type-specific hash set with with a fast, small-footprint implementation.
|
Copyright © 2019. All rights reserved.


My little diary
Add entry
Title
Description
Show my present location.
Post entry
clear local storage
Populate entries
list entries


ORIGAMI SIMULATOR
This app allows you to simulate how any origami crease pattern will fold. It may look a little different
from what you typically think of as "origami" - rather than folding paper in a set of sequential steps,
this simulation attempts to fold every crease simultaneously. It does this by iteratively solving for small displacements in the geometry of an initially flat sheet due to forces
exerted by creases.
You can read more about it in our paper:
This app also uses the methods described in Simple Simulation of Curved Folds Based on Ruling-aware Triangulation to import curved crease patterns and pre-process them in a way that realistically simulates the bending between the creases.
Originally built by Amanda Ghassaei as a final project for Geometric Folding Algorithms.
Other contributors include Sasaki Kosuke, Erik Demaine, and others.
Code available on Github. If you have interesting crease patterns that would
make good demo files, please send them to me (Amanda) so I can add them to the Examples menu. My email address is on my website. Thanks!
You can find additional information in our 7OSME paper and project website.
If you have feedback about features you want to see in this app, please see this thread.
DESIGN TIPS
Bad design files will throw errors and create models that explode or cannot be solved, here are some tips for
importing FOLD or SVG files that work.
Importing FOLD:
The FOLD file format is specified in these docs.
This tool imports FOLD v1.0 files with all of the following fields populated:
VIRTUAL REALITY
This tool currently supports an interactive Virtual Reality mode for the Vive and Oculus headset and controllers (it may work on others, but it is not tested).
For this to work, you must first use a WebVR enabled browser:
currently only an experimental build of Chromium (with enable-webvr and
-enable-gamepad-extensions flags) and the latest Firefox for Windows
are supported by this app.
When you open this page with the appropriate browser, you will see a button that says "ENTER VR". Clicking this will
put the app into an interactive VR mode. The hand controllers will allow you to grab the origami mesh and pull on it.
This is especially interesting if you set the Mesh Material to Strain Visualization so you can see how your interactions
change the internal strains in the material.
Troubleshooting:
ANIMATION SETTINGS
The dynamic simulation is calculated by solving for all the forces in the system, moving time forward in small Δt steps,
and updating the vertices of the origami incrementally. The time step size for this animation is calculated automatically
based on the material stiffnesses set in the Simulation Settings section: more stiff settings
require shorter time steps to solve and will slow down the simulation.
Num simulation steps per frame allows you to control the number of tiny time steps forward to take on each
render cycle. If the simulation looks choppy to you, you might consider lowering this setting.
Lowering the number of steps per frame will slow down the simulation, but will result in a more smooth animation.
SIMULATION ERROR
Average vertex error gives a sense of how much the distance constraints in the
origami pattern are being violated (i.e. how much the sheet is being stretched). The error at each vertex is evaluated by averaging the
percent deviation of all its distance constraints with adjacent vertices. This error is
reported as a percent of the total length of the distance constraint to remove scaling effects.
This measurement is equivalent to
Cauchy strain or engineering strain of the distance constraints on this system.
Increasing the Axial Stiffness will tighten these constraints and
lower the error in the simulation.
To visualize the error of each vertex graphically, select Strain Visualization under Mesh Material
in the left menu.
SIMULATION SETTINGS
This app uses a compliant dynamic simulation method to solve for the geometry of an origami pattern
at a given fold angle. The simulation sets up several types of constraints: distance constraints prevent the
sheet from stretching or compressing, face constraints prevent the sheet from shearing, and angular constraints fold or flatten the sheet. Each of these constraints is weighted by a stiffness - the stiffer the constraint, the better it is enforced
in the simulation.
Axial Stiffness is the stiffness of the distance constraints. Increasing axial
stiffness will decrease the stretching/compression (strain) in the simulation, but it will also slow down the solver.
Face Stiffness is the stiffness of the face constraints, which help the axial constraints prevent deformation of the sheet's surface between the creases.
Fold and facet stiffnesses correspond to two types of angular constraints. Fold Stiffness is the stiffness of the mountain
and valley creases in the origami pattern. Facet Stiffness is the stiffness of the triangulated faces between
creases in the pattern. Increasing facet stiffness causes the faces between creases to stay very flat as the origami is folded.
As facet stiffness becomes very high, this simulation approaches a
rigid origami simulation, and models the behavior of a rigid material (such as metal) when folded.
Internally, constraint stiffnesses are scaled by the length of the edge associated with that constraint to determine its geometric stiffness. For Axial constaints, stiffness is
divided by length and for angular constraints, stiffness is multiplied by length.
Since this is a dynamic simulation, vertices of the origami move with some notion of acceleration and velocity. In order to
keep the system stable and help it converge to a static solution,
damping is applied to slow the motion of the vertices. The Damping slider allows you to control the amount of damping
present in the simulation. Decreasing damping makes the simulation more "springy".
It may be useful to temporarily turn down damping to help the simulation more quickly converge towards its static solution - especially
for patterns that take a long time to curl.
A Numerical Integration technique is used to integrate acceleration into velocity and position for each time step of the simulation.
Different integration techniques have different associated computational cost, error, and stability. This app allows you to choose
between two different integration techniques: Euler Integration
is the simplest type of numerical integration (first order) with large associated error, and
Verlet Integration is a second order integration technique
with lower error and better stability than Euler.
COMPLIANT DYNAMIC SIMULATION
....
COMPLIANT STATIC SIMULATION
....
RIGID STATIC SIMULATION
....
STRAIN VISUALIZATION
Cauchy strain or engineering strain is a unitless measurement of how much a material is being stretched or compressed under load.
The Strain Visualization illustrates the strain across an origami sheet by mapping it to a color from blue (no strain) to red (max strain).
USER INTERACTION
Toggle this control to enable/disable mouse interaction with the origami model. When enabled,
mousing over the model will display a highlighter; clicking and dragging allows you to
interact with the model in real time. Very vigorous interactions with the model may cause it
to pop into a strange configuration that it can't escape - use the Reset button to start
the simulation again from a flat state.
ROTATION SPEED
Speed : ( radians per frame )
BACKGROUND COLOR
Color (rgb hex) :
Hex colors are 6 digit alphanumeric codes that specify different colors. You can get these codes using a color picker.
SVG IMPORT SETTINGS
Vertex merge tolerance (px) :
For curved folding
Intervals of vertices for discretization (px) :
Approximation tolerance of curves (px) :


{% extends 'ui/page.html' %}
{% load schedule_tags %}
{% block title %}Schedule - {{ event.extended_title }}{% endblock %}
{% block head %}
{% endblock %}
{% block og %}
{% endblock %}
{% block content %}
Schedule_
Friday, October 11th
Saturday, October 12th
{% include "schedule/partials/header.html" %}
{% include "schedule/partials/spacer.html" with time="08:30" text="Doors open" %}
{% include "schedule/partials/spacer.html" with time="10:00" text="Opening word" %}
{% include "schedule/partials/keynote.html" with time="10:15" slug="the-737-max-human-factors-in-complex-systems" %}
{% include "schedule/partials/spacer.html" with time="11:15" text="Division break" %}
{% include "schedule/partials/talk_pair.html" with time="11:35" slugs="just-go-for-it-the-story-of-dance-matjs,webassembly-binary-in-plain-english,python-asyncawait-unraveled" %}
{% include "schedule/partials/talk_pair.html" with time="12:10" slugs="from-conversation-to-software,a-lean-approach-to-design-system" %}
{% include "schedule/partials/talk_pair.html" with time="13:05" slugs="secure-your-code-injections-and-logging,react-native-and-pwa-a-tale-of-two-architectures,data-race-detection" %}
{% include "schedule/partials/lunch.html" with time="13:30" %}
{% include "schedule/partials/talk_pair.html" with time="15:00" slugs="automating-dynamic-malware-analysis,leadership-lessons-from-building-a-remote-team,parsing-from-first-principles" %}
{% include "schedule/partials/talk_pair.html" with time="15:35" slugs="building-a-gameboy-emulator-with-elixir-and-scenic,share-your-client-code-like-a-boss" %}
{% include "schedule/partials/spacer.html" with time="16:20" text="Break" %}
{% include "schedule/partials/talk_pair.html" with time="16:50" slugs="oauth-2-a-closer-look,leveraging-anxiety-with-product-design" %}
{% include "schedule/partials/talk_pair.html" with time="17:25" slugs="load-balancing-nodejs-in-production,automatic-checks-for-the-people" %}
{% include "schedule/partials/spacer.html" with time="17:50" text="Closing word" %}
{% include "schedule/partials/drinkup.html" with time="18:10" %}
{% endblock %}


START
{{title}}
Here are the regions recommended for you:
{% for region in regions %}
Kommun {{ region.region_name}} comp:{{region.competitive_score}} work:{{region.working_score}}
{% for posting in region.jobs %}
{{posting.title}}
{{ posting.location_desc }}
{% endfor %}
{% endfor %}


To initialize the Grok JavaScript Client library being used on this page to interact with the Grok API, you must construct a new GROK.Client object using your API key, and then call init().
GROK.Client
init()
Initializing Client...


--- title: "Publications" layout: archive excerpt: "Karthik's research publications" sitemap: false permalink: /publications/ author_profile: true --- {% include base_path %}


This directive allows you to limit the size of HTTP reply bodies
based on ACL elements. When a request matches one of the
reply_body_max_size rules, Squid places a limit
on the size of the HTTP response. A value of 0 indicates no limit.
Squid checks the reply size first when all HTTP headers have been
received. If the headers contain a Content-Length
value that exceeds the specified limit, the user receives a message
that states "the request or reply is too
large." If the content length is unavailable, Squid
continues checking the limit as data comes in from the server. If the
reply size exceeds the limit, Squid closes the
client's connection, which causes the client to
receive a partial reply. Downstream caches often can't detect partial
replies. Because the headers lack a content length value, the
downstream cache (or user-agent) doesn't know that
additional data is missing. Thus, you shouldn't use
reply_body_max_size if you have child or sibling
caches. The code that checks the reply_body_max_size
list ignores deny rules. In other words, it is
pointless to include deny rules in this list. Make sure that the maximum reply size is large enough for a Squid
error message (typically 1K-2K bytes). An error message that is
larger than the maximum reply body size causes Squid to crash. |
Syntax
|
reply_body_max_size bytes allow [!]ACLname ...
| |
Default
|
reply_body_max_size 0 allow all
| |
Example
|
acl WorkingHours time 08:00-17:00
reply_body_max_size 10485760 allow WorkingHours
| |
Related
|
maximum_object_size,
request_body_max_size,
request_header_max_size
|
|


Seems your browser doesn't support Javascript! Websocket relies on Javascript being enabled. Please enable Javascript and reload this page!
Planning Poker Session:
Connect
Disconnect
Estimation Session
Start a Session
... or ...
Join a session
What is your name?
Send
Greetings


We Are One Of The Oldest Companies Specialized In The Design And Programming Of Internet Sites And Applications Of Mobile Phones Android And IPhone And Domain Registration And Hosting And Design web application and we gained the confidence of our customers in all countries of the world has a distinguished team and a coach and has a great experience working from the headquarters of the company where the number of programmers and designers working from the headquarters of the company .
Learn MoreActive Projects
Business Growth
Completed Projects
Happy Clients


Insurgency: Support effort to rebuild North-East, army urges NEDC
by Agency ReportThe Chief of Army Staff, Lt.-Gen. Tukur Buratai has called on the North East Development Commission to support its rebuilding efforts in the North East.
Buratai made the call when he paid a courtesy call on the Chairman of the Commission, retired Maj.-Gen. Paul Tarfa, on Tuesday in Abuja.
He said that the Nigerian army had embarked on a series of programmes in the North-East ranging from capacity development of women and youths to reconstruction projects in the region.
Buratai said, “This will be the beginning of a good relationship between the Nigerian Army and NEDC because we have a common goal because of the challenges in the region.”
He assured the commission that the army’s support to enable it to fulfil its mandate in the region.
Buratai also urged the commission to support its effort in the area of road reconstruction and barracks rehabilitation in the affected areas within the region.
“We want to thank you for your effort towards complementing the government’s effort to rebuild the North-East.
“I want to assure you that we will provide the needed security for all your activities especially the ongoing oil exploration in the region,” he said.
Responding, the Chairman of the Commission, commended the army under Buratai for its successes in the fight against insurgency in the north east.
He also commended the army for its humanitarian services especially in the areas of provision of boreholes for some communities in the region.
“You have mentioned a lot of things and I know that Nigeria will forever be grateful to you because we know the security situation in the country before your coming as the army chief.
“I have seen what you have done in some of the communities in the North-East apart from the military successes in the region.”
NEDC chairman assured Buratai that the commission would continue to discuss with the army on how to support its activities and operations within its powers.
On his part, the Managing Director of NEDC, Mohammed Alkali, said the military was one of the commission’s strategic partners in the North-East, adding that NEDC could not do anything in the region without it.
Alkali said that the commission would require continuous support of the army in the area of security to be able to carry out its activities.
“We are going to look at your proposals and see what we can do,” he said.
(NAN)


Me and my brother got some morning glory seeds (heavenly blue) sometime last winter, deciding to eat them before our parents got home. The first effects came within an hour of ingestion. We both saw color patterns within the pattern of the countertop. They looked kinda like amoebas. This came along with some cramping. This went on for awhile.
Then our parents get home. My dad told us to go shovel snow. At this point my brother goes to lay down in my bed, feeling not too good. I tell my dad to let him rest. I have major cramps in my groin area now, and have to walk like a cowboy. My dad hardly notices. My stomach feels terrible at this point. It was a pretty cold night, and I think it affected the sick feeling in my stomach, because I don't remember feeling sick outside. The snow was very colorful, seeing all kinds of colors sparkling. The best part was my neighboor's green barn light across the street. The light came down at the end of our driveway, and it seemed to pulsate as it glowed. It would brighten and swell. This made me feel good whenever it got brighter.
Eventually I went back inside, and find my brother in a very dazed condition. He is talking about seeing a 'color matrix' in the middle of my room. I begin to feel very sick, and he tells me to throw up in this waste basket that he jus threw up in. So I manage to heave up the seeds and whatever else I'd eated recently. While doing so, I felt very light-headed, and my brother was trying to encourage me, yelling 'You're puking out the evils of the world!' This made me laugh, and helped me to get through the puking. That scene only lasts a few mintues and we realize we were being pretty loud. So we decide to watch Dazed and Confused.  I examined these parts closely, putting my face right up to the tv. There are numbers within the waves coming off of the actors' heads and are moving loosely around.
I feel sick in waves now, and my brother is writing down things on little note pads that he folds in half twice and puts in his pockets. He looked like he was on speed trying to solve the problems of the world. There must have been a hundred note pads he wrote on, sometimes on the back. Neither of us were watching the movie at this point. We were discussing abstract subjectivism in a manner so incoherent it seemed to be an aparition of the feelings you get when you're on ecstacy. We moved from one subject to the next without haste. Eventually we landed on our band. We came up with the double-meaning, highly subjective name Everyone's Right. After that, we started to watch the movie again.
For some reason when we finished the movie, we couldn't find another movie we wanted to watch. My brother has a million movies to pick from upstairs, but neither of us wanted to make that journey. We only had my unworthy selection to pick from. Everything gave me either a bad vibe or made me nausious. From this point on Dazed and Confused becomes some kind of remedy for me, and I am convinced that we should keep watching it. So we do, but I would start the movie over one or two scenes earlier from the end every time we watched it. We watched that movie for about three hours. I felt really good every time we started it over, and really depressed every time it came near the end. I remained feeling sick in waves for most of the time.
Then my brother went to bed, and I tried to do the same. I stayed awake for awhile longer, still feeling ill. Eventually I slept, and the next day I felt surprisingly good. Especially after not having cramps anymore, that was the worst part. I would not do these again unless I could do it without the nausia and painful cramps.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


The event will bubble out from the button in the inner div. It should stop bubbling before it reaches the outer div and the form should not submit.


Implements the persistence interface for Fedora repositories in order to leverage existing Apache Jackrabbit code for the JCR adapter.
In current implementation the JCR adapter for Fedora is a Jackrabbit persistence manager that implements the org.apache.jackrabbit.core.persistence.PersistenceManager interface. It translates all node/property storing and loading requests to API calls (REST or API-A/API-M) made to the underlying Fedora repository.
There are pros and cons of this implementation:Pros
This implementation allowed a rapid development of the JCR connector for
Fedora, reusing the majority of existing Jackrabbit code. If correctly
implemented, it should work with any other software that currently
connects to Jackrabbit, for example, Apache Sling.
Cons
A persistence manager in Jackrabbit is designed to transmit data between
memory space and persistent storage (disk file, database, etc.) and is not
supposed to be "smart" in the sense of interpreting data. The Fedora
persistence manager, however, will need to interpret objects hierarchy
in a Fedora repository and artificially create data structure
(parent-child relationships in the JCR tree, fictional root node, etc.)
in order to appear like a normal persistence manager. This might lead to
a difficult implementation.
For a detailed document on persistence manager configuration in Jackrabbit, please refer to Persistence Manager (PM) FAQ on the Jackrabbit Wiki.
Also defined in this package is the Fedora connector classes that wrap API-A/API-M or REST API calls to the underlying repository that perform different reading and writing tasks.


Free Download All In One Seo Pack Pro V4 1 0 1 Activated
How To Download All In One Seo Pack Pro For Free
All In One Seo Pack Download Free Wordpress Plugin 2020
All In One Seo Free Vs All In One Seo Premium Is It Worth It 2021
All In One Seo Pack V4 0 16 Download Free Fully Activated Latest Version Nulled Plugin Themesforwp
Download All In One Seo Pack Pro 2 5 3 Free Wordpress Plugins Plugins Wordpress
All In One Seo Best Wordpress Seo Plugin Easily Improve Your Seo Rankings Wordpress Plugin Wordpress Org
All In One Seo Pack Pro V4 0 16 Plugin Free Download Activated
Awesome Motive Acquires The All In One Seo Pack Plugin Wordpress Tavern
All In One Seo Pack Optimizes Social Shares
Free Download All In One Seo Pack Pro 4 1 0 Activated
Yoast Seo The 1 Wordpress Seo Plugin Yoast
Download All In One Seo Pack Pro V2 2 3 License Key Seo Plugin Wordpress Plugins Internet Marketing Software
Download All In One Seo Pack Pro V2 3 5 1 With License Key
Rank Math Vs Yoast Seo Vs All In One Seo Which Is Best Free Wordpress Seo Plugin Rank Math Features Overview
Free Download All In One Seo Pack Pro V3 6 2 Learn More
All In One Seo Pack Pro Free Download V4 0 17 Latest Version Our Blogging Point
14 Best Wordpress Seo Plugins And Tools That You Should Use
Semper Plugins All In One Seo Pack Logo Free Transparent Png Download Pngkey
All In One Seo Pack Pro 4 1 0 Latest
The Must Have Wordpress Seo Plugins For 2021
All In One Seo Pack Pro 4 0 3 Wordpress Download Zone Wordpress Plugins Seo Wordpress
Free Download Download All In One Seo Pack Pro V3 6 2
Installing All In One Seo Pro Aioseo
All In One Seo Pack Pro 3 2 10 Free Download
All In One Seo Pack Pro Download Only 5 With Lifetime Update
All In One Seo Pack Wordpress Plugin Free Download Wordpress Fast Theme
Gpl Free Download All In One Seo Pro Plugin V4 1 0 1


[ADAPE](https://github.com/hausec/ADAPE-Script) | AD Assessment and Privilege Escalation Script
This script will do the following:
Gather hashes via WPAD, LLMNR, and NBT-NS spoofing
Check for GPP password (MS14-025)
Gather hashes for accounts via Kerberoast
Map out the domain and identify targets via BloodHound
Check for privilege escalation methods
Search for open SMB shares on the network
Search those shares and other accessible directories for sensitive files and strings (Passwords, PII, or whatever your want, really). By default it's looking for the term "password". If you wanted to search for CVVs for example, you'd just add it next to 'password', e.g. password,cvv
Check patches of systems on the network
Search for file servers
Search attached shares
Gather the domain policy
This script will completely run on it's own, without using the internet at all. All the scripts needed are obfuscated powershell and included, so it should bypass most basic AV solutions. By default, it will turn off Windows Defender. If OpSec worries you (e.g. target has alerts configured around when Defender is turned off), then you can comment it out by putting a '#' before "Set-MpPreference -DisableRealtimeMonitoring $true" on line 34.
It uses the following modules:
Inveigh - https://github.com/Kevin-Robertson/Inveigh/blob/master/Scripts/Inveigh.ps1
Kerberoast - https://github.com/EmpireProject/Empire/blob/master/data/module_source/credentials/Invoke-Kerberoast.ps1
Bloodhound - https://github.com/BloodHoundAD/BloodHound/blob/master/Ingestors/SharpHound.exe
Get-GPPP - https://github.com/EmpireProject/Empire/blob/master/data/module_source/privesc/Get-GPPPassword.ps1
PowerUp - https://github.com/PowerShellMafia/PowerSploit/blob/master/Privesc/PowerUp.ps1
PowerView - https://github.com/PowerShellMafia/PowerSploit/blob/master/Recon/PowerView.ps1
The script will ask to run as admin, as it requires it. If you do not have admin access, it will only run the privilege escalation module. If you're being blocked by UAC, I suggest running a bypass UAC script (https://raw.githubusercontent.com/samratashok/nishang/master/Escalation/Invoke-PsUACme.ps1).
After running the .ps1, it will create the capture file in the same folder it's being ran in and zips it. At the end of the script, it deletes all the folders it created (except the .zip file, obviously).
GPP password checking and searching sensitive files takes awhile, so don't be surprised if this script takes a long time to finish depending on the number of domain controllers, open shares, and strings you're searching for. Comment those sections out if they take too long to run.
Usage: PowerShell.exe -ExecutionPolicy Bypass ./ADAPE.ps1


| DOSE: |
20 mg |
|
2C-I |
(powder / crystals) |
I took 20mg at 9pm. At approx. 10:30, I was stunned by visuals while staring at the wood-paneling on my friend's living room wall. From that point I had an intense feeling of weight on my body. I was reluctant to move. The weighted feeling did not return later.
After leaving my friend's house, I walked to the car, not recognizing exactly the surroundings that should have been familiar. During the car ride, the air conditioning blowing on my legs creating a confusing signal, I couldn't tell if the air was very hot or very cold. It felt as if someone rubbed Icey Hot all over my inner thigh.
When I got to my room I laid down on my bed (approx 11:30pm). My feet felt like they were burning. A tingling sensation seemed to run down one-side of my body, making me wonder if the drug was affecting only one side of my brain. I had a strange tingling sensation in my testicles that was prevalent most of the trip (9pm-3am).
My thoughts seemed especially introspective and profound. My thoughts flowed very well at times, and other times I would forget my thought mid-sentence, trying to explain it. Sometimes I would dismiss thoughts as a product of being on a drug; it seemed to me that this was a result of the drug not totally encompassing me.
Overall, I would describe it as a 'dirty' physical high. I didn't much care for how my body felt most of the night. The drug was useful for therapeutic development, though, and much mental development was accomplished. I realized several things about myself and my friends while on this drug.
It should be mentioned that I had someone around me at all times not taking any substances, which was probably very helpful.
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.


MANTAINER Mateusz Michałowski
FROM Poland
WORKDIR Adhese
ADD adhese/docker_techtalk .
ADD official_docker_materials/img/* .
ADD presentation_by_John_Lewis/img/* .
# http://pointful.github.io/docker-intro
ENTRYPOINT /dev/null
sure...
now try running 10 VMs on your laptop...
I want the isolation and portability of a VM
without the drawbacks
### Hello World
docker run ubuntu echo "Hello World"
docker ps -a
### Let's change the state docker run ubuntu touch new_file docker run ubuntu ls
###(oops! there's no new_file!)
### Where's my new_file?
docker ps -a
docker diff [CONTAINER NAME/ID]
### I want my file back!
docker commit [CONTAINER_ID] [your_name]/ubuntu_with_new_file
docker images
docker run [your_name]/ubuntu_with_new_file ls
### Repositories
docker push [your_name]/ubuntu_with_new_file
# goto: https://hub.docker.com/r/mefju/ubuntu_with_new_file/
### Interactive mode with tty docker run -it ubuntu /bin/bash # TODO prepare a 'workshop/htop' image with 'htop' installed sudo apt-get update sudo apt-get install htop htop # to test: docker run -it workshop/htop htop
# DEMO try killing htop from another docker container # processes are isolated between docker containers # but are still just normal processes from host point of view
### TODO find all the changes introduced by installing htop
docker ps -a docker diff [CONTAINER_ID]
### Dockerfile
cd workshop/01_dockerfile
cat Dockerfile
#TODO: let's COPY program.sh to your docker image
#see: https://docs.docker.com/reference/builder/#copy
docker build -t workshop/dockerfile .
docker run workshop/dockerfile ./program.sh Bob
git clone https://github.com/mefjush/docker-workshop.git
### A simple currency conversion app
cd workshop/02_rates
python -u rates/server.py #no way it will work
### Dockerize it! cat rates/readme.txt # TODO fix the Dockerfile # https://docs.docker.com/reference/builder/ docker build -t workshop/rates . docker run -it workshop/rates # if it works: you'll see: 'http://<IP_ADDRESS>:8080/'
# TODO discuss Dockerfile instruction order
### Run in detached mode
docker run -d workshop/rates
docker ps
docker logs [CONTAINER_ID]
docker exec [CONTAINER_ID] ps
docker exec -it [CONTAINER_ID] /bin/bash
### How to access it?
# TODO modify Dockerfile to EXPOSE a port
docker run -d -P workshop/rates
docker ps
boot2docker ip # or docker-machine ip default
# access http://[host]:[port]/rates/eur/usd
### Portal Dockerfile
cd workshop/03_portal
# TODO look at Dockerfile - anything wrong with it?
Let's extract duplicated code out
### Super-Dockerfile
./stop_all_containers.sh
./rm_all_containers.sh
cd workshop/04_ubuntu_python_web
# TODO list:
# - build 'workshop/ubuntu_python_web' image with 'build.sh'
# - modify 02_rates and 03_portal to extend FROM base image
# - run 'build_all.sh' and 'start_*.sh' scripts to test
# test:
# curl http://[DOCKER_HOST]:8080/rates/eur/usd
# curl http://[DOCKER_HOST]:8888
### DEMO: disappearing favicons trick
### Volumes
# https://docs.docker.com/userguide/dockervolumes/
docker create -v /portal/static --name portal_data ubuntu /bin/true
# TODO add option to 'start_portal.sh':
--volumes-from portal_data
### Data migration
mkdir backup
docker run --volumes-from portal_data -v $(pwd)/backup:/backup \
ubuntu cp -r /portal/static /backup
### DEMO: broken currency conversion
### Linking
# https://docs.docker.com/userguide/dockerlinks/
docker run --link rates:rates ubuntu env
### Let's link rates service to portal
docker run --link rates:rates ubuntu env
# TODO edit 'start_portal.sh':
--link rates:rates
# TODO fix '03_portal/server.py' (use docker env variables)
# TODO rebuild
# TODO rerun
docker inspect -f "{{ .HostConfig.Links }}" portal
### Reusing # https://hub.docker.com/r/ekino/wiremock/ # https://github.com/ekino/docker-wiremock cd 06_wiremock # TODO run mocked rates service using 'ekino/wiremock' image # to test: curl http://[HOST]:8081/rates/eur/usd
docker run -d -p 8081:8080 \ -v $(pwd)/__files:/wiremock/__files \ -v $(pwd)/mappings:/wiremock/mappings \ --name mocked_rates \ ekino/wiremock
### Connect portal to mocked rates service
# TODO edit 'start_portal.sh':
--link mocked_rates:rates
### Docker compose
cd workshop/08_compose
cat docker-compose.yml
docker-compose up
cd workshop/09_metrics
docker-compose up
docker run --name boring_wozniak ubuntu ls
docker run --name sick_darwin ubuntu ls
docker run --name mad_torvalds ubuntu ls
...but here's a link
Java developer
Frontend developer


{{include.description}}
Price: {{site.data.main.currency}}{{include.price}}
Weight: {{include.weight}} gms
Category: {{include.category}}


I want to thank you all for trying to stop Donald Trump. I started voteswap because doing nothing was not acceptable. Thank you for joining me in not doing nothing. In the end, the combined efforts of the Clinton campaign, the other vote trading websites like trumptraders.org and makeminecount.org, and the legions of volunteers across the country were not enough to overcome the popular revolution headed by Donald Trump.
In Florida, Gary Johnson got 206,007 votes and Hillary Clinton lost by 119,770. Clinton lost Pennsylvania by 68,236, and North Carolina by 177,529 votes. Those are wide margins that vote trading probably couldn't have overcome, even if it were much more popular. This isn't like 2000, where 537 votes set the direction of the country for the next eight years. This was a real popular movement that couldn't be stopped.
I know you're all unhappy about the outcome; so am I. I took yesterday off of work to volunteer for local races (YIMBY did pretty well in San Francisco), and I took today off of work to let it sink in. This election has served as a nucleation point for me: I've never been more involved in politics and I'll keep getting more involved in the future. I hope you feel the same. Non-participation in our democracy isn't an option with good outcomes.
I'll be deleting all user accounts in the coming days. I believe in strong privacy rights and since there's no need for me to keep your information, then you deserve to have me delete it. If you'd like to stay informed about any future developments in voteswap.us, please email<EMAIL_ADDRESS>and I'll keep your information around.
Everything will be ok. Trump doesn't have the authority to follow through on his most incendiary claims. Ivanka Trump is his most trusted advisor and she'll guide him on Women's rights and healthcare; she'll have a moderating force on his presidency. He's also now firmly within the Republican political establishment, which has no great love for him and has actual policy goals they want to achieve. He'll end up being personally relatively powerless but soak up lots of credit and adulation for the policy changes the party will enact.
I believe in our republic, and I believe in our people. We'll get through this. See you again in four years.
Cheers,
Steven


Toggle navigation
TeamApp
Start
Profile
Courses
Feedback
Log Out
Leave Feedback
Donald Trump
Overall experience with him/her:
Leave a comment (optional, max 30 words):


WATCH- Journalist’s question in ‘shuddh’ Hindi stumps Indian cricketer Ravichandran Ashwin, gives hilarious reply
by JKR StaffIndian bowler Ravichandran Ashwin recently found himself at the receiving end as a journalist posed a question in ‘pure and clean’ Hindi. Unfazed by his inability to understand the question, Ashwin decided to add humour in his response, leaving everyone in the room splits.
The journalist had asked him a question on the use of the pink ball in the upcoming Test against Bangladesh and whether this would impact the game of cricket. The journalist’s choice of words were badhayi to congratulate Ashwin for ‘completing 250 Test wickets’ and abbhyas satra to describe practice session. There were other words that too sounded wierd even to prolific Hindi speakers. Ashwin has taken 362 Test wickets and not 250 as claimed by the reporter in question.
Ashwin, who hails from Tamil Nadu, came up with an epic reply, “Sir, I’ve worked hard to start to speak in Hindi. Over the years, my Hindi has gotten better. But I have never heard such pure and clean Hindi. So congrats to you. I am still trying to understand what your question was.”
On the use of the pink ball, Ashwin said, “The next Test match (against Bangladesh) is a pink-ball match. This is a great welcoming sign. This was important for a Test country like India. Now office-goers can also come to the ground and watch the game.”
Ashwin’s three-wicket haul in the second innings played a key role in scripting India’s win by an innings and 130 runs over Bangladesh at the Indore Test on Saturday.


[1] lovely hosts , beautiful property but location/sh1 lets it down ( for us personally )
[2] the lodge for one night recently , out of an original booking of and 3 nights .
[3] suite -rrb-/-rrb- it is around nzd 200 per night too expensive looking at other local accommodation .


Seer Manakia:
Someday I shall return to the Immortal Plateau to take the Test of the Lord! But I have unfinished business in this land!


Description of the Problem
https://www.lintcode.com/problem/clone-graph/description
137. Clone Graph Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. How we serialize an undirected graph: Nodes are labeled uniquely. We use # as a separator for each node, and , as a separator for node label and each neighbor of the node. As an example, consider the serialized graph {0,1,2#1,2#2,2}. The graph has a total of three nodes, and therefore contains three parts as separated by #. First node is labeled as 0. Connect node 0 to both nodes 1 and 2. Second node is labeled as 1. Connect node 1 to node 2. Third node is labeled as 2. Connect node 2 to node 2 (itself), thus forming a self-cycle. Visually, the graph looks like the following: 1 / \ / \ 0 --- 2 / \ \_/ Example return a deep copied graph.
Idea to solve the problem
Deep Clone/Travesal/HashMap
My codes
/**
* Definition for undirected graph.
* class UndirectedGraphNode {
* int label;
* ArrayList neighbors;
* UndirectedGraphNode(int x) { label = x; neighbors = new ArrayList(); }
* };
*/
public class Solution {
/*
* @param node: A undirected graph node
* @return: A undirected graph node
*/
// Total runtime 1743 ms. Your submission beats 99.60% Submissions!
private HashMap m = new HashMap<>();
public UndirectedGraphNode cloneGraph(UndirectedGraphNode node) {
if ( node == null ) return null;
UndirectedGraphNode ng = new UndirectedGraphNode(node.label);
m.put(node.label, ng);
if ( node.neighbors != null ) {
ArrayList neighbors = new ArrayList<>();
for (UndirectedGraphNode neighbor: node.neighbors) {
UndirectedGraphNode newNode = m.get(neighbor.label);
if ( newNode == null ) {
newNode = cloneGraph(neighbor);
m.put(neighbor.label, newNode);
}
neighbors.add(newNode);
}
ng.neighbors = neighbors;
}
return ng;
}
private HashMap m2 = new HashMap<>();
// Total Runtime: 1788 ms
public UndirectedGraphNode cloneGraph2(UndirectedGraphNode node) {
if (node == null) {
return null;
}
UndirectedGraphNode ng = new UndirectedGraphNode(node.label);
m2.put(node, ng);
if (node.neighbors != null) {
ArrayList neighbors = new ArrayList<>();
for (UndirectedGraphNode neighbor : node.neighbors) {
UndirectedGraphNode newNode = m2.get(neighbor);
if (newNode == null) {
newNode = cloneGraph(neighbor);
m2.put(neighbor, newNode);
}
neighbors.add(newNode);
}
ng.neighbors = neighbors;
}
return ng;
}
}


---
layout: post
title: Points to consider while building a Machine Learning model
date: '2017-02-18T22:00:00.002-08:00'
author: Sujay S Kumar
tags:
modified_time: '2017-02-26T07:31:51.922-08:00'
blogger_id: tag:blogger.com,1999:blog-925060870564624560.post-2373839901009698570
blogger_orig_url: http://sujayskumar.blogspot.com/2017/02/points-to-consider-while-building.html
---
The objective of this post is to list down some of the pointers to keep in mind while building a Machine Learning model.
- Always start with the simplest of models. You can increase the complexity if the performance of a simple model is inadequate.
- Understand your dataset first.
- Build a baseline model before building any prediction model. I will expand on this further in another post.
- Complex models tend to over fit and simpler models tend to under fit. It is your job to find a balance between these two.
- High bias and low variance - A property of simpler models. Suggests under fitting.
- High variance and low bias - A property of complex models. Suggests over fitting.
- In any Machine Learning model, if the number of parameters is greater than the number of training examples, beware. It leads to over fitting. Try considering a simpler model with lesser number of parameters or reduce the number of hidden layers or anything else to reduce the number of parameters of the model.
- Always normalize the inputs. Neural Networks are optimized for working on numbers between 0 and 1. Any number greater than 1 leads to explosive gradient descent, which involves weight updates by large numbers.
- Regularization is very very important. Therefore, consider using an XGBoost model instead of Random Forest.
Some terms to keep in mind:
- Stratified Sampling - When the training data is overly skewed, the practice of picking the samples such the final training data has the distribution you need.
- Bootstrapping - Evaluating the same model with different random seeds.


{% load static %} {% include 'header.html' %}
Fields with * are mandetory
Please Upload Your Passport Size Photo*
Please Upload Your Updated Resume*
Already a member? Login Here
In case you are using a public/shared computer we recommend that you logout to prevent any un-authorized access to your account


Create a new account
Please enter your account information. Note that all new accounts are subject to approval prior to activation. A valid email address is required for account activation.
Invalid user name and/or password.
User name
First name
Last name
Password
Verify password
Email


This extension lets you use Chrome's text-to-speech (TTS) capabilities to speak any text you find on the web.
Select some text anywhere on a webpage, then either:
1. Click on the button in the toolbar ↗, or
2. Use this hot key:
Click the button or press the key again to stop speech.


We're sorry but 健康管理与预警急救管理服务智慧云平台 doesn't work properly without JavaScript enabled. Please enable it to continue.


{% extends 'events/base.html' %} {% load events_filters %} {% block content %} {% for event in events %}
{{ event.date }}
{{ event.venue|upper }} - {{ event.time }}
{{event.details|safe|truncatewords_html:25}}
{{ event.get_number_of_attendees }} Attending


1 And this prediction of the Egyptians about the Greeks was true enough. But now let me show the prospect for the Egyptians themselves: if, as I have already said, the country below Memphis (for it is this which rises) should increase in height in the same proportion as formerly, will not the Egyptians who inhabit it go hungry, as there is no rain in their country and the river will be unable to inundate their fields?
2 At present, of course, there are no people, either in the rest of Egypt or in the whole world, who live from the soil with so little labor; they do not have to break the land up with the plough, or hoe, or do any other work that other men do to get a crop; the river rises of itself, waters the fields, and then sinks back again; then each man sows his field and sends swine into it to tread down the seed, and waits for the harvest; then he has the swine thresh his grain, and so garners it.


SOUND_removeTone 183 music.c SOUND_removeTone(i); SOUND_removeTone 237 music.c SOUND_removeTone(i); SOUND_removeTone 249 music.c SOUND_removeTone(i); SOUND_removeTone 258 music.c SOUND_removeTone(i); SOUND_removeTone 296 music.c SOUND_removeTone(i); SOUND_removeTone 308 music.c SOUND_removeTone(i); SOUND_removeTone 317 music.c SOUND_removeTone(i);


JavaJam Coffee House
Relax at the JavaJam
- Speciality Coffe and Tea
- Bagels, Muffins, and Gluten-free Pastries
- Organic Salads
- Music and Poetry Readings
- Open Mic Night
12010 Garrett Bay Road
Ellison Bay, WI 54210
888-555-5555
12010 Garrett Bay Road
Ellison Bay, WI 54210
888-555-5555


Football: Real Madrid blow chance to go top after frustrating draw with Betis
MADRID: Real Madrid passed up the chance to go clear at the top of La Liga after slip-ups from title rivals Barcelona and Atletico Madrid, when they could only draw 0-0 at home to struggling Real Betis on a difficult Saturday for Spain's top three sides.
Real were full of confidence after hammering Leganes 5-0 in mid-week for their biggest win of a stop-start season and appeared to get off to a great start when Eden Hazard struck early but the goal was ruled out for offside after a VAR review.
Madrid's clearest opening came in the second half when French left back Ferland Mendy surged forward towards goal but despite having plenty of time to shoot he missed the target, prompting howls of frustration from the fans behind the goal.
Real are second in the standings on 22 points after 11 games, level with leaders Barcelona who slid to a shock 3-1 loss at Levante earlier in the day.
Atletico Madrid, who have played one game more, are third on 21 points after drawing 1-1 at Sevilla, who are fourth with the same number of points. Betis are 14th with 13.
Karim Benzema saw a shot well saved in a bright opening spell while Toni Kroos came close to scoring from a free kick but Betis, who were victorious on their last two visits to the Santiago Bernabeu, were not shy down the other end.
French midfielder Nabil Fekir flashed a shot just wide in the first half and Loren Moron tried in vain to lob Thibaut Courtois, who had to make a smart save to deny Fekir late in the game.
Madrid had a penalty appeal for handball turned down in the closing stages while Vinicius Jr. and Dani Carvajal were both thwarted in stoppage time by Betis goalkeeper Joel Robles.


Simple Cost Effective Solutions for Startups
You could pay more ! You make complicated ! But you want to get started fast and simple for less.


| FEATURE ARTICLE | |||||||||||||||||||
Kristen Lynch is a law student at Nova Southeastern University in Fort Lauderdale, Florida
|
How Zealous is Too Zealous? And Are Zealous Defenders of the Guilty Truly Devils Advocates? : A Discussion of the Movie The Devils Advocate, and Why I Will Never Practice Criminal Law By Kristen M. Lynch As someone that has been fascinated by the law since my youth, I have always known that one day I wanted to attend law school. The problem, up until recently, was that I did not know what kind of law I wanted to practice, but I knew that I did not want to be a criminal attorney. After seeing the movie The Devils Advocate, the reasons became crystal clear.
Growing up watching Perry Mason episodes, I developed a kind of admiration for attorneys. They were strong, intelligent and always somehow found out the truth. On that show, the guilty were always found out eventually and the innocent were always set free.  In reality, the "justice system" has become something much more complex, filled with technicalities and loopholes. In The Devils Advocate, Keanu Reeves portrays the character of Kevin Lomax, ironically a Florida prosecutor turned defense attorney that has never lost a case. The film centers on a pivotal decision that Kevin has to make, and the consequences of his choice. In the early part of the movie, Kevin is shown defending a teacher accused of molesting a teenage girl. During the prosecutions questioning of the alleged victim, it becomes apparent to Kevin that his client is guilty. Kevin calls a recess before his cross-examination and is forced to make a decision. On the one hand he does not want to lose a case, but on the other hand he knows that to win he must push the envelope to free a guilty man. This is not an enviable choice.  As I watched this movie I was mesmerized. Someone somehow had managed to portray in film my own personal anxieties regarding criminal law. I decided that I was going to use this movie as my paper topic for a seminar I am enrolled in on "Law and Popular Culture". There were several ways to approach this movie, such as the portrayal of the devil as an attorney, the obvious parody of Paradise Lost and the references to The Divine Comedy also known as Dantes Inferno. There is also an existentialist theme of self-determination throughout the movie, somewhat relating to free will and the choices that attorneys are faced with. But as I began researching these various themes for my term paper in progress, I realized that I was not alone in my anxieties. There are innumerable bar journal articles that discuss whether it is possible to be a defense attorney and still be a moral human being. There are articles that discuss whether one can be an attorney at all and still be religious. The main theme of these articles revolves around the degree to which we are required to zealously represent our clients. The public has seen in recent years the Menendez Brothers being represented by Leslie Abramson and O.J. Simpson being represented by Johnny Cochran. There is a public perception that most defense attorneys are hired guns that do not care about their clients guilt or innocence as long as they are being paid well. In real life trials, we as the public are never privy to the thoughts of the defense attorneys regarding their beliefs of the true guilt or innocence of their clients because of attorney client privilege. However, in the movies and on television we can see behind the scenes. In the 1996 movie Primal Fear, Richard Gere played attorney Martin Vail, a Chicago defense attorney that took the case of an alleged murderer because "Everybody will want this one". Ironically, Vail actually thought there was a chance his client was innocent and did not realize until the end of the trial that his client really did commit the murder. When he realized that he had fallen prey to his clients manipulations, he was filled with some degree of remorse. This portrayal at least represents a view to the public that even hired guns can have a conscience and perhaps suggests the idea that maybe the only way that some defense attorneys can do the job they are paid to do is to, perhaps subconsciously, believe in the innocence of their clients. In a recent episode of The Practice, we were also privy to behind-the-scene debates over freeing an accused nun murderer on a technicality. The attorneys did not choose this case as a judge assigned it to them. When they protested, the judge pointed out to them that they had recently represented someone who was caught carrying a severed head with them. The attorneys protested and said "but he was innocent!" The defense attorneys reluctantly took the case and even more reluctantly pointed out that there had been an illegal search conducted that ultimately revealed the body of the dead nun, thus excluding it from evidence. At one point in the show the senior partner confronted the attorney assigned to the case and suggested he had seen her plead more convincingly in previous cases. Even the judge in that episode was shown to feel a moral dilemma over the prospect of setting the alleged murdered free due to an unconstitutional search of his apartment. My contention is that all of this points to an admission that perhaps the structure of our legal system currently is such that we are all faced with unjust outcomes to protect the idea of fairness. So what is a defense attorney to do? There appear to only be four possible outcomes in the world of the defense attorney: 1) defend the client as zealously as you would if you knew they were innocent; 2) defend the client but perhaps not so zealously; 3) resign from the case; and 4) be more careful in your choice of clients. Choice number one is what Kevin Lomax made that led him down the path of moral destruction. Choice number three is what he made when given a second chance, and based on the implications of the movie, this was not the best choice either. Also, there have been numerous bar journal articles regarding attorneys resigning from cases and yes, it is a violation of the Model Rules of Professional Conduct to abandon your client at a crucial point of the trial. What seems to be suggested from the myriad of bar journal articles and from television and movies are two things: 1) choose your clients carefully, because we should be held accountable for our choice of clients, and 2) perhaps the "known guilty" do not merit an overly zealous defense. There are concessions made that no one wants to see anyone denied their constitutional rights, and that everyone deserves adequate representation. It does, however, beg the question of whether we are truly in court seeking justice or whether we are merely there to win at all costs, in effect the means justifying the end. In The Devils Advocate the devils favorite sin was vanity. It is up to us in the legal community to determine whether we are all in it for the personal win and our egos . . .or for justice, and whether we are willing to become an advocate of the devil in the process.
|


FTW Aviation Archive
Veterans Memorial Air Park, Fort Worth, TX
Home
·
About
·
Contact
·
Browse Archive
{{ content }}


--- name: mail.email url: /:id animationIn: fadeIn animationOut: fadeOut ---
This email is for: {{ params.id }}


| DOSE: |
1 capsl |
oral |
MDMA |
(capsule) |
I have suffered from modertately to possibly severe social anxiety throughout my whole life. And in the past 1 and a half years I have turned to drugs/weed for a solution, although I never saw myself doing for that reason at the time. It has been 12 days since I last smoked, the longest time in about a year, and 4 days since I last took a drug of any sort, which was ecstacy.
I had bought 2 capsules of approx 110mg pure mdma and took one of them 2 days prior to this experience and had a decent, normal roll. The next day I snorted about 20 mg of the remaining capsule and felt noticeable stimulated for an hour and a half. The next day I decided to take the rest of the remainging capsule, knowing that I would not roll that hard, but still have a significant experience.
I was alone in my house and my parents had just gone to sleep. About a 25 minutes after dropping I felt the first alerts. I was rolling a not very hard, but rolling by 45 minutes into it. I didn't do much but sit and chat on the compueter, but then all of a sudden I started a thought chain in my head, about my depression and social anxiety. My whole life I have been fairly quiet in crowds and experience intense anxiety when I would try to talk or think of something to say. People would always tell me 'just be yourself and your thoughts will come to you'. I never understood the meaning of that until now.
I interpreted that as 'when i am normal, I will talk like everyone else was'. That was my problem, that is not the meaning. I came to my big realization 'being myself isn't having something to say; it's understanding that I have nothing to say'. After I realized this I was speechless and Ok with it for the first time in my life. I just started crying, and continued to do so for about 15 minutes, just streaming tears. I had never experienced anything like that feeling in my life, it was quite possibly the most significant thing that has ever happened to me.
The rest of the trip was amazing, I thought about so many different things and came up with an entirely new outlook on life. The next day at school one of my good friends came up to me and said 'what's wrong?'. She said that I looked different, too peaceful to not be on some drug or another, which she thought must have been the case.  I have finally come to terms with myself and can accept myself for the person I really am.
I am now beginning to meditate and am considering adopting the ideas of Buddhism into my everyday life. E has changed the way I live, I never even want to do drugs again, with the exception of psychadelics which I want to use for spiritual purposes.  Thank you MDMA!
Experience Reports are the writings and opinions of the individual authors who submit them.
Some of the activities described are dangerous and/or illegal and none are recommended by Erowid.