Linting: Impl ordering, Self refs

For consistency, ordered implementation of a traits the same way as they are declared.

Used `Self::<assoc>` in a few last spots
pull/752/head
Yuri Astrakhan 11 months ago committed by Thomas Tanon
parent d838d55f02
commit 185d83838c
  1. 8
      lib/oxrdf/src/dataset.rs
  2. 2
      lib/oxrdf/src/graph.rs
  3. 4
      lib/oxttl/src/lexer.rs
  4. 14
      lib/oxttl/src/line_formats.rs
  5. 12
      lib/oxttl/src/n3.rs
  6. 12
      lib/oxttl/src/terse.rs
  7. 2
      lib/sparesults/src/solution.rs
  8. 2
      lib/src/sparql/eval.rs

@ -925,8 +925,8 @@ impl PartialEq for Dataset {
impl Eq for Dataset {} impl Eq for Dataset {}
impl<'a> IntoIterator for &'a Dataset { impl<'a> IntoIterator for &'a Dataset {
type IntoIter = Iter<'a>;
type Item = QuadRef<'a>; type Item = QuadRef<'a>;
type IntoIter = Iter<'a>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.iter() self.iter()
@ -1283,8 +1283,8 @@ impl<'a> GraphView<'a> {
} }
impl<'a> IntoIterator for GraphView<'a> { impl<'a> IntoIterator for GraphView<'a> {
type IntoIter = GraphViewIter<'a>;
type Item = TripleRef<'a>; type Item = TripleRef<'a>;
type IntoIter = GraphViewIter<'a>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.iter() self.iter()
@ -1292,8 +1292,8 @@ impl<'a> IntoIterator for GraphView<'a> {
} }
impl<'a, 'b> IntoIterator for &'b GraphView<'a> { impl<'a, 'b> IntoIterator for &'b GraphView<'a> {
type IntoIter = GraphViewIter<'a>;
type Item = TripleRef<'a>; type Item = TripleRef<'a>;
type IntoIter = GraphViewIter<'a>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.iter() self.iter()
@ -1494,8 +1494,8 @@ impl<'a, 'b, T: Into<TripleRef<'b>>> Extend<T> for GraphViewMut<'a> {
} }
impl<'a> IntoIterator for &'a GraphViewMut<'a> { impl<'a> IntoIterator for &'a GraphViewMut<'a> {
type IntoIter = GraphViewIter<'a>;
type Item = TripleRef<'a>; type Item = TripleRef<'a>;
type IntoIter = GraphViewIter<'a>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.iter() self.iter()

@ -229,8 +229,8 @@ impl PartialEq for Graph {
impl Eq for Graph {} impl Eq for Graph {}
impl<'a> IntoIterator for &'a Graph { impl<'a> IntoIterator for &'a Graph {
type IntoIter = Iter<'a>;
type Item = TripleRef<'a>; type Item = TripleRef<'a>;
type IntoIter = Iter<'a>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.iter() self.iter()

@ -49,15 +49,15 @@ pub struct N3Lexer {
// TODO: simplify by not giving is_end and fail with an "unexpected eof" is none is returned when is_end=true? // TODO: simplify by not giving is_end and fail with an "unexpected eof" is none is returned when is_end=true?
impl TokenRecognizer for N3Lexer { impl TokenRecognizer for N3Lexer {
type Options = N3LexerOptions;
type Token<'a> = N3Token<'a>; type Token<'a> = N3Token<'a>;
type Options = N3LexerOptions;
fn recognize_next_token<'a>( fn recognize_next_token<'a>(
&mut self, &mut self,
data: &'a [u8], data: &'a [u8],
is_ending: bool, is_ending: bool,
options: &Self::Options, options: &Self::Options,
) -> Option<(usize, Result<N3Token<'a>, TokenRecognizerError>)> { ) -> Option<(usize, Result<Self::Token<'a>, TokenRecognizerError>)> {
match *data.first()? { match *data.first()? {
b'<' => match *data.get(1)? { b'<' => match *data.get(1)? {
b'<' => Some((2, Ok(N3Token::Punctuation("<<")))), b'<' => Some((2, Ok(N3Token::Punctuation("<<")))),

@ -39,9 +39,9 @@ enum NQuadsState {
} }
impl RuleRecognizer for NQuadsRecognizer { impl RuleRecognizer for NQuadsRecognizer {
type Context = NQuadsRecognizerContext;
type Output = Quad;
type TokenRecognizer = N3Lexer; type TokenRecognizer = N3Lexer;
type Output = Quad;
type Context = NQuadsRecognizerContext;
fn error_recovery_state(mut self) -> Self { fn error_recovery_state(mut self) -> Self {
self.stack.clear(); self.stack.clear();
@ -54,8 +54,8 @@ impl RuleRecognizer for NQuadsRecognizer {
fn recognize_next( fn recognize_next(
mut self, mut self,
token: N3Token<'_>, token: N3Token<'_>,
context: &mut NQuadsRecognizerContext, context: &mut Self::Context,
results: &mut Vec<Quad>, results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) -> Self { ) -> Self {
if let Some(state) = self.stack.pop() { if let Some(state) = self.stack.pop() {
@ -235,8 +235,8 @@ impl RuleRecognizer for NQuadsRecognizer {
fn recognize_end( fn recognize_end(
mut self, mut self,
_context: &mut NQuadsRecognizerContext, _context: &mut Self::Context,
results: &mut Vec<Quad>, results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) { ) {
match &*self.stack { match &*self.stack {
@ -255,7 +255,7 @@ impl RuleRecognizer for NQuadsRecognizer {
} }
} }
fn lexer_options(context: &NQuadsRecognizerContext) -> &N3LexerOptions { fn lexer_options(context: &Self::Context) -> &N3LexerOptions {
&context.lexer_options &context.lexer_options
} }
} }

@ -707,9 +707,9 @@ struct N3RecognizerContext {
} }
impl RuleRecognizer for N3Recognizer { impl RuleRecognizer for N3Recognizer {
type Context = N3RecognizerContext;
type Output = N3Quad;
type TokenRecognizer = N3Lexer; type TokenRecognizer = N3Lexer;
type Output = N3Quad;
type Context = N3RecognizerContext;
fn error_recovery_state(mut self) -> Self { fn error_recovery_state(mut self) -> Self {
self.stack.clear(); self.stack.clear();
@ -722,8 +722,8 @@ impl RuleRecognizer for N3Recognizer {
fn recognize_next( fn recognize_next(
mut self, mut self,
token: N3Token<'_>, token: N3Token<'_>,
context: &mut N3RecognizerContext, context: &mut Self::Context,
results: &mut Vec<N3Quad>, results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) -> Self { ) -> Self {
while let Some(rule) = self.stack.pop() { while let Some(rule) = self.stack.pop() {
@ -1195,7 +1195,7 @@ impl RuleRecognizer for N3Recognizer {
fn recognize_end( fn recognize_end(
self, self,
_state: &mut N3RecognizerContext, _state: &mut Self::Context,
_results: &mut Vec<Self::Output>, _results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) { ) {
@ -1205,7 +1205,7 @@ impl RuleRecognizer for N3Recognizer {
} }
} }
fn lexer_options(context: &N3RecognizerContext) -> &N3LexerOptions { fn lexer_options(context: &Self::Context) -> &N3LexerOptions {
&context.lexer_options &context.lexer_options
} }
} }

@ -28,9 +28,9 @@ pub struct TriGRecognizerContext {
} }
impl RuleRecognizer for TriGRecognizer { impl RuleRecognizer for TriGRecognizer {
type Context = TriGRecognizerContext;
type Output = Quad;
type TokenRecognizer = N3Lexer; type TokenRecognizer = N3Lexer;
type Output = Quad;
type Context = TriGRecognizerContext;
fn error_recovery_state(mut self) -> Self { fn error_recovery_state(mut self) -> Self {
self.stack.clear(); self.stack.clear();
@ -44,8 +44,8 @@ impl RuleRecognizer for TriGRecognizer {
fn recognize_next( fn recognize_next(
mut self, mut self,
token: N3Token<'_>, token: N3Token<'_>,
context: &mut TriGRecognizerContext, context: &mut Self::Context,
results: &mut Vec<Quad>, results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) -> Self { ) -> Self {
if let Some(rule) = self.stack.pop() { if let Some(rule) = self.stack.pop() {
@ -792,7 +792,7 @@ impl RuleRecognizer for TriGRecognizer {
fn recognize_end( fn recognize_end(
mut self, mut self,
_context: &mut TriGRecognizerContext, _context: &mut Self::Context,
results: &mut Vec<Self::Output>, results: &mut Vec<Self::Output>,
errors: &mut Vec<RuleRecognizerError>, errors: &mut Vec<RuleRecognizerError>,
) { ) {
@ -821,7 +821,7 @@ impl RuleRecognizer for TriGRecognizer {
} }
} }
fn lexer_options(context: &TriGRecognizerContext) -> &N3LexerOptions { fn lexer_options(context: &Self::Context) -> &N3LexerOptions {
&context.lexer_options &context.lexer_options
} }
} }

@ -171,8 +171,8 @@ impl<V: Into<Arc<[Variable]>>, S: Into<Vec<Option<Term>>>> From<(V, S)> for Quer
} }
impl<'a> IntoIterator for &'a QuerySolution { impl<'a> IntoIterator for &'a QuerySolution {
type IntoIter = Iter<'a>;
type Item = (&'a Variable, &'a Term); type Item = (&'a Variable, &'a Term);
type IntoIter = Iter<'a>;
#[inline] #[inline]
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {

@ -111,8 +111,8 @@ impl EncodedTuple {
} }
impl IntoIterator for EncodedTuple { impl IntoIterator for EncodedTuple {
type IntoIter = std::vec::IntoIter<Option<EncodedTerm>>;
type Item = Option<EncodedTerm>; type Item = Option<EncodedTerm>;
type IntoIter = std::vec::IntoIter<Option<EncodedTerm>>;
fn into_iter(self) -> Self::IntoIter { fn into_iter(self) -> Self::IntoIter {
self.inner.into_iter() self.inner.into_iter()

Loading…
Cancel
Save