Package de.danielkullmann.hackvm

Examples of de.danielkullmann.hackvm.HackVM$Command

86
87
88
89
90
91
92
    /**
     * Create an instance of {@link Command }
     *
     */
    public Command createCommand() {
        return new Command();
    }
View Full Code Here
7
8
9
10
11
12
13
14
15
16
import de.danielkullmann.hackvm.VMState;

public class Test3 extends TestCase {

  public void testFibonacci() {
    HackVM vm = new HackVM();
    VMState result = vm.execute("1p 48*P 1p 48*P 2p 48*P 3p 48*P 5p", "", "");
    assertNull( result.getError() );
    assertEquals( result.getOutput(), "1 1 2 3 5" );
  }
View Full Code Here
14
15
16
17
18
19
20
21
22
23
24
25
    assertNull( result.getError() );
    assertEquals( result.getOutput(), "1 1 2 3 5" );
  }

  public void testReverseList() {
    HackVM vm = new HackVM();
    //                           setup   loop loop end?      copy one
    VMState result = vm.execute("0^2v+1- 1^1^ 1^1^:0^1-*55*? <1v<2^>2^> 1v1+ 1v1- 8$!", "5, 1024", "1024=5,6,7,8,9");
    HashMap<Integer, Integer> m = HackVM.parseMemory( "1024=9,8,7,6,5" );
    assertNull( result.getError() );
    assertEquals( result.getMemory(), m );
  }
View Full Code Here
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
public class AddTwoAndPrint implements SolutionCheck {

  @Override
  public boolean check(String program) {
    Random r = new Random();
    HackVM vm = new HackVM();
    for (int i = 0; i < 100; i++) {
      int n1 = r.nextInt();
      int n2 = r.nextInt();
      Stack<Integer> stack = HackVM.parseStack( n1 + " " + n2 );
      VMState result = vm.execute(program, stack, null);
      if ( ! result.getOutput().equals( "" + (n1+n2) ) ) return false;
    }
    return true;
  }
View Full Code Here
15
16
17
18
19
20
21
22
23
24
25
26
  public static void main(String[] args) {
    new ReverseList().run();
  }

  private void run() {
    HackVM vm = new HackVM();
    //          setup   loop loop end?      copy one
    vm.addObserver( this );
    VMState result = vm.execute("0^2v+1- 1^1^ 1^1^:0^1-*55*? <1v<2^>2^> 1v1+ 1v1- 8$!", "5, 1024", "1024=5,6,7,8,9");
    System.out.println( result.getError() );
    System.out.println( result.getMemory() );
  }
View Full Code Here
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
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
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
import de.danielkullmann.hackvm.VMState;

public class Test1 extends TestCase {

  public void test1() {
    HackVM vm = new HackVM();

    VMState result = vm.execute( " ", "", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "p", "1", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );
    assertTrue( result.getOutput().equals( "1" ) );

    result = vm.execute( "P", "65", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );
    assertTrue( result.getOutput().equals( "A" ) );

    for (int i = 0; i < 10; i++) {
      result = vm.execute( ""+i, "", null );
      assertNull( result.getError() );
      assertTrue( result.getStack().size() == 1 );
      assertTrue( result.getStack().pop() == i );
    }

    result = vm.execute( "+", "7, 8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 15 );

    result = vm.execute( "-", "7, 8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == -1 );

    result = vm.execute( "*", "7, 8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 56 );

    result = vm.execute( "/", "6, 3", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 2 );
   
    result = vm.execute( ":", "6, 3", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 1 );
   
    result = vm.execute( ":", "3, 6", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == -1 );
   
    result = vm.execute( ":", "8, 8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 0 );
   
    result = vm.execute( "g!1", "2", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 1 );

    result = vm.execute( "g!1", "1", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "?!1", "0, 2", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 1 );

    result = vm.execute( "?!1", "1, 2", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "      c1!", "8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 6 );

    result = vm.execute( "      $1!", "8", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "<", "1", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 0 );

    result = vm.execute( "><", "1, 2, 1", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 2 );
   
    result = vm.execute( "^", "4, 0", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 2 );
    assertTrue( result.getStack().pop() == 4 );
    assertTrue( result.getStack().pop() == 4 );

    result = vm.execute( "^", "1, 2, 3, 4, 2", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 5 );
    assertTrue( result.getStack().pop() == 2 );
    assertTrue( result.getStack().pop() == 4 );
    assertTrue( result.getStack().pop() == 3 );
    assertTrue( result.getStack().pop() == 2 );
    assertTrue( result.getStack().pop() == 1 );

    result = vm.execute( "v", "4, 0", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 1 );
    assertTrue( result.getStack().peek() == 4 );

    result = vm.execute( "v", "1, 2, 3, 4, 2", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 4 );
    assertTrue( result.getStack().pop() == 2 );
    assertTrue( result.getStack().pop() == 4 );
    assertTrue( result.getStack().pop() == 3 );
    assertTrue( result.getStack().pop() == 1 );
 
    result = vm.execute( "d", "1", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "ddddd", "1, 2, 3, 4, 5, 6, 7, 8, 9", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 4 );
    assertTrue( result.getStack().pop() == 4 );
    assertTrue( result.getStack().pop() == 3 );
    assertTrue( result.getStack().pop() == 2 );
    assertTrue( result.getStack().pop() == 1 );

    result = vm.execute( "!11111", "", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 0 );

    result = vm.execute( "11!111", "", null );
    assertNull( result.getError() );
    assertTrue( result.getStack().size() == 2 );

  }
View Full Code Here
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
        } else {
          throw new IOException("Unexpected character");
        }
      }
      try {
        out.add(new Command(bytes));
      } finally {
        bytes = null;
        arguments = 0;
      }
    } else if (in.readByte() == '*') {
      long l = readLong(in);
      if (l > Integer.MAX_VALUE) {
        throw new IllegalArgumentException("Java only supports arrays up to " + Integer.MAX_VALUE + " in size");
      }
      int numArgs = (int) l;
      if (numArgs < 0) {
        throw new RedisException("Invalid size: " + numArgs);
      }
      bytes = new byte[numArgs][];
      checkpoint();
      decode(ctx, in, out);
    } else {
      // Go backwards one
      in.readerIndex(in.readerIndex() - 1);
      // Read command -- can't be interupted
      byte[][] b = new byte[1][];
      b[0] = in.readBytes(in.bytesBefore((byte) '\r')).array();
      in.skipBytes(2);
      out.add(new Command(b, true));
    }
  }
View Full Code Here
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
        boolean isOff = _hasTrueInput(off);
        boolean isOn = _hasTrueInput(on);

        if ((brightLevel >= 0) && (brightLevel <= 100)) {
            _transmit(new Command((_destination), x10.Command.BRIGHT,
                    brightLevel));
        }

        if ((dimLevel >= 0) && (dimLevel <= 100)) {
            _transmit(new Command((_destination), x10.Command.DIM, dimLevel));
        }

        if (isOn) {
            _transmit(new Command((_destination), x10.Command.ON));
        }

        if (isOff) {
            _transmit(new Command((_destination), x10.Command.OFF));
        }
    }
View Full Code Here
86
87
88
89
90
91
92
93
94
95
96
    public void fire() throws IllegalActionException {
        super.fire();

        // Check whether a command is ready.
        if (_commandReady()) {
            Command command = _getCommand();
            receivedCommand.send(0, new StringToken(_commandToString(command)));
        } else {
            receivedCommand.send(0, _EMPTY_STRING);
        }
    }
View Full Code Here
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
    public void fire() throws IllegalActionException {
        super.fire();

        // Check whether a command is ready
        if (_commandReady()) {
            Command sensedCommand = _getCommand();
            byte function = sensedCommand.getFunctionByte();
            byte functionOfInterest = Command.BRIGHT;
            String commandValue = command.stringValue();

            if (!commandValue.equals("BRIGHT")) {
                functionOfInterest = Command.DIM;
            }

            String sensedHouseCode = "" + sensedCommand.getHouseCode();
            int sensedUnitCode = sensedCommand.getUnitCode();

            String houseCodeValue = houseCode.stringValue();
            int unitCodeValue = ((IntToken) unitCode.getToken()).intValue();

            if (sensedHouseCode.equals(houseCodeValue)
                    && (sensedUnitCode == unitCodeValue)
                    && (function == functionOfInterest)) {
                level.send(0, new IntToken(sensedCommand.getLevel()));
            } else {
                level.send(0, _NO_COMMAND_TOKEN);
            }
        } else {
            level.send(0, _NO_COMMAND_TOKEN);
View Full Code Here
TOP

Related Classes of de.danielkullmann.hackvm.HackVM$Command

  • com.persistit.util.ArgParser
  • com.sun.xml.registry.common.tools.bindings_v3.ObjectFactory
  • de.danielkullmann.hackvm.solutions.AddTwoAndPrint
  • de.danielkullmann.hackvm.tests.ReverseList
  • de.danielkullmann.hackvm.tests.Test1
  • de.danielkullmann.hackvm.tests.Test3
  • net.sf.katta.util.ZkConfiguration
  • org.apache.commons.cli.Option
  • org.apache.commons.cli.Options
  • org.apache.hadoop.gateway.services.security.AliasService
    • 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.