Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with java
Search options not deleted
user 16465
Java (not to be confused with JavaScript) is a class-based, object-oriented, strongly typed, reflective language and run-time environment (JRE). Java programs are compiled to bytecode and run in a virtual machine (JVM) enabling a "write once, run anywhere" (WORA) methodology.
3
votes
Accepted
Shunting-Yard algorithm implementation
Ad "wide conditional statements":
if (isLeftAssociative(op1) && compareOperators(op1, op2) < 1
|| !isLeftAssociative(op1) && compareOperators(op1, op2) < 0) {
// ...
}
is not equal to your …
- 391
11
votes
HashSet and TreeSet
If you want to test differences between HashSet<E> and TreeSet<E>, you should put all the other code out of the measured region — that includes any file I/O, stdout/stderr I/O, and possibly also set i …
- 391
4
votes
HashSet and TreeSet
To the time measurements, I like the math in the way you compute the elapsed time by summing:
long start = 0;
long end = 0;
for(int i = 0; i < count; i++) {
start += System.nanoTime();
fileTo …
- 391