style: rename growAt to grow_at

Author: FlyCloudC

builtin/linked_hash_map.mbt

@@ -45,7 +45,7 @@ struct Map[K, V] {
   mut size : Int // active key-value pairs count
   mut capacity : Int // current capacity
   mut capacity_mask : Int // capacity_mask = capacity - 1, used to find idx
-  mut growAt : Int // threshold that triggers grow
+  mut grow_at : Int // threshold that triggers grow
   mut head : Entry[K, V]? // head of linked list
   mut tail : Int // tail of linked list
 }
@@ -87,7 +87,7 @@ pub fn Map::new[K, V](capacity~ : Int = 8) -> Map[K, V] {
     size: 0,
     capacity,
     capacity_mask: capacity - 1,
-    growAt: calc_grow_threshold(capacity),
+    grow_at: calc_grow_threshold(capacity),
     entries: FixedArray::make(capacity, None),
     head: None,
     tail: -1,
@@ -105,7 +105,7 @@ pub fn Map::from_array[K : Hash + Eq, V](arr : Array[(K, V)]) -> Map[K, V] {
 ///|
 /// Set a key-value pair into the hash map.
 pub fn Map::set[K : Hash + Eq, V](self : Map[K, V], key : K, value : V) -> Unit {
-  if self.size >= self.growAt {
+  if self.size >= self.grow_at {
     self.grow()
   }
   let hash = key.hash()
@@ -387,7 +387,7 @@ fn Map::grow[K : Hash + Eq, V](self : Map[K, V]) -> Unit {
   self.entries = FixedArray::make(new_capacity, None)
   self.capacity = new_capacity
   self.capacity_mask = new_capacity - 1
-  self.growAt = calc_grow_threshold(self.capacity)
+  self.grow_at = calc_grow_threshold(self.capacity)
   self.size = 0
   self.head = None
   self.tail = -1

hashmap/types.mbt

@@ -45,7 +45,7 @@ struct T[K, V] {
   // size of field `entries`, it is redundant but useful for performance
   // so we don't need do `self.entries.length()` every time
   mut size : Int // active key-value pairs count
-  // mut growAt : Int // threshold that triggers grow
+  // mut grow_at : Int // threshold that triggers grow
 }
 
 ///|

hashset/hashset.mbt

@@ -22,7 +22,7 @@ pub fn new[K](capacity~ : Int = default_init_capacity) -> T[K] {
   {
     size: 0,
     capacity,
-    growAt: calc_grow_threshold(capacity),
+    grow_at: calc_grow_threshold(capacity),
     entries: FixedArray::make(capacity, None),
   }
 }
@@ -53,7 +53,7 @@ pub fn insert[K : Hash + Eq](self : T[K], key : K) -> Unit {
 ///|
 /// Insert a key into hash set.
 pub fn add[K : Hash + Eq](self : T[K], key : K) -> Unit {
-  if self.capacity == 0 || self.size >= self.growAt {
+  if self.capacity == 0 || self.size >= self.grow_at {
     self.grow()
   }
   let hash = key.hash()
@@ -309,15 +309,15 @@ fn grow[K : Hash + Eq](self : T[K]) -> Unit {
   // handle zero capacity
   if self.capacity == 0 {
     self.capacity = default_init_capacity
-    self.growAt = calc_grow_threshold(self.capacity)
+    self.grow_at = calc_grow_threshold(self.capacity)
     self.size = 0
     self.entries = FixedArray::make(self.capacity, None)
     return
   }
   let old_entries = self.entries
   self.entries = FixedArray::make(self.capacity * 2, None)
   self.capacity = self.capacity * 2
-  self.growAt = calc_grow_threshold(self.capacity)
+  self.grow_at = calc_grow_threshold(self.capacity)
   self.size = 0
   for i in 0..<old_entries.length() {
     if old_entries[i] is Some({ key, .. }) {

hashset/types.mbt

@@ -39,5 +39,5 @@ struct T[K] {
   mut entries : FixedArray[Entry[K]?]
   mut size : Int // active key count
   mut capacity : Int // current capacity
-  mut growAt : Int // threshold that triggers grow
+  mut grow_at : Int // threshold that triggers grow
 }

set/linked_hash_set.mbt

@@ -41,7 +41,7 @@ struct Set[K] {
   mut size : Int
   mut capacity : Int
   mut capacity_mask : Int
-  mut growAt : Int
+  mut grow_at : Int
   mut head : SEntry[K]?
   mut tail : SEntry[K]?
 }
@@ -58,7 +58,7 @@ pub fn Set::new[K](capacity~ : Int = 8) -> Set[K] {
     size: 0,
     capacity,
     capacity_mask: capacity - 1,
-    growAt: calc_grow_threshold(capacity),
+    grow_at: calc_grow_threshold(capacity),
     entries: FixedArray::make(capacity, None),
     list: FixedArray::make(capacity, { prev: None, next: None }),
     head: None,
@@ -86,7 +86,7 @@ pub fn insert[K : Hash + Eq](self : Set[K], key : K) -> Unit {
 ///|
 /// Insert a key into the hash set.if the key exists return false
 pub fn add_and_check[K : Hash + Eq](self : Set[K], key : K) -> Bool {
-  if self.size >= self.growAt {
+  if self.size >= self.grow_at {
     self.grow()
   }
   let hash = key.hash()
@@ -125,7 +125,7 @@ pub fn add_and_check[K : Hash + Eq](self : Set[K], key : K) -> Bool {
 ///|
 /// Insert a key into the hash set.
 pub fn add[K : Hash + Eq](self : Set[K], key : K) -> Unit {
-  if self.size >= self.growAt {
+  if self.size >= self.grow_at {
     self.grow()
   }
   let hash = key.hash()
@@ -300,7 +300,7 @@ fn grow[K : Hash + Eq](self : Set[K]) -> Unit {
   self.list = FixedArray::make(new_capacity, { prev: None, next: None })
   self.capacity = new_capacity
   self.capacity_mask = new_capacity - 1
-  self.growAt = calc_grow_threshold(self.capacity)
+  self.grow_at = calc_grow_threshold(self.capacity)
   self.size = 0
   self.head = None
   self.tail = None