Download Jar. Libraryless. Click here for Pure Java version (8132L/55K).
!7 p-exp { int n = 500/*0*/; EditDistance dist = newEditDistance_sparseArray(); S a = randomID(n), b = randomID(n), c = firstToUpper(a); assertTrue(neq(a, b)); double dist1 = 0, dist2 = 0, dist3 = 0; repeat 10 { time { dist1 = dist.d(a, b); } time { dist2 = dist.d(a, a); } time { dist3 = dist.d(a, c); } } assertTrue(dist1 != 0); assertEquals(0.0, dist2); assertEquals(1.0, dist3); print(dist1 + "/" + dist2 + "/" + dist3); }
Began life as a copy of #1026092
download show line numbers debug dex old transpilations
Travelled to 6 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt
No comments. add comment
| Snippet ID: | #1026142 | 
| Snippet name: | Bench Extended Ukkonen algorithm for Levenshtein distance with sparse array | 
| Eternal ID of this version: | #1026142/2 | 
| Text MD5: | cdc81971e6d03c68cf4a3622daba8f7a | 
| Transpilation MD5: | 582b75f1cebd0c4a69836b05fbca6531 | 
| Author: | stefan | 
| Category: | javax | 
| Type: | JavaX source code (desktop) | 
| Public (visible to everyone): | Yes | 
| Archived (hidden from active list): | No | 
| Created/modified: | 2019-11-27 02:50:08 | 
| Source code size: | 478 bytes / 18 lines | 
| Pitched / IR pitched: | No / No | 
| Views / Downloads: | 539 / 1454 | 
| Version history: | 1 change(s) | 
| Referenced in: | [show references] |