• Home
  • Features
  • Pricing
  • Docs
  • Announcements
  • Sign In

sbosnick / luther / 31 / 1
96%
master: 100%

Build:
Build:
LAST BUILD BRANCH: rewrite-redfa-implementation
DEFAULT BRANCH: master
Ran 09 Sep 2018 08:05PM UTC
Files 19
Run time 1s
Badge
Embed ▾
README BADGES
x

If you need to use a raster PNG badge, change the '.svg' to '.png' in the link

Markdown

Textile

RDoc

HTML

Rst

09 Sep 2018 07:47PM UTC coverage: 97.436% (-0.9%) from 98.315%
31.1

push

travis-ci

sbosnick
Implemented Dfa methods and functions.

The Dfa::new() function is the central method of this whole crate. It is
the DFA construction algorithm using RE derivates and character classes
from Figure 3 of Owens et al.

The remaining memthods on Dfa are accessors for the DFA generated by
Dfa::new().

The commit also adds Eq as a super trait for StateLabel and implements
Eq for a number of types to the Regex can continue to implement
StateLabel. This is necessary so we can use a StateLabel as a key for a
HashMap.

2128 of 2184 relevant lines covered (97.44%)

0.97 hits per line

Source Files on job 31.1
  • Tree
  • List 0
  • Changed 11
  • Source Changed 2
  • Coverage Changed 11
Coverage ∆ File Lines Relevant Covered Missed Hits/Line
  • Back to Build 21
  • Travis Job 31.1
  • eefd02b5 on github
  • Prev Job for on rewrite-redfa-implementation (#30.1)
  • Next Job for on rewrite-redfa-implementation (#32.1)
STATUS · Troubleshooting · Open an Issue · Sales · Support · CAREERS · ENTERPRISE · START FREE · SCHEDULE DEMO
ANNOUNCEMENTS · TWITTER · TOS & SLA · Supported CI Services · What's a CI service? · Automated Testing

© 2026 Coveralls, Inc