motiejus/stud
1
Fork 0
Code Releases Activity

add excuses

Browse Source
This commit is contained in:
Motiejus Jakštys 2021-03-11 09:28:06 +02:00
parent 82fc4e4650
commit 6555de359a
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
IV/wm.sql
View File

@ -228,6 +228,10 @@ begin
continue when st_numgeometries(multi) = 2 and continue when st_numgeometries(multi) = 2 and
(st_contains(bends[j], a) or st_contains(bends[j], b)); (st_contains(bends[j], a) or st_contains(bends[j], b));
-- Sincere apologies to someone who will need to debug the block below.
-- To understand it, I suggest you take a pencil and paper, draw a
-- self-crossing bend (fig6 from the article works well), and figure out
-- what happens here, by hand.
prev_length = array_length(bends, 1); prev_length = array_length(bends, 1);
if j < i then if j < i then
-- remove first vertex of the following bend, because the last -- remove first vertex of the following bend, because the last
@ -251,7 +255,6 @@ begin
bends = bends[1:i] || bends[j+1:prev_length]; bends = bends[1:i] || bends[j+1:prev_length];
end if; end if;
j = j - prev_length + array_length(bends, 1); j = j - prev_length + array_length(bends, 1);
end loop; end loop;
end loop; end loop;