/** * Copyright (c) 2011, SOCIETIES Consortium (WATERFORD INSTITUTE OF TECHNOLOGY (TSSG), HERIOT-WATT UNIVERSITY (HWU), SOLUTA.NET * (SN), GERMAN AEROSPACE CENTRE (Deutsches Zentrum fuer Luft- und Raumfahrt e.V.) (DLR), Zavod za varnostne tehnologije * informacijske družbe in elektronsko poslovanje (SETCCE), INSTITUTE OF COMMUNICATION AND COMPUTER SYSTEMS (ICCS), LAKE * COMMUNICATIONS (LAKE), INTEL PERFORMANCE LEARNING SOLUTIONS LTD (INTEL), PORTUGAL TELECOM INOVAÇÃO, SA (PTIN), IBM Corp., * INSTITUT TELECOM (ITSUD), AMITEC DIACHYTI EFYIA PLIROFORIKI KAI EPIKINONIES ETERIA PERIORISMENIS EFTHINIS (AMITEC), TELECOM * ITALIA S.p.a.(TI), TRIALOG (TRIALOG), Stiftelsen SINTEF (SINTEF), NEC EUROPE LTD (NEC)) * All rights reserved. * * Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following * conditions are met: * * 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. * * 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following * disclaimer in the documentation and/or other materials provided with the distribution. * * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, * BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT * SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. */ package org.societies.privacytrust.privacyprotection.privacypreferencemanager.merging; import java.util.ArrayList; import java.util.List; public class ContextSnapshot { List<SingleContextAttributeSnapshot> snapshot; public ContextSnapshot(){ snapshot = new ArrayList<SingleContextAttributeSnapshot>(); } public void addSnapshot(SingleContextAttributeSnapshot scas){ if (containsSnapshot(scas)){ return; }else{ snapshot.add(scas); } } public boolean containsSnapshot(SingleContextAttributeSnapshot scas){ for (SingleContextAttributeSnapshot s : snapshot){ if (s.getId().equals(scas.getId())){ return true; } } return false; } public boolean equalsSnapshot(SingleContextAttributeSnapshot scas){ for (SingleContextAttributeSnapshot s: snapshot){ if ((s.getId().equals(scas.getId())) && (s.getValue().equalsIgnoreCase(scas.getValue()))){ return true; } } return false; } public void removeSnapshot(SingleContextAttributeSnapshot scas){ if (containsSnapshot(scas)){ for (SingleContextAttributeSnapshot s : snapshot){ if (s.getId().equals(scas.getId())){ snapshot.remove(s); return; } } } } public List<SingleContextAttributeSnapshot> getList(){ return this.snapshot; } public List<SingleContextAttributeSnapshot> getDiff(ContextSnapshot s){ List<SingleContextAttributeSnapshot> diff = new ArrayList<SingleContextAttributeSnapshot>(); List<SingleContextAttributeSnapshot> fullList = getList(); for (SingleContextAttributeSnapshot single : fullList){ if (!s.equalsSnapshot(single)){ diff.add(single); } } List<SingleContextAttributeSnapshot> sFullList = s.getList(); for (SingleContextAttributeSnapshot single : sFullList){ if (!equalsSnapshot(single)){ diff.add(single); } } return diff; } public List<SingleContextAttributeSnapshot> getMatches(ContextSnapshot s){ List<SingleContextAttributeSnapshot> matches = new ArrayList<SingleContextAttributeSnapshot>(); List<SingleContextAttributeSnapshot> fullList = getList(); for (SingleContextAttributeSnapshot single: fullList){ if (s.equalsSnapshot(single)){ matches.add(single); } } return matches; } }