feat(Kotlin): Replace value with _val (#1254)

* ci(kotlin): Add workflow file.

* Update kotlin.yml

* style(kotlin): value -> _val

---------

Co-authored-by: Yudong Jin <krahets@163.com>

codes/kotlin/chapter_hashing/array_hash_map.kt

@@ -9,7 +9,7 @@ package chapter_hashing
 /* 键值对 */
 class Pair(
     var key: Int,
-    var value: String
+    var _val: String
 )
 
 /* 基于数组实现的哈希表 */
@@ -27,12 +27,12 @@ class ArrayHashMap {
     fun get(key: Int): String? {
         val index = hashFunc(key)
         val pair = buckets[index] ?: return null
-        return pair.value
+        return pair._val
     }
 
     /* 添加操作 */
-    fun put(key: Int, value: String) {
-        val pair = Pair(key, value)
+    fun put(key: Int, _val: String) {
+        val pair = Pair(key, _val)
         val index = hashFunc(key)
         buckets[index] = pair
     }
@@ -68,7 +68,7 @@ class ArrayHashMap {
     fun valueSet(): MutableList<String> {
         val valueSet = mutableListOf<String>()
         for (pair in buckets) {
-            pair?.let { valueSet.add(it.value) }
+            pair?.let { valueSet.add(it._val) }
         }
         return valueSet
     }
@@ -77,8 +77,8 @@ class ArrayHashMap {
     fun print() {
         for (kv in pairSet()) {
             val key = kv.key
-            val value = kv.value
-            println("${key} -> ${value}")
+            val _val = kv._val
+            println("${key} -> ${_val}")
         }
     }
 }
@@ -112,14 +112,14 @@ fun main() {
     /* 遍历哈希表 */
     println("\n遍历键值对 Key -> Value")
     for (kv in map.pairSet()) {
-        println("${kv.key} -> ${kv.value}")
+        println("${kv.key} -> ${kv._val}")
     }
     println("\n单独遍历键 Key")
     for (key in map.keySet()) {
         println(key)
     }
     println("\n单独遍历值 Value")
-    for (value in map.valueSet()) {
-        println(value)
+    for (_val in map.valueSet()) {
+        println(_val)
     }
 }

codes/kotlin/chapter_hashing/hash_map.kt

@@ -44,7 +44,7 @@ fun main() {
         println(key)
     }
     println("\n单独遍历值 Value")
-    for (value in map.values) {
-        println(value)
+    for (_val in map.values) {
+        println(_val)
     }
 }

codes/kotlin/chapter_hashing/hash_map_chaining.kt

@@ -42,14 +42,14 @@ class HashMapChaining() {
         val bucket = buckets[index]
         // 遍历桶，若找到 key ，则返回对应 val
         for (pair in bucket) {
-            if (pair.key == key) return pair.value
+            if (pair.key == key) return pair._val
         }
         // 若未找到 key ，则返回 null
         return null
     }
 
     /* 添加操作 */
-    fun put(key: Int, value: String) {
+    fun put(key: Int, _val: String) {
         // 当负载因子超过阈值时，执行扩容
         if (loadFactor() > loadThres) {
             extend()
@@ -59,12 +59,12 @@ class HashMapChaining() {
         // 遍历桶，若遇到指定 key ，则更新对应 val 并返回
         for (pair in bucket) {
             if (pair.key == key) {
-                pair.value = value
+                pair._val = _val
                 return
             }
         }
         // 若无该 key ，则将键值对添加至尾部
-        val pair = Pair(key, value)
+        val pair = Pair(key, _val)
         bucket.add(pair)
         size++
     }
@@ -98,7 +98,7 @@ class HashMapChaining() {
         // 将键值对从原哈希表搬运至新哈希表
         for (bucket in bucketsTmp) {
             for (pair in bucket) {
-                put(pair.key, pair.value)
+                put(pair.key, pair._val)
             }
         }
     }
@@ -109,7 +109,7 @@ class HashMapChaining() {
             val res = mutableListOf<String>()
             for (pair in bucket) {
                 val k = pair.key
-                val v = pair.value
+                val v = pair._val
                 res.add("$k -> $v")
             }
             println(res)

codes/kotlin/chapter_hashing/hash_map_open_addressing.kt

@@ -68,14 +68,14 @@ class HashMapOpenAddressing {
         val index = findBucket(key)
         // 若找到键值对，则返回对应 val
         if (buckets[index] != null && buckets[index] != TOMBSTONE) {
-            return buckets[index]?.value
+            return buckets[index]?._val
         }
         // 若键值对不存在，则返回 null
         return null
     }
 
     /* 添加操作 */
-    fun put(key: Int, value: String) {
+    fun put(key: Int, _val: String) {
         // 当负载因子超过阈值时，执行扩容
         if (loadFactor() > loadThres) {
             extend()
@@ -84,11 +84,11 @@ class HashMapOpenAddressing {
         val index = findBucket(key)
         // 若找到键值对，则覆盖 val 并返回
         if (buckets[index] != null && buckets[index] != TOMBSTONE) {
-            buckets[index]!!.value = value
+            buckets[index]!!._val = _val
             return
         }
         // 若键值对不存在，则添加该键值对
-        buckets[index] = Pair(key, value)
+        buckets[index] = Pair(key, _val)
         size++
     }
 
@@ -114,7 +114,7 @@ class HashMapOpenAddressing {
         // 将键值对从原哈希表搬运至新哈希表
         for (pair in bucketsTmp) {
             if (pair != null && pair != TOMBSTONE) {
-                put(pair.key, pair.value)
+                put(pair.key, pair._val)
             }
         }
     }
@@ -127,7 +127,7 @@ class HashMapOpenAddressing {
             } else if (pair == TOMBSTONE) {
                 println("TOMESTOME")
             } else {
-                println("${pair.key} -> ${pair.value}")
+                println("${pair.key} -> ${pair._val}")
             }
         }
     }