Can thrift operate in a space-efficient manner on large data sets? I'd like to generate and parse "messages" that are often hundreds of megabytes in size, composed of a header struct followed by a long list of structs. When I parse the messages I will process the pieces in order, but I need to know if the code will try to load the entire message contents into RAM at once. Since the documentation says that list<type> is translated into an STL vector, I'm assuming it will.
Thanks, -- Shawn
