j1 la-2011-se-tech-keynote

| Copyright © 2011, Oracle and/or it’s affiliates. All rights reserved. | Insert Information Protection Policy Classification from Slide 8

The Java SE Platform: Rebuilding MomentumTerrence BarrSenior Technologist, Oracle@terrencebarr

Thursday, December 15, 2011

| Copyright © 2011, Oracle and/or its affiliates. All rights reserved. 2

http://javaspotlight.org@javaspotlight


http://javaspotlight.org


Mike DuigouAlan BatemanJim LaskeyAlex BuckleyStuart MarksJoe DarcyBruno SouzaAdam BeinAdam MessingerMark ReinholdCameron Purdy


http://javaspotlight.org@javaspotlight





Safe Harbor Statement


| Copyright © 2011, Oracle and/or its affiliates. All rights reserved.

The preceding and following material is intended to outline our general product direction. It is intended for information purposes only, and may not be incorporated into any contract. It is not a commitment to deliver any material, code, or functionality, and should not be relied upon in making purchasing decisions. The development, release, and timing of any features or functionality described for Oracle’s products remains at the sole discretion of Oracle.

3

Safe Harbor Statement


Priorities for our Java Platforms



Grow developer base



Grow developer base

Grow adoption



Grow developer base

Grow adoption

Increase competitiveness



Grow developer base

Grow adoption

Increase competitiveness

Adapt to change



7Thursday, December 15, 2011


76



7Project Jigsaw

InvokeDynamic (JSR 292)

Fork/Join Framework

Project Coin (JSR 334)

Project Lambda (JSR 335)

6



7Project Jigsaw


Fork/Join Framework


Project Lambda (JSR 335)Strict Verification

Parallel Class LoadersType Annotations (JSR 308)

Transfer QueuesPhasersBulk-Data Operations

Unicode 6.0

Swing Nimbus

XRender Pipeline

ECC

Swing JLayer

More New I/O (JSR 203)

JDBC 4.1

TLS 1.2

Enhanced LocalesSDP & SCTP

6



7Mid 2012 Project Jigsaw


Fork/Join Framework


Project Lambda (JSR 335)Strict Verification



Unicode 6.0

Swing Nimbus

XRender Pipeline

ECC

Swing JLayer


JDBC 4.1

TLS 1.2


6





Fork/Join Framework


Strict Verification



Unicode 6.0

Swing Nimbus

XRender Pipeline

ECC

Swing JLayer


JDBC 4.1

TLS 1.2


Project Lambda

6





Fork/Join Framework


Strict VerificationParallel Class Loaders

Type Annotations (JSR 308)Transfer QueuesPhasers

Bulk-Data OperationsUnicode 6.0

Swing Nimbus

XRender Pipeline

ECC

Swing JLayerMore New I/O (JSR 203)

JDBC 4.1

TLS 1.2

Enhanced Locales

SDP & SCTP Project Lambda

6



7Project Jigsaw


Fork/Join Framework





Swing Nimbus

XRender Pipeline

ECC


JDBC 4.1

TLS 1.2

Enhanced Locales

SDP & SCTP Project LambdaMid 2011

6



7Project Jigsaw


Fork/Join Framework





Swing Nimbus

XRender Pipeline

ECC


JDBC 4.1

TLS 1.2

Enhanced Locales

SDP & SCTP

Project Lambda

8Mid 2011

6



JDK 7 Schedule

7



JDK 7 Schedule

2011/07/28 General Availability2011/06/08 Final test cycle starts2011/05/18 Bug fixes: Showstoppers only

2011/05/11 All targeted bugs addressed First release candidate built

2011/04/28 API/interface changes: Showstoppers only2011/04/12 Rampdown start: P1-P3 bugs only2010/12/16 Feature Complete

7



Four JSRs



1,966 Enhancements

8

Four JSRs


9,494 Bug Fixes


1,966 Enhancements

8

Four JSRs


9,494 Bug Fixes


1,966 Enhancements

9,018 Mercurial Changesets

8

Four JSRs


9,494 Bug Fixes


1,966 Enhancements

9,018 Mercurial Changesets147 Builds

8

Four JSRs


9,494 Bug Fixes


1,966 Enhancements


Four years, seven months,and seventeen days …

8

Four JSRs


7Java9,494 Bug Fixes


1,966 Enhancements


Four years, seven months,and seventeen days …

2011/7/28

8

Four JSRs



79




Project Coin (JSR 334)79

Fork/Join Framework (JSR 166y)


NIO.2 (JSR 203)



http://www.flickr.com/photos/chefranden/908539119/




new HashMap<String,String>


Map();

<String,String> map =

new HashMap<String,Map<Integer,String>><String,Map<Integer,String>>


Map();

map =

new HashMap<String,Map<Integer,List<String>>>

<String,Map<Integer,List<String>>>


Map();

map =

Map();

// Diamond

map =

<>Thursday, December 15, 2011

Map();

// Diamond

map = <>

// ...

new HashMap<>();



Map

// Diamond

map;

map =

new HashMap<>();<String,Map<Integer,List<String>>>


Map

// Diamond

foo() {

} return

if (s.equals(

else if (s.equals(

else if (s.equals(


else

"foo" doFoo();

"bar" doBar();

doBaz();

throw new IllegalArgumentException(s);

))

))

))

"baz"



switch (s) {

default:

}

case : break;

case case

::

break; break;

"foo" doFoo();"bar" doBar();

doBaz();

throw new IllegalArgumentException(s);

"baz"

// Strings in switch



try { // ...}



try { // ...} IOException x) { logger.log(SEVERE, "Unexpected failure", x); throw x;}

catch (



try { // ...} IOException x) { logger.log(SEVERE, "Unexpected failure", x); throw x; catch ( x) {

logger.log(SEVERE, "Unexpected failure", x); throw x;}

} SQLException

catch (



try { // ...} IOException x) { logger.log(SEVERE, "Unexpected failure", x); throw x; catch ( x) {

logger.log(SEVERE, "Unexpected failure", x); throw x;}

}

| SQLException

// Multi-catch

catch (



try { // ...} IOException x) { logger.log(SEVERE, "Unexpected failure", x); throw x;}

| SQLException

// Multi-catch

catch (



static void copy(Path src, Path dst) throws IOException { InputStream in = Files.newInputStream(src); OutputStream out = Files.newOutputStream(dst);

}

byte[] buf = new byte[BUFSIZ]; int n; while ((n = in.read(buf)) >= 0) out.write(buf, 0, n);



static void copy(Path src, Path dst) throws IOException { InputStream in = Files.newInputStream(src); OutputStream out = Files.newOutputStream(dst);

}




static void copy(Path src, Path dst) throws IOException { InputStream in = Files.newInputStream(src); OutputStream out = Files.newOutputStream(dst); try {

finally { in.close(); out.close(); }}

byte[] buf = new byte[BUFSIZ]; int n; while ((n = in.read(buf)) >= 0) out.write(buf, 0, n); }



✘15

static void copy(Path src, Path dst) throws IOException { InputStream in = Files.newInputStream(src); OutputStream out = Files.newOutputStream(dst); try {

finally { in.close(); out.close(); }}



static void copy(Path src, Path dst) throws IOException {


InputStream in = OutputStream out = try {

finally {

in.close();

out.close(); }}


Files.newInputStream(src); Files.newOutputStream(dst);




InputStream in = OutputStream out = try {

finally {

in.close();

out.close(); }}


null; null;

in = out =

if (in != null)

if (out != null)

Files.newInputStream(src); Files.newOutputStream(dst);




InputStream in =

OutputStream out = try {

finally { in.close();

out.close(); }

}


}

in = out =

}

Files.newInputStream(src);

Files.newOutputStream(dst);




InputStream in =

OutputStream out = try {

finally { in.close();

out.close(); }

}


}

try {

} finally {

}


Files.newOutputStream(dst);



Files.newOutputStream(dst); try {


InputStream in = OutputStream out =

try {

}


}?




Files.newOutputStream(dst); try (



}


// Try-with-resources

?

) Files.newInputStream(src);



Files.newOutputStream(dst); )



}


try (

{

}


?





package java.lang;

public interface AutoCloseable { public void close() throws IOException;}



package foo;

class FooResource implements AutoCloseable{

// ...

public void close() { // ... }

}



// Preci

se re-th

row

void ret

hrow(boo

lean b)

throws

IOExcep

tion, SQ

LExcepti

on

{ tr

y {

// .

..

} catc

h (Excep

tion x)

{

logg

er.log(S

EVERE, "

Unexpect

ed failu

re", x);

thro

w x;

}}



// Preci

se re-th

row

void ret

hrow(boo

lean b)

throws

IOExcep

tion, SQ

LExcepti

on

{ tr

y {

// .

..

} catc

h (Excep

tion x)

{

logg

er.log(S

EVERE, "

Unexpect

ed failu

re", x);

thro

w x;

}}

// Literalsbyte b = (byte)0b10101010;

int magic = 0xCAFE_BABE;long max = 0x7fff_ffff_ffff_ffffL;


// Preci

se re-th

row

void ret

hrow(boo

lean b)

throws

IOExcep

tion, SQ

LExcepti

on

{ tr

y {

// .

..

} catc

h (Excep

tion x)

{

logg

er.log(S

EVERE, "

Unexpect

ed failu

re", x);

thro

w x;

}}

// Safe varargs

@SafeVarargsstatic <T> void addToList3 (List<T> listArg, T ... elements){ for (T x : elements) { listArg.add(x); }}

// Literalsbyte b = (byte)0b10101010;

int magic = 0xCAFE_BABE;long max = 0x7fff_ffff_ffff_ffffL;


723

Fork/Join Framework





723

Fork/Join Framework



NIO.2 (JSR 203)



Clojure

Tcl

v-language

Funnel

Mini

Lisp

LogoJHCR

Drools

Prolog

LLP

JESS Eiffel

Smalltalk

G Jython

Correlate

Bex Script

Sleep

JudoScript

SimkinWebL

Processing

Tiger

Icon

Modula-2

E

Rexx

Present

Scheme

Basic

TermWare

Hojo

Tea

PHP

FScript

Jickle

Piccola

Pascal

Luck

Scala Sather

PLAN

foo

Ada

ObjectScript

iScript

SALSAOberon

Phobos

JRuby

Dawn

GroovyYassl

Forth

Zigzag

Nice

Yoix

C#

Anvil

JavaScript

BeanShell

CAL

Pnuts

24



Ruby = Method CallsLots and lots and lots of ʼem …



def foo barend

def bar bazend

def baz # ...end


JRubycall

logic


def foo barend

def bar bazend

def baz # ...end Kills many JVM optimizations

JRuby on Java 5/6

foo bar bazJRuby

calllogic


JRuby on Java 7 with InvokeDynamic


def foo barend

def bar bazend

def baz # ...end Straight-through dispatch paths

foo bar baz


foo bar

JRuby on Java 7 with InvokeDynamic


def foo barend

def bar bazend

def baz # ...end

baz

Optimizations (like inlining) can happen!

bar baz



1

5

8

12

15

fib +calls +consts +both richards redblack

1.9x3.2x

7.4x

14.2x

3.6x

5.5x

1.6x1.8x

3.5x4.4x

1.7x2.7x

Times faster than Ruby 1.9.3

JRuby on Java 6 JRuby on invokedynamic



728

Fork/Join Framework





728

Fork/Join Framework



NIO.2 (JSR 203)



1. Keep all the processor cores busy




2. Minimize synchronization overhead




2. Minimize synchronization overhead

3. Scale linearly as the number of cores increases



Result compute(Task t) {

}


Result compute(Task t) { if (t.size() < SEQUENTIAL_THRESHOLD) {

}}



}}

return t.computeSequentially();




} else {

left = compute(p.leftHalf()); right = compute(p.rightHalf());

}}

Result left, right;





} else {


}}

Result left, right;


return combine(left, right);




} else {


}}

Result left, right;






} else {


}}

Result left, right;



INVOKE-IN-PARALLEL {

}


public class Task extends java.util.concurrent.RecursiveAction{

List<Student> students;

Task(List<Student> ss) { students = ss; }

Task leftHalf() { int n = students.size(); return new Task(students.subList(0, n / 2)); }

Task rightHalf() { int n = students.size(); return new Task(students.subList(n / 2, n)); }

double computeSequentially() { double max = Double.MIN_VALUE; for (Student s : students) { if (s.gradYear == 2011) max = Math.max(max, s.score); } return max; }

static final int SEQUENTIAL_THRESHOLD = 1 << 14;

double result;

protected void compute() { if (students.size() < SEQUENTIAL_THRESHOLD) { result = computeSequentially(); } else { Task left = leftHalf(); Task right = rightHalf(); invokeAll(left, right); // INVOKE-IN-PARALLEL result = Math.max(left.result, right.result); } }

static double compute(List<Student> ss) { ForkJoinPool pool = new ForkJoinPool(); Task t = new Task(ss); pool.invoke(t); return t.result; }

}


735


Fork/Join Framework




735


Fork/Join Framework


NIO.2 (JSR 203)



New Filesystem APIFile notificationsDirectory operations

Asynchronous I/ONew filesystem provider for zip/jar archives



import java.nio.file.*;

37




Path searchDir = Paths.get("c:/Users");final Path findFile = Paths.get("baby.jpg");

37





FileVisitor visitor = new SimpleFileVisitor() { public FileVisitResult visitFile(Path file, BasicFileAttributes attrs) { if (file.getName().startsWith(findFile)) { System.out.format("%s%n", findFile); } return FileVisitResult.CONTINUE; }};

37


EnumSet<FileVisitOption> opts = EnumSet.of(FileVisitOption.FOLLOW_LINKS);

37

EnumSet<FileVisitOption> opts = EnumSet.of(FileVisitOption.FOLLOW_LINKS);

Files.walkFileTree(searchDir, opts, Integer.MAX_VALUE, visitor);

37


738


Fork/Join Framework


Strict class-file checking · Upgrade the class-loader architecture · Method to close a URLClassLoader · Concurrency and collections updates · Unicode 6.0 · Locale enhancement · Separate user and user-interface locales · More new I/O APIs (JSR 203) · Filesystem provider for zip/jar archives · SCTP · SDP · Windows Vista IPv6 stack · TLS 1.2 · Elliptic-curve cryptography (ECC) · JDBC 4.1 · XRender pipeline for Java 2D · New platform APIs for 6u10 graphics features · Nimbus look-and-feel for Swing · Swing JLayer component · Gervill sound synthesizer · Update the XML stack · Enhanced MBeans



738


Fork/Join Framework


Strict class-file checking · Upgrade the class-loader architecture · Method to close a URLClassLoader · Concurrency and collections updates · Unicode 6.0 · Locale enhancement · Separate user and user-interface locales · More new I/O APIs (JSR 203) · Filesystem provider for zip/jar archives · SCTP · SDP · Windows Vista IPv6 stack · TLS 1.2 · Elliptic-curve cryptography (ECC) · JDBC 4.1 · XRender pipeline for Java 2D · New platform APIs for 6u10 graphics features · Nimbus look-and-feel for Swing · Swing JLayer component · Gervill sound synthesizer · Update the XML stack · Enhanced MBeans

NIO.2 (JSR 203)


Copyright © 2010 Oracle and/or its affiliates. All rights reserved.

JVM Convergence



840



8 Project Lambda (JSR 335)

40



8 Project Jigsaw (JSR TBD)


40



C#



class Student { String name; int gradYear; double score;}


List<Student> students = ...;




double max = Double.MIN_VALUE;for (Student s : students) { if (s.gradYear == 2011) max = Math.max(max, s.score);}return max;


public class Task extends java.util.concurrent.RecursiveAction{

List<Student> students;

Task(List<Student> ss) { students = ss; }

Task leftHalf() { int n = students.size(); return new Task(students.subList(0, n / 2)); }

Task rightHalf() { int n = students.size(); return new Task(students.subList(n / 2, n)); }

double computeSequentially() { double max = Double.MIN_VALUE; for (Student s : students) { if (s.gradYear == 2011) max = Math.max(max, s.score); } return max; }

static final int SEQUENTIAL_THRESHOLD = 1 << 14;

double result;

protected void compute() { if (students.size() < SEQUENTIAL_THRESHOLD) { result = computeSequentially(); } else { Task left = leftHalf(); Task right = rightHalf(); invokeAll(left, right); // INVOKE-IN-PARALLEL result = Math.max(left.result, right.result); } }

static double compute(List<Student> ss) { ForkJoinPool pool = new ForkJoinPool(); Task t = new Task(ss); pool.invoke(t); return t.result; }

}

s.scoreMath.maxs.gradYear == 2011 if ( )

max = (max, }return max;




);

double max Double.MIN_VALUE; = for (Student s : students) {


s.scoreMath.maxs.gradYear == 2011 if ( )





);

double max Double.MIN_VALUE; = for (Student s : ) {students


Math.maxs.gradYear == 2011 if ( )





s.score);

double max Double.MIN_VALUE; = for (Student s : ) {students


double max = students.filter(new Predicate<Student>() { public boolean eval(Student s) { return s.gradYear == 2011; } }).map(new Mapper<Student,Double>() { public Double map(Student s) { return s.score; } }).reduce(0.0, new Reducer<Double,Double>() { public Double reduce(Double max, Double score) { return Math.max(max, score); } });

Math.max

s.gradYear == 2011

s.score

= studentsdouble max



Math.max

s.gradYear == 2011

s.score

filter. = studentsdouble max




Math.max

s.gradYear == 2011

s.score

filter

.map

. = studentsdouble max




Math.max

s.gradYear == 2011

s.score

filter

.map

.reduce



Math.max

s.gradYear == 2011

s.score

filter(new Predicate<Student>() { {

; }

.map

.reduce


public boolean eval(Student s) return

})

)



Math.max

s.gradYear == 2011

s.score


; } } .map

.reduce

)


public boolean eval(Student s return


)



Math.max

s.gradYear == 2011

s.score


; } } .map new Mapper<Student,Double>() {(

{;

} } .reduce

)

)


public boolean eval(Student s

public Double map(Student s)

return

return



Math.max

s.gradYear == 2011

s.score



{;

} } .reduce

)

)




return

return

)


Math.max

s.gradYear == 2011

s.score



{;

} } .reduce( , new Reducer<Double,Double>() {

(max, score) } }

)

)

);

0.0


{ public Double reduce(Double max, Double score)



return

return

return ;

)

Math.max

s.gradYear == 2011

s.score

filter(

.map new Mapper<Student,Double>() {( {

; } } .reduce( , new Reducer<Double,Double>() {

(max, score) } }

)

)

);

0.0



(Student s

public Double map(Student s) return

return ;

)


Math.max

s.gradYear == 2011

s.score

filter(



} }

)

)

);

0.0



(Student s


return (max, score);

)



Math.max

s.gradYear == 2011

s.score

filter(



} }

)

)

);

0.0



(Student s



-> )


Math.max

s.gradYear == 2011

s.score

filter(

.map(

.reduce( , new Reducer<Double,Double>() {

} }

)

)

);

0.0



(Student s

(Student s)


-> )

->


Math.max

s.gradYear == 2011s.score

filter(.map(


} }

))

);

0.0



(Student s(Student s)

return

,

(max, score);

)


->


Math.max


filter(.map(


} }

))

);

0.0




return

->

,

(max, score);

)


->


Math.max


filter(.map(

.reduce(

))

);

0.0


(Double max, Double score)

(Student s(Student s) ->

,

(max, score)

)


-> ->


Math.max


filter(.map(.reduce(

))

);

0.0




,

(max, score)

)


-> ->


Math.max



))

);

0.0




,

-> (max, score)

)


-> ->


Math.max



))

);

0.0


( max, score)

ss

,

-> (max, score)


->

-> ->

double max


Math.max



))

);

0.0

. = students

(max, score)

ss

,

(max, score)


-> ->

double max


Math.max



))

);

0.0

. = students ss

,


-> ->


double max

Math.max



))

);0.0

. = students ss

,


-> ->


double max s.gradYear == 2011

s.scorefilter(

.map(

.reduce(

))

);0.0

. = students ss

, Math#max



-> ->



s.scorefilter(

.map(

.reduce(

))

);0.0

. = students ss

, Math#max


-> ->



s.scorefilter(

.map(

.reduce(

))

);0.0

. = students ss

, Math#max

// Iterable


-> ->



s.scorefilter(

.map(

.reduce(

))

);0.0

. = students ss

, Math#max

// Iterable // Iterable


-> ->



s.scorefilter(

.map(

.reduce(

))

);0.0

. = students ss

, Math#max // Double



-> ->

double max

Math#max




))

);0.0

. = students

ss

, // Double




-> ->

double max

Math#max




))

);0.0

. = students

ss

, // Double


.parallel()



-> ->


double max

Math#max



))

);0.0

. = students

ss

,

.parallel()



interface Iterable<T> {

Iterator<T> iterator();

}




}


}

Iterable<T> filter(Predicate<? super T> predicate)

 Iterable map(Mapper<? super T, ? extends U> mapper)

 U reduce(U base, Reducer<U, ? super T> reducer);

;

;




}




;





}




Iterables.filter; default

;





}




default Iterables.filter;





}




default

default Iterables.map;

Iterables.filter;


}






 U reduce(U base, Reducer<U, ? super T> reducer)

default

default Iterables.map;

Iterables.filter;

}






 U reduce(U base, Reducer<U, ? super T> reducer)

default

default

default Iterables.reduce;

Iterables.map;

Iterables.filter;


Project Lambda = Lambda expressions + Bulk-data operations + Method literals + Default methods



8 Project Jigsaw (JSR TBD)


62



http://www.flickr.com/photos/lizadaly/2944362379




$ java -cp $APPHOME/lib/jdom-1.0.jar\:$APPHOME/lib/jaxen-1.0.jar\:$APPHOME/lib/saxpath-1.0.jar\:$APPHOME/lib/rome-1.0.jar\:$APPHOME/lib/rome-fetcher-1.0.jar\:$APPHOME/lib/joda-time-1.6.jar\:$APPHOME/lib/tagsoup-1.2.jar\ org.planetjdk.aggregator.Main



// module-info.java

module org.planetjdk.aggregator @ 1.0 { requires jdom @ 1.0; requires tagsoup @ 1.2; requires rome @ 1.0; requires rome-fetcher @ 1.0; requires joda-time @ 1.6; requires jaxp @ 1.4.4; class org.openjdk.aggregator.Main;}




jdom

rome

rome-fetcher

joda-time

tagsoupjaxp

org.planetjdk.aggregator

65



jdom

jaxen

rome

rome-fetcher

joda-time

tagsoupjaxp


65



jdom

jaxen

saxpathrome

rome-fetcher

joda-time

tagsoupjaxp


65



// module-info.java


66



// module-info.java


jar

66



// module-info.java


jar

jmod

66



// module-info.java


rpm

jar

jmod

66



// module-info.java


deb

rpm

jar

jmod

66



// module-info.java


deb

rpm

jar

jmod

mvn

66



http://www.flickr.com/photos/viagallery/2290654438



base

ssllogging

rmi auth

scripting

naming compiler

kerberostxn management jaxp

javac

corba jdbcxml-dsig desktopjaxws

javadoc

jre-toolsheadlessjaxws-tools

javahjavap

java toolsjre

deploy

jdk



base

ssllogging

rmi auth

scripting

naming compiler


javac


javadoc


javahjavap

java toolsjre

deploy

jdk



base

ssllogging

rmi auth

scripting

naming compiler


javac


javadoc


javahjavap

java toolsjre

deploy

jdk

javafx



base

ssllogging

rmi auth

scripting

naming compiler


javac


javadoc


javahjavap

java toolsjre

deploy

jdk



80/20Thursday, December 15, 2011

Project Jigsaw (JSR TBD)



882





883





883

JavaScript (Project Nashorn)





883

JVM Convergence






883

JVM Convergence


Type Annotations (JSR 308)





883

JVM Convergence


Date/Time API (JSR 310)






883

JVM Convergence


Sensors







883

JVM Convergence


Sensors


Plus more to come …




JDK Roadmap

2011 2012 2013

JDK 7u2•JRE 7 on java.com•JavaFX 2.0 co-install

JDK 8•Windows, Linux, Solaris, OS X, Embedded Platforms

•Jigsaw•Lambda•JavaFX 3.0•Complete Oracle JVM Convergence

•JavaScript Interop•more

Last PublicJDK 6 Update

JDK 7u6•OS X JRE Port (for end-users)

•Improved OS integration, auto-updateJDK 7

JDK 7u4•OS X JDK Port (for developers)

2014

NetBeans 7•Java SE 7 Support•more

NetBeans.next•Java SE 8 Support•JavaFX 3.0 Support•more

Mac OS X•JDK 7 Developer Preview•Java FX 2.0 Dev Preview

NetBeans 7.1•JavaFX 2.0 Support

84



openjdk.java.net/projects/jdk8jdk8.java.net

86


j1 la-2011-se-tech-keynote

Technology

invokedynamic jsr

project coin jsr

oracle andor

swing nimbusmore new

terrencebarr copyright

forkjoin frameworkmid

sole discretion of oracle

java platformsthursday