|  | # Protocol Buffers - Google's data interchange format | 
|  | # Copyright 2008 Google Inc.  All rights reserved. | 
|  | # https://developers.google.com/protocol-buffers/ | 
|  | # | 
|  | # Redistribution and use in source and binary forms, with or without | 
|  | # modification, are permitted provided that the following conditions are | 
|  | # met: | 
|  | # | 
|  | #     * Redistributions of source code must retain the above copyright | 
|  | # notice, this list of conditions and the following disclaimer. | 
|  | #     * Redistributions in binary form must reproduce the above | 
|  | # copyright notice, this list of conditions and the following disclaimer | 
|  | # in the documentation and/or other materials provided with the | 
|  | # distribution. | 
|  | #     * Neither the name of Google Inc. nor the names of its | 
|  | # contributors may be used to endorse or promote products derived from | 
|  | # this software without specific prior written permission. | 
|  | # | 
|  | # THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 
|  | # "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 
|  | # LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 
|  | # A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 
|  | # OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 
|  | # SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 
|  | # LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 
|  | # DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 
|  | # THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 
|  | # (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 
|  | # OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | 
|  |  | 
|  | # require mixins before we hook them into the java & c code | 
|  | require 'google/protobuf/message_exts' | 
|  |  | 
|  | # We define these before requiring the platform-specific modules. | 
|  | # That way the module init can grab references to these. | 
|  | module Google | 
|  | module Protobuf | 
|  | class Error < StandardError; end | 
|  | class ParseError < Error; end | 
|  | class TypeError < ::TypeError; end | 
|  | end | 
|  | end | 
|  |  | 
|  | if RUBY_PLATFORM == "java" | 
|  | require 'json' | 
|  | require 'google/protobuf_java' | 
|  | else | 
|  | begin | 
|  | require "google/#{RUBY_VERSION.sub(/\.\d+$/, '')}/protobuf_c" | 
|  | rescue LoadError | 
|  | require 'google/protobuf_c' | 
|  | end | 
|  |  | 
|  | module Google | 
|  | module Protobuf | 
|  | module Internal | 
|  | def self.infer_package(names) | 
|  | # Package is longest common prefix ending in '.', if any. | 
|  | if not names.empty? | 
|  | min, max = names.minmax | 
|  | last_common_dot = nil | 
|  | min.size.times { |i| | 
|  | if min[i] != max[i] then break end | 
|  | if min[i] == ?. then last_common_dot = i end | 
|  | } | 
|  | if last_common_dot | 
|  | return min.slice(0, last_common_dot) | 
|  | end | 
|  | end | 
|  |  | 
|  | nil | 
|  | end | 
|  |  | 
|  | class NestingBuilder | 
|  | def initialize(msg_names, enum_names) | 
|  | @to_pos = {nil=>nil} | 
|  | @msg_children = Hash.new { |hash, key| hash[key] = [] } | 
|  | @enum_children = Hash.new { |hash, key| hash[key] = [] } | 
|  |  | 
|  | msg_names.each_with_index { |name, idx| @to_pos[name] = idx } | 
|  | enum_names.each_with_index { |name, idx| @to_pos[name] = idx } | 
|  |  | 
|  | msg_names.each { |name| @msg_children[parent(name)] << name } | 
|  | enum_names.each { |name| @enum_children[parent(name)] << name } | 
|  | end | 
|  |  | 
|  | def build(package) | 
|  | return build_msg(package) | 
|  | end | 
|  |  | 
|  | private | 
|  | def build_msg(msg) | 
|  | return { | 
|  | :pos => @to_pos[msg], | 
|  | :msgs => @msg_children[msg].map { |child| build_msg(child) }, | 
|  | :enums => @enum_children[msg].map { |child| @to_pos[child] }, | 
|  | } | 
|  | end | 
|  |  | 
|  | private | 
|  | def parent(name) | 
|  | idx = name.rindex(?.) | 
|  | if idx | 
|  | return name.slice(0, idx) | 
|  | else | 
|  | return nil | 
|  | end | 
|  | end | 
|  | end | 
|  |  | 
|  | def self.fixup_descriptor(package, msg_names, enum_names) | 
|  | if package.nil? | 
|  | package = self.infer_package(msg_names + enum_names) | 
|  | end | 
|  |  | 
|  | nesting = NestingBuilder.new(msg_names, enum_names).build(package) | 
|  |  | 
|  | return package, nesting | 
|  | end | 
|  | end | 
|  | end | 
|  | end | 
|  | end | 
|  |  | 
|  | require 'google/protobuf/repeated_field' | 
|  |  | 
|  | module Google | 
|  | module Protobuf | 
|  |  | 
|  | def self.encode(msg) | 
|  | msg.to_proto | 
|  | end | 
|  |  | 
|  | def self.encode_json(msg, options = {}) | 
|  | msg.to_json(options) | 
|  | end | 
|  |  | 
|  | def self.decode(klass, proto) | 
|  | klass.decode(proto) | 
|  | end | 
|  |  | 
|  | def self.decode_json(klass, json, options = {}) | 
|  | klass.decode_json(json, options) | 
|  | end | 
|  |  | 
|  | end | 
|  | end |