shvms

# I was looking for a rate limiting library to call rate limited apis as closely 
#   as possible to their enforced limits.  I looked at the first few python libraries
#   that I found, and when I glanced at the source, they were all clearly broken.
# Curious how this could be, I took all the top google and pip search results for: python rate limiting
#   and tried to get them to do the wrong thing and fail to rate limit in situations that could come up 
#   in normal use (though in some cases very specific use)


# https://github.com/tomasbasham/ratelimit
# Where broken:

shvms

class Queue<T> {
    data class Node<T>(var item: T) {
        var next: Node<T>? = null
    }

    private var size: Int = 0
    private var first: Node<T>? = null
    private var last: Node<T>? = null

    fun getSize(): Int {

shvms

class Stack<T> {
    data class Node<T>(var item: T) {
        var next: Node<T>? = null
    }

    private var size: Int = 0
    private var first: Node<T>? = null

    fun getSize(): Int {
        return size

shvms

'''
Implementation of the QuickUnion approach to the Union-Find problem.
Improvements like weighting and path compression has also been implemented.
Author: Shuvam Shah
'''

class QuickUnionUF(object):
  def __init__(self, N, weighting=True):
    self.ids = [i for i in range(N)]
    self.size = [1] * N