mt-lang 0.2.18 → 0.2.19

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA256:
-  metadata.gz: 35157666294e3aadb1c8106b1ccbacdf0d548f06a009b99c2a7799e76436e320
-  data.tar.gz: acc6091f6f22e2bbe340ebba54f49dc0b195849294f6086959027751a6cbfee1
+  metadata.gz: '076938689f867b9d3d7f60eab7f4654c03a45ea69b429f1af17c86a3afef51a5'
+  data.tar.gz: 6f01bf9d070e1307666949acf47d99170d6b28c0048c868a6310663f2d55c919
 SHA512:
-  metadata.gz: 831ed7f14aaef5be511434b7697f0f0d23896d78fd2cfd5ef6037fee9c9909dbce3cc6c51bd6d9b1c95dae2dbeb7990b1cece93f455990f3f7c4e911dc64e24a
-  data.tar.gz: 6621e043744173fe77a457a3823a6b38032b4f12a71f96f707539154578bf9b7c95d8e688d36ba7d44404148ed4f85a47b55a3a00d81fb13e466fa86e9bc1be7
+  metadata.gz: 8141047ac65832b64b8eab1d565b5c3eb3bf8841b5541624605179a1e4bc0479f4dab16a92b3b7055e2eb844e37781aac7acab2aa812b348e53d9a151a16fe97
+  data.tar.gz: e5ead28d45b33a6c7fdb5c46f84cdd9a887e6bca593b841687a1d1124ba904f02ee09bdb1ef8dab87f2b8dcfcd6480190e94cea57e8b3b4853148d06d199f6e6

data/lib/milk_tea/base.rb

@@ -3,7 +3,7 @@
 require "pathname"
 
 module MilkTea
-  VERSION = "0.2.18"
+  VERSION = "0.2.19"
 
   def self.root
     @root ||= Pathname.new(File.expand_path("../..", __dir__))

data/lib/milk_tea/tooling/linter/release_rules.rb

@@ -237,6 +237,8 @@ module MilkTea
             true
           elsif (expr = extract_expr(stmt)) && own_struct_field_transfer?(expr, name)
             true
+          elsif stmt.is_a?(AST::Assignment) && stmt.value.is_a?(AST::Identifier) && stmt.value.name == name
+            true
           else
             false
           end

data/lib/milk_tea/tooling/linter/visitors.rb

@@ -821,6 +821,7 @@ module MilkTea
             message: "every #{kind} branch returns a value; rewrite as `return #{kind} …` expression",
           )
         elsif stmts.all? { |s| s.is_a?(AST::Assignment) && s.operator == "=" } &&
+              stmts.all? { |s| s.target.respond_to?(:name) } &&
               stmts.map { |s| node_fingerprint(s.target) }.uniq.size == 1
           target_name = stmts.first.target.name
           emit_conciseness_hint(

data/std/async/libuv_runtime.mt

@@ -247,7 +247,7 @@ public function sleep_release(frame: ptr[void]) -> void:
 
         if not state.closing:
             state.closing = true
-            let handle = timer_as_handle(unsafe: ptr[NativeTimerHandle]<-state.timer)
+            let handle = timer_as_handle(ptr[NativeTimerHandle]<-state.timer)
             libuv.close(handle, sleep_timer_close)
 
 
@@ -323,7 +323,7 @@ public function work_release[T](frame: ptr[void]) -> void:
 
         state.released = true
         if state.queued and state.work != null:
-            libuv.cancel(work_as_req(unsafe: ptr[NativeWorkRequest]<-state.work))
+            libuv.cancel(work_as_req(ptr[NativeWorkRequest]<-state.work))
 
 
 public function work_take_result[T](frame: ptr[void]) -> T:

data/std/behavior_tree.mt

@@ -128,7 +128,7 @@ function tick_node[Context](tree: ref[Tree[Context]], node_id: ptr_uint, context
 
                 var saw_running = false
                 for child_ptr in read(node).children:
-                    let child_status = tick_node(tree, unsafe: read(child_ptr), context)
+                    let child_status = tick_node(tree, read(child_ptr), context)
                     match child_status:
                         Status.success:
                             pass
@@ -148,7 +148,7 @@ function tick_node[Context](tree: ref[Tree[Context]], node_id: ptr_uint, context
 
                 var saw_running = false
                 for child_ptr in read(node).children:
-                    let child_status = tick_node(tree, unsafe: read(child_ptr), context)
+                    let child_status = tick_node(tree, read(child_ptr), context)
                     match child_status:
                         Status.success:
                             return Status.success

data/std/deque.mt

@@ -140,6 +140,35 @@ extending Deque[T]:
         this.capacity = new_capacity
 
 
+    public editable function shrink_to_fit() -> void:
+        if this.len == 0:
+            heap.release(this.data)
+            this.data = null
+            this.head = 0
+            this.capacity = 0
+            return
+
+        if this.len == this.capacity:
+            return
+
+        let new_data = heap.must_alloc[T](this.len)
+        let old_data = this.data
+        if old_data != null:
+            unsafe:
+                let old_ptr = ptr[T]<-old_data
+                let new_ptr = ptr[T]<-new_data
+                var index: ptr_uint = 0
+                while index < this.len:
+                    let source_index = Deque[T].physical_index(this.head, this.capacity, index)
+                    read(new_ptr + index) = read(old_ptr + source_index)
+                    index += 1
+
+        heap.release(old_data)
+        this.data = new_data
+        this.head = 0
+        this.capacity = this.len
+
+
     public editable function push_back(value: T) -> void:
         if this.len == this.capacity:
             this.reserve(this.len + 1)

data/std/goap.mt

@@ -323,13 +323,12 @@ extending Planner[World, Goal, Context]:
                                         action_index += 1
                                         continue
 
-                                    if next_cost < unsafe: read(existing_ptr).cost_so_far:
-                                        unsafe:
-                                            read(existing_ptr).parent_index = current_index
-                                            read(existing_ptr).has_parent = true
-                                            read(existing_ptr).action_index = action_index
-                                            read(existing_ptr).cost_so_far = next_cost
-                                            read(existing_ptr).closed = false
+                                    if next_cost < read(existing_ptr).cost_so_far:
+                                        read(existing_ptr).parent_index = current_index
+                                        read(existing_ptr).has_parent = true
+                                        read(existing_ptr).action_index = action_index
+                                        read(existing_ptr).cost_so_far = next_cost
+                                        read(existing_ptr).closed = false
                                         if not open_list_contains(ref_of(open_list), existing_payload.value):
                                             open_list.push(existing_payload.value)
                         action_index += 1

data/std/net/manager.mt

@@ -331,7 +331,7 @@ public function create_server(
                 is_server = true,
                 max_players = config.max_players,
                 mux_session = session_p.value,
-                mux_connection = unsafe: zero[mux.MuxedConnection],
+                mux_connection = zero[mux.MuxedConnection],
                 local_player_id = 0u,
                 players = vec.Vec[PlayerState].create(),
                 next_player_id = 1u,
@@ -357,7 +357,7 @@ public function create_client(
             let client_mgr = NetworkManager(
                 is_server = false,
                 max_players = config.max_players,
-                mux_session = unsafe: zero[mux.MuxedSession],
+                mux_session = zero[mux.MuxedSession],
                 mux_connection = mux_conn_p.value,
                 local_player_id = 0u,
                 players = vec.Vec[PlayerState].create(),

data/std/net/packet.mt

@@ -164,7 +164,7 @@ extending Stream:
             Result.failure as error_payload:
                 return Result[ptr_uint, Error].failure(error = error_from_net(error_payload.error))
             Result.success as write_payload:
-                unsafe: write_payload.value
+                write_payload.value
                 return Result[ptr_uint, Error].success(value = content.len)
 
 
@@ -183,7 +183,7 @@ extending Stream:
                         Result.failure as discard_payload:
                             return Result[bytes.Bytes, Error].failure(error = discard_payload.error)
                         Result.success as discard_payload:
-                            unsafe: discard_payload.value
+                            discard_payload.value
                             return Result[bytes.Bytes, Error].failure(error = packet_error(
                                 -2,
                                 "packet exceeds configured maximum"

data/std/net.mt

@@ -736,7 +736,7 @@ function connect_cleanup_and_release(state: ptr[ConnectState]) -> void:
             read(state).result_owned = false
 
         if read(state).handle != null[ptr[NativeTcpHandle]]:
-            close_tcp_handle(unsafe: ptr[NativeTcpHandle]<-read(state).handle)
+            close_tcp_handle(ptr[NativeTcpHandle]<-read(state).handle)
             read(state).handle = null
 
         heap.release(state)

data/std/process.mt

@@ -94,7 +94,7 @@ public function parent_environment() -> vec.Vec[EnvironmentEntry]:
             nname.reserve(eq_pos)
             var ni: ptr_uint = 0
             while ni < eq_pos:
-                nname.push_byte(ubyte<-(unsafe: read(entry_cstr + ni)))
+                nname.push_byte(ubyte<-(read(entry_cstr + ni)))
                 ni += 1
             var nvalue = string.String.create()
             let vlen = len - eq_pos - 1
@@ -102,7 +102,7 @@ public function parent_environment() -> vec.Vec[EnvironmentEntry]:
                 nvalue.reserve(vlen)
                 var vi: ptr_uint = 0
                 while vi < vlen:
-                    nvalue.push_byte(ubyte<-(unsafe: read(entry_cstr + eq_pos + 1 + vi)))
+                    nvalue.push_byte(ubyte<-(read(entry_cstr + eq_pos + 1 + vi)))
                     vi += 1
             result.push(EnvironmentEntry(
                 name = nname.as_str(),

data/std/queue.mt

@@ -47,6 +47,10 @@ extending Queue[T]:
         this.values.reserve(min_capacity)
 
 
+    public editable function shrink_to_fit() -> void:
+        this.values.shrink_to_fit()
+
+
     public editable function enqueue(value: T) -> void:
         this.values.push_back(value)
 

data/std/serialize.mt

@@ -25,7 +25,7 @@ public function unpack[T](source: span[ubyte]) -> Result[T, bin.Error]:
             error = raw_unpack_error("source too short for target type")
         )
 
-    var result = unsafe: zero[T]
+    var result = zero[T]
     var dest = unsafe: ptr[ubyte]<-ptr_of(result)
     var i: ptr_uint = 0
     while i < total:
@@ -59,7 +59,7 @@ extending bin.Reader:
                         error = raw_unpack_error("reader returned empty data")
                     )
 
-                var result = unsafe: zero[T]
+                var result = zero[T]
                 var dest = unsafe: ptr[ubyte]<-ptr_of(result)
                 var i: ptr_uint = 0
                 while i < total:

data/std/sparse_set.mt

@@ -93,6 +93,12 @@ extending SparseSet[T]:
         this.keys.reserve(min_capacity)
 
 
+    public editable function shrink_to_fit() -> void:
+        this.sparse.shrink_to_fit()
+        this.dense.shrink_to_fit()
+        this.keys.shrink_to_fit()
+
+
     public editable function insert(key: ptr_uint, value: T) -> bool:
         while key >= this.sparse.len():
             this.sparse.push(SPARSE_EMPTY)

data/std/stack.mt

@@ -47,6 +47,10 @@ extending Stack[T]:
         this.values.reserve(min_capacity)
 
 
+    public editable function shrink_to_fit() -> void:
+        this.values.shrink_to_fit()
+
+
     public editable function push(value: T) -> void:
         this.values.push_back(value)
 

data/std/string.mt

@@ -133,6 +133,26 @@ extending String:
         this.capacity = new_capacity
 
 
+    public editable function shrink_to_fit() -> void:
+        if not this.owns_storage:
+            return
+
+        if this.len == 0:
+            heap.release(this.data)
+            this.data = null
+            this.capacity = 0
+            return
+
+        if this.len == this.capacity:
+            return
+
+        let resized = heap.resize[ubyte](this.data, this.len) else:
+            fatal(c"string.shrink_to_fit out of memory")
+
+        this.data = resized
+        this.capacity = this.len
+
+
     public editable function push_byte(value: ubyte) -> void:
         if this.len == this.capacity:
             this.reserve(this.len + 1)

data/std/toml.mt

@@ -1214,7 +1214,7 @@ function append_value(output: ref[string.String], value: Value) -> void:
                     let item = values.values.get(index) else:
                         fatal(c"toml.append_value missing array item")
 
-                    append_value(output, unsafe: read(item))
+                    append_value(output, read(item))
                     index += 1
 
         output.push_byte(byte_right_bracket)
@@ -1233,7 +1233,7 @@ function append_value(output: ref[string.String], value: Value) -> void:
                 let entry = object_entries.entries.get(index) else:
                     fatal(c"toml.append_value missing object entry")
 
-                let current = unsafe: read(entry)
+                let current = read(entry)
                 append_entry_key(output, current.key.as_str())
                 output.append(" = ")
                 append_value(output, current.value)

data/std/vec.mt

@@ -117,6 +117,23 @@ extending Vec[T]:
         this.capacity = new_capacity
 
 
+    public editable function shrink_to_fit() -> void:
+        if this.len == 0:
+            heap.release(this.data)
+            this.data = null
+            this.capacity = 0
+            return
+
+        if this.len == this.capacity:
+            return
+
+        let resized = heap.resize[T](this.data, this.len) else:
+            fatal(c"vec.shrink_to_fit out of memory")
+
+        this.data = resized
+        this.capacity = this.len
+
+
     public editable function append_span(values: span[T]) -> void:
         if values.len == 0:
             return

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: mt-lang
 version: !ruby/object:Gem::Version
-  version: 0.2.18
+  version: 0.2.19
 platform: ruby
 authors:
 - Long (Teefan) Tran
@@ -586,7 +586,7 @@ metadata:
   homepage_uri: https://teefan.github.io/mt-lang/
   source_code_uri: https://github.com/teefan/mt-lang
 post_install_message: |
-  Milk Tea 0.2.18 installed!
+  Milk Tea 0.2.19 installed!
 
   System requirements:
     - A C compiler (gcc or clang) must be available on PATH