com.google.common.collect.Multiset.Entry#getElement ( )源码实例Demo

下面列出了com.google.common.collect.Multiset.Entry#getElement ( ) 实例代码,或者点击链接到github查看源代码,也可以在右侧发表评论。

源代码1 项目: codebuff   文件: Multisets.java
@SuppressWarnings("cast")
@Override
public boolean remove(Object object) {
  if (object instanceof Multiset.Entry) {
    Entry<?> entry = (Entry<?>) object;
    Object element = entry.getElement();
    int entryCount = entry.getCount();
    if (entryCount != 0) {
      // Safe as long as we never add a new entry, which we won't.
      @SuppressWarnings("unchecked")
      Multiset<Object> multiset = (Multiset) multiset();
      return multiset.setCount(element, entryCount, 0);
    }
  }
  return false;
}
 
源代码2 项目: codebuff   文件: ImmutableMultiset.java
@Override
public UnmodifiableIterator<E> iterator() {
  final Iterator<Entry<E>> entryIterator = entrySet().iterator();
  return new UnmodifiableIterator<E>() {
    int remaining;

    E element;


    @Override
    public boolean hasNext() {
      return (remaining > 0) || entryIterator.hasNext();
    }

    @Override
    public E next() {
      if (remaining <= 0) {
        Entry<E> entry = entryIterator.next();
        element = entry.getElement();
        remaining = entry.getCount();
      }
      remaining--;
      return element;
    }
  };
}
 
源代码3 项目: codebuff   文件: ImmutableMultiset.java
@Override
public UnmodifiableIterator<E> iterator() {
  final Iterator<Entry<E>> entryIterator = entrySet().iterator();
  return new UnmodifiableIterator<E>() {
    int remaining;
    E element;

    @Override
    public boolean hasNext() {
      return (remaining > 0) || entryIterator.hasNext();
    }

    @Override
    public E next() {
      if (remaining <= 0) {
        Entry<E> entry = entryIterator.next();
        element = entry.getElement();
        remaining = entry.getCount();
      }
      remaining--;
      return element;
    }
  };
}
 
源代码4 项目: codebuff   文件: Multisets.java
@SuppressWarnings("cast")
@Override
public boolean remove(Object object) {
  if (object instanceof Multiset.Entry) {
    Entry<?> entry = (Entry<?>) object;
    Object element = entry.getElement();
    int entryCount = entry.getCount();
    if (entryCount != 0) {
      // Safe as long as we never add a new entry, which we won't.
      @SuppressWarnings("unchecked")
      Multiset<Object> multiset = (Multiset) multiset();
      return multiset.setCount(element, entryCount, 0);
    }
  }
  return false;
}
 
源代码5 项目: codebuff   文件: Multisets.java
@SuppressWarnings("cast")
@Override
public boolean remove(Object object) {
  if (object instanceof Multiset.Entry) {
    Entry<?> entry = (Entry<?>) object;
    Object element = entry.getElement();
    int entryCount = entry.getCount();
    if (entryCount != 0) {
      // Safe as long as we never add a new entry, which we won't.
      @SuppressWarnings("unchecked")
      Multiset<Object> multiset = (Multiset) multiset();
      return multiset.setCount(element, entryCount, 0);
    }
  }
  return false;
}
 
源代码6 项目: codebuff   文件: ImmutableMultiset.java
@Override
public UnmodifiableIterator<E> iterator() {
  final Iterator<Entry<E>> entryIterator = entrySet().iterator();
  return new UnmodifiableIterator<E>() {
    int remaining;

    E element;


    @Override
    public boolean hasNext() {
      return (remaining > 0) || entryIterator.hasNext();
    }

    @Override
    public E next() {
      if (remaining <= 0) {
        Entry<E> entry = entryIterator.next();
        element = entry.getElement();
        remaining = entry.getCount();
      }
      remaining--;
      return element;
    }
  };
}
 
源代码7 项目: codebuff   文件: Multisets.java
@SuppressWarnings("cast")
@Override
public boolean remove(Object object) {
  if (object instanceof Multiset.Entry) {
    Entry<?> entry = (Entry<?>) object;
    Object element = entry.getElement();
    int entryCount = entry.getCount();
    if (entryCount != 0) {
      // Safe as long as we never add a new entry, which we won't.
      @SuppressWarnings("unchecked")
      Multiset<Object> multiset = (Multiset) multiset();
      return multiset.setCount(element, entryCount, 0);
    }
  }
  return false;
}
 
源代码8 项目: codebuff   文件: ImmutableMultiset.java
@Override
public UnmodifiableIterator<E> iterator() {
  final Iterator<Entry<E>> entryIterator = entrySet().iterator();
  return new UnmodifiableIterator<E>() {
    int remaining;

    E element;


    @Override
    public boolean hasNext() {
      return (remaining > 0) || entryIterator.hasNext();
    }

    @Override
    public E next() {
      if (remaining <= 0) {
        Entry<E> entry = entryIterator.next();
        element = entry.getElement();
        remaining = entry.getCount();
      }
      remaining--;
      return element;
    }
  };
}
 
源代码9 项目: codebuff   文件: ImmutableMultiset.java
SerializedForm(Multiset<?> multiset) {
  int distinct = multiset.entrySet().size();
  elements = new Object[distinct];
  counts = new int[distinct];
  int i = 0;
  for (Entry<?> entry : multiset.entrySet()) {
    elements[i] = entry.getElement();
    counts[i] = entry.getCount();
    i++;
  }
}
 
源代码10 项目: codebuff   文件: Multisets.java
@Override
public Iterator<E> iterator() {
  return new TransformedIterator<Entry<E>, E>(multiset().entrySet().iterator()) {
    @Override
    E transform(Entry<E> entry) {
      return entry.getElement();
    }
  };
}
 
源代码11 项目: codebuff   文件: ImmutableMultiset.java
SerializedForm(Multiset<?> multiset) {
  int distinct = multiset.entrySet().size();
  elements = new Object[distinct];
  counts = new int[distinct];
  int i = 0;
  for (Entry<?> entry : multiset.entrySet()) {
    elements[i] = entry.getElement();
    counts[i] = entry.getCount();
    i++;
  }
}
 
源代码12 项目: codebuff   文件: Multisets.java
@Override
public Iterator<E> iterator() {
  return new TransformedIterator<Entry<E>, E>(multiset().entrySet().iterator()) {
    @Override
    E transform(Entry<E> entry) {
      return entry.getElement();
    }
  };
}
 
源代码13 项目: codebuff   文件: ImmutableMultiset.java
SerializedForm(Multiset<?> multiset) {
  int distinct = multiset.entrySet().size();
  elements = new Object[distinct];
  counts = new int[distinct];
  int i = 0;
  for (Entry<?> entry : multiset.entrySet()) {
    elements[i] = entry.getElement();
    counts[i] = entry.getCount();
    i++;
  }
}
 
源代码14 项目: codebuff   文件: Multisets.java
@Override
public Iterator<E> iterator() {
  return new TransformedIterator<Entry<E>, E>(multiset().entrySet().iterator()) {
    @Override
    E transform(Entry<E> entry) {
      return entry.getElement();
    }
  };
}
 
源代码15 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrThrow(Entry<E> entry) {
  if (entry == null) {
    throw new NoSuchElementException();
  }
  return entry.getElement();
}
 
源代码16 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrNull(@Nullable Entry<E> entry) {
  return (entry == null) ? null : entry.getElement();
}
 
源代码17 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrThrow(Entry<E> entry) {
  if (entry == null) {
    throw new NoSuchElementException();
  }
  return entry.getElement();
}
 
源代码18 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrThrow(Entry<E> entry) {
  if (entry == null) {
    throw new NoSuchElementException();
  }
  return entry.getElement();
}
 
源代码19 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrNull(@Nullable Entry<E> entry) {
  return (entry == null) ? null : entry.getElement();
}
 
源代码20 项目: codebuff   文件: SortedMultisets.java
private static <E> E getElementOrNull(@Nullable Entry<E> entry) {
  return (entry == null) ? null : entry.getElement();
}