kamihamihagh

src/main/java/App.java

-
-/*
-public class    App {
-
-    public class Vector{
-        private int Size;
-        private int Array[];
-
-        public Vector(int Capacity){
-            this.Size=0;
-            this.Array=new int[Capacity];
-        }
-
-        public void ensureCapacity(int Capacity){
-            if(this.Array.length<Capacity){
-                int[] Newarray = new int[Math.max(Capacity,2*this.Array.length)];
-                System.arraycopy(this.Array, 0, Newarray, 0, this.Array.length);
-                this.Array=Newarray;
-                for(int i=this.Size;i<this.Array.length;i++){
-                    this.Array[i]=0;
-                }
-            }
-        }
-
-        public void resize(int Newsize){
-            if(this.Size<this.Array.length){
-                this.Size=Newsize;
-            }
-        }
-
-        public int size(){
-            return this.Size;
-        }
-
-        public boolean isEmpty(){
-            if(this.Size==0){
-                return true;
-            }
-            else return false;
-
-        }
-
-        public void add(int Value){
-            this.Array[this.Size+1]=Value;
-        }
-
-        public void set(int Index,int Value){
-            if (this.Size>=Index+1){
-                this.Array[Index]=Value;
-            }
-        }
-
-        public int get(int Index){
-            if(Index>0 && this.Size>=Index+1){
-                return this.Array[Index];
-            }
-            else return 0;
-        }
-    }
-
-        public class Stack{
-            private Vector pile;
-            private int count=0;
-
-            public Stack(){
-                pile=new Vector(20);
-            }
-
-            public void push(int value){
-                this.pile.add(value);
-                count++;
-            }
-
-            public int peek(){
-                return this.pile.Array[count];         
-            }
-
-            public int pop(){
-                int value=this.pile.Array[count];
-                this.pile.Array[count]=0;
-                count--;
-                return value;
-            }
-
-            public int size(){
-                System.out.println("Le nombres d'entiers dans la pile est:");
-                return count+1;
-            }
-
-            public boolean isEmpty(){
-                if(this.count==0){
-                    return true;
-                }
-                else return false;
-            }
-        }
-
-        public interface StringFilter{
-            String filter(String string);
-        }
-
-        public class UpperCaseStringFilter implements StringFilter{
-      
-            public String filter(String string){
-
-                return string.toUpperCase();
-            }
-        
-        }
-        public class LowerCaseStringFilter implements StringFilter{
-            public String filter(String string){
-                return string.toLowerCase();
-            }
-        }
-
-        public class PrefixStringFilter implements StringFilter{
-            private int n;
-            
-            public PrefixStringFilter(int value){
-                n=value;
-            }
-
-            public String filter(String string){
-               return string.substring(0, this.n);
-        }
-
-
-    }
-
-     public class PostfixStringFilter implements StringFilter{
-            private int n;
-            
-            public PostfixStringFilter(int value){
-                n=value;
-            }
-
-            public String filter(String string){
-               return string.substring(this.n,string.length());
-        }
-
-            
-    }
-    //AsciiStringFilter conserve les caract`eres de code inf´erieur `a 128.
-
-    public class AsciiStringFilter implements StringFilter{
-        public String filter(String string){
-            char[] word = string.toCharArray();
-            char[] newword= new char[word.length];
-            int j=0;
-            for(int i=0;i<=word.length;i++){
-                if ((int) word[i] < 128){
-                    newword[j]=word[i];
-                    j++;
-                }
-            }
-            return newword.toString();
-        }
-    }
-
-    /*public static String[] filter(String[] strings,StringFilter filter){
-
-        for(int i=0;i<=strings.length;i++){
-
-        }
-
-
-        
-    }*/
-

src/main/java/CompositeStringFIlter.java

-/*
-public class CompositeStringFIlter implements StringFilter{
-    String result;
-    StringFilter[] myfilters;
-    public CompositeStringFIlter(StringFilter[] filter){
-        myfilters=new StringFilter[filter.length];
-        for(int i=0;i<myfilters.length;i++){
-            myfilters[i]=filter[i];
-        }
-    }
-
-    public String filter(String chaine){
-        for (filter i in myfilters){
-            filter F = new filter(chaine);
-            result=F.filter;
-        }
-}*/

src/main/java/APP.java → src/main/java/multiple_Filters.java

-import java.util.Arrays;
-
-public class APP {
-    public APP() {
+public class multiple_Filters {
+    public multiple_Filters() {
 
     }
     public static String[] filter(String[] tabs, StringFilter filters) {

src/test/java/Filtertest.java

 import org.junit.jupiter.api.Test;
-import org.junit.jupiter.api.Disabled;
-import org.junit.jupiter.api.Test;
+
 import static org.assertj.core.api.Assertions.assertThat;
-import static org.assertj.core.api.Assertions.*;
 
 public class Filtertest {
 
@@ -39,8 +37,8 @@ import static org.assertj.core.api.Assertions.*;
             String[] words2={"hello","durty","world"};
             LowerCaseStringFilter filter2 = new LowerCaseStringFilter();
             AsciiStringFilter filter1= new AsciiStringFilter();
-            assertThat(APP.filter(words,filter1)).isEqualTo(words);
-            assertThat(APP.filter(words,filter2)).isEqualTo(words2);
+            assertThat(multiple_Filters.filter(words,filter1)).isEqualTo(words);
+            assertThat(multiple_Filters.filter(words,filter2)).isEqualTo(words2);
 
 
         }