128
100%

Ran 08 Jan 2016 12:58PM UTC

Jobs 6

Files 1

Run time 2min

Badge

Embed ▾

pending completion

Build # 128

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

958 of 966 relevant lines covered (99.17%)

6370.35 hits per line

Jobs

ID	Job ID	Ran	Coverage
1	128.1 (LUA=lua5.1)	08 Jan 2016 12:58PM UTC	99.17	Travis Job 128.1
2	128.2 (LUA=lua5.2)	08 Jan 2016 12:58PM UTC	99.17	Travis Job 128.2
3	128.3 (LUA=lua5.3)	08 Jan 2016 12:58PM UTC	99.17	Travis Job 128.3
4	128.4 (LUA=luajit)	08 Jan 2016 12:58PM UTC	98.74	Travis Job 128.4
5	128.5 (LUA=luajit2.0)	08 Jan 2016 12:58PM UTC	98.74	Travis Job 128.5
6	128.6 (LUA=luajit2.1)	08 Jan 2016 01:00PM UTC	98.74	Travis Job 128.6

Source Files on build 128

Detailed source file information is not available for this build.

n1tehawk / luaunit / 128
100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 128

n1tehawk / luaunit / 128 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 128

n1tehawk / luaunit / 128
100%

README BADGES
x