zoukankan      html  css  js  c++  java
  • softwareTesting_work2_question1

    1. input类
      package com.Phantom;
      
      import java.util.ArrayList;
      import java.util.HashMap;
      import java.util.List;
      import java.util.Map;
      import java.util.Map.Entry;
      
      public class inputs {
          public int times;
          public int getTimes() {
              return times;
          }
          public void setTimes(int times) {
              this.times = times;
          }
          public inputs(int times, String words) {
              super();
              this.times = times;
              this.words = words;
          }
          
          public String words;
          Map<String, Integer>map=new HashMap<String, Integer>();
          List<Entry<String, Integer>>list=new ArrayList<Map.Entry<String,Integer>>();
      //    public String getWords() {
      //        return words;
      //    }
          public void setWords(String words) {
              this.words = words;
          }
          
          public Map<String, Integer> getMap() {
              return map;
          }
      //    public void setMap(Map<String, Integer> map) {
      //        this.map = map;
      //    }
      //    public List<Entry<String, Integer>> getList() {
      //        return list;
      //    }
      //    public void setList(List<Entry<String, Integer>> list) {
      //        this.list = list;
      //    }
          
          public inputs() {
          }
          
      
      }
    2. operation类
      package com.Phantom;
      
      import java.util.Collections;
      import java.util.Comparator;
      import java.util.Map.Entry;
      import java.util.Scanner;
      import java.util.Set;
      
      
      public class operation {
          inputs i=new inputs();
          public String in(int times,String input){
              Scanner in=new Scanner(System.in);
              String words=in.nextLine();
              
              i.setWords(words);
              String[] items = words.split(" ");
              
              for(String s:items){
                  if (i.map.containsKey(s)) {
                      i.map.put(s, i.map.get(s)+1);
                  }
                  else{
                      i.map.put(s, 1);
                  }
              }
              
              for(Entry<String, Integer>entry:i.map.entrySet()){
                  i.list.add(entry);
              }
              
              System.out.println("单词"+"	"+"出现频率");
              for (Entry<String, Integer> obj : i.list) {
                  i.times=obj.getValue();
                  System.out.println(obj.getKey() + "	" + i.times);
              }
      //测试
      //        System.out.println(i.map);
      //        System.out.println(i.map.values());
      //        i.map.put("aaa", 3);
      //        Set<Entry<String, Integer>>e=i.map.entrySet();
      //        System.out.println(i.map);
      //        System.out.println(i.map.get("aaa"));
      //        System.out.println(i.map.values().size());
      //        System.out.println(i.map.toString());
              return words;
          }
      
      //测试
      //    public static void main(String[] args) {
      //        // TODO Auto-generated method stub
      //        System.out.println("请输入内容:");
      //        inputs i=new inputs(0, null);
      //        operation o=new operation();
      //        o.in(0, null);
      //    }
      }
    3. //测试用main函数
      // public static void main(String[] args) {
      // // TODO Auto-generated method stub
      // System.out.println("请输入内容:");
      // inputs i=new inputs(0, null);
      // operation o=new operation();
      // o.in(0, null);
      // }
      }

    4. testing类
      package com.Phantom;
      
      import static org.junit.Assert.*;
      import junit.framework.TestCase;
      
      import org.junit.Before;
      import org.junit.Test;
      
      public class testingOperation  extends TestCase{
          private operation o1;
          inputs i1=new inputs(0, null);
           @Before
          public void setUp() throws Exception {
               super.setUp();
               o1=new operation();
          }
      
          public void testOperation() {
              i1.setWords("aaa aaa aaa");
              i1.setTimes(3);
              i1.map.put("aaa", 3);
              assertTrue(o1.in(i1.getTimes(), i1.map.toString())==i1.map.get("aaa")+"aaa aaa aaa");}
              
      
      
          @Override
          protected void tearDown() throws Exception {
              // TODO Auto-generated method stub
              super.tearDown();
              System.out.println("getMap"+i1.getMap());
          }
          
      
      }

    junit

    覆盖率

  • 相关阅读:
    HDU6030 Happy Necklace(推导+矩阵快速幂)
    威尔逊定理总结
    卢卡斯定理总结
    扩展欧几里得总结
    HDU2602 Bone Collector(01背包)
    离散数学--集合论
    Linux超全实用指令大全
    HDU6715 算术(莫比乌斯反演)
    莫比乌斯反演总结
    k8s-基于kubeasz项目二进制部署k8s集群
  • 原文地址:https://www.cnblogs.com/Phantom-void/p/5322951.html
Copyright © 2011-2022 走看看