aboutsummaryrefslogtreecommitdiff
path: root/pattern.c
diff options
context:
space:
mode:
authorSimon Tatham <anakin@pobox.com>2018-04-22 13:48:07 +0100
committerSimon Tatham <anakin@pobox.com>2018-04-22 16:45:59 +0100
commit000ebc50785c5c066465fc17668ae64975188d04 (patch)
treeaf2fd1836d0512e73a36f1647f466398690c84fa /pattern.c
parent4408476b7584b9a316466fe1bd10867103cddf57 (diff)
downloadpuzzles-000ebc50785c5c066465fc17668ae64975188d04.zip
puzzles-000ebc50785c5c066465fc17668ae64975188d04.tar.gz
puzzles-000ebc50785c5c066465fc17668ae64975188d04.tar.bz2
puzzles-000ebc50785c5c066465fc17668ae64975188d04.tar.xz
Use the new matching() for latin.c.
The new client code is a lot smaller and nicer, because we can throw away the col[] and num[] permutations entirely. Of course, this also means that every puzzle that incorporated latin.c now has to link against matching.c instead of maxflow.c - but since I centralised that secondary dependency into Recipe a few commits ago, it's trivial to switch them all over at once.
Diffstat (limited to 'pattern.c')
0 files changed, 0 insertions, 0 deletions