Lines Matching full:be
28 % \copyrightdata{[to be supplied]}
54 intended to be taken as research, but rather it is an exposition on what we did
89 validated code that can be run without the need for
91 be as simple as possible for the developer, who can typically define all
105 a C++ programmer should be able to transparently exchange a strongly typed
107 programmer should be forced to write any code below the application layer
113 The same application code should be able to run against TCP stream sockets,
119 developer need not be concerned by this layer. Whether the service uses
121 All that matters is that the data can be read and written in a consistent,
126 it should be possible to add or remove fields in an object or alter the
177 same purpose and can be safely cast to their unsigned counterparts (most
182 A Thrift struct defines a common object to be used across languages. A struct
186 similar to a C struct definition. Fields may be annotated with an integer field
188 Field identifiers will be automatically assigned if omitted, though they are
211 \texttt{hash\_map} or Google's sparse hash map can be used in C++). The
213 primitives. Container elements may be of any valid Thrift type, including other
267 keyword may be added to a \texttt{void} function, which will generate code that does
271 the client will only be guaranteed that the request succeeded at the
275 method calls are acceptable or the transport is known to be reliable.)
297 write data. The origin and destination of the data are irrelevant; it may be a
330 programming language. New transport mechanisms can be easily defined as needed
341 stream. It can be used to write out a set of incoming Thrift requests to a file
342 on disk. The on-disk data can then be replayed from the log, either for
362 that allow it to be deterministically read and written by generated code.
419 a protocol encoder can be read by a matching protocol decoder. Further note
422 a struct may be implied by the stop field. This method is a convenience for
432 strings. If the protocol interface required reading or writing a list to be an
434 entire list before encoding any data. However, if the list can be written
444 the protocol to be safely parsed and decoded without any generated code
446 with a special \texttt{STOP} type. Because all the basic types can be read
447 deterministically, all structs (even those containing other structs) can be
452 can be very simply added into the transport layer, using the
467 of simplicity and clarity in the code. These alterations can easily be made
474 system must be able to support reading of old data from log files, as well as
507 Field identifiers can (and should) also be specified in function argument
521 Structs can be thought of as a dictionary where the identifiers are keys, and
529 When an unexpected field is encountered, it can be safely ignored and
530 discarded. When an expected field is not found, there must be some way to
585 situation the new server be rolled out prior to the new clients.
618 be broken down into agents or services that operate on inputs and outputs. In
703 Though Thrift was explicitly designed to be much more efficient and robust
705 services API we noticed that Thrift could be easily used to define our
731 objects public so that the objects can be used outside of the context
864 be accessed by multiple threads. For \texttt{Thread} class implementations,
870 thread library, \texttt{libpthread}, but the same would be true for WIN32 threads).
871 …es about when \texttt{ThreadMain}, a C thread's entry-point function, will be called. Therefore, i…
900 other. An application may create a set of \texttt{Runnable} object to be reused in different thread…
930 Of course, it can be used to generate any number of timer or alarm events.
935 that should be done in a separate thread.
966 struct instances in the generated C++ code, this would actually be impossible.)
977 boundary will cause padding to be added until the end of the chunk and the
998 service function definition along with its parameters can be considered to be
999 a structured log entry identified by the function name. This log can then be used for