net.sf.juoserver.protocol
Class MovementAck

java.lang.Object
  extended by net.sf.juoserver.protocol.AbstractMessage
      extended by net.sf.juoserver.protocol.MovementAck
All Implemented Interfaces:
Serializable, Message

public class MovementAck
extends AbstractMessage

See Also:
Serialized Form

Field Summary
protected static int CODE
           
 
Fields inherited from class net.sf.juoserver.protocol.AbstractMessage
NO_CODE, UTF8
 
Constructor Summary
MovementAck(byte[] contents)
           
MovementAck(int sequence, Notoriety notoriety)
           
 
Method Summary
 ByteBuffer encode()
          Encodes this message into a byte array packet.
 boolean equals(Object obj)
           
 Notoriety getNotoriety()
           
 int getSequence()
           
 int hashCode()
           
 String toString()
           
 
Methods inherited from class net.sf.juoserver.protocol.AbstractMessage
getCode, getLength, getName, isCompressed, wrapContents, wrapContents
 
Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait
 

Field Detail

CODE

protected static final int CODE
See Also:
Constant Field Values
Constructor Detail

MovementAck

public MovementAck(byte[] contents)

MovementAck

public MovementAck(int sequence,
                   Notoriety notoriety)
Method Detail

encode

public ByteBuffer encode()
Description copied from interface: Message
Encodes this message into a byte array packet.

The array is wrapped in a byte buffer in order to let subclasses append their contents.

Specified by:
encode in interface Message
Overrides:
encode in class AbstractMessage
Returns:
the byte array representation (a.k.a. packet) of this message

getSequence

public int getSequence()

getNotoriety

public Notoriety getNotoriety()

hashCode

public int hashCode()
Specified by:
hashCode in class AbstractMessage

equals

public boolean equals(Object obj)
Specified by:
equals in class AbstractMessage

toString

public String toString()
Overrides:
toString in class Object


Copyright © 2010-2012. All Rights Reserved.