Package linda

Examples of linda.LindaArgs

35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
    while (true) {
      synchronized (tuplespaceEx) {
        // Look for sub patterns (may be speedup)
        if (tuplespaceEx.contains(pattern)) {
          LindaArgs result = new LindaArgs(pattern);
          pattern.applyResult(result);
          if (remove) {
            tuplespaceEx.remove(pattern); 
          }
          return true;
        }
       
        // More general search
        for (Iterator<LindaArgs> iterator = tuplespaceEx.iterator(); iterator.hasNext();) {
          LindaArgs tuple = iterator.next();
          if (tuple.matchTuples(pattern)) {
            LindaArgs result = new LindaArgs(tuple);
            pattern.applyResult(result);
            if (remove) {
              iterator.remove(); 
            }
            return true;
View Full Code Here
40
41
42
43
44
45
46
47
    room.increment();
    room.getChanges().awaitUninterruptibly();
  }

  protected void notifyNext(List<Integer> typesPath) {
    LindaArgs newTupleForwarded = newTuples.get(typesPath);
    signalTuple(typesPath, newTupleForwarded);
  }
View Full Code Here
58
59
60
61
62
63
64
65
66
67
68
    // Path specifies content of tuple
    // Leaf holds whole tuple.
    Lock lock = getLock(typesPath);
        lock.lock();
        try {
      LindaArgs temp = new LindaArgs(args);
      TupleSpaceTree leaf = typePathSpace.update_values(temp);
      leaf.setValue(args);
      leaf.increment();

      // Poke waiting threads.
View Full Code Here
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
    TupleSpaceTree leaf;
    Lock lock = getLock(typesPath);
        lock.lock();
        try {
        while (true) {
        LindaArgs temp = new LindaArgs(pattern);
        leaf = typePathSpace.find(temp);
        if (leaf != null) {
          if (decrement) {
            leaf.decrement(); 
          } else {
            notifyNext(typesPath);
          }
          break;
        }
        if (nonBlocking) {
          return false;
        }
        awaitTuple(typesPath, pattern);
        }
        } finally {
            lock.unlock();
        }

        pattern.applyResult(new LindaArgs(leaf.getValue()));
    return true;
  }
View Full Code Here
21
22
23
24
25
26
27
28
29
30
31
32
33
  @Override
  public void input(LindaArgs pattern) {
    while (true) {
      synchronized (tuplespace) {
        for (Iterator<LindaArgs> iterator = tuplespace.iterator(); iterator.hasNext();) {
          LindaArgs tuple = iterator.next();
          if (tuple.matchTuples(pattern)) {
            LindaArgs result = new LindaArgs(tuple);
            iterator.remove();
           
            pattern.applyResult(result);
            return;
          }
View Full Code Here
39
40
41
42
43
44
45
46
47
48
49
50
51
  @Override
  public void read(LindaArgs pattern) {
    while (true) {
      synchronized (tuplespace) {
        for (Iterator<LindaArgs> iterator = tuplespace.iterator(); iterator.hasNext();) {
          LindaArgs tuple = iterator.next();
          if (tuple.matchTuples(pattern)) {
            LindaArgs result = new LindaArgs(tuple);

            pattern.applyResult(result);
            return;
          }
        }
View Full Code Here
55
56
57
58
59
60
61
62
63
64
65
66
67
  @Override
  public boolean tryInput(LindaArgs pattern) {
    synchronized (tuplespace) {
      for (Iterator<LindaArgs> iterator = tuplespace.iterator(); iterator.hasNext();) {
        LindaArgs tuple = iterator.next();
        if (tuple.matchTuples(pattern)) {
          LindaArgs result = new LindaArgs(tuple);
          iterator.remove();

          pattern.applyResult(result);
          return true;
        }
View Full Code Here
73
74
75
76
77
78
79
80
81
82
83
84
85
  @Override
  public boolean tryRead(LindaArgs pattern) {
    synchronized (tuplespace) {
      for (Iterator<LindaArgs> iterator = tuplespace.iterator(); iterator.hasNext();) {
        LindaArgs tuple = iterator.next();
        if (tuple.matchTuples(pattern)) {
          LindaArgs result = new LindaArgs(tuple);

          pattern.applyResult(result);
          return true;
        }
      }
View Full Code Here
TOP

Related Classes of linda.LindaArgs

  • brute.BruteLinda
  • containsLinda.ContainsLinda
  • countedLinda.CountedTupleSpace
  • myLinda.MyTupleSpace
    • 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.