Closed dvdsk closed 2 years ago
On inspection of the text send to the linter we see a duplicated bit. Linter input:
Some systems I will not discuss in depth, these are: Here I will discuss my implementation in three parts. I will begin by going over the states a node goes through during its operation. Then I will detail how the metadata is changed by following a mkdir through the cluster. Finally, I detail the technical side discussing the use of async over classical concurrency primitives. Some systems I will not discuss in depth, these are:
Notice the beginning and end is identical. They are inserted with the correct areas. The mark iterator's collect_span()
only looks at the next span and therefore does not (and it does not have to) catch the error passing the problem on with a deplicate hl in the iterator which eventually is caught and causes a crash.
traced down to on_event:37 add_nodes()
. The for each tree function is called twice resulting in the lintreq
adding the same lines twice.
alert error:
no linked issue id,linter,buf: 3,vale,1
source marks.lua:91