rmv Travis

doc
matthieugomez 2021-04-05 13:55:09 -07:00
parent 7b9568d028
commit 373c3ba60d
3 changed files with 9 additions and 27 deletions

View File

@ -1,17 +0,0 @@
language: julia
os:
- linux
julia:
- 1.3
- 1.5
- nightly
matrix:
allow_failures:
- julia: nightly
coveralls: true
after_success:
- julia -e 'using Pkg; Pkg.add("Coverage"); using Coverage; Coveralls.submit(Coveralls.process_folder())'
notifications:
email: false
on_success: never
on_failure: change

View File

@ -1,5 +1,5 @@
[![Build Status](https://travis-ci.com/matthieugomez/StringDistances.jl.svg?branch=master)](https://travis-ci.org/matthieugomez/StringDistances.jl) [![Build status](https://github.com/matthieugomez/StringDistances.jl/workflows/CI/badge.svg)](https://github.com/matthieugomez/StringDistances.jl/actions)
[![Coverage Status](https://coveralls.io/repos/matthieugomez/StringDistances.jl/badge.svg?branch=master)](https://coveralls.io/r/matthieugomez/StringDistances.jl?branch=master)
## Installation ## Installation
The package is registered in the [`General`](https://github.com/JuliaRegistries/General) registry and so can be installed at the REPL with `] add StringDistances`. The package is registered in the [`General`](https://github.com/JuliaRegistries/General) registry and so can be installed at the REPL with `] add StringDistances`.

View File

@ -15,26 +15,25 @@ end
@time f(Jaro(), x, y) @time f(Jaro(), x, y)
#0.3s (now 0.37s) #0.3s
@time f(Levenshtein(), x, y) @time f(Levenshtein(), x, y)
# 0.48s # 0.4s
@time f(Levenshtein(), x, y, min_score = 0.8) @time f(Levenshtein(), x, y, min_score = 0.8)
# 0.11 (now 0.14) # 0.11
@time f(DamerauLevenshtein(), x, y) @time f(DamerauLevenshtein(), x, y)
# 0.61s. # 0.58s.
@time f(DamerauLevenshtein(), x, y, min_score = 0.8) @time f(DamerauLevenshtein(), x, y, min_score = 0.8)
# 0.08 (now 0.09) # 0.08 (now 0.09)
@time f(RatcliffObershelp(), x, y) @time f(RatcliffObershelp(), x, y)
# 1.52s # 1.35s
@time findnearest(x[1], y, Levenshtein()) @time findnearest(x[1], y, Levenshtein())
# 0.14 # 0.02
@time findnearest(x[1], y, DamerauLevenshtein()) @time findnearest(x[1], y, DamerauLevenshtein())
# 0.15 # 0.05
@time findnearest(x[1], y, QGram(2)) @time findnearest(x[1], y, QGram(2))
# 0.75 # 0.75