Package org.waveprotocol.wave.model.operation

Examples of org.waveprotocol.wave.model.operation.TransformException

116
117
118
119
120
121
122
123
      Affine undoAndDoOther = serverOp.of(clientOp.inverse());
      return new OperationPair<Affine>(
          new Affine(serverOp.finalState, clientOp.a, clientOp.b),
          clientOp.of(undoAndDoOther, undoAndDoOther.finalState));
    } catch(OperationException e) {
      throw new TransformException(e.getMessage());
    }
  }
View Full Code Here
174
175
176
177
178
179
180
181
182
183
184
    int serverIndex = 0;
    while (clientIndex < clientOp.size()) {
      clientOp.applyComponent(clientIndex++, clientTarget);
      while (clientPosition.get() > 0) {
        if (serverIndex >= serverOp.size()) {
          throw new TransformException("Ran out of " + serverOp.size()
              + " server op components after " + clientIndex + " of " + clientOp.size()
              + " client op components, with " + clientPosition.get() + " spare positions");
        }
        serverOp.applyComponent(serverIndex++, serverTarget);
      }
View Full Code Here
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
      int deletionIndex = 0;
      while (preservationIndex < preservationOp.size()) {
        preservationOp.applyComponent(preservationIndex++, preservationTarget);
        while (preservationPosition.get() > 0) {
          if (deletionIndex >= deletionOp.size()) {
            throw new TransformException("Ran out of " + deletionOp.size()
                + " deletion op components after " + preservationIndex + " of "
                + preservationOp.size() + " preservation op components, with "
                + preservationPosition.get() + " spare positions");
          }
          deletionOp.applyComponent(deletionIndex++, deletionTarget);
        }
      }
      while (deletionIndex < deletionOp.size()) {
        deletionOp.applyComponent(deletionIndex++, deletionTarget);
      }
      preservationOp = preservationTarget.finish();
      transformedDeletionOp = deletionTarget.finish();
    } catch (InternalTransformException e) {
      throw new TransformException(e.getMessage());
    }
    return new Pair<DocOp, Pair<DocOp, DocOp>>(preservationOp,
        transformedDeletionOp);
  }
View Full Code Here
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
      int serverIndex = 0;
      while (clientIndex < clientOp.size()) {
        clientOp.applyComponent(clientIndex++, clientTarget);
        while (clientPosition.get() > 0) {
          if (serverIndex >= serverOp.size()) {
            throw new TransformException("Ran out of " + serverOp.size()
                + " server op components after " + clientIndex + " of " + clientOp.size()
                + " client op components, with " + clientPosition.get() + " spare positions");
          }
          serverOp.applyComponent(serverIndex++, serverTarget);
        }
      }
      while (serverIndex < serverOp.size()) {
        serverOp.applyComponent(serverIndex++, serverTarget);
      }
      clientOp = clientTarget.finish();
      serverOp = serverTarget.finish();
    } catch (InternalTransformException e) {
      throw new TransformException(e.getMessage());
    }
    return new OperationPair<DocOp>(clientOp, serverOp);
  }
View Full Code Here
357
358
359
360
361
362
363
364
365
366
367
    int deletionIndex = 0;
    while (insertionIndex < insertionOp.size()) {
      insertionOp.applyComponent(insertionIndex++, insertionTarget);
      while (insertionPosition.get() > 0) {
        if (deletionIndex >= deletionOp.size()) {
          throw new TransformException("Ran out of " + deletionOp.size()
              + " deletion op components after " + insertionIndex + " of " + insertionOp.size()
              + " insertion op components, with " + insertionPosition.get() + " spare positions");
        }
        deletionOp.applyComponent(deletionIndex++, deletionTarget);
      }
View Full Code Here
334
335
336
337
338
339
340
341
342
343
344
    int preservationIndex = 0;
    while (insertionIndex < insertionOp.size()) {
      insertionOp.applyComponent(insertionIndex++, insertionTarget);
      while (insertionPosition.get() > 0) {
        if (preservationIndex >= preservationOp.size()) {
          throw new TransformException("Ran out of " + preservationOp.size()
              + " noninsertion op components after " + insertionIndex + " of " + insertionOp.size()
              + " insertion op components, with " + insertionPosition.get() + " spare positions");
        }
        preservationOp.applyComponent(preservationIndex++, preservationTarget);
      }
View Full Code Here
97
98
99
100
101
102
103
104
      serverCollector.add(sd);
      return new OperationPair<DocOp>(
          clientCollector.composeAll(), serverCollector.composeAll());
    // We're catching runtime exceptions here, but checked exceptions may be better.
    } catch (RuntimeException e) {
      throw new TransformException(e);
    }
  }
View Full Code Here
306
307
308
309
310
311
312
313
314
315
316
    int deletionIndex = 0;
    while (preservationIndex < preservationOp.size()) {
      preservationOp.applyComponent(preservationIndex++, preservationTarget);
      while (preservationPosition.get() > 0) {
        if (deletionIndex >= deletionOp.size()) {
          throw new TransformException("Ran out of " + deletionOp.size()
              + " deletion op components after " + preservationIndex + " of "
              + preservationOp.size() + " preservation op components, with "
              + preservationPosition.get() + " spare positions");
        }
        deletionOp.applyComponent(deletionIndex++, deletionTarget);
View Full Code Here
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
      int serverIndex = 0;
      while (clientIndex < clientOp.size()) {
        clientOp.applyComponent(clientIndex++, clientTarget);
        while (clientPosition.get() > 0) {
          if (serverIndex >= serverOp.size()) {
            throw new TransformException("Ran out of " + serverOp.size()
                + " server op components after " + clientIndex + " of " + clientOp.size()
                + " client op components, with " + clientPosition.get() + " spare positions");
          }
          serverOp.applyComponent(serverIndex++, serverTarget);
        }
      }
      while (serverIndex < serverOp.size()) {
        serverOp.applyComponent(serverIndex++, serverTarget);
      }
      clientOp = clientTarget.finish();
      serverOp = serverTarget.finish();
    } catch (InternalTransformException e) {
      throw new TransformException(e.getMessage());
    }
    return new OperationPair<DocOp>(clientOp, serverOp);
  }
View Full Code Here
112
113
114
115
116
117
118
119
120
   */
  private static void checkParticipantRemovalAndAddition(CoreRemoveParticipant removeParticipant,
      CoreAddParticipant addParticipant) throws TransformException {
    ParticipantId participantId = removeParticipant.getParticipantId();
    if (participantId.equals(addParticipant.getParticipantId())) {
      throw new TransformException("Transform error involving participant: " +
          participantId.getAddress());
    }
  }
View Full Code Here
TOP

Related Classes of org.waveprotocol.wave.model.operation.TransformException

  • org.waveprotocol.wave.concurrencycontrol.client.ConcurrencyControl
  • org.waveprotocol.wave.concurrencycontrol.server.ConcurrencyControlCore
  • org.waveprotocol.wave.model.document.operation.algorithm.InsertionNoninsertionTransformer
  • org.waveprotocol.wave.model.document.operation.algorithm.InsertionTransformer
  • org.waveprotocol.wave.model.document.operation.algorithm.NoninsertionTransformer
  • org.waveprotocol.wave.model.document.operation.algorithm.Transformer
  • org.waveprotocol.wave.model.operation.core.CoreTransform
  • org.waveprotocol.wave.model.operation.testing.RationalDomain
  • org.waveprotocol.wave.model.operation.testing.reference.AnnotationTamenessChecker
  • org.waveprotocol.wave.model.operation.testing.reference.DeletionDeletionTransformer
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.