This is for
| Jira Legacy | ||||||
|---|---|---|---|---|---|---|
|
...
The algorithm is (men ~ patterns, women ~ terms):
while ∃ free man m who still has a woman w to propose to { w = first woman on m’s list to whom m has not yet proposed if w is free (m, w) become engaged else some pair (m', w) already exists if w prefers m to m' m' becomes free (m, w) become engaged else (m', w) remain engaged
This assumes that there are M patterns and N terms and that M = N.
If M < N, there will not be a match unless there is a wildcard or a remainder (see their sections below) and we should short-circuit unless there is one.
| Info | ||
|---|---|---|
| ||
For the purpose of this document, and general coherence of mental models across the teams, wildcards and remainders should not be counted into the pattern count. They're Their handling is special-case enough to justify this definition by the algorithm simplifications it allows. |
...