JSR for Java Collections 2.0 Enhancing the Java Core Libraries for the Next 25 Years
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Lecture 04 Linear Structures Sort
Algorithmics (6EAP) MTAT.03.238 Linear structures, sorting, searching, etc Jaak Vilo 2018 Fall Jaak Vilo 1 Big-Oh notation classes Class Informal Intuition Analogy f(n) ∈ ο ( g(n) ) f is dominated by g Strictly below < f(n) ∈ O( g(n) ) Bounded from above Upper bound ≤ f(n) ∈ Θ( g(n) ) Bounded from “equal to” = above and below f(n) ∈ Ω( g(n) ) Bounded from below Lower bound ≥ f(n) ∈ ω( g(n) ) f dominates g Strictly above > Conclusions • Algorithm complexity deals with the behavior in the long-term – worst case -- typical – average case -- quite hard – best case -- bogus, cheating • In practice, long-term sometimes not necessary – E.g. for sorting 20 elements, you dont need fancy algorithms… Linear, sequential, ordered, list … Memory, disk, tape etc – is an ordered sequentially addressed media. Physical ordered list ~ array • Memory /address/ – Garbage collection • Files (character/byte list/lines in text file,…) • Disk – Disk fragmentation Linear data structures: Arrays • Array • Hashed array tree • Bidirectional map • Heightmap • Bit array • Lookup table • Bit field • Matrix • Bitboard • Parallel array • Bitmap • Sorted array • Circular buffer • Sparse array • Control table • Sparse matrix • Image • Iliffe vector • Dynamic array • Variable-length array • Gap buffer Linear data structures: Lists • Doubly linked list • Array list • Xor linked list • Linked list • Zipper • Self-organizing list • Doubly connected edge • Skip list list • Unrolled linked list • Difference list • VList Lists: Array 0 1 size MAX_SIZE-1 3 6 7 5 2 L = int[MAX_SIZE] -
Apache Tomcat 9
Apache Tomcat 9 Preview Mark Thomas, September 2015 © 2015 Pivotal Software, Inc. All rights reserved. 2 Introduction Apache Tomcat committer since December 2003 – [email protected] Tomcat 8 release manager Member of the Servlet, WebSocket and EL expert groups Consultant Software Engineer @ Pivotal Currently focused on Apache Tomcat 9 © 2015 Pivotal Software, Inc. All rights reserved. 3 Agenda Specification mandated new features Tomcat specific new features Tomcat features removed Internal changes © 2015 Pivotal Software, Inc. All rights reserved. 4 Tomcat versions Minimum 1st Stable Tomcat JavaEE Servlet JSP EL WebSocket JASPIC EOL Java SE Release 5.x 4 1.4 2.4 2.0 N/A N/A N/A 08 2004 09 2012 6.x 5 5 2.5 2.1 2.1 N/A N/A 02 2007 12 2016 7.x 6 6 3.0 2.2 2.2 1.1 N/A 01 2011 TBD 8.x 7 7 3.1 2.3 3.0 1.1 N/A 02 2014 TBD 9.x 8 8 4.0 2.4? 3.1? 2.0? 1.1? Q4 2016? TBD © 2015 Pivotal Software, Inc. All rights reserved. 5 Specification changes © 2015 Pivotal Software, Inc. All rights reserved. 6 Specifications JavaEE 8 Key elements – HTML 5.0 – HTTP/2 – Simplification – Better integration for managed beans – Better infrastructure for the cloud © 2015 Pivotal Software, Inc. All rights reserved. 7 Specifications Servlet 4.0 Work started, stalled and is now starting again – Driven by JavaOne HTTP/2 Ease of use improvements – HttpFilter, default methods Clarifications – Starting to make progress © 2015 Pivotal Software, Inc. -
Java EE 7 Overview and Status
Java EE 7 Overview and Status Peter Doschkinow Senior Java Architect The following 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. Agenda . Java EE 7 Revised Scope . HTML5 Technologies . Productivity Improvements . Status and Roadmap Productivity Java EE Past, Present, & Future & HTML5 Java EE 7 Lightweight JMS 2.0, Ease of Java EE 6 Batch, Development Caching, TX Interceptor, Web Java EE 5 Pruning, WebSocket, Services Extensibility JSON Ease of Dev, J2EE 1.4 CDI, JAX-RS JAX-RPC, Enterprise Robustness CMP/ BMP, Ease of JSR 88 Java Platform J2EE 1.3 Web Development, Services Annotations, Web J2EE 1.2 Mgmt, EJB 3.0, JPA, Web Profile Deployment, JSF, JAXB, Profile Servlet, JSP, CMP, Async JAX-WS, Servlet 3.0, JAX-RS 2.0 EJB, JMS, Connector Connector StAX, SAAJ EJB 3.1 Lite RMI/IIOP Architecture Dec 1999 Sep 2001 Nov 2003 May 2006 Dec 2009 Q2 2013 10 specs 13 specs 20 specs 23 specs 28 specs 32+ specs Java EE 7 Revised Scope . PaaS theme postponed for Java EE 8 . HTML5 Support – WebSocket, JSON – HTML5 forms and markup . Higher Productivity – Less Boilerplate – Richer Functionality – More Defaults Java EE 7 – Candidate JSRs PaaS Theme Postponed for Java EE 8 . Reasons – Not enough experience in tenants management, provisioning, deployment and elasticity implementation in Cloud environments – Not enough consensus and substance as of August 2012 . -
Programmatic Testing of the Standard Template Library Containers
Programmatic Testing of the Standard Template Library Containers y z Jason McDonald Daniel Ho man Paul Stro op er May 11, 1998 Abstract In 1968, McIlroy prop osed a software industry based on reusable comp onents, serv- ing roughly the same role that chips do in the hardware industry. After 30 years, McIlroy's vision is b ecoming a reality. In particular, the C++ Standard Template Library STL is an ANSI standard and is b eing shipp ed with C++ compilers. While considerable attention has b een given to techniques for developing comp onents, little is known ab out testing these comp onents. This pap er describ es an STL conformance test suite currently under development. Test suites for all of the STL containers have b een written, demonstrating the feasi- bility of thorough and highly automated testing of industrial comp onent libraries. We describ e a ordable test suites that provide go o d co de and b oundary value coverage, including the thousands of cases that naturally o ccur from combinations of b oundary values. We showhowtwo simple oracles can provide fully automated output checking for all the containers. We re ne the traditional categories of black-b ox and white-b ox testing to sp eci cation-based, implementation-based and implementation-dep endent testing, and showhow these three categories highlight the key cost/thoroughness trade- o s. 1 Intro duction Our testing fo cuses on container classes |those providing sets, queues, trees, etc.|rather than on graphical user interface classes. Our approach is based on programmatic testing where the number of inputs is typically very large and b oth the input generation and output checking are under program control. -
Openjdk – the Future of Open Source Java on GNU/Linux
OpenJDK – The Future of Open Source Java on GNU/Linux Dalibor Topić Java F/OSS Ambassador Blog aggregated on http://planetjdk.org Java Implementations Become Open Source Java ME, Java SE, and Java EE 2 Why now? Maturity Java is everywhere Adoption F/OSS growing globally Innovation Faster progress through participation 3 Why GNU/Linux? Values Freedom as a core value Stack Free Software above and below the JVM Demand Increasing demand for Java integration 4 Who profits? Developers New markets, new possibilities Customers More innovations, reduced risk Sun Mindshare, anchoring Java in GNU/Linux 5 License + Classpath GPL v2 Exception • No proprietary forks (for SE, EE) • Popular & trusted • Programs can have license any license • Compatible with • Improvements GNU/Linux remain in the community • Fostering adoption • FSFs license for GNU Classpath 6 A Little Bit Of History Jun 1996: Work on gcj starts Nov 1996: Work on Kaffe starts Feb 1998: First GNU Classpath Release Mar 2000: GNU Classpath and libgcj merge Dec 2002: Eclipse runs on gcj/Classpath Oct 2003: Kaffe switches to GNU Classpath Feb 2004: First FOSDEM Java Libre track Apr 2004: Richard Stallman on the 'Java Trap' Jan 2005: OpenOffice.org runs on gcj Mai 2005: Work on Harmony starts 7 Sun & Open Source Java RIs Juni 2005: Java EE RI Glassfish goes Open Source Mai 2006: First Glassfish release Mai 2006: Java announced to go Open Source November 2006: Java ME RI PhoneME goes Open Source November 2006: Java SE RI Hotspot und Javac go Open Source Mai 2007: The rest of Java SE follows suit 8 Status: JavaOne, Mai 2007 OpenJDK can be fully built from source, 'mostly' Open Source 25,169 Source code files 894 (4%) Binary files (“plugs”) 1,885 (8%) Open Source, though not GPLv2 The rest is GPLv2 (+ CP exception) Sun couldn't release the 4% back then as free software. -
Java Magazine Is Provided on an “As Is” Basis
//NOVEMBER/DECEMBER 2014 / THE INTERNET OF THINGS JAVA IS EVERYWHERE 13 29 20 HENRIK STÅHL INDUSTRIAL AUTOMATION JAVA: THE NEXT ON JAVA AND IOT WITH ROBOTS GENERATION ORACLE.COM/JAVAMAGAZINE //table of contents / 13 20 29 COMMUNITY JAVA: THE NEXT ROBOTS MAKE JAVA DEVELOPMENT GENERATION FACTORIES Teach kids to code SMARTER and give them tools Keba’s systems help FOR THE INTERNET for success. usher in the next OF THINGS industrial revolution. JAVA IN ACTION Oracle’s Henrik Ståhl discusses the Internet of Things for Java developers. Internet of Things JAVA TECH New theme icon. See how it works. COVER ART BY LINDY GROENING COMMUNITY JAVA TECH 45 55 03 35 Embedded Rich Client ABOUT US From the Editor New to Java A Smart-Home Platform Building Castles in the Sky 05 Code Java on the Raspberry Pi for the Mass Market Use JavaFX 3D to model historical Java Nation BlueJ brings Java SE 8 development Eclipse SmartHome bridges the gap treasures and more. JavaOne recap, plus news, directly to the Raspberry Pi. between tech-savvy users and average 62 people, events, and books 38 users to provide a smart-home platform Rich Client for everyone. Java Architect A Bridge from Java 2D to JavaFX 25 50 JCP Executive Series jdeps, Compact Profiles, Profit from the easy migration path The Java Advantage for IoT and Java Modularity Embedded provided by FXGraphics2D. Freescale’s Maulin Patel discusses the A look at the future of Java modularity The Device I/O API 67 Internet of Things (IoT) and how the JCP 41 A standard API for peripherals and Fix This helps to facilitate evolving technologies. -
Parallelization of Bulk Operations for STL Dictionaries
Parallelization of Bulk Operations for STL Dictionaries Leonor Frias1?, Johannes Singler2 [email protected], [email protected] 1 Dep. de Llenguatges i Sistemes Inform`atics,Universitat Polit`ecnicade Catalunya 2 Institut f¨urTheoretische Informatik, Universit¨atKarlsruhe Abstract. STL dictionaries like map and set are commonly used in C++ programs. We consider parallelizing two of their bulk operations, namely the construction from many elements, and the insertion of many elements at a time. Practical algorithms are proposed for these tasks. The implementation is completely generic and engineered to provide best performance for the variety of possible input characteristics. It features transparent integration into the STL. This can make programs profit in an easy way from multi-core processing power. The performance mea- surements show the practical usefulness on real-world multi-core ma- chines with up to eight cores. 1 Introduction Multi-core processors bring parallel computing power to the customer at virtu- ally no cost. Where automatic parallelization fails and OpenMP loop paralleliza- tion primitives are not strong enough, parallelized algorithms from a library are a sensible choice. Our group pursues this goal with the Multi-Core Standard Template Library [6], a parallel implementation of the C++ STL. To allow best benefit from the parallel computing power, as many operations as possible need to be parallelized. Sequential parts could otherwise severely limit the achievable speedup, according to Amdahl’s law. Thus, it may be profitable to parallelize an operation even if the speedup is considerably less than the number of threads. The STL contains four kinds of generic dictionary types, namely set, map, multiset, and multimap. -
Distributing Configuration with Apache Tamaya
Configure Once, run everyhere! Configuration with Apache Tamaya BASEL BERN BRUGG DÜSSELDORF FRANKFURT A.M. FREIBURG I.BR. GENF HAMBURG KOPENHAGEN LAUSANNE MÜNCHEN STUTTGART WIEN ZÜRICH About Me Anatole Tresch Principal Consultant, Trivadis AG (Switzerland) Star Spec Lead Technical Architect, Lead Engineer PPMC Member Apache Tamaya @atsticks [email protected] [email protected] 6.09.16 Configure once, run everywhere 2 Agenda ● Motivation ● Requirements ● The API ● Configuration Backends ● Demo ● Extensions 6.09.16 Configure once, run everywhere 3 Motivation 6.09.16 Configure once, run everywhere 4 What is Configuration ? Simple Key/value pairs? Typed values? 6.09.16 Configure once, run everywhere 5 When is Configuration useful? Use Cases? 6.09.16 Configure once, run everywhere 6 How is it stored? Remotely or locally? Classpath, file or ...? Which format? All of the above (=multiple sources) ? 6.09.16 Configure once, run everywhere 7 When to configure? Develpment time ? Build/deployment time? Startup? Dynamic, anytime? 6.09.16 Configure once, run everywhere 8 Configuration Lifecycle ? Static ? Refreshing ? Changes triggered ? 6.09.16 Configure once, run everywhere 9 Do I need a runtime ? Java SE? Java EE? OSGI? 6.09.16 Configure once, run everywhere 10 Requirements 6.09.16 Bezeichnung Präsentation Requirements ● Developer‘s Perspective ● Architectural/Design Requirements ● Operational Aspects ● Other Aspects 6.09.16 Configure once, run everywhere 12 Developer‘s Requirements ● Easy to use. ● Developers want defaults. ● Developers -
No. 18-956 Petitioner, V. Respondent. on Writ of Certiorari to the U.S
No. 18-956 IN THE GOOGLE LLC, Petitioner, v. ORACLE AMERICA, INC., Respondent. On Writ of Certiorari to the U.S. Court of Appeals for the Federal Circuit JOINT APPENDIX VOLUME 1 PAGES 1-341 Thomas C. Goldstein E. Joshua Rosenkranz GOLDSTEIN & RUSSELL, P.C. ORRICK, HERRINGTON & 7475 Wisconsin Ave. SUTCLIFFE LLP Suite 850 51 West 52nd Street Bethesda, MD 20814 New York, NY 10019 (202) 362-0636 (212) 506-5000 [email protected] [email protected] Counsel of Record for Petitioner Counsel of Record for Respondent PETITION FOR A WRIT OF CERTIORARI FILED JAN. 24, 2019 CERTIORARI GRANTED NOV. 15, 2019 TABLE OF CONTENTS VOLUME 1 Docket Excerpts: U.S. Court of Appeals for the Federal Circuit, No. 13-1021 .................................. 1 Docket Excerpts: U.S. Court of Appeals for the Federal Circuit, No. 17-1118 .................................. 3 Docket Excerpts: U.S. District Court for the Northern District of California, No. 3:10-cv-03561 .................................................... 5 Transcript of 2012 Jury Trial Proceedings (excerpts) ............................................................... 30 Final Charge to the Jury (Phase One) and Special Verdict Form, Dist. Ct. Docs. 1018 & 1018-1 (Apr. 30, 2012) ....................................... 72 Special Verdict Form, Dist. Ct. Doc. 1089 (May 7, 2012) ......................................................... 95 Trial Exhibit 7803, Deposition Clips of Henrik Stahl Played by Video During Trial (Jan. 14, 2016) (excerpts) ...................................... 98 Order re 62 Classes and Interfaces, Dist. Ct. Doc. 1839 (May 6, 2016) ...................................... 103 Joint Filing Regarding Agreed Statement Regarding Copyrightability (ECF No. 1788), Dist. Ct. Doc. 1846 (May 7, 2016) ....................... 105 Transcript of 2016 Jury Trial Proceedings (excerpts) ............................................................. 109 Final Charge to the Jury (Phase One) and Special Verdict Form, Dist. -
FORSCHUNGSZENTRUM JÜLICH Gmbh Programming in C++ Part II
FORSCHUNGSZENTRUM JÜLICH GmbH Jülich Supercomputing Centre D-52425 Jülich, Tel. (02461) 61-6402 Ausbildung von Mathematisch-Technischen Software-Entwicklern Programming in C++ Part II Bernd Mohr FZJ-JSC-BHB-0155 1. Auflage (letzte Änderung: 19.09.2003) Copyright-Notiz °c Copyright 2008 by Forschungszentrum Jülich GmbH, Jülich Supercomputing Centre (JSC). Alle Rechte vorbehalten. Kein Teil dieses Werkes darf in irgendeiner Form ohne schriftliche Genehmigung des JSC reproduziert oder unter Verwendung elektronischer Systeme verarbeitet, vervielfältigt oder verbreitet werden. Publikationen des JSC stehen in druckbaren Formaten (PDF auf dem WWW-Server des Forschungszentrums unter der URL: <http://www.fz-juelich.de/jsc/files/docs/> zur Ver- fügung. Eine Übersicht über alle Publikationen des JSC erhalten Sie unter der URL: <http://www.fz-juelich.de/jsc/docs> . Beratung Tel: +49 2461 61 -nnnn Auskunft, Nutzer-Management (Dispatch) Das Dispatch befindet sich am Haupteingang des JSC, Gebäude 16.4, und ist telefonisch erreich- bar von Montag bis Donnerstag 8.00 - 17.00 Uhr Freitag 8.00 - 16.00 Uhr Tel.5642oder6400, Fax2810, E-Mail: [email protected] Supercomputer-Beratung Tel. 2828, E-Mail: [email protected] Netzwerk-Beratung, IT-Sicherheit Tel. 6440, E-Mail: [email protected] Rufbereitschaft Außerhalb der Arbeitszeiten (montags bis donnerstags: 17.00 - 24.00 Uhr, freitags: 16.00 - 24.00 Uhr, samstags: 8.00 - 17.00 Uhr) können Sie dringende Probleme der Rufbereitschaft melden: Rufbereitschaft Rechnerbetrieb: Tel. 6400 Rufbereitschaft Netzwerke: Tel. 6440 An Sonn- und Feiertagen gibt es keine Rufbereitschaft. Fachberater Tel. +49 2461 61 -nnnn Fachgebiet Berater Telefon E-Mail Auskunft, Nutzer-Management, E. -
Getting to the Root of Concurrent Binary Search Tree Performance
Getting to the Root of Concurrent Binary Search Tree Performance Maya Arbel-Raviv, Technion; Trevor Brown, IST Austria; Adam Morrison, Tel Aviv University https://www.usenix.org/conference/atc18/presentation/arbel-raviv This paper is included in the Proceedings of the 2018 USENIX Annual Technical Conference (USENIX ATC ’18). July 11–13, 2018 • Boston, MA, USA ISBN 978-1-939133-02-1 Open access to the Proceedings of the 2018 USENIX Annual Technical Conference is sponsored by USENIX. Getting to the Root of Concurrent Binary Search Tree Performance Maya Arbel-Raviv Trevor Brown Adam Morrison Technion IST Austria Tel Aviv University Abstract reason about data structure performance. Given that real- Many systems rely on optimistic concurrent search trees life search tree workloads operate on trees with millions for multi-core scalability. In principle, optimistic trees of items and do not suffer from high contention [3, 26, 35], have a simple performance story: searches are read-only it is natural to assume that search performance will be and so run in parallel, with writes to shared memory oc- a dominating factor. (After all, most of the time will be curring only when modifying the data structure. However, spent searching the tree, with synchronization—if any— this paper shows that in practice, obtaining the full perfor- happening only at the end of a search.) In particular, we mance benefits of optimistic search trees is not so simple. would expect two trees with similar structure (and thus We focus on optimistic binary search trees (BSTs) similar-length search paths), such as balanced trees with and perform a detailed performance analysis of 10 state- logarithmic height, to perform similarly. -
Jt-Polys-Cours-11.Pdf
Notes de cours Standard Template Library ' $ ' $ Ecole Nationale d’Ing´enieurs de Brest Table des mati`eres L’approche STL ................................... 3 Les it´erateurs .................................... 15 Les classes de fonctions .......................... 42 Programmation par objets Les conteneurs ................................... 66 Le langage C++ Les adaptateurs ................................. 134 — Standard Template Library — Les algorithmes g´en´eriques ...................... 145 Index ........................................... 316 J. Tisseau R´ef´erences ...................................... 342 – 1996/1997 – enib c jt ........ 1/344 enib c jt ........ 2/344 & % & % Standard Template Library L’approche STL ' $ ' $ L’approche STL Biblioth`eque de composants C++ g´en´eriques L’approche STL Fonctions : algorithmes g´en´eriques 1. Une biblioth`eque de composants C++ g´en´eriques sort, binary search, reverse, for each, accumulate,... 2. Du particulier au g´en´erique Conteneurs : collections homog`enes d’objets 3. Des indices aux it´erateurs, via les pointeurs vector, list, set, map, multimap,... 4. De la g´en´ericit´edes donn´ees `ala g´en´ericit´edes structures It´erateurs : sorte de pointeurs pour inspecter un conteneur input iterator, random access iterator, ostream iterator,... Objets fonction : encapsulation de fonctions dans des objets plus, times, less equal, logical or,... Adaptateurs : modificateurs d’interfaces de composants stack, queue, priority queue,... enib c jt ........ 3/344 enib c jt ........ 4/344 & % & % L’approche STL L’approche STL ' $ ' $ Du particulier . au g´en´erique int template <class T> max(int x, int y) { return x < y? y : x; } const T& max(const T& x, const T& y) { return x < y? y : x; } int template <class T, class Compare> max(int x, int y, int (*compare)(int,int)) { const T& return compare(x,y)? y : x; max(const T& x, const T& y, Compare compare) { } return compare(x, y)? y : x; } enib c jt .......