This page presents a very simple client to access a server that implements the file system we developed in Slice for a Simple File System. The C++ code shown here hardly differs from the code you would write for an ordinary C++ program. This is one of the biggest advantages of using Ice: accessing a remote object is as easy as accessing an ordinary, local C++ object. This allows you to put your effort where you should, namely, into developing your application logic instead of having to struggle with arcane networking APIs. This is true for the server side as well, meaning that you can develop distributed applications easily and efficiently.
We now have seen enough of the client-side C++ mapping to develop a complete client to access our remote file system. For reference, here is the Slice definition once more:
To exercise the file system, the client does a recursive listing of the file system, starting at the root directory. For each node in the file system, the client shows the name of the node and whether that node is a file or directory. If the node is a file, the client retrieves the contents of the file and prints them.
The body of the client code looks as follows:
- The code includes a few header files:
Always included in both client and server source files, provides definitions that are necessary for accessing the Ice run time.
The header that is generated by the Slice compiler from the Slice definitions in
The client uses the
iostreamlibrary to produce its output.
The implementation of
listRecursiveuses an STL iterator.
- The code adds
usingdeclarations for the
- The structure of the code in
mainfollows what we saw in Hello World Application. After initializing the run time, the client creates a proxy to the root directory of the file system. For this example, we assume that the server runs on the local host and listens using the default transport protocol (TCP/IP) at port 10000. The object identity of the root directory is known to be
- The client down-casts the proxy to
DirectoryPrxand passes that proxy to
listRecursive, which prints the contents of the file system.
Most of the work happens in
The function is passed a proxy to a directory to list, and an indent level. (The indent level increments with each recursive call and allows the code to print the name of each node at an indent level that corresponds to the depth of the tree at that node.)
listRecursive calls the list operation on the directory and iterates over the returned sequence of nodes:
- The code does a
checkedCastto narrow the
Nodeproxy to a
Directoryproxy, as well as an
uncheckedCastto narrow the
Nodeproxy to a
Fileproxy. Exactly one of those casts will succeed, so there is no need to call
checkedCasttwice: if the
Directory, the code uses the
DirectoryPrxreturned by the
checkedCast; if the
checkedCastfails, we know that the
Fileand, therefore, an
uncheckedCastis sufficient to get a
In general, if you know that a down-cast to a specific type will succeed, it is preferable to use an
uncheckedCastinstead of a
uncheckedCastdoes not incur any network traffic.
- The code prints the name of the file or directory and then, depending on which cast succeeded, prints
"(file)"following the name.
- The code checks the type of the node:
- If it is a directory, the code recurses, incrementing the indent level.
- If it is a file, the code calls the
readoperation on the file to retrieve the file contents and then iterates over the returned sequence of lines, printing each line.
Assume that we have a small file system consisting of two files and a directory as follows:
A small file system.
The output produced by the client for this file system is:
Note that, so far, our client (and server) are not very sophisticated:
- The transport protocol and address information are hard-wired into the code.
- The client makes more remote procedure calls than strictly necessary; with minor redesign of the Slice definitions, many of these calls can be avoided.
- Hello World Application
- Slice for a Simple File System
- Example of a File System Server in C++98
- Object Life Cycle