fz0x1/HPI
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

docs: fix typos

Browse source 
found via `codespell -L copie,datas,pres,fo,tooks,noo,ue,ket,frop`
This commit is contained in:
Kian-Meng Ang 2023-03-26 17:10:33 +08:00 • committed by karlicoss
parent 919c84fb5a
commit d2ef23fcb4
50 changed files with 69 additions and 69 deletions
Download patch file Download diff file Expand all files Collapse all files

2
my/location/fallback/common.py
View file

@ -64,7 +64,7 @@ class FallbackLocation(LocationProtocol):
)
# a location estimator can return multiple fallbacks, incase there are
# a location estimator can return multiple fallbacks, in case there are
# differing accuracies/to allow for possible matches to be computed
# iteratively
LocationEstimator = Callable[[DateExact], Iterator[FallbackLocation]]

2
my/location/fallback/via_ip.py
View file

@ -50,7 +50,7 @@ def fallback_locations() -> Iterator[FallbackLocation]:
)
# for compatibility with my.location.via_ip, this shouldnt be used by other modules
# for compatibility with my.location.via_ip, this shouldn't be used by other modules
def locations() -> Iterator[Location]:
medium("locations is deprecated, should use fallback_locations or estimate_location")
yield from map(FallbackLocation.to_location, fallback_locations())

2
my/location/google.py
View file

@ -82,7 +82,7 @@ def _iter_via_grep(fo) -> Iterable[TsLatLon]:
# todo could also use pool? not sure if that would really be faster...
# earch thread could process 100K at once?
# search thread could process 100K at once?
# would need to find out a way to know when to stop? process in some sort of sqrt progression??