|
|||||||||
| PREV NEXT | FRAMES NO FRAMES |
| org.objectweb.* |
|---|
| org.objectweb.asm.ClassReader | ||
|---|---|---|
public static final int |
EXPAND_FRAMES |
8 |
public static final int |
SKIP_CODE |
1 |
public static final int |
SKIP_DEBUG |
2 |
public static final int |
SKIP_FRAMES |
4 |
| org.objectweb.asm.ClassWriter | ||
|---|---|---|
public static final int |
COMPUTE_FRAMES |
2 |
public static final int |
COMPUTE_MAXS |
1 |
| org.objectweb.asm.Opcodes | ||
|---|---|---|
public static final int |
AALOAD |
50 |
public static final int |
AASTORE |
83 |
public static final int |
ACC_ABSTRACT |
1024 |
public static final int |
ACC_ANNOTATION |
8192 |
public static final int |
ACC_BRIDGE |
64 |
public static final int |
ACC_DEPRECATED |
131072 |
public static final int |
ACC_ENUM |
16384 |
public static final int |
ACC_FINAL |
16 |
public static final int |
ACC_INTERFACE |
512 |
public static final int |
ACC_NATIVE |
256 |
public static final int |
ACC_PRIVATE |
2 |
public static final int |
ACC_PROTECTED |
4 |
public static final int |
ACC_PUBLIC |
1 |
public static final int |
ACC_STATIC |
8 |
public static final int |
ACC_STRICT |
2048 |
public static final int |
ACC_SUPER |
32 |
public static final int |
ACC_SYNCHRONIZED |
32 |
public static final int |
ACC_SYNTHETIC |
4096 |
public static final int |
ACC_TRANSIENT |
128 |
public static final int |
ACC_VARARGS |
128 |
public static final int |
ACC_VOLATILE |
64 |
public static final int |
ACONST_NULL |
1 |
public static final int |
ALOAD |
25 |
public static final int |
ANEWARRAY |
189 |
public static final int |
ARETURN |
176 |
public static final int |
ARRAYLENGTH |
190 |
public static final int |
ASTORE |
58 |
public static final int |
ATHROW |
191 |
public static final int |
BALOAD |
51 |
public static final int |
BASTORE |
84 |
public static final int |
BIPUSH |
16 |
public static final int |
CALOAD |
52 |
public static final int |
CASTORE |
85 |
public static final int |
CHECKCAST |
192 |
public static final int |
D2F |
144 |
public static final int |
D2I |
142 |
public static final int |
D2L |
143 |
public static final int |
DADD |
99 |
public static final int |
DALOAD |
49 |
public static final int |
DASTORE |
82 |
public static final int |
DCMPG |
152 |
public static final int |
DCMPL |
151 |
public static final int |
DCONST_0 |
14 |
public static final int |
DCONST_1 |
15 |
public static final int |
DDIV |
111 |
public static final int |
DLOAD |
24 |
public static final int |
DMUL |
107 |
public static final int |
DNEG |
119 |
public static final int |
DREM |
115 |
public static final int |
DRETURN |
175 |
public static final int |
DSTORE |
57 |
public static final int |
DSUB |
103 |
public static final int |
DUP |
89 |
public static final int |
DUP_X1 |
90 |
public static final int |
DUP_X2 |
91 |
public static final int |
DUP2 |
92 |
public static final int |
DUP2_X1 |
93 |
public static final int |
DUP2_X2 |
94 |
public static final int |
F_APPEND |
1 |
public static final int |
F_CHOP |
2 |
public static final int |
F_FULL |
0 |
public static final int |
F_NEW |
-1 |
public static final int |
F_SAME |
3 |
public static final int |
F_SAME1 |
4 |
public static final int |
F2D |
141 |
public static final int |
F2I |
139 |
public static final int |
F2L |
140 |
public static final int |
FADD |
98 |
public static final int |
FALOAD |
48 |
public static final int |
FASTORE |
81 |
public static final int |
FCMPG |
150 |
public static final int |
FCMPL |
149 |
public static final int |
FCONST_0 |
11 |
public static final int |
FCONST_1 |
12 |
public static final int |
FCONST_2 |
13 |
public static final int |
FDIV |
110 |
public static final int |
FLOAD |
23 |
public static final int |
FMUL |
106 |
public static final int |
FNEG |
118 |
public static final int |
FREM |
114 |
public static final int |
FRETURN |
174 |
public static final int |
FSTORE |
56 |
public static final int |
FSUB |
102 |
public static final int |
GETFIELD |
180 |
public static final int |
GETSTATIC |
178 |
public static final int |
GOTO |
167 |
public static final int |
I2B |
145 |
public static final int |
I2C |
146 |
public static final int |
I2D |
135 |
public static final int |
I2F |
134 |
public static final int |
I2L |
133 |
public static final int |
I2S |
147 |
public static final int |
IADD |
96 |
public static final int |
IALOAD |
46 |
public static final int |
IAND |
126 |
public static final int |
IASTORE |
79 |
public static final int |
ICONST_0 |
3 |
public static final int |
ICONST_1 |
4 |
public static final int |
ICONST_2 |
5 |
public static final int |
ICONST_3 |
6 |
public static final int |
ICONST_4 |
7 |
public static final int |
ICONST_5 |
8 |
public static final int |
ICONST_M1 |
2 |
public static final int |
IDIV |
108 |
public static final int |
IF_ACMPEQ |
165 |
public static final int |
IF_ACMPNE |
166 |
public static final int |
IF_ICMPEQ |
159 |
public static final int |
IF_ICMPGE |
162 |
public static final int |
IF_ICMPGT |
163 |
public static final int |
IF_ICMPLE |
164 |
public static final int |
IF_ICMPLT |
161 |
public static final int |
IF_ICMPNE |
160 |
public static final int |
IFEQ |
153 |
public static final int |
IFGE |
156 |
public static final int |
IFGT |
157 |
public static final int |
IFLE |
158 |
public static final int |
IFLT |
155 |
public static final int |
IFNE |
154 |
public static final int |
IFNONNULL |
199 |
public static final int |
IFNULL |
198 |
public static final int |
IINC |
132 |
public static final int |
ILOAD |
21 |
public static final int |
IMUL |
104 |
public static final int |
INEG |
116 |
public static final int |
INSTANCEOF |
193 |
public static final int |
INVOKEINTERFACE |
185 |
public static final int |
INVOKESPECIAL |
183 |
public static final int |
INVOKESTATIC |
184 |
public static final int |
INVOKEVIRTUAL |
182 |
public static final int |
IOR |
128 |
public static final int |
IREM |
112 |
public static final int |
IRETURN |
172 |
public static final int |
ISHL |
120 |
public static final int |
ISHR |
122 |
public static final int |
ISTORE |
54 |
public static final int |
ISUB |
100 |
public static final int |
IUSHR |
124 |
public static final int |
IXOR |
130 |
public static final int |
JSR |
168 |
public static final int |
L2D |
138 |
public static final int |
L2F |
137 |
public static final int |
L2I |
136 |
public static final int |
LADD |
97 |
public static final int |
LALOAD |
47 |
public static final int |
LAND |
127 |
public static final int |
LASTORE |
80 |
public static final int |
LCMP |
148 |
public static final int |
LCONST_0 |
9 |
public static final int |
LCONST_1 |
10 |
public static final int |
LDC |
18 |
public static final int |
LDIV |
109 |
public static final int |
LLOAD |
22 |
public static final int |
LMUL |
105 |
public static final int |
LNEG |
117 |
public static final int |
LOOKUPSWITCH |
171 |
public static final int |
LOR |
129 |
public static final int |
LREM |
113 |
public static final int |
LRETURN |
173 |
public static final int |
LSHL |
121 |
public static final int |
LSHR |
123 |
public static final int |
LSTORE |
55 |
public static final int |
LSUB |
101 |
public static final int |
LUSHR |
125 |
public static final int |
LXOR |
131 |
public static final int |
MONITORENTER |
194 |
public static final int |
MONITOREXIT |
195 |
public static final int |
MULTIANEWARRAY |
197 |
public static final int |
NEW |
187 |
public static final int |
NEWARRAY |
188 |
public static final int |
NOP |
0 |
public static final int |
POP |
87 |
public static final int |
POP2 |
88 |
public static final int |
PUTFIELD |
181 |
public static final int |
PUTSTATIC |
179 |
public static final int |
RET |
169 |
public static final int |
RETURN |
177 |
public static final int |
SALOAD |
53 |
public static final int |
SASTORE |
86 |
public static final int |
SIPUSH |
17 |
public static final int |
SWAP |
95 |
public static final int |
T_BOOLEAN |
4 |
public static final int |
T_BYTE |
8 |
public static final int |
T_CHAR |
5 |
public static final int |
T_DOUBLE |
7 |
public static final int |
T_FLOAT |
6 |
public static final int |
T_INT |
10 |
public static final int |
T_LONG |
11 |
public static final int |
T_SHORT |
9 |
public static final int |
TABLESWITCH |
170 |
public static final int |
V1_1 |
196653 |
public static final int |
V1_2 |
46 |
public static final int |
V1_3 |
47 |
public static final int |
V1_4 |
48 |
public static final int |
V1_5 |
49 |
public static final int |
V1_6 |
50 |
| org.objectweb.asm.Type | ||
|---|---|---|
public static final int |
ARRAY |
9 |
public static final int |
BOOLEAN |
1 |
public static final int |
BYTE |
3 |
public static final int |
CHAR |
2 |
public static final int |
DOUBLE |
8 |
public static final int |
FLOAT |
6 |
public static final int |
INT |
5 |
public static final int |
LONG |
7 |
public static final int |
OBJECT |
10 |
public static final int |
SHORT |
4 |
public static final int |
VOID |
0 |
| org.objectweb.asm.commons.GeneratorAdapter | ||
|---|---|---|
public static final int |
ADD |
96 |
public static final int |
AND |
126 |
public static final int |
DIV |
108 |
public static final int |
EQ |
153 |
public static final int |
GE |
156 |
public static final int |
GT |
157 |
public static final int |
LE |
158 |
public static final int |
LT |
155 |
public static final int |
MUL |
104 |
public static final int |
NE |
154 |
public static final int |
NEG |
116 |
public static final int |
OR |
128 |
public static final int |
REM |
112 |
public static final int |
SHL |
120 |
public static final int |
SHR |
122 |
public static final int |
SUB |
100 |
public static final int |
USHR |
124 |
public static final int |
XOR |
130 |
| org.objectweb.asm.signature.SignatureVisitor | ||
|---|---|---|
public static final char |
EXTENDS |
43 |
public static final char |
INSTANCEOF |
61 |
public static final char |
SUPER |
45 |
| org.objectweb.asm.tree.AbstractInsnNode | ||
|---|---|---|
public static final int |
FIELD_INSN |
4 |
public static final int |
FRAME |
13 |
public static final int |
IINC_INSN |
9 |
public static final int |
INSN |
0 |
public static final int |
INT_INSN |
1 |
public static final int |
JUMP_INSN |
6 |
public static final int |
LABEL |
7 |
public static final int |
LDC_INSN |
8 |
public static final int |
LINE |
14 |
public static final int |
LOOKUPSWITCH_INSN |
11 |
public static final int |
METHOD_INSN |
5 |
public static final int |
MULTIANEWARRAY_INSN |
12 |
public static final int |
TABLESWITCH_INSN |
10 |
public static final int |
TYPE_INSN |
3 |
public static final int |
VAR_INSN |
2 |
| org.objectweb.asm.util.CheckSignatureAdapter | ||
|---|---|---|
public static final int |
CLASS_SIGNATURE |
0 |
public static final int |
METHOD_SIGNATURE |
1 |
public static final int |
TYPE_SIGNATURE |
2 |
| org.objectweb.asm.util.TraceAbstractVisitor | ||
|---|---|---|
public static final int |
CLASS_DECLARATION |
7 |
public static final int |
CLASS_SIGNATURE |
5 |
public static final int |
FIELD_DESCRIPTOR |
1 |
public static final int |
FIELD_SIGNATURE |
2 |
public static final int |
INTERNAL_NAME |
0 |
public static final int |
METHOD_DESCRIPTOR |
3 |
public static final int |
METHOD_SIGNATURE |
4 |
public static final int |
PARAMETERS_DECLARATION |
8 |
public static final int |
TYPE_DECLARATION |
6 |
| org.objectweb.asm.xml.Processor | ||
|---|---|---|
public static final int |
BYTECODE |
1 |
public static final int |
MULTI_XML |
2 |
public static final int |
SINGLE_XML |
3 |
|
|||||||||
| PREV NEXT | FRAMES NO FRAMES |


Report
Login for Contact/Feedback
Feedback Page
Total Active Ventures:
Total Launched Ventures:
Gap Funding #


IMGS
About
Contact
Sign Up
Login
The Image Gallery
The bunch of beautiful images that I didn't take(except from the first one!)


The recomputation.org Mission
Our goal is to follow the recomputation manifesto and make computational science experiments recomputable by providing tools and a repository to store experiments in. To achieve this our mission is:
If we can compute your experiment now, anyone can recompute it 20 years from now
Guiding Principles
recomputation.org is brand new and (as I write) holds zero experiments. But the following are guiding principles which we will use in developing our tools and repository to achieve the mission.
recomputation.org will make available virtual machines or equivalent technology to allow exact recomputation of lodged experiments.
recomputation.org will make its best efforts to ensure that all experiments which it believes to be recomputable will remain recomputable for all time.
recomputation.org will always be free to those lodging bona-fide scientific experiments and to those obtaining past experiments, provided that
- all aspects of the experiments are freely available,
- experimenter’s contributions are open source, and
- fees are not charged for the related scientific publication.
recomputation.org will provide its code and tools using an appropriate open source licence, including server-side code.
recomputation.org will serve as a testbed for scientific research into issues such as experimental techniques and methodologies.
recomputation.org will seek to fund its mission through research funding, donations, and charging for services such as lodging non-open source or non-freely available experiments. see below
Notes:
- I’ve written a long blog post on the caveats that come with the intended free price.*
Update 12 April 2013: Point 6 does not appear in The Recomputation Manifesto as I decided it was fairly obvious we would like to fund our efforts in various ways. I will leave it here, however.


Skeleton is a super simple css boilerplate that consist of a single stylesheet and a set of rules. It gives you a responsive web-page with beautiful minimalistic styles that applies to a basic grid, buttons, forms and table elements. From this template you can go on and develop your own design, but it's a start without the pain of having to write all the CSS code for a basic responsive web-page.
| Pro | Con | Learn |
|---|---|---|
| Supereasy to use and install. Beautiful and easy to tweak to your own needs. |
Non extensive, only covers very basic needs. | Skeleton download and reference |


Arsenal board denied three key transfer requests from Unai Emery
by Metro Sport ReporterArsenal’s board turned down Unai Emery’s request to sign Atletico Madrid midfielder Thomas Partey, Crystal Palace’s Wilfried Zaha and Manchester United centre-back Harry Maguire in the summer, according to reports.
The Gunners spent over £130 million during the last transfer window by completing deals for Nicolas Pepe, Kieran Tierney, David Luiz, Gabriel Martinelli and William Saliba, who has remained at Saint-Etienne on loan for this season.
But Arsenal have made a poor start to the Premier League campaign with the team currently sitting 11th in the Premier League, registering just 19 points from 15 matches so far.
The Gunners also opted to sack Emery 10 days ago following the team’s woeful run of form and have temporarily replaced him with Freddie Ljungberg.
According to The Athletic, Emery had proposed several transfer targets to Arsenal’s hierarchy but three key signings were missed.
Emery was keen on bolstering his midfield options with the arrival of Partey from Atletico Madrid.
The 26-year-old was reportedly keen to join Arsenal in the summer but the Gunners deemed his €50 million (£42m) release clause too expensive.
Emery faced a similar problem with his desire to sign Maguire ahead of Manchester United as Arsenal were unwilling to meet Leicester City’s asking price and the England international ended up moving to Old Trafford for £80m.
Emery was also at odds with Arsenal’s board over the recruitment of a winger. The Spaniard was impressed with Zaha’s performances against his side and wanted the Palace forward in his team as he would take less time to adapt having already played in the Premier League.
But Arsenal’s hierarchy favoured a move for Pepe for a club-record £72m, primarily because the Ivorian is younger than Zaha.


See: Description
| Class | Description |
|---|---|
| BikelChineseHeadFinder |
A headfinder implementing Dan Bikel's head rules.
|
| CEDict | |
| ChineseCollinizer |
Performs collinization operations on Chinese trees similar to
those for English Namely:
strips all functional & automatically-added tags
strips all punctuation
merges PRN and ADVP
eliminates ROOT (note that there are a few non-unary ROOT nodes;
these are not eliminated)
|
| ChineseEnglishWordMap |
A class for mapping Chinese words to English.
|
| ChineseEscaper |
An Escaper for Chinese normalization to match Treebank.
|
| ChineseGrammaticalRelations |
ChineseGrammaticalRelations is a
set of
GrammaticalRelation objects for the Chinese language. |
| ChineseGrammaticalStructure |
A GrammaticalStructure for Chinese.
|
| ChineseGrammaticalStructure.FromDependenciesFactory | |
| ChineseGrammaticalStructureFactory | |
| ChineseHeadFinder |
HeadFinder for the Penn Chinese Treebank.
|
| ChineseSemanticHeadFinder |
Implements a 'semantic head' variant of the the HeadFinder found in Chinese Head Finder
|
| ChineseTreebankLanguagePack |
Language pack for the UPenn/Colorado Chinese treebank.
|
| ChineseUtils |
This class contains a few String constants and
static methods for dealing with Chinese text.
|
| CHTBTokenizer |
A simple tokenizer for tokenizing Penn Chinese Treebank files.
|
| CTBErrorCorrectingTreeNormalizer |
This was originally written to correct a few errors Galen found in CTB3.
|
| CTBErrorCorrectingTreeNormalizer.CTBErrorCorrectingTreeReaderFactory |
So you can create a TreeReaderFactory using this TreeNormalizer easily by reflection.
|
| CTBTreeReaderFactory |
The
CTBTreeReaderFactory is a factory for creating a
TreeReader suitable for the Penn Chinese Treebank (CTB). |
| CTBTreeReaderFactory.NoEmptiesCTBTreeReaderFactory | |
| FragDiscardingPennTreeReader | |
| RadicalMap |
A way to determine the primary (or "semantic") radical of a Chinese character or get the set of
characters with a given semantic radical.
|
| SunJurafskyChineseHeadFinder |
A HeadFinder for Chinese based on rules described in Sun/Jurafsky NAACL 2004.
|


Explain Control Flow and Loops
Control Flow - The Flow of a program is a representation of the order in which it executes (runs) different instructions, just like you would think of the flow of your day, the motions you go through, so does a computer program.
There are different ways you can alter the flow of a program, one of those ways is through the use of 'conditional loops' - a block of code that is repeated until some condition the computer is checking is no longer met.
An example of this is when you go to get a bowl of cereal, you need to be careful about how much milk you pour. personally I like to just cover the cereal so to tell a computer to do this id say something similar to
while(milkLevel < cerealLevel) {
pourMilk();
}
A while loop runs the code inside its {curley brackets} until the condition in the (round brackets) is no longer true. In this case once the milkLevel is equal or greater than the cerealLevel it'll stop running the pourMilk command.


Under-fire Silva seeks strong response from Everton
Everton's defeat to Norwich City on Saturday saw them slide closer to the danger zone and under-fire manager Marco Silva says they will have to raise their game significantly with a tough run of fixtures on the horizon.
REUTERS: Everton's defeat to Norwich City on Saturday saw them slide closer to the danger zone and under-fire manager Marco Silva says they will have to raise their game significantly with a tough run of fixtures on the horizon.
Silva was booed by supporters at Goodison Park after Everton's seventh loss of the season left them four points above the relegation zone and the Portuguese later slammed his players, saying they were afraid to play football.
"After the performance against Norwich, we have to react and react strong because it will take playing at a different level to get the points we want," Silva told the British media.
Everton visit second-placed Leicester City on Sunday before travelling to league leaders Liverpool three days later and complete a hectic six-day period by hosting Chelsea.
They will then take on Manchester United and Arsenal before Christmas.
"We cannot look for the next five games, we have to focus on the next one. We'll focus on Leicester, nothing else," he said.
"It will be a tough week with three games in six days but we have to look at each one in the right way."
(Reporting by Shrivathsa Sridhar in Bengaluru; Editing by Peter Rutherford)