chylex/IntelliJ-AceJump
1
0
Fork 0
mirror of https://github.com/chylex/IntelliJ-AceJump.git synced 2025-04-09 17:15:43 +02:00
Code

same thing, but |I*| is better notation

Browse Source
This commit is contained in:
breandan 2018-05-25 15:25:01 -04:00 committed by GitHub
parent c6b58b60f4
commit 3316a29a84
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions

2
src/main/kotlin/com/johnlindquist/acejump/label/Solver.kt
View File

@ -17,7 +17,7 @@ import kotlin.system.measureTimeMillis
* Solves the Tag Assignment Problem. The tag assignment problem can be stated
* thusly: Given a set of indices I in document d, and a set of tags T, find a
* bijection f: T*⊂T → I*⊂I s.t. d[i..k] + t ∉ d[i'..(k + |t|)], ∀ i' ∈ I\{i},
* ∀ k ∈ [i, |d|], where t ∈ T, i ∈ I. Maximize |T*|. Can be relaxed to t=t[0]
* ∀ k ∈ [i, |d|], where t ∈ T, i ∈ I. Maximize |I*|. Can be relaxed to t=t[0]
* and ∀ k ∈ [i, i+K] for some fixed K, in most naturally appearing documents.
*
* More concretely, tags are typically two-character strings containing alpha-