1
80%
main: 87%

Ran 20 Oct 2024 08:46PM UTC

Files 55

Run time 1s

Badge

Embed ▾

Committed 20 Oct 2024 08:46PM UTC coverage: 80.201% (+0.9%) from 79.307%

Job # bcdc85140267d6af2dac9bdacbb22b9a20a88f2f.1

Build Type

Pull #8

github

Committed by

renatomassaro

Commit Message

Refactor Boot shard migration to find any shards

Previously, we were looking for shards sequentially, and we'd stop
looking as soon as the next element in the sequence could not be found.

It is very possible that one particular user shard (say, shard_id=42)
had to be deleted for any reason (maybe user was deleted/banned). The
previous logic would not migrate any shard > 42.

This current implementation eagerly finds all shards, which is a better
approach BUT I'm not so sure how it would cope with handling tens of
thousands of shards being migrated -- can it fit everything in memory
and is performance acceptable? That, however, is out of scope for what
I'm currently working at. I'll look into this in the future.

Pull Request Pull Request #8: Improvements to Migrations

Run Details

960 of 1197 relevant lines covered (80.2%)

44.69 hits per line

renatomassaro / FeebDB / bcdc85140267d6af2dac9bdacbb22b9a20a88f2f / 1
80%
main: 87%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job bcdc85140267d6af2dac9bdacbb22b9a20a88f2f.1

renatomassaro / FeebDB / bcdc85140267d6af2dac9bdacbb22b9a20a88f2f / 1 80% main: 87%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Source Files on job bcdc85140267d6af2dac9bdacbb22b9a20a88f2f.1

renatomassaro / FeebDB / bcdc85140267d6af2dac9bdacbb22b9a20a88f2f / 1
80%
main: 87%

README BADGES
x