language-servers/erg
1
0
Fork 0
mirror of https://github.com/erg-lang/erg.git synced 2025-08-04 10:49:54 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

chore: fix warnings

Browse source
This commit is contained in:
Shunsuke Shibayama 2024-05-02 23:03:58 +09:00
parent 8fec98b380
commit 29a70b0632
4 changed files with 19 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

4
crates/erg_common/cache.rs
View file

@ -57,10 +57,10 @@ impl<T: Hash + Eq + Clone> CacheSet<[T]> {
}
impl<T: Hash + Eq> CacheSet<T> {
pub fn get<Q: ?Sized + Hash + Eq>(&self, q: &Q) -> Arc<T>
pub fn get<Q>(&self, q: &Q) -> Arc<T>
where
Arc<T>: Borrow<Q>,
Q: ToOwned<Owned = T>,
Q: ?Sized + Hash + Eq + ToOwned<Owned = T>,
{
if let Some(cached) = self.0.borrow().get(q) {
return cached.clone();

24
crates/erg_common/dict.rs
View file

@ -193,10 +193,10 @@ impl<K, V> IntoIterator for Dict<K, V> {
impl<K: Hash + Eq, V> Dict<K, V> {
#[inline]
pub fn get<Q: ?Sized>(&self, k: &Q) -> Option<&V>
pub fn get<Q>(&self, k: &Q) -> Option<&V>
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.get(k)
}
@ -211,27 +211,27 @@ impl<K: Hash + Eq, V> Dict<K, V> {
}
#[inline]
pub fn get_mut<Q: ?Sized>(&mut self, k: &Q) -> Option<&mut V>
pub fn get_mut<Q>(&mut self, k: &Q) -> Option<&mut V>
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.get_mut(k)
}
pub fn get_key_value<Q: ?Sized>(&self, k: &Q) -> Option<(&K, &V)>
pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.get_key_value(k)
}
#[inline]
pub fn contains_key<Q: ?Sized>(&self, k: &Q) -> bool
pub fn contains_key<Q>(&self, k: &Q) -> bool
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.contains_key(k)
}
@ -242,18 +242,18 @@ impl<K: Hash + Eq, V> Dict<K, V> {
}
#[inline]
pub fn remove<Q: ?Sized>(&mut self, k: &Q) -> Option<V>
pub fn remove<Q>(&mut self, k: &Q) -> Option<V>
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.remove(k)
}
pub fn remove_entry<Q: ?Sized>(&mut self, k: &Q) -> Option<(K, V)>
pub fn remove_entry<Q>(&mut self, k: &Q) -> Option<(K, V)>
where
K: Borrow<Q>,
Q: Hash + Eq,
Q: Hash + Eq + ?Sized,
{
self.dict.remove_entry(k)
}

8
crates/erg_common/levenshtein.rs
View file

@ -40,12 +40,12 @@ pub fn levenshtein(a: &str, b: &str, limit: usize) -> Option<usize> {
(dcol[m] <= limit).then_some(dcol[m])
}
pub fn get_similar_name<'a, S: ?Sized, I: Iterator<Item = &'a S>>(
pub fn get_similar_name<'a, S, I: Iterator<Item = &'a S>>(
candidates: I,
name: &str,
) -> Option<&'a S>
where
S: std::borrow::Borrow<str>,
S: ?Sized + std::borrow::Borrow<str>,
{
let limit = (name.len() as f64).sqrt().round() as usize;
let most_similar_name =
@ -58,12 +58,12 @@ where
}
}
pub fn get_similar_name_and_some<'a, S: ?Sized, T, I: Iterator<Item = (&'a T, &'a S)>>(
pub fn get_similar_name_and_some<'a, S, T, I: Iterator<Item = (&'a T, &'a S)>>(
candidates: I,
name: &str,
) -> Option<(&'a T, &'a S)>
where
S: std::borrow::Borrow<str>,
S: ?Sized + std::borrow::Borrow<str>,
{
let limit = (name.len() as f64).sqrt().round() as usize;
let most_similar_name_and_some = candidates