2
100%
nitehawk: 100%

Ran 08 Jan 2016 12:58PM UTC

Files 1

Run time 0s

Badge

Embed ▾

Committed 08 Jan 2016 12:55PM UTC coverage: 99.169%. Remained the same

Job # LUA=lua5.2

Build Type

push

travis-ci

Committed by

n1tehawk

Commit Message

New implementation of sortedPairs() / sortedNext()

The previous approach kept information required for the
sortedNext() iteration in a global table. This contradicts
standard Lua conventions, where generic for loops are perfectly
able to manage their local ("invariant") state just fine.

The existing implementation especially had the problem that the
sortedNextCache entry might not get properly cleaned up
(= removed) if the user didn't iterate the table completely, e.g.
by breaking out of a "for sortedPairs() do ..." loop.

This is an alternative version of sortedPairs (and the iterator
function sortedNext) that removes sortedNextCache completely.
Iteration states are now managed cleanly, and completely isolated
from each other.

Run Details

955 of 963 relevant lines covered (99.17%)

1002.87 hits per line

n1tehawk / luaunit / 128 / 2
100%
nitehawk: 100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 128.2 (LUA=lua5.2)

n1tehawk / luaunit / 128 / 2 100% nitehawk: 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job 128.2 (LUA=lua5.2)

n1tehawk / luaunit / 128 / 2
100%
nitehawk: 100%

README BADGES
x