class HashTable:

def $\_\_$init$\_\_($self$,$ m$=10)$:

# default initial array length: $10,$ threshold: $0\mathrm{.}75$

self.inArray $=[$LinkedList$()$ for i in range$($m$)]$

self.size $=0$

self.threshold $=0\mathrm{.}75$

def add$($self$,$ d$)$:

i $=$ self.hash$($d$)$

self.inArray$[$i$].$insert$(0,$d$)$

self.size $+=1$

if self.size $>$ self.threshold$*$len$($self$.$inArray$)$:

self.$\_$resizeUp$()$

def $\_$resizeUp$($self$)$:

oldArray $=$ self.inArray

self.inArray $=[$LinkedList$()$ for i in range$(2*$len$($oldArray$))]$

for i in range$($len$($oldArray$))$:

while oldArray$[$i$].$length $>0$:

d $=$ oldArray$[$i$].$remove$(0)$

self.inArray$[$self$.$hash$($d$)].$insert$(0,$d$)$

Write a function:

def $\_$resizeUp$($self$)$

that, similarly to the corresponding function for HashTable that we saw in class, doubles the length of the internal linked list and rehashes and reinserts all of the elements.