AI导航网
微信公众号搜"智元新知"关注
微信扫一扫可直接关注哦！

com.google.common.collect.testing.google.TestStringMultisetGenerator的实例源码

分类：Java实例代码作者：编程之家
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        String element = elements[i];
        if (multiset1.contains(element) ||
            multiset2.contains(element)) {
          // add to both; the one already containing it will have more
          multiset1.add(element);
          multiset2.add(element);
        } else if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.union(multiset1,multiset2);
    }
  };
}
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator sumGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        // add to either; sum should contain all
        if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.sum(multiset1,multiset2);
    }
  };
}
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator differenceGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("equalIn1");
      multiset1.add("fewerIn1");
      multiset2.add("equalIn1");
      multiset2.add("fewerIn1",3);
      multiset2.add("onlyIn2",2);
      for (int i = 0; i < elements.length; i++) {
        // add 1 more copy of each element to multiset1 than multiset2
        multiset1.add(elements[i],i + 2);
        multiset2.add(elements[i],i + 1);
      }
      return Multisets.difference(multiset1,multiset2);
    }
  };
}
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator filteredGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = LinkedHashMultiset.create();
      Collections.addAll(multiset,elements);
      multiset.addAll(ELEMENTS_TO_FILTER_OUT);
      return Multisets.filter(multiset,PREDICATE);
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Lists.newArrayList(LinkedHashMultiset.create(insertionorder));
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        String element = elements[i];
        if (multiset1.contains(element) ||
            multiset2.contains(element)) {
          // add to both; the one already containing it will have more
          multiset1.add(element);
          multiset2.add(element);
        } else if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.union(multiset1,multiset2);
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator sumGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        // add to either; sum should contain all
        if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.sum(multiset1,multiset2);
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator differenceGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("equalIn1");
      multiset1.add("fewerIn1");
      multiset2.add("equalIn1");
      multiset2.add("fewerIn1",multiset2);
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator filteredGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = LinkedHashMultiset.create();
      Collections.addAll(multiset,PREDICATE);
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Lists.newArrayList(LinkedHashMultiset.create(insertionorder));
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        String element = elements[i];
        if (multiset1.contains(element) ||
            multiset2.contains(element)) {
          // add to both; the one already containing it will have more
          multiset1.add(element);
          multiset2.add(element);
        } else if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.union(multiset1,multiset2);
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator sumGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        // add to either; sum should contain all
        if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.sum(multiset1,multiset2);
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator differenceGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("equalIn1");
      multiset1.add("fewerIn1");
      multiset2.add("equalIn1");
      multiset2.add("fewerIn1",multiset2);
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator filteredGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = LinkedHashMultiset.create();
      Collections.addAll(multiset,PREDICATE);
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Lists.newArrayList(LinkedHashMultiset.create(insertionorder));
    }
  };
}
项目：guava    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentSkipListMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset =
          new ConcurrentHashMultiset<>(new concurrentskiplistmap<String,AtomicInteger>());
      Collections.addAll(multiset,elements);
      return multiset;
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Ordering.natural().sortedcopy(insertionorder);
    }
  };
}
项目：guava    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        String element = elements[i];
        if (multiset1.contains(element) || multiset2.contains(element)) {
          // add to both; the one already containing it will have more
          multiset1.add(element);
          multiset2.add(element);
        } else if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.union(multiset1,multiset2);
    }
  };
}
项目：guava    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator sumGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      for (int i = 0; i < elements.length; i++) {
        // add to either; sum should contain all
        if (i % 2 == 0) {
          multiset1.add(elements[i]);
        } else {
          multiset2.add(elements[i]);
        }
      }
      return Multisets.sum(multiset1,multiset2);
    }
  };
}
项目：guava    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator differenceGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("equalIn1");
      multiset1.add("fewerIn1");
      multiset2.add("equalIn1");
      multiset2.add("fewerIn1",multiset2);
    }
  };
}
项目：guava    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator filteredGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = LinkedHashMultiset.create();
      Collections.addAll(multiset,PREDICATE);
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Lists.newArrayList(LinkedHashMultiset.create(insertionorder));
    }
  };
}
项目：guava-mock    文件：HashMultisetTest.java    
private static TestStringMultisetGenerator hashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return HashMultiset.create(asList(elements));
    }
  };
}
项目：guava-mock    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentHashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return ConcurrentHashMultiset.create(asList(elements));
    }
  };
}
项目：guava-mock    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentSkipListMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = new ConcurrentHashMultiset<String>(
          new concurrentskiplistmap<String,elements);
      return multiset;
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Ordering.natural().sortedcopy(insertionorder);
    }
  };
}
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unmodifiableSortedMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return Multisets.unmodifiableSortedMultiset(
          TreeMultiset.create(asList(elements)));
    }
    @Override public List<String> order(List<String> insertionorder) {
      Collections.sort(insertionorder);
      return insertionorder;
    }
  };
}
项目：guava-mock    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator intersectionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("only1");
      multiset2.add("only2");
      for (int i = 0; i < elements.length; i++) {
        multiset1.add(elements[i]);
        multiset2.add(elements[elements.length - 1 - i]);
      }
      if (elements.length > 0) {
        multiset1.add(elements[0]);
      }
      if (elements.length > 1) {
        /*
         * When a test requests a multiset with duplicates,our plan of
         * "add an extra item 0 to A and an extra item 1 to B" really means
         * "add an extra item 0 to A and B," which isn't what we want.
         */
        if (!Objects.equal(elements[0],elements[1])) {
          multiset2.add(elements[1],2);
        }
      }
      return Multisets.intersection(multiset1,multiset2);
    }
  };
}
项目：googles-monorepo-demo    文件：HashMultisetTest.java    
private static TestStringMultisetGenerator hashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return HashMultiset.create(asList(elements));
    }
  };
}
项目：googles-monorepo-demo    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentHashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return ConcurrentHashMultiset.create(asList(elements));
    }
  };
}
项目：googles-monorepo-demo    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentSkipListMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = new ConcurrentHashMultiset<String>(
          new concurrentskiplistmap<String,elements);
      return multiset;
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Ordering.natural().sortedcopy(insertionorder);
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unmodifiableSortedMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return Multisets.unmodifiableSortedMultiset(
          TreeMultiset.create(asList(elements)));
    }
    @Override public List<String> order(List<String> insertionorder) {
      Collections.sort(insertionorder);
      return insertionorder;
    }
  };
}
项目：googles-monorepo-demo    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator intersectionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("only1");
      multiset2.add("only2");
      for (int i = 0; i < elements.length; i++) {
        multiset1.add(elements[i]);
        multiset2.add(elements[elements.length - 1 - i]);
      }
      if (elements.length > 0) {
        multiset1.add(elements[0]);
      }
      if (elements.length > 1) {
        /*
         * When a test requests a multiset with duplicates,multiset2);
    }
  };
}
项目：guava-libraries    文件：HashMultisetTest.java    
private static TestStringMultisetGenerator hashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return HashMultiset.create(asList(elements));
    }
  };
}
项目：guava-libraries    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentHashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return ConcurrentHashMultiset.create(asList(elements));
    }
  };
}
项目：guava-libraries    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentSkipListMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset = new ConcurrentHashMultiset<String>(
          new concurrentskiplistmap<String,elements);
      return multiset;
    }

    @Override
    public List<String> order(List<String> insertionorder) {
      return Ordering.natural().sortedcopy(insertionorder);
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator unmodifiableSortedMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      return Multisets.unmodifiableSortedMultiset(
          TreeMultiset.create(asList(elements)));
    }
    @Override public List<String> order(List<String> insertionorder) {
      Collections.sort(insertionorder);
      return insertionorder;
    }
  };
}
项目：guava-libraries    文件：MultisetsCollectionTest.java    
private static TestStringMultisetGenerator intersectionGenerator() {
  return new TestStringMultisetGenerator() {
    @Override protected Multiset<String> create(String[] elements) {
      Multiset<String> multiset1 = LinkedHashMultiset.create();
      Multiset<String> multiset2 = LinkedHashMultiset.create();
      multiset1.add("only1");
      multiset2.add("only2");
      for (int i = 0; i < elements.length; i++) {
        multiset1.add(elements[i]);
        multiset2.add(elements[elements.length - 1 - i]);
      }
      if (elements.length > 0) {
        multiset1.add(elements[0]);
      }
      if (elements.length > 1) {
        /*
         * When a test requests a multiset with duplicates,multiset2);
    }
  };
}
项目：guava    文件：HashMultisetTest.java    
private static TestStringMultisetGenerator hashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      return HashMultiset.create(asList(elements));
    }
  };
}
项目：guava    文件：ConcurrentHashMultisetTest.java    
private static TestStringMultisetGenerator concurrentHashMultisetGenerator() {
  return new TestStringMultisetGenerator() {
    @Override
    protected Multiset<String> create(String[] elements) {
      return ConcurrentHashMultiset.create(asList(elements));
    }
  };
}

版权声明：本文内容由互联网用户自发贡献，该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容， 请发送邮件至 [email protected] 举报，一经查实，本站将立刻删除。

相关推荐

买水果
买水果
比较全面的redis工具类
比较全面的redis工具类
gson 反序列化到多态子类
gson 反序列化到多态子类
java 版本的 mb_strwidth
java 版本的 mb_strwidth
JAVA 反转字符串的最快方法,大概比StringBuffer.reverse()性能提升5倍
JAVA 反转字符串的最快方法,大概比StringBuffer.reverse()性能提升5倍
com.google.gson.internal.bind.ArrayTypeAdapter的实例源码
com.google.gson.internal.bind.ArrayTypeAdapter的实例源码
com.google.gson.JsonSyntaxException的实例源码
com.google.gson.JsonSyntaxException的实例源码
com.google.gson.JsonDeserializer的实例源码
com.google.gson.JsonDeserializer的实例源码
com.google.gson.internal.ConstructorConstructor的实例源码
com.google.gson.internal.ConstructorConstructor的实例源码
com.google.gson.JsonPrimitive的实例源码
com.google.gson.JsonPrimitive的实例源码
    pythonJavaScriptjavaHTMLreactjsC#AndroidCSSNode.jssqlrpython-3.xMysqLjQueryc++pandasFlutterangularIOSdjangolinuxswifttypescript路由器JSON路由器设置无线路由器h3c华三华三路由器设置华三路由器电脑软件教程arraysdocker软件图文教程Cvue.jslaravelspring-bootreact-native