| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final short |
AALOAD |
50 |
public static final short |
AASTORE |
83 |
public static final short |
ACC_ABSTRACT |
1024 |
public static final short |
ACC_ANNOTATION |
8192 |
public static final short |
ACC_BRIDGE |
64 |
public static final short |
ACC_ENUM |
16384 |
public static final short |
ACC_FINAL |
16 |
public static final short |
ACC_INTERFACE |
512 |
public static final short |
ACC_MANDATED |
-32768 |
public static final short |
ACC_NATIVE |
256 |
public static final short |
ACC_PRIVATE |
2 |
public static final short |
ACC_PROTECTED |
4 |
public static final short |
ACC_PUBLIC |
1 |
public static final short |
ACC_STATIC |
8 |
public static final short |
ACC_STRICT |
2048 |
public static final short |
ACC_SUPER |
32 |
public static final short |
ACC_SYNCHRONIZED |
32 |
public static final short |
ACC_SYNTHETIC |
4096 |
public static final short |
ACC_TRANSIENT |
128 |
public static final short |
ACC_VARARGS |
128 |
public static final short |
ACC_VOLATILE |
64 |
public static final short |
ACONST_NULL |
1 |
public static final short |
ALOAD |
25 |
public static final short |
ALOAD_0 |
42 |
public static final short |
ALOAD_1 |
43 |
public static final short |
ALOAD_2 |
44 |
public static final short |
ALOAD_3 |
45 |
public static final short |
ANEWARRAY |
189 |
public static final short |
ANEWARRAY_QUICK |
222 |
public static final int |
APPEND_FRAME |
252 |
public static final int |
APPEND_FRAME_MAX |
254 |
public static final short |
ARETURN |
176 |
public static final short |
ARRAYLENGTH |
190 |
public static final short |
ASTORE |
58 |
public static final short |
ASTORE_0 |
75 |
public static final short |
ASTORE_1 |
76 |
public static final short |
ASTORE_2 |
77 |
public static final short |
ASTORE_3 |
78 |
public static final short |
ATHROW |
191 |
public static final byte |
ATTR_ANNOTATION_DEFAULT |
16 |
public static final byte |
ATTR_BOOTSTRAP_METHODS |
20 |
public static final byte |
ATTR_CODE |
2 |
public static final byte |
ATTR_CONSTANT_VALUE |
1 |
public static final byte |
ATTR_DEPRECATED |
8 |
public static final byte |
ATTR_ENCLOSING_METHOD |
18 |
public static final byte |
ATTR_EXCEPTIONS |
3 |
public static final byte |
ATTR_INNER_CLASSES |
6 |
public static final byte |
ATTR_LINE_NUMBER_TABLE |
4 |
public static final byte |
ATTR_LOCAL_VARIABLE_TABLE |
5 |
public static final byte |
ATTR_LOCAL_VARIABLE_TYPE_TABLE |
17 |
public static final byte |
ATTR_METHOD_PARAMETERS |
21 |
public static final byte |
ATTR_PMG |
9 |
public static final byte |
ATTR_RUNTIME_INVISIBLE_ANNOTATIONS |
13 |
public static final byte |
ATTR_RUNTIME_INVISIBLE_PARAMETER_ANNOTATIONS |
15 |
public static final byte |
ATTR_RUNTIME_VISIBLE_ANNOTATIONS |
12 |
public static final byte |
ATTR_RUNTIME_VISIBLE_PARAMETER_ANNOTATIONS |
14 |
public static final byte |
ATTR_SIGNATURE |
10 |
public static final byte |
ATTR_SOURCE_FILE |
0 |
public static final byte |
ATTR_STACK_MAP |
11 |
public static final byte |
ATTR_STACK_MAP_TABLE |
19 |
public static final byte |
ATTR_SYNTHETIC |
7 |
public static final byte |
ATTR_UNKNOWN |
-1 |
public static final short |
BALOAD |
51 |
public static final short |
BASTORE |
84 |
public static final short |
BIPUSH |
16 |
public static final short |
BREAKPOINT |
202 |
public static final short |
CALOAD |
52 |
public static final short |
CASTORE |
85 |
public static final short |
CHECKCAST |
192 |
public static final short |
CHECKCAST_QUICK |
224 |
public static final int |
CHOP_FRAME |
248 |
public static final int |
CHOP_FRAME_MAX |
250 |
public static final byte |
CONSTANT_Class |
7 |
public static final byte |
CONSTANT_Double |
6 |
public static final byte |
CONSTANT_Fieldref |
9 |
public static final byte |
CONSTANT_Float |
4 |
public static final byte |
CONSTANT_Integer |
3 |
public static final byte |
CONSTANT_InterfaceMethodref |
11 |
public static final byte |
CONSTANT_InvokeDynamic |
18 |
public static final byte |
CONSTANT_Long |
5 |
public static final byte |
CONSTANT_MethodHandle |
15 |
public static final byte |
CONSTANT_Methodref |
10 |
public static final byte |
CONSTANT_MethodType |
16 |
public static final byte |
CONSTANT_NameAndType |
12 |
public static final byte |
CONSTANT_String |
8 |
public static final byte |
CONSTANT_Utf8 |
1 |
public static final String |
CONSTRUCTOR_NAME |
"<init>" |
public static final short |
D2F |
144 |
public static final short |
D2I |
142 |
public static final short |
D2L |
143 |
public static final short |
DADD |
99 |
public static final short |
DALOAD |
49 |
public static final short |
DASTORE |
82 |
public static final short |
DCMPG |
152 |
public static final short |
DCMPL |
151 |
public static final short |
DCONST_0 |
14 |
public static final short |
DCONST_1 |
15 |
public static final short |
DDIV |
111 |
public static final short |
DLOAD |
24 |
public static final short |
DLOAD_0 |
38 |
public static final short |
DLOAD_1 |
39 |
public static final short |
DLOAD_2 |
40 |
public static final short |
DLOAD_3 |
41 |
public static final short |
DMUL |
107 |
public static final short |
DNEG |
119 |
public static final short |
DREM |
115 |
public static final short |
DRETURN |
175 |
public static final short |
DSTORE |
57 |
public static final short |
DSTORE_0 |
71 |
public static final short |
DSTORE_1 |
72 |
public static final short |
DSTORE_2 |
73 |
public static final short |
DSTORE_3 |
74 |
public static final short |
DSUB |
103 |
public static final short |
DUP |
89 |
public static final short |
DUP_X1 |
90 |
public static final short |
DUP_X2 |
91 |
public static final short |
DUP2 |
92 |
public static final short |
DUP2_X1 |
93 |
public static final short |
DUP2_X2 |
94 |
public static final short |
F2D |
141 |
public static final short |
F2I |
139 |
public static final short |
F2L |
140 |
public static final short |
FADD |
98 |
public static final short |
FALOAD |
48 |
public static final short |
FASTORE |
81 |
public static final short |
FCMPG |
150 |
public static final short |
FCMPL |
149 |
public static final short |
FCONST_0 |
11 |
public static final short |
FCONST_1 |
12 |
public static final short |
FCONST_2 |
13 |
public static final short |
FDIV |
110 |
public static final short |
FLOAD |
23 |
public static final short |
FLOAD_0 |
34 |
public static final short |
FLOAD_1 |
35 |
public static final short |
FLOAD_2 |
36 |
public static final short |
FLOAD_3 |
37 |
public static final short |
FMUL |
106 |
public static final short |
FNEG |
118 |
public static final short |
FREM |
114 |
public static final short |
FRETURN |
174 |
public static final short |
FSTORE |
56 |
public static final short |
FSTORE_0 |
67 |
public static final short |
FSTORE_1 |
68 |
public static final short |
FSTORE_2 |
69 |
public static final short |
FSTORE_3 |
70 |
public static final short |
FSUB |
102 |
public static final int |
FULL_FRAME |
255 |
public static final short |
GETFIELD |
180 |
public static final short |
GETFIELD_QUICK |
206 |
public static final short |
GETFIELD_QUICK_W |
227 |
public static final short |
GETFIELD2_QUICK |
208 |
public static final short |
GETSTATIC |
178 |
public static final short |
GETSTATIC_QUICK |
210 |
public static final short |
GETSTATIC2_QUICK |
212 |
public static final short |
GOTO |
167 |
public static final short |
GOTO_W |
200 |
public static final short |
I2B |
145 |
public static final short |
I2C |
146 |
public static final short |
I2D |
135 |
public static final short |
I2F |
134 |
public static final short |
I2L |
133 |
public static final short |
I2S |
147 |
public static final short |
IADD |
96 |
public static final short |
IALOAD |
46 |
public static final short |
IAND |
126 |
public static final short |
IASTORE |
79 |
public static final short |
ICONST_0 |
3 |
public static final short |
ICONST_1 |
4 |
public static final short |
ICONST_2 |
5 |
public static final short |
ICONST_3 |
6 |
public static final short |
ICONST_4 |
7 |
public static final short |
ICONST_5 |
8 |
public static final short |
ICONST_M1 |
2 |
public static final short |
IDIV |
108 |
public static final short |
IF_ACMPEQ |
165 |
public static final short |
IF_ACMPNE |
166 |
public static final short |
IF_ICMPEQ |
159 |
public static final short |
IF_ICMPGE |
162 |
public static final short |
IF_ICMPGT |
163 |
public static final short |
IF_ICMPLE |
164 |
public static final short |
IF_ICMPLT |
161 |
public static final short |
IF_ICMPNE |
160 |
public static final short |
IFEQ |
153 |
public static final short |
IFGE |
156 |
public static final short |
IFGT |
157 |
public static final short |
IFLE |
158 |
public static final short |
IFLT |
155 |
public static final short |
IFNE |
154 |
public static final short |
IFNONNULL |
199 |
public static final short |
IFNULL |
198 |
public static final short |
IINC |
132 |
public static final String |
ILLEGAL_OPCODE |
"<illegal opcode>" |
public static final String |
ILLEGAL_TYPE |
"<illegal type>" |
public static final short |
ILOAD |
21 |
public static final short |
ILOAD_0 |
26 |
public static final short |
ILOAD_1 |
27 |
public static final short |
ILOAD_2 |
28 |
public static final short |
ILOAD_3 |
29 |
public static final short |
IMPDEP1 |
254 |
public static final short |
IMPDEP2 |
255 |
public static final short |
IMUL |
104 |
public static final short |
INEG |
116 |
public static final short |
INSTANCEOF |
193 |
public static final short |
INSTANCEOF_QUICK |
225 |
public static final short |
INT2BYTE |
145 |
public static final short |
INT2CHAR |
146 |
public static final short |
INT2SHORT |
147 |
public static final short |
INVOKEDYNAMIC |
186 |
public static final short |
INVOKEINTERFACE |
185 |
public static final short |
INVOKEINTERFACE_QUICK |
218 |
public static final short |
INVOKENONVIRTUAL |
183 |
public static final short |
INVOKENONVIRTUAL_QUICK |
215 |
public static final short |
INVOKESPECIAL |
183 |
public static final short |
INVOKESTATIC |
184 |
public static final short |
INVOKESTATIC_QUICK |
217 |
public static final short |
INVOKESUPER_QUICK |
216 |
public static final short |
INVOKEVIRTUAL |
182 |
public static final short |
INVOKEVIRTUAL_QUICK |
214 |
public static final short |
INVOKEVIRTUAL_QUICK_W |
226 |
public static final short |
INVOKEVIRTUALOBJECT_QUICK |
219 |
public static final short |
IOR |
128 |
public static final short |
IREM |
112 |
public static final short |
IRETURN |
172 |
public static final short |
ISHL |
120 |
public static final short |
ISHR |
122 |
public static final short |
ISTORE |
54 |
public static final short |
ISTORE_0 |
59 |
public static final short |
ISTORE_1 |
60 |
public static final short |
ISTORE_2 |
61 |
public static final short |
ISTORE_3 |
62 |
public static final short |
ISUB |
100 |
public static final byte |
ITEM_Bogus |
0 |
public static final byte |
ITEM_Double |
3 |
public static final byte |
ITEM_Float |
2 |
public static final byte |
ITEM_InitObject |
6 |
public static final byte |
ITEM_Integer |
1 |
public static final byte |
ITEM_Long |
4 |
public static final byte |
ITEM_NewObject |
8 |
public static final byte |
ITEM_Null |
5 |
public static final byte |
ITEM_Object |
7 |
public static final short |
IUSHR |
124 |
public static final short |
IXOR |
130 |
public static final short |
JSR |
168 |
public static final short |
JSR_W |
201 |
public static final int |
JVM_CLASSFILE_MAGIC |
-889275714 |
public static final short |
KNOWN_ATTRIBUTES |
22 |
public static final short |
L2D |
138 |
public static final short |
L2F |
137 |
public static final short |
L2I |
136 |
public static final short |
LADD |
97 |
public static final short |
LALOAD |
47 |
public static final short |
LAND |
127 |
public static final short |
LASTORE |
80 |
public static final short |
LCMP |
148 |
public static final short |
LCONST_0 |
9 |
public static final short |
LCONST_1 |
10 |
public static final short |
LDC |
18 |
public static final short |
LDC_QUICK |
203 |
public static final short |
LDC_W |
19 |
public static final short |
LDC_W_QUICK |
204 |
public static final short |
LDC2_W |
20 |
public static final short |
LDC2_W_QUICK |
205 |
public static final short |
LDIV |
109 |
public static final short |
LLOAD |
22 |
public static final short |
LLOAD_0 |
30 |
public static final short |
LLOAD_1 |
31 |
public static final short |
LLOAD_2 |
32 |
public static final short |
LLOAD_3 |
33 |
public static final short |
LMUL |
105 |
public static final short |
LNEG |
117 |
public static final short |
LOOKUPSWITCH |
171 |
public static final short |
LOR |
129 |
public static final short |
LREM |
113 |
public static final short |
LRETURN |
173 |
public static final short |
LSHL |
121 |
public static final short |
LSHR |
123 |
public static final short |
LSTORE |
55 |
public static final short |
LSTORE_0 |
63 |
public static final short |
LSTORE_1 |
64 |
public static final short |
LSTORE_2 |
65 |
public static final short |
LSTORE_3 |
66 |
public static final short |
LSUB |
101 |
public static final short |
LUSHR |
125 |
public static final short |
LXOR |
131 |
public static final short |
MAJOR |
45 |
public static final short |
MAJOR_1_1 |
45 |
public static final short |
MAJOR_1_2 |
46 |
public static final short |
MAJOR_1_3 |
47 |
public static final short |
MAJOR_1_4 |
48 |
public static final short |
MAJOR_1_5 |
49 |
public static final short |
MAJOR_1_6 |
50 |
public static final short |
MAJOR_1_7 |
51 |
public static final short |
MAJOR_1_8 |
52 |
public static final short |
MAJOR_1_9 |
53 |
public static final short |
MAX_ACC_FLAG |
16384 |
public static final int |
MAX_ARRAY_DIMENSIONS |
255 |
public static final int |
MAX_BYTE |
255 |
public static final int |
MAX_CODE_SIZE |
65536 |
public static final int |
MAX_CP_ENTRIES |
65535 |
public static final int |
MAX_SHORT |
65535 |
public static final short |
MINOR |
3 |
public static final short |
MINOR_1_1 |
3 |
public static final short |
MINOR_1_2 |
0 |
public static final short |
MINOR_1_3 |
0 |
public static final short |
MINOR_1_4 |
0 |
public static final short |
MINOR_1_5 |
0 |
public static final short |
MINOR_1_6 |
0 |
public static final short |
MINOR_1_7 |
0 |
public static final short |
MINOR_1_8 |
0 |
public static final short |
MINOR_1_9 |
0 |
public static final short |
MONITORENTER |
194 |
public static final short |
MONITOREXIT |
195 |
public static final short |
MULTIANEWARRAY |
197 |
public static final short |
MULTIANEWARRAY_QUICK |
223 |
public static final short |
NEW |
187 |
public static final short |
NEW_QUICK |
221 |
public static final short |
NEWARRAY |
188 |
public static final short |
NOP |
0 |
public static final short |
POP |
87 |
public static final short |
POP2 |
88 |
public static final short |
PUSH |
4711 |
public static final short |
PUTFIELD |
181 |
public static final short |
PUTFIELD_QUICK |
207 |
public static final short |
PUTFIELD_QUICK_W |
228 |
public static final short |
PUTFIELD2_QUICK |
209 |
public static final short |
PUTSTATIC |
179 |
public static final short |
PUTSTATIC_QUICK |
211 |
public static final short |
PUTSTATIC2_QUICK |
213 |
public static final byte |
REF_getField |
1 |
public static final byte |
REF_getStatic |
2 |
public static final byte |
REF_invokeInterface |
9 |
public static final byte |
REF_invokeSpecial |
7 |
public static final byte |
REF_invokeStatic |
6 |
public static final byte |
REF_invokeVirtual |
5 |
public static final byte |
REF_newInvokeSpecial |
8 |
public static final byte |
REF_putField |
3 |
public static final byte |
REF_putStatic |
4 |
public static final short |
RESERVED |
-3 |
public static final short |
RET |
169 |
public static final short |
RETURN |
177 |
public static final short |
SALOAD |
53 |
public static final int |
SAME_FRAME |
0 |
public static final int |
SAME_FRAME_EXTENDED |
251 |
public static final int |
SAME_FRAME_MAX |
63 |
public static final int |
SAME_LOCALS_1_STACK_ITEM_FRAME |
64 |
public static final int |
SAME_LOCALS_1_STACK_ITEM_FRAME_EXTENDED |
247 |
public static final int |
SAME_LOCALS_1_STACK_ITEM_FRAME_MAX |
127 |
public static final short |
SASTORE |
86 |
public static final short |
SIPUSH |
17 |
public static final String |
STATIC_INITIALIZER_NAME |
"<clinit>" |
public static final short |
SWAP |
95 |
public static final short |
SWITCH |
4712 |
public static final byte |
T_ADDRESS |
16 |
public static final byte |
T_ARRAY |
13 |
public static final byte |
T_BOOLEAN |
4 |
public static final byte |
T_BYTE |
8 |
public static final byte |
T_CHAR |
5 |
public static final byte |
T_DOUBLE |
7 |
public static final byte |
T_FLOAT |
6 |
public static final byte |
T_INT |
10 |
public static final byte |
T_LONG |
11 |
public static final byte |
T_OBJECT |
14 |
public static final byte |
T_REFERENCE |
14 |
public static final byte |
T_SHORT |
9 |
public static final byte |
T_UNKNOWN |
15 |
public static final byte |
T_VOID |
12 |
public static final short |
TABLESWITCH |
170 |
public static final short |
UNDEFINED |
-1 |
public static final short |
UNPREDICTABLE |
-2 |
public static final short |
WIDE |
196 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final short |
AALOAD |
50 |
public static final short |
AASTORE |
83 |
public static final short |
ACC_ABSTRACT |
1024 |
public static final short |
ACC_ANNOTATION |
8192 |
public static final short |
ACC_BRIDGE |
64 |
public static final short |
ACC_ENUM |
16384 |
public static final short |
ACC_FINAL |
16 |
public static final short |
ACC_INTERFACE |
512 |
public static final short |
ACC_NATIVE |
256 |
public static final short |
ACC_PRIVATE |
2 |
public static final short |
ACC_PROTECTED |
4 |
public static final short |
ACC_PUBLIC |
1 |
public static final short |
ACC_STATIC |
8 |
public static final short |
ACC_STRICT |
2048 |
public static final short |
ACC_SUPER |
32 |
public static final short |
ACC_SYNCHRONIZED |
32 |
public static final short |
ACC_SYNTHETIC |
4096 |
public static final short |
ACC_TRANSIENT |
128 |
public static final short |
ACC_VARARGS |
128 |
public static final short |
ACC_VOLATILE |
64 |
public static final short |
ACONST_NULL |
1 |
public static final short |
ALOAD |
25 |
public static final short |
ALOAD_0 |
42 |
public static final short |
ALOAD_1 |
43 |
public static final short |
ALOAD_2 |
44 |
public static final short |
ALOAD_3 |
45 |
public static final short |
ANEWARRAY |
189 |
public static final short |
ANEWARRAY_QUICK |
222 |
public static final short |
ARETURN |
176 |
public static final short |
ARRAYLENGTH |
190 |
public static final short |
ASTORE |
58 |
public static final short |
ASTORE_0 |
75 |
public static final short |
ASTORE_1 |
76 |
public static final short |
ASTORE_2 |
77 |
public static final short |
ASTORE_3 |
78 |
public static final short |
ATHROW |
191 |
public static final byte |
ATTR_ANNOTATION_DEFAULT |
16 |
public static final byte |
ATTR_CODE |
2 |
public static final byte |
ATTR_CONSTANT_VALUE |
1 |
public static final byte |
ATTR_DEPRECATED |
8 |
public static final byte |
ATTR_EXCEPTIONS |
3 |
public static final byte |
ATTR_INNER_CLASSES |
6 |
public static final byte |
ATTR_LINE_NUMBER_TABLE |
4 |
public static final byte |
ATTR_LOCAL_VARIABLE_TABLE |
5 |
public static final byte |
ATTR_PMG |
9 |
public static final byte |
ATTR_RUNTIMEINVISIBLE_ANNOTATIONS |
13 |
public static final byte |
ATTR_RUNTIMEINVISIBLE_PARAMETER_ANNOTATIONS |
15 |
public static final byte |
ATTR_RUNTIMEVISIBLE_ANNOTATIONS |
12 |
public static final byte |
ATTR_RUNTIMEVISIBLE_PARAMETER_ANNOTATIONS |
14 |
public static final byte |
ATTR_SIGNATURE |
10 |
public static final byte |
ATTR_SOURCE_FILE |
0 |
public static final byte |
ATTR_STACK_MAP |
11 |
public static final byte |
ATTR_SYNTHETIC |
7 |
public static final byte |
ATTR_UNKNOWN |
-1 |
public static final short |
BALOAD |
51 |
public static final short |
BASTORE |
84 |
public static final short |
BIPUSH |
16 |
public static final short |
BREAKPOINT |
202 |
public static final short |
CALOAD |
52 |
public static final short |
CASTORE |
85 |
public static final short |
CHECKCAST |
192 |
public static final short |
CHECKCAST_QUICK |
224 |
public static final byte |
CONSTANT_Class |
7 |
public static final byte |
CONSTANT_Double |
6 |
public static final byte |
CONSTANT_Fieldref |
9 |
public static final byte |
CONSTANT_Float |
4 |
public static final byte |
CONSTANT_Integer |
3 |
public static final byte |
CONSTANT_InterfaceMethodref |
11 |
public static final byte |
CONSTANT_Long |
5 |
public static final byte |
CONSTANT_Methodref |
10 |
public static final byte |
CONSTANT_NameAndType |
12 |
public static final byte |
CONSTANT_String |
8 |
public static final byte |
CONSTANT_Utf8 |
1 |
public static final String |
CONSTRUCTOR_NAME |
"<init>" |
public static final short |
D2F |
144 |
public static final short |
D2I |
142 |
public static final short |
D2L |
143 |
public static final short |
DADD |
99 |
public static final short |
DALOAD |
49 |
public static final short |
DASTORE |
82 |
public static final short |
DCMPG |
152 |
public static final short |
DCMPL |
151 |
public static final short |
DCONST_0 |
14 |
public static final short |
DCONST_1 |
15 |
public static final short |
DDIV |
111 |
public static final short |
DLOAD |
24 |
public static final short |
DLOAD_0 |
38 |
public static final short |
DLOAD_1 |
39 |
public static final short |
DLOAD_2 |
40 |
public static final short |
DLOAD_3 |
41 |
public static final short |
DMUL |
107 |
public static final short |
DNEG |
119 |
public static final short |
DREM |
115 |
public static final short |
DRETURN |
175 |
public static final short |
DSTORE |
57 |
public static final short |
DSTORE_0 |
71 |
public static final short |
DSTORE_1 |
72 |
public static final short |
DSTORE_2 |
73 |
public static final short |
DSTORE_3 |
74 |
public static final short |
DSUB |
103 |
public static final short |
DUP |
89 |
public static final short |
DUP_X1 |
90 |
public static final short |
DUP_X2 |
91 |
public static final short |
DUP2 |
92 |
public static final short |
DUP2_X1 |
93 |
public static final short |
DUP2_X2 |
94 |
public static final short |
F2D |
141 |
public static final short |
F2I |
139 |
public static final short |
F2L |
140 |
public static final short |
FADD |
98 |
public static final short |
FALOAD |
48 |
public static final short |
FASTORE |
81 |
public static final short |
FCMPG |
150 |
public static final short |
FCMPL |
149 |
public static final short |
FCONST_0 |
11 |
public static final short |
FCONST_1 |
12 |
public static final short |
FCONST_2 |
13 |
public static final short |
FDIV |
110 |
public static final short |
FLOAD |
23 |
public static final short |
FLOAD_0 |
34 |
public static final short |
FLOAD_1 |
35 |
public static final short |
FLOAD_2 |
36 |
public static final short |
FLOAD_3 |
37 |
public static final short |
FMUL |
106 |
public static final short |
FNEG |
118 |
public static final short |
FREM |
114 |
public static final short |
FRETURN |
174 |
public static final short |
FSTORE |
56 |
public static final short |
FSTORE_0 |
67 |
public static final short |
FSTORE_1 |
68 |
public static final short |
FSTORE_2 |
69 |
public static final short |
FSTORE_3 |
70 |
public static final short |
FSUB |
102 |
public static final short |
GETFIELD |
180 |
public static final short |
GETFIELD_QUICK |
206 |
public static final short |
GETFIELD_QUICK_W |
227 |
public static final short |
GETFIELD2_QUICK |
208 |
public static final short |
GETSTATIC |
178 |
public static final short |
GETSTATIC_QUICK |
210 |
public static final short |
GETSTATIC2_QUICK |
212 |
public static final short |
GOTO |
167 |
public static final short |
GOTO_W |
200 |
public static final short |
I2B |
145 |
public static final short |
I2C |
146 |
public static final short |
I2D |
135 |
public static final short |
I2F |
134 |
public static final short |
I2L |
133 |
public static final short |
I2S |
147 |
public static final short |
IADD |
96 |
public static final short |
IALOAD |
46 |
public static final short |
IAND |
126 |
public static final short |
IASTORE |
79 |
public static final short |
ICONST_0 |
3 |
public static final short |
ICONST_1 |
4 |
public static final short |
ICONST_2 |
5 |
public static final short |
ICONST_3 |
6 |
public static final short |
ICONST_4 |
7 |
public static final short |
ICONST_5 |
8 |
public static final short |
ICONST_M1 |
2 |
public static final short |
IDIV |
108 |
public static final short |
IF_ACMPEQ |
165 |
public static final short |
IF_ACMPNE |
166 |
public static final short |
IF_ICMPEQ |
159 |
public static final short |
IF_ICMPGE |
162 |
public static final short |
IF_ICMPGT |
163 |
public static final short |
IF_ICMPLE |
164 |
public static final short |
IF_ICMPLT |
161 |
public static final short |
IF_ICMPNE |
160 |
public static final short |
IFEQ |
153 |
public static final short |
IFGE |
156 |
public static final short |
IFGT |
157 |
public static final short |
IFLE |
158 |
public static final short |
IFLT |
155 |
public static final short |
IFNE |
154 |
public static final short |
IFNONNULL |
199 |
public static final short |
IFNULL |
198 |
public static final short |
IINC |
132 |
public static final String |
ILLEGAL_OPCODE |
"<illegal opcode>" |
public static final String |
ILLEGAL_TYPE |
"<illegal type>" |
public static final short |
ILOAD |
21 |
public static final short |
ILOAD_0 |
26 |
public static final short |
ILOAD_1 |
27 |
public static final short |
ILOAD_2 |
28 |
public static final short |
ILOAD_3 |
29 |
public static final short |
IMPDEP1 |
254 |
public static final short |
IMPDEP2 |
255 |
public static final short |
IMUL |
104 |
public static final short |
INEG |
116 |
public static final short |
INSTANCEOF |
193 |
public static final short |
INSTANCEOF_QUICK |
225 |
public static final short |
INT2BYTE |
145 |
public static final short |
INT2CHAR |
146 |
public static final short |
INT2SHORT |
147 |
public static final short |
INVOKEDYNAMIC |
186 |
public static final short |
INVOKEINTERFACE |
185 |
public static final short |
INVOKEINTERFACE_QUICK |
218 |
public static final short |
INVOKENONVIRTUAL |
183 |
public static final short |
INVOKENONVIRTUAL_QUICK |
215 |
public static final short |
INVOKESPECIAL |
183 |
public static final short |
INVOKESTATIC |
184 |
public static final short |
INVOKESTATIC_QUICK |
217 |
public static final short |
INVOKESUPER_QUICK |
216 |
public static final short |
INVOKEVIRTUAL |
182 |
public static final short |
INVOKEVIRTUAL_QUICK |
214 |
public static final short |
INVOKEVIRTUAL_QUICK_W |
226 |
public static final short |
INVOKEVIRTUALOBJECT_QUICK |
219 |
public static final short |
IOR |
128 |
public static final short |
IREM |
112 |
public static final short |
IRETURN |
172 |
public static final short |
ISHL |
120 |
public static final short |
ISHR |
122 |
public static final short |
ISTORE |
54 |
public static final short |
ISTORE_0 |
59 |
public static final short |
ISTORE_1 |
60 |
public static final short |
ISTORE_2 |
61 |
public static final short |
ISTORE_3 |
62 |
public static final short |
ISUB |
100 |
public static final byte |
ITEM_Bogus |
0 |
public static final byte |
ITEM_Double |
3 |
public static final byte |
ITEM_Float |
2 |
public static final byte |
ITEM_InitObject |
6 |
public static final byte |
ITEM_Integer |
1 |
public static final byte |
ITEM_Long |
4 |
public static final byte |
ITEM_NewObject |
8 |
public static final byte |
ITEM_Null |
5 |
public static final byte |
ITEM_Object |
7 |
public static final short |
IUSHR |
124 |
public static final short |
IXOR |
130 |
public static final short |
JSR |
168 |
public static final short |
JSR_W |
201 |
public static final short |
KNOWN_ATTRIBUTES |
12 |
public static final short |
L2D |
138 |
public static final short |
L2F |
137 |
public static final short |
L2I |
136 |
public static final short |
LADD |
97 |
public static final short |
LALOAD |
47 |
public static final short |
LAND |
127 |
public static final short |
LASTORE |
80 |
public static final short |
LCMP |
148 |
public static final short |
LCONST_0 |
9 |
public static final short |
LCONST_1 |
10 |
public static final short |
LDC |
18 |
public static final short |
LDC_QUICK |
203 |
public static final short |
LDC_W |
19 |
public static final short |
LDC_W_QUICK |
204 |
public static final short |
LDC2_W |
20 |
public static final short |
LDC2_W_QUICK |
205 |
public static final short |
LDIV |
109 |
public static final short |
LLOAD |
22 |
public static final short |
LLOAD_0 |
30 |
public static final short |
LLOAD_1 |
31 |
public static final short |
LLOAD_2 |
32 |
public static final short |
LLOAD_3 |
33 |
public static final short |
LMUL |
105 |
public static final short |
LNEG |
117 |
public static final short |
LOOKUPSWITCH |
171 |
public static final short |
LOR |
129 |
public static final short |
LREM |
113 |
public static final short |
LRETURN |
173 |
public static final short |
LSHL |
121 |
public static final short |
LSHR |
123 |
public static final short |
LSTORE |
55 |
public static final short |
LSTORE_0 |
63 |
public static final short |
LSTORE_1 |
64 |
public static final short |
LSTORE_2 |
65 |
public static final short |
LSTORE_3 |
66 |
public static final short |
LSUB |
101 |
public static final short |
LUSHR |
125 |
public static final short |
LXOR |
131 |
public static final short |
MAJOR |
45 |
public static final short |
MAJOR_1_1 |
45 |
public static final short |
MAJOR_1_2 |
46 |
public static final short |
MAJOR_1_3 |
47 |
public static final short |
MAJOR_1_4 |
48 |
public static final short |
MAJOR_1_5 |
49 |
public static final short |
MAX_ACC_FLAG |
16384 |
public static final int |
MAX_BYTE |
255 |
public static final int |
MAX_CODE_SIZE |
65536 |
public static final int |
MAX_CP_ENTRIES |
65535 |
public static final int |
MAX_SHORT |
65535 |
public static final short |
MINOR |
3 |
public static final short |
MINOR_1_1 |
3 |
public static final short |
MINOR_1_2 |
0 |
public static final short |
MINOR_1_3 |
0 |
public static final short |
MINOR_1_4 |
0 |
public static final short |
MINOR_1_5 |
0 |
public static final short |
MONITORENTER |
194 |
public static final short |
MONITOREXIT |
195 |
public static final short |
MULTIANEWARRAY |
197 |
public static final short |
MULTIANEWARRAY_QUICK |
223 |
public static final short |
NEW |
187 |
public static final short |
NEW_QUICK |
221 |
public static final short |
NEWARRAY |
188 |
public static final short |
NOP |
0 |
public static final short |
POP |
87 |
public static final short |
POP2 |
88 |
public static final short |
PUSH |
4711 |
public static final short |
PUTFIELD |
181 |
public static final short |
PUTFIELD_QUICK |
207 |
public static final short |
PUTFIELD_QUICK_W |
228 |
public static final short |
PUTFIELD2_QUICK |
209 |
public static final short |
PUTSTATIC |
179 |
public static final short |
PUTSTATIC_QUICK |
211 |
public static final short |
PUTSTATIC2_QUICK |
213 |
public static final short |
RESERVED |
-3 |
public static final short |
RET |
169 |
public static final short |
RETURN |
177 |
public static final short |
SALOAD |
53 |
public static final short |
SASTORE |
86 |
public static final short |
SIPUSH |
17 |
public static final String |
STATIC_INITIALIZER_NAME |
"<clinit>" |
public static final short |
SWAP |
95 |
public static final short |
SWITCH |
4712 |
public static final byte |
T_ADDRESS |
16 |
public static final byte |
T_ARRAY |
13 |
public static final byte |
T_BOOLEAN |
4 |
public static final byte |
T_BYTE |
8 |
public static final byte |
T_CHAR |
5 |
public static final byte |
T_DOUBLE |
7 |
public static final byte |
T_FLOAT |
6 |
public static final byte |
T_INT |
10 |
public static final byte |
T_LONG |
11 |
public static final byte |
T_OBJECT |
14 |
public static final byte |
T_REFERENCE |
14 |
public static final byte |
T_SHORT |
9 |
public static final byte |
T_UNKNOWN |
15 |
public static final byte |
T_VOID |
12 |
public static final short |
TABLESWITCH |
170 |
public static final short |
UNDEFINED |
-1 |
public static final short |
UNPREDICTABLE |
-2 |
public static final short |
WIDE |
196 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final byte |
ANNOTATION |
64 |
public static final byte |
ARRAY |
91 |
public static final byte |
CLASS |
99 |
public static final byte |
ENUM_CONSTANT |
101 |
public static final byte |
PRIMITIVE_BOOLEAN |
90 |
public static final byte |
PRIMITIVE_BYTE |
66 |
public static final byte |
PRIMITIVE_CHAR |
67 |
public static final byte |
PRIMITIVE_DOUBLE |
68 |
public static final byte |
PRIMITIVE_FLOAT |
70 |
public static final byte |
PRIMITIVE_INT |
73 |
public static final byte |
PRIMITIVE_LONG |
74 |
public static final byte |
PRIMITIVE_SHORT |
83 |
public static final byte |
STRING |
115 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final byte |
FILE |
2 |
public static final byte |
HEAP |
1 |
public static final byte |
ZIP |
3 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
ANNOTATION |
64 |
public static final int |
ARRAY |
91 |
public static final int |
CLASS |
99 |
public static final int |
ENUM_CONSTANT |
101 |
public static final int |
PRIMITIVE_BOOLEAN |
90 |
public static final int |
PRIMITIVE_BYTE |
66 |
public static final int |
PRIMITIVE_CHAR |
67 |
public static final int |
PRIMITIVE_DOUBLE |
68 |
public static final int |
PRIMITIVE_FLOAT |
70 |
public static final int |
PRIMITIVE_INT |
73 |
public static final int |
PRIMITIVE_LONG |
74 |
public static final int |
PRIMITIVE_SHORT |
83 |
public static final int |
STRING |
115 |
| Modifier and Type | Constant Field | Value |
|---|---|---|
public static final int |
VERIFIED_NOTYET |
0 |
public static final int |
VERIFIED_OK |
1 |
public static final int |
VERIFIED_REJECTED |
2 |
Copyright © 2004–2016 The Apache Software Foundation. All rights reserved.


Share the Fresh
An AI Based Nutrition and Charity Project
Banana
X
Bread
Unpin
Eggs
Unpin
Milk
Unpin
Cheese
Unpin
Bacon
Unpin
Apple
Unpin


The Thirteenth Floor (1999) Reviewed by Eugene Novikov http://www.ultimate-movie.com Member: Online Film Critics Society
*** out of four
"I think therefore I am."
Starring Craig Bierko, Armin Mueller-Stahl, Gretchen Mol. Rated R.
Can there possibly be anything new to say about the concept of virtual reality impersonating reality? In the past two years, Hollywood has pummeled us drilled with the idea that the world as we know it may not be what we think it to be -- films such as Dark City, The Matrix, eXistenZ and now The Thirteenth Floor have all been brooding over the thought. Notice that I have recommended all of the above, the reason being that I love these kinds of movies; they have the potential to excite my imagination and get my adrenaline flowing, if done well. Oddly enough, these four movies have all been done well.
The Thirteenth Floor is an ambitious little movie that dares to open with Descartes' famous quote "I think therefore I am." At first glance it will seem ill-advised and pretentious, especially if you've seen any promo material for the movie. But stick with it, and you'll find that the presence of that quote in the very beginning provides the movie with the power to stick with you for some time after it is over.
It opens with what seems like the early 19th century. We see an elderly man (Armin Mueller-Stahl) leave a hotel (where a beautiful young girl is peacefully sleeping on a bed), leave a note for the bartender to give to someone else and head home. He comes home to his wife, gets into bed and we find out that the guy is playing an elaborate computer game; indeed he wakes up in a computer lab. Sooner than later, he is stabbed to death. All evidence points to a young executive of the company, Douglas Hall (Craig Bierko) to have killed him. Doug's only hope, it seems, is to find a message that his now-deceased boss allegedly left inside the simulation. What he finds changes his perception of reality, himself and the people around him.
What's terrific about the first two thirds of The Thirteenth Floor is how the movie plays out as a mystery; revealing its secret by slowly peeling away its layers. It succeeds in keeping the deductive viewers a half step ahead of the characters (mainly because for a corporate executive, Douglas isn't terribly bright), but not so far that we become bored.
Unfortunately for those that have just begun to get wrapped up in the proceedings, the film falls apart completely towards the end. The script, never particularly outstanding to begin with, starts to move with undesirably rapid speed towards inanity, and the romance that develops betweed Douglas and a beautiful woman with a dark secret (Gretchen Mol) is not only horridly written but it is also dissappointing as a payoff (this is what we get?!?). The ending leaves too many loose-ends untied to be particularly satisfying, and it is also telegraphed about 30 minutes before it actually happens so that one pretty much knows for sure what is going to happen.
Mueller-Stahl is engaging in a role that never quite dies. Bierko is just okay as the protagonist, although unfortunately he doesn't project his shock at his discovery convincingly. Gretchen Mol is absolutely dreadful in an essential role, but going into the explicit details of her performance or her character will ruin a few surprises, so I'm not going to go into detail here.
I never like seeing a movie that shows such promise nearly destroy itself by such an uninspired resolution. The Thirteeth Floor is regardless a respectable movie (although, for the record, I was originally going to go with a much less enthusiastic **1/2, until I found myself thinking about the movie more during that same night) but it could easily been truly excellent -- it could have been the best movie of the year. But it's not, and The Matrix holds on to that dubious distinction. ©1999 Eugene Novikov
Sent via Deja.com http://www.deja.com/ Share what you know. Learn what you don't.
The review above was posted to the
rec.arts.movies.reviews newsgroup (de.rec.film.kritiken for German reviews).
The Internet Movie Database accepts no responsibility for the contents of the
review and has no editorial control. Unless stated otherwise, the copyright
belongs to the author.
Please direct comments/criticisms of the review to relevant newsgroups.
Broken URLs inthe reviews are the responsibility of the author.
The formatting of the review is likely to differ from the original due
to ASCII to HTML conversion.
Related links: index of all rec.arts.movies.reviews reviews


Question
Given a string containing just the characters '('
, ')'
, '{'
, '}'
, '['
and ']'
, determine if the input string is valid.
The brackets must close in the correct order, "()"
and "()[]{}"
are all valid but "(]"
and "([)]"
are not.
Stats
| Frequency | 5 |
| Diffficulty | 2 |
| Adjusted Difficulty | 3 |
| Time to use | ---------- |
Ratings/Color = 1(white) 2(lime) 3(yellow) 4/5(red)
Analysis
Either stack or string would work.
Solution
The code is easy.
My code
public class Solution {
public boolean isValid(String s) {
if (s == null || s.length() == 0) {
return false;
}
Stack<Character> stack = new Stack<Character>();
// process s char by char
for (char c: s.toCharArray()) {
if (c == '(' || c == '[' || c == '{') {
stack.push(c);
} else {
if (stack.isEmpty()) {
// eg. input = "())))"
return false;
}
char top = stack.pop();
if (Math.abs(top - c) > 2) {
// parentheses does not match
return false;
}
}
}
// after this, stack should be empty (if parentheses valid)
return stack.isEmpty();
}
}


--- layout: post title: The Sun date: '2005-11-01T12:00:00-05:00' tags: - '2005' tumblr_url: http://poetry.liabogoev.com/post/1412867555/the-sun ---
I couldn’t imagine,
what it might be like,
to never see the sun again
to live under the cover of darkness
to never see light
sweet, bright, beautiful,
rays of light.
To come out with the moon,
When it conquers the realm,
of darkness and shadows,
with only a single beam,
of soft, silky moonlight
to guide your life…


Cats Rule - Guess the Cat Word!
Press any Key to get started!
Guesses remaining: 13
Incorrect guesses so far:


Spaniards convicted of rape also sentenced for videoing it
by Associated PressMADRID (AP) - Two Spaniards who were among a group of five men convicted earlier this year of raping a woman were each sentenced Wednesday to an additional three years and three months in prison for having made videos of the rape with their phones.
A regional court in Pamplona also fined them 5,670 euros ($6,280) for the seven videos and two photographs they made of the rape.
The five, who had a WhatsApp group named "La Manada," or "The Animal Pack," were imprisoned for 15 years by the Supreme Court in June for raping an 18-year-old woman during Pamplona's San Fermin festival in 2016.
The case earned renown because lower courts convicted them of lesser crimes.
Four of the five are also on trial for allegedly sexually abusing another woman in 2016.
___
This story has been corrected to reflect that the Supreme Court sentenced the men in June, not July.


A simple type is:
A class may have more than one, or only simple types as members.
The model of a type is another way to define an ADT.
A type is a collection of values and therefore, a subset of a type.


var map = new Map({ basemap: "hybrid" }); var layer = new FeatureLayer({ url: "http://services.arcgis.com/nzS0F0zdNLvs7nc8/ArcGIS/rest/services/05_HurricaneAndrew_1992/FeatureServer/0", mode: FeatureLayer.MODE_SNAPSHOT }); map.add(layer); var view = new SceneView({ container: "viewDiv", map: map, camera: { position: [ -45.23, -1.08, 6270495 ], heading: 335, tilt: 20 } });
4.0 beta2
Feature layer


| interpolate.river.mom | R Documentation |
Interpolates river inflow data in the time dimensions. Currently, only interpolation from monthly to values is implemented. Additionally, only the interpolation methods 'step' is implemented.
interpolate.river.mom(inData, from = inData$tstep, to = "none", method = "step")
inData |
list containing a data.frame (in$data) with river inflow data, a character array (in$units) with corresponding units, and a character (in$format). |
from |
character: current data averaging interval; does not need to be set if in$tstep is set properly; if not, it can be manually set to e.g. 'annual', 'monthly', or 'daily' |
to |
character, target time interval; e.g. 'annual', 'monthly', or 'daily' |
method |
character, interpolation method |
list of newly averaged data; same structure as input data
list containing a data.frame (out$data), a character array (out$units), and two character variables (out$format and out$tstep). The first contains the actual data formatted as a data.frame. The second contains the units to the corresponding columns of the data.frame. The third contains the source/format of data (here: 'mom'; can also be 'swat'). The fourth contains information on the time step of the data (resp.: on which time interval they are averaged).
Daniel Neumann<EMAIL_ADDRESS>read.river.mom, write.river.netCDF, write.river.append2Inflow, write.river.newInflow, mean.river.mom
# read a file: test.mom.monthly <- read.river.mom('files/GER_Dan_Str_Warnow.dat') # interpolate from monthly to daily test.mom.daily <- interpolate.river.mom(test.mom.monthly, to = 'daily', method = 'step')


Restart Required
In order to apply changes on your tasks, you must restart.Currently Active
{{ startTime }}
StartedCurrently Inactive
Newly Added Products
{% for item in newItems %}{{item.title}} {{item.dateAdded}} — {{item.site}} — Link
{{ startTime }}
Started{{item.title}} {{item.dateAdded}} — {{item.site}} — Link


Hire Space is a vibrant start-up set up by a
school teacher and a speechwriter
Hire Space means more income and less administration for venues.
The Guardian, UKFinding a venue can be a source of frustration...
Could this be the answer?
Hire Space is a new website that lets the public rent a wide range of venues.
The Telegraph, UK


"ELATH "grove; trees, (Deuteronomy 2:8), also in plural form Eloth (1 Kings 9:26, etc.); called by the Greeks and Romans Elana; a city of Idumea, on the east, i.e., the Elanitic, gulf, or the Gulf of Akabah, of the Red Sea. It is first mentioned in Deuteronomy 2:8. It is also mentioned along with Ezion-geber in 1 Kings 9:26. It was within the limits of Solomon’s dominion, but afterwards revolted. It was, however, recovered and held for a time under king Uzziah (2 Kings 14:22). Now the ruin Aila.
"ELATH "grove; trees, (Deuteronomy 2:8), also in plural form Eloth (1 Kings 9:26, etc.); called by the Greeks and Romans Elana; a city of Idumea, on the east, i.e., the Elanitic, gulf, or the Gulf of Akabah, of the Red Sea. It is first mentioned in Deuteronomy 2:8. It is also mentioned along with Ezion-geber in 1 Kings 9:26. It was within the limits of Solomon’s dominion, but afterwards revolted. It was, however, recovered and held for a time under king Uzziah (2 Kings 14:22). Now the ruin Aila.


Mars 2020 - Currently
{{ partial "badges/go.html"}} {{ partial "badges/docker.html"}} {{ partial "badges/kubernetes.html"}} {{ partial "badges/postgresql.html"}}
Almost all my career I had been working mainly with Elixir and his ecosystem. I felt I needed to try some other technologies, that is why I decided to make a move to Golang. Paack is an startup focused in logistics. When I entered the compay they were trying to expand their backend using Golang. This new experience allows me to get a deeper knowledge of SOLID principles, hexagonal architecture and how to approach 24/7 systems without OTP.


| 1 | /* | |
| 2 | * Licensed to the Apache Software Foundation (ASF) under one | |
| 3 | * or more contributor license agreements. See the NOTICE file | |
| 4 | * distributed with this work for additional information | |
| 5 | * regarding copyright ownership. The ASF licenses this file | |
| 6 | * to you under the Apache License, Version 2.0 (the | |
| 7 | * "License"); you may not use this file except in compliance | |
| 8 | * with the License. You may obtain a copy of the License at | |
| 9 | * | |
| 10 | * http://www.apache.org/licenses/LICENSE-2.0 | |
| 11 | * | |
| 12 | * Unless required by applicable law or agreed to in writing, | |
| 13 | * software distributed under the License is distributed on an | |
| 14 | * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | |
| 15 | * KIND, either express or implied. See the License for the | |
| 16 | * specific language governing permissions and limitations | |
| 17 | * under the License. | |
| 18 | */ | |
| 19 | ||
| 20 | package org.rapidpm.ddi.producerresolver; | |
| 21 | ||
| 22 | import org.rapidpm.ddi.DI; | |
| 23 | import org.rapidpm.ddi.ResponsibleFor; | |
| 24 | ||
| 25 | import java.util.Set; | |
| 26 | import java.util.stream.Collectors; | |
| 27 | ||
| 28 | public class ProducerResolverLocator { | |
| 29 | ||
| 30 | public Set<Class<? extends ProducerResolver>> findProducersResolverFor(final Class clazzOrInterf) { | |
| 31 |
1
1. findProducersResolverFor : mutated return of Object value for org/rapidpm/ddi/producerresolver/ProducerResolverLocator::findProducersResolverFor to ( if (x != null) null else throw new RuntimeException ) → KILLED |
return DI |
| 32 | .getSubTypesOf(ProducerResolver.class) | |
| 33 | .stream() | |
| 34 |
1
1. lambda$findProducersResolverFor$0 : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
.filter(c -> c.isAnnotationPresent(ResponsibleFor.class)) |
| 35 | .filter(c -> { | |
| 36 | final ResponsibleFor responsibleFor = c.getAnnotation(ResponsibleFor.class); | |
| 37 | final Class<? extends ResponsibleFor> responsibleForClass = responsibleFor.value(); | |
| 38 |
1
1. lambda$findProducersResolverFor$1 : replaced return of integer sized value with (x == 0 ? 1 : 0) → KILLED |
return responsibleForClass.equals(clazzOrInterf); |
| 39 | }) | |
| 40 | .collect(Collectors.toSet()); | |
| 41 | } | |
| 42 | } | |
Mutations | ||
| 31 |
1.1 |
|
| 34 |
1.1 |
|
| 38 |
1.1 |


The Connect
About
Services
Contact
Create Account
Other Pages
Full Width Page
Sidebar Page
FAQ
404
Report Bug
Administrator Login


public class HTTPPostSender extends android.os.AsyncTask<Route,java.lang.Void,java.lang.Void>
| Modifier and Type | Field and Description |
|---|---|
android.net.ConnectivityManager |
cm |
| Constructor and Description |
|---|
HTTPPostSender()
Class constructor, runs thread.
|
| Modifier and Type | Method and Description |
|---|---|
void |
buildString(Route postRoute,
android.content.ContentResolver cr)
Builds a string containing the HTTP POST request.
|
void |
close()
Setting this to be false will stop the network thread from running.
|
protected java.lang.Void |
doInBackground(Route... routes)
The override allows the method to perform it's computations in the background.
|
boolean |
doneSuccessfully(java.lang.String s)
Returns true if the POST has managed to go through the server successfully, false if something
has gone wrong in between.
|
boolean |
isAvailable()
Returns true if a connection is available, false if not
|
protected java.lang.Void doInBackground(Route... routes)
doInBackground
in class android.os.AsyncTask<Route,java.lang.Void,java.lang.Void>
public boolean isAvailable()
public boolean doneSuccessfully(java.lang.String s)
s
- String returned from the trySend() method i.e. PHP response from the server.public void buildString(Route postRoute, android.content.ContentResolver cr)
postRoute
- the walking tour used to build the request string.public void close()


Module sched
Lumen cooperative scheduler.
Lumen (Lua Multitasking Environment) is a simple environment
for coroutine based multitasking. Consists of a signal scheduler,
and that's it.
Functions that receive a task or wait descriptors can be invoked as methods
of the corresponing events. For example, sched.kill(task) can be invoked as
task:kill()
Usage:
local sched = require 'sched'
sched.sigrun({emitter='*', events={'a signal'}}, print)
local task=sched.run(function()
sched.signal('a signal', 'data')
sched.sleep(1)
end)
| new_task (f) |
Create a task. |
| new_sigrun_task (waitd, f) |
Create a task that listens for a signal. |
| new_sigrunonce_task (waitd, f) |
Create a task that listens for a signal, once. |
| run (task, ...) |
Run a task. |
| sigrun (waitd, f, attached) |
Create and run a task that listens for a signal. |
| sigrunonce (waitd, f, attached) |
Create and run a task that listens for a signal, once. |
| attach (taskd, taskd_child) |
Attach a task to another. |
| set_as_attached (taskd) |
Set a task as attached to the creator task. |
| kill (taskd) |
Finishes a task. |
| signal (event, ...) |
Emit a signal. |
| new_waitd (waitd_table) |
Create a Wait Descriptor. |
| wait (waitd) |
Wait for a signal. |
| sleep (timeout) |
Sleeps the task for t time units. |
| yield () |
Yields the execution of a task, as in cooperative multitasking. |
| set_pause (taskd, pause) |
Pause a task. |
| idle (t) |
Idle function. |
| get_time () |
Function used by the scheduler to get current time. |
| step () |
Runs a single step of the scheduler. |
| go () |
Starts the scheduler. |
| tasks |
Tasks in scheduler. |
Functions
-
new_task (f)
-
Create a task.
The task is created in paused mode. To run the created task,
use run or set_pause.
The task will emit a sched.EVENT_DIE, true, params...
signal upon normal finalization, were params are the returns of f.
If there is a error, the task will emit a sched.EVENT_DIE, false, err were
err is the error message.
Parameters:
Returns:
task in the scheduler (see taskd).
-
new_sigrun_task (waitd, f)
-
Create a task that listens for a signal.
Parameters:
- waitd
a Wait Descriptor for the signal (see waitd)
- f
function to be called when the signal appears. The signal
is passed to f as parameter.The signal will be provided as
emitter, event, parameters, just as the result of a wait
Returns:
task in the scheduler (see taskd).
-
new_sigrunonce_task (waitd, f)
-
Create a task that listens for a signal, once.
Parameters:
- waitd
a Wait Descriptor for the signal (see waitd)
- f
function to be called when the signal appears. The signal
is passed to f as parameter. The signal will be provided as
emitter, event, parameters, just as the result of a wait
Returns:
task in the scheduler (see taskd).
-
run (task, ...)
-
Run a task.
Can be provided either a taskd or a function with optional parameters.
If provided a taskd, will run it. If provided a function, will use new_task
to create a task first.
Parameters:
- task
wither a taskd or function for the task.
- ...
parameters passed to the task upon first run.
Returns:
a task in the scheduler (see taskd).
-
sigrun (waitd, f, attached)
-
Create and run a task that listens for a signal.
Parameters:
- waitd
a Wait Descriptor for the signal (see waitd)
- f
function to be called when the signal appears. The signal
is passed to f as parameter.The signal will be provided as
emitter, event, parameters, just as the result of a wait
- attached
if true, the new task will run in attached more
Returns:
task in the scheduler (see taskd).
-
sigrunonce (waitd, f, attached)
-
Create and run a task that listens for a signal, once.
Parameters:
- waitd
a Wait Descriptor for the signal (see waitd)
- f
function to be called when the signal appears. The signal
is passed to f as parameter. The signal will be provided as
emitter, event, parameters, just as the result of a wait
- attached
if true, the new task will run in attached more
Returns:
task in the scheduler (see taskd).
-
attach (taskd, taskd_child)
-
Attach a task to another.
An attached task will be killed by the scheduler whenever
the parent task is finished (returns, errors or is killed). Can be
invoked as taskd:attach(taskd_child).
Parameters:
- taskd
The parent task
- taskd_child
The child (attached) task.
Returns:
the modified taskd.
-
set_as_attached (taskd)
-
Set a task as attached to the creator task.
An attached task will be killed by the scheduler whenever
the parent task (the task that created it) is finished (returns, errors or is killed).
Can be invoked as taskd:setasattached().
Parameters:
- taskd
The child (attached) task.
Returns:
the modified taskd.
-
kill (taskd)
-
Finishes a task.
The killed task will emit a signal sched.EVENT_DIE, false, 'killed'. Can be
invoked as taskd:kill().
Parameters:
- taskd
task to terminate (see taskd).
-
signal (event, ...)
-
Emit a signal.
Parameters:
- event
event of the signal. Can be of any type.
- ...
further parameters to be sent with the signal.
-
new_waitd (waitd_table)
-
Create a Wait Descriptor.
Creates waitd object in the scheduler. Notice that buffering waitds
start buffering as soon they are created.
Parameters:
- waitd_table
a table to convert into a wait descriptor.
Returns:
a wait descriptor object.
-
wait (waitd)
-
Wait for a signal.
Pauses the task until (one of) the specified signal(s) is available.
If there are signals in the buffer, will return the first immediately.
Otherwise will block the task until signal arrival, or a timeout.
If provided a table as parameter, will use new_waitd to convert it
to a wait desciptor.
Can be invoked as waitd:wait().
Parameters:
- waitd
a Wait Descriptor for the signal (see waitd)
Returns:
On event returns emitter, event, parameters. On timeout
returns nil, 'timeout'
-
sleep (timeout)
-
Sleeps the task for t time units.
Time computed according to @{get_time}.
Parameters:
-
yield ()
-
Yields the execution of a task, as in cooperative multitasking.
-
set_pause (taskd, pause)
-
Pause a task.
A paused task won't be scheduled for execution. If paused while waiting for a signal,
won't respond to signals. Signals on unbuffered waitds will get lost. Task's buffered
waitds will still buffer events. Can be invoked as taskd:set_pause(pause)
Parameters:
- taskd
Task to pause (see taskd).
- pause
mode, true to pause, false to unpause
Returns:
the modified taskd on success or nil, errormessage on failure.
-
idle (t)
-
Idle function.
Function called by the scheduler when there is
nothing else to do (e.g., all tasks are waiting for a signal).
This function should idle up to t time units (notice that an empty
function satisifies this, tough results in busy waits). Replace with
whatever your app uses. LuaSocket's sleep works just fine.
It is allowed to idle for less than t; the empty function will
result in a busy wait. Defaults to execution of Linux's "sleep" command.
Parameters:
-
get_time ()
-
Function used by the scheduler to get current time.
Replace with whatever your app uses. LuaSocket's gettime works just fine.
Defaults to os.time.
-
step ()
-
Runs a single step of the scheduler.
Returns:
the idle time available until more activity is expected; this
means it will be 0 if there are active tasks.
-
go ()
-
Starts the scheduler.
Will run until there is no more activity, i.e. there's no active task,
and none of the waiting tasks has a timeout set.
Tables
-
tasks
-
Tasks in scheduler.
Table holding taskd objects of the tasks in the scheduler.
Usage:
for taskd, _ in pairs (sched.tasks) do print(taskd) end
Fields
-
waitds
-
Wait descriptors in scheduler.
Table holding waitd objects used in the scheduler. Associates to each waitd
a table with the waitds of tasks that use it.
Usage:
for waitd, _ in pairs (sched.waitds) do print(waitd) end
end
-
EVENT_DIE
-
Task dying event.
This event will be emitted when a task dies. When the task dies a natural
death (finishes), the first parameter is true, followed by
the task returns. Otherwise, the first parameter is nil and the second
is 'killed' if the task was killed, or the error message if the task errore'd.
Usage:
sched.sigrun({emitter='*', events={sched.EVENT_DIE}}, print)
-
to_clean_up
-
Control memory collection.
number of new insertions in waiting[event] before triggering clean_up.
Defaults to 1000
-
running_task
-
Currently running task.
the task descriptor from current task.
-
debug
-
Debugging module.
The debug module allows to have a better look at the workings of a Lumen
application (see debug).
Data structures
Data structures.
Main structures used.
-
waitd
-
Wait descriptor.
Specifies a condition on which wait. Includes a signal description,
a optional timeout specification and buffer configuration.
A wait descriptor can be reused (for example, when waiting inside a
loop) and shared amongst different tasks. If a wait descriptor changes
while there is a task waiting, the behavior is unspecified. Notice that
when sharing a wait descriptor between several tasks, the buffer is
associated to the wait descriptor, and tasks will service buffered signals
on first request basis.
Fields:
- emitter
optional, task originating the signal we wait for. If '*' or nil,
means anyone. It also can be an array of tasks, in which case any of
them is accepted as a source (see taskd). To use separated emitter-events
pairs, see the multi attribute.
- events
optional, array with the events to wait. Can contain a '*',
or be '*' instead of a table, to mark interest in any event. If nil, will
only return on timeout. To use separated emitter-events
pairs, see the multi attribute.
- multi
if more than a single emitter-events pair is needed, these can be
placed in this array. Example:
multi={{events={'evA'}, emitter=emA}, {events={'evB'}, emitter=emB}}
- timeout
optional, time to wait. nil or negative waits for ever.
- buff_len
Maximum length of the buffer. A buffer allows for storing
signals that arrived while the task is not blocked on the wait descriptor.
Whenever there is an attempt to insert in a full buffer, the dropped
flag is set. nil o 0 disables, negative means no length limit.
- buff_mode
Specifies how to behave when inserting in a full buffer.
'drop first' means drop the oldest signals to make space. 'drop last'
or nil will skip the insertion in a full buffer.
- dropped
the scheduler will set this to true when dropping events
from the buffer. Can be reset by the user.
-
taskd
-
Task descriptor.
Handler of a task. Besides the following fields, provides methods for
the sched functions that have a taskd as first parameter.
Fields:
- status
Status of the task, can be 'ready', 'paused' or 'dead'
- waitingfor
If the the task is waiting for a signal, this is the
Wait Descriptor (see waitd)
- waketime
The time at which to task will be forced to wake-up (due
to a timeout on a wait)
- created_by
The task that started this one.
- attached
Table containing attached tasks.
- co
The coroutine of the task


Chapter 5 The faoswsForestryAggregation module
The module faoswsForestryAggregation comprehend the main step in the Forestry Production and Trade process as it calculates the aggregates by region and item that will be disseminated through FAOSTAT.
5.1 Steps
The module can be basically split into four parts as below.
5.1.1 Read in the data
The module uses the forestry_prod_trade dataset as input. According to the technical unit, they will be constantly changing this dataset throughout the data cycle, specially when new data come in or the officers decide to make changes based on their domain knowledge.
5.1.2 Get regional aggregation
After reading in the input dataset, the module geographically aggregates the primary commodities based on FAOSTAT - UNSD M49 mapping. Please, for a full representation of this table consult either the Appendix A.11 or this link.
5.1.3 Get Forestry commodity aggregation
Once a data set with regional aggregate is ready, the module moves to producing commodity aggregations at the national and regional levels. Since there is an interplay between commodity groups, the module carries the aggregation in tandem, with three commodity groups being aggregated first and then rest of aggregates.
| CommodityGroup | CommodityGroupName | CommodityCode | CommodityName |
|---|---|---|---|
| 1656 | Chemical wood pulp | 1660 | Chemical wood pulp, sulphite, unbleached |
| 1656 | Chemical wood pulp | 1661 | Chemical wood pulp, sulphite, bleached |
| 1656 | Chemical wood pulp | 1662 | Chemical wood pulp, sulphate, unbleached |
| 1656 | Chemical wood pulp | 1663 | Chemical wood pulp, sulphate, bleached |
| 1656 | Chemical wood pulp | 1686 | Chemical wood pulp, sulphite |
| 1674 | Printing and writing papers | 1612 | Printing and writing papers, uncoated, wood containing |
| 1674 | Printing and writing papers | 1615 | Printing and writing papers, uncoated, wood free |
| 1674 | Printing and writing papers | 1616 | Printing and writing papers, coated |
| 1675 | Other paper and paperboard | 1676 | Household and sanitary papers |
| 1675 | Other paper and paperboard | 1681 | Wrapping and packaging paper and paperboard |
| 1675 | Other paper and paperboard | 1683 | Other paper and paperboard n.e.s. |
| 1675 | Other paper and paperboard | 1617 | Case materials |
| 1675 | Other paper and paperboard | 1618 | Cartonboard |
| 1675 | Other paper and paperboard | 1621 | Wrapping papers |
| 1675 | Other paper and paperboard | 1622 | Other papers mainly for packaging |
5.1.4 Get Unit values
Once the import and export figures are calculated for values and quantity, the unit price, which is the quotient between values and quantity, can be easily calculated for both primary and group commodities at the national and regional levels.
5.1.5 Get back the original flags
With unit values already in the data sets (national and regional), the last step is to recovery the flags from the original input. Data records added during the processing come either from geographic or commodity aggregation. Therefore, these records have “E” (Aggregation) as flagObservationStatus and “s” (summation) as flagMethod.
5.1.6 Convert FAOSTAT regions to SWS regions
The processed regional data set uses FAOSTAT codes for regions. To be able to save the results in the SWS, regions must be converted to SWS regional codes compatible with the geographicAreaM49 in the forestry_prod_trade_agg dataset. For this, the module uses the following function.
5.1.7 Binding national and regional data
Binding national and regional data sets.
5.1.8 Compare before and after aggregations
As a validation tool, the faoswsForestryAggregation module also needs to return what has changed from the input dataset. The module flags values where the absolute difference between the input dataset and the aggregate dataset is higher than 0.1.
5.2 Running the module
Log in the SWS;
Click on New Query;
Select Forestry domain and forestry_prod_trade_agg dataset;
Select whatever geographicAreaM49, measuredElement, measuredItemForestry and timePointYears. After that, run the query;
Select the faoswsForestryAggregation module, choose the parameters (Start and End year) and click on Run plugin;
6. Wait for a window message to appear in the session: ForestryAggregation module ran successfully!!!;
7. Click on Save to dataset.


-
Google Discussiegroepen
groups.google.com
Met Google Discussiegroepen kun je online forums en e-mailgroepen maken en eraan deelnemen. Bovendien profiteer je van uitgebreide ...
-
Build software better, together
github.com
GitHub is the best place to build software together. Over 4 million people use GitHub to share code.
-
If programming languages were weapons • Bjorn Tipling
bjorn.tipling.com
C is an M1 Garand standard issue rifle, old but reliable. C++ is a set of nunchuks, powerful and impressive when wielded but takes many years of pain ...
-
Presented at CSSConf.eu, September 2014. You've learned the concepts, now ...
speakerdeck.com
CSS Performance Tooling
-
Tab Atkins | Present and Future of CSS Layout | CSS Day
vimeo.com
Designing a page's layout in CSS has traditionally been a hard problem, though developers have come up with a lot of amazing hacks. Today, and in the ...
-
Bootstrap 3.2.0 released · Bootstrap Blog
blog.getbootstrap.com
Announcements, discussions, and more for Bootstrap .
-
Manhattan, our real-time, multi-tenant distributed database for Twitter ...
blog.twitter.com
Twitter has unique and intensive storage requirements. We built a database, called Manhattan, that meets those requirements and allows self-service ...
-
Google I/O 2014
www.google.com
Google I/O 2014 brings developers together for an immersive, two-day experience focused on exploring the next generation of technology. Join us ...
-
addyosmani/LICENSE.txt
gist.github.com
108 byte CSS Layout Debugger - Gist is a simple way to share snippets of text and code with others.
-
JavaScript has a Unicode problem · Mathias Bynens
mathiasbynens.be
Published 20th October 2013 · tagged with JavaScript , Unicode
-
Most Viewed Machine Learning Talks at Videolectures
www.kdnuggets.com
Discover lectures from a variety of summer schools and conference tutorials on machine learning in this list of the top lectures on the subject from ...
-
Scaling Redis at Twitter
www.youtube.com
Twitter runs some of the largest Redis clusters in production. To adapt Redis to Twitter's use cases, we have come up with both configuration best ...
-
Kool & The Gang - Celebration
www.youtube.com
Music video by Kool & The Gang performing Celebration. (C) 1980 The Island Def Jam Music Group
-
Bootstrap
kristopolous.github.io
Sleek, intuitive, and powerful front-end framework for faster and easier web development.
-
All Our Patent Are Belong To You | Blog | Tesla Motors
www.teslamotors.com
Yesterday, there was a wall of Tesla patents in the lobby of our Palo Alto headquarters. That is no longer the case. They have been removed, in the ...
-
Atom Is Now Open Source
blog.atom.io
At GitHub, we’re building the text editor we’ve always wanted: hackable to the core, but approachable on the first day without ever touching a config ...
-
[Phoronix] CompuLab Utilite: A Tiny, Low-Power, Low-Cost, ARM Linux Desktop
www.phoronix.com
Phoronix is the leading technology website for Linux hardware reviews, open-source news, Linux benchmarks, open-source benchmarks, distribution ...
-
A free and open world depends on a free and open web. | Google
www.google.com
A free and open world depends on a free and open Internet. Governments alone, working behind closed doors, should not direct its future. The billions ...
-
This is bigger than us: Building a future for Open Source
speakerdeck.com
This talk takes you on a journey – from the days of the Easter Islands around 700CE, over the mid-15th century in England to Mars and rain forests of ...
-
Ulysses for Mac
www.ulyssesapp.com
Ulysses lets you focus when you need to concentrate. It keeps all your texts neatly stuffed in its intuitive library. With a few clicks, Ulysses can ...
-
xkcd: Tasks
xkcd.com
Warning: this comic occasionally contains strong language (which may be unsuitable for children), unusual humor (which may be unsuitable for adults), ...


---
layout: page
title: Breadcrumbs
figma: https://www.figma.com/file/Anwb7zgxxeMm7Sw7vbaukq/Breadcrumbs
description: Breadcrumbs are used to provide context for the currently-viewed page.
---
Breadcrumbs show users where they are within a site’s hierarchy. Breadcrumbs help orient the user and allow for navigation to previous page levels. It can be appropriate to use a breadcrumb when: Breadcrumbs should be the first page element—placed directly above the page’s title. The page the user is on should not appear in the breadcrumb trail, since that indicator is satisfied by the title of the page itself. Additionally, the last It is not appropriate to use Breadcrumbs when:
{% for item in breadcrumbs.classes %}
Class
Parent
Description
{% endfor %}
{{ item.class }}
{{ item.applies }}
{{ item.description }}
.s-breadcrumb--item
shouldn’t include the divider.
{% header "h3", "Stack Overflow" %}
What types of questions should I avoid asking?


| Toilet ID | Toilet Name | Toilet Place | Enable/Disable |
|---|---|---|---|
| 1 | Male Toilet 1 | Fisher Library | |
| 2 | Female Toilet 1 | Regiment Building |
| Request ID | Toilet Name | Request Details | Handle |
|---|---|---|---|
| 1 | Male Toilet 1 | The washer is not working. | |
| 2 | Female Toilet 1 | I cannot reach this toilet. |


In line with the National Health Strategy 2030 Qatar is inviting “healthcare providers, and in particular private healthcare providers” to be key partners in its goal of transforming healthcare, In response to this call, The Angels Health Services was established to serve patients across the country, aimed to meet their health care needs within the comfort of their homes.
The Angels Health Services is a leading nursing agency that provides safe and nurturing care by competent, experienced and licensed nurses that are recruited from different countries, to guide and assist patients attain their maximum potentials and independency.


http://action.vday.org/site/R?i=jtB4TgmrnDtb8RA9jJydgg
http://action.vday.org/site/R?i=NGHF7kZKQeb7Gt1DHfc4jA
http://action.vday.org/site/R?i=NETZ8Dxr_2QTYXoG6JIwdw
http://action.vday.org/site/R?i=xiWPj8qsCjW5_Bo1m0F-uw
V-Day Statement Against Possible U.S. Military Intervention in Syria
The situation in Syria is dire with 100,000 dead, over 2 million
having fled the country (half of them children), and 4.25 million
internally displaced.
V-Day calls on you, our community, to rise and make our voices heard
against military intervention, as such an action would simply bring
about more violence and suffering.
Today, we call on the U.S. to uphold the unconditional right of the
Syrian people to self-determination, and we call on the world to
oppose any U.S. military intervention in Syria. Experience shows us
that military interventions harm innocent women, men, and children.
Time and again we have seen how violence against women greatly
increases in times of military conflict. We have seen how U.S.
interventions in the past have led to more deaths and human rights
violations against innocent people, and how aggression has not been a
solution for conflict or restoration of security.
CONTINUE Reading >
http://action.vday.org/site/R?i=nXtEqfpBvGsBXVCkpHx9ow
TAKE ACTION:
* DEMONSTRATE against U.S. military intervention. Find
demonstrations and ways to speak out in your community or create
your own demonstration.
* CONTACT your Congress people in the U.S. and let them know you
are against military intervention >
http://action.vday.org/site/R?i=dPBj94GyyxRTWicFne7euQ
* WRITE to President Barack Obama - Code Pink has drafted a
letter to be sent directly to the President >
http://action.vday.org/site/R?i=NjvFlobXobsrfvv_cJWpPA
* SUPPORT our partner, the Al Madad Foundation
http://action.vday.org/site/R?i=2xGOaOi9vtpwJ_IiPOtKQw
, which is working with Syrian refugees on the Lebanese border.
Al Madad’s Emergency Aid relief initiative for Syrian refugees
in Lebanon is focusing on disadvantaged and vulnerable
unregistered refugees. To support the Al Madad Foundation,
donate >
http://action.vday.org/site/R?i=9v573HJEv5z_L1bbZjMj4Q
Rise4Justice in Iraq: Urgent Appeal From The Organization Of
Women’s Freedom In Iraq
Yanar Mohammed, President and co-founder of the Organization of
Women’s Freedom in Iraq (OWFI), released this statement and urgent
call to action in response to the thousands of Iraqi children born
with serious birth defects caused by the humanitarian crisis created
by the U.S. military when they withdrew, and is calling for
accountability, reparations, and responsibility by the U.S.
Government.
Dear Friends in the global women’s movement, human rights groups, and
political activists,
Thousands of Iraqi children who are less than 10 years in age have
birth defects of the same kinds. Some young Iraqi mothers have more
than one disabled child, especially if they live in the hot zones of
battles with the US troops, or around the US military bases.
Our fact-finding mission in 2011 found more than 350 children and
babies with the same defects in the town of Hawija. After we
publicized the news, other Hawija families contacted us, and the
number has gone to over 600-disabled children- all limbs are paralyzed
and the brains underdeveloped.
CONTINUE reading & TAKE ACTION >
http://action.vday.org/site/R?i=CoF1aa24g6BeBYdtZDZXKw
http://action.vday.org/site/R?i=VHYFvxCuJG_1JOfi3lw9fQ
http://action.vday.org/site/R?i=QmzkoTZVDjxT7fTSVUndBw
http://action.vday.org/site/R?i=ShYodhq2Ki0tlIMhdcixig
http://action.vday.org/site/R?i=0pQcKgdhqFOga_kaBztvEg
http://action.vday.org/site/R?i=osDHeQjRfhzUyWIrd9Gt8w
unsubscribe
http://action.vday.org/site/CO?i=ZjvBS-4tapuKZAWGRHTzlh81kf0HcgCb&cid=1062
Powered By Blackbaud


Welcome to my blog! I’ve had this post for a while and now I decided to actually put it up. I really enjoyed making it, and I hope you enjoy reading it and learn a bit more about the negative binomial distribution like I did.
I played Crossy Road a lot with my girlfriend while on holiday. I wanted to know what kind of distribution our scores follow, so I decided to record our scores for a while. A Negative Binomial distribution fits these scores very well! This also agrees with the interpretation of the negative binomial of the amount of successful trials before a certain amount of failures, which is indeed the process governing the Crossy Road scores: one jump is a successful trial, and you need 2 failures (both players) to end! The fit is from a negative binomial distribution with mean 145 and size 2. In fancy math notation, that would be as follows: \[\frac{\Gamma(x+2)}{\Gamma(2)\cdot x!} \cdot \left( \frac{2}{2+145} \right)^2 \cdot \left( 1-\frac{2}{2+145} \right)^x\]
See below how well it fits.
nb <- fitdist(data = cr$Crossy, distr = "nbinom")
par(family = "serif")
plot(nb)
In the right panel displaying the empirical and theoretical cumulative distribution functions you can see that the data fits the distribution extremely well! To show this even better, I’ll plot a raw data histogram with this negative binomial distribution function plotted over the top:
par(family="serif")
curve <- dnbinom(1:(max(cr$Crossy+10)),size = coef(nb)[1], mu = coef(nb)[2])
hist(cr$Crossy, breaks = "FD", xlim = c(0,max(cr$Crossy)+10),
main = "Crossy Road", xlab = "Points on Multiplayer Game", col = "#BAFABA",
border = "#BAFABA")
par(new = T)
plot(curve, xlim = c(0,max(cr$Crossy)+10), type = "l",
bty = "n", xlab = "", ylab = "", xaxt = "n", yaxt = "n", col = "blue",
main = "")
par(new = T)
plot(density(cr$Crossy), xlim = c(0,max(cr$Crossy)+10), main = "",
bty = "n", xlab = "", ylab = "", xaxt = "n", yaxt = "n", col = "red")
legend("topright", legend = c(paste("nbinom(",round(coef(nb)[1]),", ",
round(coef(nb)[2]),")",sep = ""),
"density estimate"), fill = c("blue","red"),
bty = "n", border = "#FFFFFF")
We can see if the time variable has an influence on our scores using a negative binomial regression. This type of regression assumes that the errors are distributed according to a negative binomial distribution. In this way, we can test the hypothesis that we get better at the game over time.
par(family="serif")
fit <- glm.nb(Crossy~Time, cr)
summary(fit)
##
## Call:
## glm.nb(formula = Crossy ~ Time, data = cr, init.theta = 2.005910907,
## link = log)
##
## Deviance Residuals:
## Min 1Q Median 3Q Max
## -3.1306 -0.8437 -0.2474 0.2859 2.1569
##
## Coefficients:
## Estimate Std. Error z value Pr(>|z|)
## (Intercept) 4.91548 0.13468 36.498 <2e-16 ***
## Time 0.00112 0.00205 0.546 0.585
## ---
## Signif. codes: 0 '***' 0.001 '**' 0.01 '*' 0.05 '.' 0.1 ' ' 1
##
## (Dispersion parameter for Negative Binomial(2.0059) family taken to be 1)
##
## Null deviance: 122.87 on 112 degrees of freedom
## Residual deviance: 122.58 on 111 degrees of freedom
## AIC: 1332.6
##
## Number of Fisher Scoring iterations: 1
##
##
## Theta: 2.006
## Std. Err.: 0.255
##
## 2 x log-likelihood: -1326.642
plot(cr$Time, cr$Crossy, col = "dark green", bty = "L", ylab = "Score", xlab= "Time",
main = "Change in Scores over Time")
abline(exp(coef(fit)), col = "blue")
I’ll leave drawing any conclusions up to you :)
Questions that remained for me, maybe you can generate some ideas:
Does the shape parameter change with different amounts of players?
How can we incorporate the dependence between consecutive trials?  Can this modelled?


{{$betatag}}
BETA This is a new service{{#urls.feedback}} – your feedback{{> hmpo-partials-new-window}} will help us to improve it.{{/urls.feedback}}


Passionate about clean, well documented and tested code. I adhere to the scout rule, always leave code better than you found it, refactor and test iteratively.
{% gist b250df467f4c4cd6814e9757a34e2cd9%}
Contact me
{% if site.resume_section_experience %}
Experience
{% for job in site.data.experience %}
{{ job.company }}
{{ job.position }} • {{ job.duration }}
{{ job.summary | markdownify }}
{% endfor %}
{% endif %}
{% if site.resume_section_education %}
Education
{% for education in site.data.education %}
{{ education.uni }}
{{ education.year }}
{{ education.summary | markdownify }}
{% endfor %}
{% endif %}
{% if site.resume_section_projects %}
Projects
{% for project in site.data.projects %}
{{ project.project }}
{{ project.role }} • {{ project.duration }}
{{ project.description }}
{% endfor %}
{% endif %}
{% if site.resume_section_skills %}
Skills
{% for skill in site.data.skills %}
{{ skill.skill }}
{% endfor %}
{% endif %}
{% if site.resume_section_interests %}


template<class T>
SpreadClass struct
A class forward-declared in one file but defined in another.
 Happens only if the class is a template, a non-templated class would have its location reported correctly.
If includes are enabled, members should have Second.h listed as their include, but if they are disabled, brief-only members shouldn't have detailed sections at all.
Public functions
- void foo()
- A function with (detailed) include information but no details if includes are disabled.


Flexible, lightweight, easy-to-use, without external dependencies - Loader component for Angular.
Apply directive to the element which has some dynamic content to be loaded, basic example:
Controlling the loader by providing the flag to the directive:
Example with multiple loaders (doing some parallel fetching).
In this example @ViewChildren
is used to query the list of loaders, but the same can be achieved by providing the flag to the [flxLoader]
directive (the second example
from the above):
Global loader example (controlled through the service):
Loader inside buttons:


--- layout: widgets title: Font Resizer name: font_resizer widget_selected: selected description: |
This widget allows us to change the font size of a specified page element.
To use this widget, we need to use a couple of attributes. We can use the set method (i.e. grouping all of the widget components in a single div with the attribute data-ur-set) or the id method (i.e. giving each component of the widget a data-ur-id with an identical value, which doesn't require them to be grouped inside a single wrapper).
basic_tab: data-ur-font-resizer-component="increase": this is used to mark the increase button (e.g. [+]) data-ur-font-resizer-component="label": this indicates the text size data-ur-font-resizer-component="decrease": this is used to mark the decrease button (e.g. [-]) data-ur-font-resizer-component="reset": this is used to reset to the original font size (e.g. [Reset]) data-ur-font-resizer-component="content": this marks the content advanced_tab: Required: increase: - "multiple?: false" decrease: - "multiple?: false" label: - "multiple?: false" content: - "multiple?: false" - attributes: - "data-ur-font-resizer-min
: defaults to \"100\""
- "data-ur-font-resizer-max
: defaults to \"200\""
- "data-ur-font-resizer-size
: defaults to min"
- "data-ur-font-resizer-delta
: defaults to \"20\""
Optional:
reset:
- "multiple?: false"
---
No styles are required. All styles are handled inline by the widget.
To be or not to be, that is the question. Whether 'tis nobler in the mind to endure the slings and arrows of outrageous fortune etc etc.
To be or not to be, that is the question. Whether 'tis nobler in the mind to endure the slings and arrows of outrageous fortune etc etc.
To be or not to be, that is the question. Whether 'tis nobler in the mind to endure the slings and arrows of outrageous fortune etc etc.