File: control

package info (click to toggle)
libjsr166y-java 1.7.0-2.1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm, bullseye
  • size: 7,012 kB
  • sloc: java: 88,871; sh: 246; makefile: 28
file content (54 lines) | stat: -rw-r--r-- 2,242 bytes parent folder | download | duplicates (2)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
Source: libjsr166y-java
Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Uploaders: Miguel Landaeta <nomadium@debian.org>
Section: java
Priority: optional
Build-Depends: debhelper (>= 9~), default-jdk, javahelper, maven-repo-helper
Standards-Version: 3.9.6
Homepage: http://g.oswego.edu/dl/concurrency-interest/
Vcs-Git: git://anonscm.debian.org/pkg-java/libjsr166y-java.git
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-java/libjsr166y-java.git

Package: libjsr166y-java
Architecture: all
Depends: ${misc:Depends}
Description: Parallel computation framework for Java
 Java framework that supports a style of parallel programming
 in which problems are solved by (recursively) splitting them
 into subtasks that are solved in parallel, waiting for them
 to complete, and then composing results.
 .
 Fork/Join parallelism is among the simplest and most
 effective design techniques for obtaining good parallel
 performance.  Fork/Join algorithms are parallel versions
 of familiar divide-and-conquer algorithms.
 .
 JSR166y includes a parallel computation framework:
 ForkJoinTasks and their related support classes provide a
 very efficient basis for obtaining platform-independent
 parallel speed-ups of computation-intensive operations.

Package: libjsr166y-java-doc
Architecture: all
Section: doc
Depends: ${misc:Depends}
Suggests: default-jdk-doc, libjsr166y-java
Description: Documentation for libjsr166y-java
 Documentation for JSR166 that provides a Java framework that
 supports a style of parallel programming in which problems are
 solved by (recursively) splitting them into subtasks that
 are solved in parallel, waiting for them to complete, and
 then composing results.
 .
 Fork/Join parallelism is among the simplest and most
 effective design techniques for obtaining good parallel
 performance.  Fork/Join algorithms are parallel versions
 of familiar divide-and-conquer algorithms.
 .
 JSR166y includes a parallel computation framework:
 ForkJoinTasks and their related support classes provide a
 very efficient basis for obtaining platform-independent
 parallel speed-ups of computation-intensive operations.
 .
 This package contains javadocs for jsr166y and extra166y
 Java packages.