Chore: update copyright year for all files to 2025 + run moon fmt

array/array_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -125,7 +125,7 @@ test "eachi" {
   let v = [3, 4, 5]
   let mut sum = 0
   for i, x in v {
-    // todo: maybe support (i,x)   
+    // todo: maybe support (i,x)
     sum = sum + x + i
   }
   assert_eq!(sum, 15)

array/fixedarray_sort_by.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -14,11 +14,11 @@
 
 ///|
 /// Sorts the array with a key extraction function.
-/// 
+///
 /// It's an in-place, unstable sort(it will reorder equal elements). The time complexity is O(n log n) in the worst case.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```
 /// let arr = [5, 3, 2, 4, 1]
 /// arr.sort_by_key(fn (x) {-x})
@@ -47,11 +47,11 @@ test "@array.sort_by_key/basic" {
 
 ///|
 /// Sorts the array with a custom comparison function.
-/// 
+///
 /// It's an in-place, unstable sort(it will reorder equal elements). The time complexity is O(n log n) in the worst case.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```
 /// let arr = [5, 3, 2, 4, 1]
 /// arr.sort_by(fn (a, b) { a - b })
@@ -182,9 +182,9 @@ fn fixed_quick_sort_by[T](
 
 ///|
 /// Try to sort the array with bubble sort.
-/// 
+///
 /// It will only tolerate at most 8 unsorted elements. The time complexity is O(n).
-/// 
+///
 /// Returns whether the array is sorted.
 fn fixed_try_bubble_sort_by[T](
   arr : FixedArraySlice[T],
@@ -210,9 +210,9 @@ fn fixed_try_bubble_sort_by[T](
 
 ///|
 /// Try to sort the array with bubble sort.
-/// 
+///
 /// It will only tolerate at most 8 unsorted elements. The time complexity is O(n).
-/// 
+///
 /// Returns whether the array is sorted.
 fn fixed_bubble_sort_by[T](
   arr : FixedArraySlice[T],
@@ -262,9 +262,9 @@ fn fixed_partition_by[T](
 
 ///|
 /// Choose a pivot index for quick sort.
-/// 
+///
 /// It avoids worst case performance by choosing a pivot that is likely to be close to the median.
-/// 
+///
 /// Returns the pivot index and whether the array is likely sorted.
 fn fixed_choose_pivot_by[T](
   arr : FixedArraySlice[T],

array/fixedarray_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

array/panic_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

array/slice.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

array/sort.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -14,11 +14,11 @@
 
 ///|
 /// Sorts the array in place.
-/// 
+///
 /// It's an in-place, unstable sort(it will reorder equal elements). The time complexity is O(n log n) in the worst case.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```
 /// let arr = [5, 4, 3, 2, 1]
 /// arr.sort()
@@ -105,9 +105,9 @@ fn get_limit(len : Int) -> Int {
 
 ///|
 /// Try to sort the array with bubble sort.
-/// 
+///
 /// It will only tolerate at most 8 unsorted elements. The time complexity is O(n).
-/// 
+///
 /// Returns whether the array is sorted.
 fn try_bubble_sort[T : Compare](arr : ArrayView[T]) -> Bool {
   let max_tries = 8
@@ -159,9 +159,9 @@ fn partition[T : Compare](arr : ArrayView[T], pivot_index : Int) -> (Int, Bool)
 
 ///|
 /// Choose a pivot index for quick sort.
-/// 
+///
 /// It avoids worst case performance by choosing a pivot that is likely to be close to the median.
-/// 
+///
 /// Returns the pivot index and whether the array is likely sorted.
 fn choose_pivot[T : Compare](arr : ArrayView[T]) -> (Int, Bool) {
   let len = arr.length()

array/sort_by.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -14,11 +14,11 @@
 
 ///|
 /// Sorts the array with a key extraction function.
-/// 
+///
 /// It's an in-place, unstable sort(it will reorder equal elements). The time complexity is O(n log n) in the worst case.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```
 /// let arr = [5, 3, 2, 4, 1]
 /// arr.sort_by_key(fn (x) {-x})
@@ -35,11 +35,11 @@ pub fn sort_by_key[T, K : Compare](self : Array[T], map : (T) -> K) -> Unit {
 
 ///|
 /// Sorts the array with a custom comparison function.
-/// 
+///
 /// It's an in-place, unstable sort(it will reorder equal elements). The time complexity is O(n log n) in the worst case.
-/// 
+///
 /// # Example
-/// 
+///
 /// ```
 /// let arr = [5, 3, 2, 4, 1]
 /// arr.sort_by(fn (a, b) { a - b })
@@ -119,9 +119,9 @@ fn quick_sort_by[T](
 
 ///|
 /// Try to sort the array with bubble sort.
-/// 
+///
 /// It will only tolerate at most 8 unsorted elements. The time complexity is O(n).
-/// 
+///
 /// Returns whether the array is sorted.
 fn try_bubble_sort_by[T](arr : ArrayView[T], cmp : (T, T) -> Int) -> Bool {
   let max_tries = 8
@@ -144,9 +144,9 @@ fn try_bubble_sort_by[T](arr : ArrayView[T], cmp : (T, T) -> Int) -> Bool {
 
 ///|
 /// Try to sort the array with bubble sort.
-/// 
+///
 /// It will only tolerate at most 8 unsorted elements. The time complexity is O(n).
-/// 
+///
 /// Returns whether the array is sorted.
 fn bubble_sort_by[T](arr : ArrayView[T], cmp : (T, T) -> Int) -> Unit {
   for i = 1; i < arr.length(); i = i + 1 {
@@ -181,9 +181,9 @@ fn partition_by[T](
 
 ///|
 /// Choose a pivot index for quick sort.
-/// 
+///
 /// It avoids worst case performance by choosing a pivot that is likely to be close to the median.
-/// 
+///
 /// Returns the pivot index and whether the array is likely sorted.
 fn choose_pivot_by[T](arr : ArrayView[T], cmp : (T, T) -> Int) -> (Int, Bool) {
   let len = arr.length()

array/utils.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

array/view_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

bool/bool_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

buffer/buffer_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/array_nonjs_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/array_test.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -129,7 +129,7 @@ test "array_append" {
   arr1.append(arr3)
   assert_eq!(arr1.length(), 6 + cap)
   // assert_eq!(arr1.capacity(), arr1.length())
-  // Not testing capacity as it may be platform/algorithm 
+  // Not testing capacity as it may be platform/algorithm
   // dependent and not guaranteed to be equal to length
 }
 

builtin/array_wbtest.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/arraycore_js.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -13,7 +13,7 @@
 // limitations under the License.
 
 //#region
-// These types are of workaround for the restriction that MoonBit do not support 
+// These types are of workaround for the restriction that MoonBit do not support
 // generic type parameters of extern ffi
 
 ///|
@@ -131,7 +131,7 @@ test "UninitializedArray::unsafe_blit_fixed" {
 ///|
 /// Reserves capacity to ensure that it can hold at least the number of elements
 /// specified by the `capacity` argument.
-/// 
+///
 /// **NOTE**: This method does nothing on js platform.
 /// # Example
 ///
@@ -206,10 +206,10 @@ pub fn pop_exn[T](self : Array[T]) -> T {
 
 ///|
 /// Removes the last element from a array and returns it.
-/// 
+///
 /// **NOTE** This method will not cause a panic, but it may result in undefined
-/// behavior on the JavaScript platform. Use with caution. 
-/// 
+/// behavior on the JavaScript platform. Use with caution.
+///
 /// @alert unsafe "Panic if the array is empty."
 pub fn unsafe_pop[T](self : Array[T]) -> T {
   JSArray::ofAnyArray(self).pop().toAny()
@@ -280,7 +280,7 @@ pub fn insert[T](self : Array[T], index : Int, value : T) -> Unit {
 ///|
 /// Resize the array in-place so that `len` is equal to `new_len`.
 ///
-/// If `new_len` is greater than `len`, the array will be extended by the 
+/// If `new_len` is greater than `len`, the array will be extended by the
 /// difference, and the values in the new slots are left uninitilized.
 ///  If `new_len` is less than `len`, it will panic
 ///

builtin/assert.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/autoloc.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/bigint_deprecated.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -23,7 +23,7 @@ pub fn asr(self : BigInt, n : Int) -> BigInt {
 /// Left shift a bigint
 /// The sign of the result is the same as the sign of the input.
 /// Only the absolute value is shifted.
-/// 
+///
 /// @alert deprecated "Use infix bitwise operator `<<` instead"
 /// @coverage.skip
 pub fn shl(self : BigInt, n : Int) -> BigInt {
@@ -34,7 +34,7 @@ pub fn shl(self : BigInt, n : Int) -> BigInt {
 /// Left shift a bigint
 /// The sign of the result is the same as the sign of the input.
 /// Only the absolute value is shifted.
-/// 
+///
 /// @alert deprecated "Use infix bitwise operator `<<` instead"
 /// @coverage.skip
 pub fn lsl(self : BigInt, n : Int) -> BigInt {
@@ -45,7 +45,7 @@ pub fn lsl(self : BigInt, n : Int) -> BigInt {
 /// Right shift a bigint
 /// The sign of the result is the same as the sign of the input.
 /// Only the absolute value is shifted.
-/// 
+///
 /// @alert deprecated "Use infix bitwise operator `>>` instead"
 /// @coverage.skip
 pub fn shr(self : BigInt, n : Int) -> BigInt {

builtin/bigint_js_wbtest.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.

builtin/bigint_nonjs_wbtest.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.
@@ -28,7 +28,7 @@ test "debug_string" {
   (buf as &Logger).write_iter(v.iter(), sep="\n", prefix="", suffix="")
   // Logger::writer_iter()
   // trait logger has no method write_iter
-  // precise: 
+  // precise:
   // (dyn Logger)::write_iter(buf,..)
   //  Logger::trait_method()
   inspect!(

builtin/bigint_wbtest.mbt

@@ -1,4 +1,4 @@
-// Copyright 2024 International Digital Economy Academy
+// Copyright 2025 International Digital Economy Academy
 //
 // Licensed under the Apache License, Version 2.0 (the "License");
 // you may not use this file except in compliance with the License.