Package org.vast.swe.fast
package org.vast.swe.fast
-
ClassDescriptionBase class for all SWE Common data stream parsers (text, binary, xml, json)Base class for all SWE Common data stream writers (text, binary, xml, json)New implementation of binary data parser with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.New implementation of binary data writer with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.Base class for all data block level processors.
The processor tree is pre-configured so that the processing can occur very fast on many data blocks matching the same components structure.Implementation of JSON data parser for parsing inline DataArray values.Implementation of JSON data writer for writing array data inline, as a JSON array of elements where each element is itself a flat array of mixed types.New implementation of JSON data parser with better efficiency since the read tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.New implementation of JSON data writer with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.New implementation of JSON data writer with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.Null writer used to skip data, thus it doesn't actually write anything!New implementation of text data parser with better efficiency since the parsing tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.New implementation of text data writer with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.New implementation of XML data writer with better efficiency since the write tree is pre-computed during init instead of being re-evaluated while iterating through the component tree.