tt.rs 3.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109
  1. // SPDX-License-Identifier: Apache-2.0 OR MIT
  2. use proc_macro2::{Delimiter, TokenStream, TokenTree};
  3. use std::hash::{Hash, Hasher};
  4. pub(crate) struct TokenTreeHelper<'a>(pub &'a TokenTree);
  5. impl<'a> PartialEq for TokenTreeHelper<'a> {
  6. fn eq(&self, other: &Self) -> bool {
  7. use proc_macro2::Spacing;
  8. match (self.0, other.0) {
  9. (TokenTree::Group(g1), TokenTree::Group(g2)) => {
  10. match (g1.delimiter(), g2.delimiter()) {
  11. (Delimiter::Parenthesis, Delimiter::Parenthesis)
  12. | (Delimiter::Brace, Delimiter::Brace)
  13. | (Delimiter::Bracket, Delimiter::Bracket)
  14. | (Delimiter::None, Delimiter::None) => {}
  15. _ => return false,
  16. }
  17. let s1 = g1.stream().into_iter();
  18. let mut s2 = g2.stream().into_iter();
  19. for item1 in s1 {
  20. let item2 = match s2.next() {
  21. Some(item) => item,
  22. None => return false,
  23. };
  24. if TokenTreeHelper(&item1) != TokenTreeHelper(&item2) {
  25. return false;
  26. }
  27. }
  28. s2.next().is_none()
  29. }
  30. (TokenTree::Punct(o1), TokenTree::Punct(o2)) => {
  31. o1.as_char() == o2.as_char()
  32. && match (o1.spacing(), o2.spacing()) {
  33. (Spacing::Alone, Spacing::Alone) | (Spacing::Joint, Spacing::Joint) => true,
  34. _ => false,
  35. }
  36. }
  37. (TokenTree::Literal(l1), TokenTree::Literal(l2)) => l1.to_string() == l2.to_string(),
  38. (TokenTree::Ident(s1), TokenTree::Ident(s2)) => s1 == s2,
  39. _ => false,
  40. }
  41. }
  42. }
  43. impl<'a> Hash for TokenTreeHelper<'a> {
  44. fn hash<H: Hasher>(&self, h: &mut H) {
  45. use proc_macro2::Spacing;
  46. match self.0 {
  47. TokenTree::Group(g) => {
  48. 0u8.hash(h);
  49. match g.delimiter() {
  50. Delimiter::Parenthesis => 0u8.hash(h),
  51. Delimiter::Brace => 1u8.hash(h),
  52. Delimiter::Bracket => 2u8.hash(h),
  53. Delimiter::None => 3u8.hash(h),
  54. }
  55. for item in g.stream() {
  56. TokenTreeHelper(&item).hash(h);
  57. }
  58. 0xFFu8.hash(h); // terminator w/ a variant we don't normally hash
  59. }
  60. TokenTree::Punct(op) => {
  61. 1u8.hash(h);
  62. op.as_char().hash(h);
  63. match op.spacing() {
  64. Spacing::Alone => 0u8.hash(h),
  65. Spacing::Joint => 1u8.hash(h),
  66. }
  67. }
  68. TokenTree::Literal(lit) => (2u8, lit.to_string()).hash(h),
  69. TokenTree::Ident(word) => (3u8, word).hash(h),
  70. }
  71. }
  72. }
  73. pub(crate) struct TokenStreamHelper<'a>(pub &'a TokenStream);
  74. impl<'a> PartialEq for TokenStreamHelper<'a> {
  75. fn eq(&self, other: &Self) -> bool {
  76. let left = self.0.clone().into_iter().collect::<Vec<_>>();
  77. let right = other.0.clone().into_iter().collect::<Vec<_>>();
  78. if left.len() != right.len() {
  79. return false;
  80. }
  81. for (a, b) in left.into_iter().zip(right) {
  82. if TokenTreeHelper(&a) != TokenTreeHelper(&b) {
  83. return false;
  84. }
  85. }
  86. true
  87. }
  88. }
  89. impl<'a> Hash for TokenStreamHelper<'a> {
  90. fn hash<H: Hasher>(&self, state: &mut H) {
  91. let tts = self.0.clone().into_iter().collect::<Vec<_>>();
  92. tts.len().hash(state);
  93. for tt in tts {
  94. TokenTreeHelper(&tt).hash(state);
  95. }
  96. }
  97. }