update to latest Jule version

Author: mertcandav

.github/workflows/directory.jule

@@ -22,9 +22,9 @@ fn writeLine(text: str) { write(text + "\n") }
 
 fn sortDirents(mut &dirents: []&DirEntry) {
     let mut i = 0
-    for i < dirents.len-1; i++ {
+    for i < len(dirents)-1; i++ {
         let mut j = 0
-        for j < dirents.len-i-1; j++ {
+        for j < len(dirents)-i-1; j++ {
             if dirents[j+1].Name < dirents[j].Name {
                 dirents.swap(j, j+1)
             }
@@ -50,7 +50,7 @@ fn makeName(mut s: str): str {
     // Make uppercase first character of all words.
     let mut i = 0
     let mut waitSpace = false
-    for i < s.len; i++ {
+    for i < len(s); i++ {
         let b = s[i]
         if waitSpace {
             if b == ' ' {

math/max.jule

@@ -1,5 +1,5 @@
 fn Max(values: ...int): int {
-    if values.len == 0 {
+    if len(values) == 0 {
         ret 0
     }
     let mut max = values[0]

math/median.jule

@@ -2,7 +2,7 @@ use sort::{QuickSort}
 
 fn Median(mut slice: []int): f64 {
     slice = QuickSort(slice)
-    let l = slice.len
+    let l = len(slice)
     match {
     | l == 0:
         ret 0

math/min.jule

@@ -1,5 +1,5 @@
 fn Min(values: ...int): int {
-    if values.len == 0 {
+    if len(values) == 0 {
         ret 0
     }
     let mut min = values[0]

search/binary_search.jule

@@ -1,6 +1,6 @@
 fn BinarySearch(s: []int, i: int): (pos: int) {
     let mut b = 0
-    let mut e = s.len - 1
+    let mut e = len(s) - 1
     for b <= e {
         let mid = int(b + (e-b)/2)
         match {

sort/bubble_sort.jule

@@ -3,7 +3,7 @@ fn BubbleSort(mut s: []int): []int {
     for swapped {
         swapped = false
         let mut i = 0
-        for i < s.len-1; i++ {
+        for i < len(s)-1; i++ {
             if s[i+1] < s[i] {
                 s[i+1], s[i] = s[i], s[i+1]
                 swapped = true

sort/exchange_sort.jule

@@ -1,8 +1,8 @@
 fn ExchangeSort(mut s: []int): []int {
     let mut i = 0
-    for i < s.len-1; i++ {
+    for i < len(s)-1; i++ {
         let mut j = i + 1
-        for j < s.len; j++ {
+        for j < len(s); j++ {
             if s[i] > s[j] {
                 s[i], s[j] = s[j], s[i]
             }

sort/insertion_sort.jule

@@ -1,6 +1,6 @@
 fn InsertionSort(mut s: []int): []int {
     let mut currentIndex = 1
-    for currentIndex < s.len; currentIndex++ {
+    for currentIndex < len(s); currentIndex++ {
         let temporary = s[currentIndex]
         let mut iterator = currentIndex
         for iterator > 0 && s[iterator-1] > temporary; iterator-- {

sort/quick_sort.jule

@@ -1,10 +1,10 @@
 fn QuickSort(mut s: []int): []int {
-    if s.len <= 1 {
+    if len(s) <= 1 {
         ret s
     }
 
     let mut i = -1
-    let last = s[s.len-1]
+    let last = s[len(s)-1]
     for j in s {
         if s[j] <= last {
             i++

sort/selection_sort.jule

@@ -1,9 +1,9 @@
 fn SelectionSort(mut s: []int): []int {
     let mut i = 0
-    for i < s.len; i++ {
+    for i < len(s); i++ {
         let mut min = i
         let mut j = i + 1
-        for j < s.len; j++ {
+        for j < len(s); j++ {
             if s[j] < s[min] {
                 min = j
             }