Uses of Class
net.tomp2p.message.Message.Command

Packages that use Message.Command
net.tomp2p.connection   
net.tomp2p.message   
net.tomp2p.p2p   
net.tomp2p.rpc   
 

Uses of Message.Command in net.tomp2p.connection
 

Methods in net.tomp2p.connection with parameters of type Message.Command
 void DispatcherRequest.registerIoHandler(PeerAddress sender, ReplyHandler ioHandler, Message.Command... names)
          Registers a handler with this dispatcher.
 

Uses of Message.Command in net.tomp2p.message
 

Methods in net.tomp2p.message that return Message.Command
 Message.Command Message.getCommand()
          Command of the message, such as GET, PING, etc.
static Message.Command Message.Command.valueOf(String name)
          Returns the enum constant of this type with the specified name.
static Message.Command[] Message.Command.values()
          Returns an array containing the constants of this enum type, in the order they are declared.
 

Methods in net.tomp2p.message with parameters of type Message.Command
 Message Message.setCommand(Message.Command command)
          Command of the message, such as GET, PING, etc.
 

Uses of Message.Command in net.tomp2p.p2p
 

Methods in net.tomp2p.p2p with parameters of type Message.Command
 FutureRouting Routing.route(Number160 locationKey, Number160 domainKey, Collection<Number160> contentKeys, Message.Command command, int maxDirectHits, int maxNoNewInfo, int maxFailures, int parallel, boolean isDigest)
          Looks for a route to the given locationKey
 

Uses of Message.Command in net.tomp2p.rpc
 

Methods in net.tomp2p.rpc with parameters of type Message.Command
 FutureResponse NeighborRPC.closeNeighbors(PeerAddress remoteNode, Number160 locationKey, Number160 domainKey, Collection<Number160> contentKeys, Message.Command command, boolean isDigest, boolean forceSocket)
           
 Message ReplyHandler.createMessage(PeerAddress recipient, Message.Command name, Message.Type type)
           
protected  void ReplyHandler.registerIoHandler(Message.Command... names)
           
 



Copyright © 2011. All Rights Reserved.