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

jpedroh / generic-merge
86%
main: 80%

Build:
Build:
LAST BUILD BRANCH: fix-merge
DEFAULT BRANCH: main
Repo Added 31 Oct 2023 12:04PM UTC
Files 34
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

LAST BUILD ON BRANCH feat-assignment-problem
branch: feat-assignment-problem
CHANGE BRANCH
x
Reset
  • feat-assignment-problem
  • chore-add-dockerfile
  • chore-add-logger
  • chore-adjustments
  • ci-add-fmt-check
  • ci-code-coverage
  • ci-validate-pr-title
  • feat-add-class-like-declarations
  • feat-add-diff-mode-in-cli
  • feat-add-program-as-unordered
  • feat-cli
  • feat-cli-args
  • feat-compute-matching-score
  • feat-custom-matching
  • feat-draft-unordered
  • feat-enums-class-like
  • feat-implement-hash
  • feat-import-declarations
  • feat-introduce-identifier
  • feat-matching-configuration
  • feat-matching-representation
  • feat-parsing-handlers
  • feat-remove-matching-handlers
  • feat-tweak-conflict
  • feat-unordered-merge
  • fix-asterisk-import
  • fix-early-return-matching
  • fix-final-keyword
  • fix-imports-broken
  • fix-merge
  • fix-method-overloading
  • fix-missing-spread
  • fix-overload-
  • fix-perfect-matching
  • fix-public-private
  • main
  • perf-add-table
  • perf-remove-expensive-call
  • perf-use-cow
  • refactor-adjust-exit-codes
  • refactor-end-delimiters
  • refactor-fix-clippy
  • refactor-matching
  • refactor-merge
  • refactor-move-merge-terminals
  • refactor-remove-base
  • refactor-remove-unwraps
  • refactor-split-nodes
  • refactor-unordered-merge-signature
  • refactor-use-cargo-unordered-pair
  • refactor-use-result-in-merge
  • test-add-scenarios
  • test-add-smoke
  • tests-more
  • tests-tweak-outpu

01 May 2024 08:52PM UTC coverage: 86.126% (-0.3%) from 86.418%
8914842973

Pull #50

github

jpedroh
refactor: move file to unordered mod for later improvements in design
Pull Request #50: feat(matching): use the Hungarian Algorithm for unordered matching

513 of 876 branches covered (58.56%)

Branch coverage included in aggregate %.

45 of 47 new or added lines in 2 files covered. (95.74%)

2386 of 2490 relevant lines covered (95.82%)

12510.05 hits per line

Relevant lines Covered
Build:
Build:
2490 RELEVANT LINES 2386 COVERED LINES
12510.05 HITS PER LINE
Source Files on feat-assignment-problem
  • Tree
  • List 36
  • Changed 22
  • Source Changed 0
  • Coverage Changed 2
Coverage ∆ File Lines Relevant Covered Missed Hits/Line Branch Hits Branch Misses

Recent builds

Builds Branch Commit Type Ran Committer Via Coverage
8914842973 feat-assignment-problem refactor: move file to unordered mod for later improvements in design Pull #50 01 May 2024 08:54PM UTC jpedroh github
86.13
8914786971 feat-assignment-problem feat: early return and tweak test scenario Pull #50 01 May 2024 08:48PM UTC jpedroh github
86.13
8914718665 feat-assignment-problem refactor: use unreachable for unreachable case push 01 May 2024 08:41PM UTC jpedroh github
86.17
8914668818 feat-assignment-problem refactor: rename function push 01 May 2024 08:36PM UTC jpedroh github
85.9
8914567603 feat-assignment-problem feat(matching): initial implementation of assignment problem push 01 May 2024 08:27PM UTC jpedroh github
85.9
See All Builds (252)
  • Repo on GitHub
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

© 2025 Coveralls, Inc