File: control

package info (click to toggle)
libconcurrentlinkedhashmap-java 1.1~jdk5-1
  • links: PTS, VCS
  • area: main
  • in suites: jessie, jessie-kfreebsd, stretch, wheezy
  • size: 536 kB
  • ctags: 990
  • sloc: java: 4,903; xml: 630; sh: 21; makefile: 16
file content (48 lines) | stat: -rw-r--r-- 2,132 bytes parent folder | download
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
Source: libconcurrentlinkedhashmap-java
Section: java
Priority: optional
Maintainer: Debian Java Maintainers <pkg-java-maintainers@lists.alioth.debian.org>
Uploaders: Miguel Landaeta <miguel@miguel.cc>
Build-Depends: debhelper (>= 7.0.50~), default-jdk, javahelper, cdbs,
 maven-debian-helper, libmaven-javadoc-plugin-java
Standards-Version: 3.9.1
Homepage: http://code.google.com/p/concurrentlinkedhashmap/
Vcs-Git: git://git.debian.org/git/pkg-java/libconcurrentlinkedhashmap-java.git
Vcs-Browser: http://git.debian.org/?p=pkg-java/libconcurrentlinkedhashmap-java.git

Package: libconcurrentlinkedhashmap-java
Architecture: all
Depends: ${misc:Depends}
Description: Implementation of java.util.LinkedHashMap with concurrency support
 Java library that provides a hash table supporting full
 concurrency of retrievals, adjustable expected
 concurrency for updates, and a maximum capacity to bound
 the map by. This implementation differs from 
 java.util.concurrent.ConcurrentHashMap in that it
 maintains a page replacement algorithm that is
 used to evict an entry when the map has exceeded its
 capacity. Unlike the Java Collections Framework, this
 map does not have a publicly visible constructor and
 instances are created through a Builder.

Package: libconcurrentlinkedhashmap-java-doc
Architecture: all
Section: doc
Depends: ${misc:Depends}
Recommends: libconcurrentlinkedhashmap-java
Suggests: default-jdk-doc
Description: Documentation for libconcurrentlinkedhashmap-java
 Documentation for concurrentlinkedhashmap that is a
 Java library that provides a hash table supporting full
 concurrency of retrievals, adjustable expected
 concurrency for updates, and a maximum capacity to bound
 the map by. This implementation differs from 
 java.util.concurrent.ConcurrentHashMap in that it
 maintains a page replacement algorithm that is
 used to evict an entry when the map has exceeded its
 capacity. Unlike the Java Collections Framework, this
 map does not have a publicly visible constructor and
 instances are created through a Builder.
 .
 This package contains the javadoc files of
 libconcurrentlinkedhashmap-java.