403
34%
master: 36%

Ran 10 Mar 2015 11:51PM UTC

Jobs 1

Files 78

Run time 37s

Badge

Embed ▾

pending completion

Build # 403

Build Type

push

travis-ci

Committed by

niphlod

Commit Message

caches recursive selects for references

Why didn't we think before ? References are lazy, but when asked 
for representation why should we fetch the same referenced record
over and over ?

NB: the code caches only represent() fetching records from tables, that
are the only idempotent represent() calls out there. We could cache
every representation only asking for every represent() call to be 
idempotent. As I feel there will be someone returning random values,
I left it out.

I'll make a PR soon for pyDAL to fix the same behaviour.

Coverage Stats

8110 of 23887 relevant lines covered (33.95%)

0.34 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
2	403.2	10 Mar 2015 11:51PM UTC	0	33.95	Travis Job 403.2

Source Files on build 403

Detailed source file information is not available for this build.

niphlod / web2py / 403
34%
master: 36%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 403

niphlod / web2py / 403 34% master: 36%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 403

niphlod / web2py / 403
34%
master: 36%

README BADGES
x