Ignores duplicated hashtags in different char cases when processing hashtag spam

quartz/src/commonMain/kotlin/com/vitorpamplona/quartz/nip01Core/tags/hashtags/EventExt.kt

@@ -26,6 +26,8 @@ fun Event.anyHashTag(onEach: (str: String) -> Boolean) = tags.anyHashTag(onEach)
 
 fun Event.countHashtags() = tags.countHashtags()
 
+fun Event.hasMoreHashtagsThan(limit: Int) = tags.hasMoreHashtagsThan(limit)
+
 fun Event.hasHashtags() = tags.hasHashtags()
 
 fun Event.hashtags() = tags.hashtags()

quartz/src/commonMain/kotlin/com/vitorpamplona/quartz/nip01Core/tags/hashtags/HashtagTag.kt

@@ -46,6 +46,13 @@ class HashtagTag {
             return tag[1]
         }
 
+        fun parseLowercase(tag: Array<String>): String? {
+            ensure(tag.has(1)) { return null }
+            ensure(tag[0] == TAG_NAME) { return null }
+            ensure(tag[1].isNotEmpty()) { return null }
+            return tag[1].lowercase()
+        }
+
         fun assemble(name: String) = arrayOf(TAG_NAME, name)
 
         fun assembleDualCase(name: String): List<Array<String>> {

quartz/src/commonMain/kotlin/com/vitorpamplona/quartz/nip01Core/tags/hashtags/TagArrayExt.kt

@@ -38,8 +38,29 @@ fun TagArray.hashtags() = this.mapNotNull(HashtagTag::parse)
 
 fun TagArray.countHashtags() = this.count(HashtagTag::isTagged)
 
+fun TagArray.hasMoreHashtagsThan(limit: Int): Boolean {
+    val count = this.count(HashtagTag::isTagged)
+    return count > limit && this.countUnique(count, HashtagTag::parseLowercase) > limit
+}
+
 fun TagArray.isTaggedHash(hashtag: String) = this.isTagged(HashtagTag.TAG_NAME, hashtag, true)
 
 fun TagArray.isTaggedHashes(hashtags: Set<String>) = this.isAnyLowercaseTagged(HashtagTag.TAG_NAME, hashtags)
 
 fun TagArray.firstIsTaggedHashes(hashtags: Set<String>) = this.firstAnyLowercaseTaggedValue(HashtagTag.TAG_NAME, hashtags)
+
+public inline fun <T, U> Array<out T>.countUnique(
+    size: Int,
+    transform: (T) -> U?,
+): Int {
+    // Pre-allocate hash set to avoid frequent resizing for larger arrays
+    val seen = HashSet<U>(size)
+    var count = 0
+    for (element in this) {
+        val value = transform(element)
+        if (value != null && seen.add(value)) {
+            ++count
+        }
+    }
+    return count
+}