style: fmt pi file

Author: RINNE-TAN

test/main.pi

@@ -20,7 +20,6 @@ use project1::test::tree;
 use project1::test::fixed_point;
 use project1::tmod2::test_mod_impl;
 use pl_test::main;
-
 pub fn main() i64 {
     macros::test_macros();
     ifel::test_if_else();

test/mod1.pi

@@ -1,6 +1,6 @@
 use project1::mod2;
 pub fn test_mod(args: i64) void {
-    let d:mod2::Mod2 = mod2::Mod2{ };
+    let d: mod2::Mod2 = mod2::Mod2{};
     printi64ln(999999);
     return;
 }

test/test/ifel.pi

@@ -7,9 +7,8 @@ pub fn test_if_else() void {
     return;
 }
 
-
 fn test_not_equal() void {
-    if 1 !=2 {
+    if 1 != 2 {
         return;
     }
     return;

test/test/multi_trait.pi

@@ -6,9 +6,9 @@ trait B {
 
 }
 
-
 trait C: A+B {
     fn c() void;
+
 }
 
 pub fn test_multi_trait() void {
@@ -23,15 +23,13 @@ pub fn test_multi_trait() void {
     return;
 }
 
-
 impl C for test_struct {
     fn c() void {
         return;
     }
 
 }
 
-
 impl B for test_struct {
     fn b() i64 {
         return 1000;

test/test/multi_trait_st.pi

@@ -1,2 +1,3 @@
 pub struct test_struct {
-}
+}
+

test/test/st.pi

@@ -36,7 +36,7 @@ pub fn ret_struct() struct_child {
 }
 
 pub fn dangling() *pointer_struct {
-    let a:pointer_struct = pointer_struct{
+    let a: pointer_struct = pointer_struct{
         ptr: &struct_child{
             a: 10
         }

test/test/tree.pi

@@ -3,14 +3,13 @@ struct Node {
     right: Option<*Node>;
 }
 
-
 fn build_tree() Node {
     let n = &Node{};
     let orin = n;
     for let i = 0; i < 10; i = i + 1 {
         n.left = &Node{};
         n.right = &Node{};
-        if i - i/2*2 == 1 {
+        if i - i / 2 * 2 == 1 {
             n.left = &Node{};
             n = n.left as *Node!;
         } else {
@@ -20,7 +19,7 @@ fn build_tree() Node {
     }
     n = orin;
     for let i = 0; i < 10; i = i + 1 {
-        if i - i/2*2 == 1 {
+        if i - i / 2 * 2 == 1 {
             n = n.left as *Node!;
         } else {
             n = n.right as *Node!;
@@ -37,11 +36,12 @@ fn build_tree() Node {
 pub fn test_eva() void {
     let n = build_tree();
     for let i = 0; i < 10; i = i + 1 {
-        if i - i/2*2 == 1 {
+        if i - i / 2 * 2 == 1 {
             n = *n.left as *Node!;
         } else {
             n = *n.right as *Node!;
         }
     }
     return;
 }
+

test/test/union.pi

@@ -50,5 +50,4 @@ impl<T> A<T> {
 
 }
 
-
 type Name = i32 | i64;

test/tmod.pi

@@ -1,3 +1,3 @@
 pub struct name<TT> {
-    
-}
+}
+

test/tmod1.pi

@@ -1,21 +1,24 @@
 use project1::tmod;
 pub trait namet {
     fn namet() void;
+
 }
 
-impl <T>  namet for tmod::name<T>  {
+impl<T> namet for tmod::name<T> {
     fn namet() void {
         return;
     }
+
 }
 
 // TODO
 impl tmod::name<T> {
-    
 }
 
 impl namet for i64 {
     fn namet() void {
         return;
     }
-}
+
+}
+