All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.getperka.flatpack.collections.DirtyMap Maven / Gradle / Ivy

There is a newer version: 2.21.0
Show newest version
/*
 * #%L
 * FlatPack serialization code
 * %%
 * Copyright (C) 2012 Perka Inc.
 * %%
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 * 
 *      http://www.apache.org/licenses/LICENSE-2.0
 * 
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 * #L%
 */
package com.getperka.flatpack.collections;

import java.util.Collection;
import java.util.Iterator;
import java.util.Map;
import java.util.Set;

/**
 * A delegating {@link Map} implementation that will call {@link DirtyFlag#set()} when it is
 * mutated.
 */
public class DirtyMap implements Map {
  /**
   * Intercepts calls to {@link #setValue(Object)}.
   */
  static class DirtyEntry implements Map.Entry {
    private final Map.Entry delegate;

    private final DirtyFlag dirty;

    public DirtyEntry(Map.Entry delegate, DirtyFlag dirty) {
      this.delegate = delegate;
      this.dirty = dirty;
    }

    @Override
    public boolean equals(Object o) {
      return this == o || delegate.equals(o);
    }

    @Override
    public K getKey() {
      return delegate.getKey();
    }

    @Override
    public V getValue() {
      return delegate.getValue();
    }

    @Override
    public int hashCode() {
      return delegate.hashCode();
    }

    @Override
    public V setValue(V value) {
      dirty.set();
      return delegate.setValue(value);
    }
  }

  /**
   * Wraps any entries returned from the iterator as a {@link DirtyEntry}.
   */
  static class DirtyEntrySet extends DirtySet> {
    private final DirtyFlag dirty;

    public DirtyEntrySet(Set> delegate, DirtyFlag dirty) {
      super(delegate, dirty);
      this.dirty = dirty;
    }

    @Override
    public Iterator> iterator() {
      final Iterator> it = super.iterator();
      return new Iterator>() {
        @Override
        public boolean hasNext() {
          return it.hasNext();
        }

        @Override
        public java.util.Map.Entry next() {
          return new DirtyEntry(it.next(), dirty);
        }

        @Override
        public void remove() {
          it.remove();
        }
      };
    }

  }

  private final Map delegate;

  private final DirtyFlag dirty;

  public DirtyMap(Map delegate, DirtyFlag dirty) {
    this.delegate = delegate;
    this.dirty = dirty;
  }

  @Override
  public void clear() {
    dirty.set();
    delegate.clear();
  }

  @Override
  public boolean containsKey(Object key) {
    return delegate.containsKey(key);
  }

  @Override
  public boolean containsValue(Object value) {
    return delegate.containsValue(value);
  }

  @Override
  public Set> entrySet() {
    return new DirtyEntrySet(delegate.entrySet(), dirty);
  }

  @Override
  public boolean equals(Object o) {
    return this == o || delegate.equals(o);
  }

  @Override
  public V get(Object key) {
    return delegate.get(key);
  }

  @Override
  public int hashCode() {
    return delegate.hashCode();
  }

  @Override
  public boolean isEmpty() {
    return delegate.isEmpty();
  }

  @Override
  public Set keySet() {
    return new DirtySet(delegate.keySet(), dirty);
  }

  @Override
  public V put(K key, V value) {
    dirty.set();
    return delegate.put(key, value);
  }

  @Override
  public void putAll(Map m) {
    dirty.set();
    delegate.putAll(m);
  }

  @Override
  public V remove(Object key) {
    dirty.set();
    return delegate.remove(key);
  }

  @Override
  public int size() {
    return delegate.size();
  }

  @Override
  public Collection values() {
    return delegate.values();
  }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy