Ubuntu
starjava-tjoin package

starjava-tjoin 1.0.+2022.10.03-1 source package in Ubuntu

Changelog

starjava-tjoin (1.0.+2022.10.03-1) unstable; urgency=medium

  * New upstream version 1.0.+2022.10.03
  * Rediff patches
  * Push minversion of starjava-table to 4.1.3
  * Push Standards-Version to 4.6.1. No changes needed

 -- Ole Streicher <email address hidden>  Fri, 07 Oct 2022 12:05:47 +0200

Upload details

Uploaded by:
Debian Astronomy Maintainers
Uploaded to:
Sid
Original maintainer:
Debian Astronomy Maintainers
Architectures:
all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Lunar release universe misc

Builds

Lunar: [FULLYBUILT] amd64

Downloads

File Size SHA-256 Checksum
starjava-tjoin_1.0.+2022.10.03-1.dsc 2.3 KiB cf864093786ded050372d11446d6a26d29cfdb4b5c61c6319e01a00b5adaea54
starjava-tjoin_1.0.+2022.10.03.orig.tar.xz 91.1 KiB 67a38d6c9592768d15d795ba64a5a1b6c64a0aa5944552a7baadc05b9d3ac6a0
starjava-tjoin_1.0.+2022.10.03-1.debian.tar.xz 5.7 KiB 5558c49dd008583d9e28bfa920808a584cd63d52802453ebf75542aef8a8b467

No changes file available.

Binary packages built by this source

starlink-tjoin-java: Join subclasses for Starjava table class

 Classes for performing table joins by matching rows to each other.
 The matching is done in an entirely configurable and pluggable way by
 defining a MatchEngine which defines what counts as a match between
 two tuples (rows) and can be used to work out what counts as a near
 miss too. Matching is (except in pathological cases) an O(N ln N)
 process, where N is the total number of rows in all the tables
 participating in a match.

starlink-tjoin-java-doc: Join subclasses for Starjava table class (Javadoc)

 Classes for performing table joins by matching rows to each other.
 The matching is done in an entirely configurable and pluggable way by
 defining a MatchEngine which defines what counts as a match between
 two tuples (rows) and can be used to work out what counts as a near
 miss too. Matching is (except in pathological cases) an O(N ln N)
 process, where N is the total number of rows in all the tables
 participating in a match.
 .
 This package contains the JavaDoc documentation of the package.