bundles/org.simantics.db.impl/src/org/simantics/db/impl/query/OrderedSet.java

   1 /*******************************************************************************
   2  * Copyright (c) 2007, 2010 Association for Decentralized Information Management
   3  * in Industry THTH ry.
   4  * All rights reserved. This program and the accompanying materials
   5  * are made available under the terms of the Eclipse Public License v1.0
   6  * which accompanies this distribution, and is available at
   7  * http://www.eclipse.org/legal/epl-v10.html
   8  *
   9  * Contributors:
  10  *     VTT Technical Research Centre of Finland - initial API and implementation
  11  *******************************************************************************/
  12 package org.simantics.db.impl.query;
  13
  14 import java.util.ArrayList;
  15 import java.util.concurrent.Semaphore;
  16
  17 import org.simantics.db.common.exception.DebugException;
  18 import org.simantics.db.impl.graph.ReadGraphImpl;
  19 import org.simantics.db.impl.procedure.IntProcedureAdapter;
  20 import org.simantics.db.procedure.ListenerBase;
  21
  22 final public class OrderedSet extends CollectionUnaryQuery<IntProcedure> {
  23
  24         public OrderedSet(final int r) {
  25         super(r);
  26     }
  27
  28     final static OrderedSet entry(final QueryProcessor provider, final int r) {
  29
  30         return (OrderedSet)provider.cache.orderedSetMap.get(r);
  31
  32     }
  33
  34     final static void runner(ReadGraphImpl graph, final int r, final QueryProcessor provider, OrderedSet cached, final CacheEntry parent, ListenerBase listener, final IntProcedure procedure) {
  35
  36         OrderedSet entry = cached != null ? cached : (OrderedSet)provider.cache.orderedSetMap.get(r);
  37         if(entry == null) {
  38
  39                 entry = new OrderedSet(r);
  40                 entry.setPending();
  41                 entry.clearResult(provider.querySupport);
  42                 entry.putEntry(provider);
  43
  44             provider.performForEach(graph, entry, parent, listener, procedure);
  45
  46         } else {
  47
  48             if(entry.isPending()) {
  49                 synchronized(entry) {
  50                     if(entry.isPending()) {
  51                         throw new IllegalStateException();
  52 //                      if(entry.procs == null) entry.procs = new ArrayList<IntProcedure>();
  53 //                      entry.procs.add(procedure);
  54 //                        provider.registerDependencies(graph, entry, parent, listener, procedure, false);
  55 //                      return;
  56                     }
  57                 }
  58             }
  59             provider.performForEach(graph, entry, parent, listener, procedure);
  60         }
  61
  62     }
  63
  64     final public static void queryEach(ReadGraphImpl graph, final int r, final QueryProcessor provider, final CacheEntry parent, final ListenerBase listener, final IntProcedure procedure) {
  65
  66         assert(r != 0);
  67
  68         final OrderedSet entry = (OrderedSet)provider.cache.orderedSetMap.get(r);
  69
  70         if(parent == null && !(listener != null)) {
  71                 if(entry != null && entry.isReady()) {
  72                         entry.performFromCache(graph, provider, procedure);
  73                         return;
  74                 }
  75         }
  76
  77         runner(graph, r, provider, entry, parent, listener, procedure);
  78
  79     }
  80
  81     @Override
  82     public UnaryQuery<IntProcedure> getEntry(QueryProcessor provider) {
  83         return provider.cache.orderedSetMap.get(id);
  84     }
  85
  86         @Override
  87         public void putEntry(QueryProcessor provider) {
  88             provider.cache.orderedSetMap.put(id, this);
  89         }
  90
  91         @Override
  92         final public void removeEntry(QueryProcessor provider) {
  93         provider.cache.orderedSetMap.remove(id);
  94         }
  95
  96         private int current = 0;
  97
  98         private boolean nextElement(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
  99
 100                 provider.querySupport.ensureLoaded(graph, current);
 101
 102                 boolean found = provider.querySupport.getObjects(graph, current, id, new IntProcedure() {
 103
 104                         @Override
 105                         public void execute(ReadGraphImpl graph, int i) {
 106                                 if(i != id) {
 107                                         addOrSet(i);
 108                                         procedure.execute(graph, i);
 109                                 }
 110                                 current = i;
 111                         }
 112
 113                         @Override
 114                         public void exception(ReadGraphImpl graph, Throwable t) {
 115                                 if(DebugException.DEBUG) new DebugException(t).printStackTrace();
 116                                 procedure.exception(graph, t);
 117                         }
 118
 119                         @Override
 120                         public void finished(ReadGraphImpl graph) {
 121                         }
 122
 123                 });
 124
 125                 if(!found) current = id;
 126
 127                 if(current == id) {
 128                         finish(graph, provider);
 129                         procedure.finished(graph);
 130                         return false;
 131                 } else {
 132                         return true;
 133                 }
 134
 135         }
 136
 137     @Override
 138     public void clearResult(QuerySupport support) {
 139         current = id;
 140         setResult(new IntArray());
 141     }
 142
 143     @Override
 144     public Object computeForEach(ReadGraphImpl graph, final QueryProcessor provider, final IntProcedure procedure, final boolean store) {
 145
 146         while(nextElement(graph, provider, procedure, store));
 147
 148         return getResult();
 149
 150     }
 151
 152     @Override
 153     public String toString() {
 154         return "OrderedSet[" + id + "]";
 155     }
 156
 157     final private void finish(ReadGraphImpl graph, QueryProcessor provider) {
 158
 159         assert(isPending());
 160
 161 //        ArrayList<IntProcedure> p = null;
 162
 163         synchronized(this) {
 164
 165                 setReady();
 166 //            p = procs;
 167 //            procs = null;
 168
 169         }
 170
 171 //        if(p != null) {
 172 //              IntArray v = (IntArray)getResult();
 173 //              if(v.data == null) {
 174 //                  if(v.sizeOrData != IntArray.NO_DATA) {
 175 //                      for(IntProcedure proc : p) proc.execute(graph, v.sizeOrData);
 176 //                  }
 177 //              } else {
 178 //                  for(IntProcedure proc : p) {
 179 //                      for(int i = 0;i < v.sizeOrData ; i++) proc.execute(graph, v.data[i]);
 180 //                  }
 181 //              }
 182 //              for(IntProcedure proc : p) proc.finished(graph);
 183 //        }
 184
 185     }
 186
 187     final public void addOrSet(int add) {
 188
 189         assert(isPending());
 190
 191         IntArray value = (IntArray)getResult();
 192         value.add(add);
 193
 194     }
 195
 196     @Override
 197     public Object performFromCache(ReadGraphImpl graph, QueryProcessor provider, final IntProcedure procedure) {
 198
 199         assert(isReady());
 200
 201         if(handleException(graph, procedure)) return EXCEPTED;
 202
 203         final IntArray value = (IntArray)getResult();
 204         if(value.data == null) {
 205             if(value.sizeOrData != IntArray.NO_DATA) procedure.execute(graph, value.sizeOrData);
 206         } else {
 207             for(int i = 0;i < value.sizeOrData ; i++) procedure.execute(graph, value.data[i]);
 208         }
 209
 210         procedure.finished(graph);
 211
 212         return value;
 213
 214     }
 215
 216     @Override
 217     public void recompute(ReadGraphImpl graph, QueryProcessor provider) {
 218
 219         final Semaphore s = new Semaphore(0);
 220
 221         computeForEach(graph, provider, new IntProcedureAdapter() {
 222
 223             @Override
 224             public void finished(ReadGraphImpl graph) {
 225                 s.release();
 226             }
 227
 228                         @Override
 229                         public void exception(ReadGraphImpl graph, Throwable t) {
 230                                 throw new Error("Error in recompute.", t);
 231             }
 232
 233         }, true);
 234
 235         while(!s.tryAcquire()) {
 236                 provider.resume(graph);
 237         }
 238
 239     }
 240
 241 }