Path to this page:
./
math/R-fastmatch,
Fast match() Function
Branch: CURRENT,
Version: 1.1.6,
Package name: R-fastmatch-1.1.6,
Maintainer: pkgsrc-usersPackage providing a fast match() replacement for cases that require
repeated look-ups. It is slightly faster that R's built-in match()
function on first match against a table, but extremely fast on any
subsequent lookup as it keeps the hash table in memory.
Master sites: (Expand)
Version history: (Expand)
- (2025-02-14) Updated to version: R-fastmatch-1.1.6
- (2024-01-20) Package added to pkgsrc.se, version R-fastmatch-1.1.4 (created)
CVS history: (Expand)
2025-02-14 16:15:11 by Makoto Fujiwara | Files touched by this commit (2) |
Log message:
(math/R-fastmatch) Updated 1.1.4 to 1.1.6, make test passed
NEWS for fastmatch
--------------------
1.1-6
o use C99 version of flexible arrays to avoid
false-positives in strict array sanitizers.
o PROTECT fix when falling back to R's match
and coercion happened before.
o bugfix: fast.hash returned the result instead of
the `table` argument. (#9)
1.1-5 2024-02-14
o bug fix: -0 in table= would never be matched,
because it was (correctly) hashed as 0, but final
comparison was 0 to -0 in the table. (#12)
|
2024-01-20 05:33:58 by Makoto Fujiwara | Files touched by this commit (3) |
Log message:
(math/R-fastmatch) import R-fastmatch-1.1.4
Package providing a fast match() replacement for cases that require
repeated look-ups. It is slightly faster that R's built-in match()
function on first match against a table, but extremely fast on any
subsequent lookup as it keeps the hash table in memory.
|