From f0ff5ab96e2a28f435c3d7b13f6e7a54815700f3 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 11 Dec 2017 21:44:23 +0800
Subject: [PATCH 01/82] add: server, FTRL Handler

---
 src/distributed/server.h | 79 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 79 insertions(+)
 create mode 100644 src/distributed/server.h

diff --git a/src/distributed/server.h b/src/distributed/server.h
new file mode 100644
index 00000000..849727d2
--- /dev/null
+++ b/src/distributed/server.h
@@ -0,0 +1,79 @@
+#include "iostream"
+#include "ps.h"
+#include <time.h>
+
+namespace xlean {
+float alpha = 0.001;
+float beta = 1.0;
+float lambda1 = 0.00001;
+float lambda2 = 2.0;
+
+struct KVServerSGDHandle {
+  void operator() (const ps::KVMeta& req_meta,
+                   const ps::KVPairs<float>& req_data,
+                   ps::KVServer<float>* server)
+
+};
+
+struct FTRLEntry{
+  FTRLEntry() : w(0.0), z(0.0), n(0.0) { }
+  float w;
+  float z;
+  float n;
+};
+
+struct KVServerFTRLHandle {
+  void operator() (const ps::KVMeta& req_meta,
+                   const ps::KVPairs<float>& req_data,
+                   ps::KVServer<float>* server) {
+    size_t n = req_data.keys.size();
+    ps::KVPairs<float> res;
+    if (req_meta.push) {
+      CHECK_EQ(n, req_data.vals.size());
+    } else {
+      res.keys = req_data.keys;
+      res.vals.resize(n);
+    }
+    for (size_t i = 0; i < n; ++i) {
+      ps::Key key = req_data.keys[i];
+      if (store.find(key) == store.end()) {
+        FTRLEntry entry;
+        store.insert({key, entry});
+      }
+      FTRLEntry& val = store[key];
+      if (req_meta.push) {
+        float g = req_data.vals[i];
+        float old_n = val.n;
+        float n = old_n + g * g;
+        val.z += g - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w;
+        val.n = n;
+        if (std::abs(val.z) <= lambda1) {
+          val.w = 0.0;
+        } else {
+          float tmpr= 0.0;
+          if (val.z > 0.0) tmpr = val.z - lambda1;
+          if (val.z < 0.0) tmpr = val.z + lambda1;
+          float tmpl = -1 * ( (beta + std::sqrt(val.n))/alpha  + lambda2 );
+          val.w = tmpr / tmpl;
+        }
+      } else {
+        res.vals[i] = val.w;
+      }
+    }
+    server->Response(req_meta, res);
+  }
+ private:
+  std::unordered_map<ps::Key, FTRLEntry> store;
+};
+
+class XLearnServer{
+ public:
+  XLearnServer(){
+    auto server_ = new ps::KVServer<float>(0);
+    server_->set_request_handle(KVServerFTRLHandle());
+    std::cout << "init server success " << std::endl;
+  }
+  ~S(){}
+  ps::KVServer<float>* server_;
+};//end class Server
+}

From 968f4265cc1a294c4cb43fa817160f97f10d9730 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 11 Dec 2017 22:06:42 +0800
Subject: [PATCH 02/82] add: server, adagrad handler

---
 src/distributed/server.h | 62 ++++++++++++++++++++++++++++++++++++++++
 1 file changed, 62 insertions(+)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 849727d2..10749edf 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -1,5 +1,7 @@
 #include "iostream"
 #include "ps.h"
+#include "src/base/math.h"
+
 #include <time.h>
 
 namespace xlean {
@@ -8,11 +10,71 @@ float beta = 1.0;
 float lambda1 = 0.00001;
 float lambda2 = 2.0;
 
+float regu_lambda_ = 0.1;
+float learning_rate_ = 0.1;
+
 struct KVServerSGDHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server)
+    size_t n = req_data.keys.size();
+    ps::KVPairs<float> res;
+    if (req_meta.push) {
+      CHECK_EQ(n, req_data.vals.size());
+    } else {
+      res.keys = req_data.keys;
+      res.vals.resize(n);
+    }
+    for (size_t i = 0; i < n; ++i) {
+      ps::Key key = req_data.keys[i];
+      if (store.find(key) == store_.end()) {
+        store_.insert({key, 0.0});
+      }
+      float& val = store_[key];
+      if (req_meta.push) {
+        float g = req_data[i];
+        g += regu_lambda_ * g;
+        val -= learning_rate_ * g;
+      }
+    }
+ private:
+  std::unordered_map<ps::Key, float> store_;
+};
+
+struct AdaGradEntry {
+  float w;
+  float n;
+};
 
+struct KVServerAdaGradHandle {
+  void operator() (const ps::KVMeta& req_meta,
+                   const ps::KVPairs<float>& req_data,
+                   ps::KVServer<float>* server) {
+    size_t n = req_data.vals.size();
+    ps::KVPairs<float> res;
+    if (req_meta.push) {
+      CHECK_EQ(n, req_data.vals.size());
+    } else {
+      res.keys = req_data.keys;
+      res.vals.resize(n);
+    }
+    for (size_t it = 0; i < n; ++i) {
+      ps::Key key = req_data.keys[i];
+      if (store_.find(key) == store_.end()) {
+        AdaGradEntry entry;
+        store_.insert({key, entry});
+      }
+      AdaGradEntry& val = store_[key];
+      if (req_meta.push) {
+        float g = req_data.vals[i];
+        g += regu_lambda_ * g;
+        val.n = g * g;
+        val.w -= (learning_rate_ * g * InvSqrt(val.n))
+      }
+    }
+  }
+ private:
+  std::unordered_map<ps::Key, AdaGradEntry> store_;
 };
 
 struct FTRLEntry{

From 860bf129b4ea2e1540a4dca5c8dd26695e8c60b3 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 11 Dec 2017 22:50:34 +0800
Subject: [PATCH 03/82] add: slect algo

---
 src/distributed/server.h | 10 +++++++++-
 1 file changed, 9 insertions(+), 1 deletion(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 10749edf..6b69f9a9 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -132,7 +132,15 @@ class XLearnServer{
  public:
   XLearnServer(){
     auto server_ = new ps::KVServer<float>(0);
-    server_->set_request_handle(KVServerFTRLHandle());
+    if (opt_type_.compare("sgd") == 0) {
+      server_->set_request_handle(KVServerSGDHandle());
+    }
+    if (opt_type_.compare("adagrad") == 0) {
+      server_->set_request_handle(KVServerAdaGradHandle());
+    }
+    if (opt_type_.compare("ftrl") == 0) {
+      server_->set_request_handle(KVServerFTRLHandle());
+    }
     std::cout << "init server success " << std::endl;
   }
   ~S(){}

From 263d5e757fde04a08b15cec6ba5e403450e0963c Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 12 Dec 2017 09:45:30 +0800
Subject: [PATCH 04/82] update: server, SGDEntry and SGD Handler

---
 src/distributed/server.h | 32 +++++++++++++++++++++-----------
 1 file changed, 21 insertions(+), 11 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 6b69f9a9..7ffb7e2c 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -13,28 +13,38 @@ float lambda2 = 2.0;
 float regu_lambda_ = 0.1;
 float learning_rate_ = 0.1;
 
+struct SGDEntry{
+  SGDEntry(size_t k) {
+    w.resize(w, 0.0);
+  }
+  std::vector<float> w;
+}
+
 struct KVServerSGDHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server)
-    size_t n = req_data.keys.size();
+    int k = 0;
+    if (req_data.lens() == 0) {
+      k = req_data.keys.size() / req_data.vals.size();
+    }
+    size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      CHECK_EQ(n, req_data.vals.size());
+      CHECK_EQ(keys_size * k, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
-      res.vals.resize(n);
+      SGDEntry entry(k);
+      res.vals.resize(keys_size, entry);
     }
-    for (size_t i = 0; i < n; ++i) {
+    for (size_t i = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
-      if (store.find(key) == store_.end()) {
-        store_.insert({key, 0.0});
-      }
-      float& val = store_[key];
+      SGDEntry& val = store_[key];
       if (req_meta.push) {
-        float g = req_data[i];
-        g += regu_lambda_ * g;
-        val -= learning_rate_ * g;
+        for (int j = 0; j < val.w.size(); ++j)
+        float gradient = req_data[i * k + j];
+        gradient += regu_lambda_ * gradient;
+        val.w[j] -= learning_rate_ * gradient;
       }
     }
  private:

From 1d0ad1efbf7fd3f9a2630748fb2bdfc786c7dfe5 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 12 Dec 2017 09:55:33 +0800
Subject: [PATCH 05/82] update: server.h

---
 src/distributed/server.h | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 7ffb7e2c..499dba32 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -52,6 +52,10 @@ struct KVServerSGDHandle {
 };
 
 struct AdaGradEntry {
+  AdaGradEntry(size_t k) {
+    w.resize(k, 0.0);
+    n.resize(n, 0.0);
+  }
   float w;
   float n;
 };

From 3d87981c125e1e0bcc36d167c80ecc57396bd49a Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 12 Dec 2017 22:07:18 +0800
Subject: [PATCH 06/82] update

---
 src/distributed/server.h | 13 ++++---------
 1 file changed, 4 insertions(+), 9 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 499dba32..bc739138 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -15,7 +15,7 @@ float learning_rate_ = 0.1;
 
 struct SGDEntry{
   SGDEntry(size_t k) {
-    w.resize(w, 0.0);
+    w.resize(k, 0.0);
   }
   std::vector<float> w;
 }
@@ -34,8 +34,7 @@ struct KVServerSGDHandle {
       CHECK_EQ(keys_size * k, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
-      SGDEntry entry(k);
-      res.vals.resize(keys_size, entry);
+      res.vals.resize(keys_size);
     }
     for (size_t i = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
@@ -48,13 +47,13 @@ struct KVServerSGDHandle {
       }
     }
  private:
-  std::unordered_map<ps::Key, float> store_;
+  std::unordered_map<ps::Key, SGDEntry> store_;
 };
 
 struct AdaGradEntry {
   AdaGradEntry(size_t k) {
     w.resize(k, 0.0);
-    n.resize(n, 0.0);
+    n.resize(k, 0.0);
   }
   float w;
   float n;
@@ -74,10 +73,6 @@ struct KVServerAdaGradHandle {
     }
     for (size_t it = 0; i < n; ++i) {
       ps::Key key = req_data.keys[i];
-      if (store_.find(key) == store_.end()) {
-        AdaGradEntry entry;
-        store_.insert({key, entry});
-      }
       AdaGradEntry& val = store_[key];
       if (req_meta.push) {
         float g = req_data.vals[i];

From 28df9911973df0f9fb59c744a3d9c4840894ce85 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 12 Dec 2017 22:25:15 +0800
Subject: [PATCH 07/82] fix: SGD Handler

---
 src/distributed/server.h | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index bc739138..454c02d4 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -26,7 +26,7 @@ struct KVServerSGDHandle {
                    ps::KVServer<float>* server)
     int k = 0;
     if (req_data.lens() == 0) {
-      k = req_data.keys.size() / req_data.vals.size();
+      k = req_data.vals.size() / req_data.keys.size();
     }
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
@@ -41,7 +41,7 @@ struct KVServerSGDHandle {
       SGDEntry& val = store_[key];
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j)
-        float gradient = req_data[i * k + j];
+        float gradient = req_data.vals[i * k + j];
         gradient += regu_lambda_ * gradient;
         val.w[j] -= learning_rate_ * gradient;
       }
@@ -55,7 +55,7 @@ struct AdaGradEntry {
     w.resize(k, 0.0);
     n.resize(k, 0.0);
   }
-  float w;
+  std::vector<float> w;
   float n;
 };
 

From 6194721c540717c6ec67978e64ad4a513acf2762 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 12 Dec 2017 22:32:14 +0800
Subject: [PATCH 08/82] update: AdaGrad Handler

---
 src/distributed/server.h | 33 ++++++++++++++++++++++-----------
 1 file changed, 22 insertions(+), 11 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 454c02d4..aebc5c4a 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -40,10 +40,11 @@ struct KVServerSGDHandle {
       ps::Key key = req_data.keys[i];
       SGDEntry& val = store_[key];
       if (req_meta.push) {
-        for (int j = 0; j < val.w.size(); ++j)
-        float gradient = req_data.vals[i * k + j];
-        gradient += regu_lambda_ * gradient;
-        val.w[j] -= learning_rate_ * gradient;
+        for (int j = 0; j < val.w.size(); ++j) {
+          float gradient = req_data.vals[i * k + j];
+          gradient += regu_lambda_ * gradient;
+          val.w[j] -= learning_rate_ * gradient;
+        }
       }
     }
  private:
@@ -56,17 +57,21 @@ struct AdaGradEntry {
     n.resize(k, 0.0);
   }
   std::vector<float> w;
-  float n;
+  std::vector<float> n;
 };
 
 struct KVServerAdaGradHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server) {
-    size_t n = req_data.vals.size();
+    size_t k = 0;
+    if (req_data.lens.size() == 0) {
+      k = req_data.vals.size() / req_data.keys.size();
+    }
+    size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      CHECK_EQ(n, req_data.vals.size());
+      CHECK_EQ(keys_size * k, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
       res.vals.resize(n);
@@ -75,10 +80,16 @@ struct KVServerAdaGradHandle {
       ps::Key key = req_data.keys[i];
       AdaGradEntry& val = store_[key];
       if (req_meta.push) {
-        float g = req_data.vals[i];
-        g += regu_lambda_ * g;
-        val.n = g * g;
-        val.w -= (learning_rate_ * g * InvSqrt(val.n))
+        for (int j = 0; j < val.w.size(); ++j) {
+          float g = req_data.vals[i * k + j];
+          g += regu_lambda_ * g;
+          val.n = g * g;
+          val.w[j] -= (learning_rate_ * g * InvSqrt(val.n))
+        }
+      } else {
+        for (int j = 0; j < val.w.size(); ++j) {
+          res[i * k + j] = val.w[j];
+        }
       }
     }
   }

From a1b26dcbec5f1c374b931f1d61c4fcae4b388c92 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 14:43:50 +0800
Subject: [PATCH 09/82] update: SGD handler

---
 src/distributed/server.h | 4 ++++
 1 file changed, 4 insertions(+)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index aebc5c4a..474d3ea0 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -45,6 +45,10 @@ struct KVServerSGDHandle {
           gradient += regu_lambda_ * gradient;
           val.w[j] -= learning_rate_ * gradient;
         }
+      } else {
+        for (int j = 0; j < val.w.size(); ++j) {
+          res.vals[i * k + j] = val.w[j];
+        }
       }
     }
  private:

From 8a8d931b344ba6f52e97bbab1783aaa5b0cfdd6e Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 15:00:40 +0800
Subject: [PATCH 10/82] update

---
 src/distributed/server.h | 56 ++++++++++++++++++++++------------------
 1 file changed, 31 insertions(+), 25 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 474d3ea0..3c0be44d 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -87,8 +87,8 @@ struct KVServerAdaGradHandle {
         for (int j = 0; j < val.w.size(); ++j) {
           float g = req_data.vals[i * k + j];
           g += regu_lambda_ * g;
-          val.n = g * g;
-          val.w[j] -= (learning_rate_ * g * InvSqrt(val.n))
+          val.n[j] = g * g;
+          val.w[j] -= (learning_rate_ * g * InvSqrt(val.n[j]))
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
@@ -102,16 +102,24 @@ struct KVServerAdaGradHandle {
 };
 
 struct FTRLEntry{
-  FTRLEntry() : w(0.0), z(0.0), n(0.0) { }
-  float w;
-  float z;
-  float n;
+  FTRLEntry(int k) {
+    w.resize(k, 0.0);
+    n.resize(k, 0.0);
+    z.resize(k, 0.0);
+  }
+  std::vector<float> w;
+  std::vector<float> z;
+  std::vector<float> n;
 };
 
 struct KVServerFTRLHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server) {
+    int k = 0; 
+    if (req_data.lens.size() == 0) {
+      k = req_data.vals.size() / req_data.keys.size();
+    }
     size_t n = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
@@ -122,28 +130,26 @@ struct KVServerFTRLHandle {
     }
     for (size_t i = 0; i < n; ++i) {
       ps::Key key = req_data.keys[i];
-      if (store.find(key) == store.end()) {
-        FTRLEntry entry;
-        store.insert({key, entry});
-      }
       FTRLEntry& val = store[key];
-      if (req_meta.push) {
-        float g = req_data.vals[i];
-        float old_n = val.n;
-        float n = old_n + g * g;
-        val.z += g - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w;
-        val.n = n;
-        if (std::abs(val.z) <= lambda1) {
-          val.w = 0.0;
+      for (int j = 0; j < val.w.size(); ++j) {
+        if (req_meta.push) {
+          float g = req_data.vals[i * k + j];
+          float old_n = val.n[j];
+          float n = old_n + g * g;
+          val.z[j] += g - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w[j];
+          val.n[j] = n;
+          if (std::abs(val.z[j]) <= lambda1) {
+            val.w[j] = 0.0;
+          } else {
+            float tmpr= 0.0;
+            if (val.z[j] > 0.0) tmpr = val.z[j] - lambda1;
+            if (val.z[j] < 0.0) tmpr = val.z[j] + lambda1;
+            float tmpl = -1 * ( (beta + std::sqrt(val.n[j]))/alpha  + lambda2 );
+            val.w[j] = tmpr / tmpl;
+          }
         } else {
-          float tmpr= 0.0;
-          if (val.z > 0.0) tmpr = val.z - lambda1;
-          if (val.z < 0.0) tmpr = val.z + lambda1;
-          float tmpl = -1 * ( (beta + std::sqrt(val.n))/alpha  + lambda2 );
-          val.w = tmpr / tmpl;
+          res.vals[i * k + j] = val.w[j];
         }
-      } else {
-        res.vals[i] = val.w;
       }
     }
     server->Response(req_meta, res);

From 389f8616cc53e01b54fd549a89ca3525a6344f33 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 15:15:35 +0800
Subject: [PATCH 11/82] update

---
 src/distributed/server.h | 26 +++++++++++++-------------
 1 file changed, 13 insertions(+), 13 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 3c0be44d..5c509313 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -80,15 +80,15 @@ struct KVServerAdaGradHandle {
       res.keys = req_data.keys;
       res.vals.resize(n);
     }
-    for (size_t it = 0; i < n; ++i) {
+    for (size_t it = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
       AdaGradEntry& val = store_[key];
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j) {
-          float g = req_data.vals[i * k + j];
-          g += regu_lambda_ * g;
-          val.n[j] = g * g;
-          val.w[j] -= (learning_rate_ * g * InvSqrt(val.n[j]))
+          float gradient = req_data.vals[i * k + j];
+          gradient += regu_lambda_ * gradient;
+          val.n[j] = gradient * gradient;
+          val.w[j] -= (learning_rate_ * gradient * InvSqrt(val.n[j]))
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
@@ -116,11 +116,11 @@ struct KVServerFTRLHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server) {
-    int k = 0; 
+    int k = 0;
     if (req_data.lens.size() == 0) {
       k = req_data.vals.size() / req_data.keys.size();
     }
-    size_t n = req_data.keys.size();
+    size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
       CHECK_EQ(n, req_data.vals.size());
@@ -128,15 +128,15 @@ struct KVServerFTRLHandle {
       res.keys = req_data.keys;
       res.vals.resize(n);
     }
-    for (size_t i = 0; i < n; ++i) {
+    for (size_t i = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
-      FTRLEntry& val = store[key];
+      FTRLEntry& val = store_[key];
       for (int j = 0; j < val.w.size(); ++j) {
         if (req_meta.push) {
-          float g = req_data.vals[i * k + j];
+          float gradient = req_data.vals[i * k + j];
           float old_n = val.n[j];
-          float n = old_n + g * g;
-          val.z[j] += g - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w[j];
+          float n = old_n + gradient * gradient;
+          val.z[j] += gradient - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w[j];
           val.n[j] = n;
           if (std::abs(val.z[j]) <= lambda1) {
             val.w[j] = 0.0;
@@ -155,7 +155,7 @@ struct KVServerFTRLHandle {
     server->Response(req_meta, res);
   }
  private:
-  std::unordered_map<ps::Key, FTRLEntry> store;
+  std::unordered_map<ps::Key, FTRLEntry> store_;
 };
 
 class XLearnServer{

From aa40ffcd443f6400ba1f21439241f4635decad63 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 18:13:42 +0800
Subject: [PATCH 12/82] update: server.h

---
 src/distributed/server.h | 24 ++++++++++++------------
 1 file changed, 12 insertions(+), 12 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 5c509313..1df545e2 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -13,12 +13,12 @@ float lambda2 = 2.0;
 float regu_lambda_ = 0.1;
 float learning_rate_ = 0.1;
 
-struct SGDEntry{
-  SGDEntry(size_t k) {
+typedef struct SGDEntry{
+  SGDEntry(size_t k = 4) {
     w.resize(k, 0.0);
   }
   std::vector<float> w;
-}
+} sgdentry;
 
 struct KVServerSGDHandle {
   void operator() (const ps::KVMeta& req_meta,
@@ -52,17 +52,17 @@ struct KVServerSGDHandle {
       }
     }
  private:
-  std::unordered_map<ps::Key, SGDEntry> store_;
+  std::unordered_map<ps::Key, sgdentry> store_;
 };
 
-struct AdaGradEntry {
-  AdaGradEntry(size_t k) {
+typedef struct AdaGradEntry {
+  AdaGradEntry(size_t k = 4) {
     w.resize(k, 0.0);
     n.resize(k, 0.0);
   }
   std::vector<float> w;
   std::vector<float> n;
-};
+} adagradentry;
 
 struct KVServerAdaGradHandle {
   void operator() (const ps::KVMeta& req_meta,
@@ -98,11 +98,11 @@ struct KVServerAdaGradHandle {
     }
   }
  private:
-  std::unordered_map<ps::Key, AdaGradEntry> store_;
+  std::unordered_map<ps::Key, adagradentry> store_;
 };
 
-struct FTRLEntry{
-  FTRLEntry(int k) {
+typedef struct FTRLEntry{
+  FTRLEntry(size_t k = 4) {
     w.resize(k, 0.0);
     n.resize(k, 0.0);
     z.resize(k, 0.0);
@@ -110,7 +110,7 @@ struct FTRLEntry{
   std::vector<float> w;
   std::vector<float> z;
   std::vector<float> n;
-};
+} ftrlentry;
 
 struct KVServerFTRLHandle {
   void operator() (const ps::KVMeta& req_meta,
@@ -155,7 +155,7 @@ struct KVServerFTRLHandle {
     server->Response(req_meta, res);
   }
  private:
-  std::unordered_map<ps::Key, FTRLEntry> store_;
+  std::unordered_map<ps::Key, ftrlentry> store_;
 };
 
 class XLearnServer{

From dcf570ea3dba98c2f2626e0967acf001409f9a6d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 19:40:25 +0800
Subject: [PATCH 13/82] update

---
 src/distributed/server.h | 30 +++++++++---------------------
 1 file changed, 9 insertions(+), 21 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 1df545e2..a97a210e 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -24,14 +24,10 @@ struct KVServerSGDHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server)
-    int k = 0;
-    if (req_data.lens() == 0) {
-      k = req_data.vals.size() / req_data.keys.size();
-    }
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      CHECK_EQ(keys_size * k, req_data.vals.size());
+      CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
       res.vals.resize(keys_size);
@@ -41,13 +37,13 @@ struct KVServerSGDHandle {
       SGDEntry& val = store_[key];
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j) {
-          float gradient = req_data.vals[i * k + j];
+          float gradient = req_data.vals[i * v_dim + j];
           gradient += regu_lambda_ * gradient;
           val.w[j] -= learning_rate_ * gradient;
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
-          res.vals[i * k + j] = val.w[j];
+          res.vals[i * v_dim + j] = val.w[j];
         }
       }
     }
@@ -68,14 +64,10 @@ struct KVServerAdaGradHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server) {
-    size_t k = 0;
-    if (req_data.lens.size() == 0) {
-      k = req_data.vals.size() / req_data.keys.size();
-    }
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      CHECK_EQ(keys_size * k, req_data.vals.size());
+      CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
       res.vals.resize(n);
@@ -85,14 +77,14 @@ struct KVServerAdaGradHandle {
       AdaGradEntry& val = store_[key];
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j) {
-          float gradient = req_data.vals[i * k + j];
+          float gradient = req_data.vals[i * v_dim + j];
           gradient += regu_lambda_ * gradient;
           val.n[j] = gradient * gradient;
           val.w[j] -= (learning_rate_ * gradient * InvSqrt(val.n[j]))
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
-          res[i * k + j] = val.w[j];
+          res[i * v_dim + j] = val.w[j];
         }
       }
     }
@@ -116,10 +108,6 @@ struct KVServerFTRLHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
                    ps::KVServer<float>* server) {
-    int k = 0;
-    if (req_data.lens.size() == 0) {
-      k = req_data.vals.size() / req_data.keys.size();
-    }
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
@@ -133,7 +121,7 @@ struct KVServerFTRLHandle {
       FTRLEntry& val = store_[key];
       for (int j = 0; j < val.w.size(); ++j) {
         if (req_meta.push) {
-          float gradient = req_data.vals[i * k + j];
+          float gradient = req_data.vals[i * v_dim + j];
           float old_n = val.n[j];
           float n = old_n + gradient * gradient;
           val.z[j] += gradient - (std::sqrt(n) - std::sqrt(old_n)) / alpha * val.w[j];
@@ -148,7 +136,7 @@ struct KVServerFTRLHandle {
             val.w[j] = tmpr / tmpl;
           }
         } else {
-          res.vals[i * k + j] = val.w[j];
+          res.vals[i * v_dim + j] = val.w[j];
         }
       }
     }
@@ -173,7 +161,7 @@ class XLearnServer{
     }
     std::cout << "init server success " << std::endl;
   }
-  ~S(){}
+  ~XLearnServer(){}
   ps::KVServer<float>* server_;
 };//end class Server
 }

From 055778eb2941ddbeab5168cc9ff7e6bfbece5d55 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 20:47:58 +0800
Subject: [PATCH 14/82] add: dist loss, dist score

---
 src/distributed/dist_cross_entropy_loss.cc | 147 +++++++++++++++++++++
 src/distributed/dist_cross_entropy_loss.h  |  59 +++++++++
 src/distributed/dist_score_function.cc     |  37 ++++++
 src/distributed/dist_score_function.h      | 116 ++++++++++++++++
 src/distributed/dist_squared_loss.cc       | 145 ++++++++++++++++++++
 src/distributed/dist_squared_loss.h        |  59 +++++++++
 6 files changed, 563 insertions(+)
 create mode 100644 src/distributed/dist_cross_entropy_loss.cc
 create mode 100644 src/distributed/dist_cross_entropy_loss.h
 create mode 100644 src/distributed/dist_score_function.cc
 create mode 100644 src/distributed/dist_score_function.h
 create mode 100644 src/distributed/dist_squared_loss.cc
 create mode 100644 src/distributed/dist_squared_loss.h

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
new file mode 100644
index 00000000..f40e2bac
--- /dev/null
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -0,0 +1,147 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of CrossEntropyLoss class.
+*/
+
+#include "src/loss/dist_cross_entropy_loss.h"
+
+#include<thread>
+#include<atomic>
+
+namespace xLearn {
+
+// Calculate loss in one thread.
+static void ce_evalute_thread(const std::vector<real_t>* pred,
+                              const std::vector<real_t>* label,
+                              real_t* tmp_sum,
+                              size_t start_idx,
+                              size_t end_idx) {
+  CHECK_GE(end_idx, start_idx);
+  *tmp_sum = 0;
+  for (size_t i = start_idx; i < end_idx; ++i) {
+    real_t y = (*label)[i] > 0 ? 1.0 : -1.0;
+    (*tmp_sum) += log1p(exp(-y*(*pred)[i]));
+  }
+}
+
+//------------------------------------------------------------------------------
+// Calculate loss in multi-thread:
+//
+//                         master_thread
+//                      /       |         \
+//                     /        |          \
+//                thread_1    thread_2    thread_3
+//                   |           |           |
+//                    \          |           /
+//                     \         |          /
+//                       \       |        /
+//                         master_thread
+//------------------------------------------------------------------------------
+void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
+                               const std::vector<real_t>& label) {
+  CHECK_NE(pred.empty(), true);
+  CHECK_NE(label.empty(), true);
+  total_example_ += pred.size();
+  // multi-thread training
+  std::vector<real_t> sum(threadNumber_, 0);
+  for (int i = 0; i < threadNumber_; ++i) {
+    size_t start_idx = getStart(pred.size(), threadNumber_, i);
+    size_t end_idx = getEnd(pred.size(), threadNumber_, i);
+    pool_->enqueue(std::bind(ce_evalute_thread,
+                             &pred,
+                             &label,
+                             &(sum[i]),
+                             start_idx,
+                             end_idx));
+  }
+  // Wait all of the threads finish their job
+  pool_->Sync(threadNumber_);
+  // Accumulate loss
+  for (size_t i = 0; i < sum.size(); ++i) {
+    loss_sum_ += sum[i];
+  }
+}
+
+
+// Calculate gradient in one thread.
+static void ce_gradient_thread(const DMatrix* matrix,
+                               Model* model,
+                               Score* score_func,
+                               bool is_norm,
+                               real_t* sum,
+                               size_t start_idx,
+                               size_t end_idx) {
+  CHECK_GE(end_idx, start_idx);
+  *sum = 0;
+  for (size_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t norm = is_norm ? matrix->norm[i] : 1.0;
+    real_t pred = score_func->CalcScore(row, *model, norm);
+    // partial gradient
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    *sum += log1p(exp(-y*pred));
+    real_t pg = -y/(1.0+(1.0/exp(-y*pred)));
+    // real gradient and update
+    score_func->CalcGrad(row, *model, pg, norm);
+  }
+}
+
+//------------------------------------------------------------------------------
+// Calculate gradient in multi-thread
+//
+//                         master_thread
+//                      /       |         \
+//                     /        |          \
+//                thread_1    thread_2    thread_3
+//                   |           |           |
+//                    \          |           /
+//                     \         |          /
+//                       \       |        /
+//                         master_thread
+//------------------------------------------------------------------------------
+void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
+                                Model& model) {
+  CHECK_NOTNULL(matrix);
+  CHECK_GT(matrix->row_length, 0);
+  size_t row_len = matrix->row_length;
+  total_example_ += row_len;
+  // multi-thread training
+  int count = lock_free_ ? threadNumber_ : 1;
+  std::vector<real_t> sum(count, 0);
+  for (int i = 0; i < count; ++i) {
+    index_t start_idx = getStart(row_len, count, i);
+    index_t end_idx = getEnd(row_len, count, i);
+    pool_->enqueue(std::bind(ce_gradient_thread,
+                             matrix,
+                             &model,
+                             score_func_,
+                             norm_,
+                             &(sum[i]),
+                             start_idx,
+                             end_idx));
+  }
+  // Wait all of the threads finish their job
+  pool_->Sync(count);
+  // Accumulate loss
+  for (int i = 0; i < sum.size(); ++i) {
+    loss_sum_ += sum[i];
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
new file mode 100644
index 00000000..8a022442
--- /dev/null
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -0,0 +1,59 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the CrossEntropyLoss class.
+*/
+
+#ifndef XLEARN_LOSS_DIST_CROSS_ENTROPY_LOSS_H_
+#define XLEARN_LOSS_DIST_CROSS_ENTROPY_LOSS_H_
+
+#include "src/base/common.h"
+#include "src/loss/loss.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// CrossEntropyLoss is used for classification tasks, which
+// has the following form:
+// loss = sum_all_example(log(1.0+exp(-y*pred)))
+//------------------------------------------------------------------------------
+class DistCrossEntropyLoss : public Loss {
+ public:
+  // Constructor and Desstructor
+  DistCrossEntropyLoss() { }
+  ~DistCrossEntropyLoss() { }
+
+  // Given predictions and labels, accumulate cross-entropy loss.
+  void Evalute(const std::vector<real_t>& pred,
+               const std::vector<real_t>& label);
+
+  // Given data sample and current model, calculate gradient
+  // and update current model parameters.
+  // This function will also accumulate the loss value.
+  void CalcGrad(const DMatrix* data_matrix, Model& model);
+
+  // Return current loss type.
+  std::string loss_type() { return "log_loss"; }
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistCrossEntropyLoss);
+};
+
+}  // namespace xLearn
+
+#endif  // XLEARN_LOSS_DIST_CROSS_ENTROPY_LOSS_H_
diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
new file mode 100644
index 00000000..2bdba8c2
--- /dev/null
+++ b/src/distributed/dist_score_function.cc
@@ -0,0 +1,37 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the base Score class.
+*/
+
+#include "src/score/score_function.h"
+#include "src/score/linear_score.h"
+#include "src/score/fm_score.h"
+#include "src/score/ffm_score.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_score_registry, Score);
+REGISTER_SCORE("linear", LinearScore);
+REGISTER_SCORE("fm", FMScore);
+REGISTER_SCORE("ffm", FFMScore);
+
+}  // namespace xLearn
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
new file mode 100644
index 00000000..d2b2d8b7
--- /dev/null
+++ b/src/distributed/dist_score_function.h
@@ -0,0 +1,116 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the Score class, including linear score,
+FM score, FFM score, and etc.
+*/
+
+#ifndef XLEARN_LOSS_SCORE_FUNCTION_H_
+#define XLEARN_LOSS_SCORE_FUNCTION_H_
+
+#include <vector>
+
+#include "src/base/common.h"
+#include "src/base/class_register.h"
+#include "src/data/data_structure.h"
+#include "src/data/hyper_parameters.h"
+#include "src/data/model_parameters.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Score is an abstract class, which can be implemented by different
+// score functions such as LinearScore (liner_score.h), FMScore (fm_score.h)
+// FFMScore (ffm_score.h) etc. On common, we initial a Score function and
+// pass its pointer to a Loss class like this:
+//
+//  Score* score = new FMScore();
+//  score->CalcScore(row, model, norm);
+//  score->CalcGrad(row, model, pg, norm);
+//
+// In general, the CalcGrad() will be used in loss function.
+//------------------------------------------------------------------------------
+class Score {
+ public:
+  // Constructor and Desstructor
+  Score() { }
+  virtual ~Score() { }
+
+  // Invoke this function before we use this class.
+  virtual void Initialize(real_t learning_rate,
+                          real_t regu_lambda,
+                          real_t alpha,
+                          real_t beta,
+                          real_t lambda_1,
+                          real_t lambda_2,
+                          std::string& opt_type) {
+    learning_rate_ = learning_rate;
+    regu_lambda_ = regu_lambda;
+    alpha_ = alpha;
+    beta_ = beta;
+    lambda_1_ = lambda_1;
+    lambda_2_ = lambda_2;
+    opt_type_ = opt_type;
+  }
+
+  // Given one exmaple and current model, this method
+  // returns the score
+  virtual real_t CalcScore(const SparseRow* row,
+                           Model& model,
+                           real_t norm = 1.0) = 0;
+
+  // Calculate gradient and update current
+  // model parameters
+  virtual void CalcGrad(const SparseRow* row,
+                        Model& model,
+                        real_t pg,
+                        real_t norm = 1.0) = 0;
+
+ protected:
+  real_t learning_rate_;
+  real_t regu_lambda_;
+  real_t alpha_;
+  real_t beta_;
+  real_t lambda_1_;
+  real_t lambda_2_;
+  std::string opt_type_;
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(Score);
+};
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_DEFINE_REGISTRY(xLearn_score_registry, Score);
+
+#define REGISTER_SCORE(format_name, score_name)             \
+  CLASS_REGISTER_OBJECT_CREATOR(                            \
+      xLearn_score_registry,                                \
+      Score,                                                \
+      format_name,                                          \
+      score_name)
+
+#define CREATE_SCORE(format_name)                           \
+  CLASS_REGISTER_CREATE_OBJECT(                             \
+      xLearn_score_registry,                                \
+      format_name)
+
+}  // namespace xLearn
+
+#endif  // XLEARN_LOSS_SCORE_FUNCTION_H_
diff --git a/src/distributed/dist_squared_loss.cc b/src/distributed/dist_squared_loss.cc
new file mode 100644
index 00000000..08ff6a54
--- /dev/null
+++ b/src/distributed/dist_squared_loss.cc
@@ -0,0 +1,145 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of SquaredLoss class.
+*/
+
+#include "src/loss/dist_squared_loss.h"
+
+namespace xLearn {
+
+// Calculate loss in one thread.
+static void sq_evalute_thread(const std::vector<real_t>* pred,
+                              const std::vector<real_t>* label,
+                              real_t* tmp_sum,
+                              size_t start_idx,
+                              size_t end_idx) {
+  CHECK_GE(end_idx, start_idx);
+  *tmp_sum = 0;
+  for (size_t i = start_idx; i < end_idx; ++i) {
+    real_t error = (*label)[i] - (*pred)[i];
+    (*tmp_sum) += (error*error);
+  }
+  *tmp_sum *= 0.5;
+}
+
+//------------------------------------------------------------------------------
+// Calculate loss in multi-thread:
+//
+//                         master_thread
+//                      /       |         \
+//                     /        |          \
+//                thread_1    thread_2    thread_3
+//                   |           |           |
+//                    \          |           /
+//                     \         |          /
+//                       \       |        /
+//                         master_thread
+//------------------------------------------------------------------------------
+void DistSquaredLoss::Evalute(const std::vector<real_t>& pred,
+                          const std::vector<real_t>& label) {
+  CHECK_NE(pred.empty(), true);
+  CHECK_NE(label.empty(), true);
+  total_example_ += pred.size();
+  // multi-thread training
+  std::vector<real_t> sum(threadNumber_, 0);
+  for (int i = 0; i < threadNumber_; ++i) {
+    size_t start_idx = getStart(pred.size(), threadNumber_, i);
+    size_t end_idx = getEnd(pred.size(), threadNumber_, i);
+    pool_->enqueue(std::bind(sq_evalute_thread,
+                             &pred,
+                             &label,
+                             &(sum[i]),
+                             start_idx,
+                             end_idx));
+  }
+  // Wait all of the threads finish their job
+  pool_->Sync(threadNumber_);
+  // Accumulate loss
+  for (size_t i = 0; i < sum.size(); ++i) {
+    loss_sum_ += sum[i];
+  }
+}
+
+// Calculate gradient in one thread
+void sq_gradient_thread(const DMatrix* matrix,
+                        Model* model,
+                        Score* score_func,
+                        bool is_norm,
+                        real_t* sum,
+                        index_t start,
+                        index_t end) {
+  CHECK_GE(end, start);
+  *sum = 0;
+  for (size_t i = start; i < end; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t norm = is_norm ? matrix->norm[i] : 1.0;
+    real_t pred = score_func->CalcScore(row, *model, norm);
+    // loss
+    real_t error = matrix->Y[i] - pred;
+    *sum += (error*error);
+    // partial gradient: -error
+    real_t pg = pred - matrix->Y[i];
+    // real gradient and update
+    score_func->CalcGrad(row, *model, pg, norm);
+  }
+  *sum *= 0.5;
+}
+
+//------------------------------------------------------------------------------
+// Calculate gradient in multi-thread
+//
+//                         master_thread
+//                      /       |         \
+//                     /        |          \
+//                thread_1    thread_2    thread_3
+//                   |           |           |
+//                    \          |           /
+//                     \         |          /
+//                       \       |        /
+//                         master_thread
+//------------------------------------------------------------------------------
+void DistSquaredLoss::CalcGrad(const DMatrix* matrix,
+                           Model& model) {
+  CHECK_NOTNULL(matrix);
+  CHECK_GT(matrix->row_length, 0);
+  size_t row_len = matrix->row_length;
+  total_example_ += row_len;
+  int count = lock_free_ ? threadNumber_ : 1;
+  std::vector<real_t> sum(count, 0);
+  for (int i = 0; i < count; ++i) {
+    size_t start = getStart(row_len, count, i);
+    size_t end = getEnd(row_len, count, i);
+    pool_->enqueue(std::bind(sq_gradient_thread,
+                             matrix,
+                             &model,
+                             score_func_,
+                             norm_,
+                             &(sum[i]),
+                             start,
+                             end));
+  }
+  // Wait all of the threads finish their job
+  pool_->Sync(count);
+  // Accumulate loss
+  for (int i = 0; i < sum.size(); ++i) {
+    loss_sum_ += sum[i];
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_squared_loss.h b/src/distributed/dist_squared_loss.h
new file mode 100644
index 00000000..c7f0b57a
--- /dev/null
+++ b/src/distributed/dist_squared_loss.h
@@ -0,0 +1,59 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the SquaredLoss class.
+*/
+
+#ifndef XLEARN_LOSS_DIST_SQUARED_LOSS_H_
+#define XLEARN_LOSS_DIST_SQUARED_LOSS_H_
+
+#include "src/base/common.h"
+#include "src/loss/loss.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// SquaredLoss is used for regression tasks in machine learning, which
+// has the following form:
+// loss = sum_all_example( (y - pred) ^ 2 )
+//------------------------------------------------------------------------------
+class DistSquaredLoss : public Loss {
+ public:
+  // Constructor and Desstructor
+  DistSquaredLoss() { };
+  ~DistSquaredLoss() { }
+
+  // Given predictions and labels, accumulate loss value.
+  void Evalute(const std::vector<real_t>& pred,
+                 const std::vector<real_t>& label);
+
+  // Given data sample and current model, calculate gradient
+  // and update current model parameters.
+  // This function will also accumulate the loss value.
+  void CalcGrad(const DMatrix* data_matrix, Model& model);
+
+  // Return current loss type
+  std::string loss_type() { return "mse_loss"; }
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistSquaredLoss);
+};
+
+} // namespace xLearn
+
+#endif // XLEARN_LOSS_DIST_SQUARED_LOSS_H_

From 41c036a59319e298a00bc7b740eb1cd8ac117c0e Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 13 Dec 2017 20:48:22 +0800
Subject: [PATCH 15/82] add: worker.h

---
 src/distributed/worker.h | 24 ++++++++++++++++++++++++
 1 file changed, 24 insertions(+)
 create mode 100644 src/distributed/worker.h

diff --git a/src/distributed/worker.h b/src/distributed/worker.h
new file mode 100644
index 00000000..5d75123b
--- /dev/null
+++ b/src/distributed/worker.h
@@ -0,0 +1,24 @@
+/*
+ * worker.h
+ * Copyright (C) 2017 wangxiaoshu <2012wxs@gmail.com>
+ *
+ * Distributed under terms of the MIT license.
+ */
+
+#ifndef WORKER_H
+#define WORKER_H
+
+class XLearnWorker {
+ public:
+  XLearnWorker() {
+    kv_w_ = new ps::KVWorker<float>(0);
+    kv_v_ = new ps::KVWorker<float>(1);
+  }
+  ~XLearnWorker() {}
+
+ private:
+  ps::KVWorker<float>* kv_w_;
+  ps::KVWorker<float>* kv_v_;
+};
+
+#endif /* !WORKER_H */

From 5f3f0c9934df9910d07ab2cc5ae4e55e61ede9c2 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Fri, 15 Dec 2017 09:54:40 +0800
Subject: [PATCH 16/82] update: cross_entropy_loss

---
 src/distributed/dist_cross_entropy_loss.cc | 29 +++++++++++++---------
 src/distributed/dist_score_function.h      |  3 +++
 2 files changed, 20 insertions(+), 12 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index f40e2bac..158cf571 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -88,18 +88,7 @@ static void ce_gradient_thread(const DMatrix* matrix,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  *sum = 0;
-  for (size_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix->row[i];
-    real_t norm = is_norm ? matrix->norm[i] : 1.0;
-    real_t pred = score_func->CalcScore(row, *model, norm);
-    // partial gradient
-    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
-    *sum += log1p(exp(-y*pred));
-    real_t pg = -y/(1.0+(1.0/exp(-y*pred)));
-    // real gradient and update
-    score_func->CalcGrad(row, *model, pg, norm);
-  }
+  score_func_->DistCalcScore(matrix, model, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -121,6 +110,22 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   CHECK_GT(matrix->row_length, 0);
   size_t row_len = matrix->row_length;
   total_example_ += row_len;
+  std::vector<real_t> gradient_pull;
+  index_t min_fea_id = MAX_INT;
+  for (int i = 0; i < row_len; ++i) {
+    SparseRow* row = matrix->row[i];
+    for (SparseRow::const_iterator iter = row->begin();
+         iter != row->end(); ++iter) {
+      index_t idx = iter->feat_id;
+      gradient_pull.push_back(idx);
+      if (idx < min_fea_id) min_fea_id = idx;
+    }
+  }
+  std::sort(gradient_pull.begin(), gradient_pull.end());
+  gradient_pull.erase(unique(gradient_pull.begin(), gradient_pull.end()),
+                      gradient_pull.end());
+
+  std::vector<real_t> gradient_push(gradient_pull.size(), 0.0);
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
   std::vector<real_t> sum(count, 0);
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index d2b2d8b7..53c319f0 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -73,6 +73,9 @@ class Score {
   virtual real_t CalcScore(const SparseRow* row,
                            Model& model,
                            real_t norm = 1.0) = 0;
+  virtual real_t DistCalcGrad(const Matrix* matrix,
+                               Model& model,
+                               real_t norm = 1.0) = 0;
 
   // Calculate gradient and update current
   // model parameters

From ccd563ace4f790b18b0e9eb61cad3c43dccef51f Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Fri, 15 Dec 2017 22:08:16 +0800
Subject: [PATCH 17/82] update: CMakeLists.txt

---
 CMakeLists.txt | 3 ++-
 1 file changed, 2 insertions(+), 1 deletion(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 69b35d2f..c2542eaa 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -61,6 +61,7 @@ link_directories(
   "${PROJECT_BINARY_DIR}/src/score"
   "${PROJECT_BINARY_DIR}/src/loss"
   "${PROJECT_BINARY_DIR}/src/solver"
+  "${PROJECT_BINARY_DIR}/src/distributed"
   "${PROJECT_BINARY_DIR}/src/c_api"
 )
 
@@ -75,7 +76,7 @@ add_subdirectory(src/reader)
 add_subdirectory(src/score)
 add_subdirectory(src/loss)
 add_subdirectory(src/solver)
+add_subdirectory(src/distributed)
 add_subdirectory(src/c_api)
 add_subdirectory(python-package)
-#add_subdirectory(R-package)
 add_subdirectory(scripts)

From cba673fa9cb4a2fbe27d8593a9f93096fc9e2594 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Fri, 15 Dec 2017 22:08:41 +0800
Subject: [PATCH 18/82] add: src/distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt | 5 +++++
 1 file changed, 5 insertions(+)
 create mode 100644 src/distributed/CMakeLists.txt

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
new file mode 100644
index 00000000..ef2dad98
--- /dev/null
+++ b/src/distributed/CMakeLists.txt
@@ -0,0 +1,5 @@
+set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
+
+add_library(distributed STATIC linear_score.cc)
+
+add_library(distributed_shared SHARED linear_score.cc)

From 2048453902436cc5156bd264dc59f64c9312e87a Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 10:46:24 +0800
Subject: [PATCH 19/82] rm: dist_score_function.*

---
 src/distributed/dist_score_function.cc |  37 --------
 src/distributed/dist_score_function.h  | 119 -------------------------
 2 files changed, 156 deletions(-)
 delete mode 100644 src/distributed/dist_score_function.cc
 delete mode 100644 src/distributed/dist_score_function.h

diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
deleted file mode 100644
index 2bdba8c2..00000000
--- a/src/distributed/dist_score_function.cc
+++ /dev/null
@@ -1,37 +0,0 @@
-//------------------------------------------------------------------------------
-// Copyright (c) 2016 by contributors. All Rights Reserved.
-//
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//------------------------------------------------------------------------------
-
-/*
-Author: Chao Ma (mctt90@gmail.com)
-This file is the implementation of the base Score class.
-*/
-
-#include "src/score/score_function.h"
-#include "src/score/linear_score.h"
-#include "src/score/fm_score.h"
-#include "src/score/ffm_score.h"
-
-namespace xLearn {
-
-//------------------------------------------------------------------------------
-// Class register
-//------------------------------------------------------------------------------
-CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_score_registry, Score);
-REGISTER_SCORE("linear", LinearScore);
-REGISTER_SCORE("fm", FMScore);
-REGISTER_SCORE("ffm", FFMScore);
-
-}  // namespace xLearn
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
deleted file mode 100644
index 53c319f0..00000000
--- a/src/distributed/dist_score_function.h
+++ /dev/null
@@ -1,119 +0,0 @@
-//------------------------------------------------------------------------------
-// Copyright (c) 2016 by contributors. All Rights Reserved.
-//
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//------------------------------------------------------------------------------
-
-/*
-Author: Chao Ma (mctt90@gmail.com)
-This file defines the Score class, including linear score,
-FM score, FFM score, and etc.
-*/
-
-#ifndef XLEARN_LOSS_SCORE_FUNCTION_H_
-#define XLEARN_LOSS_SCORE_FUNCTION_H_
-
-#include <vector>
-
-#include "src/base/common.h"
-#include "src/base/class_register.h"
-#include "src/data/data_structure.h"
-#include "src/data/hyper_parameters.h"
-#include "src/data/model_parameters.h"
-
-namespace xLearn {
-
-//------------------------------------------------------------------------------
-// Score is an abstract class, which can be implemented by different
-// score functions such as LinearScore (liner_score.h), FMScore (fm_score.h)
-// FFMScore (ffm_score.h) etc. On common, we initial a Score function and
-// pass its pointer to a Loss class like this:
-//
-//  Score* score = new FMScore();
-//  score->CalcScore(row, model, norm);
-//  score->CalcGrad(row, model, pg, norm);
-//
-// In general, the CalcGrad() will be used in loss function.
-//------------------------------------------------------------------------------
-class Score {
- public:
-  // Constructor and Desstructor
-  Score() { }
-  virtual ~Score() { }
-
-  // Invoke this function before we use this class.
-  virtual void Initialize(real_t learning_rate,
-                          real_t regu_lambda,
-                          real_t alpha,
-                          real_t beta,
-                          real_t lambda_1,
-                          real_t lambda_2,
-                          std::string& opt_type) {
-    learning_rate_ = learning_rate;
-    regu_lambda_ = regu_lambda;
-    alpha_ = alpha;
-    beta_ = beta;
-    lambda_1_ = lambda_1;
-    lambda_2_ = lambda_2;
-    opt_type_ = opt_type;
-  }
-
-  // Given one exmaple and current model, this method
-  // returns the score
-  virtual real_t CalcScore(const SparseRow* row,
-                           Model& model,
-                           real_t norm = 1.0) = 0;
-  virtual real_t DistCalcGrad(const Matrix* matrix,
-                               Model& model,
-                               real_t norm = 1.0) = 0;
-
-  // Calculate gradient and update current
-  // model parameters
-  virtual void CalcGrad(const SparseRow* row,
-                        Model& model,
-                        real_t pg,
-                        real_t norm = 1.0) = 0;
-
- protected:
-  real_t learning_rate_;
-  real_t regu_lambda_;
-  real_t alpha_;
-  real_t beta_;
-  real_t lambda_1_;
-  real_t lambda_2_;
-  std::string opt_type_;
-
- private:
-  DISALLOW_COPY_AND_ASSIGN(Score);
-};
-
-//------------------------------------------------------------------------------
-// Class register
-//------------------------------------------------------------------------------
-CLASS_REGISTER_DEFINE_REGISTRY(xLearn_score_registry, Score);
-
-#define REGISTER_SCORE(format_name, score_name)             \
-  CLASS_REGISTER_OBJECT_CREATOR(                            \
-      xLearn_score_registry,                                \
-      Score,                                                \
-      format_name,                                          \
-      score_name)
-
-#define CREATE_SCORE(format_name)                           \
-  CLASS_REGISTER_CREATE_OBJECT(                             \
-      xLearn_score_registry,                                \
-      format_name)
-
-}  // namespace xLearn
-
-#endif  // XLEARN_LOSS_SCORE_FUNCTION_H_

From 10afe252153ee1ae59dbda8878741d340aaf7cf6 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 10:46:51 +0800
Subject: [PATCH 20/82] update: CMakeLists.txt

---
 CMakeLists.txt | 9 +++------
 1 file changed, 3 insertions(+), 6 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index aeeea79c..c2542eaa 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -30,8 +30,8 @@ cmake_minimum_required(VERSION 3.0)
 # Using c++11;
 # Optimization on architecture
 #-------------------------------------------------------------------------------
-add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 
--march=native -Wno-strict-aliasing -Wno-comment")
+add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
+-Wno-strict-aliasing -Wno-comment")
 
 #-------------------------------------------------------------------------------
 # Declare where our project will be installed.
@@ -52,7 +52,6 @@ include_directories(
   "${PROJECT_SOURCE_DIR}"
   "${PROJECT_BINARY_DIR}"
   "${PROJECT_SOURCE_DIR}/gtest/include"
-#  "/usr/share/R/include"
 )
 
 link_directories(
@@ -64,7 +63,6 @@ link_directories(
   "${PROJECT_BINARY_DIR}/src/solver"
   "${PROJECT_BINARY_DIR}/src/distributed"
   "${PROJECT_BINARY_DIR}/src/c_api"
-#  "/usr/lib/R/lib"
 )
 
 #-------------------------------------------------------------------------------
@@ -72,7 +70,6 @@ link_directories(
 #-------------------------------------------------------------------------------
 add_subdirectory(gtest)
 add_subdirectory(demo)
-add_subdirectory(scripts)
 add_subdirectory(src/base)
 add_subdirectory(src/data)
 add_subdirectory(src/reader)
@@ -82,4 +79,4 @@ add_subdirectory(src/solver)
 add_subdirectory(src/distributed)
 add_subdirectory(src/c_api)
 add_subdirectory(python-package)
-#add_subdirectory(R-package)
+add_subdirectory(scripts)

From 71380f69968f07d404d5aae555e383137e16992f Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 10:47:06 +0800
Subject: [PATCH 21/82] add: dist_cross_entropy_loss.cc

---
 src/distributed/dist_cross_entropy_loss.cc | 26 +++++++++++++++-------
 1 file changed, 18 insertions(+), 8 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 158cf571..f6639733 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -88,7 +88,7 @@ static void ce_gradient_thread(const DMatrix* matrix,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  score_func_->DistCalcScore(matrix, model, start_idx, end_idx);
+  score_func->DistCalcScore(matrix, weight_map, sum, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -110,22 +110,31 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   CHECK_GT(matrix->row_length, 0);
   size_t row_len = matrix->row_length;
   total_example_ += row_len;
+  std::vector<index_t> feature_ids;
   std::vector<real_t> gradient_pull;
-  index_t min_fea_id = MAX_INT;
+  std::unordered_map<index_t, real_t> weight_map;
   for (int i = 0; i < row_len; ++i) {
     SparseRow* row = matrix->row[i];
     for (SparseRow::const_iterator iter = row->begin();
          iter != row->end(); ++iter) {
       index_t idx = iter->feat_id;
-      gradient_pull.push_back(idx);
-      if (idx < min_fea_id) min_fea_id = idx;
+      feature_ids.push_back(idx);
+      weight_map[idx] = 0.0;
     }
   }
-  std::sort(gradient_pull.begin(), gradient_pull.end());
-  gradient_pull.erase(unique(gradient_pull.begin(), gradient_pull.end()),
-                      gradient_pull.end());
+  std::sort(feature_ids.begin(), feature_ids.end());
+  feature_ids.erase(unique(feature_ids.begin(), feature_ids.end()),
+                      feature_ids.end());
 
-  std::vector<real_t> gradient_push(gradient_pull.size(), 0.0);
+  gradient_pull.resize(feature_ids.size);
+  if (model->score_func_.compare("linear_dist") == 0) {
+    kv_w_.Pull(feature_ids, gradient_pull);
+  }
+  for (int i = 0; i < gradient_pull.size(); ++i) {
+    index_t idx = feature_ids[i];
+    real_t weight = gradient_pull[i];
+    weight_map[idx] = weight;
+  }
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
   std::vector<real_t> sum(count, 0);
@@ -135,6 +144,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
                              &model,
+                             weight_map,
                              score_func_,
                              norm_,
                              &(sum[i]),

From 34f15c75afdf46729dec22ca8502ca3b7fa79d82 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 10:48:40 +0800
Subject: [PATCH 22/82] rm: dist_squared_loss.*

---
 src/distributed/dist_squared_loss.cc | 145 ---------------------------
 src/distributed/dist_squared_loss.h  |  59 -----------
 2 files changed, 204 deletions(-)
 delete mode 100644 src/distributed/dist_squared_loss.cc
 delete mode 100644 src/distributed/dist_squared_loss.h

diff --git a/src/distributed/dist_squared_loss.cc b/src/distributed/dist_squared_loss.cc
deleted file mode 100644
index 08ff6a54..00000000
--- a/src/distributed/dist_squared_loss.cc
+++ /dev/null
@@ -1,145 +0,0 @@
-//------------------------------------------------------------------------------
-// Copyright (c) 2016 by contributors. All Rights Reserved.
-//
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//------------------------------------------------------------------------------
-
-/*
-Author: Chao Ma (mctt90@gmail.com)
-This file is the implementation of SquaredLoss class.
-*/
-
-#include "src/loss/dist_squared_loss.h"
-
-namespace xLearn {
-
-// Calculate loss in one thread.
-static void sq_evalute_thread(const std::vector<real_t>* pred,
-                              const std::vector<real_t>* label,
-                              real_t* tmp_sum,
-                              size_t start_idx,
-                              size_t end_idx) {
-  CHECK_GE(end_idx, start_idx);
-  *tmp_sum = 0;
-  for (size_t i = start_idx; i < end_idx; ++i) {
-    real_t error = (*label)[i] - (*pred)[i];
-    (*tmp_sum) += (error*error);
-  }
-  *tmp_sum *= 0.5;
-}
-
-//------------------------------------------------------------------------------
-// Calculate loss in multi-thread:
-//
-//                         master_thread
-//                      /       |         \
-//                     /        |          \
-//                thread_1    thread_2    thread_3
-//                   |           |           |
-//                    \          |           /
-//                     \         |          /
-//                       \       |        /
-//                         master_thread
-//------------------------------------------------------------------------------
-void DistSquaredLoss::Evalute(const std::vector<real_t>& pred,
-                          const std::vector<real_t>& label) {
-  CHECK_NE(pred.empty(), true);
-  CHECK_NE(label.empty(), true);
-  total_example_ += pred.size();
-  // multi-thread training
-  std::vector<real_t> sum(threadNumber_, 0);
-  for (int i = 0; i < threadNumber_; ++i) {
-    size_t start_idx = getStart(pred.size(), threadNumber_, i);
-    size_t end_idx = getEnd(pred.size(), threadNumber_, i);
-    pool_->enqueue(std::bind(sq_evalute_thread,
-                             &pred,
-                             &label,
-                             &(sum[i]),
-                             start_idx,
-                             end_idx));
-  }
-  // Wait all of the threads finish their job
-  pool_->Sync(threadNumber_);
-  // Accumulate loss
-  for (size_t i = 0; i < sum.size(); ++i) {
-    loss_sum_ += sum[i];
-  }
-}
-
-// Calculate gradient in one thread
-void sq_gradient_thread(const DMatrix* matrix,
-                        Model* model,
-                        Score* score_func,
-                        bool is_norm,
-                        real_t* sum,
-                        index_t start,
-                        index_t end) {
-  CHECK_GE(end, start);
-  *sum = 0;
-  for (size_t i = start; i < end; ++i) {
-    SparseRow* row = matrix->row[i];
-    real_t norm = is_norm ? matrix->norm[i] : 1.0;
-    real_t pred = score_func->CalcScore(row, *model, norm);
-    // loss
-    real_t error = matrix->Y[i] - pred;
-    *sum += (error*error);
-    // partial gradient: -error
-    real_t pg = pred - matrix->Y[i];
-    // real gradient and update
-    score_func->CalcGrad(row, *model, pg, norm);
-  }
-  *sum *= 0.5;
-}
-
-//------------------------------------------------------------------------------
-// Calculate gradient in multi-thread
-//
-//                         master_thread
-//                      /       |         \
-//                     /        |          \
-//                thread_1    thread_2    thread_3
-//                   |           |           |
-//                    \          |           /
-//                     \         |          /
-//                       \       |        /
-//                         master_thread
-//------------------------------------------------------------------------------
-void DistSquaredLoss::CalcGrad(const DMatrix* matrix,
-                           Model& model) {
-  CHECK_NOTNULL(matrix);
-  CHECK_GT(matrix->row_length, 0);
-  size_t row_len = matrix->row_length;
-  total_example_ += row_len;
-  int count = lock_free_ ? threadNumber_ : 1;
-  std::vector<real_t> sum(count, 0);
-  for (int i = 0; i < count; ++i) {
-    size_t start = getStart(row_len, count, i);
-    size_t end = getEnd(row_len, count, i);
-    pool_->enqueue(std::bind(sq_gradient_thread,
-                             matrix,
-                             &model,
-                             score_func_,
-                             norm_,
-                             &(sum[i]),
-                             start,
-                             end));
-  }
-  // Wait all of the threads finish their job
-  pool_->Sync(count);
-  // Accumulate loss
-  for (int i = 0; i < sum.size(); ++i) {
-    loss_sum_ += sum[i];
-  }
-}
-
-} // namespace xLearn
diff --git a/src/distributed/dist_squared_loss.h b/src/distributed/dist_squared_loss.h
deleted file mode 100644
index c7f0b57a..00000000
--- a/src/distributed/dist_squared_loss.h
+++ /dev/null
@@ -1,59 +0,0 @@
-//------------------------------------------------------------------------------
-// Copyright (c) 2016 by contributors. All Rights Reserved.
-//
-// Licensed under the Apache License, Version 2.0 (the "License");
-// you may not use this file except in compliance with the License.
-// You may obtain a copy of the License at
-//
-//     http://www.apache.org/licenses/LICENSE-2.0
-//
-// Unless required by applicable law or agreed to in writing, software
-// distributed under the License is distributed on an "AS IS" BASIS,
-// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-// See the License for the specific language governing permissions and
-// limitations under the License.
-//------------------------------------------------------------------------------
-
-/*
-Author: Chao Ma (mctt90@gmail.com)
-This file defines the SquaredLoss class.
-*/
-
-#ifndef XLEARN_LOSS_DIST_SQUARED_LOSS_H_
-#define XLEARN_LOSS_DIST_SQUARED_LOSS_H_
-
-#include "src/base/common.h"
-#include "src/loss/loss.h"
-
-namespace xLearn {
-
-//------------------------------------------------------------------------------
-// SquaredLoss is used for regression tasks in machine learning, which
-// has the following form:
-// loss = sum_all_example( (y - pred) ^ 2 )
-//------------------------------------------------------------------------------
-class DistSquaredLoss : public Loss {
- public:
-  // Constructor and Desstructor
-  DistSquaredLoss() { };
-  ~DistSquaredLoss() { }
-
-  // Given predictions and labels, accumulate loss value.
-  void Evalute(const std::vector<real_t>& pred,
-                 const std::vector<real_t>& label);
-
-  // Given data sample and current model, calculate gradient
-  // and update current model parameters.
-  // This function will also accumulate the loss value.
-  void CalcGrad(const DMatrix* data_matrix, Model& model);
-
-  // Return current loss type
-  std::string loss_type() { return "mse_loss"; }
-
- private:
-  DISALLOW_COPY_AND_ASSIGN(DistSquaredLoss);
-};
-
-} // namespace xLearn
-
-#endif // XLEARN_LOSS_DIST_SQUARED_LOSS_H_

From 7d06b2b94fc7f911250e2b6c4766364b8cbe7eba Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 11:51:55 +0800
Subject: [PATCH 23/82] update: distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index ef2dad98..25dffc3b 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,5 +1,5 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
-add_library(distributed STATIC linear_score.cc)
+add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc)
 
-add_library(distributed_shared SHARED linear_score.cc)
+add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc)

From 67d6e277b84a541bd910de7130d9accd79e72dd6 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 12:38:37 +0800
Subject: [PATCH 24/82] update: score

---
 src/distributed/dist_linear_score.cc   | 131 +++++++++++++++++++++++++
 src/distributed/dist_linear_score.h    |  95 ++++++++++++++++++
 src/distributed/dist_score_function.cc |  37 +++++++
 src/distributed/dist_score_function.h  | 124 +++++++++++++++++++++++
 4 files changed, 387 insertions(+)
 create mode 100644 src/distributed/dist_linear_score.cc
 create mode 100644 src/distributed/dist_linear_score.h
 create mode 100644 src/distributed/dist_score_function.cc
 create mode 100644 src/distributed/dist_score_function.h

diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
new file mode 100644
index 00000000..dc8bdac2
--- /dev/null
+++ b/src/distributed/dist_linear_score.cc
@@ -0,0 +1,131 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of LinearScore class.
+*/
+
+#include "src/score/dist_linear_score.h"
+#include "src/base/math.h"
+
+namespace xLearn {
+
+// y = wTx (incluing bias term)
+real_t DistLinearScore::CalcScore(const SparseRow* row,
+                                  std::unordered_map<index_t, real_t>* w,
+                                  real_t norm) {
+  real_t score = 0.0;
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t idx = iter->feat_id;
+    score += w[idx] * iter->feat_val;
+  }
+  return score;
+}
+
+// Calculate gradient and update current model
+void DistLinearScore::CalcDistGrad(const Matrix* matrix,
+                           std::unordered_map<index_t, real_t>* w,
+                           real_t* sum;
+                           std::unordered_map<index_t, real_t>* g,
+                           real_t start_idx,
+                           real_t end_idx) {
+  // Using sgd
+  if (opt_type_.compare("sgd") == 0) {
+    this->calc_grad_sgd(matrix, w, sum, g, start_idx, end_idx);
+  }
+  // Using adagrad
+  else if (opt_type_.compare("adagrad") == 0) {
+    this->calc_grad_adagrad(matrix, w, sum, g, start_idx, end_idx);
+  }
+  // Using ftrl
+  else if (opt_type_.compare("ftrl") == 0) {
+    this->calc_grad_ftrl(matrix, w, sum, g, start_idx, end_idx);
+  }
+}
+
+// Calculate gradient and update current model using sgd
+void DistLinearScore::calc_grad_sgd(const Matrix* matrix,
+                                std::unordered_map<index_t, real_t>* w,
+                                real_t* sum,
+                                std::unordered_map<index_t, real_t>* g,
+                                real_t start_idx,
+                                real_t end_idx) {
+  // linear term
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, w, norm);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    sum += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t idx_g = iter->feat_id;
+      real_t gradient = pg * iter->feat_val;
+      gradient += regu_lambda_ * w[idx_g]; // get gradient
+      g[idx_g] += gradient;
+    }
+  }
+}
+
+// Calculate gradient and update current model using adagrad
+void DistLinearScore::calc_grad_adagrad(const Matrix* matrix,
+                                    std::unordered_map<index_t, real_t>* w,
+                                    real_t* sum,
+                                    std::unordered_map<index_t, real_t>* g,
+                                    real_t start_idx,
+                                    real_t end_idx) {
+  // linear term
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, w, norm);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    sum += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t idx_g = iter->feat_id;
+      real_t gradient = pg * iter->feat_val;
+      gradient += regu_lambda_ * w[idx_g]; // get gradient
+      g[idx_g] += gradient;
+    }
+  }
+}
+
+// Calculate gradient and update current model using ftrl
+void DistLinearScore::calc_grad_ftrl(const Matrix* matrix,
+                                 std::unordered_map<index_t, real_t>* w,
+                                 real_t* sum,
+                                 std::unordered_map<index_t, real_t>* g,
+                                 real_t start_idx,
+                                 real_t end_idx) {
+  for (int i = 0; i < start_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, w, norm);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    sum += log1p(exp(-y * pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t idx_g = iter->feat_id;
+      real_t gradient = pg * iter->feat_val; // get gradient
+      g[idx_g] += gradient;
+    }
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
new file mode 100644
index 00000000..2681138a
--- /dev/null
+++ b/src/distributed/dist_linear_score.h
@@ -0,0 +1,95 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the LinearScore class.
+*/
+
+#ifndef XLEARN_DIST_LINEAR_SCORE_H_
+#define XLEARN_DIST_LINEAR_SCORE_H_
+
+#include "src/base/common.h"
+#include "src/data/model_parameters.h"
+#include "src/score/dist_score_function.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// LinearScore is used to implemente generalized linear
+// models (GLMs), where the socre function is y = wTx.
+//------------------------------------------------------------------------------
+class DistLinearScore : public DistScore {
+ public:
+  // Constructor and Desstructor
+  DistLinearScore() { }
+  ~DistLinearScore() { }
+
+  // Given one exmaple and current model, this method
+  // returns the linear score wTx.
+  real_t CalcScore(const SparseRow* row,
+                   std::unordered_map<index_t, real_t>* w,
+                   real_t norm = 1.0);
+
+  void DistCalcScore(const Matrix* matrix,
+                     std::unordered_map<index_t, real_t>* w,
+                     real_t* sum,
+                     std::unordered_map<index_t, real_t>* g,
+                     index_t start_idx,
+                     index_t end_idx);
+
+  // Calculate gradient and update current
+  // model parameters.
+  void CalcGrad(const SparseRow* row,
+                Model& model,
+                real_t pg,
+                real_t norm = 1.0);
+
+ protected:
+  // Calculate gradient and update model using sgd
+  void calc_grad_sgd(const Matrix* matrix,
+                     std::unordered_map<index_t, real_t>* w,
+                     real_t* sum,
+                     std::unordered_map<index_t, real_t>* g,
+                     real_t start_idx,
+                     real_t end_idx
+                    );
+
+  // Calculate gradient and update model using adagrad
+  void calc_grad_adagrad(const Matrix* matrix,
+                         std::unordered_map<index_t, real_t>* w,
+                         real_t* sum,
+                         std::unordered_map<index_t, real_t>* g,
+                         real_t start_idx,
+                         real_t end_idx
+                        );
+
+  // Calculate gradient and update model using ftrl
+  void calc_grad_ftrl(const Matrix* matrix,
+                      std::unordered_map<index_t, real_t>* w,
+                      real_t* sum,
+                      std::unordered_map<index_t, real_t>* g,
+                      real_t start_idx,
+                      real_t end_idx
+                     );
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(LinearScore);
+};
+
+}  // namespace xLearn
+
+#endif  // XLEARN_LINEAR_SCORE_H_
diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
new file mode 100644
index 00000000..4a805d87
--- /dev/null
+++ b/src/distributed/dist_score_function.cc
@@ -0,0 +1,37 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the base Score class.
+*/
+
+#include "src/score/dist_score_function.h"
+#include "src/score/linear_score.h"
+//#include "src/score/fm_score.h"
+//#include "src/score/ffm_score.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_score_registry, DistScore);
+REGISTER_SCORE("dist_linear", DistLinearScore);
+//REGISTER_SCORE("fm", FMScore);
+//REGISTER_SCORE("ffm", FFMScore);
+
+}  // namespace xLearn
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
new file mode 100644
index 00000000..a294f5e6
--- /dev/null
+++ b/src/distributed/dist_score_function.h
@@ -0,0 +1,124 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the Score class, including linear score,
+FM score, FFM score, and etc.
+*/
+
+#ifndef XLEARN_LOSS_DIST_SCORE_FUNCTION_H_
+#define XLEARN_LOSS_DIST_SCORE_FUNCTION_H_
+
+#include <vector>
+#include <unordered_map>
+
+#include "src/base/common.h"
+#include "src/base/class_register.h"
+#include "src/data/data_structure.h"
+#include "src/data/hyper_parameters.h"
+#include "src/data/model_parameters.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Score is an abstract class, which can be implemented by different
+// score functions such as LinearScore (liner_score.h), FMScore (fm_score.h)
+// FFMScore (ffm_score.h) etc. On common, we initial a Score function and
+// pass its pointer to a Loss class like this:
+//
+//  Score* score = new FMScore();
+//  score->CalcScore(row, model, norm);
+//  score->CalcGrad(row, model, pg, norm);
+//
+// In general, the CalcGrad() will be used in loss function.
+//------------------------------------------------------------------------------
+class DistScore {
+ public:
+  // Constructor and Desstructor
+  DistScore() { }
+  virtual ~DistScore() { }
+
+  // Invoke this function before we use this class.
+  virtual void Initialize(real_t learning_rate,
+                          real_t regu_lambda,
+                          real_t alpha,
+                          real_t beta,
+                          real_t lambda_1,
+                          real_t lambda_2,
+                          std::string& opt_type) {
+    learning_rate_ = learning_rate;
+    regu_lambda_ = regu_lambda;
+    alpha_ = alpha;
+    beta_ = beta;
+    lambda_1_ = lambda_1;
+    lambda_2_ = lambda_2;
+    opt_type_ = opt_type;
+  }
+
+  // Given one exmaple and current model, this method
+  // returns the score
+  virtual real_t CalcScore(const SparseRow* row,
+                           std::unordered_map<index_t, real_t>* w,
+                           real_t norm = 1.0) = 0;
+
+  virtual real_t DistCalcScore(const Matrix* matrix,
+                               std::unordered_map<index_t, real_t>* w,
+                               real_t* sum,
+                               std::unordered_map<index_t, real_t>* g,
+                               size_t start_idx,
+                               size_t end_idx) = 0;
+
+  // Calculate gradient and update current
+  // model parameters
+  virtual void DistCalcGrad(const SparseRow* row,
+                        Model& model,
+                        real_t pg,
+                        real_t norm = 1.0) = 0;
+
+ protected:
+  real_t learning_rate_;
+  real_t regu_lambda_;
+  real_t alpha_;
+  real_t beta_;
+  real_t lambda_1_;
+  real_t lambda_2_;
+  std::string opt_type_;
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(Score);
+};
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_DEFINE_REGISTRY(xLearn_score_registry, Score);
+
+#define REGISTER_SCORE(format_name, score_name)             \
+  CLASS_REGISTER_OBJECT_CREATOR(                            \
+      xLearn_score_registry,                                \
+      Score,                                                \
+      format_name,                                          \
+      score_name)
+
+#define CREATE_SCORE(format_name)                           \
+  CLASS_REGISTER_CREATE_OBJECT(                             \
+      xLearn_score_registry,                                \
+      format_name)
+
+}  // namespace xLearn
+
+#endif  // XLEARN_LOSS_SCORE_FUNCTION_H_

From 2ec801bd33954a213d3d432c47df451366e04631 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 12:39:16 +0800
Subject: [PATCH 25/82] update: loss

---
 src/distributed/CMakeLists.txt             |  4 ++++
 src/distributed/dist_cross_entropy_loss.cc | 19 ++++++++++++++++---
 src/loss/loss.h                            | 12 +++++++++++-
 3 files changed, 31 insertions(+), 4 deletions(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index 25dffc3b..f877ee1a 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,5 +1,9 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
+set(STA_DEPS data base)
 add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc)
+target_link_libraries(distributed ${STA_DEPS})
 
+set(SHA_DEPS data_shared base_shared)
 add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc)
+target_link_libraries(distributed_shared ${SHA_DEPS})
diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index f6639733..4bc702e2 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -23,6 +23,7 @@ This file is the implementation of CrossEntropyLoss class.
 
 #include<thread>
 #include<atomic>
+#include<unordered_map>
 
 namespace xLearn {
 
@@ -81,14 +82,15 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
-                               Model* model,
+                               std::unordered_map<index_t, real_t>* w,
                                Score* score_func,
                                bool is_norm,
                                real_t* sum,
+                               std::unordered_map<index_t, real_t>* g,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  score_func->DistCalcScore(matrix, weight_map, sum, start_idx, end_idx);
+  score_func->DistCalcScore(matrix, w, sum, g, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -113,6 +115,8 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   std::vector<index_t> feature_ids;
   std::vector<real_t> gradient_pull;
   std::unordered_map<index_t, real_t> weight_map;
+  std::unordered_map<index_t, real_t> gradient_push_map;
+  std::vector<real_t> gradient_push;
   for (int i = 0; i < row_len; ++i) {
     SparseRow* row = matrix->row[i];
     for (SparseRow::const_iterator iter = row->begin();
@@ -135,6 +139,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     real_t weight = gradient_pull[i];
     weight_map[idx] = weight;
   }
+  gradient_push_map.resize(feature_ids.size(), 0.0);
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
   std::vector<real_t> sum(count, 0);
@@ -143,16 +148,24 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
-                             &model,
                              weight_map,
                              score_func_,
                              norm_,
                              &(sum[i]),
+                             gradient_push_map,
                              start_idx,
                              end_idx));
   }
   // Wait all of the threads finish their job
   pool_->Sync(count);
+  for (int i = 0; i < feat_ids.size(); ++i) {
+    index_t idx = feature_ids[i];
+    real_t g = gradient_push_map[idx];
+    gradient_pull.push_back(g);
+  }
+  if (model->score_func_.compare("dist_linear") == 0) {
+    kv_w_.Push(feat_ids, gradient_push);
+  }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
     loss_sum_ += sum[i];
diff --git a/src/loss/loss.h b/src/loss/loss.h
index 986feb3b..2bc277d0 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -33,6 +33,8 @@ function or objective function.
 #include "src/data/model_parameters.h"
 #include "src/score/score_function.h"
 
+#include "ps/ps.h"
+
 namespace xLearn {
 
 //------------------------------------------------------------------------------
@@ -71,7 +73,10 @@ namespace xLearn {
 class Loss {
  public:
   // Constructor and Desstructor
-  Loss() : loss_sum_(0), total_example_ (0) { };
+  Loss() : loss_sum_(0), total_example_ (0) { 
+    kv_w_ = new ps::KVWorker<float>(0);
+    kv_v_ = new ps::KVWorker<float>(1);
+  };
   virtual ~Loss() { }
 
   // This function needs to be invoked before using this class
@@ -133,6 +138,11 @@ class Loss {
   real_t loss_sum_;
   /* Used to store the number of example */
   index_t total_example_;
+  /* kv store for w */
+  ps::KVWorker<float>* kv_w_;
+  /* kv store for v */
+  ps::KVWorker<float>* kv_v_;
+
 
  private:
   DISALLOW_COPY_AND_ASSIGN(Loss);

From 7d1ceb08072e1804fa23bfb9f9a9becc32d63dae Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 12:39:56 +0800
Subject: [PATCH 26/82] add: ps-lite

---
 CMakeLists.txt                                |    4 +
 ps-lite/CMakeLists.txt                        |   65 +
 ps-lite/LICENSE                               |  201 +
 ps-lite/Makefile                              |   52 +
 ps-lite/README.md                             |   95 +
 ps-lite/cmake/External/zmq.cmake              |   62 +
 ps-lite/cmake/Modules/FindZMQ.cmake           |   17 +
 ps-lite/cmake/ProtoBuf.cmake                  |   86 +
 ps-lite/deps/bin/curve_keygen                 |  Bin 0 -> 8592 bytes
 ps-lite/deps/bin/protoc                       |  Bin 0 -> 15580 bytes
 .../google/protobuf/compiler/code_generator.h |  142 +
 .../compiler/command_line_interface.h         |  353 +
 .../protobuf/compiler/cpp/cpp_generator.h     |   72 +
 .../google/protobuf/compiler/importer.h       |  304 +
 .../protobuf/compiler/java/java_generator.h   |   72 +
 .../include/google/protobuf/compiler/parser.h |  477 ++
 .../include/google/protobuf/compiler/plugin.h |   72 +
 .../google/protobuf/compiler/plugin.pb.h      |  856 +++
 .../google/protobuf/compiler/plugin.proto     |  147 +
 .../compiler/python/python_generator.h        |  161 +
 .../deps/include/google/protobuf/descriptor.h | 1521 +++++
 .../include/google/protobuf/descriptor.pb.h   | 5992 +++++++++++++++++
 .../include/google/protobuf/descriptor.proto  |  620 ++
 .../google/protobuf/descriptor_database.h     |  367 +
 .../include/google/protobuf/dynamic_message.h |  136 +
 .../include/google/protobuf/extension_set.h   | 1007 +++
 .../protobuf/generated_enum_reflection.h      |   85 +
 .../protobuf/generated_message_reflection.h   |  419 ++
 .../google/protobuf/generated_message_util.h  |   77 +
 .../include/google/protobuf/io/coded_stream.h | 1136 ++++
 .../include/google/protobuf/io/gzip_stream.h  |  209 +
 .../deps/include/google/protobuf/io/printer.h |  136 +
 .../include/google/protobuf/io/tokenizer.h    |  384 ++
 .../google/protobuf/io/zero_copy_stream.h     |  238 +
 .../protobuf/io/zero_copy_stream_impl.h       |  357 +
 .../protobuf/io/zero_copy_stream_impl_lite.h  |  340 +
 .../deps/include/google/protobuf/message.h    |  837 +++
 .../include/google/protobuf/message_lite.h    |  246 +
 .../include/google/protobuf/reflection_ops.h  |   81 +
 .../include/google/protobuf/repeated_field.h  | 1519 +++++
 .../deps/include/google/protobuf/service.h    |  291 +
 .../include/google/protobuf/stubs/atomicops.h |  206 +
 .../stubs/atomicops_internals_arm_gcc.h       |  151 +
 .../stubs/atomicops_internals_arm_qnx.h       |  146 +
 .../atomicops_internals_atomicword_compat.h   |  122 +
 .../stubs/atomicops_internals_macosx.h        |  225 +
 .../stubs/atomicops_internals_mips_gcc.h      |  187 +
 .../stubs/atomicops_internals_pnacl.h         |   73 +
 .../stubs/atomicops_internals_x86_gcc.h       |  293 +
 .../stubs/atomicops_internals_x86_msvc.h      |  150 +
 .../include/google/protobuf/stubs/common.h    | 1223 ++++
 .../deps/include/google/protobuf/stubs/once.h |  148 +
 .../google/protobuf/stubs/platform_macros.h   |   70 +
 .../google/protobuf/stubs/template_util.h     |  138 +
 .../google/protobuf/stubs/type_traits.h       |  336 +
 .../include/google/protobuf/text_format.h     |  369 +
 .../google/protobuf/unknown_field_set.h       |  311 +
 .../include/google/protobuf/wire_format.h     |  308 +
 .../google/protobuf/wire_format_lite.h        |  622 ++
 .../google/protobuf/wire_format_lite_inl.h    |  776 +++
 ps-lite/deps/include/zmq.h                    |  463 ++
 ps-lite/deps/include/zmq_utils.h              |   20 +
 ps-lite/deps/lib/pkgconfig/libzmq.pc          |   10 +
 ps-lite/deps/lib/pkgconfig/protobuf-lite.pc   |   13 +
 ps-lite/deps/lib/pkgconfig/protobuf.pc        |   14 +
 ps-lite/deps/share/man/man3/zmq_bind.3        |  194 +
 ps-lite/deps/share/man/man3/zmq_close.3       |   70 +
 ps-lite/deps/share/man/man3/zmq_connect.3     |  171 +
 ps-lite/deps/share/man/man3/zmq_ctx_get.3     |   85 +
 ps-lite/deps/share/man/man3/zmq_ctx_new.3     |   55 +
 ps-lite/deps/share/man/man3/zmq_ctx_set.3     |  148 +
 .../deps/share/man/man3/zmq_ctx_shutdown.3    |   58 +
 ps-lite/deps/share/man/man3/zmq_ctx_term.3    |  129 +
 .../deps/share/man/man3/zmq_curve_keypair.3   |   69 +
 ps-lite/deps/share/man/man3/zmq_disconnect.3  |  113 +
 ps-lite/deps/share/man/man3/zmq_errno.3       |   67 +
 ps-lite/deps/share/man/man3/zmq_getsockopt.3  | 1879 ++++++
 ps-lite/deps/share/man/man3/zmq_has.3         |  113 +
 ps-lite/deps/share/man/man3/zmq_msg_close.3   |   70 +
 ps-lite/deps/share/man/man3/zmq_msg_copy.3    |  106 +
 ps-lite/deps/share/man/man3/zmq_msg_data.3    |   65 +
 ps-lite/deps/share/man/man3/zmq_msg_get.3     |  104 +
 ps-lite/deps/share/man/man3/zmq_msg_gets.3    |   93 +
 ps-lite/deps/share/man/man3/zmq_msg_init.3    |   99 +
 .../deps/share/man/man3/zmq_msg_init_data.3   |  146 +
 .../deps/share/man/man3/zmq_msg_init_size.3   |   86 +
 ps-lite/deps/share/man/man3/zmq_msg_more.3    |   75 +
 ps-lite/deps/share/man/man3/zmq_msg_move.3    |   68 +
 ps-lite/deps/share/man/man3/zmq_msg_recv.3    |  161 +
 ps-lite/deps/share/man/man3/zmq_msg_send.3    |  179 +
 ps-lite/deps/share/man/man3/zmq_msg_set.3     |   56 +
 ps-lite/deps/share/man/man3/zmq_msg_size.3    |   65 +
 ps-lite/deps/share/man/man3/zmq_poll.3        |  177 +
 ps-lite/deps/share/man/man3/zmq_proxy.3       |   89 +
 .../deps/share/man/man3/zmq_proxy_steerable.3 |  112 +
 ps-lite/deps/share/man/man3/zmq_recv.3        |  122 +
 ps-lite/deps/share/man/man3/zmq_recvmsg.3     |  175 +
 ps-lite/deps/share/man/man3/zmq_send.3        |  153 +
 ps-lite/deps/share/man/man3/zmq_send_const.3  |  153 +
 ps-lite/deps/share/man/man3/zmq_sendmsg.3     |  193 +
 ps-lite/deps/share/man/man3/zmq_setsockopt.3  | 2473 +++++++
 ps-lite/deps/share/man/man3/zmq_socket.3      | 1025 +++
 .../deps/share/man/man3/zmq_socket_monitor.3  |  235 +
 ps-lite/deps/share/man/man3/zmq_strerror.3    |   67 +
 ps-lite/deps/share/man/man3/zmq_unbind.3      |  120 +
 ps-lite/deps/share/man/man3/zmq_version.3     |   67 +
 ps-lite/deps/share/man/man3/zmq_z85_decode.3  |   64 +
 ps-lite/deps/share/man/man3/zmq_z85_encode.3  |   69 +
 ps-lite/deps/share/man/man7/zmq.7             |  246 +
 ps-lite/deps/share/man/man7/zmq_curve.7       |   93 +
 ps-lite/deps/share/man/man7/zmq_inproc.7      |  103 +
 ps-lite/deps/share/man/man7/zmq_ipc.7         |  166 +
 ps-lite/deps/share/man/man7/zmq_null.7        |   40 +
 ps-lite/deps/share/man/man7/zmq_pgm.7         |  200 +
 ps-lite/deps/share/man/man7/zmq_plain.7       |   43 +
 ps-lite/deps/share/man/man7/zmq_tcp.7         |  188 +
 ps-lite/deps/share/man/man7/zmq_tipc.7        |  106 +
 ps-lite/docs/Doxyfile                         | 2310 +++++++
 ps-lite/docs/Makefile                         |  216 +
 ps-lite/docs/api.md                           |   40 +
 ps-lite/docs/conf.py                          |  315 +
 ps-lite/docs/env.md                           |   15 +
 ps-lite/docs/get_started.md                   |    1 +
 ps-lite/docs/how_to.md                        |   74 +
 ps-lite/docs/index.md                         |   16 +
 ps-lite/docs/overview.md                      |  184 +
 ps-lite/docs/requirements.txt                 |    1 +
 ps-lite/docs/sphinx_util.py                   |   19 +
 ps-lite/docs/tutorials.md                     |    1 +
 ps-lite/include/dmlc/base.h                   |  178 +
 ps-lite/include/dmlc/logging.h                |  234 +
 ps-lite/include/ps/base.h                     |   33 +
 ps-lite/include/ps/internal/assign_op.h       |   72 +
 ps-lite/include/ps/internal/customer.h        |  102 +
 ps-lite/include/ps/internal/env.h             |   63 +
 ps-lite/include/ps/internal/message.h         |  218 +
 .../include/ps/internal/parallel_kv_match.h   |  123 +
 ps-lite/include/ps/internal/parallel_sort.h   |   58 +
 ps-lite/include/ps/internal/postoffice.h      |  189 +
 .../include/ps/internal/threadsafe_queue.h    |   59 +
 ps-lite/include/ps/internal/utils.h           |   48 +
 ps-lite/include/ps/internal/van.h             |  130 +
 ps-lite/include/ps/kv_app.h                   |  607 ++
 ps-lite/include/ps/ps.h                       |   78 +
 ps-lite/include/ps/range.h                    |   26 +
 ps-lite/include/ps/sarray.h                   |  315 +
 ps-lite/include/ps/simple_app.h               |  179 +
 ps-lite/make/deps.mk                          |   68 +
 ps-lite/make/ps.mk                            |   13 +
 ps-lite/src/customer.cc                       |   66 +
 ps-lite/src/meta.proto                        |   49 +
 ps-lite/src/network_utils.h                   |  258 +
 ps-lite/src/postoffice.cc                     |  176 +
 ps-lite/src/resender.h                        |  141 +
 ps-lite/src/van.cc                            |  422 ++
 ps-lite/src/windows/unistd.h                  |   48 +
 ps-lite/src/zmq_van.h                         |  287 +
 ps-lite/tags                                  | 4116 +++++++++++
 ps-lite/tests/README.md                       |    7 +
 ps-lite/tests/lint.py                         |  173 +
 ps-lite/tests/local.sh                        |   37 +
 ps-lite/tests/repeat.sh                       |   16 +
 ps-lite/tests/test.mk                         |   10 +
 ps-lite/tests/travis/travis_before_cache.sh   |    3 +
 ps-lite/tests/travis/travis_script.sh         |   16 +
 ps-lite/tests/travis/travis_setup_env.sh      |   12 +
 ps-lite/tracker/README.md                     |   26 +
 ps-lite/tracker/dmlc_local.py                 |  100 +
 ps-lite/tracker/dmlc_mpi.py                   |   91 +
 ps-lite/tracker/dmlc_ssh.py                   |  113 +
 ps-lite/tracker/tracker.py                    |  433 ++
 171 files changed, 49198 insertions(+)
 create mode 100644 ps-lite/CMakeLists.txt
 create mode 100644 ps-lite/LICENSE
 create mode 100644 ps-lite/Makefile
 create mode 100644 ps-lite/README.md
 create mode 100644 ps-lite/cmake/External/zmq.cmake
 create mode 100644 ps-lite/cmake/Modules/FindZMQ.cmake
 create mode 100644 ps-lite/cmake/ProtoBuf.cmake
 create mode 100755 ps-lite/deps/bin/curve_keygen
 create mode 100755 ps-lite/deps/bin/protoc
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/code_generator.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/importer.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/parser.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.proto
 create mode 100644 ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
 create mode 100644 ps-lite/deps/include/google/protobuf/descriptor.h
 create mode 100644 ps-lite/deps/include/google/protobuf/descriptor.pb.h
 create mode 100644 ps-lite/deps/include/google/protobuf/descriptor.proto
 create mode 100644 ps-lite/deps/include/google/protobuf/descriptor_database.h
 create mode 100644 ps-lite/deps/include/google/protobuf/dynamic_message.h
 create mode 100644 ps-lite/deps/include/google/protobuf/extension_set.h
 create mode 100644 ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
 create mode 100644 ps-lite/deps/include/google/protobuf/generated_message_reflection.h
 create mode 100644 ps-lite/deps/include/google/protobuf/generated_message_util.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/coded_stream.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/gzip_stream.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/printer.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/tokenizer.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
 create mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
 create mode 100644 ps-lite/deps/include/google/protobuf/message.h
 create mode 100644 ps-lite/deps/include/google/protobuf/message_lite.h
 create mode 100644 ps-lite/deps/include/google/protobuf/reflection_ops.h
 create mode 100644 ps-lite/deps/include/google/protobuf/repeated_field.h
 create mode 100644 ps-lite/deps/include/google/protobuf/service.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/common.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/once.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/template_util.h
 create mode 100644 ps-lite/deps/include/google/protobuf/stubs/type_traits.h
 create mode 100644 ps-lite/deps/include/google/protobuf/text_format.h
 create mode 100644 ps-lite/deps/include/google/protobuf/unknown_field_set.h
 create mode 100644 ps-lite/deps/include/google/protobuf/wire_format.h
 create mode 100644 ps-lite/deps/include/google/protobuf/wire_format_lite.h
 create mode 100644 ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
 create mode 100644 ps-lite/deps/include/zmq.h
 create mode 100644 ps-lite/deps/include/zmq_utils.h
 create mode 100644 ps-lite/deps/lib/pkgconfig/libzmq.pc
 create mode 100644 ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
 create mode 100644 ps-lite/deps/lib/pkgconfig/protobuf.pc
 create mode 100644 ps-lite/deps/share/man/man3/zmq_bind.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_close.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_connect.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_get.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_new.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_set.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_term.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_curve_keypair.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_disconnect.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_errno.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_getsockopt.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_has.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_close.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_copy.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_data.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_get.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_gets.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init_data.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init_size.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_more.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_move.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_recv.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_send.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_set.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_msg_size.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_poll.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_proxy.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_recv.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_recvmsg.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_send.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_send_const.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_sendmsg.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_setsockopt.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_socket.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_socket_monitor.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_strerror.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_unbind.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_version.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_z85_decode.3
 create mode 100644 ps-lite/deps/share/man/man3/zmq_z85_encode.3
 create mode 100644 ps-lite/deps/share/man/man7/zmq.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_curve.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_inproc.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_ipc.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_null.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_pgm.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_plain.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_tcp.7
 create mode 100644 ps-lite/deps/share/man/man7/zmq_tipc.7
 create mode 100644 ps-lite/docs/Doxyfile
 create mode 100644 ps-lite/docs/Makefile
 create mode 100644 ps-lite/docs/api.md
 create mode 100644 ps-lite/docs/conf.py
 create mode 100644 ps-lite/docs/env.md
 create mode 100644 ps-lite/docs/get_started.md
 create mode 100644 ps-lite/docs/how_to.md
 create mode 100644 ps-lite/docs/index.md
 create mode 100644 ps-lite/docs/overview.md
 create mode 100644 ps-lite/docs/requirements.txt
 create mode 100644 ps-lite/docs/sphinx_util.py
 create mode 100644 ps-lite/docs/tutorials.md
 create mode 100644 ps-lite/include/dmlc/base.h
 create mode 100644 ps-lite/include/dmlc/logging.h
 create mode 100644 ps-lite/include/ps/base.h
 create mode 100644 ps-lite/include/ps/internal/assign_op.h
 create mode 100644 ps-lite/include/ps/internal/customer.h
 create mode 100644 ps-lite/include/ps/internal/env.h
 create mode 100644 ps-lite/include/ps/internal/message.h
 create mode 100644 ps-lite/include/ps/internal/parallel_kv_match.h
 create mode 100644 ps-lite/include/ps/internal/parallel_sort.h
 create mode 100644 ps-lite/include/ps/internal/postoffice.h
 create mode 100644 ps-lite/include/ps/internal/threadsafe_queue.h
 create mode 100644 ps-lite/include/ps/internal/utils.h
 create mode 100644 ps-lite/include/ps/internal/van.h
 create mode 100644 ps-lite/include/ps/kv_app.h
 create mode 100644 ps-lite/include/ps/ps.h
 create mode 100644 ps-lite/include/ps/range.h
 create mode 100644 ps-lite/include/ps/sarray.h
 create mode 100644 ps-lite/include/ps/simple_app.h
 create mode 100644 ps-lite/make/deps.mk
 create mode 100644 ps-lite/make/ps.mk
 create mode 100644 ps-lite/src/customer.cc
 create mode 100644 ps-lite/src/meta.proto
 create mode 100644 ps-lite/src/network_utils.h
 create mode 100644 ps-lite/src/postoffice.cc
 create mode 100644 ps-lite/src/resender.h
 create mode 100644 ps-lite/src/van.cc
 create mode 100644 ps-lite/src/windows/unistd.h
 create mode 100644 ps-lite/src/zmq_van.h
 create mode 100644 ps-lite/tags
 create mode 100644 ps-lite/tests/README.md
 create mode 100755 ps-lite/tests/lint.py
 create mode 100755 ps-lite/tests/local.sh
 create mode 100755 ps-lite/tests/repeat.sh
 create mode 100644 ps-lite/tests/test.mk
 create mode 100755 ps-lite/tests/travis/travis_before_cache.sh
 create mode 100755 ps-lite/tests/travis/travis_script.sh
 create mode 100644 ps-lite/tests/travis/travis_setup_env.sh
 create mode 100644 ps-lite/tracker/README.md
 create mode 100755 ps-lite/tracker/dmlc_local.py
 create mode 100755 ps-lite/tracker/dmlc_mpi.py
 create mode 100755 ps-lite/tracker/dmlc_ssh.py
 create mode 100644 ps-lite/tracker/tracker.py

diff --git a/CMakeLists.txt b/CMakeLists.txt
index c2542eaa..3af60922 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -52,6 +52,7 @@ include_directories(
   "${PROJECT_SOURCE_DIR}"
   "${PROJECT_BINARY_DIR}"
   "${PROJECT_SOURCE_DIR}/gtest/include"
+  "${PROJECT_SOURCE_DIR}/ps-lite"
 )
 
 link_directories(
@@ -63,12 +64,15 @@ link_directories(
   "${PROJECT_BINARY_DIR}/src/solver"
   "${PROJECT_BINARY_DIR}/src/distributed"
   "${PROJECT_BINARY_DIR}/src/c_api"
+  "${PROJECT_BINARY_DIR}/ps-lite/deps/lib"
+  "${PROJECT_BINARY_DIR}/ps-lite/build"
 )
 
 #-------------------------------------------------------------------------------
 # Declare packages in xLearn project.
 #-------------------------------------------------------------------------------
 add_subdirectory(gtest)
+add_subdirectory(ps-lite)
 add_subdirectory(demo)
 add_subdirectory(src/base)
 add_subdirectory(src/data)
diff --git a/ps-lite/CMakeLists.txt b/ps-lite/CMakeLists.txt
new file mode 100644
index 00000000..e5d13d02
--- /dev/null
+++ b/ps-lite/CMakeLists.txt
@@ -0,0 +1,65 @@
+cmake_minimum_required(VERSION 2.8.7)
+
+project(pslite C CXX)
+
+if(NOT MSVC)
+  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
+endif()
+
+list(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake/Modules)
+
+include(ExternalProject) 
+set(pslite_LINKER_LIBS_L "" )
+set(pslite_LINKER_LIBS_L_RELEASE "" )
+set(pslite_LINKER_LIBS_L_DEBUG "" )
+set(pslite_INCLUDE_DIR_L "" )
+
+# ---[ zmq
+include("cmake/External/zmq.cmake")
+include_directories(pslite ${ZMQ_INCLUDE_DIRS})
+list(APPEND pslite_LINKER_LIBS_L ${ZMQ_LIBRARIES})
+# ---[ Google-protobuf
+include(cmake/ProtoBuf.cmake)
+
+# generate protobuf sources
+set(proto_gen_folder "${PROJECT_BINARY_DIR}/src")
+file(GLOB_RECURSE proto_files "src/*.proto")
+pslite_protobuf_generate_cpp_py(${proto_gen_folder} proto_srcs proto_hdrs proto_python "${PROJECT_SOURCE_DIR}" "src" ${proto_files})
+include_directories(pslite "${PROJECT_SOURCE_DIR}/include/")
+include_directories(pslite "${PROJECT_BINARY_DIR}/include/")
+include_directories(pslite "${PROJECT_BINARY_DIR}/src/")
+list(APPEND pslite_INCLUDE_DIR_L "${PROJECT_BINARY_DIR}/include/")
+
+#FILE(COPY DIRECTORY "${PROJECT_BINARY_DIR}/include" DESTINATION "${PROJECT_SOURCE_DIR}/" FILES_MATCHING PATTERN "*.pb.h")
+FILE(GLOB SOURCE "src/*.cc")
+
+if(MSVC)
+set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /EHsc")
+FILE(GLOB getopt_SOURCE "src/windows/getopt.c")
+list(APPEND SOURCE ${getopt_SOURCE}) 
+add_definitions(-DSTATIC_GETOPT)
+include_directories(pslite "${PROJECT_SOURCE_DIR}/src/windows")
+list(APPEND pslite_LINKER_LIBS_L "ipHlpApi.lib" "ws2_32.lib")
+  foreach(flag_var
+        CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
+        CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
+    if(${flag_var} MATCHES "/MD")
+      string(REGEX REPLACE "/MD" "/MT" ${flag_var} "${${flag_var}}")
+    endif(${flag_var} MATCHES "/MD")
+  endforeach(flag_var)
+endif()
+
+list(APPEND SOURCE ${proto_srcs}) 
+add_library(pslite ${SOURCE}) 
+
+target_link_libraries(pslite ${pslite_LINKER_LIBS})
+
+list(APPEND pslite_LINKER_LIBS_L_RELEASE ${Protobuf_LIBRARY})
+list(APPEND pslite_LINKER_LIBS_L_DEBUG ${Protobuf_LIBRARY_DEBUG})
+list(APPEND pslite_INCLUDE_DIR_L "${PROJECT_SOURCE_DIR}/include")
+list(APPEND pslite_INCLUDE_DIR_L ${PROTOBUF_INCLUDE_DIR})
+
+set(pslite_LINKER_LIBS ${pslite_LINKER_LIBS_L} PARENT_SCOPE)
+set(pslite_LINKER_LIBS_RELEASE ${pslite_LINKER_LIBS_L_RELEASE} PARENT_SCOPE)
+set(pslite_LINKER_LIBS_DEBUG ${pslite_LINKER_LIBS_L_DEBUG} PARENT_SCOPE)
+set(pslite_INCLUDE_DIR ${pslite_INCLUDE_DIR_L} PARENT_SCOPE)
diff --git a/ps-lite/LICENSE b/ps-lite/LICENSE
new file mode 100644
index 00000000..dec0d207
--- /dev/null
+++ b/ps-lite/LICENSE
@@ -0,0 +1,201 @@
+Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "{}"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright 2015 Carnegie Mellon University
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://www.apache.org/licenses/LICENSE-2.0
+
+   Unless required by applicable law or agreed to in writing, software
+   distributed under the License is distributed on an "AS IS" BASIS,
+   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+   See the License for the specific language governing permissions and
+   limitations under the License.
diff --git a/ps-lite/Makefile b/ps-lite/Makefile
new file mode 100644
index 00000000..512221bf
--- /dev/null
+++ b/ps-lite/Makefile
@@ -0,0 +1,52 @@
+ifdef config
+include $(config)
+endif
+
+include make/ps.mk
+
+ifndef CXX
+CXX = g++
+endif
+
+ifndef DEPS_PATH
+DEPS_PATH = $(shell pwd)/deps
+endif
+
+
+ifndef PROTOC
+PROTOC = ${DEPS_PATH}/bin/protoc
+endif
+
+INCPATH = -I./src -I./include -I$(DEPS_PATH)/include
+CFLAGS = -std=c++11 -msse2 -fPIC -O3 -ggdb -Wall -finline-functions $(INCPATH) $(ADD_CFLAGS)
+
+all: ps test
+
+include make/deps.mk
+
+clean:
+	rm -rf build $(TEST) tests/*.d
+	find src -name "*.pb.[ch]*" -delete
+
+lint:
+	python tests/lint.py ps all include/ps src
+
+ps: build/libps.a
+
+OBJS = $(addprefix build/, customer.o postoffice.o van.o meta.pb.o)
+build/libps.a: $(OBJS)
+	ar crv $@ $(filter %.o, $?)
+
+build/%.o: src/%.cc ${ZMQ} src/meta.pb.h
+	@mkdir -p $(@D)
+	$(CXX) $(INCPATH) -std=c++0x -MM -MT build/$*.o $< >build/$*.d
+	$(CXX) $(CFLAGS) -c $< -o $@
+
+src/%.pb.cc src/%.pb.h : src/%.proto ${PROTOBUF}
+	$(PROTOC) --cpp_out=./src --proto_path=./src $<
+
+-include build/*.d
+-include build/*/*.d
+
+include tests/test.mk
+test: $(TEST)
diff --git a/ps-lite/README.md b/ps-lite/README.md
new file mode 100644
index 00000000..a3f9ce9b
--- /dev/null
+++ b/ps-lite/README.md
@@ -0,0 +1,95 @@
+<img src="http://parameterserver.org/images/parameterserver.png"  width=400 />
+
+[![Build Status](https://travis-ci.org/dmlc/ps-lite.svg?branch=master)](https://travis-ci.org/dmlc/ps-lite)
+[![GitHub license](http://dmlc.github.io/img/apache2.svg)](./LICENSE)
+
+A light and efficient implementation of the parameter server
+framework. It provides clean yet powerful APIs. For example, a worker node can
+communicate with the server nodes by
+- `Push(keys, values)`: push a list of (key, value) pairs to the server nodes
+- `Pull(keys)`: pull the values from servers for a list of keys
+- `Wait`: wait untill a push or pull finished.
+
+A simple example:
+
+```c++
+  std::vector<uint64_t> key = {1, 3, 5};
+  std::vector<float> val = {1, 1, 1};
+  std::vector<float> recv_val;
+  ps::KVWorker<float> w;
+  w.Wait(w.Push(key, val));
+  w.Wait(w.Pull(key, &recv_val));
+```
+
+More features:
+
+- Flexible and high-performance communication: zero-copy push/pull, supporting
+  dynamic length values, user-defined filters for communication compression
+- Server-side programming: supporting user-defined handles on server nodes
+
+### Build
+
+`ps-lite` requires a C++11 compiler such as `g++ >= 4.8`. On Ubuntu >= 13.10, we
+can install it by
+```
+sudo apt-get update && sudo apt-get install -y build-essential git
+```
+Instructions for
+[older Ubuntu](http://ubuntuhandbook.org/index.php/2013/08/install-gcc-4-8-via-ppa-in-ubuntu-12-04-13-04/),
+[Centos](http://linux.web.cern.ch/linux/devtoolset/),
+and
+[Mac Os X](http://hpc.sourceforge.net/).
+
+Then clone and build
+
+```bash
+git clone https://github.com/dmlc/ps-lite
+cd ps-lite && make -j4
+```
+
+### How to use
+
+`ps-lite` provides asynchronous communication for other projects: 
+  - Distributed deep neural networks:
+    [MXNet](https://github.com/dmlc/mxnet),
+    [CXXNET](https://github.com/dmlc/cxxnet) and
+    [Minverva](https://github.com/minerva-developers/minerva)
+  - Distributed high dimensional inference, such as sparse logistic regression,
+    factorization machines:
+    [DiFacto](https://github.com/dmlc/difacto)
+    [Wormhole](https://github.com/dmlc/wormhole)
+
+### History
+
+We started to work on the parameter server framework since 2010.
+
+1. The first generation was
+designed and optimized for specific algorithms, such as logistic regression and
+LDA, to serve the sheer size industrial machine learning tasks (hundreds billions of
+examples and features with 10-100TB data size) .
+
+2. Later we tried to build a open-source general purpose framework for machine learning
+algorithms. The project is available at [dmlc/parameter_server](https://github.com/dmlc/parameter_server).
+
+3. Given the growing demands from other projects, we created `ps-lite`, which provides a clean data communication API and a
+lightweight implementation. The implementation is based on `dmlc/parameter_server`, but we refactored the job launchers, file I/O and machine
+learning algorithms codes into different projects such as `dmlc-core` and
+`wormhole`.
+
+4. From the experience we learned during developing
+   [dmlc/mxnet](https://github.com/dmlc/mxnet), we further refactored the API and implementation from [v1](https://github.com/dmlc/ps-lite/releases/tag/v1). The main
+   changes include
+   - less library dependencies
+   - more flexible user-defined callbacks, which facilitate other language
+   bindings
+   - let the users, such as the dependency
+     engine of mxnet, manage the data consistency
+
+### Research papers
+  1. Mu Li, Dave Andersen, Alex Smola, Junwoo Park, Amr Ahmed, Vanja Josifovski,
+     James Long, Eugene Shekita, Bor-Yiing
+     Su. [Scaling Distributed Machine Learning with the Parameter Server](http://www.cs.cmu.edu/~muli/file/parameter_server_osdi14.pdf). In
+     Operating Systems Design and Implementation (OSDI), 2014
+  2. Mu Li, Dave Andersen, Alex Smola, and Kai
+     Yu. [Communication Efficient Distributed Machine Learning with the Parameter Server](http://www.cs.cmu.edu/~muli/file/parameter_server_nips14.pdf). In
+     Neural Information Processing Systems (NIPS), 2014
diff --git a/ps-lite/cmake/External/zmq.cmake b/ps-lite/cmake/External/zmq.cmake
new file mode 100644
index 00000000..32074700
--- /dev/null
+++ b/ps-lite/cmake/External/zmq.cmake
@@ -0,0 +1,62 @@
+if (NOT __ZMQ_INCLUDED) # guard against multiple includes
+  set(__ZMQ_INCLUDED TRUE)
+
+  # use the system-wide ZMQ if present
+  find_package(ZMQ)
+  if (ZMQ_FOUND)
+    set(ZMQ_EXTERNAL FALSE)
+  else()
+    # ZMQ will use pthreads if it's available in the system, so we must link with it
+    find_package(Threads)
+
+    # build directory
+    set(ZMQ_PREFIX ${CMAKE_BINARY_DIR}/external/ZMQ-prefix)
+    # install directory
+    set(ZMQ_INSTALL ${CMAKE_BINARY_DIR}/external/ZMQ-install)
+
+    # we build ZMQ statically, but want to link it into the caffe shared library
+    # this requires position-independent code
+    if (UNIX)
+        set(ZMQ_EXTRA_COMPILER_FLAGS "-fPIC")
+    endif()
+
+    set(ZMQ_CXX_FLAGS ${CMAKE_CXX_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
+    set(ZMQ_C_FLAGS ${CMAKE_C_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
+
+    ExternalProject_Add(ZMQ
+      PREFIX ${ZMQ_PREFIX}
+      GIT_REPOSITORY "https://github.com/zeromq/libZMQ.git"
+      UPDATE_COMMAND ""
+      INSTALL_DIR ${ZMQ_INSTALL}
+      CMAKE_ARGS -DCMAKE_BUILD_TYPE=${CMAKE_BUILD_TYPE}
+                 -DCMAKE_INSTALL_PREFIX=${ZMQ_INSTALL}
+                 -DBUILD_SHARED_LIBS=OFF
+                 -DBUILD_STATIC_LIBS=ON
+                 -DBUILD_PACKAGING=OFF
+                 -DBUILD_TESTING=OFF
+                 -DBUILD_NC_TESTS=OFF
+                 -BUILD_CONFIG_TESTS=OFF
+                 -DINSTALL_HEADERS=ON
+                 -DCMAKE_C_FLAGS=${ZMQ_C_FLAGS}
+                 -DCMAKE_CXX_FLAGS=${ZMQ_CXX_FLAGS}
+      LOG_DOWNLOAD 1
+      LOG_INSTALL 1
+      )
+
+    set(ZMQ_FOUND TRUE)
+    set(ZMQ_INCLUDE_DIRS ${ZMQ_INSTALL}/include)
+	
+	if(MSVC)
+		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-${CMAKE_VS_PLATFORM_TOOLSET}*.lib")
+		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/ZMQ.lib ${CMAKE_THREAD_LIBS_INIT})
+	else()
+		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-*.a")
+		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/libZMQ.a ${CMAKE_THREAD_LIBS_INIT})
+	endif()
+    set(ZMQ_LIBRARY_DIRS ${ZMQ_INSTALL}/lib)
+    set(ZMQ_EXTERNAL TRUE)
+
+    list(APPEND external_project_dependencies ZMQ)
+  endif()
+
+endif()
diff --git a/ps-lite/cmake/Modules/FindZMQ.cmake b/ps-lite/cmake/Modules/FindZMQ.cmake
new file mode 100644
index 00000000..11319098
--- /dev/null
+++ b/ps-lite/cmake/Modules/FindZMQ.cmake
@@ -0,0 +1,17 @@
+# - Try to find ZMQ
+# Once done this will define
+# ZMQ_FOUND - System has ZMQ
+# ZMQ_INCLUDE_DIRS - The ZMQ include directories
+# ZMQ_LIBRARIES - The libraries needed to use ZMQ
+# ZMQ_DEFINITIONS - Compiler switches required for using ZMQ
+
+find_path ( ZMQ_INCLUDE_DIR zmq.h )
+find_library ( ZMQ_LIBRARY NAMES zmq )
+
+set ( ZMQ_LIBRARIES ${ZMQ_LIBRARY} )
+set ( ZMQ_INCLUDE_DIRS ${ZMQ_INCLUDE_DIR} )
+
+include ( FindPackageHandleStandardArgs )
+# handle the QUIETLY and REQUIRED arguments and set ZMQ_FOUND to TRUE
+# if all listed variables are TRUE
+find_package_handle_standard_args ( ZMQ DEFAULT_MSG ZMQ_LIBRARY ZMQ_INCLUDE_DIR )
\ No newline at end of file
diff --git a/ps-lite/cmake/ProtoBuf.cmake b/ps-lite/cmake/ProtoBuf.cmake
new file mode 100644
index 00000000..b22d1910
--- /dev/null
+++ b/ps-lite/cmake/ProtoBuf.cmake
@@ -0,0 +1,86 @@
+# Finds Google Protocol Buffers library and compilers and extends
+# the standard cmake script with version and python generation support
+
+find_package( Protobuf REQUIRED )
+include_directories(SYSTEM ${PROTOBUF_INCLUDE_DIR})
+
+
+# As of Ubuntu 14.04 protoc is no longer a part of libprotobuf-dev package
+# and should be installed separately as in: sudo apt-get install protobuf-compiler
+if(EXISTS ${PROTOBUF_PROTOC_EXECUTABLE})
+  message(STATUS "Found PROTOBUF Compiler: ${PROTOBUF_PROTOC_EXECUTABLE}")
+else()
+  message(FATAL_ERROR "Could not find PROTOBUF Compiler")
+endif()
+
+
+# place where to generate protobuf sources
+set(proto_gen_folder "${PROJECT_BINARY_DIR}/include/pslite/proto")
+include_directories(SYSTEM "${PROJECT_BINARY_DIR}/include")
+
+set(PROTOBUF_GENERATE_CPP_APPEND_PATH TRUE)
+
+################################################################################################
+# Modification of standard 'protobuf_generate_cpp()' with output dir parameter and python support
+# Usage:
+#   pslite_protobuf_generate_cpp_py(<output_dir> <srcs_var> <hdrs_var> <python_var> <proto_files>)
+function(pslite_protobuf_generate_cpp_py output_dir srcs_var hdrs_var python_var work_path proto_path)
+  if(NOT ARGN)
+    message(SEND_ERROR "Error: pslite_protobuf_generate_cpp_py() called without any proto files")
+    return()
+  endif()
+
+  if(PROTOBUF_GENERATE_CPP_APPEND_PATH)
+    # Create an include path for each file specified
+    foreach(fil ${ARGN})
+      get_filename_component(abs_fil ${fil} ABSOLUTE)
+      get_filename_component(abs_path ${abs_fil} PATH)
+      list(FIND _protoc_include ${abs_path} _contains_already)
+      if(${_contains_already} EQUAL -1)
+        list(APPEND _protoc_include -I ${abs_path})
+      endif()
+    endforeach()
+  else()
+    set(_protoc_include -I ${CMAKE_CURRENT_SOURCE_DIR})
+  endif()
+
+  if(DEFINED PROTOBUF_IMPORT_DIRS)
+    foreach(dir ${PROTOBUF_IMPORT_DIRS})
+      get_filename_component(abs_path ${dir} ABSOLUTE)
+      list(FIND _protoc_include ${abs_path} _contains_already)
+      if(${_contains_already} EQUAL -1)
+        list(APPEND _protoc_include -I ${abs_path})
+      endif()
+    endforeach()
+  endif()
+
+  set(${srcs_var})
+  set(${hdrs_var})
+  set(${python_var})
+  foreach(fil ${ARGN})
+    get_filename_component(abs_fil ${fil} ABSOLUTE)
+    get_filename_component(fil_we ${fil} NAME_WE)
+	string(REPLACE ${work_path}/ "" o_fil ${abs_fil})
+	string(REPLACE "${fil_we}.proto" "" o_fil_path ${o_fil})
+
+    list(APPEND ${srcs_var} "${o_fil_path}/${fil_we}.pb.cc")
+    list(APPEND ${hdrs_var} "${o_fil_path}/${fil_we}.pb.h")
+    list(APPEND ${python_var} "${o_fil_path}/${fil_we}_pb2.py")
+	
+    add_custom_command(
+      OUTPUT "${o_fil_path}/${fil_we}.pb.cc"
+             "${o_fil_path}/${fil_we}.pb.h"
+             "${o_fil_path}/${fil_we}_pb2.py"
+      COMMAND ${CMAKE_COMMAND} -E make_directory "${output_dir}"
+      COMMAND ${PROTOBUF_PROTOC_EXECUTABLE} --cpp_out    ${output_dir} ${o_fil} --proto_path ${proto_path}
+      COMMAND ${PROTOBUF_PROTOC_EXECUTABLE} --python_out ${output_dir} ${o_fil} --proto_path ${proto_path}
+      DEPENDS ${abs_fil}
+	  WORKING_DIRECTORY ${work_path}
+      COMMENT "Running C++/Python protocol buffer compiler on ${o_fil}" VERBATIM )
+  endforeach()
+
+  set_source_files_properties(${${srcs_var}} ${${hdrs_var}} ${${python_var}} PROPERTIES GENERATED TRUE)
+  set(${srcs_var} ${${srcs_var}} PARENT_SCOPE)
+  set(${hdrs_var} ${${hdrs_var}} PARENT_SCOPE)
+  set(${python_var} ${${python_var}} PARENT_SCOPE)
+endfunction()
diff --git a/ps-lite/deps/bin/curve_keygen b/ps-lite/deps/bin/curve_keygen
new file mode 100755
index 0000000000000000000000000000000000000000..c67ace79e2672ef9a87f3cfc9c5b09e20e0901c6
GIT binary patch
literal 8592
zcmeHMO^6&t6t2miAtvrd#2-|stga>|nMsT*3%atK%_O@d>Si-5aW9pgncD3pJ>6qh
zcV;IltR@Q%W?>E@5hCo}tAYek@uHp-5y`<rE|C!w@uY}2ey^%~c4iX2EB&B;zE|(P
ze)UxkQ(g7dA3y(f8)KP`j4f|qjO|1@vzf6K#?fQ!K9ngGA!a6y<>&LW&y%)SGQIGY
zh~iv>p%8`q=|ZoG_8;uku^1yahIDix3n4<e6jIMff4no>F&PZ~5|0z!6!&$ri7j_S
zAygO@RY%nyZ)S&ycW-Qw;KX5T9B)gkF!6*f-Kq?r>yKy0@kV2N!o+(=ZpyEu!ocws
zV}t&9YjM1L;vj^(r6)E9gowPF<CTTuE%+MuuE&Q1X1=uMB!v58m=ROcy0%b+I5JU~
z=o-QL^{i{MzFq5zcdip#2+tL&UMc#nsD{Bm#!JG``$7JR5dYolEQD+QTf9N|Q+_-S
zK)5>|y?4o)lF9n-;KcNE$MZ*~lXsZ+%@dfUsVC1E#fiIGKZM`e0qSwawxZdJ_6*v7
zu{mR8N8Ho9w+2kHMt3oG8tv^UGbr6cwp8f%@=r1d|82JzyaPIpf}ab^MJmX-PBB-m
zyJcXK`%x&5H$Q9srbeHX?>{qi_QtOtY<?IzPzOguMR_d2q=W3ne94b~huuPO8HL6u
zXT$aumYY*DP`M??@|7LcEN?Ma_DfMkdZEhso?LMKTF$RZPx(<$k~!C3bX4e+L?9Of
zsg&b;qN;LLwcm9@nJY^GnhMJK%1haiEav1C%{)i()a3aap8gK6PiB4YusT&&p{!&N
zCq9%V<xT67__580GW~v~y?e6<W2Z-8OZ;5sX1({scnvs}l!26il!26il!5;%19MZ2
z8&j|S)WrOzR>!jVulzj!Cr!3>&8W&yHS$+lUmEzXhL>Ac4g6Naw_5KRxC2{-M!wm)
zV&D-CFSS-RjMk=BU;Vm~f1`B)_`>gO;Nqj`v|iR||G)~ivXsO$yjt_<H}V%hL44La
zW(I0BFroVtXSp@9u5YZo(r&j~51G-m#>x`Gy8sWi8!I6J3e{{6UqzJm@JG7-Sl6GT
zKC$}XJ7^|OwTByMn>LKuk3YcA^uF)(zUlP7K(Amsiif`M@<r*%zzU_}7N3lQb8`OK
zll-i#S1l*l$1PaZd|t(;LTD9T$<0@T;&ngbCCg)xlHBol$@dnV#R!40Q{oGbi+Fy(
z&29>#Wtrs#TXN~4kIxPcKgH)qNA~fW?UZbWbSz%9l-xf$!WaCYVud`kQDLAgRVi?a
zvP@4pfb?dMPVz&KBRj8b+_{ZJk&RQSx{@|^CJ&g0c<A}j5kV=GvUZXY9$)6gI)-B&
zOnULWndR23y5coIIE&f|Z5>C+QXoSjhvP#``(x|Kt5y)!buRR<YE*Qc5*e{Fwvfm>
z3h}JnaE=1$)_3gz@4PCp9Ythi6B$r|Ku?x1XP-M^mKA(rh{NTa6o`dY+Q%_B5Cjrb
zXt^%OR#Jh?sFFO}<AE$j4l;|krEJ^S7@wS*eId_h<_@2jp5({#FY>XmF8!(e<ZQl>
z==C?n1N06-x?8+kdawNiS}OFtN<#gODBIyVsJ%(M-q8rvrTBaD?YLcv+t=eZu}j;O
zfs}!ifs}!ifs}!ifs}!ifs}!ifs}!ifs}#&4g))f1`Cw!&T)bJG0{24pi?DwGT=?4
zmqFn9ta<0SkV{U;mapSzN=pU?)hJY~IZn5Q`Ziq@alwq+?`|uW5xAG!ASyN@;DjZV
zxFfg7YFEW_JT^=R7aQ4ix>qAfI;0-R=o?0TSaG+;=8S_5-018BEtzQ<LfwsV|45ij
ywLFEo8y_{e<4+wrC&6W)zDJGkfXDmw95>WA&qe6D7>*1rw_sJP452qs#{LG_k|mY^

literal 0
HcmV?d00001

diff --git a/ps-lite/deps/bin/protoc b/ps-lite/deps/bin/protoc
new file mode 100755
index 0000000000000000000000000000000000000000..9d70a91e5becdbb8201d2ae31f4fddb2a206976a
GIT binary patch
literal 15580
zcmeHOeQX@X6<;SYID8rct=sZ(pcuJCiS4)qr;1c3&XEgAjER#fL_+KHd1D_v-<|Hx
z#IA&78eQe>WyKZYHk2Y6{%M2?N~>C;5?8q*Qlfs5QVLO<qNt^4jY1Wnwpe_*zu%kP
z_1^j;!Jxt)H`2_T-+MD}-n^Ne-J7|2>Akl<x>VDumTTI`GELJ~Ax>VRY59>`kkhm;
zAx02&y>s)n@c!`bd&n&hRpoGAL_G~?K-c$#_w6Y!BK1S%Jk7zdO{+$PNfLBDXAI>W
z020)fz80MU|F<hu8R8YQ#R*3IP}j4$!Je$g3hLW*gVL9AO1RjqP~+&EwU7Grej|}K
zSSP6On4|Bwqkx!x_re_e`eHHN7>XI`oSuvJ1oh=^RQ5gQ3<7bPK2NdA=z1)h%fyp?
z4nL@`=4Peuup=k-hoEj<A50#MCwujH@<0j&gZdtG^z}MQh=V%(`Z-Tp(HC9cx_QrL
zpCqL0(rO(ZumlHlo?s43BwyG2Qod=jpuQRwW(dvJCFFSWS#X1{Clh*hc%Ubh(9^lh
z9DOw*WuI#vG3{{!^<C!zP+d<%7t>c4Qu>ZKb%_1?*xxTWG7|btJ*PXjckBpn-R?eP
zO##0FGn~0XQR;D~jxcV;Iv_=m&^I-p(|myL&@`v2lxqUshaAVU4zUPK8;;)zj0g5|
z<U0`=ScZ}I^I7)$0kABDQ2(oC90jfd2_e$##=&f+F%j=+>>W<H^Xe<$(~jq^%-^@_
z(M?Z3yYG#+A8otq(beG9B5GG$Ch>L`lZViN{<0p|34dTaqllEzc1`1gvQlf@n>8}o
z#-VsLmF*uq7)|yy_NHQk14c5JZA>MN1BukZ##Gu!W>bTin9-O>^~JNfcudb2eHkO0
zji-`&I@_4eu1&;qMq{r5z^)*sGpSsvXYjzf)^+GuyhmF7tn7%DS)u&S@pt`Evy8K*
zYIZDO@VD1BdzRB~e|fFC1r^H6$JVUzYOs8(Pyez_uVU7fm+u<R=8S=LTf9b4{x(F8
z?<nRU=PTz9G3R3?R6J1eK*a+U4^%u*@j%4`6%SNAQ1QTL>w&!y^PiE2&$Z!q;EDVP
zAI{9s9J4fyT*RC>PhyoOKbV=ZU%(Hph&6E(c}QwLqU4Uf_?-Zx5fw_pG)r|v=0vS9
zCma+~%mzi86lo<naTk9eXrTPT04jSoP$vq^()jzL?g)t8M<dL95&0=8TquzrDNIPI
z!Wbp?Hk1;vDx*5!*lwReD=wd%v2S)uqo+kOUY{+IACm6oBQ(^iPU2@Ynr|a2Si&@|
zebSeFr!eyl>Q>BtMbe54k(_9Ay4&V-m;KP7P866gLH{VbWLhKa%OFaDHH5sfx=<2v
zVS?gFVT=-cuWPc?vwXL*dz39&)sy(K4J9K)1xuKwbwn9e6lUH*<BEAykz<NHPqLuh
zqCo6U(<0OAr$r^~WT44z<XyW(T$rF3c2i<MiBckV?6x=n5i1{2=AUH4R`un|{7It1
zm@v(;)5^9}!puA9tYX@VoL6L;WFhm%M1lDl?A}Mi%zUSiu?X#Z7jqG;Hssx2h`2C8
zF^r+aehsDky^se6^Gzm?HO8^n>GY`}t=KWQ2Id_5YX8W`V0qj0F{sBL@-f=TXrE=|
z8^C~_H8UVq_4{hhXha1|n5I=nWaevynRie~F&h+VQlyn+A%9t-K!&@OE-<Yoy5J93
zK%l(=dDl@QE=*7iM^R!whf;n=jj<yb?pkGjgbiEO+m!ijM0m=?C~KdPe5Ww;4(e9S
zenrxX43R8oz9^viV<8%5=Iex5wY0BB^`ZuOw-+KVOi+woP-5HI3Gw&B9c~!}%aYC%
zM7=%e7R5M|Z~xrKV0rr~ALBH&56v?2lWf%tkHRUt<ar8@L<+k`Bj&CnU>75WFzGnr
zQN&}2&o9{XUB!runkG7}>G#l99om8m&Li*kSHy)0iqT(6>}hNi`ujUZJ27fUm31d!
z-3yqDXnhjaorHC#kv|3NNY5hLi02Wf7q;${ST|;~T{C}Hh;^FHXVE-Zr;vAz6memK
zVi-w@-4!s>9Tah)Wr?i?QE#8c2BOkrmB_bmbnEh6N5&N{1CHP;5RUM@34e<EX8w1s
zJq5{{^7e!R8N^?*iNn}oGye$F$1%{R^<$({@6P3+&QZ>UAG&5uy*#(j)X{l(Jo^bY
zP(PQ41|n==gV%t(ajcRoG@&3@R-4N_ZsR-+zcsg!sreh0Nne5r{{$+@%>RkUePSMU
z-ShC~Z$gG}zo!iK@SUQ@ajVC@Msa1~tR<J5_3mh09xPU*yZ(j}ZZWBMnhZp3io4rv
zgT<afzMuyG;p6;{y8lIpL<9R()^DjWT+S_&#;N8T;BqWanAS<oXUstD>YKGr`!F&Q
zbH!@=A!Lg3y>{qaZNz+NI#PIO+U8MN<k0cj`(G^1)W3>aGxet>{fne$Bz;}dvy%Q@
z(l;c1Q&P4yQ~#Ev=Oq1?q~|4lN78>w`d>-89?aCghg8#cS~uQ@%;v6{`t6{_eln-t
z#1gD>XT03YUhbrq`<0jbg_nEA%Z+=vA9%ULUhX?yjtjnOE$QWYz1)5;$E9DDyUWXM
zLT=`XM-FMrzbpM2r~M4$h#L{Rc_Q-<M4mq72;N7;sh*NNf~m6!;BiW};h`aTmf#ZT
zYX|)`0avF6&_5H50C0a@B;R*{)Oi|!szuudEY8$+TMd%`0JMXConQ-Q*)5<Q1pNTi
zCX!(QDv&zo0I0xZvF~Aprh+F4_`yO2KO^`MfC@x%6%4!`K<eBBK#6EO1fZk0)=HcM
zoI^!Q#Ly2NAd*!OQzCv_?EsN90n|exVK2a~$cf}2z-^8IXABH-_!3*Itz8>Sr}fle
z&dsHB+BPF;WTH7E)V^j-sNab88ktZu*&9+vJnK;Mf#`!#spJ*C8yu%V=s-MSuvB_D
z*N@{LD)-8D3a`8*ExJLhQj|D^h|!h|&#Kyx<#`FuqZ!%|$>;em1{E$@j<Xu(v}NNf
zwW?$2GJ@)?rrj%Ok)#`XSa=fpNq^(eR~-7fLv4q?<IoQrdWloN)}dc^=xT?qb7;sZ
z-|FBk4&CX{Z#wh=hc04rMO5)X#RC-&R6J1eK*a+U4^%u*@j%4`6%SNAQ1L*;0}FWI
znp^9-xzluQo38Kg*wB|s^(Bl}_phj}vD82syBC@DP3@_H0c?8gj3<rl$()fn5RDnl
z>o+Ixf7i~$U|&3$4e#F3(Uoh__2%aFJ<%-w^Q!)7zCG5_)dFU$Kbp~VnP@zh-5v{v
z$=n!4{a7@Y%8(NdYxibC#U)vC=Wc_4v^6r$&PpotDVWpQ(bcRsx3s5vjaju_TXgMn
zWFyS^bj@tpJ(vu~J9l*Mh%K$3?ako_msWG@MbvD;{#^6=_H^1Ck&9_>Zmo-H>ucQC
zYi{9Q-p6WfzIqqa-UhWpxbb5(Hm8zm={k9g7J44%dmMvL;|3j<I^wx7Cc=O=QlsYl
zCs8=-g09>~JgNinBz9HRT+w4gQN0Jxa8k#55bKu-r1uRC>9|LeO(moFyZo^JV3Rh&
zlXnSK#p}_>z3TeOZX=67;cFwcFcZs8!boZ(qgBN=UJ;NhK6(#sso+YEzdqJIzn20l
z)CMT&%k{JWSeHhsin4@O>A1tNOxJ1$qVc5Gp)DKe$MqZ|HkdPT>xX;8+THuzb#M`l
zUEIxGuAN`4EnhL-3Oc@u|I;{!efOKHMzmUIUvvfb)UN{1z30PPS3~aZn>GlRe|X3~
z?Iyu$FPQtbTM$8^MTOl8Q;mezkV5X^VE{kA2@*fPKY+&q`1b+Ki)H@$cLeaa0{E!_
zekFh}g)g8FsS0}n`0)UKCV)!;{3nGy|NJ$8DZqJ!#&Z-NUT_;7{|=G+Ej)I(5|MXP
zu14f2@Z1kB(0HAM?^WJ)xgPP0h&%%1{Rsq~+kI+!LmJ=R&Xc*wl+*ROb5)mV9DIyE
z7vBO)G2;LG8SuHWaIueoB^c@d1Xx0Kc_A;Mp1dCxtvB~Ie&M#}*12#y^S!_?+|qot
zF5K3f_xFVxnp4GV<&(Ug%ii}KhEJl*wW$0}ujBe@;5`r4Ja2jT9X{vvO$`a$y2DpO
XB7wWW&PRl{t-alMOEzINVSW7{&=bbK

literal 0
HcmV?d00001

diff --git a/ps-lite/deps/include/google/protobuf/compiler/code_generator.h b/ps-lite/deps/include/google/protobuf/compiler/code_generator.h
new file mode 100644
index 00000000..252f68d1
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/code_generator.h
@@ -0,0 +1,142 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Defines the abstract interface implemented by each of the language-specific
+// code generators.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
+#define GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
+
+#include <google/protobuf/stubs/common.h>
+#include <string>
+#include <vector>
+#include <utility>
+
+namespace google {
+namespace protobuf {
+
+namespace io { class ZeroCopyOutputStream; }
+class FileDescriptor;
+
+namespace compiler {
+
+// Defined in this file.
+class CodeGenerator;
+class GeneratorContext;
+
+// The abstract interface to a class which generates code implementing a
+// particular proto file in a particular language.  A number of these may
+// be registered with CommandLineInterface to support various languages.
+class LIBPROTOC_EXPORT CodeGenerator {
+ public:
+  inline CodeGenerator() {}
+  virtual ~CodeGenerator();
+
+  // Generates code for the given proto file, generating one or more files in
+  // the given output directory.
+  //
+  // A parameter to be passed to the generator can be specified on the
+  // command line.  This is intended to be used by Java and similar languages
+  // to specify which specific class from the proto file is to be generated,
+  // though it could have other uses as well.  It is empty if no parameter was
+  // given.
+  //
+  // Returns true if successful.  Otherwise, sets *error to a description of
+  // the problem (e.g. "invalid parameter") and returns false.
+  virtual bool Generate(const FileDescriptor* file,
+                        const string& parameter,
+                        GeneratorContext* generator_context,
+                        string* error) const = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodeGenerator);
+};
+
+// CodeGenerators generate one or more files in a given directory.  This
+// abstract interface represents the directory to which the CodeGenerator is
+// to write and other information about the context in which the Generator
+// runs.
+class LIBPROTOC_EXPORT GeneratorContext {
+ public:
+  inline GeneratorContext() {}
+  virtual ~GeneratorContext();
+
+  // Opens the given file, truncating it if it exists, and returns a
+  // ZeroCopyOutputStream that writes to the file.  The caller takes ownership
+  // of the returned object.  This method never fails (a dummy stream will be
+  // returned instead).
+  //
+  // The filename given should be relative to the root of the source tree.
+  // E.g. the C++ generator, when generating code for "foo/bar.proto", will
+  // generate the files "foo/bar.pb.h" and "foo/bar.pb.cc"; note that
+  // "foo/" is included in these filenames.  The filename is not allowed to
+  // contain "." or ".." components.
+  virtual io::ZeroCopyOutputStream* Open(const string& filename) = 0;
+
+  // Creates a ZeroCopyOutputStream which will insert code into the given file
+  // at the given insertion point.  See plugin.proto (plugin.pb.h) for more
+  // information on insertion points.  The default implementation
+  // assert-fails -- it exists only for backwards-compatibility.
+  //
+  // WARNING:  This feature is currently EXPERIMENTAL and is subject to change.
+  virtual io::ZeroCopyOutputStream* OpenForInsert(
+      const string& filename, const string& insertion_point);
+
+  // Returns a vector of FileDescriptors for all the files being compiled
+  // in this run.  Useful for languages, such as Go, that treat files
+  // differently when compiled as a set rather than individually.
+  virtual void ListParsedFiles(vector<const FileDescriptor*>* output);
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GeneratorContext);
+};
+
+// The type GeneratorContext was once called OutputDirectory. This typedef
+// provides backward compatibility.
+typedef GeneratorContext OutputDirectory;
+
+// Several code generators treat the parameter argument as holding a
+// list of options separated by commas.  This helper function parses
+// a set of comma-delimited name/value pairs: e.g.,
+//   "foo=bar,baz,qux=corge"
+// parses to the pairs:
+//   ("foo", "bar"), ("baz", ""), ("qux", "corge")
+extern void ParseGeneratorParameter(const string&,
+            vector<pair<string, string> >*);
+
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h b/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
new file mode 100644
index 00000000..86ea9bde
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
@@ -0,0 +1,353 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Implements the Protocol Compiler front-end such that it may be reused by
+// custom compilers written to support other languages.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
+#define GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
+
+#include <google/protobuf/stubs/common.h>
+#include <string>
+#include <vector>
+#include <map>
+#include <set>
+#include <utility>
+
+namespace google {
+namespace protobuf {
+
+class FileDescriptor;        // descriptor.h
+class DescriptorPool;        // descriptor.h
+class FileDescriptorProto;   // descriptor.pb.h
+template<typename T> class RepeatedPtrField;  // repeated_field.h
+
+namespace compiler {
+
+class CodeGenerator;        // code_generator.h
+class GeneratorContext;      // code_generator.h
+class DiskSourceTree;       // importer.h
+
+// This class implements the command-line interface to the protocol compiler.
+// It is designed to make it very easy to create a custom protocol compiler
+// supporting the languages of your choice.  For example, if you wanted to
+// create a custom protocol compiler binary which includes both the regular
+// C++ support plus support for your own custom output "Foo", you would
+// write a class "FooGenerator" which implements the CodeGenerator interface,
+// then write a main() procedure like this:
+//
+//   int main(int argc, char* argv[]) {
+//     google::protobuf::compiler::CommandLineInterface cli;
+//
+//     // Support generation of C++ source and headers.
+//     google::protobuf::compiler::cpp::CppGenerator cpp_generator;
+//     cli.RegisterGenerator("--cpp_out", &cpp_generator,
+//       "Generate C++ source and header.");
+//
+//     // Support generation of Foo code.
+//     FooGenerator foo_generator;
+//     cli.RegisterGenerator("--foo_out", &foo_generator,
+//       "Generate Foo file.");
+//
+//     return cli.Run(argc, argv);
+//   }
+//
+// The compiler is invoked with syntax like:
+//   protoc --cpp_out=outdir --foo_out=outdir --proto_path=src src/foo.proto
+//
+// For a full description of the command-line syntax, invoke it with --help.
+class LIBPROTOC_EXPORT CommandLineInterface {
+ public:
+  CommandLineInterface();
+  ~CommandLineInterface();
+
+  // Register a code generator for a language.
+  //
+  // Parameters:
+  // * flag_name: The command-line flag used to specify an output file of
+  //   this type.  The name must start with a '-'.  If the name is longer
+  //   than one letter, it must start with two '-'s.
+  // * generator: The CodeGenerator which will be called to generate files
+  //   of this type.
+  // * help_text: Text describing this flag in the --help output.
+  //
+  // Some generators accept extra parameters.  You can specify this parameter
+  // on the command-line by placing it before the output directory, separated
+  // by a colon:
+  //   protoc --foo_out=enable_bar:outdir
+  // The text before the colon is passed to CodeGenerator::Generate() as the
+  // "parameter".
+  void RegisterGenerator(const string& flag_name,
+                         CodeGenerator* generator,
+                         const string& help_text);
+
+  // Register a code generator for a language.
+  // Besides flag_name you can specify another option_flag_name that could be
+  // used to pass extra parameters to the registered code generator.
+  // Suppose you have registered a generator by calling:
+  //   command_line_interface.RegisterGenerator("--foo_out", "--foo_opt", ...)
+  // Then you could invoke the compiler with a command like:
+  //   protoc --foo_out=enable_bar:outdir --foo_opt=enable_baz
+  // This will pass "enable_bar,enable_baz" as the parameter to the generator.
+  void RegisterGenerator(const string& flag_name,
+                         const string& option_flag_name,
+                         CodeGenerator* generator,
+                         const string& help_text);
+
+  // Enables "plugins".  In this mode, if a command-line flag ends with "_out"
+  // but does not match any registered generator, the compiler will attempt to
+  // find a "plugin" to implement the generator.  Plugins are just executables.
+  // They should live somewhere in the PATH.
+  //
+  // The compiler determines the executable name to search for by concatenating
+  // exe_name_prefix with the unrecognized flag name, removing "_out".  So, for
+  // example, if exe_name_prefix is "protoc-" and you pass the flag --foo_out,
+  // the compiler will try to run the program "protoc-foo".
+  //
+  // The plugin program should implement the following usage:
+  //   plugin [--out=OUTDIR] [--parameter=PARAMETER] PROTO_FILES < DESCRIPTORS
+  // --out indicates the output directory (as passed to the --foo_out
+  // parameter); if omitted, the current directory should be used.  --parameter
+  // gives the generator parameter, if any was provided.  The PROTO_FILES list
+  // the .proto files which were given on the compiler command-line; these are
+  // the files for which the plugin is expected to generate output code.
+  // Finally, DESCRIPTORS is an encoded FileDescriptorSet (as defined in
+  // descriptor.proto).  This is piped to the plugin's stdin.  The set will
+  // include descriptors for all the files listed in PROTO_FILES as well as
+  // all files that they import.  The plugin MUST NOT attempt to read the
+  // PROTO_FILES directly -- it must use the FileDescriptorSet.
+  //
+  // The plugin should generate whatever files are necessary, as code generators
+  // normally do.  It should write the names of all files it generates to
+  // stdout.  The names should be relative to the output directory, NOT absolute
+  // names or relative to the current directory.  If any errors occur, error
+  // messages should be written to stderr.  If an error is fatal, the plugin
+  // should exit with a non-zero exit code.
+  void AllowPlugins(const string& exe_name_prefix);
+
+  // Run the Protocol Compiler with the given command-line parameters.
+  // Returns the error code which should be returned by main().
+  //
+  // It may not be safe to call Run() in a multi-threaded environment because
+  // it calls strerror().  I'm not sure why you'd want to do this anyway.
+  int Run(int argc, const char* const argv[]);
+
+  // Call SetInputsAreCwdRelative(true) if the input files given on the command
+  // line should be interpreted relative to the proto import path specified
+  // using --proto_path or -I flags.  Otherwise, input file names will be
+  // interpreted relative to the current working directory (or as absolute
+  // paths if they start with '/'), though they must still reside inside
+  // a directory given by --proto_path or the compiler will fail.  The latter
+  // mode is generally more intuitive and easier to use, especially e.g. when
+  // defining implicit rules in Makefiles.
+  void SetInputsAreProtoPathRelative(bool enable) {
+    inputs_are_proto_path_relative_ = enable;
+  }
+
+  // Provides some text which will be printed when the --version flag is
+  // used.  The version of libprotoc will also be printed on the next line
+  // after this text.
+  void SetVersionInfo(const string& text) {
+    version_info_ = text;
+  }
+
+
+ private:
+  // -----------------------------------------------------------------
+
+  class ErrorPrinter;
+  class GeneratorContextImpl;
+  class MemoryOutputStream;
+
+  // Clear state from previous Run().
+  void Clear();
+
+  // Remaps each file in input_files_ so that it is relative to one of the
+  // directories in proto_path_.  Returns false if an error occurred.  This
+  // is only used if inputs_are_proto_path_relative_ is false.
+  bool MakeInputsBeProtoPathRelative(
+    DiskSourceTree* source_tree);
+
+  // Return status for ParseArguments() and InterpretArgument().
+  enum ParseArgumentStatus {
+    PARSE_ARGUMENT_DONE_AND_CONTINUE,
+    PARSE_ARGUMENT_DONE_AND_EXIT,
+    PARSE_ARGUMENT_FAIL
+  };
+
+  // Parse all command-line arguments.
+  ParseArgumentStatus ParseArguments(int argc, const char* const argv[]);
+
+  // Parses a command-line argument into a name/value pair.  Returns
+  // true if the next argument in the argv should be used as the value,
+  // false otherwise.
+  //
+  // Exmaples:
+  //   "-Isrc/protos" ->
+  //     name = "-I", value = "src/protos"
+  //   "--cpp_out=src/foo.pb2.cc" ->
+  //     name = "--cpp_out", value = "src/foo.pb2.cc"
+  //   "foo.proto" ->
+  //     name = "", value = "foo.proto"
+  bool ParseArgument(const char* arg, string* name, string* value);
+
+  // Interprets arguments parsed with ParseArgument.
+  ParseArgumentStatus InterpretArgument(const string& name,
+                                        const string& value);
+
+  // Print the --help text to stderr.
+  void PrintHelpText();
+
+  // Generate the given output file from the given input.
+  struct OutputDirective;  // see below
+  bool GenerateOutput(const vector<const FileDescriptor*>& parsed_files,
+                      const OutputDirective& output_directive,
+                      GeneratorContext* generator_context);
+  bool GeneratePluginOutput(const vector<const FileDescriptor*>& parsed_files,
+                            const string& plugin_name,
+                            const string& parameter,
+                            GeneratorContext* generator_context,
+                            string* error);
+
+  // Implements --encode and --decode.
+  bool EncodeOrDecode(const DescriptorPool* pool);
+
+  // Implements the --descriptor_set_out option.
+  bool WriteDescriptorSet(const vector<const FileDescriptor*> parsed_files);
+
+  // Get all transitive dependencies of the given file (including the file
+  // itself), adding them to the given list of FileDescriptorProtos.  The
+  // protos will be ordered such that every file is listed before any file that
+  // depends on it, so that you can call DescriptorPool::BuildFile() on them
+  // in order.  Any files in *already_seen will not be added, and each file
+  // added will be inserted into *already_seen.  If include_source_code_info is
+  // true then include the source code information in the FileDescriptorProtos.
+  static void GetTransitiveDependencies(
+      const FileDescriptor* file,
+      bool include_source_code_info,
+      set<const FileDescriptor*>* already_seen,
+      RepeatedPtrField<FileDescriptorProto>* output);
+
+  // -----------------------------------------------------------------
+
+  // The name of the executable as invoked (i.e. argv[0]).
+  string executable_name_;
+
+  // Version info set with SetVersionInfo().
+  string version_info_;
+
+  // Registered generators.
+  struct GeneratorInfo {
+    string flag_name;
+    string option_flag_name;
+    CodeGenerator* generator;
+    string help_text;
+  };
+  typedef map<string, GeneratorInfo> GeneratorMap;
+  GeneratorMap generators_by_flag_name_;
+  GeneratorMap generators_by_option_name_;
+  // A map from generator names to the parameters specified using the option
+  // flag. For example, if the user invokes the compiler with:
+  //   protoc --foo_out=outputdir --foo_opt=enable_bar ...
+  // Then there will be an entry ("--foo_out", "enable_bar") in this map.
+  map<string, string> generator_parameters_;
+
+  // See AllowPlugins().  If this is empty, plugins aren't allowed.
+  string plugin_prefix_;
+
+  // Maps specific plugin names to files.  When executing a plugin, this map
+  // is searched first to find the plugin executable.  If not found here, the
+  // PATH (or other OS-specific search strategy) is searched.
+  map<string, string> plugins_;
+
+  // Stuff parsed from command line.
+  enum Mode {
+    MODE_COMPILE,  // Normal mode:  parse .proto files and compile them.
+    MODE_ENCODE,   // --encode:  read text from stdin, write binary to stdout.
+    MODE_DECODE    // --decode:  read binary from stdin, write text to stdout.
+  };
+
+  Mode mode_;
+
+  enum ErrorFormat {
+    ERROR_FORMAT_GCC,   // GCC error output format (default).
+    ERROR_FORMAT_MSVS   // Visual Studio output (--error_format=msvs).
+  };
+
+  ErrorFormat error_format_;
+
+  vector<pair<string, string> > proto_path_;  // Search path for proto files.
+  vector<string> input_files_;                // Names of the input proto files.
+
+  // output_directives_ lists all the files we are supposed to output and what
+  // generator to use for each.
+  struct OutputDirective {
+    string name;                // E.g. "--foo_out"
+    CodeGenerator* generator;   // NULL for plugins
+    string parameter;
+    string output_location;
+  };
+  vector<OutputDirective> output_directives_;
+
+  // When using --encode or --decode, this names the type we are encoding or
+  // decoding.  (Empty string indicates --decode_raw.)
+  string codec_type_;
+
+  // If --descriptor_set_out was given, this is the filename to which the
+  // FileDescriptorSet should be written.  Otherwise, empty.
+  string descriptor_set_name_;
+
+  // True if --include_imports was given, meaning that we should
+  // write all transitive dependencies to the DescriptorSet.  Otherwise, only
+  // the .proto files listed on the command-line are added.
+  bool imports_in_descriptor_set_;
+
+  // True if --include_source_info was given, meaning that we should not strip
+  // SourceCodeInfo from the DescriptorSet.
+  bool source_info_in_descriptor_set_;
+
+  // Was the --disallow_services flag used?
+  bool disallow_services_;
+
+  // See SetInputsAreProtoPathRelative().
+  bool inputs_are_proto_path_relative_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CommandLineInterface);
+};
+
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h b/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
new file mode 100644
index 00000000..a90e84d7
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
@@ -0,0 +1,72 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Generates C++ code for a given .proto file.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
+#define GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
+
+#include <string>
+#include <google/protobuf/compiler/code_generator.h>
+
+namespace google {
+namespace protobuf {
+namespace compiler {
+namespace cpp {
+
+// CodeGenerator implementation which generates a C++ source file and
+// header.  If you create your own protocol compiler binary and you want
+// it to support C++ output, you can do so by registering an instance of this
+// CodeGenerator with the CommandLineInterface in your main() function.
+class LIBPROTOC_EXPORT CppGenerator : public CodeGenerator {
+ public:
+  CppGenerator();
+  ~CppGenerator();
+
+  // implements CodeGenerator ----------------------------------------
+  bool Generate(const FileDescriptor* file,
+                const string& parameter,
+                GeneratorContext* generator_context,
+                string* error) const;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CppGenerator);
+};
+
+}  // namespace cpp
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/importer.h b/ps-lite/deps/include/google/protobuf/compiler/importer.h
new file mode 100644
index 00000000..7a62fa0e
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/importer.h
@@ -0,0 +1,304 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file is the public interface to the .proto file parser.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
+#define GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
+
+#include <string>
+#include <vector>
+#include <set>
+#include <utility>
+#include <google/protobuf/descriptor.h>
+#include <google/protobuf/descriptor_database.h>
+#include <google/protobuf/compiler/parser.h>
+
+namespace google {
+namespace protobuf {
+
+namespace io { class ZeroCopyInputStream; }
+
+namespace compiler {
+
+// Defined in this file.
+class Importer;
+class MultiFileErrorCollector;
+class SourceTree;
+class DiskSourceTree;
+
+// TODO(kenton):  Move all SourceTree stuff to a separate file?
+
+// An implementation of DescriptorDatabase which loads files from a SourceTree
+// and parses them.
+//
+// Note:  This class is not thread-safe since it maintains a table of source
+//   code locations for error reporting.  However, when a DescriptorPool wraps
+//   a DescriptorDatabase, it uses mutex locking to make sure only one method
+//   of the database is called at a time, even if the DescriptorPool is used
+//   from multiple threads.  Therefore, there is only a problem if you create
+//   multiple DescriptorPools wrapping the same SourceTreeDescriptorDatabase
+//   and use them from multiple threads.
+//
+// Note:  This class does not implement FindFileContainingSymbol() or
+//   FindFileContainingExtension(); these will always return false.
+class LIBPROTOBUF_EXPORT SourceTreeDescriptorDatabase : public DescriptorDatabase {
+ public:
+  SourceTreeDescriptorDatabase(SourceTree* source_tree);
+  ~SourceTreeDescriptorDatabase();
+
+  // Instructs the SourceTreeDescriptorDatabase to report any parse errors
+  // to the given MultiFileErrorCollector.  This should be called before
+  // parsing.  error_collector must remain valid until either this method
+  // is called again or the SourceTreeDescriptorDatabase is destroyed.
+  void RecordErrorsTo(MultiFileErrorCollector* error_collector) {
+    error_collector_ = error_collector;
+  }
+
+  // Gets a DescriptorPool::ErrorCollector which records errors to the
+  // MultiFileErrorCollector specified with RecordErrorsTo().  This collector
+  // has the ability to determine exact line and column numbers of errors
+  // from the information given to it by the DescriptorPool.
+  DescriptorPool::ErrorCollector* GetValidationErrorCollector() {
+    using_validation_error_collector_ = true;
+    return &validation_error_collector_;
+  }
+
+  // implements DescriptorDatabase -----------------------------------
+  bool FindFileByName(const string& filename, FileDescriptorProto* output);
+  bool FindFileContainingSymbol(const string& symbol_name,
+                                FileDescriptorProto* output);
+  bool FindFileContainingExtension(const string& containing_type,
+                                   int field_number,
+                                   FileDescriptorProto* output);
+
+ private:
+  class SingleFileErrorCollector;
+
+  SourceTree* source_tree_;
+  MultiFileErrorCollector* error_collector_;
+
+  class LIBPROTOBUF_EXPORT ValidationErrorCollector : public DescriptorPool::ErrorCollector {
+   public:
+    ValidationErrorCollector(SourceTreeDescriptorDatabase* owner);
+    ~ValidationErrorCollector();
+
+    // implements ErrorCollector ---------------------------------------
+    void AddError(const string& filename,
+                  const string& element_name,
+                  const Message* descriptor,
+                  ErrorLocation location,
+                  const string& message);
+
+   private:
+    SourceTreeDescriptorDatabase* owner_;
+  };
+  friend class ValidationErrorCollector;
+
+  bool using_validation_error_collector_;
+  SourceLocationTable source_locations_;
+  ValidationErrorCollector validation_error_collector_;
+};
+
+// Simple interface for parsing .proto files.  This wraps the process
+// of opening the file, parsing it with a Parser, recursively parsing all its
+// imports, and then cross-linking the results to produce a FileDescriptor.
+//
+// This is really just a thin wrapper around SourceTreeDescriptorDatabase.
+// You may find that SourceTreeDescriptorDatabase is more flexible.
+//
+// TODO(kenton):  I feel like this class is not well-named.
+class LIBPROTOBUF_EXPORT Importer {
+ public:
+  Importer(SourceTree* source_tree,
+           MultiFileErrorCollector* error_collector);
+  ~Importer();
+
+  // Import the given file and build a FileDescriptor representing it.  If
+  // the file is already in the DescriptorPool, the existing FileDescriptor
+  // will be returned.  The FileDescriptor is property of the DescriptorPool,
+  // and will remain valid until it is destroyed.  If any errors occur, they
+  // will be reported using the error collector and Import() will return NULL.
+  //
+  // A particular Importer object will only report errors for a particular
+  // file once.  All future attempts to import the same file will return NULL
+  // without reporting any errors.  The idea is that you might want to import
+  // a lot of files without seeing the same errors over and over again.  If
+  // you want to see errors for the same files repeatedly, you can use a
+  // separate Importer object to import each one (but use the same
+  // DescriptorPool so that they can be cross-linked).
+  const FileDescriptor* Import(const string& filename);
+
+  // The DescriptorPool in which all imported FileDescriptors and their
+  // contents are stored.
+  inline const DescriptorPool* pool() const {
+    return &pool_;
+  }
+
+ private:
+  SourceTreeDescriptorDatabase database_;
+  DescriptorPool pool_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Importer);
+};
+
+// If the importer encounters problems while trying to import the proto files,
+// it reports them to a MultiFileErrorCollector.
+class LIBPROTOBUF_EXPORT MultiFileErrorCollector {
+ public:
+  inline MultiFileErrorCollector() {}
+  virtual ~MultiFileErrorCollector();
+
+  // Line and column numbers are zero-based.  A line number of -1 indicates
+  // an error with the entire file (e.g. "not found").
+  virtual void AddError(const string& filename, int line, int column,
+                        const string& message) = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MultiFileErrorCollector);
+};
+
+// Abstract interface which represents a directory tree containing proto files.
+// Used by the default implementation of Importer to resolve import statements
+// Most users will probably want to use the DiskSourceTree implementation,
+// below.
+class LIBPROTOBUF_EXPORT SourceTree {
+ public:
+  inline SourceTree() {}
+  virtual ~SourceTree();
+
+  // Open the given file and return a stream that reads it, or NULL if not
+  // found.  The caller takes ownership of the returned object.  The filename
+  // must be a path relative to the root of the source tree and must not
+  // contain "." or ".." components.
+  virtual io::ZeroCopyInputStream* Open(const string& filename) = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(SourceTree);
+};
+
+// An implementation of SourceTree which loads files from locations on disk.
+// Multiple mappings can be set up to map locations in the DiskSourceTree to
+// locations in the physical filesystem.
+class LIBPROTOBUF_EXPORT DiskSourceTree : public SourceTree {
+ public:
+  DiskSourceTree();
+  ~DiskSourceTree();
+
+  // Map a path on disk to a location in the SourceTree.  The path may be
+  // either a file or a directory.  If it is a directory, the entire tree
+  // under it will be mapped to the given virtual location.  To map a directory
+  // to the root of the source tree, pass an empty string for virtual_path.
+  //
+  // If multiple mapped paths apply when opening a file, they will be searched
+  // in order.  For example, if you do:
+  //   MapPath("bar", "foo/bar");
+  //   MapPath("", "baz");
+  // and then you do:
+  //   Open("bar/qux");
+  // the DiskSourceTree will first try to open foo/bar/qux, then baz/bar/qux,
+  // returning the first one that opens successfuly.
+  //
+  // disk_path may be an absolute path or relative to the current directory,
+  // just like a path you'd pass to open().
+  void MapPath(const string& virtual_path, const string& disk_path);
+
+  // Return type for DiskFileToVirtualFile().
+  enum DiskFileToVirtualFileResult {
+    SUCCESS,
+    SHADOWED,
+    CANNOT_OPEN,
+    NO_MAPPING
+  };
+
+  // Given a path to a file on disk, find a virtual path mapping to that
+  // file.  The first mapping created with MapPath() whose disk_path contains
+  // the filename is used.  However, that virtual path may not actually be
+  // usable to open the given file.  Possible return values are:
+  // * SUCCESS: The mapping was found.  *virtual_file is filled in so that
+  //   calling Open(*virtual_file) will open the file named by disk_file.
+  // * SHADOWED: A mapping was found, but using Open() to open this virtual
+  //   path will end up returning some different file.  This is because some
+  //   other mapping with a higher precedence also matches this virtual path
+  //   and maps it to a different file that exists on disk.  *virtual_file
+  //   is filled in as it would be in the SUCCESS case.  *shadowing_disk_file
+  //   is filled in with the disk path of the file which would be opened if
+  //   you were to call Open(*virtual_file).
+  // * CANNOT_OPEN: The mapping was found and was not shadowed, but the
+  //   file specified cannot be opened.  When this value is returned,
+  //   errno will indicate the reason the file cannot be opened.  *virtual_file
+  //   will be set to the virtual path as in the SUCCESS case, even though
+  //   it is not useful.
+  // * NO_MAPPING: Indicates that no mapping was found which contains this
+  //   file.
+  DiskFileToVirtualFileResult
+    DiskFileToVirtualFile(const string& disk_file,
+                          string* virtual_file,
+                          string* shadowing_disk_file);
+
+  // Given a virtual path, find the path to the file on disk.
+  // Return true and update disk_file with the on-disk path if the file exists.
+  // Return false and leave disk_file untouched if the file doesn't exist.
+  bool VirtualFileToDiskFile(const string& virtual_file, string* disk_file);
+
+  // implements SourceTree -------------------------------------------
+  io::ZeroCopyInputStream* Open(const string& filename);
+
+ private:
+  struct Mapping {
+    string virtual_path;
+    string disk_path;
+
+    inline Mapping(const string& virtual_path_param,
+                   const string& disk_path_param)
+      : virtual_path(virtual_path_param), disk_path(disk_path_param) {}
+  };
+  vector<Mapping> mappings_;
+
+  // Like Open(), but returns the on-disk path in disk_file if disk_file is
+  // non-NULL and the file could be successfully opened.
+  io::ZeroCopyInputStream* OpenVirtualFile(const string& virtual_file,
+                                           string* disk_file);
+
+  // Like Open() but given the actual on-disk path.
+  io::ZeroCopyInputStream* OpenDiskFile(const string& filename);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DiskSourceTree);
+};
+
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h b/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
new file mode 100644
index 00000000..888b8d85
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
@@ -0,0 +1,72 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Generates Java code for a given .proto file.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
+#define GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
+
+#include <string>
+#include <google/protobuf/compiler/code_generator.h>
+
+namespace google {
+namespace protobuf {
+namespace compiler {
+namespace java {
+
+// CodeGenerator implementation which generates Java code.  If you create your
+// own protocol compiler binary and you want it to support Java output, you
+// can do so by registering an instance of this CodeGenerator with the
+// CommandLineInterface in your main() function.
+class LIBPROTOC_EXPORT JavaGenerator : public CodeGenerator {
+ public:
+  JavaGenerator();
+  ~JavaGenerator();
+
+  // implements CodeGenerator ----------------------------------------
+  bool Generate(const FileDescriptor* file,
+                const string& parameter,
+                GeneratorContext* context,
+                string* error) const;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(JavaGenerator);
+};
+
+}  // namespace java
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/parser.h b/ps-lite/deps/include/google/protobuf/compiler/parser.h
new file mode 100644
index 00000000..cfd3649b
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/parser.h
@@ -0,0 +1,477 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Implements parsing of .proto files to FileDescriptorProtos.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_PARSER_H__
+#define GOOGLE_PROTOBUF_COMPILER_PARSER_H__
+
+#include <map>
+#include <string>
+#include <utility>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/descriptor.h>
+#include <google/protobuf/descriptor.pb.h>
+#include <google/protobuf/repeated_field.h>
+#include <google/protobuf/io/tokenizer.h>
+
+namespace google {
+namespace protobuf { class Message; }
+
+namespace protobuf {
+namespace compiler {
+
+// Defined in this file.
+class Parser;
+class SourceLocationTable;
+
+// Implements parsing of protocol definitions (such as .proto files).
+//
+// Note that most users will be more interested in the Importer class.
+// Parser is a lower-level class which simply converts a single .proto file
+// to a FileDescriptorProto.  It does not resolve import directives or perform
+// many other kinds of validation needed to construct a complete
+// FileDescriptor.
+class LIBPROTOBUF_EXPORT Parser {
+ public:
+  Parser();
+  ~Parser();
+
+  // Parse the entire input and construct a FileDescriptorProto representing
+  // it.  Returns true if no errors occurred, false otherwise.
+  bool Parse(io::Tokenizer* input, FileDescriptorProto* file);
+
+  // Optional fetaures:
+
+  // DEPRECATED:  New code should use the SourceCodeInfo embedded in the
+  //   FileDescriptorProto.
+  //
+  // Requests that locations of certain definitions be recorded to the given
+  // SourceLocationTable while parsing.  This can be used to look up exact line
+  // and column numbers for errors reported by DescriptorPool during validation.
+  // Set to NULL (the default) to discard source location information.
+  void RecordSourceLocationsTo(SourceLocationTable* location_table) {
+    source_location_table_ = location_table;
+  }
+
+  // Requests that errors be recorded to the given ErrorCollector while
+  // parsing.  Set to NULL (the default) to discard error messages.
+  void RecordErrorsTo(io::ErrorCollector* error_collector) {
+    error_collector_ = error_collector;
+  }
+
+  // Returns the identifier used in the "syntax = " declaration, if one was
+  // seen during the last call to Parse(), or the empty string otherwise.
+  const string& GetSyntaxIdentifier() { return syntax_identifier_; }
+
+  // If set true, input files will be required to begin with a syntax
+  // identifier.  Otherwise, files may omit this.  If a syntax identifier
+  // is provided, it must be 'syntax = "proto2";' and must appear at the
+  // top of this file regardless of whether or not it was required.
+  void SetRequireSyntaxIdentifier(bool value) {
+    require_syntax_identifier_ = value;
+  }
+
+  // Call SetStopAfterSyntaxIdentifier(true) to tell the parser to stop
+  // parsing as soon as it has seen the syntax identifier, or lack thereof.
+  // This is useful for quickly identifying the syntax of the file without
+  // parsing the whole thing.  If this is enabled, no error will be recorded
+  // if the syntax identifier is something other than "proto2" (since
+  // presumably the caller intends to deal with that), but other kinds of
+  // errors (e.g. parse errors) will still be reported.  When this is enabled,
+  // you may pass a NULL FileDescriptorProto to Parse().
+  void SetStopAfterSyntaxIdentifier(bool value) {
+    stop_after_syntax_identifier_ = value;
+  }
+
+ private:
+  class LocationRecorder;
+
+  // =================================================================
+  // Error recovery helpers
+
+  // Consume the rest of the current statement.  This consumes tokens
+  // until it sees one of:
+  //   ';'  Consumes the token and returns.
+  //   '{'  Consumes the brace then calls SkipRestOfBlock().
+  //   '}'  Returns without consuming.
+  //   EOF  Returns (can't consume).
+  // The Parser often calls SkipStatement() after encountering a syntax
+  // error.  This allows it to go on parsing the following lines, allowing
+  // it to report more than just one error in the file.
+  void SkipStatement();
+
+  // Consume the rest of the current block, including nested blocks,
+  // ending after the closing '}' is encountered and consumed, or at EOF.
+  void SkipRestOfBlock();
+
+  // -----------------------------------------------------------------
+  // Single-token consuming helpers
+  //
+  // These make parsing code more readable.
+
+  // True if the current token is TYPE_END.
+  inline bool AtEnd();
+
+  // True if the next token matches the given text.
+  inline bool LookingAt(const char* text);
+  // True if the next token is of the given type.
+  inline bool LookingAtType(io::Tokenizer::TokenType token_type);
+
+  // If the next token exactly matches the text given, consume it and return
+  // true.  Otherwise, return false without logging an error.
+  bool TryConsume(const char* text);
+
+  // These attempt to read some kind of token from the input.  If successful,
+  // they return true.  Otherwise they return false and add the given error
+  // to the error list.
+
+  // Consume a token with the exact text given.
+  bool Consume(const char* text, const char* error);
+  // Same as above, but automatically generates the error "Expected \"text\".",
+  // where "text" is the expected token text.
+  bool Consume(const char* text);
+  // Consume a token of type IDENTIFIER and store its text in "output".
+  bool ConsumeIdentifier(string* output, const char* error);
+  // Consume an integer and store its value in "output".
+  bool ConsumeInteger(int* output, const char* error);
+  // Consume a signed integer and store its value in "output".
+  bool ConsumeSignedInteger(int* output, const char* error);
+  // Consume a 64-bit integer and store its value in "output".  If the value
+  // is greater than max_value, an error will be reported.
+  bool ConsumeInteger64(uint64 max_value, uint64* output, const char* error);
+  // Consume a number and store its value in "output".  This will accept
+  // tokens of either INTEGER or FLOAT type.
+  bool ConsumeNumber(double* output, const char* error);
+  // Consume a string literal and store its (unescaped) value in "output".
+  bool ConsumeString(string* output, const char* error);
+
+  // Consume a token representing the end of the statement.  Comments between
+  // this token and the next will be harvested for documentation.  The given
+  // LocationRecorder should refer to the declaration that was just parsed;
+  // it will be populated with these comments.
+  //
+  // TODO(kenton):  The LocationRecorder is const because historically locations
+  //   have been passed around by const reference, for no particularly good
+  //   reason.  We should probably go through and change them all to mutable
+  //   pointer to make this more intuitive.
+  bool TryConsumeEndOfDeclaration(const char* text,
+                                  const LocationRecorder* location);
+  bool ConsumeEndOfDeclaration(const char* text,
+                               const LocationRecorder* location);
+
+  // -----------------------------------------------------------------
+  // Error logging helpers
+
+  // Invokes error_collector_->AddError(), if error_collector_ is not NULL.
+  void AddError(int line, int column, const string& error);
+
+  // Invokes error_collector_->AddError() with the line and column number
+  // of the current token.
+  void AddError(const string& error);
+
+  // Records a location in the SourceCodeInfo.location table (see
+  // descriptor.proto).  We use RAII to ensure that the start and end locations
+  // are recorded -- the constructor records the start location and the
+  // destructor records the end location.  Since the parser is
+  // recursive-descent, this works out beautifully.
+  class LIBPROTOBUF_EXPORT LocationRecorder {
+   public:
+    // Construct the file's "root" location.
+    LocationRecorder(Parser* parser);
+
+    // Construct a location that represents a declaration nested within the
+    // given parent.  E.g. a field's location is nested within the location
+    // for a message type.  The parent's path will be copied, so you should
+    // call AddPath() only to add the path components leading from the parent
+    // to the child (as opposed to leading from the root to the child).
+    LocationRecorder(const LocationRecorder& parent);
+
+    // Convenience constructors that call AddPath() one or two times.
+    LocationRecorder(const LocationRecorder& parent, int path1);
+    LocationRecorder(const LocationRecorder& parent, int path1, int path2);
+
+    ~LocationRecorder();
+
+    // Add a path component.  See SourceCodeInfo.Location.path in
+    // descriptor.proto.
+    void AddPath(int path_component);
+
+    // By default the location is considered to start at the current token at
+    // the time the LocationRecorder is created.  StartAt() sets the start
+    // location to the given token instead.
+    void StartAt(const io::Tokenizer::Token& token);
+
+    // By default the location is considered to end at the previous token at
+    // the time the LocationRecorder is destroyed.  EndAt() sets the end
+    // location to the given token instead.
+    void EndAt(const io::Tokenizer::Token& token);
+
+    // Records the start point of this location to the SourceLocationTable that
+    // was passed to RecordSourceLocationsTo(), if any.  SourceLocationTable
+    // is an older way of keeping track of source locations which is still
+    // used in some places.
+    void RecordLegacyLocation(const Message* descriptor,
+        DescriptorPool::ErrorCollector::ErrorLocation location);
+
+    // Attaches leading and trailing comments to the location.  The two strings
+    // will be swapped into place, so after this is called *leading and
+    // *trailing will be empty.
+    //
+    // TODO(kenton):  See comment on TryConsumeEndOfDeclaration(), above, for
+    //   why this is const.
+    void AttachComments(string* leading, string* trailing) const;
+
+   private:
+    Parser* parser_;
+    SourceCodeInfo::Location* location_;
+
+    void Init(const LocationRecorder& parent);
+  };
+
+  // =================================================================
+  // Parsers for various language constructs
+
+  // Parses the "syntax = \"proto2\";" line at the top of the file.  Returns
+  // false if it failed to parse or if the syntax identifier was not
+  // recognized.
+  bool ParseSyntaxIdentifier();
+
+  // These methods parse various individual bits of code.  They return
+  // false if they completely fail to parse the construct.  In this case,
+  // it is probably necessary to skip the rest of the statement to recover.
+  // However, if these methods return true, it does NOT mean that there
+  // were no errors; only that there were no *syntax* errors.  For instance,
+  // if a service method is defined using proper syntax but uses a primitive
+  // type as its input or output, ParseMethodField() still returns true
+  // and only reports the error by calling AddError().  In practice, this
+  // makes logic much simpler for the caller.
+
+  // Parse a top-level message, enum, service, etc.
+  bool ParseTopLevelStatement(FileDescriptorProto* file,
+                              const LocationRecorder& root_location);
+
+  // Parse various language high-level language construrcts.
+  bool ParseMessageDefinition(DescriptorProto* message,
+                              const LocationRecorder& message_location);
+  bool ParseEnumDefinition(EnumDescriptorProto* enum_type,
+                           const LocationRecorder& enum_location);
+  bool ParseServiceDefinition(ServiceDescriptorProto* service,
+                              const LocationRecorder& service_location);
+  bool ParsePackage(FileDescriptorProto* file,
+                    const LocationRecorder& root_location);
+  bool ParseImport(RepeatedPtrField<string>* dependency,
+                   RepeatedField<int32>* public_dependency,
+                   RepeatedField<int32>* weak_dependency,
+                   const LocationRecorder& root_location);
+  bool ParseOption(Message* options,
+                   const LocationRecorder& options_location);
+
+  // These methods parse the contents of a message, enum, or service type and
+  // add them to the given object.  They consume the entire block including
+  // the beginning and ending brace.
+  bool ParseMessageBlock(DescriptorProto* message,
+                         const LocationRecorder& message_location);
+  bool ParseEnumBlock(EnumDescriptorProto* enum_type,
+                      const LocationRecorder& enum_location);
+  bool ParseServiceBlock(ServiceDescriptorProto* service,
+                         const LocationRecorder& service_location);
+
+  // Parse one statement within a message, enum, or service block, inclunding
+  // final semicolon.
+  bool ParseMessageStatement(DescriptorProto* message,
+                             const LocationRecorder& message_location);
+  bool ParseEnumStatement(EnumDescriptorProto* message,
+                          const LocationRecorder& enum_location);
+  bool ParseServiceStatement(ServiceDescriptorProto* message,
+                             const LocationRecorder& service_location);
+
+  // Parse a field of a message.  If the field is a group, its type will be
+  // added to "messages".
+  //
+  // parent_location and location_field_number_for_nested_type are needed when
+  // parsing groups -- we need to generate a nested message type within the
+  // parent and record its location accordingly.  Since the parent could be
+  // either a FileDescriptorProto or a DescriptorProto, we must pass in the
+  // correct field number to use.
+  bool ParseMessageField(FieldDescriptorProto* field,
+                         RepeatedPtrField<DescriptorProto>* messages,
+                         const LocationRecorder& parent_location,
+                         int location_field_number_for_nested_type,
+                         const LocationRecorder& field_location);
+
+  // Parse an "extensions" declaration.
+  bool ParseExtensions(DescriptorProto* message,
+                       const LocationRecorder& extensions_location);
+
+  // Parse an "extend" declaration.  (See also comments for
+  // ParseMessageField().)
+  bool ParseExtend(RepeatedPtrField<FieldDescriptorProto>* extensions,
+                   RepeatedPtrField<DescriptorProto>* messages,
+                   const LocationRecorder& parent_location,
+                   int location_field_number_for_nested_type,
+                   const LocationRecorder& extend_location);
+
+  // Parse a single enum value within an enum block.
+  bool ParseEnumConstant(EnumValueDescriptorProto* enum_value,
+                         const LocationRecorder& enum_value_location);
+
+  // Parse enum constant options, i.e. the list in square brackets at the end
+  // of the enum constant value definition.
+  bool ParseEnumConstantOptions(EnumValueDescriptorProto* value,
+                                const LocationRecorder& enum_value_location);
+
+  // Parse a single method within a service definition.
+  bool ParseServiceMethod(MethodDescriptorProto* method,
+                          const LocationRecorder& method_location);
+
+
+  // Parse options of a single method or stream.
+  bool ParseOptions(const LocationRecorder& parent_location,
+                    const int optionsFieldNumber,
+                    Message* mutable_options);
+
+  // Parse "required", "optional", or "repeated" and fill in "label"
+  // with the value.
+  bool ParseLabel(FieldDescriptorProto::Label* label);
+
+  // Parse a type name and fill in "type" (if it is a primitive) or
+  // "type_name" (if it is not) with the type parsed.
+  bool ParseType(FieldDescriptorProto::Type* type,
+                 string* type_name);
+  // Parse a user-defined type and fill in "type_name" with the name.
+  // If a primitive type is named, it is treated as an error.
+  bool ParseUserDefinedType(string* type_name);
+
+  // Parses field options, i.e. the stuff in square brackets at the end
+  // of a field definition.  Also parses default value.
+  bool ParseFieldOptions(FieldDescriptorProto* field,
+                         const LocationRecorder& field_location);
+
+  // Parse the "default" option.  This needs special handling because its
+  // type is the field's type.
+  bool ParseDefaultAssignment(FieldDescriptorProto* field,
+                              const LocationRecorder& field_location);
+
+  enum OptionStyle {
+    OPTION_ASSIGNMENT,  // just "name = value"
+    OPTION_STATEMENT    // "option name = value;"
+  };
+
+  // Parse a single option name/value pair, e.g. "ctype = CORD".  The name
+  // identifies a field of the given Message, and the value of that field
+  // is set to the parsed value.
+  bool ParseOption(Message* options,
+                   const LocationRecorder& options_location,
+                   OptionStyle style);
+
+  // Parses a single part of a multipart option name. A multipart name consists
+  // of names separated by dots. Each name is either an identifier or a series
+  // of identifiers separated by dots and enclosed in parentheses. E.g.,
+  // "foo.(bar.baz).qux".
+  bool ParseOptionNamePart(UninterpretedOption* uninterpreted_option,
+                           const LocationRecorder& part_location);
+
+  // Parses a string surrounded by balanced braces.  Strips off the outer
+  // braces and stores the enclosed string in *value.
+  // E.g.,
+  //     { foo }                     *value gets 'foo'
+  //     { foo { bar: box } }        *value gets 'foo { bar: box }'
+  //     {}                          *value gets ''
+  //
+  // REQUIRES: LookingAt("{")
+  // When finished successfully, we are looking at the first token past
+  // the ending brace.
+  bool ParseUninterpretedBlock(string* value);
+
+  // =================================================================
+
+  io::Tokenizer* input_;
+  io::ErrorCollector* error_collector_;
+  SourceCodeInfo* source_code_info_;
+  SourceLocationTable* source_location_table_;  // legacy
+  bool had_errors_;
+  bool require_syntax_identifier_;
+  bool stop_after_syntax_identifier_;
+  string syntax_identifier_;
+
+  // Leading doc comments for the next declaration.  These are not complete
+  // yet; use ConsumeEndOfDeclaration() to get the complete comments.
+  string upcoming_doc_comments_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Parser);
+};
+
+// A table mapping (descriptor, ErrorLocation) pairs -- as reported by
+// DescriptorPool when validating descriptors -- to line and column numbers
+// within the original source code.
+//
+// This is semi-obsolete:  FileDescriptorProto.source_code_info now contains
+// far more complete information about source locations.  However, as of this
+// writing you still need to use SourceLocationTable when integrating with
+// DescriptorPool.
+class LIBPROTOBUF_EXPORT SourceLocationTable {
+ public:
+  SourceLocationTable();
+  ~SourceLocationTable();
+
+  // Finds the precise location of the given error and fills in *line and
+  // *column with the line and column numbers.  If not found, sets *line to
+  // -1 and *column to 0 (since line = -1 is used to mean "error has no exact
+  // location" in the ErrorCollector interface).  Returns true if found, false
+  // otherwise.
+  bool Find(const Message* descriptor,
+            DescriptorPool::ErrorCollector::ErrorLocation location,
+            int* line, int* column) const;
+
+  // Adds a location to the table.
+  void Add(const Message* descriptor,
+           DescriptorPool::ErrorCollector::ErrorLocation location,
+           int line, int column);
+
+  // Clears the contents of the table.
+  void Clear();
+
+ private:
+  typedef map<
+    pair<const Message*, DescriptorPool::ErrorCollector::ErrorLocation>,
+    pair<int, int> > LocationMap;
+  LocationMap location_map_;
+};
+
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_PARSER_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.h b/ps-lite/deps/include/google/protobuf/compiler/plugin.h
new file mode 100644
index 00000000..6fa2de12
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/plugin.h
@@ -0,0 +1,72 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//
+// Front-end for protoc code generator plugins written in C++.
+//
+// To implement a protoc plugin in C++, simply write an implementation of
+// CodeGenerator, then create a main() function like:
+//   int main(int argc, char* argv[]) {
+//     MyCodeGenerator generator;
+//     return google::protobuf::compiler::PluginMain(argc, argv, &generator);
+//   }
+// You must link your plugin against libprotobuf and libprotoc.
+//
+// To get protoc to use the plugin, do one of the following:
+// * Place the plugin binary somewhere in the PATH and give it the name
+//   "protoc-gen-NAME" (replacing "NAME" with the name of your plugin).  If you
+//   then invoke protoc with the parameter --NAME_out=OUT_DIR (again, replace
+//   "NAME" with your plugin's name), protoc will invoke your plugin to generate
+//   the output, which will be placed in OUT_DIR.
+// * Place the plugin binary anywhere, with any name, and pass the --plugin
+//   parameter to protoc to direct it to your plugin like so:
+//     protoc --plugin=protoc-gen-NAME=path/to/mybinary --NAME_out=OUT_DIR
+//   On Windows, make sure to include the .exe suffix:
+//     protoc --plugin=protoc-gen-NAME=path/to/mybinary.exe --NAME_out=OUT_DIR
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
+#define GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
+
+#include <google/protobuf/stubs/common.h>
+namespace google {
+namespace protobuf {
+namespace compiler {
+
+class CodeGenerator;    // code_generator.h
+
+// Implements main() for a protoc plugin exposing the given code generator.
+LIBPROTOC_EXPORT int PluginMain(int argc, char* argv[], const CodeGenerator* generator);
+
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h b/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
new file mode 100644
index 00000000..68cc21c7
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
@@ -0,0 +1,856 @@
+// Generated by the protocol buffer compiler.  DO NOT EDIT!
+// source: google/protobuf/compiler/plugin.proto
+
+#ifndef PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
+#define PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
+
+#include <string>
+
+#include <google/protobuf/stubs/common.h>
+
+#if GOOGLE_PROTOBUF_VERSION < 2005000
+#error This file was generated by a newer version of protoc which is
+#error incompatible with your Protocol Buffer headers.  Please update
+#error your headers.
+#endif
+#if 2005000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
+#error This file was generated by an older version of protoc which is
+#error incompatible with your Protocol Buffer headers.  Please
+#error regenerate this file with a newer version of protoc.
+#endif
+
+#include <google/protobuf/generated_message_util.h>
+#include <google/protobuf/message.h>
+#include <google/protobuf/repeated_field.h>
+#include <google/protobuf/extension_set.h>
+#include <google/protobuf/unknown_field_set.h>
+#include "google/protobuf/descriptor.pb.h"
+// @@protoc_insertion_point(includes)
+
+namespace google {
+namespace protobuf {
+namespace compiler {
+
+// Internal implementation detail -- do not call these.
+void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+
+class CodeGeneratorRequest;
+class CodeGeneratorResponse;
+class CodeGeneratorResponse_File;
+
+// ===================================================================
+
+class LIBPROTOC_EXPORT CodeGeneratorRequest : public ::google::protobuf::Message {
+ public:
+  CodeGeneratorRequest();
+  virtual ~CodeGeneratorRequest();
+
+  CodeGeneratorRequest(const CodeGeneratorRequest& from);
+
+  inline CodeGeneratorRequest& operator=(const CodeGeneratorRequest& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const CodeGeneratorRequest& default_instance();
+
+  void Swap(CodeGeneratorRequest* other);
+
+  // implements Message ----------------------------------------------
+
+  CodeGeneratorRequest* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const CodeGeneratorRequest& from);
+  void MergeFrom(const CodeGeneratorRequest& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated string file_to_generate = 1;
+  inline int file_to_generate_size() const;
+  inline void clear_file_to_generate();
+  static const int kFileToGenerateFieldNumber = 1;
+  inline const ::std::string& file_to_generate(int index) const;
+  inline ::std::string* mutable_file_to_generate(int index);
+  inline void set_file_to_generate(int index, const ::std::string& value);
+  inline void set_file_to_generate(int index, const char* value);
+  inline void set_file_to_generate(int index, const char* value, size_t size);
+  inline ::std::string* add_file_to_generate();
+  inline void add_file_to_generate(const ::std::string& value);
+  inline void add_file_to_generate(const char* value);
+  inline void add_file_to_generate(const char* value, size_t size);
+  inline const ::google::protobuf::RepeatedPtrField< ::std::string>& file_to_generate() const;
+  inline ::google::protobuf::RepeatedPtrField< ::std::string>* mutable_file_to_generate();
+
+  // optional string parameter = 2;
+  inline bool has_parameter() const;
+  inline void clear_parameter();
+  static const int kParameterFieldNumber = 2;
+  inline const ::std::string& parameter() const;
+  inline void set_parameter(const ::std::string& value);
+  inline void set_parameter(const char* value);
+  inline void set_parameter(const char* value, size_t size);
+  inline ::std::string* mutable_parameter();
+  inline ::std::string* release_parameter();
+  inline void set_allocated_parameter(::std::string* parameter);
+
+  // repeated .google.protobuf.FileDescriptorProto proto_file = 15;
+  inline int proto_file_size() const;
+  inline void clear_proto_file();
+  static const int kProtoFileFieldNumber = 15;
+  inline const ::google::protobuf::FileDescriptorProto& proto_file(int index) const;
+  inline ::google::protobuf::FileDescriptorProto* mutable_proto_file(int index);
+  inline ::google::protobuf::FileDescriptorProto* add_proto_file();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
+      proto_file() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
+      mutable_proto_file();
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorRequest)
+ private:
+  inline void set_has_parameter();
+  inline void clear_has_parameter();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::std::string> file_to_generate_;
+  ::std::string* parameter_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > proto_file_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+
+  void InitAsDefaultInstance();
+  static CodeGeneratorRequest* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOC_EXPORT CodeGeneratorResponse_File : public ::google::protobuf::Message {
+ public:
+  CodeGeneratorResponse_File();
+  virtual ~CodeGeneratorResponse_File();
+
+  CodeGeneratorResponse_File(const CodeGeneratorResponse_File& from);
+
+  inline CodeGeneratorResponse_File& operator=(const CodeGeneratorResponse_File& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const CodeGeneratorResponse_File& default_instance();
+
+  void Swap(CodeGeneratorResponse_File* other);
+
+  // implements Message ----------------------------------------------
+
+  CodeGeneratorResponse_File* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const CodeGeneratorResponse_File& from);
+  void MergeFrom(const CodeGeneratorResponse_File& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // optional string insertion_point = 2;
+  inline bool has_insertion_point() const;
+  inline void clear_insertion_point();
+  static const int kInsertionPointFieldNumber = 2;
+  inline const ::std::string& insertion_point() const;
+  inline void set_insertion_point(const ::std::string& value);
+  inline void set_insertion_point(const char* value);
+  inline void set_insertion_point(const char* value, size_t size);
+  inline ::std::string* mutable_insertion_point();
+  inline ::std::string* release_insertion_point();
+  inline void set_allocated_insertion_point(::std::string* insertion_point);
+
+  // optional string content = 15;
+  inline bool has_content() const;
+  inline void clear_content();
+  static const int kContentFieldNumber = 15;
+  inline const ::std::string& content() const;
+  inline void set_content(const ::std::string& value);
+  inline void set_content(const char* value);
+  inline void set_content(const char* value, size_t size);
+  inline ::std::string* mutable_content();
+  inline ::std::string* release_content();
+  inline void set_allocated_content(::std::string* content);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorResponse.File)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_insertion_point();
+  inline void clear_has_insertion_point();
+  inline void set_has_content();
+  inline void clear_has_content();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::std::string* insertion_point_;
+  ::std::string* content_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+
+  void InitAsDefaultInstance();
+  static CodeGeneratorResponse_File* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOC_EXPORT CodeGeneratorResponse : public ::google::protobuf::Message {
+ public:
+  CodeGeneratorResponse();
+  virtual ~CodeGeneratorResponse();
+
+  CodeGeneratorResponse(const CodeGeneratorResponse& from);
+
+  inline CodeGeneratorResponse& operator=(const CodeGeneratorResponse& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const CodeGeneratorResponse& default_instance();
+
+  void Swap(CodeGeneratorResponse* other);
+
+  // implements Message ----------------------------------------------
+
+  CodeGeneratorResponse* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const CodeGeneratorResponse& from);
+  void MergeFrom(const CodeGeneratorResponse& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef CodeGeneratorResponse_File File;
+
+  // accessors -------------------------------------------------------
+
+  // optional string error = 1;
+  inline bool has_error() const;
+  inline void clear_error();
+  static const int kErrorFieldNumber = 1;
+  inline const ::std::string& error() const;
+  inline void set_error(const ::std::string& value);
+  inline void set_error(const char* value);
+  inline void set_error(const char* value, size_t size);
+  inline ::std::string* mutable_error();
+  inline ::std::string* release_error();
+  inline void set_allocated_error(::std::string* error);
+
+  // repeated .google.protobuf.compiler.CodeGeneratorResponse.File file = 15;
+  inline int file_size() const;
+  inline void clear_file();
+  static const int kFileFieldNumber = 15;
+  inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& file(int index) const;
+  inline ::google::protobuf::compiler::CodeGeneratorResponse_File* mutable_file(int index);
+  inline ::google::protobuf::compiler::CodeGeneratorResponse_File* add_file();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >&
+      file() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >*
+      mutable_file();
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorResponse)
+ private:
+  inline void set_has_error();
+  inline void clear_has_error();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* error_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File > file_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
+
+  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
+
+  void InitAsDefaultInstance();
+  static CodeGeneratorResponse* default_instance_;
+};
+// ===================================================================
+
+
+// ===================================================================
+
+// CodeGeneratorRequest
+
+// repeated string file_to_generate = 1;
+inline int CodeGeneratorRequest::file_to_generate_size() const {
+  return file_to_generate_.size();
+}
+inline void CodeGeneratorRequest::clear_file_to_generate() {
+  file_to_generate_.Clear();
+}
+inline const ::std::string& CodeGeneratorRequest::file_to_generate(int index) const {
+  return file_to_generate_.Get(index);
+}
+inline ::std::string* CodeGeneratorRequest::mutable_file_to_generate(int index) {
+  return file_to_generate_.Mutable(index);
+}
+inline void CodeGeneratorRequest::set_file_to_generate(int index, const ::std::string& value) {
+  file_to_generate_.Mutable(index)->assign(value);
+}
+inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value) {
+  file_to_generate_.Mutable(index)->assign(value);
+}
+inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value, size_t size) {
+  file_to_generate_.Mutable(index)->assign(
+    reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorRequest::add_file_to_generate() {
+  return file_to_generate_.Add();
+}
+inline void CodeGeneratorRequest::add_file_to_generate(const ::std::string& value) {
+  file_to_generate_.Add()->assign(value);
+}
+inline void CodeGeneratorRequest::add_file_to_generate(const char* value) {
+  file_to_generate_.Add()->assign(value);
+}
+inline void CodeGeneratorRequest::add_file_to_generate(const char* value, size_t size) {
+  file_to_generate_.Add()->assign(reinterpret_cast<const char*>(value), size);
+}
+inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
+CodeGeneratorRequest::file_to_generate() const {
+  return file_to_generate_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::std::string>*
+CodeGeneratorRequest::mutable_file_to_generate() {
+  return &file_to_generate_;
+}
+
+// optional string parameter = 2;
+inline bool CodeGeneratorRequest::has_parameter() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void CodeGeneratorRequest::set_has_parameter() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void CodeGeneratorRequest::clear_has_parameter() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void CodeGeneratorRequest::clear_parameter() {
+  if (parameter_ != &::google::protobuf::internal::kEmptyString) {
+    parameter_->clear();
+  }
+  clear_has_parameter();
+}
+inline const ::std::string& CodeGeneratorRequest::parameter() const {
+  return *parameter_;
+}
+inline void CodeGeneratorRequest::set_parameter(const ::std::string& value) {
+  set_has_parameter();
+  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
+    parameter_ = new ::std::string;
+  }
+  parameter_->assign(value);
+}
+inline void CodeGeneratorRequest::set_parameter(const char* value) {
+  set_has_parameter();
+  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
+    parameter_ = new ::std::string;
+  }
+  parameter_->assign(value);
+}
+inline void CodeGeneratorRequest::set_parameter(const char* value, size_t size) {
+  set_has_parameter();
+  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
+    parameter_ = new ::std::string;
+  }
+  parameter_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorRequest::mutable_parameter() {
+  set_has_parameter();
+  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
+    parameter_ = new ::std::string;
+  }
+  return parameter_;
+}
+inline ::std::string* CodeGeneratorRequest::release_parameter() {
+  clear_has_parameter();
+  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = parameter_;
+    parameter_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void CodeGeneratorRequest::set_allocated_parameter(::std::string* parameter) {
+  if (parameter_ != &::google::protobuf::internal::kEmptyString) {
+    delete parameter_;
+  }
+  if (parameter) {
+    set_has_parameter();
+    parameter_ = parameter;
+  } else {
+    clear_has_parameter();
+    parameter_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated .google.protobuf.FileDescriptorProto proto_file = 15;
+inline int CodeGeneratorRequest::proto_file_size() const {
+  return proto_file_.size();
+}
+inline void CodeGeneratorRequest::clear_proto_file() {
+  proto_file_.Clear();
+}
+inline const ::google::protobuf::FileDescriptorProto& CodeGeneratorRequest::proto_file(int index) const {
+  return proto_file_.Get(index);
+}
+inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::mutable_proto_file(int index) {
+  return proto_file_.Mutable(index);
+}
+inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::add_proto_file() {
+  return proto_file_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
+CodeGeneratorRequest::proto_file() const {
+  return proto_file_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
+CodeGeneratorRequest::mutable_proto_file() {
+  return &proto_file_;
+}
+
+// -------------------------------------------------------------------
+
+// CodeGeneratorResponse_File
+
+// optional string name = 1;
+inline bool CodeGeneratorResponse_File::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void CodeGeneratorResponse_File::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void CodeGeneratorResponse_File::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void CodeGeneratorResponse_File::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& CodeGeneratorResponse_File::name() const {
+  return *name_;
+}
+inline void CodeGeneratorResponse_File::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorResponse_File::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* CodeGeneratorResponse_File::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void CodeGeneratorResponse_File::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string insertion_point = 2;
+inline bool CodeGeneratorResponse_File::has_insertion_point() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void CodeGeneratorResponse_File::set_has_insertion_point() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void CodeGeneratorResponse_File::clear_has_insertion_point() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void CodeGeneratorResponse_File::clear_insertion_point() {
+  if (insertion_point_ != &::google::protobuf::internal::kEmptyString) {
+    insertion_point_->clear();
+  }
+  clear_has_insertion_point();
+}
+inline const ::std::string& CodeGeneratorResponse_File::insertion_point() const {
+  return *insertion_point_;
+}
+inline void CodeGeneratorResponse_File::set_insertion_point(const ::std::string& value) {
+  set_has_insertion_point();
+  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
+    insertion_point_ = new ::std::string;
+  }
+  insertion_point_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_insertion_point(const char* value) {
+  set_has_insertion_point();
+  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
+    insertion_point_ = new ::std::string;
+  }
+  insertion_point_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_insertion_point(const char* value, size_t size) {
+  set_has_insertion_point();
+  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
+    insertion_point_ = new ::std::string;
+  }
+  insertion_point_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorResponse_File::mutable_insertion_point() {
+  set_has_insertion_point();
+  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
+    insertion_point_ = new ::std::string;
+  }
+  return insertion_point_;
+}
+inline ::std::string* CodeGeneratorResponse_File::release_insertion_point() {
+  clear_has_insertion_point();
+  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = insertion_point_;
+    insertion_point_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void CodeGeneratorResponse_File::set_allocated_insertion_point(::std::string* insertion_point) {
+  if (insertion_point_ != &::google::protobuf::internal::kEmptyString) {
+    delete insertion_point_;
+  }
+  if (insertion_point) {
+    set_has_insertion_point();
+    insertion_point_ = insertion_point;
+  } else {
+    clear_has_insertion_point();
+    insertion_point_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string content = 15;
+inline bool CodeGeneratorResponse_File::has_content() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void CodeGeneratorResponse_File::set_has_content() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void CodeGeneratorResponse_File::clear_has_content() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void CodeGeneratorResponse_File::clear_content() {
+  if (content_ != &::google::protobuf::internal::kEmptyString) {
+    content_->clear();
+  }
+  clear_has_content();
+}
+inline const ::std::string& CodeGeneratorResponse_File::content() const {
+  return *content_;
+}
+inline void CodeGeneratorResponse_File::set_content(const ::std::string& value) {
+  set_has_content();
+  if (content_ == &::google::protobuf::internal::kEmptyString) {
+    content_ = new ::std::string;
+  }
+  content_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_content(const char* value) {
+  set_has_content();
+  if (content_ == &::google::protobuf::internal::kEmptyString) {
+    content_ = new ::std::string;
+  }
+  content_->assign(value);
+}
+inline void CodeGeneratorResponse_File::set_content(const char* value, size_t size) {
+  set_has_content();
+  if (content_ == &::google::protobuf::internal::kEmptyString) {
+    content_ = new ::std::string;
+  }
+  content_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorResponse_File::mutable_content() {
+  set_has_content();
+  if (content_ == &::google::protobuf::internal::kEmptyString) {
+    content_ = new ::std::string;
+  }
+  return content_;
+}
+inline ::std::string* CodeGeneratorResponse_File::release_content() {
+  clear_has_content();
+  if (content_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = content_;
+    content_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void CodeGeneratorResponse_File::set_allocated_content(::std::string* content) {
+  if (content_ != &::google::protobuf::internal::kEmptyString) {
+    delete content_;
+  }
+  if (content) {
+    set_has_content();
+    content_ = content;
+  } else {
+    clear_has_content();
+    content_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// -------------------------------------------------------------------
+
+// CodeGeneratorResponse
+
+// optional string error = 1;
+inline bool CodeGeneratorResponse::has_error() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void CodeGeneratorResponse::set_has_error() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void CodeGeneratorResponse::clear_has_error() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void CodeGeneratorResponse::clear_error() {
+  if (error_ != &::google::protobuf::internal::kEmptyString) {
+    error_->clear();
+  }
+  clear_has_error();
+}
+inline const ::std::string& CodeGeneratorResponse::error() const {
+  return *error_;
+}
+inline void CodeGeneratorResponse::set_error(const ::std::string& value) {
+  set_has_error();
+  if (error_ == &::google::protobuf::internal::kEmptyString) {
+    error_ = new ::std::string;
+  }
+  error_->assign(value);
+}
+inline void CodeGeneratorResponse::set_error(const char* value) {
+  set_has_error();
+  if (error_ == &::google::protobuf::internal::kEmptyString) {
+    error_ = new ::std::string;
+  }
+  error_->assign(value);
+}
+inline void CodeGeneratorResponse::set_error(const char* value, size_t size) {
+  set_has_error();
+  if (error_ == &::google::protobuf::internal::kEmptyString) {
+    error_ = new ::std::string;
+  }
+  error_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* CodeGeneratorResponse::mutable_error() {
+  set_has_error();
+  if (error_ == &::google::protobuf::internal::kEmptyString) {
+    error_ = new ::std::string;
+  }
+  return error_;
+}
+inline ::std::string* CodeGeneratorResponse::release_error() {
+  clear_has_error();
+  if (error_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = error_;
+    error_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void CodeGeneratorResponse::set_allocated_error(::std::string* error) {
+  if (error_ != &::google::protobuf::internal::kEmptyString) {
+    delete error_;
+  }
+  if (error) {
+    set_has_error();
+    error_ = error;
+  } else {
+    clear_has_error();
+    error_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated .google.protobuf.compiler.CodeGeneratorResponse.File file = 15;
+inline int CodeGeneratorResponse::file_size() const {
+  return file_.size();
+}
+inline void CodeGeneratorResponse::clear_file() {
+  file_.Clear();
+}
+inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& CodeGeneratorResponse::file(int index) const {
+  return file_.Get(index);
+}
+inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::mutable_file(int index) {
+  return file_.Mutable(index);
+}
+inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::add_file() {
+  return file_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >&
+CodeGeneratorResponse::file() const {
+  return file_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >*
+CodeGeneratorResponse::mutable_file() {
+  return &file_;
+}
+
+
+// @@protoc_insertion_point(namespace_scope)
+
+}  // namespace compiler
+}  // namespace protobuf
+}  // namespace google
+
+#ifndef SWIG
+namespace google {
+namespace protobuf {
+
+
+}  // namespace google
+}  // namespace protobuf
+#endif  // SWIG
+
+// @@protoc_insertion_point(global_scope)
+
+#endif  // PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.proto b/ps-lite/deps/include/google/protobuf/compiler/plugin.proto
new file mode 100644
index 00000000..77b888f3
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/plugin.proto
@@ -0,0 +1,147 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//
+// WARNING:  The plugin interface is currently EXPERIMENTAL and is subject to
+//   change.
+//
+// protoc (aka the Protocol Compiler) can be extended via plugins.  A plugin is
+// just a program that reads a CodeGeneratorRequest from stdin and writes a
+// CodeGeneratorResponse to stdout.
+//
+// Plugins written using C++ can use google/protobuf/compiler/plugin.h instead
+// of dealing with the raw protocol defined here.
+//
+// A plugin executable needs only to be placed somewhere in the path.  The
+// plugin should be named "protoc-gen-$NAME", and will then be used when the
+// flag "--${NAME}_out" is passed to protoc.
+
+package google.protobuf.compiler;
+option java_package = "com.google.protobuf.compiler";
+option java_outer_classname = "PluginProtos";
+
+import "google/protobuf/descriptor.proto";
+
+// An encoded CodeGeneratorRequest is written to the plugin's stdin.
+message CodeGeneratorRequest {
+  // The .proto files that were explicitly listed on the command-line.  The
+  // code generator should generate code only for these files.  Each file's
+  // descriptor will be included in proto_file, below.
+  repeated string file_to_generate = 1;
+
+  // The generator parameter passed on the command-line.
+  optional string parameter = 2;
+
+  // FileDescriptorProtos for all files in files_to_generate and everything
+  // they import.  The files will appear in topological order, so each file
+  // appears before any file that imports it.
+  //
+  // protoc guarantees that all proto_files will be written after
+  // the fields above, even though this is not technically guaranteed by the
+  // protobuf wire format.  This theoretically could allow a plugin to stream
+  // in the FileDescriptorProtos and handle them one by one rather than read
+  // the entire set into memory at once.  However, as of this writing, this
+  // is not similarly optimized on protoc's end -- it will store all fields in
+  // memory at once before sending them to the plugin.
+  repeated FileDescriptorProto proto_file = 15;
+}
+
+// The plugin writes an encoded CodeGeneratorResponse to stdout.
+message CodeGeneratorResponse {
+  // Error message.  If non-empty, code generation failed.  The plugin process
+  // should exit with status code zero even if it reports an error in this way.
+  //
+  // This should be used to indicate errors in .proto files which prevent the
+  // code generator from generating correct code.  Errors which indicate a
+  // problem in protoc itself -- such as the input CodeGeneratorRequest being
+  // unparseable -- should be reported by writing a message to stderr and
+  // exiting with a non-zero status code.
+  optional string error = 1;
+
+  // Represents a single generated file.
+  message File {
+    // The file name, relative to the output directory.  The name must not
+    // contain "." or ".." components and must be relative, not be absolute (so,
+    // the file cannot lie outside the output directory).  "/" must be used as
+    // the path separator, not "\".
+    //
+    // If the name is omitted, the content will be appended to the previous
+    // file.  This allows the generator to break large files into small chunks,
+    // and allows the generated text to be streamed back to protoc so that large
+    // files need not reside completely in memory at one time.  Note that as of
+    // this writing protoc does not optimize for this -- it will read the entire
+    // CodeGeneratorResponse before writing files to disk.
+    optional string name = 1;
+
+    // If non-empty, indicates that the named file should already exist, and the
+    // content here is to be inserted into that file at a defined insertion
+    // point.  This feature allows a code generator to extend the output
+    // produced by another code generator.  The original generator may provide
+    // insertion points by placing special annotations in the file that look
+    // like:
+    //   @@protoc_insertion_point(NAME)
+    // The annotation can have arbitrary text before and after it on the line,
+    // which allows it to be placed in a comment.  NAME should be replaced with
+    // an identifier naming the point -- this is what other generators will use
+    // as the insertion_point.  Code inserted at this point will be placed
+    // immediately above the line containing the insertion point (thus multiple
+    // insertions to the same point will come out in the order they were added).
+    // The double-@ is intended to make it unlikely that the generated code
+    // could contain things that look like insertion points by accident.
+    //
+    // For example, the C++ code generator places the following line in the
+    // .pb.h files that it generates:
+    //   // @@protoc_insertion_point(namespace_scope)
+    // This line appears within the scope of the file's package namespace, but
+    // outside of any particular class.  Another plugin can then specify the
+    // insertion_point "namespace_scope" to generate additional classes or
+    // other declarations that should be placed in this scope.
+    //
+    // Note that if the line containing the insertion point begins with
+    // whitespace, the same whitespace will be added to every line of the
+    // inserted text.  This is useful for languages like Python, where
+    // indentation matters.  In these languages, the insertion point comment
+    // should be indented the same amount as any inserted code will need to be
+    // in order to work correctly in that context.
+    //
+    // The code generator that generates the initial file and the one which
+    // inserts into it must both run as part of a single invocation of protoc.
+    // Code generators are executed in the order in which they appear on the
+    // command line.
+    //
+    // If |insertion_point| is present, |name| must also be present.
+    optional string insertion_point = 2;
+
+    // The file contents.
+    optional string content = 15;
+  }
+  repeated File file = 15;
+}
diff --git a/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h b/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
new file mode 100644
index 00000000..a3f22cee
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
@@ -0,0 +1,161 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: robinson@google.com (Will Robinson)
+//
+// Generates Python code for a given .proto file.
+
+#ifndef GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
+#define GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
+
+#include <string>
+
+#include <google/protobuf/compiler/code_generator.h>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+
+class Descriptor;
+class EnumDescriptor;
+class EnumValueDescriptor;
+class FieldDescriptor;
+class ServiceDescriptor;
+
+namespace io { class Printer; }
+
+namespace compiler {
+namespace python {
+
+// CodeGenerator implementation for generated Python protocol buffer classes.
+// If you create your own protocol compiler binary and you want it to support
+// Python output, you can do so by registering an instance of this
+// CodeGenerator with the CommandLineInterface in your main() function.
+class LIBPROTOC_EXPORT Generator : public CodeGenerator {
+ public:
+  Generator();
+  virtual ~Generator();
+
+  // CodeGenerator methods.
+  virtual bool Generate(const FileDescriptor* file,
+                        const string& parameter,
+                        GeneratorContext* generator_context,
+                        string* error) const;
+
+ private:
+  void PrintImports() const;
+  void PrintFileDescriptor() const;
+  void PrintTopLevelEnums() const;
+  void PrintAllNestedEnumsInFile() const;
+  void PrintNestedEnums(const Descriptor& descriptor) const;
+  void PrintEnum(const EnumDescriptor& enum_descriptor) const;
+
+  void PrintTopLevelExtensions() const;
+
+  void PrintFieldDescriptor(
+      const FieldDescriptor& field, bool is_extension) const;
+  void PrintFieldDescriptorsInDescriptor(
+      const Descriptor& message_descriptor,
+      bool is_extension,
+      const string& list_variable_name,
+      int (Descriptor::*CountFn)() const,
+      const FieldDescriptor* (Descriptor::*GetterFn)(int) const) const;
+  void PrintFieldsInDescriptor(const Descriptor& message_descriptor) const;
+  void PrintExtensionsInDescriptor(const Descriptor& message_descriptor) const;
+  void PrintMessageDescriptors() const;
+  void PrintDescriptor(const Descriptor& message_descriptor) const;
+  void PrintNestedDescriptors(const Descriptor& containing_descriptor) const;
+
+  void PrintMessages() const;
+  void PrintMessage(const Descriptor& message_descriptor) const;
+  void PrintNestedMessages(const Descriptor& containing_descriptor) const;
+
+  void FixForeignFieldsInDescriptors() const;
+  void FixForeignFieldsInDescriptor(
+      const Descriptor& descriptor,
+      const Descriptor* containing_descriptor) const;
+  void FixForeignFieldsInField(const Descriptor* containing_type,
+                               const FieldDescriptor& field,
+                               const string& python_dict_name) const;
+  void AddMessageToFileDescriptor(const Descriptor& descriptor) const;
+  string FieldReferencingExpression(const Descriptor* containing_type,
+                                    const FieldDescriptor& field,
+                                    const string& python_dict_name) const;
+  template <typename DescriptorT>
+  void FixContainingTypeInDescriptor(
+      const DescriptorT& descriptor,
+      const Descriptor* containing_descriptor) const;
+
+  void FixForeignFieldsInExtensions() const;
+  void FixForeignFieldsInExtension(
+      const FieldDescriptor& extension_field) const;
+  void FixForeignFieldsInNestedExtensions(const Descriptor& descriptor) const;
+
+  void PrintServices() const;
+  void PrintServiceDescriptor(const ServiceDescriptor& descriptor) const;
+  void PrintServiceClass(const ServiceDescriptor& descriptor) const;
+  void PrintServiceStub(const ServiceDescriptor& descriptor) const;
+
+  void PrintEnumValueDescriptor(const EnumValueDescriptor& descriptor) const;
+  string OptionsValue(const string& class_name,
+                      const string& serialized_options) const;
+  bool GeneratingDescriptorProto() const;
+
+  template <typename DescriptorT>
+  string ModuleLevelDescriptorName(const DescriptorT& descriptor) const;
+  string ModuleLevelMessageName(const Descriptor& descriptor) const;
+  string ModuleLevelServiceDescriptorName(
+      const ServiceDescriptor& descriptor) const;
+
+  template <typename DescriptorT, typename DescriptorProtoT>
+  void PrintSerializedPbInterval(
+      const DescriptorT& descriptor, DescriptorProtoT& proto) const;
+
+  void FixAllDescriptorOptions() const;
+  void FixOptionsForField(const FieldDescriptor& field) const;
+  void FixOptionsForEnum(const EnumDescriptor& descriptor) const;
+  void FixOptionsForMessage(const Descriptor& descriptor) const;
+
+  // Very coarse-grained lock to ensure that Generate() is reentrant.
+  // Guards file_, printer_ and file_descriptor_serialized_.
+  mutable Mutex mutex_;
+  mutable const FileDescriptor* file_;  // Set in Generate().  Under mutex_.
+  mutable string file_descriptor_serialized_;
+  mutable io::Printer* printer_;  // Set in Generate().  Under mutex_.
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Generator);
+};
+
+}  // namespace python
+}  // namespace compiler
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.h b/ps-lite/deps/include/google/protobuf/descriptor.h
new file mode 100644
index 00000000..33e3af72
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/descriptor.h
@@ -0,0 +1,1521 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains classes which describe a type of protocol message.
+// You can use a message's descriptor to learn at runtime what fields
+// it contains and what the types of those fields are.  The Message
+// interface also allows you to dynamically access and modify individual
+// fields by passing the FieldDescriptor of the field you are interested
+// in.
+//
+// Most users will not care about descriptors, because they will write
+// code specific to certain protocol types and will simply use the classes
+// generated by the protocol compiler directly.  Advanced users who want
+// to operate on arbitrary types (not known at compile time) may want to
+// read descriptors in order to learn about the contents of a message.
+// A very small number of users will want to construct their own
+// Descriptors, either because they are implementing Message manually or
+// because they are writing something like the protocol compiler.
+//
+// For an example of how you might use descriptors, see the code example
+// at the top of message.h.
+
+#ifndef GOOGLE_PROTOBUF_DESCRIPTOR_H__
+#define GOOGLE_PROTOBUF_DESCRIPTOR_H__
+
+#include <string>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+
+// TYPE_BOOL is defined in the MacOS's ConditionalMacros.h.
+#ifdef TYPE_BOOL
+#undef TYPE_BOOL
+#endif  // TYPE_BOOL
+
+namespace google {
+namespace protobuf {
+
+// Defined in this file.
+class Descriptor;
+class FieldDescriptor;
+class EnumDescriptor;
+class EnumValueDescriptor;
+class ServiceDescriptor;
+class MethodDescriptor;
+class FileDescriptor;
+class DescriptorDatabase;
+class DescriptorPool;
+
+// Defined in descriptor.proto
+class DescriptorProto;
+class FieldDescriptorProto;
+class EnumDescriptorProto;
+class EnumValueDescriptorProto;
+class ServiceDescriptorProto;
+class MethodDescriptorProto;
+class FileDescriptorProto;
+class MessageOptions;
+class FieldOptions;
+class EnumOptions;
+class EnumValueOptions;
+class ServiceOptions;
+class MethodOptions;
+class FileOptions;
+class UninterpretedOption;
+class SourceCodeInfo;
+
+// Defined in message.h
+class Message;
+
+// Defined in descriptor.cc
+class DescriptorBuilder;
+class FileDescriptorTables;
+
+// Defined in unknown_field_set.h.
+class UnknownField;
+
+// NB, all indices are zero-based.
+struct SourceLocation {
+  int start_line;
+  int end_line;
+  int start_column;
+  int end_column;
+
+  // Doc comments found at the source location.
+  // TODO(kenton):  Maybe this struct should have been named SourceInfo or
+  //   something instead.  Oh well.
+  string leading_comments;
+  string trailing_comments;
+};
+
+// Describes a type of protocol message, or a particular group within a
+// message.  To obtain the Descriptor for a given message object, call
+// Message::GetDescriptor().  Generated message classes also have a
+// static method called descriptor() which returns the type's descriptor.
+// Use DescriptorPool to construct your own descriptors.
+class LIBPROTOBUF_EXPORT Descriptor {
+ public:
+  // The name of the message type, not including its scope.
+  const string& name() const;
+
+  // The fully-qualified name of the message type, scope delimited by
+  // periods.  For example, message type "Foo" which is declared in package
+  // "bar" has full name "bar.Foo".  If a type "Baz" is nested within
+  // Foo, Baz's full_name is "bar.Foo.Baz".  To get only the part that
+  // comes after the last '.', use name().
+  const string& full_name() const;
+
+  // Index of this descriptor within the file or containing type's message
+  // type array.
+  int index() const;
+
+  // The .proto file in which this message type was defined.  Never NULL.
+  const FileDescriptor* file() const;
+
+  // If this Descriptor describes a nested type, this returns the type
+  // in which it is nested.  Otherwise, returns NULL.
+  const Descriptor* containing_type() const;
+
+  // Get options for this message type.  These are specified in the .proto file
+  // by placing lines like "option foo = 1234;" in the message definition.
+  // Allowed options are defined by MessageOptions in
+  // google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const MessageOptions& options() const;
+
+  // Write the contents of this Descriptor into the given DescriptorProto.
+  // The target DescriptorProto must be clear before calling this; if it
+  // isn't, the result may be garbage.
+  void CopyTo(DescriptorProto* proto) const;
+
+  // Write the contents of this decriptor in a human-readable form. Output
+  // will be suitable for re-parsing.
+  string DebugString() const;
+
+  // Field stuff -----------------------------------------------------
+
+  // The number of fields in this message type.
+  int field_count() const;
+  // Gets a field by index, where 0 <= index < field_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FieldDescriptor* field(int index) const;
+
+  // Looks up a field by declared tag number.  Returns NULL if no such field
+  // exists.
+  const FieldDescriptor* FindFieldByNumber(int number) const;
+  // Looks up a field by name.  Returns NULL if no such field exists.
+  const FieldDescriptor* FindFieldByName(const string& name) const;
+
+  // Looks up a field by lowercased name (as returned by lowercase_name()).
+  // This lookup may be ambiguous if multiple field names differ only by case,
+  // in which case the field returned is chosen arbitrarily from the matches.
+  const FieldDescriptor* FindFieldByLowercaseName(
+      const string& lowercase_name) const;
+
+  // Looks up a field by camel-case name (as returned by camelcase_name()).
+  // This lookup may be ambiguous if multiple field names differ in a way that
+  // leads them to have identical camel-case names, in which case the field
+  // returned is chosen arbitrarily from the matches.
+  const FieldDescriptor* FindFieldByCamelcaseName(
+      const string& camelcase_name) const;
+
+  // Nested type stuff -----------------------------------------------
+
+  // The number of nested types in this message type.
+  int nested_type_count() const;
+  // Gets a nested type by index, where 0 <= index < nested_type_count().
+  // These are returned in the order they were defined in the .proto file.
+  const Descriptor* nested_type(int index) const;
+
+  // Looks up a nested type by name.  Returns NULL if no such nested type
+  // exists.
+  const Descriptor* FindNestedTypeByName(const string& name) const;
+
+  // Enum stuff ------------------------------------------------------
+
+  // The number of enum types in this message type.
+  int enum_type_count() const;
+  // Gets an enum type by index, where 0 <= index < enum_type_count().
+  // These are returned in the order they were defined in the .proto file.
+  const EnumDescriptor* enum_type(int index) const;
+
+  // Looks up an enum type by name.  Returns NULL if no such enum type exists.
+  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
+
+  // Looks up an enum value by name, among all enum types in this message.
+  // Returns NULL if no such value exists.
+  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
+
+  // Extensions ------------------------------------------------------
+
+  // A range of field numbers which are designated for third-party
+  // extensions.
+  struct ExtensionRange {
+    int start;  // inclusive
+    int end;    // exclusive
+  };
+
+  // The number of extension ranges in this message type.
+  int extension_range_count() const;
+  // Gets an extension range by index, where 0 <= index <
+  // extension_range_count(). These are returned in the order they were defined
+  // in the .proto file.
+  const ExtensionRange* extension_range(int index) const;
+
+  // Returns true if the number is in one of the extension ranges.
+  bool IsExtensionNumber(int number) const;
+
+  // The number of extensions -- extending *other* messages -- that were
+  // defined nested within this message type's scope.
+  int extension_count() const;
+  // Get an extension by index, where 0 <= index < extension_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FieldDescriptor* extension(int index) const;
+
+  // Looks up a named extension (which extends some *other* message type)
+  // defined within this message type's scope.
+  const FieldDescriptor* FindExtensionByName(const string& name) const;
+
+  // Similar to FindFieldByLowercaseName(), but finds extensions defined within
+  // this message type's scope.
+  const FieldDescriptor* FindExtensionByLowercaseName(const string& name) const;
+
+  // Similar to FindFieldByCamelcaseName(), but finds extensions defined within
+  // this message type's scope.
+  const FieldDescriptor* FindExtensionByCamelcaseName(const string& name) const;
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this message declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef MessageOptions OptionsType;
+
+  // Internal version of DebugString; controls the level of indenting for
+  // correct depth
+  void DebugString(int depth, string *contents) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  const FileDescriptor* file_;
+  const Descriptor* containing_type_;
+  const MessageOptions* options_;
+
+  // True if this is a placeholder for an unknown type.
+  bool is_placeholder_;
+  // True if this is a placeholder and the type name wasn't fully-qualified.
+  bool is_unqualified_placeholder_;
+
+  int field_count_;
+  FieldDescriptor* fields_;
+  int nested_type_count_;
+  Descriptor* nested_types_;
+  int enum_type_count_;
+  EnumDescriptor* enum_types_;
+  int extension_range_count_;
+  ExtensionRange* extension_ranges_;
+  int extension_count_;
+  FieldDescriptor* extensions_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<Descriptor>() and AllocateArray<Descriptor>() in descriptor.cc
+  // and update them to initialize the field.
+
+  // Must be constructed using DescriptorPool.
+  Descriptor() {}
+  friend class DescriptorBuilder;
+  friend class EnumDescriptor;
+  friend class FieldDescriptor;
+  friend class MethodDescriptor;
+  friend class FileDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Descriptor);
+};
+
+// Describes a single field of a message.  To get the descriptor for a given
+// field, first get the Descriptor for the message in which it is defined,
+// then call Descriptor::FindFieldByName().  To get a FieldDescriptor for
+// an extension, do one of the following:
+// - Get the Descriptor or FileDescriptor for its containing scope, then
+//   call Descriptor::FindExtensionByName() or
+//   FileDescriptor::FindExtensionByName().
+// - Given a DescriptorPool, call DescriptorPool::FindExtensionByNumber().
+// - Given a Reflection for a message object, call
+//   Reflection::FindKnownExtensionByName() or
+//   Reflection::FindKnownExtensionByNumber().
+// Use DescriptorPool to construct your own descriptors.
+class LIBPROTOBUF_EXPORT FieldDescriptor {
+ public:
+  // Identifies a field type.  0 is reserved for errors.  The order is weird
+  // for historical reasons.  Types 12 and up are new in proto2.
+  enum Type {
+    TYPE_DOUBLE         = 1,   // double, exactly eight bytes on the wire.
+    TYPE_FLOAT          = 2,   // float, exactly four bytes on the wire.
+    TYPE_INT64          = 3,   // int64, varint on the wire.  Negative numbers
+                               // take 10 bytes.  Use TYPE_SINT64 if negative
+                               // values are likely.
+    TYPE_UINT64         = 4,   // uint64, varint on the wire.
+    TYPE_INT32          = 5,   // int32, varint on the wire.  Negative numbers
+                               // take 10 bytes.  Use TYPE_SINT32 if negative
+                               // values are likely.
+    TYPE_FIXED64        = 6,   // uint64, exactly eight bytes on the wire.
+    TYPE_FIXED32        = 7,   // uint32, exactly four bytes on the wire.
+    TYPE_BOOL           = 8,   // bool, varint on the wire.
+    TYPE_STRING         = 9,   // UTF-8 text.
+    TYPE_GROUP          = 10,  // Tag-delimited message.  Deprecated.
+    TYPE_MESSAGE        = 11,  // Length-delimited message.
+
+    TYPE_BYTES          = 12,  // Arbitrary byte array.
+    TYPE_UINT32         = 13,  // uint32, varint on the wire
+    TYPE_ENUM           = 14,  // Enum, varint on the wire
+    TYPE_SFIXED32       = 15,  // int32, exactly four bytes on the wire
+    TYPE_SFIXED64       = 16,  // int64, exactly eight bytes on the wire
+    TYPE_SINT32         = 17,  // int32, ZigZag-encoded varint on the wire
+    TYPE_SINT64         = 18,  // int64, ZigZag-encoded varint on the wire
+
+    MAX_TYPE            = 18,  // Constant useful for defining lookup tables
+                               // indexed by Type.
+  };
+
+  // Specifies the C++ data type used to represent the field.  There is a
+  // fixed mapping from Type to CppType where each Type maps to exactly one
+  // CppType.  0 is reserved for errors.
+  enum CppType {
+    CPPTYPE_INT32       = 1,     // TYPE_INT32, TYPE_SINT32, TYPE_SFIXED32
+    CPPTYPE_INT64       = 2,     // TYPE_INT64, TYPE_SINT64, TYPE_SFIXED64
+    CPPTYPE_UINT32      = 3,     // TYPE_UINT32, TYPE_FIXED32
+    CPPTYPE_UINT64      = 4,     // TYPE_UINT64, TYPE_FIXED64
+    CPPTYPE_DOUBLE      = 5,     // TYPE_DOUBLE
+    CPPTYPE_FLOAT       = 6,     // TYPE_FLOAT
+    CPPTYPE_BOOL        = 7,     // TYPE_BOOL
+    CPPTYPE_ENUM        = 8,     // TYPE_ENUM
+    CPPTYPE_STRING      = 9,     // TYPE_STRING, TYPE_BYTES
+    CPPTYPE_MESSAGE     = 10,    // TYPE_MESSAGE, TYPE_GROUP
+
+    MAX_CPPTYPE         = 10,    // Constant useful for defining lookup tables
+                                 // indexed by CppType.
+  };
+
+  // Identifies whether the field is optional, required, or repeated.  0 is
+  // reserved for errors.
+  enum Label {
+    LABEL_OPTIONAL      = 1,    // optional
+    LABEL_REQUIRED      = 2,    // required
+    LABEL_REPEATED      = 3,    // repeated
+
+    MAX_LABEL           = 3,    // Constant useful for defining lookup tables
+                                // indexed by Label.
+  };
+
+  // Valid field numbers are positive integers up to kMaxNumber.
+  static const int kMaxNumber = (1 << 29) - 1;
+
+  // First field number reserved for the protocol buffer library implementation.
+  // Users may not declare fields that use reserved numbers.
+  static const int kFirstReservedNumber = 19000;
+  // Last field number reserved for the protocol buffer library implementation.
+  // Users may not declare fields that use reserved numbers.
+  static const int kLastReservedNumber  = 19999;
+
+  const string& name() const;        // Name of this field within the message.
+  const string& full_name() const;   // Fully-qualified name of the field.
+  const FileDescriptor* file() const;// File in which this field was defined.
+  bool is_extension() const;         // Is this an extension field?
+  int number() const;                // Declared tag number.
+
+  // Same as name() except converted to lower-case.  This (and especially the
+  // FindFieldByLowercaseName() method) can be useful when parsing formats
+  // which prefer to use lowercase naming style.  (Although, technically
+  // field names should be lowercased anyway according to the protobuf style
+  // guide, so this only makes a difference when dealing with old .proto files
+  // which do not follow the guide.)
+  const string& lowercase_name() const;
+
+  // Same as name() except converted to camel-case.  In this conversion, any
+  // time an underscore appears in the name, it is removed and the next
+  // letter is capitalized.  Furthermore, the first letter of the name is
+  // lower-cased.  Examples:
+  //   FooBar -> fooBar
+  //   foo_bar -> fooBar
+  //   fooBar -> fooBar
+  // This (and especially the FindFieldByCamelcaseName() method) can be useful
+  // when parsing formats which prefer to use camel-case naming style.
+  const string& camelcase_name() const;
+
+  Type type() const;                  // Declared type of this field.
+  const char* type_name() const;      // Name of the declared type.
+  CppType cpp_type() const;           // C++ type of this field.
+  const char* cpp_type_name() const;  // Name of the C++ type.
+  Label label() const;                // optional/required/repeated
+
+  bool is_required() const;      // shorthand for label() == LABEL_REQUIRED
+  bool is_optional() const;      // shorthand for label() == LABEL_OPTIONAL
+  bool is_repeated() const;      // shorthand for label() == LABEL_REPEATED
+  bool is_packable() const;      // shorthand for is_repeated() &&
+                                 //               IsTypePackable(type())
+  bool is_packed() const;        // shorthand for is_packable() &&
+                                 //               options().packed()
+
+  // Index of this field within the message's field array, or the file or
+  // extension scope's extensions array.
+  int index() const;
+
+  // Does this field have an explicitly-declared default value?
+  bool has_default_value() const;
+
+  // Get the field default value if cpp_type() == CPPTYPE_INT32.  If no
+  // explicit default was defined, the default is 0.
+  int32 default_value_int32() const;
+  // Get the field default value if cpp_type() == CPPTYPE_INT64.  If no
+  // explicit default was defined, the default is 0.
+  int64 default_value_int64() const;
+  // Get the field default value if cpp_type() == CPPTYPE_UINT32.  If no
+  // explicit default was defined, the default is 0.
+  uint32 default_value_uint32() const;
+  // Get the field default value if cpp_type() == CPPTYPE_UINT64.  If no
+  // explicit default was defined, the default is 0.
+  uint64 default_value_uint64() const;
+  // Get the field default value if cpp_type() == CPPTYPE_FLOAT.  If no
+  // explicit default was defined, the default is 0.0.
+  float default_value_float() const;
+  // Get the field default value if cpp_type() == CPPTYPE_DOUBLE.  If no
+  // explicit default was defined, the default is 0.0.
+  double default_value_double() const;
+  // Get the field default value if cpp_type() == CPPTYPE_BOOL.  If no
+  // explicit default was defined, the default is false.
+  bool default_value_bool() const;
+  // Get the field default value if cpp_type() == CPPTYPE_ENUM.  If no
+  // explicit default was defined, the default is the first value defined
+  // in the enum type (all enum types are required to have at least one value).
+  // This never returns NULL.
+  const EnumValueDescriptor* default_value_enum() const;
+  // Get the field default value if cpp_type() == CPPTYPE_STRING.  If no
+  // explicit default was defined, the default is the empty string.
+  const string& default_value_string() const;
+
+  // The Descriptor for the message of which this is a field.  For extensions,
+  // this is the extended type.  Never NULL.
+  const Descriptor* containing_type() const;
+
+  // An extension may be declared within the scope of another message.  If this
+  // field is an extension (is_extension() is true), then extension_scope()
+  // returns that message, or NULL if the extension was declared at global
+  // scope.  If this is not an extension, extension_scope() is undefined (may
+  // assert-fail).
+  const Descriptor* extension_scope() const;
+
+  // If type is TYPE_MESSAGE or TYPE_GROUP, returns a descriptor for the
+  // message or the group type.  Otherwise, undefined.
+  const Descriptor* message_type() const;
+  // If type is TYPE_ENUM, returns a descriptor for the enum.  Otherwise,
+  // undefined.
+  const EnumDescriptor* enum_type() const;
+
+  // EXPERIMENTAL; DO NOT USE.
+  // If this field is a map field, experimental_map_key() is the field
+  // that is the key for this map.
+  // experimental_map_key()->containing_type() is the same as message_type().
+  const FieldDescriptor* experimental_map_key() const;
+
+  // Get the FieldOptions for this field.  This includes things listed in
+  // square brackets after the field definition.  E.g., the field:
+  //   optional string text = 1 [ctype=CORD];
+  // has the "ctype" option set.  Allowed options are defined by FieldOptions
+  // in google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const FieldOptions& options() const;
+
+  // See Descriptor::CopyTo().
+  void CopyTo(FieldDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+  // Helper method to get the CppType for a particular Type.
+  static CppType TypeToCppType(Type type);
+
+  // Return true iff [packed = true] is valid for fields of this type.
+  static inline bool IsTypePackable(Type field_type);
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this field declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef FieldOptions OptionsType;
+
+  // See Descriptor::DebugString().
+  void DebugString(int depth, string *contents) const;
+
+  // formats the default value appropriately and returns it as a string.
+  // Must have a default value to call this. If quote_string_type is true, then
+  // types of CPPTYPE_STRING whill be surrounded by quotes and CEscaped.
+  string DefaultValueAsString(bool quote_string_type) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  const string* lowercase_name_;
+  const string* camelcase_name_;
+  const FileDescriptor* file_;
+  int number_;
+  Type type_;
+  Label label_;
+  bool is_extension_;
+  const Descriptor* containing_type_;
+  const Descriptor* extension_scope_;
+  const Descriptor* message_type_;
+  const EnumDescriptor* enum_type_;
+  const FieldDescriptor* experimental_map_key_;
+  const FieldOptions* options_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<FieldDescriptor>() and AllocateArray<FieldDescriptor>() in
+  // descriptor.cc and update them to initialize the field.
+
+  bool has_default_value_;
+  union {
+    int32  default_value_int32_;
+    int64  default_value_int64_;
+    uint32 default_value_uint32_;
+    uint64 default_value_uint64_;
+    float  default_value_float_;
+    double default_value_double_;
+    bool   default_value_bool_;
+
+    const EnumValueDescriptor* default_value_enum_;
+    const string* default_value_string_;
+  };
+
+  static const CppType kTypeToCppTypeMap[MAX_TYPE + 1];
+
+  static const char * const kTypeToName[MAX_TYPE + 1];
+
+  static const char * const kCppTypeToName[MAX_CPPTYPE + 1];
+
+  static const char * const kLabelToName[MAX_LABEL + 1];
+
+  // Must be constructed using DescriptorPool.
+  FieldDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class FileDescriptor;
+  friend class Descriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FieldDescriptor);
+};
+
+// Describes an enum type defined in a .proto file.  To get the EnumDescriptor
+// for a generated enum type, call TypeName_descriptor().  Use DescriptorPool
+// to construct your own descriptors.
+class LIBPROTOBUF_EXPORT EnumDescriptor {
+ public:
+  // The name of this enum type in the containing scope.
+  const string& name() const;
+
+  // The fully-qualified name of the enum type, scope delimited by periods.
+  const string& full_name() const;
+
+  // Index of this enum within the file or containing message's enum array.
+  int index() const;
+
+  // The .proto file in which this enum type was defined.  Never NULL.
+  const FileDescriptor* file() const;
+
+  // The number of values for this EnumDescriptor.  Guaranteed to be greater
+  // than zero.
+  int value_count() const;
+  // Gets a value by index, where 0 <= index < value_count().
+  // These are returned in the order they were defined in the .proto file.
+  const EnumValueDescriptor* value(int index) const;
+
+  // Looks up a value by name.  Returns NULL if no such value exists.
+  const EnumValueDescriptor* FindValueByName(const string& name) const;
+  // Looks up a value by number.  Returns NULL if no such value exists.  If
+  // multiple values have this number, the first one defined is returned.
+  const EnumValueDescriptor* FindValueByNumber(int number) const;
+
+  // If this enum type is nested in a message type, this is that message type.
+  // Otherwise, NULL.
+  const Descriptor* containing_type() const;
+
+  // Get options for this enum type.  These are specified in the .proto file by
+  // placing lines like "option foo = 1234;" in the enum definition.  Allowed
+  // options are defined by EnumOptions in google/protobuf/descriptor.proto,
+  // and any available extensions of that message.
+  const EnumOptions& options() const;
+
+  // See Descriptor::CopyTo().
+  void CopyTo(EnumDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this enum declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef EnumOptions OptionsType;
+
+  // See Descriptor::DebugString().
+  void DebugString(int depth, string *contents) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  const FileDescriptor* file_;
+  const Descriptor* containing_type_;
+  const EnumOptions* options_;
+
+  // True if this is a placeholder for an unknown type.
+  bool is_placeholder_;
+  // True if this is a placeholder and the type name wasn't fully-qualified.
+  bool is_unqualified_placeholder_;
+
+  int value_count_;
+  EnumValueDescriptor* values_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<EnumDescriptor>() and AllocateArray<EnumDescriptor>() in
+  // descriptor.cc and update them to initialize the field.
+
+  // Must be constructed using DescriptorPool.
+  EnumDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class Descriptor;
+  friend class FieldDescriptor;
+  friend class EnumValueDescriptor;
+  friend class FileDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EnumDescriptor);
+};
+
+// Describes an individual enum constant of a particular type.  To get the
+// EnumValueDescriptor for a given enum value, first get the EnumDescriptor
+// for its type, then use EnumDescriptor::FindValueByName() or
+// EnumDescriptor::FindValueByNumber().  Use DescriptorPool to construct
+// your own descriptors.
+class LIBPROTOBUF_EXPORT EnumValueDescriptor {
+ public:
+  const string& name() const;  // Name of this enum constant.
+  int index() const;           // Index within the enums's Descriptor.
+  int number() const;          // Numeric value of this enum constant.
+
+  // The full_name of an enum value is a sibling symbol of the enum type.
+  // e.g. the full name of FieldDescriptorProto::TYPE_INT32 is actually
+  // "google.protobuf.FieldDescriptorProto.TYPE_INT32", NOT
+  // "google.protobuf.FieldDescriptorProto.Type.TYPE_INT32".  This is to conform
+  // with C++ scoping rules for enums.
+  const string& full_name() const;
+
+  // The type of this value.  Never NULL.
+  const EnumDescriptor* type() const;
+
+  // Get options for this enum value.  These are specified in the .proto file
+  // by adding text like "[foo = 1234]" after an enum value definition.
+  // Allowed options are defined by EnumValueOptions in
+  // google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const EnumValueOptions& options() const;
+
+  // See Descriptor::CopyTo().
+  void CopyTo(EnumValueDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this enum value declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef EnumValueOptions OptionsType;
+
+  // See Descriptor::DebugString().
+  void DebugString(int depth, string *contents) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  int number_;
+  const EnumDescriptor* type_;
+  const EnumValueOptions* options_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<EnumValueDescriptor>() and AllocateArray<EnumValueDescriptor>()
+  // in descriptor.cc and update them to initialize the field.
+
+  // Must be constructed using DescriptorPool.
+  EnumValueDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class EnumDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EnumValueDescriptor);
+};
+
+// Describes an RPC service.  To get the ServiceDescriptor for a service,
+// call Service::GetDescriptor().  Generated service classes also have a
+// static method called descriptor() which returns the type's
+// ServiceDescriptor.  Use DescriptorPool to construct your own descriptors.
+class LIBPROTOBUF_EXPORT ServiceDescriptor {
+ public:
+  // The name of the service, not including its containing scope.
+  const string& name() const;
+  // The fully-qualified name of the service, scope delimited by periods.
+  const string& full_name() const;
+  // Index of this service within the file's services array.
+  int index() const;
+
+  // The .proto file in which this service was defined.  Never NULL.
+  const FileDescriptor* file() const;
+
+  // Get options for this service type.  These are specified in the .proto file
+  // by placing lines like "option foo = 1234;" in the service definition.
+  // Allowed options are defined by ServiceOptions in
+  // google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const ServiceOptions& options() const;
+
+  // The number of methods this service defines.
+  int method_count() const;
+  // Gets a MethodDescriptor by index, where 0 <= index < method_count().
+  // These are returned in the order they were defined in the .proto file.
+  const MethodDescriptor* method(int index) const;
+
+  // Look up a MethodDescriptor by name.
+  const MethodDescriptor* FindMethodByName(const string& name) const;
+  // See Descriptor::CopyTo().
+  void CopyTo(ServiceDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this service declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef ServiceOptions OptionsType;
+
+  // See Descriptor::DebugString().
+  void DebugString(string *contents) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  const FileDescriptor* file_;
+  const ServiceOptions* options_;
+  int method_count_;
+  MethodDescriptor* methods_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<ServiceDescriptor>() and AllocateArray<ServiceDescriptor>() in
+  // descriptor.cc and update them to initialize the field.
+
+  // Must be constructed using DescriptorPool.
+  ServiceDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class FileDescriptor;
+  friend class MethodDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ServiceDescriptor);
+};
+
+// Describes an individual service method.  To obtain a MethodDescriptor given
+// a service, first get its ServiceDescriptor, then call
+// ServiceDescriptor::FindMethodByName().  Use DescriptorPool to construct your
+// own descriptors.
+class LIBPROTOBUF_EXPORT MethodDescriptor {
+ public:
+  // Name of this method, not including containing scope.
+  const string& name() const;
+  // The fully-qualified name of the method, scope delimited by periods.
+  const string& full_name() const;
+  // Index within the service's Descriptor.
+  int index() const;
+
+  // Gets the service to which this method belongs.  Never NULL.
+  const ServiceDescriptor* service() const;
+
+  // Gets the type of protocol message which this method accepts as input.
+  const Descriptor* input_type() const;
+  // Gets the type of protocol message which this message produces as output.
+  const Descriptor* output_type() const;
+
+  // Get options for this method.  These are specified in the .proto file by
+  // placing lines like "option foo = 1234;" in curly-braces after a method
+  // declaration.  Allowed options are defined by MethodOptions in
+  // google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const MethodOptions& options() const;
+
+  // See Descriptor::CopyTo().
+  void CopyTo(MethodDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of this method declaration.  Returns false and leaves
+  // |*out_location| unchanged iff location information was not available.
+  bool GetSourceLocation(SourceLocation* out_location) const;
+
+ private:
+  typedef MethodOptions OptionsType;
+
+  // See Descriptor::DebugString().
+  void DebugString(int depth, string *contents) const;
+
+  // Walks up the descriptor tree to generate the source location path
+  // to this descriptor from the file root.
+  void GetLocationPath(vector<int>* output) const;
+
+  const string* name_;
+  const string* full_name_;
+  const ServiceDescriptor* service_;
+  const Descriptor* input_type_;
+  const Descriptor* output_type_;
+  const MethodOptions* options_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<MethodDescriptor>() and AllocateArray<MethodDescriptor>() in
+  // descriptor.cc and update them to initialize the field.
+
+  // Must be constructed using DescriptorPool.
+  MethodDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class ServiceDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MethodDescriptor);
+};
+
+
+// Describes a whole .proto file.  To get the FileDescriptor for a compiled-in
+// file, get the descriptor for something defined in that file and call
+// descriptor->file().  Use DescriptorPool to construct your own descriptors.
+class LIBPROTOBUF_EXPORT FileDescriptor {
+ public:
+  // The filename, relative to the source tree.
+  // e.g. "google/protobuf/descriptor.proto"
+  const string& name() const;
+
+  // The package, e.g. "google.protobuf.compiler".
+  const string& package() const;
+
+  // The DescriptorPool in which this FileDescriptor and all its contents were
+  // allocated.  Never NULL.
+  const DescriptorPool* pool() const;
+
+  // The number of files imported by this one.
+  int dependency_count() const;
+  // Gets an imported file by index, where 0 <= index < dependency_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FileDescriptor* dependency(int index) const;
+
+  // The number of files public imported by this one.
+  // The public dependency list is a subset of the dependency list.
+  int public_dependency_count() const;
+  // Gets a public imported file by index, where 0 <= index <
+  // public_dependency_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FileDescriptor* public_dependency(int index) const;
+
+  // The number of files that are imported for weak fields.
+  // The weak dependency list is a subset of the dependency list.
+  int weak_dependency_count() const;
+  // Gets a weak imported file by index, where 0 <= index <
+  // weak_dependency_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FileDescriptor* weak_dependency(int index) const;
+
+  // Number of top-level message types defined in this file.  (This does not
+  // include nested types.)
+  int message_type_count() const;
+  // Gets a top-level message type, where 0 <= index < message_type_count().
+  // These are returned in the order they were defined in the .proto file.
+  const Descriptor* message_type(int index) const;
+
+  // Number of top-level enum types defined in this file.  (This does not
+  // include nested types.)
+  int enum_type_count() const;
+  // Gets a top-level enum type, where 0 <= index < enum_type_count().
+  // These are returned in the order they were defined in the .proto file.
+  const EnumDescriptor* enum_type(int index) const;
+
+  // Number of services defined in this file.
+  int service_count() const;
+  // Gets a service, where 0 <= index < service_count().
+  // These are returned in the order they were defined in the .proto file.
+  const ServiceDescriptor* service(int index) const;
+
+  // Number of extensions defined at file scope.  (This does not include
+  // extensions nested within message types.)
+  int extension_count() const;
+  // Gets an extension's descriptor, where 0 <= index < extension_count().
+  // These are returned in the order they were defined in the .proto file.
+  const FieldDescriptor* extension(int index) const;
+
+  // Get options for this file.  These are specified in the .proto file by
+  // placing lines like "option foo = 1234;" at the top level, outside of any
+  // other definitions.  Allowed options are defined by FileOptions in
+  // google/protobuf/descriptor.proto, and any available extensions of that
+  // message.
+  const FileOptions& options() const;
+
+  // Find a top-level message type by name.  Returns NULL if not found.
+  const Descriptor* FindMessageTypeByName(const string& name) const;
+  // Find a top-level enum type by name.  Returns NULL if not found.
+  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
+  // Find an enum value defined in any top-level enum by name.  Returns NULL if
+  // not found.
+  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
+  // Find a service definition by name.  Returns NULL if not found.
+  const ServiceDescriptor* FindServiceByName(const string& name) const;
+  // Find a top-level extension definition by name.  Returns NULL if not found.
+  const FieldDescriptor* FindExtensionByName(const string& name) const;
+  // Similar to FindExtensionByName(), but searches by lowercased-name.  See
+  // Descriptor::FindFieldByLowercaseName().
+  const FieldDescriptor* FindExtensionByLowercaseName(const string& name) const;
+  // Similar to FindExtensionByName(), but searches by camelcased-name.  See
+  // Descriptor::FindFieldByCamelcaseName().
+  const FieldDescriptor* FindExtensionByCamelcaseName(const string& name) const;
+
+  // See Descriptor::CopyTo().
+  // Notes:
+  // - This method does NOT copy source code information since it is relatively
+  //   large and rarely needed.  See CopySourceCodeInfoTo() below.
+  void CopyTo(FileDescriptorProto* proto) const;
+  // Write the source code information of this FileDescriptor into the given
+  // FileDescriptorProto.  See CopyTo() above.
+  void CopySourceCodeInfoTo(FileDescriptorProto* proto) const;
+
+  // See Descriptor::DebugString().
+  string DebugString() const;
+
+ private:
+  // Source Location ---------------------------------------------------
+
+  // Updates |*out_location| to the source location of the complete
+  // extent of the declaration or declaration-part denoted by |path|.
+  // Returns false and leaves |*out_location| unchanged iff location
+  // information was not available.  (See SourceCodeInfo for
+  // description of path encoding.)
+  bool GetSourceLocation(const vector<int>& path,
+                         SourceLocation* out_location) const;
+
+  typedef FileOptions OptionsType;
+
+  const string* name_;
+  const string* package_;
+  const DescriptorPool* pool_;
+  int dependency_count_;
+  const FileDescriptor** dependencies_;
+  int public_dependency_count_;
+  int* public_dependencies_;
+  int weak_dependency_count_;
+  int* weak_dependencies_;
+  int message_type_count_;
+  Descriptor* message_types_;
+  int enum_type_count_;
+  EnumDescriptor* enum_types_;
+  int service_count_;
+  ServiceDescriptor* services_;
+  int extension_count_;
+  FieldDescriptor* extensions_;
+  const FileOptions* options_;
+
+  const FileDescriptorTables* tables_;
+  const SourceCodeInfo* source_code_info_;
+  // IMPORTANT:  If you add a new field, make sure to search for all instances
+  // of Allocate<FileDescriptor>() and AllocateArray<FileDescriptor>() in
+  // descriptor.cc and update them to initialize the field.
+
+  FileDescriptor() {}
+  friend class DescriptorBuilder;
+  friend class Descriptor;
+  friend class FieldDescriptor;
+  friend class EnumDescriptor;
+  friend class EnumValueDescriptor;
+  friend class MethodDescriptor;
+  friend class ServiceDescriptor;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileDescriptor);
+};
+
+// ===================================================================
+
+// Used to construct descriptors.
+//
+// Normally you won't want to build your own descriptors.  Message classes
+// constructed by the protocol compiler will provide them for you.  However,
+// if you are implementing Message on your own, or if you are writing a
+// program which can operate on totally arbitrary types and needs to load
+// them from some sort of database, you might need to.
+//
+// Since Descriptors are composed of a whole lot of cross-linked bits of
+// data that would be a pain to put together manually, the
+// DescriptorPool class is provided to make the process easier.  It can
+// take a FileDescriptorProto (defined in descriptor.proto), validate it,
+// and convert it to a set of nicely cross-linked Descriptors.
+//
+// DescriptorPool also helps with memory management.  Descriptors are
+// composed of many objects containing static data and pointers to each
+// other.  In all likelihood, when it comes time to delete this data,
+// you'll want to delete it all at once.  In fact, it is not uncommon to
+// have a whole pool of descriptors all cross-linked with each other which
+// you wish to delete all at once.  This class represents such a pool, and
+// handles the memory management for you.
+//
+// You can also search for descriptors within a DescriptorPool by name, and
+// extensions by number.
+class LIBPROTOBUF_EXPORT DescriptorPool {
+ public:
+  // Create a normal, empty DescriptorPool.
+  DescriptorPool();
+
+  // Constructs a DescriptorPool that, when it can't find something among the
+  // descriptors already in the pool, looks for it in the given
+  // DescriptorDatabase.
+  // Notes:
+  // - If a DescriptorPool is constructed this way, its BuildFile*() methods
+  //   must not be called (they will assert-fail).  The only way to populate
+  //   the pool with descriptors is to call the Find*By*() methods.
+  // - The Find*By*() methods may block the calling thread if the
+  //   DescriptorDatabase blocks.  This in turn means that parsing messages
+  //   may block if they need to look up extensions.
+  // - The Find*By*() methods will use mutexes for thread-safety, thus making
+  //   them slower even when they don't have to fall back to the database.
+  //   In fact, even the Find*By*() methods of descriptor objects owned by
+  //   this pool will be slower, since they will have to obtain locks too.
+  // - An ErrorCollector may optionally be given to collect validation errors
+  //   in files loaded from the database.  If not given, errors will be printed
+  //   to GOOGLE_LOG(ERROR).  Remember that files are built on-demand, so this
+  //   ErrorCollector may be called from any thread that calls one of the
+  //   Find*By*() methods.
+  class ErrorCollector;
+  explicit DescriptorPool(DescriptorDatabase* fallback_database,
+                          ErrorCollector* error_collector = NULL);
+
+  ~DescriptorPool();
+
+  // Get a pointer to the generated pool.  Generated protocol message classes
+  // which are compiled into the binary will allocate their descriptors in
+  // this pool.  Do not add your own descriptors to this pool.
+  static const DescriptorPool* generated_pool();
+
+  // Find a FileDescriptor in the pool by file name.  Returns NULL if not
+  // found.
+  const FileDescriptor* FindFileByName(const string& name) const;
+
+  // Find the FileDescriptor in the pool which defines the given symbol.
+  // If any of the Find*ByName() methods below would succeed, then this is
+  // equivalent to calling that method and calling the result's file() method.
+  // Otherwise this returns NULL.
+  const FileDescriptor* FindFileContainingSymbol(
+      const string& symbol_name) const;
+
+  // Looking up descriptors ------------------------------------------
+  // These find descriptors by fully-qualified name.  These will find both
+  // top-level descriptors and nested descriptors.  They return NULL if not
+  // found.
+
+  const Descriptor* FindMessageTypeByName(const string& name) const;
+  const FieldDescriptor* FindFieldByName(const string& name) const;
+  const FieldDescriptor* FindExtensionByName(const string& name) const;
+  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
+  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
+  const ServiceDescriptor* FindServiceByName(const string& name) const;
+  const MethodDescriptor* FindMethodByName(const string& name) const;
+
+  // Finds an extension of the given type by number.  The extendee must be
+  // a member of this DescriptorPool or one of its underlays.
+  const FieldDescriptor* FindExtensionByNumber(const Descriptor* extendee,
+                                               int number) const;
+
+  // Finds extensions of extendee. The extensions will be appended to
+  // out in an undefined order. Only extensions defined directly in
+  // this DescriptorPool or one of its underlays are guaranteed to be
+  // found: extensions defined in the fallback database might not be found
+  // depending on the database implementation.
+  void FindAllExtensions(const Descriptor* extendee,
+                         vector<const FieldDescriptor*>* out) const;
+
+  // Building descriptors --------------------------------------------
+
+  // When converting a FileDescriptorProto to a FileDescriptor, various
+  // errors might be detected in the input.  The caller may handle these
+  // programmatically by implementing an ErrorCollector.
+  class LIBPROTOBUF_EXPORT ErrorCollector {
+   public:
+    inline ErrorCollector() {}
+    virtual ~ErrorCollector();
+
+    // These constants specify what exact part of the construct is broken.
+    // This is useful e.g. for mapping the error back to an exact location
+    // in a .proto file.
+    enum ErrorLocation {
+      NAME,              // the symbol name, or the package name for files
+      NUMBER,            // field or extension range number
+      TYPE,              // field type
+      EXTENDEE,          // field extendee
+      DEFAULT_VALUE,     // field default value
+      INPUT_TYPE,        // method input type
+      OUTPUT_TYPE,       // method output type
+      OPTION_NAME,       // name in assignment
+      OPTION_VALUE,      // value in option assignment
+      OTHER              // some other problem
+    };
+
+    // Reports an error in the FileDescriptorProto.
+    virtual void AddError(
+      const string& filename,      // File name in which the error occurred.
+      const string& element_name,  // Full name of the erroneous element.
+      const Message* descriptor,   // Descriptor of the erroneous element.
+      ErrorLocation location,      // One of the location constants, above.
+      const string& message        // Human-readable error message.
+      ) = 0;
+
+   private:
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ErrorCollector);
+  };
+
+  // Convert the FileDescriptorProto to real descriptors and place them in
+  // this DescriptorPool.  All dependencies of the file must already be in
+  // the pool.  Returns the resulting FileDescriptor, or NULL if there were
+  // problems with the input (e.g. the message was invalid, or dependencies
+  // were missing).  Details about the errors are written to GOOGLE_LOG(ERROR).
+  const FileDescriptor* BuildFile(const FileDescriptorProto& proto);
+
+  // Same as BuildFile() except errors are sent to the given ErrorCollector.
+  const FileDescriptor* BuildFileCollectingErrors(
+    const FileDescriptorProto& proto,
+    ErrorCollector* error_collector);
+
+  // By default, it is an error if a FileDescriptorProto contains references
+  // to types or other files that are not found in the DescriptorPool (or its
+  // backing DescriptorDatabase, if any).  If you call
+  // AllowUnknownDependencies(), however, then unknown types and files
+  // will be replaced by placeholder descriptors.  This can allow you to
+  // perform some useful operations with a .proto file even if you do not
+  // have access to other .proto files on which it depends.  However, some
+  // heuristics must be used to fill in the gaps in information, and these
+  // can lead to descriptors which are inaccurate.  For example, the
+  // DescriptorPool may be forced to guess whether an unknown type is a message
+  // or an enum, as well as what package it resides in.  Furthermore,
+  // placeholder types will not be discoverable via FindMessageTypeByName()
+  // and similar methods, which could confuse some descriptor-based algorithms.
+  // Generally, the results of this option should only be relied upon for
+  // debugging purposes.
+  void AllowUnknownDependencies() { allow_unknown_ = true; }
+
+  // Internal stuff --------------------------------------------------
+  // These methods MUST NOT be called from outside the proto2 library.
+  // These methods may contain hidden pitfalls and may be removed in a
+  // future library version.
+
+  // Create a DescriptorPool which is overlaid on top of some other pool.
+  // If you search for a descriptor in the overlay and it is not found, the
+  // underlay will be searched as a backup.  If the underlay has its own
+  // underlay, that will be searched next, and so on.  This also means that
+  // files built in the overlay will be cross-linked with the underlay's
+  // descriptors if necessary.  The underlay remains property of the caller;
+  // it must remain valid for the lifetime of the newly-constructed pool.
+  //
+  // Example:  Say you want to parse a .proto file at runtime in order to use
+  // its type with a DynamicMessage.  Say this .proto file has dependencies,
+  // but you know that all the dependencies will be things that are already
+  // compiled into the binary.  For ease of use, you'd like to load the types
+  // right out of generated_pool() rather than have to parse redundant copies
+  // of all these .protos and runtime.  But, you don't want to add the parsed
+  // types directly into generated_pool(): this is not allowed, and would be
+  // bad design anyway.  So, instead, you could use generated_pool() as an
+  // underlay for a new DescriptorPool in which you add only the new file.
+  //
+  // WARNING:  Use of underlays can lead to many subtle gotchas.  Instead,
+  //   try to formulate what you want to do in terms of DescriptorDatabases.
+  explicit DescriptorPool(const DescriptorPool* underlay);
+
+  // Called by generated classes at init time to add their descriptors to
+  // generated_pool.  Do NOT call this in your own code!  filename must be a
+  // permanent string (e.g. a string literal).
+  static void InternalAddGeneratedFile(
+      const void* encoded_file_descriptor, int size);
+
+
+  // For internal use only:  Gets a non-const pointer to the generated pool.
+  // This is called at static-initialization time only, so thread-safety is
+  // not a concern.  If both an underlay and a fallback database are present,
+  // the underlay takes precedence.
+  static DescriptorPool* internal_generated_pool();
+
+  // For internal use only:  Changes the behavior of BuildFile() such that it
+  // allows the file to make reference to message types declared in other files
+  // which it did not officially declare as dependencies.
+  void InternalDontEnforceDependencies();
+
+  // For internal use only.
+  void internal_set_underlay(const DescriptorPool* underlay) {
+    underlay_ = underlay;
+  }
+
+  // For internal (unit test) use only:  Returns true if a FileDescriptor has
+  // been constructed for the given file, false otherwise.  Useful for testing
+  // lazy descriptor initialization behavior.
+  bool InternalIsFileLoaded(const string& filename) const;
+
+ private:
+  friend class Descriptor;
+  friend class FieldDescriptor;
+  friend class EnumDescriptor;
+  friend class ServiceDescriptor;
+  friend class FileDescriptor;
+  friend class DescriptorBuilder;
+
+  // Return true if the given name is a sub-symbol of any non-package
+  // descriptor that already exists in the descriptor pool.  (The full
+  // definition of such types is already known.)
+  bool IsSubSymbolOfBuiltType(const string& name) const;
+
+  // Tries to find something in the fallback database and link in the
+  // corresponding proto file.  Returns true if successful, in which case
+  // the caller should search for the thing again.  These are declared
+  // const because they are called by (semantically) const methods.
+  bool TryFindFileInFallbackDatabase(const string& name) const;
+  bool TryFindSymbolInFallbackDatabase(const string& name) const;
+  bool TryFindExtensionInFallbackDatabase(const Descriptor* containing_type,
+                                          int field_number) const;
+
+  // Like BuildFile() but called internally when the file has been loaded from
+  // fallback_database_.  Declared const because it is called by (semantically)
+  // const methods.
+  const FileDescriptor* BuildFileFromDatabase(
+    const FileDescriptorProto& proto) const;
+
+  // If fallback_database_ is NULL, this is NULL.  Otherwise, this is a mutex
+  // which must be locked while accessing tables_.
+  Mutex* mutex_;
+
+  // See constructor.
+  DescriptorDatabase* fallback_database_;
+  ErrorCollector* default_error_collector_;
+  const DescriptorPool* underlay_;
+
+  // This class contains a lot of hash maps with complicated types that
+  // we'd like to keep out of the header.
+  class Tables;
+  scoped_ptr<Tables> tables_;
+
+  bool enforce_dependencies_;
+  bool allow_unknown_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorPool);
+};
+
+// inline methods ====================================================
+
+// These macros makes this repetitive code more readable.
+#define PROTOBUF_DEFINE_ACCESSOR(CLASS, FIELD, TYPE) \
+  inline TYPE CLASS::FIELD() const { return FIELD##_; }
+
+// Strings fields are stored as pointers but returned as const references.
+#define PROTOBUF_DEFINE_STRING_ACCESSOR(CLASS, FIELD) \
+  inline const string& CLASS::FIELD() const { return *FIELD##_; }
+
+// Arrays take an index parameter, obviously.
+#define PROTOBUF_DEFINE_ARRAY_ACCESSOR(CLASS, FIELD, TYPE) \
+  inline TYPE CLASS::FIELD(int index) const { return FIELD##s_ + index; }
+
+#define PROTOBUF_DEFINE_OPTIONS_ACCESSOR(CLASS, TYPE) \
+  inline const TYPE& CLASS::options() const { return *options_; }
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(Descriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(Descriptor, full_name)
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, file, const FileDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, containing_type, const Descriptor*)
+
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, field_count, int)
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, nested_type_count, int)
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, enum_type_count, int)
+
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, field, const FieldDescriptor*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, nested_type, const Descriptor*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, enum_type, const EnumDescriptor*)
+
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, extension_range_count, int)
+PROTOBUF_DEFINE_ACCESSOR(Descriptor, extension_count, int)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, extension_range,
+                               const Descriptor::ExtensionRange*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, extension,
+                               const FieldDescriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(Descriptor, MessageOptions)
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, full_name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, lowercase_name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, camelcase_name)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, file, const FileDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, number, int)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, is_extension, bool)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, type, FieldDescriptor::Type)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, label, FieldDescriptor::Label)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, containing_type, const Descriptor*)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, extension_scope, const Descriptor*)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, message_type, const Descriptor*)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, enum_type, const EnumDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, experimental_map_key,
+                         const FieldDescriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(FieldDescriptor, FieldOptions)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, has_default_value, bool)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_int32 , int32 )
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_int64 , int64 )
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_uint32, uint32)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_uint64, uint64)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_float , float )
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_double, double)
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_bool  , bool  )
+PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_enum,
+                         const EnumValueDescriptor*)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, default_value_string)
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(EnumDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(EnumDescriptor, full_name)
+PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, file, const FileDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, containing_type, const Descriptor*)
+PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, value_count, int)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(EnumDescriptor, value,
+                               const EnumValueDescriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(EnumDescriptor, EnumOptions)
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(EnumValueDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(EnumValueDescriptor, full_name)
+PROTOBUF_DEFINE_ACCESSOR(EnumValueDescriptor, number, int)
+PROTOBUF_DEFINE_ACCESSOR(EnumValueDescriptor, type, const EnumDescriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(EnumValueDescriptor, EnumValueOptions)
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(ServiceDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(ServiceDescriptor, full_name)
+PROTOBUF_DEFINE_ACCESSOR(ServiceDescriptor, file, const FileDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(ServiceDescriptor, method_count, int)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(ServiceDescriptor, method,
+                               const MethodDescriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(ServiceDescriptor, ServiceOptions)
+
+PROTOBUF_DEFINE_STRING_ACCESSOR(MethodDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(MethodDescriptor, full_name)
+PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, service, const ServiceDescriptor*)
+PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, input_type, const Descriptor*)
+PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, output_type, const Descriptor*)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(MethodDescriptor, MethodOptions)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FileDescriptor, name)
+PROTOBUF_DEFINE_STRING_ACCESSOR(FileDescriptor, package)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, pool, const DescriptorPool*)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, dependency_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, public_dependency_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, weak_dependency_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, message_type_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, enum_type_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, service_count, int)
+PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, extension_count, int)
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR(FileDescriptor, FileOptions)
+
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, message_type, const Descriptor*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, enum_type, const EnumDescriptor*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, service,
+                               const ServiceDescriptor*)
+PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, extension,
+                               const FieldDescriptor*)
+
+#undef PROTOBUF_DEFINE_ACCESSOR
+#undef PROTOBUF_DEFINE_STRING_ACCESSOR
+#undef PROTOBUF_DEFINE_ARRAY_ACCESSOR
+
+// A few accessors differ from the macros...
+
+inline bool FieldDescriptor::is_required() const {
+  return label() == LABEL_REQUIRED;
+}
+
+inline bool FieldDescriptor::is_optional() const {
+  return label() == LABEL_OPTIONAL;
+}
+
+inline bool FieldDescriptor::is_repeated() const {
+  return label() == LABEL_REPEATED;
+}
+
+inline bool FieldDescriptor::is_packable() const {
+  return is_repeated() && IsTypePackable(type());
+}
+
+// To save space, index() is computed by looking at the descriptor's position
+// in the parent's array of children.
+inline int FieldDescriptor::index() const {
+  if (!is_extension_) {
+    return this - containing_type_->fields_;
+  } else if (extension_scope_ != NULL) {
+    return this - extension_scope_->extensions_;
+  } else {
+    return this - file_->extensions_;
+  }
+}
+
+inline int Descriptor::index() const {
+  if (containing_type_ == NULL) {
+    return this - file_->message_types_;
+  } else {
+    return this - containing_type_->nested_types_;
+  }
+}
+
+inline int EnumDescriptor::index() const {
+  if (containing_type_ == NULL) {
+    return this - file_->enum_types_;
+  } else {
+    return this - containing_type_->enum_types_;
+  }
+}
+
+inline int EnumValueDescriptor::index() const {
+  return this - type_->values_;
+}
+
+inline int ServiceDescriptor::index() const {
+  return this - file_->services_;
+}
+
+inline int MethodDescriptor::index() const {
+  return this - service_->methods_;
+}
+
+inline const char* FieldDescriptor::type_name() const {
+  return kTypeToName[type_];
+}
+
+inline FieldDescriptor::CppType FieldDescriptor::cpp_type() const {
+  return kTypeToCppTypeMap[type_];
+}
+
+inline const char* FieldDescriptor::cpp_type_name() const {
+  return kCppTypeToName[kTypeToCppTypeMap[type_]];
+}
+
+inline FieldDescriptor::CppType FieldDescriptor::TypeToCppType(Type type) {
+  return kTypeToCppTypeMap[type];
+}
+
+inline bool FieldDescriptor::IsTypePackable(Type field_type) {
+  return (field_type != FieldDescriptor::TYPE_STRING &&
+          field_type != FieldDescriptor::TYPE_GROUP &&
+          field_type != FieldDescriptor::TYPE_MESSAGE &&
+          field_type != FieldDescriptor::TYPE_BYTES);
+}
+
+inline const FileDescriptor* FileDescriptor::dependency(int index) const {
+  return dependencies_[index];
+}
+
+inline const FileDescriptor* FileDescriptor::public_dependency(
+    int index) const {
+  return dependencies_[public_dependencies_[index]];
+}
+
+inline const FileDescriptor* FileDescriptor::weak_dependency(
+    int index) const {
+  return dependencies_[weak_dependencies_[index]];
+}
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_DESCRIPTOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.pb.h b/ps-lite/deps/include/google/protobuf/descriptor.pb.h
new file mode 100644
index 00000000..07cf8077
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/descriptor.pb.h
@@ -0,0 +1,5992 @@
+// Generated by the protocol buffer compiler.  DO NOT EDIT!
+// source: google/protobuf/descriptor.proto
+
+#ifndef PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
+#define PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
+
+#include <string>
+
+#include <google/protobuf/stubs/common.h>
+
+#if GOOGLE_PROTOBUF_VERSION < 2005000
+#error This file was generated by a newer version of protoc which is
+#error incompatible with your Protocol Buffer headers.  Please update
+#error your headers.
+#endif
+#if 2005000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
+#error This file was generated by an older version of protoc which is
+#error incompatible with your Protocol Buffer headers.  Please
+#error regenerate this file with a newer version of protoc.
+#endif
+
+#include <google/protobuf/generated_message_util.h>
+#include <google/protobuf/message.h>
+#include <google/protobuf/repeated_field.h>
+#include <google/protobuf/extension_set.h>
+#include <google/protobuf/generated_enum_reflection.h>
+#include <google/protobuf/unknown_field_set.h>
+// @@protoc_insertion_point(includes)
+
+namespace google {
+namespace protobuf {
+
+// Internal implementation detail -- do not call these.
+void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+class FileDescriptorSet;
+class FileDescriptorProto;
+class DescriptorProto;
+class DescriptorProto_ExtensionRange;
+class FieldDescriptorProto;
+class EnumDescriptorProto;
+class EnumValueDescriptorProto;
+class ServiceDescriptorProto;
+class MethodDescriptorProto;
+class FileOptions;
+class MessageOptions;
+class FieldOptions;
+class EnumOptions;
+class EnumValueOptions;
+class ServiceOptions;
+class MethodOptions;
+class UninterpretedOption;
+class UninterpretedOption_NamePart;
+class SourceCodeInfo;
+class SourceCodeInfo_Location;
+
+enum FieldDescriptorProto_Type {
+  FieldDescriptorProto_Type_TYPE_DOUBLE = 1,
+  FieldDescriptorProto_Type_TYPE_FLOAT = 2,
+  FieldDescriptorProto_Type_TYPE_INT64 = 3,
+  FieldDescriptorProto_Type_TYPE_UINT64 = 4,
+  FieldDescriptorProto_Type_TYPE_INT32 = 5,
+  FieldDescriptorProto_Type_TYPE_FIXED64 = 6,
+  FieldDescriptorProto_Type_TYPE_FIXED32 = 7,
+  FieldDescriptorProto_Type_TYPE_BOOL = 8,
+  FieldDescriptorProto_Type_TYPE_STRING = 9,
+  FieldDescriptorProto_Type_TYPE_GROUP = 10,
+  FieldDescriptorProto_Type_TYPE_MESSAGE = 11,
+  FieldDescriptorProto_Type_TYPE_BYTES = 12,
+  FieldDescriptorProto_Type_TYPE_UINT32 = 13,
+  FieldDescriptorProto_Type_TYPE_ENUM = 14,
+  FieldDescriptorProto_Type_TYPE_SFIXED32 = 15,
+  FieldDescriptorProto_Type_TYPE_SFIXED64 = 16,
+  FieldDescriptorProto_Type_TYPE_SINT32 = 17,
+  FieldDescriptorProto_Type_TYPE_SINT64 = 18
+};
+LIBPROTOBUF_EXPORT bool FieldDescriptorProto_Type_IsValid(int value);
+const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MIN = FieldDescriptorProto_Type_TYPE_DOUBLE;
+const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MAX = FieldDescriptorProto_Type_TYPE_SINT64;
+const int FieldDescriptorProto_Type_Type_ARRAYSIZE = FieldDescriptorProto_Type_Type_MAX + 1;
+
+LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldDescriptorProto_Type_descriptor();
+inline const ::std::string& FieldDescriptorProto_Type_Name(FieldDescriptorProto_Type value) {
+  return ::google::protobuf::internal::NameOfEnum(
+    FieldDescriptorProto_Type_descriptor(), value);
+}
+inline bool FieldDescriptorProto_Type_Parse(
+    const ::std::string& name, FieldDescriptorProto_Type* value) {
+  return ::google::protobuf::internal::ParseNamedEnum<FieldDescriptorProto_Type>(
+    FieldDescriptorProto_Type_descriptor(), name, value);
+}
+enum FieldDescriptorProto_Label {
+  FieldDescriptorProto_Label_LABEL_OPTIONAL = 1,
+  FieldDescriptorProto_Label_LABEL_REQUIRED = 2,
+  FieldDescriptorProto_Label_LABEL_REPEATED = 3
+};
+LIBPROTOBUF_EXPORT bool FieldDescriptorProto_Label_IsValid(int value);
+const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MIN = FieldDescriptorProto_Label_LABEL_OPTIONAL;
+const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MAX = FieldDescriptorProto_Label_LABEL_REPEATED;
+const int FieldDescriptorProto_Label_Label_ARRAYSIZE = FieldDescriptorProto_Label_Label_MAX + 1;
+
+LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldDescriptorProto_Label_descriptor();
+inline const ::std::string& FieldDescriptorProto_Label_Name(FieldDescriptorProto_Label value) {
+  return ::google::protobuf::internal::NameOfEnum(
+    FieldDescriptorProto_Label_descriptor(), value);
+}
+inline bool FieldDescriptorProto_Label_Parse(
+    const ::std::string& name, FieldDescriptorProto_Label* value) {
+  return ::google::protobuf::internal::ParseNamedEnum<FieldDescriptorProto_Label>(
+    FieldDescriptorProto_Label_descriptor(), name, value);
+}
+enum FileOptions_OptimizeMode {
+  FileOptions_OptimizeMode_SPEED = 1,
+  FileOptions_OptimizeMode_CODE_SIZE = 2,
+  FileOptions_OptimizeMode_LITE_RUNTIME = 3
+};
+LIBPROTOBUF_EXPORT bool FileOptions_OptimizeMode_IsValid(int value);
+const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MIN = FileOptions_OptimizeMode_SPEED;
+const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MAX = FileOptions_OptimizeMode_LITE_RUNTIME;
+const int FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE = FileOptions_OptimizeMode_OptimizeMode_MAX + 1;
+
+LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FileOptions_OptimizeMode_descriptor();
+inline const ::std::string& FileOptions_OptimizeMode_Name(FileOptions_OptimizeMode value) {
+  return ::google::protobuf::internal::NameOfEnum(
+    FileOptions_OptimizeMode_descriptor(), value);
+}
+inline bool FileOptions_OptimizeMode_Parse(
+    const ::std::string& name, FileOptions_OptimizeMode* value) {
+  return ::google::protobuf::internal::ParseNamedEnum<FileOptions_OptimizeMode>(
+    FileOptions_OptimizeMode_descriptor(), name, value);
+}
+enum FieldOptions_CType {
+  FieldOptions_CType_STRING = 0,
+  FieldOptions_CType_CORD = 1,
+  FieldOptions_CType_STRING_PIECE = 2
+};
+LIBPROTOBUF_EXPORT bool FieldOptions_CType_IsValid(int value);
+const FieldOptions_CType FieldOptions_CType_CType_MIN = FieldOptions_CType_STRING;
+const FieldOptions_CType FieldOptions_CType_CType_MAX = FieldOptions_CType_STRING_PIECE;
+const int FieldOptions_CType_CType_ARRAYSIZE = FieldOptions_CType_CType_MAX + 1;
+
+LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldOptions_CType_descriptor();
+inline const ::std::string& FieldOptions_CType_Name(FieldOptions_CType value) {
+  return ::google::protobuf::internal::NameOfEnum(
+    FieldOptions_CType_descriptor(), value);
+}
+inline bool FieldOptions_CType_Parse(
+    const ::std::string& name, FieldOptions_CType* value) {
+  return ::google::protobuf::internal::ParseNamedEnum<FieldOptions_CType>(
+    FieldOptions_CType_descriptor(), name, value);
+}
+// ===================================================================
+
+class LIBPROTOBUF_EXPORT FileDescriptorSet : public ::google::protobuf::Message {
+ public:
+  FileDescriptorSet();
+  virtual ~FileDescriptorSet();
+
+  FileDescriptorSet(const FileDescriptorSet& from);
+
+  inline FileDescriptorSet& operator=(const FileDescriptorSet& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const FileDescriptorSet& default_instance();
+
+  void Swap(FileDescriptorSet* other);
+
+  // implements Message ----------------------------------------------
+
+  FileDescriptorSet* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const FileDescriptorSet& from);
+  void MergeFrom(const FileDescriptorSet& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.FileDescriptorProto file = 1;
+  inline int file_size() const;
+  inline void clear_file();
+  static const int kFileFieldNumber = 1;
+  inline const ::google::protobuf::FileDescriptorProto& file(int index) const;
+  inline ::google::protobuf::FileDescriptorProto* mutable_file(int index);
+  inline ::google::protobuf::FileDescriptorProto* add_file();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
+      file() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
+      mutable_file();
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.FileDescriptorSet)
+ private:
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > file_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static FileDescriptorSet* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT FileDescriptorProto : public ::google::protobuf::Message {
+ public:
+  FileDescriptorProto();
+  virtual ~FileDescriptorProto();
+
+  FileDescriptorProto(const FileDescriptorProto& from);
+
+  inline FileDescriptorProto& operator=(const FileDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const FileDescriptorProto& default_instance();
+
+  void Swap(FileDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  FileDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const FileDescriptorProto& from);
+  void MergeFrom(const FileDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // optional string package = 2;
+  inline bool has_package() const;
+  inline void clear_package();
+  static const int kPackageFieldNumber = 2;
+  inline const ::std::string& package() const;
+  inline void set_package(const ::std::string& value);
+  inline void set_package(const char* value);
+  inline void set_package(const char* value, size_t size);
+  inline ::std::string* mutable_package();
+  inline ::std::string* release_package();
+  inline void set_allocated_package(::std::string* package);
+
+  // repeated string dependency = 3;
+  inline int dependency_size() const;
+  inline void clear_dependency();
+  static const int kDependencyFieldNumber = 3;
+  inline const ::std::string& dependency(int index) const;
+  inline ::std::string* mutable_dependency(int index);
+  inline void set_dependency(int index, const ::std::string& value);
+  inline void set_dependency(int index, const char* value);
+  inline void set_dependency(int index, const char* value, size_t size);
+  inline ::std::string* add_dependency();
+  inline void add_dependency(const ::std::string& value);
+  inline void add_dependency(const char* value);
+  inline void add_dependency(const char* value, size_t size);
+  inline const ::google::protobuf::RepeatedPtrField< ::std::string>& dependency() const;
+  inline ::google::protobuf::RepeatedPtrField< ::std::string>* mutable_dependency();
+
+  // repeated int32 public_dependency = 10;
+  inline int public_dependency_size() const;
+  inline void clear_public_dependency();
+  static const int kPublicDependencyFieldNumber = 10;
+  inline ::google::protobuf::int32 public_dependency(int index) const;
+  inline void set_public_dependency(int index, ::google::protobuf::int32 value);
+  inline void add_public_dependency(::google::protobuf::int32 value);
+  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+      public_dependency() const;
+  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+      mutable_public_dependency();
+
+  // repeated int32 weak_dependency = 11;
+  inline int weak_dependency_size() const;
+  inline void clear_weak_dependency();
+  static const int kWeakDependencyFieldNumber = 11;
+  inline ::google::protobuf::int32 weak_dependency(int index) const;
+  inline void set_weak_dependency(int index, ::google::protobuf::int32 value);
+  inline void add_weak_dependency(::google::protobuf::int32 value);
+  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+      weak_dependency() const;
+  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+      mutable_weak_dependency();
+
+  // repeated .google.protobuf.DescriptorProto message_type = 4;
+  inline int message_type_size() const;
+  inline void clear_message_type();
+  static const int kMessageTypeFieldNumber = 4;
+  inline const ::google::protobuf::DescriptorProto& message_type(int index) const;
+  inline ::google::protobuf::DescriptorProto* mutable_message_type(int index);
+  inline ::google::protobuf::DescriptorProto* add_message_type();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
+      message_type() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
+      mutable_message_type();
+
+  // repeated .google.protobuf.EnumDescriptorProto enum_type = 5;
+  inline int enum_type_size() const;
+  inline void clear_enum_type();
+  static const int kEnumTypeFieldNumber = 5;
+  inline const ::google::protobuf::EnumDescriptorProto& enum_type(int index) const;
+  inline ::google::protobuf::EnumDescriptorProto* mutable_enum_type(int index);
+  inline ::google::protobuf::EnumDescriptorProto* add_enum_type();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
+      enum_type() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
+      mutable_enum_type();
+
+  // repeated .google.protobuf.ServiceDescriptorProto service = 6;
+  inline int service_size() const;
+  inline void clear_service();
+  static const int kServiceFieldNumber = 6;
+  inline const ::google::protobuf::ServiceDescriptorProto& service(int index) const;
+  inline ::google::protobuf::ServiceDescriptorProto* mutable_service(int index);
+  inline ::google::protobuf::ServiceDescriptorProto* add_service();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >&
+      service() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >*
+      mutable_service();
+
+  // repeated .google.protobuf.FieldDescriptorProto extension = 7;
+  inline int extension_size() const;
+  inline void clear_extension();
+  static const int kExtensionFieldNumber = 7;
+  inline const ::google::protobuf::FieldDescriptorProto& extension(int index) const;
+  inline ::google::protobuf::FieldDescriptorProto* mutable_extension(int index);
+  inline ::google::protobuf::FieldDescriptorProto* add_extension();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+      extension() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+      mutable_extension();
+
+  // optional .google.protobuf.FileOptions options = 8;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 8;
+  inline const ::google::protobuf::FileOptions& options() const;
+  inline ::google::protobuf::FileOptions* mutable_options();
+  inline ::google::protobuf::FileOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::FileOptions* options);
+
+  // optional .google.protobuf.SourceCodeInfo source_code_info = 9;
+  inline bool has_source_code_info() const;
+  inline void clear_source_code_info();
+  static const int kSourceCodeInfoFieldNumber = 9;
+  inline const ::google::protobuf::SourceCodeInfo& source_code_info() const;
+  inline ::google::protobuf::SourceCodeInfo* mutable_source_code_info();
+  inline ::google::protobuf::SourceCodeInfo* release_source_code_info();
+  inline void set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.FileDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_package();
+  inline void clear_has_package();
+  inline void set_has_options();
+  inline void clear_has_options();
+  inline void set_has_source_code_info();
+  inline void clear_has_source_code_info();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::std::string* package_;
+  ::google::protobuf::RepeatedPtrField< ::std::string> dependency_;
+  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > public_dependency_;
+  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > weak_dependency_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > message_type_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto > service_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;
+  ::google::protobuf::FileOptions* options_;
+  ::google::protobuf::SourceCodeInfo* source_code_info_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(11 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static FileDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT DescriptorProto_ExtensionRange : public ::google::protobuf::Message {
+ public:
+  DescriptorProto_ExtensionRange();
+  virtual ~DescriptorProto_ExtensionRange();
+
+  DescriptorProto_ExtensionRange(const DescriptorProto_ExtensionRange& from);
+
+  inline DescriptorProto_ExtensionRange& operator=(const DescriptorProto_ExtensionRange& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const DescriptorProto_ExtensionRange& default_instance();
+
+  void Swap(DescriptorProto_ExtensionRange* other);
+
+  // implements Message ----------------------------------------------
+
+  DescriptorProto_ExtensionRange* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const DescriptorProto_ExtensionRange& from);
+  void MergeFrom(const DescriptorProto_ExtensionRange& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional int32 start = 1;
+  inline bool has_start() const;
+  inline void clear_start();
+  static const int kStartFieldNumber = 1;
+  inline ::google::protobuf::int32 start() const;
+  inline void set_start(::google::protobuf::int32 value);
+
+  // optional int32 end = 2;
+  inline bool has_end() const;
+  inline void clear_end();
+  static const int kEndFieldNumber = 2;
+  inline ::google::protobuf::int32 end() const;
+  inline void set_end(::google::protobuf::int32 value);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.DescriptorProto.ExtensionRange)
+ private:
+  inline void set_has_start();
+  inline void clear_has_start();
+  inline void set_has_end();
+  inline void clear_has_end();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::int32 start_;
+  ::google::protobuf::int32 end_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static DescriptorProto_ExtensionRange* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT DescriptorProto : public ::google::protobuf::Message {
+ public:
+  DescriptorProto();
+  virtual ~DescriptorProto();
+
+  DescriptorProto(const DescriptorProto& from);
+
+  inline DescriptorProto& operator=(const DescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const DescriptorProto& default_instance();
+
+  void Swap(DescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  DescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const DescriptorProto& from);
+  void MergeFrom(const DescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef DescriptorProto_ExtensionRange ExtensionRange;
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // repeated .google.protobuf.FieldDescriptorProto field = 2;
+  inline int field_size() const;
+  inline void clear_field();
+  static const int kFieldFieldNumber = 2;
+  inline const ::google::protobuf::FieldDescriptorProto& field(int index) const;
+  inline ::google::protobuf::FieldDescriptorProto* mutable_field(int index);
+  inline ::google::protobuf::FieldDescriptorProto* add_field();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+      field() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+      mutable_field();
+
+  // repeated .google.protobuf.FieldDescriptorProto extension = 6;
+  inline int extension_size() const;
+  inline void clear_extension();
+  static const int kExtensionFieldNumber = 6;
+  inline const ::google::protobuf::FieldDescriptorProto& extension(int index) const;
+  inline ::google::protobuf::FieldDescriptorProto* mutable_extension(int index);
+  inline ::google::protobuf::FieldDescriptorProto* add_extension();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+      extension() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+      mutable_extension();
+
+  // repeated .google.protobuf.DescriptorProto nested_type = 3;
+  inline int nested_type_size() const;
+  inline void clear_nested_type();
+  static const int kNestedTypeFieldNumber = 3;
+  inline const ::google::protobuf::DescriptorProto& nested_type(int index) const;
+  inline ::google::protobuf::DescriptorProto* mutable_nested_type(int index);
+  inline ::google::protobuf::DescriptorProto* add_nested_type();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
+      nested_type() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
+      mutable_nested_type();
+
+  // repeated .google.protobuf.EnumDescriptorProto enum_type = 4;
+  inline int enum_type_size() const;
+  inline void clear_enum_type();
+  static const int kEnumTypeFieldNumber = 4;
+  inline const ::google::protobuf::EnumDescriptorProto& enum_type(int index) const;
+  inline ::google::protobuf::EnumDescriptorProto* mutable_enum_type(int index);
+  inline ::google::protobuf::EnumDescriptorProto* add_enum_type();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
+      enum_type() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
+      mutable_enum_type();
+
+  // repeated .google.protobuf.DescriptorProto.ExtensionRange extension_range = 5;
+  inline int extension_range_size() const;
+  inline void clear_extension_range();
+  static const int kExtensionRangeFieldNumber = 5;
+  inline const ::google::protobuf::DescriptorProto_ExtensionRange& extension_range(int index) const;
+  inline ::google::protobuf::DescriptorProto_ExtensionRange* mutable_extension_range(int index);
+  inline ::google::protobuf::DescriptorProto_ExtensionRange* add_extension_range();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >&
+      extension_range() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >*
+      mutable_extension_range();
+
+  // optional .google.protobuf.MessageOptions options = 7;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 7;
+  inline const ::google::protobuf::MessageOptions& options() const;
+  inline ::google::protobuf::MessageOptions* mutable_options();
+  inline ::google::protobuf::MessageOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::MessageOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.DescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > field_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > nested_type_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange > extension_range_;
+  ::google::protobuf::MessageOptions* options_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static DescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT FieldDescriptorProto : public ::google::protobuf::Message {
+ public:
+  FieldDescriptorProto();
+  virtual ~FieldDescriptorProto();
+
+  FieldDescriptorProto(const FieldDescriptorProto& from);
+
+  inline FieldDescriptorProto& operator=(const FieldDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const FieldDescriptorProto& default_instance();
+
+  void Swap(FieldDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  FieldDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const FieldDescriptorProto& from);
+  void MergeFrom(const FieldDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef FieldDescriptorProto_Type Type;
+  static const Type TYPE_DOUBLE = FieldDescriptorProto_Type_TYPE_DOUBLE;
+  static const Type TYPE_FLOAT = FieldDescriptorProto_Type_TYPE_FLOAT;
+  static const Type TYPE_INT64 = FieldDescriptorProto_Type_TYPE_INT64;
+  static const Type TYPE_UINT64 = FieldDescriptorProto_Type_TYPE_UINT64;
+  static const Type TYPE_INT32 = FieldDescriptorProto_Type_TYPE_INT32;
+  static const Type TYPE_FIXED64 = FieldDescriptorProto_Type_TYPE_FIXED64;
+  static const Type TYPE_FIXED32 = FieldDescriptorProto_Type_TYPE_FIXED32;
+  static const Type TYPE_BOOL = FieldDescriptorProto_Type_TYPE_BOOL;
+  static const Type TYPE_STRING = FieldDescriptorProto_Type_TYPE_STRING;
+  static const Type TYPE_GROUP = FieldDescriptorProto_Type_TYPE_GROUP;
+  static const Type TYPE_MESSAGE = FieldDescriptorProto_Type_TYPE_MESSAGE;
+  static const Type TYPE_BYTES = FieldDescriptorProto_Type_TYPE_BYTES;
+  static const Type TYPE_UINT32 = FieldDescriptorProto_Type_TYPE_UINT32;
+  static const Type TYPE_ENUM = FieldDescriptorProto_Type_TYPE_ENUM;
+  static const Type TYPE_SFIXED32 = FieldDescriptorProto_Type_TYPE_SFIXED32;
+  static const Type TYPE_SFIXED64 = FieldDescriptorProto_Type_TYPE_SFIXED64;
+  static const Type TYPE_SINT32 = FieldDescriptorProto_Type_TYPE_SINT32;
+  static const Type TYPE_SINT64 = FieldDescriptorProto_Type_TYPE_SINT64;
+  static inline bool Type_IsValid(int value) {
+    return FieldDescriptorProto_Type_IsValid(value);
+  }
+  static const Type Type_MIN =
+    FieldDescriptorProto_Type_Type_MIN;
+  static const Type Type_MAX =
+    FieldDescriptorProto_Type_Type_MAX;
+  static const int Type_ARRAYSIZE =
+    FieldDescriptorProto_Type_Type_ARRAYSIZE;
+  static inline const ::google::protobuf::EnumDescriptor*
+  Type_descriptor() {
+    return FieldDescriptorProto_Type_descriptor();
+  }
+  static inline const ::std::string& Type_Name(Type value) {
+    return FieldDescriptorProto_Type_Name(value);
+  }
+  static inline bool Type_Parse(const ::std::string& name,
+      Type* value) {
+    return FieldDescriptorProto_Type_Parse(name, value);
+  }
+
+  typedef FieldDescriptorProto_Label Label;
+  static const Label LABEL_OPTIONAL = FieldDescriptorProto_Label_LABEL_OPTIONAL;
+  static const Label LABEL_REQUIRED = FieldDescriptorProto_Label_LABEL_REQUIRED;
+  static const Label LABEL_REPEATED = FieldDescriptorProto_Label_LABEL_REPEATED;
+  static inline bool Label_IsValid(int value) {
+    return FieldDescriptorProto_Label_IsValid(value);
+  }
+  static const Label Label_MIN =
+    FieldDescriptorProto_Label_Label_MIN;
+  static const Label Label_MAX =
+    FieldDescriptorProto_Label_Label_MAX;
+  static const int Label_ARRAYSIZE =
+    FieldDescriptorProto_Label_Label_ARRAYSIZE;
+  static inline const ::google::protobuf::EnumDescriptor*
+  Label_descriptor() {
+    return FieldDescriptorProto_Label_descriptor();
+  }
+  static inline const ::std::string& Label_Name(Label value) {
+    return FieldDescriptorProto_Label_Name(value);
+  }
+  static inline bool Label_Parse(const ::std::string& name,
+      Label* value) {
+    return FieldDescriptorProto_Label_Parse(name, value);
+  }
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // optional int32 number = 3;
+  inline bool has_number() const;
+  inline void clear_number();
+  static const int kNumberFieldNumber = 3;
+  inline ::google::protobuf::int32 number() const;
+  inline void set_number(::google::protobuf::int32 value);
+
+  // optional .google.protobuf.FieldDescriptorProto.Label label = 4;
+  inline bool has_label() const;
+  inline void clear_label();
+  static const int kLabelFieldNumber = 4;
+  inline ::google::protobuf::FieldDescriptorProto_Label label() const;
+  inline void set_label(::google::protobuf::FieldDescriptorProto_Label value);
+
+  // optional .google.protobuf.FieldDescriptorProto.Type type = 5;
+  inline bool has_type() const;
+  inline void clear_type();
+  static const int kTypeFieldNumber = 5;
+  inline ::google::protobuf::FieldDescriptorProto_Type type() const;
+  inline void set_type(::google::protobuf::FieldDescriptorProto_Type value);
+
+  // optional string type_name = 6;
+  inline bool has_type_name() const;
+  inline void clear_type_name();
+  static const int kTypeNameFieldNumber = 6;
+  inline const ::std::string& type_name() const;
+  inline void set_type_name(const ::std::string& value);
+  inline void set_type_name(const char* value);
+  inline void set_type_name(const char* value, size_t size);
+  inline ::std::string* mutable_type_name();
+  inline ::std::string* release_type_name();
+  inline void set_allocated_type_name(::std::string* type_name);
+
+  // optional string extendee = 2;
+  inline bool has_extendee() const;
+  inline void clear_extendee();
+  static const int kExtendeeFieldNumber = 2;
+  inline const ::std::string& extendee() const;
+  inline void set_extendee(const ::std::string& value);
+  inline void set_extendee(const char* value);
+  inline void set_extendee(const char* value, size_t size);
+  inline ::std::string* mutable_extendee();
+  inline ::std::string* release_extendee();
+  inline void set_allocated_extendee(::std::string* extendee);
+
+  // optional string default_value = 7;
+  inline bool has_default_value() const;
+  inline void clear_default_value();
+  static const int kDefaultValueFieldNumber = 7;
+  inline const ::std::string& default_value() const;
+  inline void set_default_value(const ::std::string& value);
+  inline void set_default_value(const char* value);
+  inline void set_default_value(const char* value, size_t size);
+  inline ::std::string* mutable_default_value();
+  inline ::std::string* release_default_value();
+  inline void set_allocated_default_value(::std::string* default_value);
+
+  // optional .google.protobuf.FieldOptions options = 8;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 8;
+  inline const ::google::protobuf::FieldOptions& options() const;
+  inline ::google::protobuf::FieldOptions* mutable_options();
+  inline ::google::protobuf::FieldOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::FieldOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.FieldDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_number();
+  inline void clear_has_number();
+  inline void set_has_label();
+  inline void clear_has_label();
+  inline void set_has_type();
+  inline void clear_has_type();
+  inline void set_has_type_name();
+  inline void clear_has_type_name();
+  inline void set_has_extendee();
+  inline void clear_has_extendee();
+  inline void set_has_default_value();
+  inline void clear_has_default_value();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::google::protobuf::int32 number_;
+  int label_;
+  ::std::string* type_name_;
+  ::std::string* extendee_;
+  ::std::string* default_value_;
+  ::google::protobuf::FieldOptions* options_;
+  int type_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(8 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static FieldDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT EnumDescriptorProto : public ::google::protobuf::Message {
+ public:
+  EnumDescriptorProto();
+  virtual ~EnumDescriptorProto();
+
+  EnumDescriptorProto(const EnumDescriptorProto& from);
+
+  inline EnumDescriptorProto& operator=(const EnumDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const EnumDescriptorProto& default_instance();
+
+  void Swap(EnumDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  EnumDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const EnumDescriptorProto& from);
+  void MergeFrom(const EnumDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // repeated .google.protobuf.EnumValueDescriptorProto value = 2;
+  inline int value_size() const;
+  inline void clear_value();
+  static const int kValueFieldNumber = 2;
+  inline const ::google::protobuf::EnumValueDescriptorProto& value(int index) const;
+  inline ::google::protobuf::EnumValueDescriptorProto* mutable_value(int index);
+  inline ::google::protobuf::EnumValueDescriptorProto* add_value();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >&
+      value() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >*
+      mutable_value();
+
+  // optional .google.protobuf.EnumOptions options = 3;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 3;
+  inline const ::google::protobuf::EnumOptions& options() const;
+  inline ::google::protobuf::EnumOptions* mutable_options();
+  inline ::google::protobuf::EnumOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::EnumOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.EnumDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto > value_;
+  ::google::protobuf::EnumOptions* options_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static EnumDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT EnumValueDescriptorProto : public ::google::protobuf::Message {
+ public:
+  EnumValueDescriptorProto();
+  virtual ~EnumValueDescriptorProto();
+
+  EnumValueDescriptorProto(const EnumValueDescriptorProto& from);
+
+  inline EnumValueDescriptorProto& operator=(const EnumValueDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const EnumValueDescriptorProto& default_instance();
+
+  void Swap(EnumValueDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  EnumValueDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const EnumValueDescriptorProto& from);
+  void MergeFrom(const EnumValueDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // optional int32 number = 2;
+  inline bool has_number() const;
+  inline void clear_number();
+  static const int kNumberFieldNumber = 2;
+  inline ::google::protobuf::int32 number() const;
+  inline void set_number(::google::protobuf::int32 value);
+
+  // optional .google.protobuf.EnumValueOptions options = 3;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 3;
+  inline const ::google::protobuf::EnumValueOptions& options() const;
+  inline ::google::protobuf::EnumValueOptions* mutable_options();
+  inline ::google::protobuf::EnumValueOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::EnumValueOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.EnumValueDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_number();
+  inline void clear_has_number();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::google::protobuf::EnumValueOptions* options_;
+  ::google::protobuf::int32 number_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static EnumValueDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT ServiceDescriptorProto : public ::google::protobuf::Message {
+ public:
+  ServiceDescriptorProto();
+  virtual ~ServiceDescriptorProto();
+
+  ServiceDescriptorProto(const ServiceDescriptorProto& from);
+
+  inline ServiceDescriptorProto& operator=(const ServiceDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const ServiceDescriptorProto& default_instance();
+
+  void Swap(ServiceDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  ServiceDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const ServiceDescriptorProto& from);
+  void MergeFrom(const ServiceDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // repeated .google.protobuf.MethodDescriptorProto method = 2;
+  inline int method_size() const;
+  inline void clear_method();
+  static const int kMethodFieldNumber = 2;
+  inline const ::google::protobuf::MethodDescriptorProto& method(int index) const;
+  inline ::google::protobuf::MethodDescriptorProto* mutable_method(int index);
+  inline ::google::protobuf::MethodDescriptorProto* add_method();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >&
+      method() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >*
+      mutable_method();
+
+  // optional .google.protobuf.ServiceOptions options = 3;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 3;
+  inline const ::google::protobuf::ServiceOptions& options() const;
+  inline ::google::protobuf::ServiceOptions* mutable_options();
+  inline ::google::protobuf::ServiceOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::ServiceOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.ServiceDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto > method_;
+  ::google::protobuf::ServiceOptions* options_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static ServiceDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT MethodDescriptorProto : public ::google::protobuf::Message {
+ public:
+  MethodDescriptorProto();
+  virtual ~MethodDescriptorProto();
+
+  MethodDescriptorProto(const MethodDescriptorProto& from);
+
+  inline MethodDescriptorProto& operator=(const MethodDescriptorProto& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const MethodDescriptorProto& default_instance();
+
+  void Swap(MethodDescriptorProto* other);
+
+  // implements Message ----------------------------------------------
+
+  MethodDescriptorProto* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const MethodDescriptorProto& from);
+  void MergeFrom(const MethodDescriptorProto& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional string name = 1;
+  inline bool has_name() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 1;
+  inline const ::std::string& name() const;
+  inline void set_name(const ::std::string& value);
+  inline void set_name(const char* value);
+  inline void set_name(const char* value, size_t size);
+  inline ::std::string* mutable_name();
+  inline ::std::string* release_name();
+  inline void set_allocated_name(::std::string* name);
+
+  // optional string input_type = 2;
+  inline bool has_input_type() const;
+  inline void clear_input_type();
+  static const int kInputTypeFieldNumber = 2;
+  inline const ::std::string& input_type() const;
+  inline void set_input_type(const ::std::string& value);
+  inline void set_input_type(const char* value);
+  inline void set_input_type(const char* value, size_t size);
+  inline ::std::string* mutable_input_type();
+  inline ::std::string* release_input_type();
+  inline void set_allocated_input_type(::std::string* input_type);
+
+  // optional string output_type = 3;
+  inline bool has_output_type() const;
+  inline void clear_output_type();
+  static const int kOutputTypeFieldNumber = 3;
+  inline const ::std::string& output_type() const;
+  inline void set_output_type(const ::std::string& value);
+  inline void set_output_type(const char* value);
+  inline void set_output_type(const char* value, size_t size);
+  inline ::std::string* mutable_output_type();
+  inline ::std::string* release_output_type();
+  inline void set_allocated_output_type(::std::string* output_type);
+
+  // optional .google.protobuf.MethodOptions options = 4;
+  inline bool has_options() const;
+  inline void clear_options();
+  static const int kOptionsFieldNumber = 4;
+  inline const ::google::protobuf::MethodOptions& options() const;
+  inline ::google::protobuf::MethodOptions* mutable_options();
+  inline ::google::protobuf::MethodOptions* release_options();
+  inline void set_allocated_options(::google::protobuf::MethodOptions* options);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.MethodDescriptorProto)
+ private:
+  inline void set_has_name();
+  inline void clear_has_name();
+  inline void set_has_input_type();
+  inline void clear_has_input_type();
+  inline void set_has_output_type();
+  inline void clear_has_output_type();
+  inline void set_has_options();
+  inline void clear_has_options();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_;
+  ::std::string* input_type_;
+  ::std::string* output_type_;
+  ::google::protobuf::MethodOptions* options_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(4 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static MethodDescriptorProto* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT FileOptions : public ::google::protobuf::Message {
+ public:
+  FileOptions();
+  virtual ~FileOptions();
+
+  FileOptions(const FileOptions& from);
+
+  inline FileOptions& operator=(const FileOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const FileOptions& default_instance();
+
+  void Swap(FileOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  FileOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const FileOptions& from);
+  void MergeFrom(const FileOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef FileOptions_OptimizeMode OptimizeMode;
+  static const OptimizeMode SPEED = FileOptions_OptimizeMode_SPEED;
+  static const OptimizeMode CODE_SIZE = FileOptions_OptimizeMode_CODE_SIZE;
+  static const OptimizeMode LITE_RUNTIME = FileOptions_OptimizeMode_LITE_RUNTIME;
+  static inline bool OptimizeMode_IsValid(int value) {
+    return FileOptions_OptimizeMode_IsValid(value);
+  }
+  static const OptimizeMode OptimizeMode_MIN =
+    FileOptions_OptimizeMode_OptimizeMode_MIN;
+  static const OptimizeMode OptimizeMode_MAX =
+    FileOptions_OptimizeMode_OptimizeMode_MAX;
+  static const int OptimizeMode_ARRAYSIZE =
+    FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE;
+  static inline const ::google::protobuf::EnumDescriptor*
+  OptimizeMode_descriptor() {
+    return FileOptions_OptimizeMode_descriptor();
+  }
+  static inline const ::std::string& OptimizeMode_Name(OptimizeMode value) {
+    return FileOptions_OptimizeMode_Name(value);
+  }
+  static inline bool OptimizeMode_Parse(const ::std::string& name,
+      OptimizeMode* value) {
+    return FileOptions_OptimizeMode_Parse(name, value);
+  }
+
+  // accessors -------------------------------------------------------
+
+  // optional string java_package = 1;
+  inline bool has_java_package() const;
+  inline void clear_java_package();
+  static const int kJavaPackageFieldNumber = 1;
+  inline const ::std::string& java_package() const;
+  inline void set_java_package(const ::std::string& value);
+  inline void set_java_package(const char* value);
+  inline void set_java_package(const char* value, size_t size);
+  inline ::std::string* mutable_java_package();
+  inline ::std::string* release_java_package();
+  inline void set_allocated_java_package(::std::string* java_package);
+
+  // optional string java_outer_classname = 8;
+  inline bool has_java_outer_classname() const;
+  inline void clear_java_outer_classname();
+  static const int kJavaOuterClassnameFieldNumber = 8;
+  inline const ::std::string& java_outer_classname() const;
+  inline void set_java_outer_classname(const ::std::string& value);
+  inline void set_java_outer_classname(const char* value);
+  inline void set_java_outer_classname(const char* value, size_t size);
+  inline ::std::string* mutable_java_outer_classname();
+  inline ::std::string* release_java_outer_classname();
+  inline void set_allocated_java_outer_classname(::std::string* java_outer_classname);
+
+  // optional bool java_multiple_files = 10 [default = false];
+  inline bool has_java_multiple_files() const;
+  inline void clear_java_multiple_files();
+  static const int kJavaMultipleFilesFieldNumber = 10;
+  inline bool java_multiple_files() const;
+  inline void set_java_multiple_files(bool value);
+
+  // optional bool java_generate_equals_and_hash = 20 [default = false];
+  inline bool has_java_generate_equals_and_hash() const;
+  inline void clear_java_generate_equals_and_hash();
+  static const int kJavaGenerateEqualsAndHashFieldNumber = 20;
+  inline bool java_generate_equals_and_hash() const;
+  inline void set_java_generate_equals_and_hash(bool value);
+
+  // optional .google.protobuf.FileOptions.OptimizeMode optimize_for = 9 [default = SPEED];
+  inline bool has_optimize_for() const;
+  inline void clear_optimize_for();
+  static const int kOptimizeForFieldNumber = 9;
+  inline ::google::protobuf::FileOptions_OptimizeMode optimize_for() const;
+  inline void set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value);
+
+  // optional string go_package = 11;
+  inline bool has_go_package() const;
+  inline void clear_go_package();
+  static const int kGoPackageFieldNumber = 11;
+  inline const ::std::string& go_package() const;
+  inline void set_go_package(const ::std::string& value);
+  inline void set_go_package(const char* value);
+  inline void set_go_package(const char* value, size_t size);
+  inline ::std::string* mutable_go_package();
+  inline ::std::string* release_go_package();
+  inline void set_allocated_go_package(::std::string* go_package);
+
+  // optional bool cc_generic_services = 16 [default = false];
+  inline bool has_cc_generic_services() const;
+  inline void clear_cc_generic_services();
+  static const int kCcGenericServicesFieldNumber = 16;
+  inline bool cc_generic_services() const;
+  inline void set_cc_generic_services(bool value);
+
+  // optional bool java_generic_services = 17 [default = false];
+  inline bool has_java_generic_services() const;
+  inline void clear_java_generic_services();
+  static const int kJavaGenericServicesFieldNumber = 17;
+  inline bool java_generic_services() const;
+  inline void set_java_generic_services(bool value);
+
+  // optional bool py_generic_services = 18 [default = false];
+  inline bool has_py_generic_services() const;
+  inline void clear_py_generic_services();
+  static const int kPyGenericServicesFieldNumber = 18;
+  inline bool py_generic_services() const;
+  inline void set_py_generic_services(bool value);
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(FileOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.FileOptions)
+ private:
+  inline void set_has_java_package();
+  inline void clear_has_java_package();
+  inline void set_has_java_outer_classname();
+  inline void clear_has_java_outer_classname();
+  inline void set_has_java_multiple_files();
+  inline void clear_has_java_multiple_files();
+  inline void set_has_java_generate_equals_and_hash();
+  inline void clear_has_java_generate_equals_and_hash();
+  inline void set_has_optimize_for();
+  inline void clear_has_optimize_for();
+  inline void set_has_go_package();
+  inline void clear_has_go_package();
+  inline void set_has_cc_generic_services();
+  inline void clear_has_cc_generic_services();
+  inline void set_has_java_generic_services();
+  inline void clear_has_java_generic_services();
+  inline void set_has_py_generic_services();
+  inline void clear_has_py_generic_services();
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* java_package_;
+  ::std::string* java_outer_classname_;
+  int optimize_for_;
+  bool java_multiple_files_;
+  bool java_generate_equals_and_hash_;
+  bool cc_generic_services_;
+  bool java_generic_services_;
+  ::std::string* go_package_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+  bool py_generic_services_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(10 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static FileOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT MessageOptions : public ::google::protobuf::Message {
+ public:
+  MessageOptions();
+  virtual ~MessageOptions();
+
+  MessageOptions(const MessageOptions& from);
+
+  inline MessageOptions& operator=(const MessageOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const MessageOptions& default_instance();
+
+  void Swap(MessageOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  MessageOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const MessageOptions& from);
+  void MergeFrom(const MessageOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional bool message_set_wire_format = 1 [default = false];
+  inline bool has_message_set_wire_format() const;
+  inline void clear_message_set_wire_format();
+  static const int kMessageSetWireFormatFieldNumber = 1;
+  inline bool message_set_wire_format() const;
+  inline void set_message_set_wire_format(bool value);
+
+  // optional bool no_standard_descriptor_accessor = 2 [default = false];
+  inline bool has_no_standard_descriptor_accessor() const;
+  inline void clear_no_standard_descriptor_accessor();
+  static const int kNoStandardDescriptorAccessorFieldNumber = 2;
+  inline bool no_standard_descriptor_accessor() const;
+  inline void set_no_standard_descriptor_accessor(bool value);
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(MessageOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.MessageOptions)
+ private:
+  inline void set_has_message_set_wire_format();
+  inline void clear_has_message_set_wire_format();
+  inline void set_has_no_standard_descriptor_accessor();
+  inline void clear_has_no_standard_descriptor_accessor();
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+  bool message_set_wire_format_;
+  bool no_standard_descriptor_accessor_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static MessageOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT FieldOptions : public ::google::protobuf::Message {
+ public:
+  FieldOptions();
+  virtual ~FieldOptions();
+
+  FieldOptions(const FieldOptions& from);
+
+  inline FieldOptions& operator=(const FieldOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const FieldOptions& default_instance();
+
+  void Swap(FieldOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  FieldOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const FieldOptions& from);
+  void MergeFrom(const FieldOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef FieldOptions_CType CType;
+  static const CType STRING = FieldOptions_CType_STRING;
+  static const CType CORD = FieldOptions_CType_CORD;
+  static const CType STRING_PIECE = FieldOptions_CType_STRING_PIECE;
+  static inline bool CType_IsValid(int value) {
+    return FieldOptions_CType_IsValid(value);
+  }
+  static const CType CType_MIN =
+    FieldOptions_CType_CType_MIN;
+  static const CType CType_MAX =
+    FieldOptions_CType_CType_MAX;
+  static const int CType_ARRAYSIZE =
+    FieldOptions_CType_CType_ARRAYSIZE;
+  static inline const ::google::protobuf::EnumDescriptor*
+  CType_descriptor() {
+    return FieldOptions_CType_descriptor();
+  }
+  static inline const ::std::string& CType_Name(CType value) {
+    return FieldOptions_CType_Name(value);
+  }
+  static inline bool CType_Parse(const ::std::string& name,
+      CType* value) {
+    return FieldOptions_CType_Parse(name, value);
+  }
+
+  // accessors -------------------------------------------------------
+
+  // optional .google.protobuf.FieldOptions.CType ctype = 1 [default = STRING];
+  inline bool has_ctype() const;
+  inline void clear_ctype();
+  static const int kCtypeFieldNumber = 1;
+  inline ::google::protobuf::FieldOptions_CType ctype() const;
+  inline void set_ctype(::google::protobuf::FieldOptions_CType value);
+
+  // optional bool packed = 2;
+  inline bool has_packed() const;
+  inline void clear_packed();
+  static const int kPackedFieldNumber = 2;
+  inline bool packed() const;
+  inline void set_packed(bool value);
+
+  // optional bool lazy = 5 [default = false];
+  inline bool has_lazy() const;
+  inline void clear_lazy();
+  static const int kLazyFieldNumber = 5;
+  inline bool lazy() const;
+  inline void set_lazy(bool value);
+
+  // optional bool deprecated = 3 [default = false];
+  inline bool has_deprecated() const;
+  inline void clear_deprecated();
+  static const int kDeprecatedFieldNumber = 3;
+  inline bool deprecated() const;
+  inline void set_deprecated(bool value);
+
+  // optional string experimental_map_key = 9;
+  inline bool has_experimental_map_key() const;
+  inline void clear_experimental_map_key();
+  static const int kExperimentalMapKeyFieldNumber = 9;
+  inline const ::std::string& experimental_map_key() const;
+  inline void set_experimental_map_key(const ::std::string& value);
+  inline void set_experimental_map_key(const char* value);
+  inline void set_experimental_map_key(const char* value, size_t size);
+  inline ::std::string* mutable_experimental_map_key();
+  inline ::std::string* release_experimental_map_key();
+  inline void set_allocated_experimental_map_key(::std::string* experimental_map_key);
+
+  // optional bool weak = 10 [default = false];
+  inline bool has_weak() const;
+  inline void clear_weak();
+  static const int kWeakFieldNumber = 10;
+  inline bool weak() const;
+  inline void set_weak(bool value);
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(FieldOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.FieldOptions)
+ private:
+  inline void set_has_ctype();
+  inline void clear_has_ctype();
+  inline void set_has_packed();
+  inline void clear_has_packed();
+  inline void set_has_lazy();
+  inline void clear_has_lazy();
+  inline void set_has_deprecated();
+  inline void clear_has_deprecated();
+  inline void set_has_experimental_map_key();
+  inline void clear_has_experimental_map_key();
+  inline void set_has_weak();
+  inline void clear_has_weak();
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  int ctype_;
+  bool packed_;
+  bool lazy_;
+  bool deprecated_;
+  bool weak_;
+  ::std::string* experimental_map_key_;
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static FieldOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT EnumOptions : public ::google::protobuf::Message {
+ public:
+  EnumOptions();
+  virtual ~EnumOptions();
+
+  EnumOptions(const EnumOptions& from);
+
+  inline EnumOptions& operator=(const EnumOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const EnumOptions& default_instance();
+
+  void Swap(EnumOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  EnumOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const EnumOptions& from);
+  void MergeFrom(const EnumOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // optional bool allow_alias = 2 [default = true];
+  inline bool has_allow_alias() const;
+  inline void clear_allow_alias();
+  static const int kAllowAliasFieldNumber = 2;
+  inline bool allow_alias() const;
+  inline void set_allow_alias(bool value);
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(EnumOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.EnumOptions)
+ private:
+  inline void set_has_allow_alias();
+  inline void clear_has_allow_alias();
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+  bool allow_alias_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static EnumOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT EnumValueOptions : public ::google::protobuf::Message {
+ public:
+  EnumValueOptions();
+  virtual ~EnumValueOptions();
+
+  EnumValueOptions(const EnumValueOptions& from);
+
+  inline EnumValueOptions& operator=(const EnumValueOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const EnumValueOptions& default_instance();
+
+  void Swap(EnumValueOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  EnumValueOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const EnumValueOptions& from);
+  void MergeFrom(const EnumValueOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(EnumValueOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.EnumValueOptions)
+ private:
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static EnumValueOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT ServiceOptions : public ::google::protobuf::Message {
+ public:
+  ServiceOptions();
+  virtual ~ServiceOptions();
+
+  ServiceOptions(const ServiceOptions& from);
+
+  inline ServiceOptions& operator=(const ServiceOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const ServiceOptions& default_instance();
+
+  void Swap(ServiceOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  ServiceOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const ServiceOptions& from);
+  void MergeFrom(const ServiceOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(ServiceOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.ServiceOptions)
+ private:
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static ServiceOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT MethodOptions : public ::google::protobuf::Message {
+ public:
+  MethodOptions();
+  virtual ~MethodOptions();
+
+  MethodOptions(const MethodOptions& from);
+
+  inline MethodOptions& operator=(const MethodOptions& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const MethodOptions& default_instance();
+
+  void Swap(MethodOptions* other);
+
+  // implements Message ----------------------------------------------
+
+  MethodOptions* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const MethodOptions& from);
+  void MergeFrom(const MethodOptions& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+  inline int uninterpreted_option_size() const;
+  inline void clear_uninterpreted_option();
+  static const int kUninterpretedOptionFieldNumber = 999;
+  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
+  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
+  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+      uninterpreted_option() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+      mutable_uninterpreted_option();
+
+  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(MethodOptions)
+  // @@protoc_insertion_point(class_scope:google.protobuf.MethodOptions)
+ private:
+
+  ::google::protobuf::internal::ExtensionSet _extensions_;
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static MethodOptions* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT UninterpretedOption_NamePart : public ::google::protobuf::Message {
+ public:
+  UninterpretedOption_NamePart();
+  virtual ~UninterpretedOption_NamePart();
+
+  UninterpretedOption_NamePart(const UninterpretedOption_NamePart& from);
+
+  inline UninterpretedOption_NamePart& operator=(const UninterpretedOption_NamePart& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const UninterpretedOption_NamePart& default_instance();
+
+  void Swap(UninterpretedOption_NamePart* other);
+
+  // implements Message ----------------------------------------------
+
+  UninterpretedOption_NamePart* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const UninterpretedOption_NamePart& from);
+  void MergeFrom(const UninterpretedOption_NamePart& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // required string name_part = 1;
+  inline bool has_name_part() const;
+  inline void clear_name_part();
+  static const int kNamePartFieldNumber = 1;
+  inline const ::std::string& name_part() const;
+  inline void set_name_part(const ::std::string& value);
+  inline void set_name_part(const char* value);
+  inline void set_name_part(const char* value, size_t size);
+  inline ::std::string* mutable_name_part();
+  inline ::std::string* release_name_part();
+  inline void set_allocated_name_part(::std::string* name_part);
+
+  // required bool is_extension = 2;
+  inline bool has_is_extension() const;
+  inline void clear_is_extension();
+  static const int kIsExtensionFieldNumber = 2;
+  inline bool is_extension() const;
+  inline void set_is_extension(bool value);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.UninterpretedOption.NamePart)
+ private:
+  inline void set_has_name_part();
+  inline void clear_has_name_part();
+  inline void set_has_is_extension();
+  inline void clear_has_is_extension();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::std::string* name_part_;
+  bool is_extension_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static UninterpretedOption_NamePart* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT UninterpretedOption : public ::google::protobuf::Message {
+ public:
+  UninterpretedOption();
+  virtual ~UninterpretedOption();
+
+  UninterpretedOption(const UninterpretedOption& from);
+
+  inline UninterpretedOption& operator=(const UninterpretedOption& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const UninterpretedOption& default_instance();
+
+  void Swap(UninterpretedOption* other);
+
+  // implements Message ----------------------------------------------
+
+  UninterpretedOption* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const UninterpretedOption& from);
+  void MergeFrom(const UninterpretedOption& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef UninterpretedOption_NamePart NamePart;
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.UninterpretedOption.NamePart name = 2;
+  inline int name_size() const;
+  inline void clear_name();
+  static const int kNameFieldNumber = 2;
+  inline const ::google::protobuf::UninterpretedOption_NamePart& name(int index) const;
+  inline ::google::protobuf::UninterpretedOption_NamePart* mutable_name(int index);
+  inline ::google::protobuf::UninterpretedOption_NamePart* add_name();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >&
+      name() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >*
+      mutable_name();
+
+  // optional string identifier_value = 3;
+  inline bool has_identifier_value() const;
+  inline void clear_identifier_value();
+  static const int kIdentifierValueFieldNumber = 3;
+  inline const ::std::string& identifier_value() const;
+  inline void set_identifier_value(const ::std::string& value);
+  inline void set_identifier_value(const char* value);
+  inline void set_identifier_value(const char* value, size_t size);
+  inline ::std::string* mutable_identifier_value();
+  inline ::std::string* release_identifier_value();
+  inline void set_allocated_identifier_value(::std::string* identifier_value);
+
+  // optional uint64 positive_int_value = 4;
+  inline bool has_positive_int_value() const;
+  inline void clear_positive_int_value();
+  static const int kPositiveIntValueFieldNumber = 4;
+  inline ::google::protobuf::uint64 positive_int_value() const;
+  inline void set_positive_int_value(::google::protobuf::uint64 value);
+
+  // optional int64 negative_int_value = 5;
+  inline bool has_negative_int_value() const;
+  inline void clear_negative_int_value();
+  static const int kNegativeIntValueFieldNumber = 5;
+  inline ::google::protobuf::int64 negative_int_value() const;
+  inline void set_negative_int_value(::google::protobuf::int64 value);
+
+  // optional double double_value = 6;
+  inline bool has_double_value() const;
+  inline void clear_double_value();
+  static const int kDoubleValueFieldNumber = 6;
+  inline double double_value() const;
+  inline void set_double_value(double value);
+
+  // optional bytes string_value = 7;
+  inline bool has_string_value() const;
+  inline void clear_string_value();
+  static const int kStringValueFieldNumber = 7;
+  inline const ::std::string& string_value() const;
+  inline void set_string_value(const ::std::string& value);
+  inline void set_string_value(const char* value);
+  inline void set_string_value(const void* value, size_t size);
+  inline ::std::string* mutable_string_value();
+  inline ::std::string* release_string_value();
+  inline void set_allocated_string_value(::std::string* string_value);
+
+  // optional string aggregate_value = 8;
+  inline bool has_aggregate_value() const;
+  inline void clear_aggregate_value();
+  static const int kAggregateValueFieldNumber = 8;
+  inline const ::std::string& aggregate_value() const;
+  inline void set_aggregate_value(const ::std::string& value);
+  inline void set_aggregate_value(const char* value);
+  inline void set_aggregate_value(const char* value, size_t size);
+  inline ::std::string* mutable_aggregate_value();
+  inline ::std::string* release_aggregate_value();
+  inline void set_allocated_aggregate_value(::std::string* aggregate_value);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.UninterpretedOption)
+ private:
+  inline void set_has_identifier_value();
+  inline void clear_has_identifier_value();
+  inline void set_has_positive_int_value();
+  inline void clear_has_positive_int_value();
+  inline void set_has_negative_int_value();
+  inline void clear_has_negative_int_value();
+  inline void set_has_double_value();
+  inline void clear_has_double_value();
+  inline void set_has_string_value();
+  inline void clear_has_string_value();
+  inline void set_has_aggregate_value();
+  inline void clear_has_aggregate_value();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart > name_;
+  ::std::string* identifier_value_;
+  ::google::protobuf::uint64 positive_int_value_;
+  ::google::protobuf::int64 negative_int_value_;
+  double double_value_;
+  ::std::string* string_value_;
+  ::std::string* aggregate_value_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static UninterpretedOption* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT SourceCodeInfo_Location : public ::google::protobuf::Message {
+ public:
+  SourceCodeInfo_Location();
+  virtual ~SourceCodeInfo_Location();
+
+  SourceCodeInfo_Location(const SourceCodeInfo_Location& from);
+
+  inline SourceCodeInfo_Location& operator=(const SourceCodeInfo_Location& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const SourceCodeInfo_Location& default_instance();
+
+  void Swap(SourceCodeInfo_Location* other);
+
+  // implements Message ----------------------------------------------
+
+  SourceCodeInfo_Location* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const SourceCodeInfo_Location& from);
+  void MergeFrom(const SourceCodeInfo_Location& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  // accessors -------------------------------------------------------
+
+  // repeated int32 path = 1 [packed = true];
+  inline int path_size() const;
+  inline void clear_path();
+  static const int kPathFieldNumber = 1;
+  inline ::google::protobuf::int32 path(int index) const;
+  inline void set_path(int index, ::google::protobuf::int32 value);
+  inline void add_path(::google::protobuf::int32 value);
+  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+      path() const;
+  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+      mutable_path();
+
+  // repeated int32 span = 2 [packed = true];
+  inline int span_size() const;
+  inline void clear_span();
+  static const int kSpanFieldNumber = 2;
+  inline ::google::protobuf::int32 span(int index) const;
+  inline void set_span(int index, ::google::protobuf::int32 value);
+  inline void add_span(::google::protobuf::int32 value);
+  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+      span() const;
+  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+      mutable_span();
+
+  // optional string leading_comments = 3;
+  inline bool has_leading_comments() const;
+  inline void clear_leading_comments();
+  static const int kLeadingCommentsFieldNumber = 3;
+  inline const ::std::string& leading_comments() const;
+  inline void set_leading_comments(const ::std::string& value);
+  inline void set_leading_comments(const char* value);
+  inline void set_leading_comments(const char* value, size_t size);
+  inline ::std::string* mutable_leading_comments();
+  inline ::std::string* release_leading_comments();
+  inline void set_allocated_leading_comments(::std::string* leading_comments);
+
+  // optional string trailing_comments = 4;
+  inline bool has_trailing_comments() const;
+  inline void clear_trailing_comments();
+  static const int kTrailingCommentsFieldNumber = 4;
+  inline const ::std::string& trailing_comments() const;
+  inline void set_trailing_comments(const ::std::string& value);
+  inline void set_trailing_comments(const char* value);
+  inline void set_trailing_comments(const char* value, size_t size);
+  inline ::std::string* mutable_trailing_comments();
+  inline ::std::string* release_trailing_comments();
+  inline void set_allocated_trailing_comments(::std::string* trailing_comments);
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.SourceCodeInfo.Location)
+ private:
+  inline void set_has_leading_comments();
+  inline void clear_has_leading_comments();
+  inline void set_has_trailing_comments();
+  inline void clear_has_trailing_comments();
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > path_;
+  mutable int _path_cached_byte_size_;
+  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > span_;
+  mutable int _span_cached_byte_size_;
+  ::std::string* leading_comments_;
+  ::std::string* trailing_comments_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(4 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static SourceCodeInfo_Location* default_instance_;
+};
+// -------------------------------------------------------------------
+
+class LIBPROTOBUF_EXPORT SourceCodeInfo : public ::google::protobuf::Message {
+ public:
+  SourceCodeInfo();
+  virtual ~SourceCodeInfo();
+
+  SourceCodeInfo(const SourceCodeInfo& from);
+
+  inline SourceCodeInfo& operator=(const SourceCodeInfo& from) {
+    CopyFrom(from);
+    return *this;
+  }
+
+  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
+    return _unknown_fields_;
+  }
+
+  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
+    return &_unknown_fields_;
+  }
+
+  static const ::google::protobuf::Descriptor* descriptor();
+  static const SourceCodeInfo& default_instance();
+
+  void Swap(SourceCodeInfo* other);
+
+  // implements Message ----------------------------------------------
+
+  SourceCodeInfo* New() const;
+  void CopyFrom(const ::google::protobuf::Message& from);
+  void MergeFrom(const ::google::protobuf::Message& from);
+  void CopyFrom(const SourceCodeInfo& from);
+  void MergeFrom(const SourceCodeInfo& from);
+  void Clear();
+  bool IsInitialized() const;
+
+  int ByteSize() const;
+  bool MergePartialFromCodedStream(
+      ::google::protobuf::io::CodedInputStream* input);
+  void SerializeWithCachedSizes(
+      ::google::protobuf::io::CodedOutputStream* output) const;
+  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
+  int GetCachedSize() const { return _cached_size_; }
+  private:
+  void SharedCtor();
+  void SharedDtor();
+  void SetCachedSize(int size) const;
+  public:
+
+  ::google::protobuf::Metadata GetMetadata() const;
+
+  // nested types ----------------------------------------------------
+
+  typedef SourceCodeInfo_Location Location;
+
+  // accessors -------------------------------------------------------
+
+  // repeated .google.protobuf.SourceCodeInfo.Location location = 1;
+  inline int location_size() const;
+  inline void clear_location();
+  static const int kLocationFieldNumber = 1;
+  inline const ::google::protobuf::SourceCodeInfo_Location& location(int index) const;
+  inline ::google::protobuf::SourceCodeInfo_Location* mutable_location(int index);
+  inline ::google::protobuf::SourceCodeInfo_Location* add_location();
+  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >&
+      location() const;
+  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >*
+      mutable_location();
+
+  // @@protoc_insertion_point(class_scope:google.protobuf.SourceCodeInfo)
+ private:
+
+  ::google::protobuf::UnknownFieldSet _unknown_fields_;
+
+  ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location > location_;
+
+  mutable int _cached_size_;
+  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
+
+  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
+  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
+
+  void InitAsDefaultInstance();
+  static SourceCodeInfo* default_instance_;
+};
+// ===================================================================
+
+
+// ===================================================================
+
+// FileDescriptorSet
+
+// repeated .google.protobuf.FileDescriptorProto file = 1;
+inline int FileDescriptorSet::file_size() const {
+  return file_.size();
+}
+inline void FileDescriptorSet::clear_file() {
+  file_.Clear();
+}
+inline const ::google::protobuf::FileDescriptorProto& FileDescriptorSet::file(int index) const {
+  return file_.Get(index);
+}
+inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::mutable_file(int index) {
+  return file_.Mutable(index);
+}
+inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::add_file() {
+  return file_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
+FileDescriptorSet::file() const {
+  return file_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
+FileDescriptorSet::mutable_file() {
+  return &file_;
+}
+
+// -------------------------------------------------------------------
+
+// FileDescriptorProto
+
+// optional string name = 1;
+inline bool FileDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void FileDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void FileDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void FileDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& FileDescriptorProto::name() const {
+  return *name_;
+}
+inline void FileDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void FileDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void FileDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* FileDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FileDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string package = 2;
+inline bool FileDescriptorProto::has_package() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void FileDescriptorProto::set_has_package() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void FileDescriptorProto::clear_has_package() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void FileDescriptorProto::clear_package() {
+  if (package_ != &::google::protobuf::internal::kEmptyString) {
+    package_->clear();
+  }
+  clear_has_package();
+}
+inline const ::std::string& FileDescriptorProto::package() const {
+  return *package_;
+}
+inline void FileDescriptorProto::set_package(const ::std::string& value) {
+  set_has_package();
+  if (package_ == &::google::protobuf::internal::kEmptyString) {
+    package_ = new ::std::string;
+  }
+  package_->assign(value);
+}
+inline void FileDescriptorProto::set_package(const char* value) {
+  set_has_package();
+  if (package_ == &::google::protobuf::internal::kEmptyString) {
+    package_ = new ::std::string;
+  }
+  package_->assign(value);
+}
+inline void FileDescriptorProto::set_package(const char* value, size_t size) {
+  set_has_package();
+  if (package_ == &::google::protobuf::internal::kEmptyString) {
+    package_ = new ::std::string;
+  }
+  package_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileDescriptorProto::mutable_package() {
+  set_has_package();
+  if (package_ == &::google::protobuf::internal::kEmptyString) {
+    package_ = new ::std::string;
+  }
+  return package_;
+}
+inline ::std::string* FileDescriptorProto::release_package() {
+  clear_has_package();
+  if (package_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = package_;
+    package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FileDescriptorProto::set_allocated_package(::std::string* package) {
+  if (package_ != &::google::protobuf::internal::kEmptyString) {
+    delete package_;
+  }
+  if (package) {
+    set_has_package();
+    package_ = package;
+  } else {
+    clear_has_package();
+    package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated string dependency = 3;
+inline int FileDescriptorProto::dependency_size() const {
+  return dependency_.size();
+}
+inline void FileDescriptorProto::clear_dependency() {
+  dependency_.Clear();
+}
+inline const ::std::string& FileDescriptorProto::dependency(int index) const {
+  return dependency_.Get(index);
+}
+inline ::std::string* FileDescriptorProto::mutable_dependency(int index) {
+  return dependency_.Mutable(index);
+}
+inline void FileDescriptorProto::set_dependency(int index, const ::std::string& value) {
+  dependency_.Mutable(index)->assign(value);
+}
+inline void FileDescriptorProto::set_dependency(int index, const char* value) {
+  dependency_.Mutable(index)->assign(value);
+}
+inline void FileDescriptorProto::set_dependency(int index, const char* value, size_t size) {
+  dependency_.Mutable(index)->assign(
+    reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileDescriptorProto::add_dependency() {
+  return dependency_.Add();
+}
+inline void FileDescriptorProto::add_dependency(const ::std::string& value) {
+  dependency_.Add()->assign(value);
+}
+inline void FileDescriptorProto::add_dependency(const char* value) {
+  dependency_.Add()->assign(value);
+}
+inline void FileDescriptorProto::add_dependency(const char* value, size_t size) {
+  dependency_.Add()->assign(reinterpret_cast<const char*>(value), size);
+}
+inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
+FileDescriptorProto::dependency() const {
+  return dependency_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::std::string>*
+FileDescriptorProto::mutable_dependency() {
+  return &dependency_;
+}
+
+// repeated int32 public_dependency = 10;
+inline int FileDescriptorProto::public_dependency_size() const {
+  return public_dependency_.size();
+}
+inline void FileDescriptorProto::clear_public_dependency() {
+  public_dependency_.Clear();
+}
+inline ::google::protobuf::int32 FileDescriptorProto::public_dependency(int index) const {
+  return public_dependency_.Get(index);
+}
+inline void FileDescriptorProto::set_public_dependency(int index, ::google::protobuf::int32 value) {
+  public_dependency_.Set(index, value);
+}
+inline void FileDescriptorProto::add_public_dependency(::google::protobuf::int32 value) {
+  public_dependency_.Add(value);
+}
+inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+FileDescriptorProto::public_dependency() const {
+  return public_dependency_;
+}
+inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+FileDescriptorProto::mutable_public_dependency() {
+  return &public_dependency_;
+}
+
+// repeated int32 weak_dependency = 11;
+inline int FileDescriptorProto::weak_dependency_size() const {
+  return weak_dependency_.size();
+}
+inline void FileDescriptorProto::clear_weak_dependency() {
+  weak_dependency_.Clear();
+}
+inline ::google::protobuf::int32 FileDescriptorProto::weak_dependency(int index) const {
+  return weak_dependency_.Get(index);
+}
+inline void FileDescriptorProto::set_weak_dependency(int index, ::google::protobuf::int32 value) {
+  weak_dependency_.Set(index, value);
+}
+inline void FileDescriptorProto::add_weak_dependency(::google::protobuf::int32 value) {
+  weak_dependency_.Add(value);
+}
+inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+FileDescriptorProto::weak_dependency() const {
+  return weak_dependency_;
+}
+inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+FileDescriptorProto::mutable_weak_dependency() {
+  return &weak_dependency_;
+}
+
+// repeated .google.protobuf.DescriptorProto message_type = 4;
+inline int FileDescriptorProto::message_type_size() const {
+  return message_type_.size();
+}
+inline void FileDescriptorProto::clear_message_type() {
+  message_type_.Clear();
+}
+inline const ::google::protobuf::DescriptorProto& FileDescriptorProto::message_type(int index) const {
+  return message_type_.Get(index);
+}
+inline ::google::protobuf::DescriptorProto* FileDescriptorProto::mutable_message_type(int index) {
+  return message_type_.Mutable(index);
+}
+inline ::google::protobuf::DescriptorProto* FileDescriptorProto::add_message_type() {
+  return message_type_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
+FileDescriptorProto::message_type() const {
+  return message_type_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
+FileDescriptorProto::mutable_message_type() {
+  return &message_type_;
+}
+
+// repeated .google.protobuf.EnumDescriptorProto enum_type = 5;
+inline int FileDescriptorProto::enum_type_size() const {
+  return enum_type_.size();
+}
+inline void FileDescriptorProto::clear_enum_type() {
+  enum_type_.Clear();
+}
+inline const ::google::protobuf::EnumDescriptorProto& FileDescriptorProto::enum_type(int index) const {
+  return enum_type_.Get(index);
+}
+inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::mutable_enum_type(int index) {
+  return enum_type_.Mutable(index);
+}
+inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::add_enum_type() {
+  return enum_type_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
+FileDescriptorProto::enum_type() const {
+  return enum_type_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
+FileDescriptorProto::mutable_enum_type() {
+  return &enum_type_;
+}
+
+// repeated .google.protobuf.ServiceDescriptorProto service = 6;
+inline int FileDescriptorProto::service_size() const {
+  return service_.size();
+}
+inline void FileDescriptorProto::clear_service() {
+  service_.Clear();
+}
+inline const ::google::protobuf::ServiceDescriptorProto& FileDescriptorProto::service(int index) const {
+  return service_.Get(index);
+}
+inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::mutable_service(int index) {
+  return service_.Mutable(index);
+}
+inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::add_service() {
+  return service_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >&
+FileDescriptorProto::service() const {
+  return service_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >*
+FileDescriptorProto::mutable_service() {
+  return &service_;
+}
+
+// repeated .google.protobuf.FieldDescriptorProto extension = 7;
+inline int FileDescriptorProto::extension_size() const {
+  return extension_.size();
+}
+inline void FileDescriptorProto::clear_extension() {
+  extension_.Clear();
+}
+inline const ::google::protobuf::FieldDescriptorProto& FileDescriptorProto::extension(int index) const {
+  return extension_.Get(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::mutable_extension(int index) {
+  return extension_.Mutable(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::add_extension() {
+  return extension_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+FileDescriptorProto::extension() const {
+  return extension_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+FileDescriptorProto::mutable_extension() {
+  return &extension_;
+}
+
+// optional .google.protobuf.FileOptions options = 8;
+inline bool FileDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000200u) != 0;
+}
+inline void FileDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000200u;
+}
+inline void FileDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000200u;
+}
+inline void FileDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::FileOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::FileOptions& FileDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::FileOptions* FileDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::FileOptions;
+  return options_;
+}
+inline ::google::protobuf::FileOptions* FileDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::FileOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void FileDescriptorProto::set_allocated_options(::google::protobuf::FileOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// optional .google.protobuf.SourceCodeInfo source_code_info = 9;
+inline bool FileDescriptorProto::has_source_code_info() const {
+  return (_has_bits_[0] & 0x00000400u) != 0;
+}
+inline void FileDescriptorProto::set_has_source_code_info() {
+  _has_bits_[0] |= 0x00000400u;
+}
+inline void FileDescriptorProto::clear_has_source_code_info() {
+  _has_bits_[0] &= ~0x00000400u;
+}
+inline void FileDescriptorProto::clear_source_code_info() {
+  if (source_code_info_ != NULL) source_code_info_->::google::protobuf::SourceCodeInfo::Clear();
+  clear_has_source_code_info();
+}
+inline const ::google::protobuf::SourceCodeInfo& FileDescriptorProto::source_code_info() const {
+  return source_code_info_ != NULL ? *source_code_info_ : *default_instance_->source_code_info_;
+}
+inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::mutable_source_code_info() {
+  set_has_source_code_info();
+  if (source_code_info_ == NULL) source_code_info_ = new ::google::protobuf::SourceCodeInfo;
+  return source_code_info_;
+}
+inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::release_source_code_info() {
+  clear_has_source_code_info();
+  ::google::protobuf::SourceCodeInfo* temp = source_code_info_;
+  source_code_info_ = NULL;
+  return temp;
+}
+inline void FileDescriptorProto::set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info) {
+  delete source_code_info_;
+  source_code_info_ = source_code_info;
+  if (source_code_info) {
+    set_has_source_code_info();
+  } else {
+    clear_has_source_code_info();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// DescriptorProto_ExtensionRange
+
+// optional int32 start = 1;
+inline bool DescriptorProto_ExtensionRange::has_start() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void DescriptorProto_ExtensionRange::set_has_start() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void DescriptorProto_ExtensionRange::clear_has_start() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void DescriptorProto_ExtensionRange::clear_start() {
+  start_ = 0;
+  clear_has_start();
+}
+inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::start() const {
+  return start_;
+}
+inline void DescriptorProto_ExtensionRange::set_start(::google::protobuf::int32 value) {
+  set_has_start();
+  start_ = value;
+}
+
+// optional int32 end = 2;
+inline bool DescriptorProto_ExtensionRange::has_end() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void DescriptorProto_ExtensionRange::set_has_end() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void DescriptorProto_ExtensionRange::clear_has_end() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void DescriptorProto_ExtensionRange::clear_end() {
+  end_ = 0;
+  clear_has_end();
+}
+inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::end() const {
+  return end_;
+}
+inline void DescriptorProto_ExtensionRange::set_end(::google::protobuf::int32 value) {
+  set_has_end();
+  end_ = value;
+}
+
+// -------------------------------------------------------------------
+
+// DescriptorProto
+
+// optional string name = 1;
+inline bool DescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void DescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void DescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void DescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& DescriptorProto::name() const {
+  return *name_;
+}
+inline void DescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void DescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void DescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* DescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* DescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void DescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated .google.protobuf.FieldDescriptorProto field = 2;
+inline int DescriptorProto::field_size() const {
+  return field_.size();
+}
+inline void DescriptorProto::clear_field() {
+  field_.Clear();
+}
+inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::field(int index) const {
+  return field_.Get(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_field(int index) {
+  return field_.Mutable(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_field() {
+  return field_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+DescriptorProto::field() const {
+  return field_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+DescriptorProto::mutable_field() {
+  return &field_;
+}
+
+// repeated .google.protobuf.FieldDescriptorProto extension = 6;
+inline int DescriptorProto::extension_size() const {
+  return extension_.size();
+}
+inline void DescriptorProto::clear_extension() {
+  extension_.Clear();
+}
+inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::extension(int index) const {
+  return extension_.Get(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_extension(int index) {
+  return extension_.Mutable(index);
+}
+inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_extension() {
+  return extension_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
+DescriptorProto::extension() const {
+  return extension_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
+DescriptorProto::mutable_extension() {
+  return &extension_;
+}
+
+// repeated .google.protobuf.DescriptorProto nested_type = 3;
+inline int DescriptorProto::nested_type_size() const {
+  return nested_type_.size();
+}
+inline void DescriptorProto::clear_nested_type() {
+  nested_type_.Clear();
+}
+inline const ::google::protobuf::DescriptorProto& DescriptorProto::nested_type(int index) const {
+  return nested_type_.Get(index);
+}
+inline ::google::protobuf::DescriptorProto* DescriptorProto::mutable_nested_type(int index) {
+  return nested_type_.Mutable(index);
+}
+inline ::google::protobuf::DescriptorProto* DescriptorProto::add_nested_type() {
+  return nested_type_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
+DescriptorProto::nested_type() const {
+  return nested_type_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
+DescriptorProto::mutable_nested_type() {
+  return &nested_type_;
+}
+
+// repeated .google.protobuf.EnumDescriptorProto enum_type = 4;
+inline int DescriptorProto::enum_type_size() const {
+  return enum_type_.size();
+}
+inline void DescriptorProto::clear_enum_type() {
+  enum_type_.Clear();
+}
+inline const ::google::protobuf::EnumDescriptorProto& DescriptorProto::enum_type(int index) const {
+  return enum_type_.Get(index);
+}
+inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::mutable_enum_type(int index) {
+  return enum_type_.Mutable(index);
+}
+inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::add_enum_type() {
+  return enum_type_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
+DescriptorProto::enum_type() const {
+  return enum_type_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
+DescriptorProto::mutable_enum_type() {
+  return &enum_type_;
+}
+
+// repeated .google.protobuf.DescriptorProto.ExtensionRange extension_range = 5;
+inline int DescriptorProto::extension_range_size() const {
+  return extension_range_.size();
+}
+inline void DescriptorProto::clear_extension_range() {
+  extension_range_.Clear();
+}
+inline const ::google::protobuf::DescriptorProto_ExtensionRange& DescriptorProto::extension_range(int index) const {
+  return extension_range_.Get(index);
+}
+inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::mutable_extension_range(int index) {
+  return extension_range_.Mutable(index);
+}
+inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::add_extension_range() {
+  return extension_range_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >&
+DescriptorProto::extension_range() const {
+  return extension_range_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >*
+DescriptorProto::mutable_extension_range() {
+  return &extension_range_;
+}
+
+// optional .google.protobuf.MessageOptions options = 7;
+inline bool DescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000040u) != 0;
+}
+inline void DescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000040u;
+}
+inline void DescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000040u;
+}
+inline void DescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::MessageOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::MessageOptions& DescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::MessageOptions* DescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::MessageOptions;
+  return options_;
+}
+inline ::google::protobuf::MessageOptions* DescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::MessageOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void DescriptorProto::set_allocated_options(::google::protobuf::MessageOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// FieldDescriptorProto
+
+// optional string name = 1;
+inline bool FieldDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void FieldDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void FieldDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void FieldDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& FieldDescriptorProto::name() const {
+  return *name_;
+}
+inline void FieldDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void FieldDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void FieldDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FieldDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* FieldDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FieldDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional int32 number = 3;
+inline bool FieldDescriptorProto::has_number() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void FieldDescriptorProto::set_has_number() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void FieldDescriptorProto::clear_has_number() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void FieldDescriptorProto::clear_number() {
+  number_ = 0;
+  clear_has_number();
+}
+inline ::google::protobuf::int32 FieldDescriptorProto::number() const {
+  return number_;
+}
+inline void FieldDescriptorProto::set_number(::google::protobuf::int32 value) {
+  set_has_number();
+  number_ = value;
+}
+
+// optional .google.protobuf.FieldDescriptorProto.Label label = 4;
+inline bool FieldDescriptorProto::has_label() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void FieldDescriptorProto::set_has_label() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void FieldDescriptorProto::clear_has_label() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void FieldDescriptorProto::clear_label() {
+  label_ = 1;
+  clear_has_label();
+}
+inline ::google::protobuf::FieldDescriptorProto_Label FieldDescriptorProto::label() const {
+  return static_cast< ::google::protobuf::FieldDescriptorProto_Label >(label_);
+}
+inline void FieldDescriptorProto::set_label(::google::protobuf::FieldDescriptorProto_Label value) {
+  assert(::google::protobuf::FieldDescriptorProto_Label_IsValid(value));
+  set_has_label();
+  label_ = value;
+}
+
+// optional .google.protobuf.FieldDescriptorProto.Type type = 5;
+inline bool FieldDescriptorProto::has_type() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void FieldDescriptorProto::set_has_type() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void FieldDescriptorProto::clear_has_type() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void FieldDescriptorProto::clear_type() {
+  type_ = 1;
+  clear_has_type();
+}
+inline ::google::protobuf::FieldDescriptorProto_Type FieldDescriptorProto::type() const {
+  return static_cast< ::google::protobuf::FieldDescriptorProto_Type >(type_);
+}
+inline void FieldDescriptorProto::set_type(::google::protobuf::FieldDescriptorProto_Type value) {
+  assert(::google::protobuf::FieldDescriptorProto_Type_IsValid(value));
+  set_has_type();
+  type_ = value;
+}
+
+// optional string type_name = 6;
+inline bool FieldDescriptorProto::has_type_name() const {
+  return (_has_bits_[0] & 0x00000010u) != 0;
+}
+inline void FieldDescriptorProto::set_has_type_name() {
+  _has_bits_[0] |= 0x00000010u;
+}
+inline void FieldDescriptorProto::clear_has_type_name() {
+  _has_bits_[0] &= ~0x00000010u;
+}
+inline void FieldDescriptorProto::clear_type_name() {
+  if (type_name_ != &::google::protobuf::internal::kEmptyString) {
+    type_name_->clear();
+  }
+  clear_has_type_name();
+}
+inline const ::std::string& FieldDescriptorProto::type_name() const {
+  return *type_name_;
+}
+inline void FieldDescriptorProto::set_type_name(const ::std::string& value) {
+  set_has_type_name();
+  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
+    type_name_ = new ::std::string;
+  }
+  type_name_->assign(value);
+}
+inline void FieldDescriptorProto::set_type_name(const char* value) {
+  set_has_type_name();
+  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
+    type_name_ = new ::std::string;
+  }
+  type_name_->assign(value);
+}
+inline void FieldDescriptorProto::set_type_name(const char* value, size_t size) {
+  set_has_type_name();
+  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
+    type_name_ = new ::std::string;
+  }
+  type_name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FieldDescriptorProto::mutable_type_name() {
+  set_has_type_name();
+  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
+    type_name_ = new ::std::string;
+  }
+  return type_name_;
+}
+inline ::std::string* FieldDescriptorProto::release_type_name() {
+  clear_has_type_name();
+  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = type_name_;
+    type_name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FieldDescriptorProto::set_allocated_type_name(::std::string* type_name) {
+  if (type_name_ != &::google::protobuf::internal::kEmptyString) {
+    delete type_name_;
+  }
+  if (type_name) {
+    set_has_type_name();
+    type_name_ = type_name;
+  } else {
+    clear_has_type_name();
+    type_name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string extendee = 2;
+inline bool FieldDescriptorProto::has_extendee() const {
+  return (_has_bits_[0] & 0x00000020u) != 0;
+}
+inline void FieldDescriptorProto::set_has_extendee() {
+  _has_bits_[0] |= 0x00000020u;
+}
+inline void FieldDescriptorProto::clear_has_extendee() {
+  _has_bits_[0] &= ~0x00000020u;
+}
+inline void FieldDescriptorProto::clear_extendee() {
+  if (extendee_ != &::google::protobuf::internal::kEmptyString) {
+    extendee_->clear();
+  }
+  clear_has_extendee();
+}
+inline const ::std::string& FieldDescriptorProto::extendee() const {
+  return *extendee_;
+}
+inline void FieldDescriptorProto::set_extendee(const ::std::string& value) {
+  set_has_extendee();
+  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
+    extendee_ = new ::std::string;
+  }
+  extendee_->assign(value);
+}
+inline void FieldDescriptorProto::set_extendee(const char* value) {
+  set_has_extendee();
+  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
+    extendee_ = new ::std::string;
+  }
+  extendee_->assign(value);
+}
+inline void FieldDescriptorProto::set_extendee(const char* value, size_t size) {
+  set_has_extendee();
+  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
+    extendee_ = new ::std::string;
+  }
+  extendee_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FieldDescriptorProto::mutable_extendee() {
+  set_has_extendee();
+  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
+    extendee_ = new ::std::string;
+  }
+  return extendee_;
+}
+inline ::std::string* FieldDescriptorProto::release_extendee() {
+  clear_has_extendee();
+  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = extendee_;
+    extendee_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FieldDescriptorProto::set_allocated_extendee(::std::string* extendee) {
+  if (extendee_ != &::google::protobuf::internal::kEmptyString) {
+    delete extendee_;
+  }
+  if (extendee) {
+    set_has_extendee();
+    extendee_ = extendee;
+  } else {
+    clear_has_extendee();
+    extendee_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string default_value = 7;
+inline bool FieldDescriptorProto::has_default_value() const {
+  return (_has_bits_[0] & 0x00000040u) != 0;
+}
+inline void FieldDescriptorProto::set_has_default_value() {
+  _has_bits_[0] |= 0x00000040u;
+}
+inline void FieldDescriptorProto::clear_has_default_value() {
+  _has_bits_[0] &= ~0x00000040u;
+}
+inline void FieldDescriptorProto::clear_default_value() {
+  if (default_value_ != &::google::protobuf::internal::kEmptyString) {
+    default_value_->clear();
+  }
+  clear_has_default_value();
+}
+inline const ::std::string& FieldDescriptorProto::default_value() const {
+  return *default_value_;
+}
+inline void FieldDescriptorProto::set_default_value(const ::std::string& value) {
+  set_has_default_value();
+  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
+    default_value_ = new ::std::string;
+  }
+  default_value_->assign(value);
+}
+inline void FieldDescriptorProto::set_default_value(const char* value) {
+  set_has_default_value();
+  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
+    default_value_ = new ::std::string;
+  }
+  default_value_->assign(value);
+}
+inline void FieldDescriptorProto::set_default_value(const char* value, size_t size) {
+  set_has_default_value();
+  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
+    default_value_ = new ::std::string;
+  }
+  default_value_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FieldDescriptorProto::mutable_default_value() {
+  set_has_default_value();
+  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
+    default_value_ = new ::std::string;
+  }
+  return default_value_;
+}
+inline ::std::string* FieldDescriptorProto::release_default_value() {
+  clear_has_default_value();
+  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = default_value_;
+    default_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FieldDescriptorProto::set_allocated_default_value(::std::string* default_value) {
+  if (default_value_ != &::google::protobuf::internal::kEmptyString) {
+    delete default_value_;
+  }
+  if (default_value) {
+    set_has_default_value();
+    default_value_ = default_value;
+  } else {
+    clear_has_default_value();
+    default_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional .google.protobuf.FieldOptions options = 8;
+inline bool FieldDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000080u) != 0;
+}
+inline void FieldDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000080u;
+}
+inline void FieldDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000080u;
+}
+inline void FieldDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::FieldOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::FieldOptions& FieldDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::FieldOptions* FieldDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::FieldOptions;
+  return options_;
+}
+inline ::google::protobuf::FieldOptions* FieldDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::FieldOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void FieldDescriptorProto::set_allocated_options(::google::protobuf::FieldOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// EnumDescriptorProto
+
+// optional string name = 1;
+inline bool EnumDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void EnumDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void EnumDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void EnumDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& EnumDescriptorProto::name() const {
+  return *name_;
+}
+inline void EnumDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void EnumDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void EnumDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* EnumDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* EnumDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void EnumDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated .google.protobuf.EnumValueDescriptorProto value = 2;
+inline int EnumDescriptorProto::value_size() const {
+  return value_.size();
+}
+inline void EnumDescriptorProto::clear_value() {
+  value_.Clear();
+}
+inline const ::google::protobuf::EnumValueDescriptorProto& EnumDescriptorProto::value(int index) const {
+  return value_.Get(index);
+}
+inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::mutable_value(int index) {
+  return value_.Mutable(index);
+}
+inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::add_value() {
+  return value_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >&
+EnumDescriptorProto::value() const {
+  return value_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >*
+EnumDescriptorProto::mutable_value() {
+  return &value_;
+}
+
+// optional .google.protobuf.EnumOptions options = 3;
+inline bool EnumDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void EnumDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void EnumDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void EnumDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::EnumOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::EnumOptions& EnumDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::EnumOptions* EnumDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::EnumOptions;
+  return options_;
+}
+inline ::google::protobuf::EnumOptions* EnumDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::EnumOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void EnumDescriptorProto::set_allocated_options(::google::protobuf::EnumOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// EnumValueDescriptorProto
+
+// optional string name = 1;
+inline bool EnumValueDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void EnumValueDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void EnumValueDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void EnumValueDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& EnumValueDescriptorProto::name() const {
+  return *name_;
+}
+inline void EnumValueDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void EnumValueDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void EnumValueDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* EnumValueDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* EnumValueDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void EnumValueDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional int32 number = 2;
+inline bool EnumValueDescriptorProto::has_number() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void EnumValueDescriptorProto::set_has_number() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void EnumValueDescriptorProto::clear_has_number() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void EnumValueDescriptorProto::clear_number() {
+  number_ = 0;
+  clear_has_number();
+}
+inline ::google::protobuf::int32 EnumValueDescriptorProto::number() const {
+  return number_;
+}
+inline void EnumValueDescriptorProto::set_number(::google::protobuf::int32 value) {
+  set_has_number();
+  number_ = value;
+}
+
+// optional .google.protobuf.EnumValueOptions options = 3;
+inline bool EnumValueDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void EnumValueDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void EnumValueDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void EnumValueDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::EnumValueOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::EnumValueOptions& EnumValueDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::EnumValueOptions;
+  return options_;
+}
+inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::EnumValueOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void EnumValueDescriptorProto::set_allocated_options(::google::protobuf::EnumValueOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// ServiceDescriptorProto
+
+// optional string name = 1;
+inline bool ServiceDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void ServiceDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void ServiceDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void ServiceDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& ServiceDescriptorProto::name() const {
+  return *name_;
+}
+inline void ServiceDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void ServiceDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void ServiceDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* ServiceDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* ServiceDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void ServiceDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// repeated .google.protobuf.MethodDescriptorProto method = 2;
+inline int ServiceDescriptorProto::method_size() const {
+  return method_.size();
+}
+inline void ServiceDescriptorProto::clear_method() {
+  method_.Clear();
+}
+inline const ::google::protobuf::MethodDescriptorProto& ServiceDescriptorProto::method(int index) const {
+  return method_.Get(index);
+}
+inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::mutable_method(int index) {
+  return method_.Mutable(index);
+}
+inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::add_method() {
+  return method_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >&
+ServiceDescriptorProto::method() const {
+  return method_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >*
+ServiceDescriptorProto::mutable_method() {
+  return &method_;
+}
+
+// optional .google.protobuf.ServiceOptions options = 3;
+inline bool ServiceDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void ServiceDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void ServiceDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void ServiceDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::ServiceOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::ServiceOptions& ServiceDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::ServiceOptions;
+  return options_;
+}
+inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::ServiceOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void ServiceDescriptorProto::set_allocated_options(::google::protobuf::ServiceOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// MethodDescriptorProto
+
+// optional string name = 1;
+inline bool MethodDescriptorProto::has_name() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void MethodDescriptorProto::set_has_name() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void MethodDescriptorProto::clear_has_name() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void MethodDescriptorProto::clear_name() {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    name_->clear();
+  }
+  clear_has_name();
+}
+inline const ::std::string& MethodDescriptorProto::name() const {
+  return *name_;
+}
+inline void MethodDescriptorProto::set_name(const ::std::string& value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void MethodDescriptorProto::set_name(const char* value) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(value);
+}
+inline void MethodDescriptorProto::set_name(const char* value, size_t size) {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  name_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* MethodDescriptorProto::mutable_name() {
+  set_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    name_ = new ::std::string;
+  }
+  return name_;
+}
+inline ::std::string* MethodDescriptorProto::release_name() {
+  clear_has_name();
+  if (name_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_;
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void MethodDescriptorProto::set_allocated_name(::std::string* name) {
+  if (name_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_;
+  }
+  if (name) {
+    set_has_name();
+    name_ = name;
+  } else {
+    clear_has_name();
+    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string input_type = 2;
+inline bool MethodDescriptorProto::has_input_type() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void MethodDescriptorProto::set_has_input_type() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void MethodDescriptorProto::clear_has_input_type() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void MethodDescriptorProto::clear_input_type() {
+  if (input_type_ != &::google::protobuf::internal::kEmptyString) {
+    input_type_->clear();
+  }
+  clear_has_input_type();
+}
+inline const ::std::string& MethodDescriptorProto::input_type() const {
+  return *input_type_;
+}
+inline void MethodDescriptorProto::set_input_type(const ::std::string& value) {
+  set_has_input_type();
+  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
+    input_type_ = new ::std::string;
+  }
+  input_type_->assign(value);
+}
+inline void MethodDescriptorProto::set_input_type(const char* value) {
+  set_has_input_type();
+  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
+    input_type_ = new ::std::string;
+  }
+  input_type_->assign(value);
+}
+inline void MethodDescriptorProto::set_input_type(const char* value, size_t size) {
+  set_has_input_type();
+  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
+    input_type_ = new ::std::string;
+  }
+  input_type_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* MethodDescriptorProto::mutable_input_type() {
+  set_has_input_type();
+  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
+    input_type_ = new ::std::string;
+  }
+  return input_type_;
+}
+inline ::std::string* MethodDescriptorProto::release_input_type() {
+  clear_has_input_type();
+  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = input_type_;
+    input_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void MethodDescriptorProto::set_allocated_input_type(::std::string* input_type) {
+  if (input_type_ != &::google::protobuf::internal::kEmptyString) {
+    delete input_type_;
+  }
+  if (input_type) {
+    set_has_input_type();
+    input_type_ = input_type;
+  } else {
+    clear_has_input_type();
+    input_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string output_type = 3;
+inline bool MethodDescriptorProto::has_output_type() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void MethodDescriptorProto::set_has_output_type() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void MethodDescriptorProto::clear_has_output_type() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void MethodDescriptorProto::clear_output_type() {
+  if (output_type_ != &::google::protobuf::internal::kEmptyString) {
+    output_type_->clear();
+  }
+  clear_has_output_type();
+}
+inline const ::std::string& MethodDescriptorProto::output_type() const {
+  return *output_type_;
+}
+inline void MethodDescriptorProto::set_output_type(const ::std::string& value) {
+  set_has_output_type();
+  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
+    output_type_ = new ::std::string;
+  }
+  output_type_->assign(value);
+}
+inline void MethodDescriptorProto::set_output_type(const char* value) {
+  set_has_output_type();
+  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
+    output_type_ = new ::std::string;
+  }
+  output_type_->assign(value);
+}
+inline void MethodDescriptorProto::set_output_type(const char* value, size_t size) {
+  set_has_output_type();
+  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
+    output_type_ = new ::std::string;
+  }
+  output_type_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* MethodDescriptorProto::mutable_output_type() {
+  set_has_output_type();
+  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
+    output_type_ = new ::std::string;
+  }
+  return output_type_;
+}
+inline ::std::string* MethodDescriptorProto::release_output_type() {
+  clear_has_output_type();
+  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = output_type_;
+    output_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void MethodDescriptorProto::set_allocated_output_type(::std::string* output_type) {
+  if (output_type_ != &::google::protobuf::internal::kEmptyString) {
+    delete output_type_;
+  }
+  if (output_type) {
+    set_has_output_type();
+    output_type_ = output_type;
+  } else {
+    clear_has_output_type();
+    output_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional .google.protobuf.MethodOptions options = 4;
+inline bool MethodDescriptorProto::has_options() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void MethodDescriptorProto::set_has_options() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void MethodDescriptorProto::clear_has_options() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void MethodDescriptorProto::clear_options() {
+  if (options_ != NULL) options_->::google::protobuf::MethodOptions::Clear();
+  clear_has_options();
+}
+inline const ::google::protobuf::MethodOptions& MethodDescriptorProto::options() const {
+  return options_ != NULL ? *options_ : *default_instance_->options_;
+}
+inline ::google::protobuf::MethodOptions* MethodDescriptorProto::mutable_options() {
+  set_has_options();
+  if (options_ == NULL) options_ = new ::google::protobuf::MethodOptions;
+  return options_;
+}
+inline ::google::protobuf::MethodOptions* MethodDescriptorProto::release_options() {
+  clear_has_options();
+  ::google::protobuf::MethodOptions* temp = options_;
+  options_ = NULL;
+  return temp;
+}
+inline void MethodDescriptorProto::set_allocated_options(::google::protobuf::MethodOptions* options) {
+  delete options_;
+  options_ = options;
+  if (options) {
+    set_has_options();
+  } else {
+    clear_has_options();
+  }
+}
+
+// -------------------------------------------------------------------
+
+// FileOptions
+
+// optional string java_package = 1;
+inline bool FileOptions::has_java_package() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void FileOptions::set_has_java_package() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void FileOptions::clear_has_java_package() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void FileOptions::clear_java_package() {
+  if (java_package_ != &::google::protobuf::internal::kEmptyString) {
+    java_package_->clear();
+  }
+  clear_has_java_package();
+}
+inline const ::std::string& FileOptions::java_package() const {
+  return *java_package_;
+}
+inline void FileOptions::set_java_package(const ::std::string& value) {
+  set_has_java_package();
+  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
+    java_package_ = new ::std::string;
+  }
+  java_package_->assign(value);
+}
+inline void FileOptions::set_java_package(const char* value) {
+  set_has_java_package();
+  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
+    java_package_ = new ::std::string;
+  }
+  java_package_->assign(value);
+}
+inline void FileOptions::set_java_package(const char* value, size_t size) {
+  set_has_java_package();
+  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
+    java_package_ = new ::std::string;
+  }
+  java_package_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileOptions::mutable_java_package() {
+  set_has_java_package();
+  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
+    java_package_ = new ::std::string;
+  }
+  return java_package_;
+}
+inline ::std::string* FileOptions::release_java_package() {
+  clear_has_java_package();
+  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = java_package_;
+    java_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FileOptions::set_allocated_java_package(::std::string* java_package) {
+  if (java_package_ != &::google::protobuf::internal::kEmptyString) {
+    delete java_package_;
+  }
+  if (java_package) {
+    set_has_java_package();
+    java_package_ = java_package;
+  } else {
+    clear_has_java_package();
+    java_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string java_outer_classname = 8;
+inline bool FileOptions::has_java_outer_classname() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void FileOptions::set_has_java_outer_classname() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void FileOptions::clear_has_java_outer_classname() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void FileOptions::clear_java_outer_classname() {
+  if (java_outer_classname_ != &::google::protobuf::internal::kEmptyString) {
+    java_outer_classname_->clear();
+  }
+  clear_has_java_outer_classname();
+}
+inline const ::std::string& FileOptions::java_outer_classname() const {
+  return *java_outer_classname_;
+}
+inline void FileOptions::set_java_outer_classname(const ::std::string& value) {
+  set_has_java_outer_classname();
+  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
+    java_outer_classname_ = new ::std::string;
+  }
+  java_outer_classname_->assign(value);
+}
+inline void FileOptions::set_java_outer_classname(const char* value) {
+  set_has_java_outer_classname();
+  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
+    java_outer_classname_ = new ::std::string;
+  }
+  java_outer_classname_->assign(value);
+}
+inline void FileOptions::set_java_outer_classname(const char* value, size_t size) {
+  set_has_java_outer_classname();
+  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
+    java_outer_classname_ = new ::std::string;
+  }
+  java_outer_classname_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileOptions::mutable_java_outer_classname() {
+  set_has_java_outer_classname();
+  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
+    java_outer_classname_ = new ::std::string;
+  }
+  return java_outer_classname_;
+}
+inline ::std::string* FileOptions::release_java_outer_classname() {
+  clear_has_java_outer_classname();
+  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = java_outer_classname_;
+    java_outer_classname_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FileOptions::set_allocated_java_outer_classname(::std::string* java_outer_classname) {
+  if (java_outer_classname_ != &::google::protobuf::internal::kEmptyString) {
+    delete java_outer_classname_;
+  }
+  if (java_outer_classname) {
+    set_has_java_outer_classname();
+    java_outer_classname_ = java_outer_classname;
+  } else {
+    clear_has_java_outer_classname();
+    java_outer_classname_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional bool java_multiple_files = 10 [default = false];
+inline bool FileOptions::has_java_multiple_files() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void FileOptions::set_has_java_multiple_files() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void FileOptions::clear_has_java_multiple_files() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void FileOptions::clear_java_multiple_files() {
+  java_multiple_files_ = false;
+  clear_has_java_multiple_files();
+}
+inline bool FileOptions::java_multiple_files() const {
+  return java_multiple_files_;
+}
+inline void FileOptions::set_java_multiple_files(bool value) {
+  set_has_java_multiple_files();
+  java_multiple_files_ = value;
+}
+
+// optional bool java_generate_equals_and_hash = 20 [default = false];
+inline bool FileOptions::has_java_generate_equals_and_hash() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void FileOptions::set_has_java_generate_equals_and_hash() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void FileOptions::clear_has_java_generate_equals_and_hash() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void FileOptions::clear_java_generate_equals_and_hash() {
+  java_generate_equals_and_hash_ = false;
+  clear_has_java_generate_equals_and_hash();
+}
+inline bool FileOptions::java_generate_equals_and_hash() const {
+  return java_generate_equals_and_hash_;
+}
+inline void FileOptions::set_java_generate_equals_and_hash(bool value) {
+  set_has_java_generate_equals_and_hash();
+  java_generate_equals_and_hash_ = value;
+}
+
+// optional .google.protobuf.FileOptions.OptimizeMode optimize_for = 9 [default = SPEED];
+inline bool FileOptions::has_optimize_for() const {
+  return (_has_bits_[0] & 0x00000010u) != 0;
+}
+inline void FileOptions::set_has_optimize_for() {
+  _has_bits_[0] |= 0x00000010u;
+}
+inline void FileOptions::clear_has_optimize_for() {
+  _has_bits_[0] &= ~0x00000010u;
+}
+inline void FileOptions::clear_optimize_for() {
+  optimize_for_ = 1;
+  clear_has_optimize_for();
+}
+inline ::google::protobuf::FileOptions_OptimizeMode FileOptions::optimize_for() const {
+  return static_cast< ::google::protobuf::FileOptions_OptimizeMode >(optimize_for_);
+}
+inline void FileOptions::set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value) {
+  assert(::google::protobuf::FileOptions_OptimizeMode_IsValid(value));
+  set_has_optimize_for();
+  optimize_for_ = value;
+}
+
+// optional string go_package = 11;
+inline bool FileOptions::has_go_package() const {
+  return (_has_bits_[0] & 0x00000020u) != 0;
+}
+inline void FileOptions::set_has_go_package() {
+  _has_bits_[0] |= 0x00000020u;
+}
+inline void FileOptions::clear_has_go_package() {
+  _has_bits_[0] &= ~0x00000020u;
+}
+inline void FileOptions::clear_go_package() {
+  if (go_package_ != &::google::protobuf::internal::kEmptyString) {
+    go_package_->clear();
+  }
+  clear_has_go_package();
+}
+inline const ::std::string& FileOptions::go_package() const {
+  return *go_package_;
+}
+inline void FileOptions::set_go_package(const ::std::string& value) {
+  set_has_go_package();
+  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
+    go_package_ = new ::std::string;
+  }
+  go_package_->assign(value);
+}
+inline void FileOptions::set_go_package(const char* value) {
+  set_has_go_package();
+  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
+    go_package_ = new ::std::string;
+  }
+  go_package_->assign(value);
+}
+inline void FileOptions::set_go_package(const char* value, size_t size) {
+  set_has_go_package();
+  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
+    go_package_ = new ::std::string;
+  }
+  go_package_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FileOptions::mutable_go_package() {
+  set_has_go_package();
+  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
+    go_package_ = new ::std::string;
+  }
+  return go_package_;
+}
+inline ::std::string* FileOptions::release_go_package() {
+  clear_has_go_package();
+  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = go_package_;
+    go_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FileOptions::set_allocated_go_package(::std::string* go_package) {
+  if (go_package_ != &::google::protobuf::internal::kEmptyString) {
+    delete go_package_;
+  }
+  if (go_package) {
+    set_has_go_package();
+    go_package_ = go_package;
+  } else {
+    clear_has_go_package();
+    go_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional bool cc_generic_services = 16 [default = false];
+inline bool FileOptions::has_cc_generic_services() const {
+  return (_has_bits_[0] & 0x00000040u) != 0;
+}
+inline void FileOptions::set_has_cc_generic_services() {
+  _has_bits_[0] |= 0x00000040u;
+}
+inline void FileOptions::clear_has_cc_generic_services() {
+  _has_bits_[0] &= ~0x00000040u;
+}
+inline void FileOptions::clear_cc_generic_services() {
+  cc_generic_services_ = false;
+  clear_has_cc_generic_services();
+}
+inline bool FileOptions::cc_generic_services() const {
+  return cc_generic_services_;
+}
+inline void FileOptions::set_cc_generic_services(bool value) {
+  set_has_cc_generic_services();
+  cc_generic_services_ = value;
+}
+
+// optional bool java_generic_services = 17 [default = false];
+inline bool FileOptions::has_java_generic_services() const {
+  return (_has_bits_[0] & 0x00000080u) != 0;
+}
+inline void FileOptions::set_has_java_generic_services() {
+  _has_bits_[0] |= 0x00000080u;
+}
+inline void FileOptions::clear_has_java_generic_services() {
+  _has_bits_[0] &= ~0x00000080u;
+}
+inline void FileOptions::clear_java_generic_services() {
+  java_generic_services_ = false;
+  clear_has_java_generic_services();
+}
+inline bool FileOptions::java_generic_services() const {
+  return java_generic_services_;
+}
+inline void FileOptions::set_java_generic_services(bool value) {
+  set_has_java_generic_services();
+  java_generic_services_ = value;
+}
+
+// optional bool py_generic_services = 18 [default = false];
+inline bool FileOptions::has_py_generic_services() const {
+  return (_has_bits_[0] & 0x00000100u) != 0;
+}
+inline void FileOptions::set_has_py_generic_services() {
+  _has_bits_[0] |= 0x00000100u;
+}
+inline void FileOptions::clear_has_py_generic_services() {
+  _has_bits_[0] &= ~0x00000100u;
+}
+inline void FileOptions::clear_py_generic_services() {
+  py_generic_services_ = false;
+  clear_has_py_generic_services();
+}
+inline bool FileOptions::py_generic_services() const {
+  return py_generic_services_;
+}
+inline void FileOptions::set_py_generic_services(bool value) {
+  set_has_py_generic_services();
+  py_generic_services_ = value;
+}
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int FileOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void FileOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& FileOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* FileOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* FileOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+FileOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+FileOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// MessageOptions
+
+// optional bool message_set_wire_format = 1 [default = false];
+inline bool MessageOptions::has_message_set_wire_format() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void MessageOptions::set_has_message_set_wire_format() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void MessageOptions::clear_has_message_set_wire_format() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void MessageOptions::clear_message_set_wire_format() {
+  message_set_wire_format_ = false;
+  clear_has_message_set_wire_format();
+}
+inline bool MessageOptions::message_set_wire_format() const {
+  return message_set_wire_format_;
+}
+inline void MessageOptions::set_message_set_wire_format(bool value) {
+  set_has_message_set_wire_format();
+  message_set_wire_format_ = value;
+}
+
+// optional bool no_standard_descriptor_accessor = 2 [default = false];
+inline bool MessageOptions::has_no_standard_descriptor_accessor() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void MessageOptions::set_has_no_standard_descriptor_accessor() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void MessageOptions::clear_has_no_standard_descriptor_accessor() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void MessageOptions::clear_no_standard_descriptor_accessor() {
+  no_standard_descriptor_accessor_ = false;
+  clear_has_no_standard_descriptor_accessor();
+}
+inline bool MessageOptions::no_standard_descriptor_accessor() const {
+  return no_standard_descriptor_accessor_;
+}
+inline void MessageOptions::set_no_standard_descriptor_accessor(bool value) {
+  set_has_no_standard_descriptor_accessor();
+  no_standard_descriptor_accessor_ = value;
+}
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int MessageOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void MessageOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& MessageOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* MessageOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* MessageOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+MessageOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+MessageOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// FieldOptions
+
+// optional .google.protobuf.FieldOptions.CType ctype = 1 [default = STRING];
+inline bool FieldOptions::has_ctype() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void FieldOptions::set_has_ctype() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void FieldOptions::clear_has_ctype() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void FieldOptions::clear_ctype() {
+  ctype_ = 0;
+  clear_has_ctype();
+}
+inline ::google::protobuf::FieldOptions_CType FieldOptions::ctype() const {
+  return static_cast< ::google::protobuf::FieldOptions_CType >(ctype_);
+}
+inline void FieldOptions::set_ctype(::google::protobuf::FieldOptions_CType value) {
+  assert(::google::protobuf::FieldOptions_CType_IsValid(value));
+  set_has_ctype();
+  ctype_ = value;
+}
+
+// optional bool packed = 2;
+inline bool FieldOptions::has_packed() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void FieldOptions::set_has_packed() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void FieldOptions::clear_has_packed() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void FieldOptions::clear_packed() {
+  packed_ = false;
+  clear_has_packed();
+}
+inline bool FieldOptions::packed() const {
+  return packed_;
+}
+inline void FieldOptions::set_packed(bool value) {
+  set_has_packed();
+  packed_ = value;
+}
+
+// optional bool lazy = 5 [default = false];
+inline bool FieldOptions::has_lazy() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void FieldOptions::set_has_lazy() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void FieldOptions::clear_has_lazy() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void FieldOptions::clear_lazy() {
+  lazy_ = false;
+  clear_has_lazy();
+}
+inline bool FieldOptions::lazy() const {
+  return lazy_;
+}
+inline void FieldOptions::set_lazy(bool value) {
+  set_has_lazy();
+  lazy_ = value;
+}
+
+// optional bool deprecated = 3 [default = false];
+inline bool FieldOptions::has_deprecated() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void FieldOptions::set_has_deprecated() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void FieldOptions::clear_has_deprecated() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void FieldOptions::clear_deprecated() {
+  deprecated_ = false;
+  clear_has_deprecated();
+}
+inline bool FieldOptions::deprecated() const {
+  return deprecated_;
+}
+inline void FieldOptions::set_deprecated(bool value) {
+  set_has_deprecated();
+  deprecated_ = value;
+}
+
+// optional string experimental_map_key = 9;
+inline bool FieldOptions::has_experimental_map_key() const {
+  return (_has_bits_[0] & 0x00000010u) != 0;
+}
+inline void FieldOptions::set_has_experimental_map_key() {
+  _has_bits_[0] |= 0x00000010u;
+}
+inline void FieldOptions::clear_has_experimental_map_key() {
+  _has_bits_[0] &= ~0x00000010u;
+}
+inline void FieldOptions::clear_experimental_map_key() {
+  if (experimental_map_key_ != &::google::protobuf::internal::kEmptyString) {
+    experimental_map_key_->clear();
+  }
+  clear_has_experimental_map_key();
+}
+inline const ::std::string& FieldOptions::experimental_map_key() const {
+  return *experimental_map_key_;
+}
+inline void FieldOptions::set_experimental_map_key(const ::std::string& value) {
+  set_has_experimental_map_key();
+  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
+    experimental_map_key_ = new ::std::string;
+  }
+  experimental_map_key_->assign(value);
+}
+inline void FieldOptions::set_experimental_map_key(const char* value) {
+  set_has_experimental_map_key();
+  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
+    experimental_map_key_ = new ::std::string;
+  }
+  experimental_map_key_->assign(value);
+}
+inline void FieldOptions::set_experimental_map_key(const char* value, size_t size) {
+  set_has_experimental_map_key();
+  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
+    experimental_map_key_ = new ::std::string;
+  }
+  experimental_map_key_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* FieldOptions::mutable_experimental_map_key() {
+  set_has_experimental_map_key();
+  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
+    experimental_map_key_ = new ::std::string;
+  }
+  return experimental_map_key_;
+}
+inline ::std::string* FieldOptions::release_experimental_map_key() {
+  clear_has_experimental_map_key();
+  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = experimental_map_key_;
+    experimental_map_key_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void FieldOptions::set_allocated_experimental_map_key(::std::string* experimental_map_key) {
+  if (experimental_map_key_ != &::google::protobuf::internal::kEmptyString) {
+    delete experimental_map_key_;
+  }
+  if (experimental_map_key) {
+    set_has_experimental_map_key();
+    experimental_map_key_ = experimental_map_key;
+  } else {
+    clear_has_experimental_map_key();
+    experimental_map_key_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional bool weak = 10 [default = false];
+inline bool FieldOptions::has_weak() const {
+  return (_has_bits_[0] & 0x00000020u) != 0;
+}
+inline void FieldOptions::set_has_weak() {
+  _has_bits_[0] |= 0x00000020u;
+}
+inline void FieldOptions::clear_has_weak() {
+  _has_bits_[0] &= ~0x00000020u;
+}
+inline void FieldOptions::clear_weak() {
+  weak_ = false;
+  clear_has_weak();
+}
+inline bool FieldOptions::weak() const {
+  return weak_;
+}
+inline void FieldOptions::set_weak(bool value) {
+  set_has_weak();
+  weak_ = value;
+}
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int FieldOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void FieldOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& FieldOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* FieldOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* FieldOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+FieldOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+FieldOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// EnumOptions
+
+// optional bool allow_alias = 2 [default = true];
+inline bool EnumOptions::has_allow_alias() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void EnumOptions::set_has_allow_alias() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void EnumOptions::clear_has_allow_alias() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void EnumOptions::clear_allow_alias() {
+  allow_alias_ = true;
+  clear_has_allow_alias();
+}
+inline bool EnumOptions::allow_alias() const {
+  return allow_alias_;
+}
+inline void EnumOptions::set_allow_alias(bool value) {
+  set_has_allow_alias();
+  allow_alias_ = value;
+}
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int EnumOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void EnumOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& EnumOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* EnumOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* EnumOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+EnumOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+EnumOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// EnumValueOptions
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int EnumValueOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void EnumValueOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& EnumValueOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* EnumValueOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* EnumValueOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+EnumValueOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+EnumValueOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// ServiceOptions
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int ServiceOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void ServiceOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& ServiceOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* ServiceOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* ServiceOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+ServiceOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+ServiceOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// MethodOptions
+
+// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
+inline int MethodOptions::uninterpreted_option_size() const {
+  return uninterpreted_option_.size();
+}
+inline void MethodOptions::clear_uninterpreted_option() {
+  uninterpreted_option_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption& MethodOptions::uninterpreted_option(int index) const {
+  return uninterpreted_option_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption* MethodOptions::mutable_uninterpreted_option(int index) {
+  return uninterpreted_option_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption* MethodOptions::add_uninterpreted_option() {
+  return uninterpreted_option_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
+MethodOptions::uninterpreted_option() const {
+  return uninterpreted_option_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
+MethodOptions::mutable_uninterpreted_option() {
+  return &uninterpreted_option_;
+}
+
+// -------------------------------------------------------------------
+
+// UninterpretedOption_NamePart
+
+// required string name_part = 1;
+inline bool UninterpretedOption_NamePart::has_name_part() const {
+  return (_has_bits_[0] & 0x00000001u) != 0;
+}
+inline void UninterpretedOption_NamePart::set_has_name_part() {
+  _has_bits_[0] |= 0x00000001u;
+}
+inline void UninterpretedOption_NamePart::clear_has_name_part() {
+  _has_bits_[0] &= ~0x00000001u;
+}
+inline void UninterpretedOption_NamePart::clear_name_part() {
+  if (name_part_ != &::google::protobuf::internal::kEmptyString) {
+    name_part_->clear();
+  }
+  clear_has_name_part();
+}
+inline const ::std::string& UninterpretedOption_NamePart::name_part() const {
+  return *name_part_;
+}
+inline void UninterpretedOption_NamePart::set_name_part(const ::std::string& value) {
+  set_has_name_part();
+  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
+    name_part_ = new ::std::string;
+  }
+  name_part_->assign(value);
+}
+inline void UninterpretedOption_NamePart::set_name_part(const char* value) {
+  set_has_name_part();
+  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
+    name_part_ = new ::std::string;
+  }
+  name_part_->assign(value);
+}
+inline void UninterpretedOption_NamePart::set_name_part(const char* value, size_t size) {
+  set_has_name_part();
+  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
+    name_part_ = new ::std::string;
+  }
+  name_part_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* UninterpretedOption_NamePart::mutable_name_part() {
+  set_has_name_part();
+  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
+    name_part_ = new ::std::string;
+  }
+  return name_part_;
+}
+inline ::std::string* UninterpretedOption_NamePart::release_name_part() {
+  clear_has_name_part();
+  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = name_part_;
+    name_part_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void UninterpretedOption_NamePart::set_allocated_name_part(::std::string* name_part) {
+  if (name_part_ != &::google::protobuf::internal::kEmptyString) {
+    delete name_part_;
+  }
+  if (name_part) {
+    set_has_name_part();
+    name_part_ = name_part;
+  } else {
+    clear_has_name_part();
+    name_part_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// required bool is_extension = 2;
+inline bool UninterpretedOption_NamePart::has_is_extension() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void UninterpretedOption_NamePart::set_has_is_extension() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void UninterpretedOption_NamePart::clear_has_is_extension() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void UninterpretedOption_NamePart::clear_is_extension() {
+  is_extension_ = false;
+  clear_has_is_extension();
+}
+inline bool UninterpretedOption_NamePart::is_extension() const {
+  return is_extension_;
+}
+inline void UninterpretedOption_NamePart::set_is_extension(bool value) {
+  set_has_is_extension();
+  is_extension_ = value;
+}
+
+// -------------------------------------------------------------------
+
+// UninterpretedOption
+
+// repeated .google.protobuf.UninterpretedOption.NamePart name = 2;
+inline int UninterpretedOption::name_size() const {
+  return name_.size();
+}
+inline void UninterpretedOption::clear_name() {
+  name_.Clear();
+}
+inline const ::google::protobuf::UninterpretedOption_NamePart& UninterpretedOption::name(int index) const {
+  return name_.Get(index);
+}
+inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::mutable_name(int index) {
+  return name_.Mutable(index);
+}
+inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::add_name() {
+  return name_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >&
+UninterpretedOption::name() const {
+  return name_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >*
+UninterpretedOption::mutable_name() {
+  return &name_;
+}
+
+// optional string identifier_value = 3;
+inline bool UninterpretedOption::has_identifier_value() const {
+  return (_has_bits_[0] & 0x00000002u) != 0;
+}
+inline void UninterpretedOption::set_has_identifier_value() {
+  _has_bits_[0] |= 0x00000002u;
+}
+inline void UninterpretedOption::clear_has_identifier_value() {
+  _has_bits_[0] &= ~0x00000002u;
+}
+inline void UninterpretedOption::clear_identifier_value() {
+  if (identifier_value_ != &::google::protobuf::internal::kEmptyString) {
+    identifier_value_->clear();
+  }
+  clear_has_identifier_value();
+}
+inline const ::std::string& UninterpretedOption::identifier_value() const {
+  return *identifier_value_;
+}
+inline void UninterpretedOption::set_identifier_value(const ::std::string& value) {
+  set_has_identifier_value();
+  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
+    identifier_value_ = new ::std::string;
+  }
+  identifier_value_->assign(value);
+}
+inline void UninterpretedOption::set_identifier_value(const char* value) {
+  set_has_identifier_value();
+  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
+    identifier_value_ = new ::std::string;
+  }
+  identifier_value_->assign(value);
+}
+inline void UninterpretedOption::set_identifier_value(const char* value, size_t size) {
+  set_has_identifier_value();
+  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
+    identifier_value_ = new ::std::string;
+  }
+  identifier_value_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* UninterpretedOption::mutable_identifier_value() {
+  set_has_identifier_value();
+  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
+    identifier_value_ = new ::std::string;
+  }
+  return identifier_value_;
+}
+inline ::std::string* UninterpretedOption::release_identifier_value() {
+  clear_has_identifier_value();
+  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = identifier_value_;
+    identifier_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void UninterpretedOption::set_allocated_identifier_value(::std::string* identifier_value) {
+  if (identifier_value_ != &::google::protobuf::internal::kEmptyString) {
+    delete identifier_value_;
+  }
+  if (identifier_value) {
+    set_has_identifier_value();
+    identifier_value_ = identifier_value;
+  } else {
+    clear_has_identifier_value();
+    identifier_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional uint64 positive_int_value = 4;
+inline bool UninterpretedOption::has_positive_int_value() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void UninterpretedOption::set_has_positive_int_value() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void UninterpretedOption::clear_has_positive_int_value() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void UninterpretedOption::clear_positive_int_value() {
+  positive_int_value_ = GOOGLE_ULONGLONG(0);
+  clear_has_positive_int_value();
+}
+inline ::google::protobuf::uint64 UninterpretedOption::positive_int_value() const {
+  return positive_int_value_;
+}
+inline void UninterpretedOption::set_positive_int_value(::google::protobuf::uint64 value) {
+  set_has_positive_int_value();
+  positive_int_value_ = value;
+}
+
+// optional int64 negative_int_value = 5;
+inline bool UninterpretedOption::has_negative_int_value() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void UninterpretedOption::set_has_negative_int_value() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void UninterpretedOption::clear_has_negative_int_value() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void UninterpretedOption::clear_negative_int_value() {
+  negative_int_value_ = GOOGLE_LONGLONG(0);
+  clear_has_negative_int_value();
+}
+inline ::google::protobuf::int64 UninterpretedOption::negative_int_value() const {
+  return negative_int_value_;
+}
+inline void UninterpretedOption::set_negative_int_value(::google::protobuf::int64 value) {
+  set_has_negative_int_value();
+  negative_int_value_ = value;
+}
+
+// optional double double_value = 6;
+inline bool UninterpretedOption::has_double_value() const {
+  return (_has_bits_[0] & 0x00000010u) != 0;
+}
+inline void UninterpretedOption::set_has_double_value() {
+  _has_bits_[0] |= 0x00000010u;
+}
+inline void UninterpretedOption::clear_has_double_value() {
+  _has_bits_[0] &= ~0x00000010u;
+}
+inline void UninterpretedOption::clear_double_value() {
+  double_value_ = 0;
+  clear_has_double_value();
+}
+inline double UninterpretedOption::double_value() const {
+  return double_value_;
+}
+inline void UninterpretedOption::set_double_value(double value) {
+  set_has_double_value();
+  double_value_ = value;
+}
+
+// optional bytes string_value = 7;
+inline bool UninterpretedOption::has_string_value() const {
+  return (_has_bits_[0] & 0x00000020u) != 0;
+}
+inline void UninterpretedOption::set_has_string_value() {
+  _has_bits_[0] |= 0x00000020u;
+}
+inline void UninterpretedOption::clear_has_string_value() {
+  _has_bits_[0] &= ~0x00000020u;
+}
+inline void UninterpretedOption::clear_string_value() {
+  if (string_value_ != &::google::protobuf::internal::kEmptyString) {
+    string_value_->clear();
+  }
+  clear_has_string_value();
+}
+inline const ::std::string& UninterpretedOption::string_value() const {
+  return *string_value_;
+}
+inline void UninterpretedOption::set_string_value(const ::std::string& value) {
+  set_has_string_value();
+  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
+    string_value_ = new ::std::string;
+  }
+  string_value_->assign(value);
+}
+inline void UninterpretedOption::set_string_value(const char* value) {
+  set_has_string_value();
+  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
+    string_value_ = new ::std::string;
+  }
+  string_value_->assign(value);
+}
+inline void UninterpretedOption::set_string_value(const void* value, size_t size) {
+  set_has_string_value();
+  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
+    string_value_ = new ::std::string;
+  }
+  string_value_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* UninterpretedOption::mutable_string_value() {
+  set_has_string_value();
+  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
+    string_value_ = new ::std::string;
+  }
+  return string_value_;
+}
+inline ::std::string* UninterpretedOption::release_string_value() {
+  clear_has_string_value();
+  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = string_value_;
+    string_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void UninterpretedOption::set_allocated_string_value(::std::string* string_value) {
+  if (string_value_ != &::google::protobuf::internal::kEmptyString) {
+    delete string_value_;
+  }
+  if (string_value) {
+    set_has_string_value();
+    string_value_ = string_value;
+  } else {
+    clear_has_string_value();
+    string_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string aggregate_value = 8;
+inline bool UninterpretedOption::has_aggregate_value() const {
+  return (_has_bits_[0] & 0x00000040u) != 0;
+}
+inline void UninterpretedOption::set_has_aggregate_value() {
+  _has_bits_[0] |= 0x00000040u;
+}
+inline void UninterpretedOption::clear_has_aggregate_value() {
+  _has_bits_[0] &= ~0x00000040u;
+}
+inline void UninterpretedOption::clear_aggregate_value() {
+  if (aggregate_value_ != &::google::protobuf::internal::kEmptyString) {
+    aggregate_value_->clear();
+  }
+  clear_has_aggregate_value();
+}
+inline const ::std::string& UninterpretedOption::aggregate_value() const {
+  return *aggregate_value_;
+}
+inline void UninterpretedOption::set_aggregate_value(const ::std::string& value) {
+  set_has_aggregate_value();
+  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
+    aggregate_value_ = new ::std::string;
+  }
+  aggregate_value_->assign(value);
+}
+inline void UninterpretedOption::set_aggregate_value(const char* value) {
+  set_has_aggregate_value();
+  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
+    aggregate_value_ = new ::std::string;
+  }
+  aggregate_value_->assign(value);
+}
+inline void UninterpretedOption::set_aggregate_value(const char* value, size_t size) {
+  set_has_aggregate_value();
+  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
+    aggregate_value_ = new ::std::string;
+  }
+  aggregate_value_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* UninterpretedOption::mutable_aggregate_value() {
+  set_has_aggregate_value();
+  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
+    aggregate_value_ = new ::std::string;
+  }
+  return aggregate_value_;
+}
+inline ::std::string* UninterpretedOption::release_aggregate_value() {
+  clear_has_aggregate_value();
+  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = aggregate_value_;
+    aggregate_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void UninterpretedOption::set_allocated_aggregate_value(::std::string* aggregate_value) {
+  if (aggregate_value_ != &::google::protobuf::internal::kEmptyString) {
+    delete aggregate_value_;
+  }
+  if (aggregate_value) {
+    set_has_aggregate_value();
+    aggregate_value_ = aggregate_value;
+  } else {
+    clear_has_aggregate_value();
+    aggregate_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// -------------------------------------------------------------------
+
+// SourceCodeInfo_Location
+
+// repeated int32 path = 1 [packed = true];
+inline int SourceCodeInfo_Location::path_size() const {
+  return path_.size();
+}
+inline void SourceCodeInfo_Location::clear_path() {
+  path_.Clear();
+}
+inline ::google::protobuf::int32 SourceCodeInfo_Location::path(int index) const {
+  return path_.Get(index);
+}
+inline void SourceCodeInfo_Location::set_path(int index, ::google::protobuf::int32 value) {
+  path_.Set(index, value);
+}
+inline void SourceCodeInfo_Location::add_path(::google::protobuf::int32 value) {
+  path_.Add(value);
+}
+inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+SourceCodeInfo_Location::path() const {
+  return path_;
+}
+inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+SourceCodeInfo_Location::mutable_path() {
+  return &path_;
+}
+
+// repeated int32 span = 2 [packed = true];
+inline int SourceCodeInfo_Location::span_size() const {
+  return span_.size();
+}
+inline void SourceCodeInfo_Location::clear_span() {
+  span_.Clear();
+}
+inline ::google::protobuf::int32 SourceCodeInfo_Location::span(int index) const {
+  return span_.Get(index);
+}
+inline void SourceCodeInfo_Location::set_span(int index, ::google::protobuf::int32 value) {
+  span_.Set(index, value);
+}
+inline void SourceCodeInfo_Location::add_span(::google::protobuf::int32 value) {
+  span_.Add(value);
+}
+inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
+SourceCodeInfo_Location::span() const {
+  return span_;
+}
+inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
+SourceCodeInfo_Location::mutable_span() {
+  return &span_;
+}
+
+// optional string leading_comments = 3;
+inline bool SourceCodeInfo_Location::has_leading_comments() const {
+  return (_has_bits_[0] & 0x00000004u) != 0;
+}
+inline void SourceCodeInfo_Location::set_has_leading_comments() {
+  _has_bits_[0] |= 0x00000004u;
+}
+inline void SourceCodeInfo_Location::clear_has_leading_comments() {
+  _has_bits_[0] &= ~0x00000004u;
+}
+inline void SourceCodeInfo_Location::clear_leading_comments() {
+  if (leading_comments_ != &::google::protobuf::internal::kEmptyString) {
+    leading_comments_->clear();
+  }
+  clear_has_leading_comments();
+}
+inline const ::std::string& SourceCodeInfo_Location::leading_comments() const {
+  return *leading_comments_;
+}
+inline void SourceCodeInfo_Location::set_leading_comments(const ::std::string& value) {
+  set_has_leading_comments();
+  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
+    leading_comments_ = new ::std::string;
+  }
+  leading_comments_->assign(value);
+}
+inline void SourceCodeInfo_Location::set_leading_comments(const char* value) {
+  set_has_leading_comments();
+  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
+    leading_comments_ = new ::std::string;
+  }
+  leading_comments_->assign(value);
+}
+inline void SourceCodeInfo_Location::set_leading_comments(const char* value, size_t size) {
+  set_has_leading_comments();
+  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
+    leading_comments_ = new ::std::string;
+  }
+  leading_comments_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* SourceCodeInfo_Location::mutable_leading_comments() {
+  set_has_leading_comments();
+  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
+    leading_comments_ = new ::std::string;
+  }
+  return leading_comments_;
+}
+inline ::std::string* SourceCodeInfo_Location::release_leading_comments() {
+  clear_has_leading_comments();
+  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = leading_comments_;
+    leading_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void SourceCodeInfo_Location::set_allocated_leading_comments(::std::string* leading_comments) {
+  if (leading_comments_ != &::google::protobuf::internal::kEmptyString) {
+    delete leading_comments_;
+  }
+  if (leading_comments) {
+    set_has_leading_comments();
+    leading_comments_ = leading_comments;
+  } else {
+    clear_has_leading_comments();
+    leading_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// optional string trailing_comments = 4;
+inline bool SourceCodeInfo_Location::has_trailing_comments() const {
+  return (_has_bits_[0] & 0x00000008u) != 0;
+}
+inline void SourceCodeInfo_Location::set_has_trailing_comments() {
+  _has_bits_[0] |= 0x00000008u;
+}
+inline void SourceCodeInfo_Location::clear_has_trailing_comments() {
+  _has_bits_[0] &= ~0x00000008u;
+}
+inline void SourceCodeInfo_Location::clear_trailing_comments() {
+  if (trailing_comments_ != &::google::protobuf::internal::kEmptyString) {
+    trailing_comments_->clear();
+  }
+  clear_has_trailing_comments();
+}
+inline const ::std::string& SourceCodeInfo_Location::trailing_comments() const {
+  return *trailing_comments_;
+}
+inline void SourceCodeInfo_Location::set_trailing_comments(const ::std::string& value) {
+  set_has_trailing_comments();
+  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
+    trailing_comments_ = new ::std::string;
+  }
+  trailing_comments_->assign(value);
+}
+inline void SourceCodeInfo_Location::set_trailing_comments(const char* value) {
+  set_has_trailing_comments();
+  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
+    trailing_comments_ = new ::std::string;
+  }
+  trailing_comments_->assign(value);
+}
+inline void SourceCodeInfo_Location::set_trailing_comments(const char* value, size_t size) {
+  set_has_trailing_comments();
+  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
+    trailing_comments_ = new ::std::string;
+  }
+  trailing_comments_->assign(reinterpret_cast<const char*>(value), size);
+}
+inline ::std::string* SourceCodeInfo_Location::mutable_trailing_comments() {
+  set_has_trailing_comments();
+  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
+    trailing_comments_ = new ::std::string;
+  }
+  return trailing_comments_;
+}
+inline ::std::string* SourceCodeInfo_Location::release_trailing_comments() {
+  clear_has_trailing_comments();
+  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
+    return NULL;
+  } else {
+    ::std::string* temp = trailing_comments_;
+    trailing_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+    return temp;
+  }
+}
+inline void SourceCodeInfo_Location::set_allocated_trailing_comments(::std::string* trailing_comments) {
+  if (trailing_comments_ != &::google::protobuf::internal::kEmptyString) {
+    delete trailing_comments_;
+  }
+  if (trailing_comments) {
+    set_has_trailing_comments();
+    trailing_comments_ = trailing_comments;
+  } else {
+    clear_has_trailing_comments();
+    trailing_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
+  }
+}
+
+// -------------------------------------------------------------------
+
+// SourceCodeInfo
+
+// repeated .google.protobuf.SourceCodeInfo.Location location = 1;
+inline int SourceCodeInfo::location_size() const {
+  return location_.size();
+}
+inline void SourceCodeInfo::clear_location() {
+  location_.Clear();
+}
+inline const ::google::protobuf::SourceCodeInfo_Location& SourceCodeInfo::location(int index) const {
+  return location_.Get(index);
+}
+inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::mutable_location(int index) {
+  return location_.Mutable(index);
+}
+inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::add_location() {
+  return location_.Add();
+}
+inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >&
+SourceCodeInfo::location() const {
+  return location_;
+}
+inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >*
+SourceCodeInfo::mutable_location() {
+  return &location_;
+}
+
+
+// @@protoc_insertion_point(namespace_scope)
+
+}  // namespace protobuf
+}  // namespace google
+
+#ifndef SWIG
+namespace google {
+namespace protobuf {
+
+template <>
+inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Type>() {
+  return ::google::protobuf::FieldDescriptorProto_Type_descriptor();
+}
+template <>
+inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Label>() {
+  return ::google::protobuf::FieldDescriptorProto_Label_descriptor();
+}
+template <>
+inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FileOptions_OptimizeMode>() {
+  return ::google::protobuf::FileOptions_OptimizeMode_descriptor();
+}
+template <>
+inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldOptions_CType>() {
+  return ::google::protobuf::FieldOptions_CType_descriptor();
+}
+
+}  // namespace google
+}  // namespace protobuf
+#endif  // SWIG
+
+// @@protoc_insertion_point(global_scope)
+
+#endif  // PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.proto b/ps-lite/deps/include/google/protobuf/descriptor.proto
new file mode 100644
index 00000000..a785f79f
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/descriptor.proto
@@ -0,0 +1,620 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// The messages in this file describe the definitions found in .proto files.
+// A valid .proto file can be translated directly to a FileDescriptorProto
+// without any other information (e.g. without reading its imports).
+
+
+
+package google.protobuf;
+option java_package = "com.google.protobuf";
+option java_outer_classname = "DescriptorProtos";
+
+// descriptor.proto must be optimized for speed because reflection-based
+// algorithms don't work during bootstrapping.
+option optimize_for = SPEED;
+
+// The protocol compiler can output a FileDescriptorSet containing the .proto
+// files it parses.
+message FileDescriptorSet {
+  repeated FileDescriptorProto file = 1;
+}
+
+// Describes a complete .proto file.
+message FileDescriptorProto {
+  optional string name = 1;       // file name, relative to root of source tree
+  optional string package = 2;    // e.g. "foo", "foo.bar", etc.
+
+  // Names of files imported by this file.
+  repeated string dependency = 3;
+  // Indexes of the public imported files in the dependency list above.
+  repeated int32 public_dependency = 10;
+  // Indexes of the weak imported files in the dependency list.
+  // For Google-internal migration only. Do not use.
+  repeated int32 weak_dependency = 11;
+
+  // All top-level definitions in this file.
+  repeated DescriptorProto message_type = 4;
+  repeated EnumDescriptorProto enum_type = 5;
+  repeated ServiceDescriptorProto service = 6;
+  repeated FieldDescriptorProto extension = 7;
+
+  optional FileOptions options = 8;
+
+  // This field contains optional information about the original source code.
+  // You may safely remove this entire field whithout harming runtime
+  // functionality of the descriptors -- the information is needed only by
+  // development tools.
+  optional SourceCodeInfo source_code_info = 9;
+}
+
+// Describes a message type.
+message DescriptorProto {
+  optional string name = 1;
+
+  repeated FieldDescriptorProto field = 2;
+  repeated FieldDescriptorProto extension = 6;
+
+  repeated DescriptorProto nested_type = 3;
+  repeated EnumDescriptorProto enum_type = 4;
+
+  message ExtensionRange {
+    optional int32 start = 1;
+    optional int32 end = 2;
+  }
+  repeated ExtensionRange extension_range = 5;
+
+  optional MessageOptions options = 7;
+}
+
+// Describes a field within a message.
+message FieldDescriptorProto {
+  enum Type {
+    // 0 is reserved for errors.
+    // Order is weird for historical reasons.
+    TYPE_DOUBLE         = 1;
+    TYPE_FLOAT          = 2;
+    // Not ZigZag encoded.  Negative numbers take 10 bytes.  Use TYPE_SINT64 if
+    // negative values are likely.
+    TYPE_INT64          = 3;
+    TYPE_UINT64         = 4;
+    // Not ZigZag encoded.  Negative numbers take 10 bytes.  Use TYPE_SINT32 if
+    // negative values are likely.
+    TYPE_INT32          = 5;
+    TYPE_FIXED64        = 6;
+    TYPE_FIXED32        = 7;
+    TYPE_BOOL           = 8;
+    TYPE_STRING         = 9;
+    TYPE_GROUP          = 10;  // Tag-delimited aggregate.
+    TYPE_MESSAGE        = 11;  // Length-delimited aggregate.
+
+    // New in version 2.
+    TYPE_BYTES          = 12;
+    TYPE_UINT32         = 13;
+    TYPE_ENUM           = 14;
+    TYPE_SFIXED32       = 15;
+    TYPE_SFIXED64       = 16;
+    TYPE_SINT32         = 17;  // Uses ZigZag encoding.
+    TYPE_SINT64         = 18;  // Uses ZigZag encoding.
+  };
+
+  enum Label {
+    // 0 is reserved for errors
+    LABEL_OPTIONAL      = 1;
+    LABEL_REQUIRED      = 2;
+    LABEL_REPEATED      = 3;
+    // TODO(sanjay): Should we add LABEL_MAP?
+  };
+
+  optional string name = 1;
+  optional int32 number = 3;
+  optional Label label = 4;
+
+  // If type_name is set, this need not be set.  If both this and type_name
+  // are set, this must be either TYPE_ENUM or TYPE_MESSAGE.
+  optional Type type = 5;
+
+  // For message and enum types, this is the name of the type.  If the name
+  // starts with a '.', it is fully-qualified.  Otherwise, C++-like scoping
+  // rules are used to find the type (i.e. first the nested types within this
+  // message are searched, then within the parent, on up to the root
+  // namespace).
+  optional string type_name = 6;
+
+  // For extensions, this is the name of the type being extended.  It is
+  // resolved in the same manner as type_name.
+  optional string extendee = 2;
+
+  // For numeric types, contains the original text representation of the value.
+  // For booleans, "true" or "false".
+  // For strings, contains the default text contents (not escaped in any way).
+  // For bytes, contains the C escaped value.  All bytes >= 128 are escaped.
+  // TODO(kenton):  Base-64 encode?
+  optional string default_value = 7;
+
+  optional FieldOptions options = 8;
+}
+
+// Describes an enum type.
+message EnumDescriptorProto {
+  optional string name = 1;
+
+  repeated EnumValueDescriptorProto value = 2;
+
+  optional EnumOptions options = 3;
+}
+
+// Describes a value within an enum.
+message EnumValueDescriptorProto {
+  optional string name = 1;
+  optional int32 number = 2;
+
+  optional EnumValueOptions options = 3;
+}
+
+// Describes a service.
+message ServiceDescriptorProto {
+  optional string name = 1;
+  repeated MethodDescriptorProto method = 2;
+
+  optional ServiceOptions options = 3;
+}
+
+// Describes a method of a service.
+message MethodDescriptorProto {
+  optional string name = 1;
+
+  // Input and output type names.  These are resolved in the same way as
+  // FieldDescriptorProto.type_name, but must refer to a message type.
+  optional string input_type = 2;
+  optional string output_type = 3;
+
+  optional MethodOptions options = 4;
+}
+
+
+// ===================================================================
+// Options
+
+// Each of the definitions above may have "options" attached.  These are
+// just annotations which may cause code to be generated slightly differently
+// or may contain hints for code that manipulates protocol messages.
+//
+// Clients may define custom options as extensions of the *Options messages.
+// These extensions may not yet be known at parsing time, so the parser cannot
+// store the values in them.  Instead it stores them in a field in the *Options
+// message called uninterpreted_option. This field must have the same name
+// across all *Options messages. We then use this field to populate the
+// extensions when we build a descriptor, at which point all protos have been
+// parsed and so all extensions are known.
+//
+// Extension numbers for custom options may be chosen as follows:
+// * For options which will only be used within a single application or
+//   organization, or for experimental options, use field numbers 50000
+//   through 99999.  It is up to you to ensure that you do not use the
+//   same number for multiple options.
+// * For options which will be published and used publicly by multiple
+//   independent entities, e-mail protobuf-global-extension-registry@google.com
+//   to reserve extension numbers. Simply provide your project name (e.g.
+//   Object-C plugin) and your porject website (if available) -- there's no need
+//   to explain how you intend to use them. Usually you only need one extension
+//   number. You can declare multiple options with only one extension number by
+//   putting them in a sub-message. See the Custom Options section of the docs
+//   for examples:
+//   http://code.google.com/apis/protocolbuffers/docs/proto.html#options
+//   If this turns out to be popular, a web service will be set up
+//   to automatically assign option numbers.
+
+
+message FileOptions {
+
+  // Sets the Java package where classes generated from this .proto will be
+  // placed.  By default, the proto package is used, but this is often
+  // inappropriate because proto packages do not normally start with backwards
+  // domain names.
+  optional string java_package = 1;
+
+
+  // If set, all the classes from the .proto file are wrapped in a single
+  // outer class with the given name.  This applies to both Proto1
+  // (equivalent to the old "--one_java_file" option) and Proto2 (where
+  // a .proto always translates to a single class, but you may want to
+  // explicitly choose the class name).
+  optional string java_outer_classname = 8;
+
+  // If set true, then the Java code generator will generate a separate .java
+  // file for each top-level message, enum, and service defined in the .proto
+  // file.  Thus, these types will *not* be nested inside the outer class
+  // named by java_outer_classname.  However, the outer class will still be
+  // generated to contain the file's getDescriptor() method as well as any
+  // top-level extensions defined in the file.
+  optional bool java_multiple_files = 10 [default=false];
+
+  // If set true, then the Java code generator will generate equals() and
+  // hashCode() methods for all messages defined in the .proto file. This is
+  // purely a speed optimization, as the AbstractMessage base class includes
+  // reflection-based implementations of these methods.
+  optional bool java_generate_equals_and_hash = 20 [default=false];
+
+  // Generated classes can be optimized for speed or code size.
+  enum OptimizeMode {
+    SPEED = 1;        // Generate complete code for parsing, serialization,
+                      // etc.
+    CODE_SIZE = 2;    // Use ReflectionOps to implement these methods.
+    LITE_RUNTIME = 3; // Generate code using MessageLite and the lite runtime.
+  }
+  optional OptimizeMode optimize_for = 9 [default=SPEED];
+
+  // Sets the Go package where structs generated from this .proto will be
+  // placed.  There is no default.
+  optional string go_package = 11;
+
+
+
+  // Should generic services be generated in each language?  "Generic" services
+  // are not specific to any particular RPC system.  They are generated by the
+  // main code generators in each language (without additional plugins).
+  // Generic services were the only kind of service generation supported by
+  // early versions of proto2.
+  //
+  // Generic services are now considered deprecated in favor of using plugins
+  // that generate code specific to your particular RPC system.  Therefore,
+  // these default to false.  Old code which depends on generic services should
+  // explicitly set them to true.
+  optional bool cc_generic_services = 16 [default=false];
+  optional bool java_generic_services = 17 [default=false];
+  optional bool py_generic_services = 18 [default=false];
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message MessageOptions {
+  // Set true to use the old proto1 MessageSet wire format for extensions.
+  // This is provided for backwards-compatibility with the MessageSet wire
+  // format.  You should not use this for any other reason:  It's less
+  // efficient, has fewer features, and is more complicated.
+  //
+  // The message must be defined exactly as follows:
+  //   message Foo {
+  //     option message_set_wire_format = true;
+  //     extensions 4 to max;
+  //   }
+  // Note that the message cannot have any defined fields; MessageSets only
+  // have extensions.
+  //
+  // All extensions of your type must be singular messages; e.g. they cannot
+  // be int32s, enums, or repeated messages.
+  //
+  // Because this is an option, the above two restrictions are not enforced by
+  // the protocol compiler.
+  optional bool message_set_wire_format = 1 [default=false];
+
+  // Disables the generation of the standard "descriptor()" accessor, which can
+  // conflict with a field of the same name.  This is meant to make migration
+  // from proto1 easier; new code should avoid fields named "descriptor".
+  optional bool no_standard_descriptor_accessor = 2 [default=false];
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message FieldOptions {
+  // The ctype option instructs the C++ code generator to use a different
+  // representation of the field than it normally would.  See the specific
+  // options below.  This option is not yet implemented in the open source
+  // release -- sorry, we'll try to include it in a future version!
+  optional CType ctype = 1 [default = STRING];
+  enum CType {
+    // Default mode.
+    STRING = 0;
+
+    CORD = 1;
+
+    STRING_PIECE = 2;
+  }
+  // The packed option can be enabled for repeated primitive fields to enable
+  // a more efficient representation on the wire. Rather than repeatedly
+  // writing the tag and type for each element, the entire array is encoded as
+  // a single length-delimited blob.
+  optional bool packed = 2;
+
+
+
+  // Should this field be parsed lazily?  Lazy applies only to message-type
+  // fields.  It means that when the outer message is initially parsed, the
+  // inner message's contents will not be parsed but instead stored in encoded
+  // form.  The inner message will actually be parsed when it is first accessed.
+  //
+  // This is only a hint.  Implementations are free to choose whether to use
+  // eager or lazy parsing regardless of the value of this option.  However,
+  // setting this option true suggests that the protocol author believes that
+  // using lazy parsing on this field is worth the additional bookkeeping
+  // overhead typically needed to implement it.
+  //
+  // This option does not affect the public interface of any generated code;
+  // all method signatures remain the same.  Furthermore, thread-safety of the
+  // interface is not affected by this option; const methods remain safe to
+  // call from multiple threads concurrently, while non-const methods continue
+  // to require exclusive access.
+  //
+  //
+  // Note that implementations may choose not to check required fields within
+  // a lazy sub-message.  That is, calling IsInitialized() on the outher message
+  // may return true even if the inner message has missing required fields.
+  // This is necessary because otherwise the inner message would have to be
+  // parsed in order to perform the check, defeating the purpose of lazy
+  // parsing.  An implementation which chooses not to check required fields
+  // must be consistent about it.  That is, for any particular sub-message, the
+  // implementation must either *always* check its required fields, or *never*
+  // check its required fields, regardless of whether or not the message has
+  // been parsed.
+  optional bool lazy = 5 [default=false];
+
+  // Is this field deprecated?
+  // Depending on the target platform, this can emit Deprecated annotations
+  // for accessors, or it will be completely ignored; in the very least, this
+  // is a formalization for deprecating fields.
+  optional bool deprecated = 3 [default=false];
+
+  // EXPERIMENTAL.  DO NOT USE.
+  // For "map" fields, the name of the field in the enclosed type that
+  // is the key for this map.  For example, suppose we have:
+  //   message Item {
+  //     required string name = 1;
+  //     required string value = 2;
+  //   }
+  //   message Config {
+  //     repeated Item items = 1 [experimental_map_key="name"];
+  //   }
+  // In this situation, the map key for Item will be set to "name".
+  // TODO: Fully-implement this, then remove the "experimental_" prefix.
+  optional string experimental_map_key = 9;
+
+  // For Google-internal migration only. Do not use.
+  optional bool weak = 10 [default=false];
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message EnumOptions {
+
+  // Set this option to false to disallow mapping different tag names to a same
+  // value.
+  optional bool allow_alias = 2 [default=true];
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message EnumValueOptions {
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message ServiceOptions {
+
+  // Note:  Field numbers 1 through 32 are reserved for Google's internal RPC
+  //   framework.  We apologize for hoarding these numbers to ourselves, but
+  //   we were already using them long before we decided to release Protocol
+  //   Buffers.
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+message MethodOptions {
+
+  // Note:  Field numbers 1 through 32 are reserved for Google's internal RPC
+  //   framework.  We apologize for hoarding these numbers to ourselves, but
+  //   we were already using them long before we decided to release Protocol
+  //   Buffers.
+
+  // The parser stores options it doesn't recognize here. See above.
+  repeated UninterpretedOption uninterpreted_option = 999;
+
+  // Clients can define custom options in extensions of this message. See above.
+  extensions 1000 to max;
+}
+
+
+// A message representing a option the parser does not recognize. This only
+// appears in options protos created by the compiler::Parser class.
+// DescriptorPool resolves these when building Descriptor objects. Therefore,
+// options protos in descriptor objects (e.g. returned by Descriptor::options(),
+// or produced by Descriptor::CopyTo()) will never have UninterpretedOptions
+// in them.
+message UninterpretedOption {
+  // The name of the uninterpreted option.  Each string represents a segment in
+  // a dot-separated name.  is_extension is true iff a segment represents an
+  // extension (denoted with parentheses in options specs in .proto files).
+  // E.g.,{ ["foo", false], ["bar.baz", true], ["qux", false] } represents
+  // "foo.(bar.baz).qux".
+  message NamePart {
+    required string name_part = 1;
+    required bool is_extension = 2;
+  }
+  repeated NamePart name = 2;
+
+  // The value of the uninterpreted option, in whatever type the tokenizer
+  // identified it as during parsing. Exactly one of these should be set.
+  optional string identifier_value = 3;
+  optional uint64 positive_int_value = 4;
+  optional int64 negative_int_value = 5;
+  optional double double_value = 6;
+  optional bytes string_value = 7;
+  optional string aggregate_value = 8;
+}
+
+// ===================================================================
+// Optional source code info
+
+// Encapsulates information about the original source file from which a
+// FileDescriptorProto was generated.
+message SourceCodeInfo {
+  // A Location identifies a piece of source code in a .proto file which
+  // corresponds to a particular definition.  This information is intended
+  // to be useful to IDEs, code indexers, documentation generators, and similar
+  // tools.
+  //
+  // For example, say we have a file like:
+  //   message Foo {
+  //     optional string foo = 1;
+  //   }
+  // Let's look at just the field definition:
+  //   optional string foo = 1;
+  //   ^       ^^     ^^  ^  ^^^
+  //   a       bc     de  f  ghi
+  // We have the following locations:
+  //   span   path               represents
+  //   [a,i)  [ 4, 0, 2, 0 ]     The whole field definition.
+  //   [a,b)  [ 4, 0, 2, 0, 4 ]  The label (optional).
+  //   [c,d)  [ 4, 0, 2, 0, 5 ]  The type (string).
+  //   [e,f)  [ 4, 0, 2, 0, 1 ]  The name (foo).
+  //   [g,h)  [ 4, 0, 2, 0, 3 ]  The number (1).
+  //
+  // Notes:
+  // - A location may refer to a repeated field itself (i.e. not to any
+  //   particular index within it).  This is used whenever a set of elements are
+  //   logically enclosed in a single code segment.  For example, an entire
+  //   extend block (possibly containing multiple extension definitions) will
+  //   have an outer location whose path refers to the "extensions" repeated
+  //   field without an index.
+  // - Multiple locations may have the same path.  This happens when a single
+  //   logical declaration is spread out across multiple places.  The most
+  //   obvious example is the "extend" block again -- there may be multiple
+  //   extend blocks in the same scope, each of which will have the same path.
+  // - A location's span is not always a subset of its parent's span.  For
+  //   example, the "extendee" of an extension declaration appears at the
+  //   beginning of the "extend" block and is shared by all extensions within
+  //   the block.
+  // - Just because a location's span is a subset of some other location's span
+  //   does not mean that it is a descendent.  For example, a "group" defines
+  //   both a type and a field in a single declaration.  Thus, the locations
+  //   corresponding to the type and field and their components will overlap.
+  // - Code which tries to interpret locations should probably be designed to
+  //   ignore those that it doesn't understand, as more types of locations could
+  //   be recorded in the future.
+  repeated Location location = 1;
+  message Location {
+    // Identifies which part of the FileDescriptorProto was defined at this
+    // location.
+    //
+    // Each element is a field number or an index.  They form a path from
+    // the root FileDescriptorProto to the place where the definition.  For
+    // example, this path:
+    //   [ 4, 3, 2, 7, 1 ]
+    // refers to:
+    //   file.message_type(3)  // 4, 3
+    //       .field(7)         // 2, 7
+    //       .name()           // 1
+    // This is because FileDescriptorProto.message_type has field number 4:
+    //   repeated DescriptorProto message_type = 4;
+    // and DescriptorProto.field has field number 2:
+    //   repeated FieldDescriptorProto field = 2;
+    // and FieldDescriptorProto.name has field number 1:
+    //   optional string name = 1;
+    //
+    // Thus, the above path gives the location of a field name.  If we removed
+    // the last element:
+    //   [ 4, 3, 2, 7 ]
+    // this path refers to the whole field declaration (from the beginning
+    // of the label to the terminating semicolon).
+    repeated int32 path = 1 [packed=true];
+
+    // Always has exactly three or four elements: start line, start column,
+    // end line (optional, otherwise assumed same as start line), end column.
+    // These are packed into a single field for efficiency.  Note that line
+    // and column numbers are zero-based -- typically you will want to add
+    // 1 to each before displaying to a user.
+    repeated int32 span = 2 [packed=true];
+
+    // If this SourceCodeInfo represents a complete declaration, these are any
+    // comments appearing before and after the declaration which appear to be
+    // attached to the declaration.
+    //
+    // A series of line comments appearing on consecutive lines, with no other
+    // tokens appearing on those lines, will be treated as a single comment.
+    //
+    // Only the comment content is provided; comment markers (e.g. //) are
+    // stripped out.  For block comments, leading whitespace and an asterisk
+    // will be stripped from the beginning of each line other than the first.
+    // Newlines are included in the output.
+    //
+    // Examples:
+    //
+    //   optional int32 foo = 1;  // Comment attached to foo.
+    //   // Comment attached to bar.
+    //   optional int32 bar = 2;
+    //
+    //   optional string baz = 3;
+    //   // Comment attached to baz.
+    //   // Another line attached to baz.
+    //
+    //   // Comment attached to qux.
+    //   //
+    //   // Another line attached to qux.
+    //   optional double qux = 4;
+    //
+    //   optional string corge = 5;
+    //   /* Block comment attached
+    //    * to corge.  Leading asterisks
+    //    * will be removed. */
+    //   /* Block comment attached to
+    //    * grault. */
+    //   optional int32 grault = 6;
+    optional string leading_comments = 3;
+    optional string trailing_comments = 4;
+  }
+}
diff --git a/ps-lite/deps/include/google/protobuf/descriptor_database.h b/ps-lite/deps/include/google/protobuf/descriptor_database.h
new file mode 100644
index 00000000..2ccb1458
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/descriptor_database.h
@@ -0,0 +1,367 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Interface for manipulating databases of descriptors.
+
+#ifndef GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
+#define GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
+
+#include <map>
+#include <string>
+#include <utility>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/descriptor.h>
+
+namespace google {
+namespace protobuf {
+
+// Defined in this file.
+class DescriptorDatabase;
+class SimpleDescriptorDatabase;
+class EncodedDescriptorDatabase;
+class DescriptorPoolDatabase;
+class MergedDescriptorDatabase;
+
+// Abstract interface for a database of descriptors.
+//
+// This is useful if you want to create a DescriptorPool which loads
+// descriptors on-demand from some sort of large database.  If the database
+// is large, it may be inefficient to enumerate every .proto file inside it
+// calling DescriptorPool::BuildFile() for each one.  Instead, a DescriptorPool
+// can be created which wraps a DescriptorDatabase and only builds particular
+// descriptors when they are needed.
+class LIBPROTOBUF_EXPORT DescriptorDatabase {
+ public:
+  inline DescriptorDatabase() {}
+  virtual ~DescriptorDatabase();
+
+  // Find a file by file name.  Fills in in *output and returns true if found.
+  // Otherwise, returns false, leaving the contents of *output undefined.
+  virtual bool FindFileByName(const string& filename,
+                              FileDescriptorProto* output) = 0;
+
+  // Find the file that declares the given fully-qualified symbol name.
+  // If found, fills in *output and returns true, otherwise returns false
+  // and leaves *output undefined.
+  virtual bool FindFileContainingSymbol(const string& symbol_name,
+                                        FileDescriptorProto* output) = 0;
+
+  // Find the file which defines an extension extending the given message type
+  // with the given field number.  If found, fills in *output and returns true,
+  // otherwise returns false and leaves *output undefined.  containing_type
+  // must be a fully-qualified type name.
+  virtual bool FindFileContainingExtension(const string& containing_type,
+                                           int field_number,
+                                           FileDescriptorProto* output) = 0;
+
+  // Finds the tag numbers used by all known extensions of
+  // extendee_type, and appends them to output in an undefined
+  // order. This method is best-effort: it's not guaranteed that the
+  // database will find all extensions, and it's not guaranteed that
+  // FindFileContainingExtension will return true on all of the found
+  // numbers. Returns true if the search was successful, otherwise
+  // returns false and leaves output unchanged.
+  //
+  // This method has a default implementation that always returns
+  // false.
+  virtual bool FindAllExtensionNumbers(const string& extendee_type,
+                                       vector<int>* output) {
+    return false;
+  }
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorDatabase);
+};
+
+// A DescriptorDatabase into which you can insert files manually.
+//
+// FindFileContainingSymbol() is fully-implemented.  When you add a file, its
+// symbols will be indexed for this purpose.  Note that the implementation
+// may return false positives, but only if it isn't possible for the symbol
+// to be defined in any other file.  In particular, if a file defines a symbol
+// "Foo", then searching for "Foo.[anything]" will match that file.  This way,
+// the database does not need to aggressively index all children of a symbol.
+//
+// FindFileContainingExtension() is mostly-implemented.  It works if and only
+// if the original FieldDescriptorProto defining the extension has a
+// fully-qualified type name in its "extendee" field (i.e. starts with a '.').
+// If the extendee is a relative name, SimpleDescriptorDatabase will not
+// attempt to resolve the type, so it will not know what type the extension is
+// extending.  Therefore, calling FindFileContainingExtension() with the
+// extension's containing type will never actually find that extension.  Note
+// that this is an unlikely problem, as all FileDescriptorProtos created by the
+// protocol compiler (as well as ones created by calling
+// FileDescriptor::CopyTo()) will always use fully-qualified names for all
+// types.  You only need to worry if you are constructing FileDescriptorProtos
+// yourself, or are calling compiler::Parser directly.
+class LIBPROTOBUF_EXPORT SimpleDescriptorDatabase : public DescriptorDatabase {
+ public:
+  SimpleDescriptorDatabase();
+  ~SimpleDescriptorDatabase();
+
+  // Adds the FileDescriptorProto to the database, making a copy.  The object
+  // can be deleted after Add() returns.  Returns false if the file conflicted
+  // with a file already in the database, in which case an error will have
+  // been written to GOOGLE_LOG(ERROR).
+  bool Add(const FileDescriptorProto& file);
+
+  // Adds the FileDescriptorProto to the database and takes ownership of it.
+  bool AddAndOwn(const FileDescriptorProto* file);
+
+  // implements DescriptorDatabase -----------------------------------
+  bool FindFileByName(const string& filename,
+                      FileDescriptorProto* output);
+  bool FindFileContainingSymbol(const string& symbol_name,
+                                FileDescriptorProto* output);
+  bool FindFileContainingExtension(const string& containing_type,
+                                   int field_number,
+                                   FileDescriptorProto* output);
+  bool FindAllExtensionNumbers(const string& extendee_type,
+                               vector<int>* output);
+
+ private:
+  // So that it can use DescriptorIndex.
+  friend class EncodedDescriptorDatabase;
+
+  // An index mapping file names, symbol names, and extension numbers to
+  // some sort of values.
+  template <typename Value>
+  class DescriptorIndex {
+   public:
+    // Helpers to recursively add particular descriptors and all their contents
+    // to the index.
+    bool AddFile(const FileDescriptorProto& file,
+                 Value value);
+    bool AddSymbol(const string& name, Value value);
+    bool AddNestedExtensions(const DescriptorProto& message_type,
+                             Value value);
+    bool AddExtension(const FieldDescriptorProto& field,
+                      Value value);
+
+    Value FindFile(const string& filename);
+    Value FindSymbol(const string& name);
+    Value FindExtension(const string& containing_type, int field_number);
+    bool FindAllExtensionNumbers(const string& containing_type,
+                                 vector<int>* output);
+
+   private:
+    map<string, Value> by_name_;
+    map<string, Value> by_symbol_;
+    map<pair<string, int>, Value> by_extension_;
+
+    // Invariant:  The by_symbol_ map does not contain any symbols which are
+    // prefixes of other symbols in the map.  For example, "foo.bar" is a
+    // prefix of "foo.bar.baz" (but is not a prefix of "foo.barbaz").
+    //
+    // This invariant is important because it means that given a symbol name,
+    // we can find a key in the map which is a prefix of the symbol in O(lg n)
+    // time, and we know that there is at most one such key.
+    //
+    // The prefix lookup algorithm works like so:
+    // 1) Find the last key in the map which is less than or equal to the
+    //    search key.
+    // 2) If the found key is a prefix of the search key, then return it.
+    //    Otherwise, there is no match.
+    //
+    // I am sure this algorithm has been described elsewhere, but since I
+    // wasn't able to find it quickly I will instead prove that it works
+    // myself.  The key to the algorithm is that if a match exists, step (1)
+    // will find it.  Proof:
+    // 1) Define the "search key" to be the key we are looking for, the "found
+    //    key" to be the key found in step (1), and the "match key" to be the
+    //    key which actually matches the serach key (i.e. the key we're trying
+    //    to find).
+    // 2) The found key must be less than or equal to the search key by
+    //    definition.
+    // 3) The match key must also be less than or equal to the search key
+    //    (because it is a prefix).
+    // 4) The match key cannot be greater than the found key, because if it
+    //    were, then step (1) of the algorithm would have returned the match
+    //    key instead (since it finds the *greatest* key which is less than or
+    //    equal to the search key).
+    // 5) Therefore, the found key must be between the match key and the search
+    //    key, inclusive.
+    // 6) Since the search key must be a sub-symbol of the match key, if it is
+    //    not equal to the match key, then search_key[match_key.size()] must
+    //    be '.'.
+    // 7) Since '.' sorts before any other character that is valid in a symbol
+    //    name, then if the found key is not equal to the match key, then
+    //    found_key[match_key.size()] must also be '.', because any other value
+    //    would make it sort after the search key.
+    // 8) Therefore, if the found key is not equal to the match key, then the
+    //    found key must be a sub-symbol of the match key.  However, this would
+    //    contradict our map invariant which says that no symbol in the map is
+    //    a sub-symbol of any other.
+    // 9) Therefore, the found key must match the match key.
+    //
+    // The above proof assumes the match key exists.  In the case that the
+    // match key does not exist, then step (1) will return some other symbol.
+    // That symbol cannot be a super-symbol of the search key since if it were,
+    // then it would be a match, and we're assuming the match key doesn't exist.
+    // Therefore, step 2 will correctly return no match.
+
+    // Find the last entry in the by_symbol_ map whose key is less than or
+    // equal to the given name.
+    typename map<string, Value>::iterator FindLastLessOrEqual(
+        const string& name);
+
+    // True if either the arguments are equal or super_symbol identifies a
+    // parent symbol of sub_symbol (e.g. "foo.bar" is a parent of
+    // "foo.bar.baz", but not a parent of "foo.barbaz").
+    bool IsSubSymbol(const string& sub_symbol, const string& super_symbol);
+
+    // Returns true if and only if all characters in the name are alphanumerics,
+    // underscores, or periods.
+    bool ValidateSymbolName(const string& name);
+  };
+
+
+  DescriptorIndex<const FileDescriptorProto*> index_;
+  vector<const FileDescriptorProto*> files_to_delete_;
+
+  // If file is non-NULL, copy it into *output and return true, otherwise
+  // return false.
+  bool MaybeCopy(const FileDescriptorProto* file,
+                 FileDescriptorProto* output);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(SimpleDescriptorDatabase);
+};
+
+// Very similar to SimpleDescriptorDatabase, but stores all the descriptors
+// as raw bytes and generally tries to use as little memory as possible.
+//
+// The same caveats regarding FindFileContainingExtension() apply as with
+// SimpleDescriptorDatabase.
+class LIBPROTOBUF_EXPORT EncodedDescriptorDatabase : public DescriptorDatabase {
+ public:
+  EncodedDescriptorDatabase();
+  ~EncodedDescriptorDatabase();
+
+  // Adds the FileDescriptorProto to the database.  The descriptor is provided
+  // in encoded form.  The database does not make a copy of the bytes, nor
+  // does it take ownership; it's up to the caller to make sure the bytes
+  // remain valid for the life of the database.  Returns false and logs an error
+  // if the bytes are not a valid FileDescriptorProto or if the file conflicted
+  // with a file already in the database.
+  bool Add(const void* encoded_file_descriptor, int size);
+
+  // Like Add(), but makes a copy of the data, so that the caller does not
+  // need to keep it around.
+  bool AddCopy(const void* encoded_file_descriptor, int size);
+
+  // Like FindFileContainingSymbol but returns only the name of the file.
+  bool FindNameOfFileContainingSymbol(const string& symbol_name,
+                                      string* output);
+
+  // implements DescriptorDatabase -----------------------------------
+  bool FindFileByName(const string& filename,
+                      FileDescriptorProto* output);
+  bool FindFileContainingSymbol(const string& symbol_name,
+                                FileDescriptorProto* output);
+  bool FindFileContainingExtension(const string& containing_type,
+                                   int field_number,
+                                   FileDescriptorProto* output);
+  bool FindAllExtensionNumbers(const string& extendee_type,
+                               vector<int>* output);
+
+ private:
+  SimpleDescriptorDatabase::DescriptorIndex<pair<const void*, int> > index_;
+  vector<void*> files_to_delete_;
+
+  // If encoded_file.first is non-NULL, parse the data into *output and return
+  // true, otherwise return false.
+  bool MaybeParse(pair<const void*, int> encoded_file,
+                  FileDescriptorProto* output);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EncodedDescriptorDatabase);
+};
+
+// A DescriptorDatabase that fetches files from a given pool.
+class LIBPROTOBUF_EXPORT DescriptorPoolDatabase : public DescriptorDatabase {
+ public:
+  DescriptorPoolDatabase(const DescriptorPool& pool);
+  ~DescriptorPoolDatabase();
+
+  // implements DescriptorDatabase -----------------------------------
+  bool FindFileByName(const string& filename,
+                      FileDescriptorProto* output);
+  bool FindFileContainingSymbol(const string& symbol_name,
+                                FileDescriptorProto* output);
+  bool FindFileContainingExtension(const string& containing_type,
+                                   int field_number,
+                                   FileDescriptorProto* output);
+  bool FindAllExtensionNumbers(const string& extendee_type,
+                               vector<int>* output);
+
+ private:
+  const DescriptorPool& pool_;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorPoolDatabase);
+};
+
+// A DescriptorDatabase that wraps two or more others.  It first searches the
+// first database and, if that fails, tries the second, and so on.
+class LIBPROTOBUF_EXPORT MergedDescriptorDatabase : public DescriptorDatabase {
+ public:
+  // Merge just two databases.  The sources remain property of the caller.
+  MergedDescriptorDatabase(DescriptorDatabase* source1,
+                           DescriptorDatabase* source2);
+  // Merge more than two databases.  The sources remain property of the caller.
+  // The vector may be deleted after the constructor returns but the
+  // DescriptorDatabases need to stick around.
+  MergedDescriptorDatabase(const vector<DescriptorDatabase*>& sources);
+  ~MergedDescriptorDatabase();
+
+  // implements DescriptorDatabase -----------------------------------
+  bool FindFileByName(const string& filename,
+                      FileDescriptorProto* output);
+  bool FindFileContainingSymbol(const string& symbol_name,
+                                FileDescriptorProto* output);
+  bool FindFileContainingExtension(const string& containing_type,
+                                   int field_number,
+                                   FileDescriptorProto* output);
+  // Merges the results of calling all databases. Returns true iff any
+  // of the databases returned true.
+  bool FindAllExtensionNumbers(const string& extendee_type,
+                               vector<int>* output);
+
+ private:
+  vector<DescriptorDatabase*> sources_;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MergedDescriptorDatabase);
+};
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
diff --git a/ps-lite/deps/include/google/protobuf/dynamic_message.h b/ps-lite/deps/include/google/protobuf/dynamic_message.h
new file mode 100644
index 00000000..b3d1e5d2
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/dynamic_message.h
@@ -0,0 +1,136 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Defines an implementation of Message which can emulate types which are not
+// known at compile-time.
+
+#ifndef GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
+#define GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
+
+#include <google/protobuf/message.h>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+
+// Defined in other files.
+class Descriptor;        // descriptor.h
+class DescriptorPool;    // descriptor.h
+
+// Constructs implementations of Message which can emulate types which are not
+// known at compile-time.
+//
+// Sometimes you want to be able to manipulate protocol types that you don't
+// know about at compile time.  It would be nice to be able to construct
+// a Message object which implements the message type given by any arbitrary
+// Descriptor.  DynamicMessage provides this.
+//
+// As it turns out, a DynamicMessage needs to construct extra
+// information about its type in order to operate.  Most of this information
+// can be shared between all DynamicMessages of the same type.  But, caching
+// this information in some sort of global map would be a bad idea, since
+// the cached information for a particular descriptor could outlive the
+// descriptor itself.  To avoid this problem, DynamicMessageFactory
+// encapsulates this "cache".  All DynamicMessages of the same type created
+// from the same factory will share the same support data.  Any Descriptors
+// used with a particular factory must outlive the factory.
+class LIBPROTOBUF_EXPORT DynamicMessageFactory : public MessageFactory {
+ public:
+  // Construct a DynamicMessageFactory that will search for extensions in
+  // the DescriptorPool in which the extendee is defined.
+  DynamicMessageFactory();
+
+  // Construct a DynamicMessageFactory that will search for extensions in
+  // the given DescriptorPool.
+  //
+  // DEPRECATED:  Use CodedInputStream::SetExtensionRegistry() to tell the
+  //   parser to look for extensions in an alternate pool.  However, note that
+  //   this is almost never what you want to do.  Almost all users should use
+  //   the zero-arg constructor.
+  DynamicMessageFactory(const DescriptorPool* pool);
+
+  ~DynamicMessageFactory();
+
+  // Call this to tell the DynamicMessageFactory that if it is given a
+  // Descriptor d for which:
+  //   d->file()->pool() == DescriptorPool::generated_pool(),
+  // then it should delegate to MessageFactory::generated_factory() instead
+  // of constructing a dynamic implementation of the message.  In theory there
+  // is no down side to doing this, so it may become the default in the future.
+  void SetDelegateToGeneratedFactory(bool enable) {
+    delegate_to_generated_factory_ = enable;
+  }
+
+  // implements MessageFactory ---------------------------------------
+
+  // Given a Descriptor, constructs the default (prototype) Message of that
+  // type.  You can then call that message's New() method to construct a
+  // mutable message of that type.
+  //
+  // Calling this method twice with the same Descriptor returns the same
+  // object.  The returned object remains property of the factory and will
+  // be destroyed when the factory is destroyed.  Also, any objects created
+  // by calling the prototype's New() method share some data with the
+  // prototype, so these must be destroyed before the DynamicMessageFactory
+  // is destroyed.
+  //
+  // The given descriptor must outlive the returned message, and hence must
+  // outlive the DynamicMessageFactory.
+  //
+  // The method is thread-safe.
+  const Message* GetPrototype(const Descriptor* type);
+
+ private:
+  const DescriptorPool* pool_;
+  bool delegate_to_generated_factory_;
+
+  // This struct just contains a hash_map.  We can't #include <google/protobuf/stubs/hash.h> from
+  // this header due to hacks needed for hash_map portability in the open source
+  // release.  Namely, stubs/hash.h, which defines hash_map portably, is not a
+  // public header (for good reason), but dynamic_message.h is, and public
+  // headers may only #include other public headers.
+  struct PrototypeMap;
+  scoped_ptr<PrototypeMap> prototypes_;
+  mutable Mutex prototypes_mutex_;
+
+  friend class DynamicMessage;
+  const Message* GetPrototypeNoLock(const Descriptor* type);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DynamicMessageFactory);
+};
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
diff --git a/ps-lite/deps/include/google/protobuf/extension_set.h b/ps-lite/deps/include/google/protobuf/extension_set.h
new file mode 100644
index 00000000..df8f1f36
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/extension_set.h
@@ -0,0 +1,1007 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+
+#ifndef GOOGLE_PROTOBUF_EXTENSION_SET_H__
+#define GOOGLE_PROTOBUF_EXTENSION_SET_H__
+
+#include <vector>
+#include <map>
+#include <utility>
+#include <string>
+
+
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+
+namespace protobuf {
+  class Descriptor;                                    // descriptor.h
+  class FieldDescriptor;                               // descriptor.h
+  class DescriptorPool;                                // descriptor.h
+  class MessageLite;                                   // message_lite.h
+  class Message;                                       // message.h
+  class MessageFactory;                                // message.h
+  class UnknownFieldSet;                               // unknown_field_set.h
+  namespace io {
+    class CodedInputStream;                              // coded_stream.h
+    class CodedOutputStream;                             // coded_stream.h
+  }
+  namespace internal {
+    class FieldSkipper;                                  // wire_format_lite.h
+    class RepeatedPtrFieldBase;                          // repeated_field.h
+  }
+  template <typename Element> class RepeatedField;     // repeated_field.h
+  template <typename Element> class RepeatedPtrField;  // repeated_field.h
+}
+
+namespace protobuf {
+namespace internal {
+
+// Used to store values of type WireFormatLite::FieldType without having to
+// #include wire_format_lite.h.  Also, ensures that we use only one byte to
+// store these values, which is important to keep the layout of
+// ExtensionSet::Extension small.
+typedef uint8 FieldType;
+
+// A function which, given an integer value, returns true if the number
+// matches one of the defined values for the corresponding enum type.  This
+// is used with RegisterEnumExtension, below.
+typedef bool EnumValidityFunc(int number);
+
+// Version of the above which takes an argument.  This is needed to deal with
+// extensions that are not compiled in.
+typedef bool EnumValidityFuncWithArg(const void* arg, int number);
+
+// Information about a registered extension.
+struct ExtensionInfo {
+  inline ExtensionInfo() {}
+  inline ExtensionInfo(FieldType type_param, bool isrepeated, bool ispacked)
+      : type(type_param), is_repeated(isrepeated), is_packed(ispacked),
+        descriptor(NULL) {}
+
+  FieldType type;
+  bool is_repeated;
+  bool is_packed;
+
+  struct EnumValidityCheck {
+    EnumValidityFuncWithArg* func;
+    const void* arg;
+  };
+
+  union {
+    EnumValidityCheck enum_validity_check;
+    const MessageLite* message_prototype;
+  };
+
+  // The descriptor for this extension, if one exists and is known.  May be
+  // NULL.  Must not be NULL if the descriptor for the extension does not
+  // live in the same pool as the descriptor for the containing type.
+  const FieldDescriptor* descriptor;
+};
+
+// Abstract interface for an object which looks up extension definitions.  Used
+// when parsing.
+class LIBPROTOBUF_EXPORT ExtensionFinder {
+ public:
+  virtual ~ExtensionFinder();
+
+  // Find the extension with the given containing type and number.
+  virtual bool Find(int number, ExtensionInfo* output) = 0;
+};
+
+// Implementation of ExtensionFinder which finds extensions defined in .proto
+// files which have been compiled into the binary.
+class LIBPROTOBUF_EXPORT GeneratedExtensionFinder : public ExtensionFinder {
+ public:
+  GeneratedExtensionFinder(const MessageLite* containing_type)
+      : containing_type_(containing_type) {}
+  virtual ~GeneratedExtensionFinder() {}
+
+  // Returns true and fills in *output if found, otherwise returns false.
+  virtual bool Find(int number, ExtensionInfo* output);
+
+ private:
+  const MessageLite* containing_type_;
+};
+
+// Note:  extension_set_heavy.cc defines DescriptorPoolExtensionFinder for
+// finding extensions from a DescriptorPool.
+
+// This is an internal helper class intended for use within the protocol buffer
+// library and generated classes.  Clients should not use it directly.  Instead,
+// use the generated accessors such as GetExtension() of the class being
+// extended.
+//
+// This class manages extensions for a protocol message object.  The
+// message's HasExtension(), GetExtension(), MutableExtension(), and
+// ClearExtension() methods are just thin wrappers around the embedded
+// ExtensionSet.  When parsing, if a tag number is encountered which is
+// inside one of the message type's extension ranges, the tag is passed
+// off to the ExtensionSet for parsing.  Etc.
+class LIBPROTOBUF_EXPORT ExtensionSet {
+ public:
+  ExtensionSet();
+  ~ExtensionSet();
+
+  // These are called at startup by protocol-compiler-generated code to
+  // register known extensions.  The registrations are used by ParseField()
+  // to look up extensions for parsed field numbers.  Note that dynamic parsing
+  // does not use ParseField(); only protocol-compiler-generated parsing
+  // methods do.
+  static void RegisterExtension(const MessageLite* containing_type,
+                                int number, FieldType type,
+                                bool is_repeated, bool is_packed);
+  static void RegisterEnumExtension(const MessageLite* containing_type,
+                                    int number, FieldType type,
+                                    bool is_repeated, bool is_packed,
+                                    EnumValidityFunc* is_valid);
+  static void RegisterMessageExtension(const MessageLite* containing_type,
+                                       int number, FieldType type,
+                                       bool is_repeated, bool is_packed,
+                                       const MessageLite* prototype);
+
+  // =================================================================
+
+  // Add all fields which are currently present to the given vector.  This
+  // is useful to implement Reflection::ListFields().
+  void AppendToList(const Descriptor* containing_type,
+                    const DescriptorPool* pool,
+                    vector<const FieldDescriptor*>* output) const;
+
+  // =================================================================
+  // Accessors
+  //
+  // Generated message classes include type-safe templated wrappers around
+  // these methods.  Generally you should use those rather than call these
+  // directly, unless you are doing low-level memory management.
+  //
+  // When calling any of these accessors, the extension number requested
+  // MUST exist in the DescriptorPool provided to the constructor.  Otheriwse,
+  // the method will fail an assert.  Normally, though, you would not call
+  // these directly; you would either call the generated accessors of your
+  // message class (e.g. GetExtension()) or you would call the accessors
+  // of the reflection interface.  In both cases, it is impossible to
+  // trigger this assert failure:  the generated accessors only accept
+  // linked-in extension types as parameters, while the Reflection interface
+  // requires you to provide the FieldDescriptor describing the extension.
+  //
+  // When calling any of these accessors, a protocol-compiler-generated
+  // implementation of the extension corresponding to the number MUST
+  // be linked in, and the FieldDescriptor used to refer to it MUST be
+  // the one generated by that linked-in code.  Otherwise, the method will
+  // die on an assert failure.  The message objects returned by the message
+  // accessors are guaranteed to be of the correct linked-in type.
+  //
+  // These methods pretty much match Reflection except that:
+  // - They're not virtual.
+  // - They identify fields by number rather than FieldDescriptors.
+  // - They identify enum values using integers rather than descriptors.
+  // - Strings provide Mutable() in addition to Set() accessors.
+
+  bool Has(int number) const;
+  int ExtensionSize(int number) const;   // Size of a repeated extension.
+  int NumExtensions() const;  // The number of extensions
+  FieldType ExtensionType(int number) const;
+  void ClearExtension(int number);
+
+  // singular fields -------------------------------------------------
+
+  int32  GetInt32 (int number, int32  default_value) const;
+  int64  GetInt64 (int number, int64  default_value) const;
+  uint32 GetUInt32(int number, uint32 default_value) const;
+  uint64 GetUInt64(int number, uint64 default_value) const;
+  float  GetFloat (int number, float  default_value) const;
+  double GetDouble(int number, double default_value) const;
+  bool   GetBool  (int number, bool   default_value) const;
+  int    GetEnum  (int number, int    default_value) const;
+  const string & GetString (int number, const string&  default_value) const;
+  const MessageLite& GetMessage(int number,
+                                const MessageLite& default_value) const;
+  const MessageLite& GetMessage(int number, const Descriptor* message_type,
+                                MessageFactory* factory) const;
+
+  // |descriptor| may be NULL so long as it is known that the descriptor for
+  // the extension lives in the same pool as the descriptor for the containing
+  // type.
+#define desc const FieldDescriptor* descriptor  // avoid line wrapping
+  void SetInt32 (int number, FieldType type, int32  value, desc);
+  void SetInt64 (int number, FieldType type, int64  value, desc);
+  void SetUInt32(int number, FieldType type, uint32 value, desc);
+  void SetUInt64(int number, FieldType type, uint64 value, desc);
+  void SetFloat (int number, FieldType type, float  value, desc);
+  void SetDouble(int number, FieldType type, double value, desc);
+  void SetBool  (int number, FieldType type, bool   value, desc);
+  void SetEnum  (int number, FieldType type, int    value, desc);
+  void SetString(int number, FieldType type, const string& value, desc);
+  string * MutableString (int number, FieldType type, desc);
+  MessageLite* MutableMessage(int number, FieldType type,
+                              const MessageLite& prototype, desc);
+  MessageLite* MutableMessage(const FieldDescriptor* decsriptor,
+                              MessageFactory* factory);
+  // Adds the given message to the ExtensionSet, taking ownership of the
+  // message object. Existing message with the same number will be deleted.
+  // If "message" is NULL, this is equivalent to "ClearExtension(number)".
+  void SetAllocatedMessage(int number, FieldType type,
+                           const FieldDescriptor* descriptor,
+                           MessageLite* message);
+  MessageLite* ReleaseMessage(int number, const MessageLite& prototype);
+  MessageLite* ReleaseMessage(const FieldDescriptor* descriptor,
+                              MessageFactory* factory);
+#undef desc
+
+  // repeated fields -------------------------------------------------
+
+  void* MutableRawRepeatedField(int number);
+
+  int32  GetRepeatedInt32 (int number, int index) const;
+  int64  GetRepeatedInt64 (int number, int index) const;
+  uint32 GetRepeatedUInt32(int number, int index) const;
+  uint64 GetRepeatedUInt64(int number, int index) const;
+  float  GetRepeatedFloat (int number, int index) const;
+  double GetRepeatedDouble(int number, int index) const;
+  bool   GetRepeatedBool  (int number, int index) const;
+  int    GetRepeatedEnum  (int number, int index) const;
+  const string & GetRepeatedString (int number, int index) const;
+  const MessageLite& GetRepeatedMessage(int number, int index) const;
+
+  void SetRepeatedInt32 (int number, int index, int32  value);
+  void SetRepeatedInt64 (int number, int index, int64  value);
+  void SetRepeatedUInt32(int number, int index, uint32 value);
+  void SetRepeatedUInt64(int number, int index, uint64 value);
+  void SetRepeatedFloat (int number, int index, float  value);
+  void SetRepeatedDouble(int number, int index, double value);
+  void SetRepeatedBool  (int number, int index, bool   value);
+  void SetRepeatedEnum  (int number, int index, int    value);
+  void SetRepeatedString(int number, int index, const string& value);
+  string * MutableRepeatedString (int number, int index);
+  MessageLite* MutableRepeatedMessage(int number, int index);
+
+#define desc const FieldDescriptor* descriptor  // avoid line wrapping
+  void AddInt32 (int number, FieldType type, bool packed, int32  value, desc);
+  void AddInt64 (int number, FieldType type, bool packed, int64  value, desc);
+  void AddUInt32(int number, FieldType type, bool packed, uint32 value, desc);
+  void AddUInt64(int number, FieldType type, bool packed, uint64 value, desc);
+  void AddFloat (int number, FieldType type, bool packed, float  value, desc);
+  void AddDouble(int number, FieldType type, bool packed, double value, desc);
+  void AddBool  (int number, FieldType type, bool packed, bool   value, desc);
+  void AddEnum  (int number, FieldType type, bool packed, int    value, desc);
+  void AddString(int number, FieldType type, const string& value, desc);
+  string * AddString (int number, FieldType type, desc);
+  MessageLite* AddMessage(int number, FieldType type,
+                          const MessageLite& prototype, desc);
+  MessageLite* AddMessage(const FieldDescriptor* descriptor,
+                          MessageFactory* factory);
+#undef desc
+
+  void RemoveLast(int number);
+  MessageLite* ReleaseLast(int number);
+  void SwapElements(int number, int index1, int index2);
+
+  // -----------------------------------------------------------------
+  // TODO(kenton):  Hardcore memory management accessors
+
+  // =================================================================
+  // convenience methods for implementing methods of Message
+  //
+  // These could all be implemented in terms of the other methods of this
+  // class, but providing them here helps keep the generated code size down.
+
+  void Clear();
+  void MergeFrom(const ExtensionSet& other);
+  void Swap(ExtensionSet* other);
+  bool IsInitialized() const;
+
+  // Parses a single extension from the input. The input should start out
+  // positioned immediately after the tag.
+  bool ParseField(uint32 tag, io::CodedInputStream* input,
+                  ExtensionFinder* extension_finder,
+                  FieldSkipper* field_skipper);
+
+  // Specific versions for lite or full messages (constructs the appropriate
+  // FieldSkipper automatically).  |containing_type| is the default
+  // instance for the containing message; it is used only to look up the
+  // extension by number.  See RegisterExtension(), above.  Unlike the other
+  // methods of ExtensionSet, this only works for generated message types --
+  // it looks up extensions registered using RegisterExtension().
+  bool ParseField(uint32 tag, io::CodedInputStream* input,
+                  const MessageLite* containing_type);
+  bool ParseField(uint32 tag, io::CodedInputStream* input,
+                  const Message* containing_type,
+                  UnknownFieldSet* unknown_fields);
+
+  // Parse an entire message in MessageSet format.  Such messages have no
+  // fields, only extensions.
+  bool ParseMessageSet(io::CodedInputStream* input,
+                       ExtensionFinder* extension_finder,
+                       FieldSkipper* field_skipper);
+
+  // Specific versions for lite or full messages (constructs the appropriate
+  // FieldSkipper automatically).
+  bool ParseMessageSet(io::CodedInputStream* input,
+                       const MessageLite* containing_type);
+  bool ParseMessageSet(io::CodedInputStream* input,
+                       const Message* containing_type,
+                       UnknownFieldSet* unknown_fields);
+
+  // Write all extension fields with field numbers in the range
+  //   [start_field_number, end_field_number)
+  // to the output stream, using the cached sizes computed when ByteSize() was
+  // last called.  Note that the range bounds are inclusive-exclusive.
+  void SerializeWithCachedSizes(int start_field_number,
+                                int end_field_number,
+                                io::CodedOutputStream* output) const;
+
+  // Same as SerializeWithCachedSizes, but without any bounds checking.
+  // The caller must ensure that target has sufficient capacity for the
+  // serialized extensions.
+  //
+  // Returns a pointer past the last written byte.
+  uint8* SerializeWithCachedSizesToArray(int start_field_number,
+                                         int end_field_number,
+                                         uint8* target) const;
+
+  // Like above but serializes in MessageSet format.
+  void SerializeMessageSetWithCachedSizes(io::CodedOutputStream* output) const;
+  uint8* SerializeMessageSetWithCachedSizesToArray(uint8* target) const;
+
+  // Returns the total serialized size of all the extensions.
+  int ByteSize() const;
+
+  // Like ByteSize() but uses MessageSet format.
+  int MessageSetByteSize() const;
+
+  // Returns (an estimate of) the total number of bytes used for storing the
+  // extensions in memory, excluding sizeof(*this).  If the ExtensionSet is
+  // for a lite message (and thus possibly contains lite messages), the results
+  // are undefined (might work, might crash, might corrupt data, might not even
+  // be linked in).  It's up to the protocol compiler to avoid calling this on
+  // such ExtensionSets (easy enough since lite messages don't implement
+  // SpaceUsed()).
+  int SpaceUsedExcludingSelf() const;
+
+ private:
+
+  // Interface of a lazily parsed singular message extension.
+  class LIBPROTOBUF_EXPORT LazyMessageExtension {
+   public:
+    LazyMessageExtension() {}
+    virtual ~LazyMessageExtension() {}
+
+    virtual LazyMessageExtension* New() const = 0;
+    virtual const MessageLite& GetMessage(
+        const MessageLite& prototype) const = 0;
+    virtual MessageLite* MutableMessage(const MessageLite& prototype) = 0;
+    virtual void SetAllocatedMessage(MessageLite *message) = 0;
+    virtual MessageLite* ReleaseMessage(const MessageLite& prototype) = 0;
+
+    virtual bool IsInitialized() const = 0;
+    virtual int ByteSize() const = 0;
+    virtual int SpaceUsed() const = 0;
+
+    virtual void MergeFrom(const LazyMessageExtension& other) = 0;
+    virtual void Clear() = 0;
+
+    virtual bool ReadMessage(const MessageLite& prototype,
+                             io::CodedInputStream* input) = 0;
+    virtual void WriteMessage(int number,
+                              io::CodedOutputStream* output) const = 0;
+    virtual uint8* WriteMessageToArray(int number, uint8* target) const = 0;
+   private:
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(LazyMessageExtension);
+  };
+  struct Extension {
+    // The order of these fields packs Extension into 24 bytes when using 8
+    // byte alignment. Consider this when adding or removing fields here.
+    union {
+      int32                 int32_value;
+      int64                 int64_value;
+      uint32                uint32_value;
+      uint64                uint64_value;
+      float                 float_value;
+      double                double_value;
+      bool                  bool_value;
+      int                   enum_value;
+      string*               string_value;
+      MessageLite*          message_value;
+      LazyMessageExtension* lazymessage_value;
+
+      RepeatedField   <int32      >* repeated_int32_value;
+      RepeatedField   <int64      >* repeated_int64_value;
+      RepeatedField   <uint32     >* repeated_uint32_value;
+      RepeatedField   <uint64     >* repeated_uint64_value;
+      RepeatedField   <float      >* repeated_float_value;
+      RepeatedField   <double     >* repeated_double_value;
+      RepeatedField   <bool       >* repeated_bool_value;
+      RepeatedField   <int        >* repeated_enum_value;
+      RepeatedPtrField<string     >* repeated_string_value;
+      RepeatedPtrField<MessageLite>* repeated_message_value;
+    };
+
+    FieldType type;
+    bool is_repeated;
+
+    // For singular types, indicates if the extension is "cleared".  This
+    // happens when an extension is set and then later cleared by the caller.
+    // We want to keep the Extension object around for reuse, so instead of
+    // removing it from the map, we just set is_cleared = true.  This has no
+    // meaning for repeated types; for those, the size of the RepeatedField
+    // simply becomes zero when cleared.
+    bool is_cleared : 4;
+
+    // For singular message types, indicates whether lazy parsing is enabled
+    // for this extension. This field is only valid when type == TYPE_MESSAGE
+    // and !is_repeated because we only support lazy parsing for singular
+    // message types currently. If is_lazy = true, the extension is stored in
+    // lazymessage_value. Otherwise, the extension will be message_value.
+    bool is_lazy : 4;
+
+    // For repeated types, this indicates if the [packed=true] option is set.
+    bool is_packed;
+
+    // For packed fields, the size of the packed data is recorded here when
+    // ByteSize() is called then used during serialization.
+    // TODO(kenton):  Use atomic<int> when C++ supports it.
+    mutable int cached_size;
+
+    // The descriptor for this extension, if one exists and is known.  May be
+    // NULL.  Must not be NULL if the descriptor for the extension does not
+    // live in the same pool as the descriptor for the containing type.
+    const FieldDescriptor* descriptor;
+
+    // Some helper methods for operations on a single Extension.
+    void SerializeFieldWithCachedSizes(
+        int number,
+        io::CodedOutputStream* output) const;
+    uint8* SerializeFieldWithCachedSizesToArray(
+        int number,
+        uint8* target) const;
+    void SerializeMessageSetItemWithCachedSizes(
+        int number,
+        io::CodedOutputStream* output) const;
+    uint8* SerializeMessageSetItemWithCachedSizesToArray(
+        int number,
+        uint8* target) const;
+    int ByteSize(int number) const;
+    int MessageSetItemByteSize(int number) const;
+    void Clear();
+    int GetSize() const;
+    void Free();
+    int SpaceUsedExcludingSelf() const;
+  };
+
+
+  // Returns true and fills field_number and extension if extension is found.
+  bool FindExtensionInfoFromTag(uint32 tag, ExtensionFinder* extension_finder,
+                                int* field_number, ExtensionInfo* extension);
+
+  // Parses a single extension from the input. The input should start out
+  // positioned immediately after the wire tag. This method is called in
+  // ParseField() after field number is extracted from the wire tag and
+  // ExtensionInfo is found by the field number.
+  bool ParseFieldWithExtensionInfo(int field_number,
+                                   const ExtensionInfo& extension,
+                                   io::CodedInputStream* input,
+                                   FieldSkipper* field_skipper);
+
+  // Like ParseField(), but this method may parse singular message extensions
+  // lazily depending on the value of FLAGS_eagerly_parse_message_sets.
+  bool ParseFieldMaybeLazily(uint32 tag, io::CodedInputStream* input,
+                             ExtensionFinder* extension_finder,
+                             FieldSkipper* field_skipper);
+
+  // Gets the extension with the given number, creating it if it does not
+  // already exist.  Returns true if the extension did not already exist.
+  bool MaybeNewExtension(int number, const FieldDescriptor* descriptor,
+                         Extension** result);
+
+  // Parse a single MessageSet item -- called just after the item group start
+  // tag has been read.
+  bool ParseMessageSetItem(io::CodedInputStream* input,
+                           ExtensionFinder* extension_finder,
+                           FieldSkipper* field_skipper);
+
+
+  // Hack:  RepeatedPtrFieldBase declares ExtensionSet as a friend.  This
+  //   friendship should automatically extend to ExtensionSet::Extension, but
+  //   unfortunately some older compilers (e.g. GCC 3.4.4) do not implement this
+  //   correctly.  So, we must provide helpers for calling methods of that
+  //   class.
+
+  // Defined in extension_set_heavy.cc.
+  static inline int RepeatedMessage_SpaceUsedExcludingSelf(
+      RepeatedPtrFieldBase* field);
+
+  // The Extension struct is small enough to be passed by value, so we use it
+  // directly as the value type in the map rather than use pointers.  We use
+  // a map rather than hash_map here because we expect most ExtensionSets will
+  // only contain a small number of extensions whereas hash_map is optimized
+  // for 100 elements or more.  Also, we want AppendToList() to order fields
+  // by field number.
+  std::map<int, Extension> extensions_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ExtensionSet);
+};
+
+// These are just for convenience...
+inline void ExtensionSet::SetString(int number, FieldType type,
+                                    const string& value,
+                                    const FieldDescriptor* descriptor) {
+  MutableString(number, type, descriptor)->assign(value);
+}
+inline void ExtensionSet::SetRepeatedString(int number, int index,
+                                            const string& value) {
+  MutableRepeatedString(number, index)->assign(value);
+}
+inline void ExtensionSet::AddString(int number, FieldType type,
+                                    const string& value,
+                                    const FieldDescriptor* descriptor) {
+  AddString(number, type, descriptor)->assign(value);
+}
+
+// ===================================================================
+// Glue for generated extension accessors
+
+// -------------------------------------------------------------------
+// Template magic
+
+// First we have a set of classes representing "type traits" for different
+// field types.  A type traits class knows how to implement basic accessors
+// for extensions of a particular type given an ExtensionSet.  The signature
+// for a type traits class looks like this:
+//
+//   class TypeTraits {
+//    public:
+//     typedef ? ConstType;
+//     typedef ? MutableType;
+//
+//     static inline ConstType Get(int number, const ExtensionSet& set);
+//     static inline void Set(int number, ConstType value, ExtensionSet* set);
+//     static inline MutableType Mutable(int number, ExtensionSet* set);
+//
+//     // Variants for repeated fields.
+//     static inline ConstType Get(int number, const ExtensionSet& set,
+//                                 int index);
+//     static inline void Set(int number, int index,
+//                            ConstType value, ExtensionSet* set);
+//     static inline MutableType Mutable(int number, int index,
+//                                       ExtensionSet* set);
+//     static inline void Add(int number, ConstType value, ExtensionSet* set);
+//     static inline MutableType Add(int number, ExtensionSet* set);
+//   };
+//
+// Not all of these methods make sense for all field types.  For example, the
+// "Mutable" methods only make sense for strings and messages, and the
+// repeated methods only make sense for repeated types.  So, each type
+// traits class implements only the set of methods from this signature that it
+// actually supports.  This will cause a compiler error if the user tries to
+// access an extension using a method that doesn't make sense for its type.
+// For example, if "foo" is an extension of type "optional int32", then if you
+// try to write code like:
+//   my_message.MutableExtension(foo)
+// you will get a compile error because PrimitiveTypeTraits<int32> does not
+// have a "Mutable()" method.
+
+// -------------------------------------------------------------------
+// PrimitiveTypeTraits
+
+// Since the ExtensionSet has different methods for each primitive type,
+// we must explicitly define the methods of the type traits class for each
+// known type.
+template <typename Type>
+class PrimitiveTypeTraits {
+ public:
+  typedef Type ConstType;
+
+  static inline ConstType Get(int number, const ExtensionSet& set,
+                              ConstType default_value);
+  static inline void Set(int number, FieldType field_type,
+                         ConstType value, ExtensionSet* set);
+};
+
+template <typename Type>
+class RepeatedPrimitiveTypeTraits {
+ public:
+  typedef Type ConstType;
+
+  static inline Type Get(int number, const ExtensionSet& set, int index);
+  static inline void Set(int number, int index, Type value, ExtensionSet* set);
+  static inline void Add(int number, FieldType field_type,
+                         bool is_packed, Type value, ExtensionSet* set);
+};
+
+#define PROTOBUF_DEFINE_PRIMITIVE_TYPE(TYPE, METHOD)                       \
+template<> inline TYPE PrimitiveTypeTraits<TYPE>::Get(                     \
+    int number, const ExtensionSet& set, TYPE default_value) {             \
+  return set.Get##METHOD(number, default_value);                           \
+}                                                                          \
+template<> inline void PrimitiveTypeTraits<TYPE>::Set(                     \
+    int number, FieldType field_type, TYPE value, ExtensionSet* set) {     \
+  set->Set##METHOD(number, field_type, value, NULL);                       \
+}                                                                          \
+                                                                           \
+template<> inline TYPE RepeatedPrimitiveTypeTraits<TYPE>::Get(             \
+    int number, const ExtensionSet& set, int index) {                      \
+  return set.GetRepeated##METHOD(number, index);                           \
+}                                                                          \
+template<> inline void RepeatedPrimitiveTypeTraits<TYPE>::Set(             \
+    int number, int index, TYPE value, ExtensionSet* set) {                \
+  set->SetRepeated##METHOD(number, index, value);                          \
+}                                                                          \
+template<> inline void RepeatedPrimitiveTypeTraits<TYPE>::Add(             \
+    int number, FieldType field_type, bool is_packed,                      \
+    TYPE value, ExtensionSet* set) {                                       \
+  set->Add##METHOD(number, field_type, is_packed, value, NULL);            \
+}
+
+PROTOBUF_DEFINE_PRIMITIVE_TYPE( int32,  Int32)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE( int64,  Int64)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE(uint32, UInt32)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE(uint64, UInt64)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE( float,  Float)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE(double, Double)
+PROTOBUF_DEFINE_PRIMITIVE_TYPE(  bool,   Bool)
+
+#undef PROTOBUF_DEFINE_PRIMITIVE_TYPE
+
+// -------------------------------------------------------------------
+// StringTypeTraits
+
+// Strings support both Set() and Mutable().
+class LIBPROTOBUF_EXPORT StringTypeTraits {
+ public:
+  typedef const string& ConstType;
+  typedef string* MutableType;
+
+  static inline const string& Get(int number, const ExtensionSet& set,
+                                  ConstType default_value) {
+    return set.GetString(number, default_value);
+  }
+  static inline void Set(int number, FieldType field_type,
+                         const string& value, ExtensionSet* set) {
+    set->SetString(number, field_type, value, NULL);
+  }
+  static inline string* Mutable(int number, FieldType field_type,
+                                ExtensionSet* set) {
+    return set->MutableString(number, field_type, NULL);
+  }
+};
+
+class LIBPROTOBUF_EXPORT RepeatedStringTypeTraits {
+ public:
+  typedef const string& ConstType;
+  typedef string* MutableType;
+
+  static inline const string& Get(int number, const ExtensionSet& set,
+                                  int index) {
+    return set.GetRepeatedString(number, index);
+  }
+  static inline void Set(int number, int index,
+                         const string& value, ExtensionSet* set) {
+    set->SetRepeatedString(number, index, value);
+  }
+  static inline string* Mutable(int number, int index, ExtensionSet* set) {
+    return set->MutableRepeatedString(number, index);
+  }
+  static inline void Add(int number, FieldType field_type,
+                         bool /*is_packed*/, const string& value,
+                         ExtensionSet* set) {
+    set->AddString(number, field_type, value, NULL);
+  }
+  static inline string* Add(int number, FieldType field_type,
+                            ExtensionSet* set) {
+    return set->AddString(number, field_type, NULL);
+  }
+};
+
+// -------------------------------------------------------------------
+// EnumTypeTraits
+
+// ExtensionSet represents enums using integers internally, so we have to
+// static_cast around.
+template <typename Type, bool IsValid(int)>
+class EnumTypeTraits {
+ public:
+  typedef Type ConstType;
+
+  static inline ConstType Get(int number, const ExtensionSet& set,
+                              ConstType default_value) {
+    return static_cast<Type>(set.GetEnum(number, default_value));
+  }
+  static inline void Set(int number, FieldType field_type,
+                         ConstType value, ExtensionSet* set) {
+    GOOGLE_DCHECK(IsValid(value));
+    set->SetEnum(number, field_type, value, NULL);
+  }
+};
+
+template <typename Type, bool IsValid(int)>
+class RepeatedEnumTypeTraits {
+ public:
+  typedef Type ConstType;
+
+  static inline ConstType Get(int number, const ExtensionSet& set, int index) {
+    return static_cast<Type>(set.GetRepeatedEnum(number, index));
+  }
+  static inline void Set(int number, int index,
+                         ConstType value, ExtensionSet* set) {
+    GOOGLE_DCHECK(IsValid(value));
+    set->SetRepeatedEnum(number, index, value);
+  }
+  static inline void Add(int number, FieldType field_type,
+                         bool is_packed, ConstType value, ExtensionSet* set) {
+    GOOGLE_DCHECK(IsValid(value));
+    set->AddEnum(number, field_type, is_packed, value, NULL);
+  }
+};
+
+// -------------------------------------------------------------------
+// MessageTypeTraits
+
+// ExtensionSet guarantees that when manipulating extensions with message
+// types, the implementation used will be the compiled-in class representing
+// that type.  So, we can static_cast down to the exact type we expect.
+template <typename Type>
+class MessageTypeTraits {
+ public:
+  typedef const Type& ConstType;
+  typedef Type* MutableType;
+
+  static inline ConstType Get(int number, const ExtensionSet& set,
+                              ConstType default_value) {
+    return static_cast<const Type&>(
+        set.GetMessage(number, default_value));
+  }
+  static inline MutableType Mutable(int number, FieldType field_type,
+                                    ExtensionSet* set) {
+    return static_cast<Type*>(
+      set->MutableMessage(number, field_type, Type::default_instance(), NULL));
+  }
+  static inline void SetAllocated(int number, FieldType field_type,
+                                  MutableType message, ExtensionSet* set) {
+    set->SetAllocatedMessage(number, field_type, NULL, message);
+  }
+  static inline MutableType Release(int number, FieldType field_type,
+                                    ExtensionSet* set) {
+    return static_cast<Type*>(set->ReleaseMessage(
+        number, Type::default_instance()));
+  }
+};
+
+template <typename Type>
+class RepeatedMessageTypeTraits {
+ public:
+  typedef const Type& ConstType;
+  typedef Type* MutableType;
+
+  static inline ConstType Get(int number, const ExtensionSet& set, int index) {
+    return static_cast<const Type&>(set.GetRepeatedMessage(number, index));
+  }
+  static inline MutableType Mutable(int number, int index, ExtensionSet* set) {
+    return static_cast<Type*>(set->MutableRepeatedMessage(number, index));
+  }
+  static inline MutableType Add(int number, FieldType field_type,
+                                ExtensionSet* set) {
+    return static_cast<Type*>(
+        set->AddMessage(number, field_type, Type::default_instance(), NULL));
+  }
+};
+
+// -------------------------------------------------------------------
+// ExtensionIdentifier
+
+// This is the type of actual extension objects.  E.g. if you have:
+//   extends Foo with optional int32 bar = 1234;
+// then "bar" will be defined in C++ as:
+//   ExtensionIdentifier<Foo, PrimitiveTypeTraits<int32>, 1, false> bar(1234);
+//
+// Note that we could, in theory, supply the field number as a template
+// parameter, and thus make an instance of ExtensionIdentifier have no
+// actual contents.  However, if we did that, then using at extension
+// identifier would not necessarily cause the compiler to output any sort
+// of reference to any simple defined in the extension's .pb.o file.  Some
+// linkers will actually drop object files that are not explicitly referenced,
+// but that would be bad because it would cause this extension to not be
+// registered at static initialization, and therefore using it would crash.
+
+template <typename ExtendeeType, typename TypeTraitsType,
+          FieldType field_type, bool is_packed>
+class ExtensionIdentifier {
+ public:
+  typedef TypeTraitsType TypeTraits;
+  typedef ExtendeeType Extendee;
+
+  ExtensionIdentifier(int number, typename TypeTraits::ConstType default_value)
+      : number_(number), default_value_(default_value) {}
+  inline int number() const { return number_; }
+  typename TypeTraits::ConstType default_value() const {
+    return default_value_;
+  }
+
+ private:
+  const int number_;
+  typename TypeTraits::ConstType default_value_;
+};
+
+// -------------------------------------------------------------------
+// Generated accessors
+
+// This macro should be expanded in the context of a generated type which
+// has extensions.
+//
+// We use "_proto_TypeTraits" as a type name below because "TypeTraits"
+// causes problems if the class has a nested message or enum type with that
+// name and "_TypeTraits" is technically reserved for the C++ library since
+// it starts with an underscore followed by a capital letter.
+//
+// For similar reason, we use "_field_type" and "_is_packed" as parameter names
+// below, so that "field_type" and "is_packed" can be used as field names.
+#define GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(CLASSNAME)                        \
+  /* Has, Size, Clear */                                                      \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline bool HasExtension(                                                   \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
+    return _extensions_.Has(id.number());                                     \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline void ClearExtension(                                                 \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
+    _extensions_.ClearExtension(id.number());                                 \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline int ExtensionSize(                                                   \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
+    return _extensions_.ExtensionSize(id.number());                           \
+  }                                                                           \
+                                                                              \
+  /* Singular accessors */                                                    \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::ConstType GetExtension(                  \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
+    return _proto_TypeTraits::Get(id.number(), _extensions_,                  \
+                                  id.default_value());                        \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::MutableType MutableExtension(            \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
+    return _proto_TypeTraits::Mutable(id.number(), _field_type,               \
+                                      &_extensions_);                         \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline void SetExtension(                                                   \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      typename _proto_TypeTraits::ConstType value) {                          \
+    _proto_TypeTraits::Set(id.number(), _field_type, value, &_extensions_);   \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline void SetAllocatedExtension(                                          \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      typename _proto_TypeTraits::MutableType value) {                        \
+    _proto_TypeTraits::SetAllocated(id.number(), _field_type,                 \
+                                    value, &_extensions_);                    \
+  }                                                                           \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::MutableType ReleaseExtension(            \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
+    return _proto_TypeTraits::Release(id.number(), _field_type,               \
+                                      &_extensions_);                         \
+  }                                                                           \
+                                                                              \
+  /* Repeated accessors */                                                    \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::ConstType GetExtension(                  \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      int index) const {                                                      \
+    return _proto_TypeTraits::Get(id.number(), _extensions_, index);          \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::MutableType MutableExtension(            \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      int index) {                                                            \
+    return _proto_TypeTraits::Mutable(id.number(), index, &_extensions_);     \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline void SetExtension(                                                   \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      int index, typename _proto_TypeTraits::ConstType value) {               \
+    _proto_TypeTraits::Set(id.number(), index, value, &_extensions_);         \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline typename _proto_TypeTraits::MutableType AddExtension(                \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
+    return _proto_TypeTraits::Add(id.number(), _field_type, &_extensions_);   \
+  }                                                                           \
+                                                                              \
+  template <typename _proto_TypeTraits,                                       \
+            ::google::protobuf::internal::FieldType _field_type,                        \
+            bool _is_packed>                                                  \
+  inline void AddExtension(                                                   \
+      const ::google::protobuf::internal::ExtensionIdentifier<                          \
+        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
+      typename _proto_TypeTraits::ConstType value) {                          \
+    _proto_TypeTraits::Add(id.number(), _field_type, _is_packed,              \
+                           value, &_extensions_);                             \
+  }
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_EXTENSION_SET_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h b/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
new file mode 100644
index 00000000..a09a540b
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
@@ -0,0 +1,85 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: jasonh@google.com (Jason Hsueh)
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+// It provides reflection support for generated enums, and is included in
+// generated .pb.h files and should have minimal dependencies. The methods are
+// implemented in generated_message_reflection.cc.
+
+#ifndef GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
+#define GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
+
+#include <string>
+
+namespace google {
+namespace protobuf {
+  class EnumDescriptor;
+}  // namespace protobuf
+
+namespace protobuf {
+
+// Returns the EnumDescriptor for enum type E, which must be a
+// proto-declared enum type.  Code generated by the protocol compiler
+// will include specializations of this template for each enum type declared.
+template <typename E>
+const EnumDescriptor* GetEnumDescriptor();
+
+namespace internal {
+
+// Helper for EnumType_Parse functions: try to parse the string 'name' as an
+// enum name of the given type, returning true and filling in value on success,
+// or returning false and leaving value unchanged on failure.
+LIBPROTOBUF_EXPORT bool ParseNamedEnum(const EnumDescriptor* descriptor,
+                    const string& name,
+                    int* value);
+
+template<typename EnumType>
+bool ParseNamedEnum(const EnumDescriptor* descriptor,
+                    const string& name,
+                    EnumType* value) {
+  int tmp;
+  if (!ParseNamedEnum(descriptor, name, &tmp)) return false;
+  *value = static_cast<EnumType>(tmp);
+  return true;
+}
+
+// Just a wrapper around printing the name of a value. The main point of this
+// function is not to be inlined, so that you can do this without including
+// descriptor.h.
+LIBPROTOBUF_EXPORT const string& NameOfEnum(const EnumDescriptor* descriptor, int value);
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_message_reflection.h b/ps-lite/deps/include/google/protobuf/generated_message_reflection.h
new file mode 100644
index 00000000..c1c142fa
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/generated_message_reflection.h
@@ -0,0 +1,419 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+
+#ifndef GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
+#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
+
+#include <string>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+// TODO(jasonh): Remove this once the compiler change to directly include this
+// is released to components.
+#include <google/protobuf/generated_enum_reflection.h>
+#include <google/protobuf/message.h>
+#include <google/protobuf/unknown_field_set.h>
+
+
+namespace google {
+namespace upb {
+namespace google_opensource {
+class GMR_Handlers;
+}  // namespace google_opensource
+}  // namespace upb
+
+namespace protobuf {
+  class DescriptorPool;
+}
+
+namespace protobuf {
+namespace internal {
+
+// Defined in this file.
+class GeneratedMessageReflection;
+
+// Defined in other files.
+class ExtensionSet;             // extension_set.h
+
+// THIS CLASS IS NOT INTENDED FOR DIRECT USE.  It is intended for use
+// by generated code.  This class is just a big hack that reduces code
+// size.
+//
+// A GeneratedMessageReflection is an implementation of Reflection
+// which expects all fields to be backed by simple variables located in
+// memory.  The locations are given using a base pointer and a set of
+// offsets.
+//
+// It is required that the user represents fields of each type in a standard
+// way, so that GeneratedMessageReflection can cast the void* pointer to
+// the appropriate type.  For primitive fields and string fields, each field
+// should be represented using the obvious C++ primitive type.  Enums and
+// Messages are different:
+//  - Singular Message fields are stored as a pointer to a Message.  These
+//    should start out NULL, except for in the default instance where they
+//    should start out pointing to other default instances.
+//  - Enum fields are stored as an int.  This int must always contain
+//    a valid value, such that EnumDescriptor::FindValueByNumber() would
+//    not return NULL.
+//  - Repeated fields are stored as RepeatedFields or RepeatedPtrFields
+//    of whatever type the individual field would be.  Strings and
+//    Messages use RepeatedPtrFields while everything else uses
+//    RepeatedFields.
+class LIBPROTOBUF_EXPORT GeneratedMessageReflection : public Reflection {
+ public:
+  // Constructs a GeneratedMessageReflection.
+  // Parameters:
+  //   descriptor:    The descriptor for the message type being implemented.
+  //   default_instance:  The default instance of the message.  This is only
+  //                  used to obtain pointers to default instances of embedded
+  //                  messages, which GetMessage() will return if the particular
+  //                  sub-message has not been initialized yet.  (Thus, all
+  //                  embedded message fields *must* have non-NULL pointers
+  //                  in the default instance.)
+  //   offsets:       An array of ints giving the byte offsets, relative to
+  //                  the start of the message object, of each field.  These can
+  //                  be computed at compile time using the
+  //                  GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET() macro, defined
+  //                  below.
+  //   has_bits_offset:  Offset in the message of an array of uint32s of size
+  //                  descriptor->field_count()/32, rounded up.  This is a
+  //                  bitfield where each bit indicates whether or not the
+  //                  corresponding field of the message has been initialized.
+  //                  The bit for field index i is obtained by the expression:
+  //                    has_bits[i / 32] & (1 << (i % 32))
+  //   unknown_fields_offset:  Offset in the message of the UnknownFieldSet for
+  //                  the message.
+  //   extensions_offset:  Offset in the message of the ExtensionSet for the
+  //                  message, or -1 if the message type has no extension
+  //                  ranges.
+  //   pool:          DescriptorPool to search for extension definitions.  Only
+  //                  used by FindKnownExtensionByName() and
+  //                  FindKnownExtensionByNumber().
+  //   factory:       MessageFactory to use to construct extension messages.
+  //   object_size:   The size of a message object of this type, as measured
+  //                  by sizeof().
+  GeneratedMessageReflection(const Descriptor* descriptor,
+                             const Message* default_instance,
+                             const int offsets[],
+                             int has_bits_offset,
+                             int unknown_fields_offset,
+                             int extensions_offset,
+                             const DescriptorPool* pool,
+                             MessageFactory* factory,
+                             int object_size);
+  ~GeneratedMessageReflection();
+
+  // implements Reflection -------------------------------------------
+
+  const UnknownFieldSet& GetUnknownFields(const Message& message) const;
+  UnknownFieldSet* MutableUnknownFields(Message* message) const;
+
+  int SpaceUsed(const Message& message) const;
+
+  bool HasField(const Message& message, const FieldDescriptor* field) const;
+  int FieldSize(const Message& message, const FieldDescriptor* field) const;
+  void ClearField(Message* message, const FieldDescriptor* field) const;
+  void RemoveLast(Message* message, const FieldDescriptor* field) const;
+  Message* ReleaseLast(Message* message, const FieldDescriptor* field) const;
+  void Swap(Message* message1, Message* message2) const;
+  void SwapElements(Message* message, const FieldDescriptor* field,
+            int index1, int index2) const;
+  void ListFields(const Message& message,
+                  vector<const FieldDescriptor*>* output) const;
+
+  int32  GetInt32 (const Message& message,
+                   const FieldDescriptor* field) const;
+  int64  GetInt64 (const Message& message,
+                   const FieldDescriptor* field) const;
+  uint32 GetUInt32(const Message& message,
+                   const FieldDescriptor* field) const;
+  uint64 GetUInt64(const Message& message,
+                   const FieldDescriptor* field) const;
+  float  GetFloat (const Message& message,
+                   const FieldDescriptor* field) const;
+  double GetDouble(const Message& message,
+                   const FieldDescriptor* field) const;
+  bool   GetBool  (const Message& message,
+                   const FieldDescriptor* field) const;
+  string GetString(const Message& message,
+                   const FieldDescriptor* field) const;
+  const string& GetStringReference(const Message& message,
+                                   const FieldDescriptor* field,
+                                   string* scratch) const;
+  const EnumValueDescriptor* GetEnum(const Message& message,
+                                     const FieldDescriptor* field) const;
+  const Message& GetMessage(const Message& message,
+                            const FieldDescriptor* field,
+                            MessageFactory* factory = NULL) const;
+
+  void SetInt32 (Message* message,
+                 const FieldDescriptor* field, int32  value) const;
+  void SetInt64 (Message* message,
+                 const FieldDescriptor* field, int64  value) const;
+  void SetUInt32(Message* message,
+                 const FieldDescriptor* field, uint32 value) const;
+  void SetUInt64(Message* message,
+                 const FieldDescriptor* field, uint64 value) const;
+  void SetFloat (Message* message,
+                 const FieldDescriptor* field, float  value) const;
+  void SetDouble(Message* message,
+                 const FieldDescriptor* field, double value) const;
+  void SetBool  (Message* message,
+                 const FieldDescriptor* field, bool   value) const;
+  void SetString(Message* message,
+                 const FieldDescriptor* field,
+                 const string& value) const;
+  void SetEnum  (Message* message, const FieldDescriptor* field,
+                 const EnumValueDescriptor* value) const;
+  Message* MutableMessage(Message* message, const FieldDescriptor* field,
+                          MessageFactory* factory = NULL) const;
+  Message* ReleaseMessage(Message* message, const FieldDescriptor* field,
+                          MessageFactory* factory = NULL) const;
+
+  int32  GetRepeatedInt32 (const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  int64  GetRepeatedInt64 (const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  uint32 GetRepeatedUInt32(const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  uint64 GetRepeatedUInt64(const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  float  GetRepeatedFloat (const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  double GetRepeatedDouble(const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  bool   GetRepeatedBool  (const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  string GetRepeatedString(const Message& message,
+                           const FieldDescriptor* field, int index) const;
+  const string& GetRepeatedStringReference(const Message& message,
+                                           const FieldDescriptor* field,
+                                           int index, string* scratch) const;
+  const EnumValueDescriptor* GetRepeatedEnum(const Message& message,
+                                             const FieldDescriptor* field,
+                                             int index) const;
+  const Message& GetRepeatedMessage(const Message& message,
+                                    const FieldDescriptor* field,
+                                    int index) const;
+
+  // Set the value of a field.
+  void SetRepeatedInt32 (Message* message,
+                         const FieldDescriptor* field, int index, int32  value) const;
+  void SetRepeatedInt64 (Message* message,
+                         const FieldDescriptor* field, int index, int64  value) const;
+  void SetRepeatedUInt32(Message* message,
+                         const FieldDescriptor* field, int index, uint32 value) const;
+  void SetRepeatedUInt64(Message* message,
+                         const FieldDescriptor* field, int index, uint64 value) const;
+  void SetRepeatedFloat (Message* message,
+                         const FieldDescriptor* field, int index, float  value) const;
+  void SetRepeatedDouble(Message* message,
+                         const FieldDescriptor* field, int index, double value) const;
+  void SetRepeatedBool  (Message* message,
+                         const FieldDescriptor* field, int index, bool   value) const;
+  void SetRepeatedString(Message* message,
+                         const FieldDescriptor* field, int index,
+                         const string& value) const;
+  void SetRepeatedEnum(Message* message, const FieldDescriptor* field,
+                       int index, const EnumValueDescriptor* value) const;
+  // Get a mutable pointer to a field with a message type.
+  Message* MutableRepeatedMessage(Message* message,
+                                  const FieldDescriptor* field,
+                                  int index) const;
+
+  void AddInt32 (Message* message,
+                 const FieldDescriptor* field, int32  value) const;
+  void AddInt64 (Message* message,
+                 const FieldDescriptor* field, int64  value) const;
+  void AddUInt32(Message* message,
+                 const FieldDescriptor* field, uint32 value) const;
+  void AddUInt64(Message* message,
+                 const FieldDescriptor* field, uint64 value) const;
+  void AddFloat (Message* message,
+                 const FieldDescriptor* field, float  value) const;
+  void AddDouble(Message* message,
+                 const FieldDescriptor* field, double value) const;
+  void AddBool  (Message* message,
+                 const FieldDescriptor* field, bool   value) const;
+  void AddString(Message* message,
+                 const FieldDescriptor* field, const string& value) const;
+  void AddEnum(Message* message,
+               const FieldDescriptor* field,
+               const EnumValueDescriptor* value) const;
+  Message* AddMessage(Message* message, const FieldDescriptor* field,
+                      MessageFactory* factory = NULL) const;
+
+  const FieldDescriptor* FindKnownExtensionByName(const string& name) const;
+  const FieldDescriptor* FindKnownExtensionByNumber(int number) const;
+
+ protected:
+  virtual void* MutableRawRepeatedField(
+      Message* message, const FieldDescriptor* field, FieldDescriptor::CppType,
+      int ctype, const Descriptor* desc) const;
+
+ private:
+  friend class GeneratedMessage;
+
+  // To parse directly into a proto2 generated class, the class GMR_Handlers
+  // needs access to member offsets and hasbits.
+  friend class LIBPROTOBUF_EXPORT upb::google_opensource::GMR_Handlers;
+
+  const Descriptor* descriptor_;
+  const Message* default_instance_;
+  const int* offsets_;
+
+  int has_bits_offset_;
+  int unknown_fields_offset_;
+  int extensions_offset_;
+  int object_size_;
+
+  const DescriptorPool* descriptor_pool_;
+  MessageFactory* message_factory_;
+
+  template <typename Type>
+  inline const Type& GetRaw(const Message& message,
+                            const FieldDescriptor* field) const;
+  template <typename Type>
+  inline Type* MutableRaw(Message* message,
+                          const FieldDescriptor* field) const;
+  template <typename Type>
+  inline const Type& DefaultRaw(const FieldDescriptor* field) const;
+
+  inline const uint32* GetHasBits(const Message& message) const;
+  inline uint32* MutableHasBits(Message* message) const;
+  inline const ExtensionSet& GetExtensionSet(const Message& message) const;
+  inline ExtensionSet* MutableExtensionSet(Message* message) const;
+
+  inline bool HasBit(const Message& message,
+                     const FieldDescriptor* field) const;
+  inline void SetBit(Message* message,
+                     const FieldDescriptor* field) const;
+  inline void ClearBit(Message* message,
+                       const FieldDescriptor* field) const;
+
+  template <typename Type>
+  inline const Type& GetField(const Message& message,
+                              const FieldDescriptor* field) const;
+  template <typename Type>
+  inline void SetField(Message* message,
+                       const FieldDescriptor* field, const Type& value) const;
+  template <typename Type>
+  inline Type* MutableField(Message* message,
+                            const FieldDescriptor* field) const;
+  template <typename Type>
+  inline const Type& GetRepeatedField(const Message& message,
+                                      const FieldDescriptor* field,
+                                      int index) const;
+  template <typename Type>
+  inline const Type& GetRepeatedPtrField(const Message& message,
+                                         const FieldDescriptor* field,
+                                         int index) const;
+  template <typename Type>
+  inline void SetRepeatedField(Message* message,
+                               const FieldDescriptor* field, int index,
+                               Type value) const;
+  template <typename Type>
+  inline Type* MutableRepeatedField(Message* message,
+                                    const FieldDescriptor* field,
+                                    int index) const;
+  template <typename Type>
+  inline void AddField(Message* message,
+                       const FieldDescriptor* field, const Type& value) const;
+  template <typename Type>
+  inline Type* AddField(Message* message,
+                        const FieldDescriptor* field) const;
+
+  int GetExtensionNumberOrDie(const Descriptor* type) const;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GeneratedMessageReflection);
+};
+
+// Returns the offset of the given field within the given aggregate type.
+// This is equivalent to the ANSI C offsetof() macro.  However, according
+// to the C++ standard, offsetof() only works on POD types, and GCC
+// enforces this requirement with a warning.  In practice, this rule is
+// unnecessarily strict; there is probably no compiler or platform on
+// which the offsets of the direct fields of a class are non-constant.
+// Fields inherited from superclasses *can* have non-constant offsets,
+// but that's not what this macro will be used for.
+//
+// Note that we calculate relative to the pointer value 16 here since if we
+// just use zero, GCC complains about dereferencing a NULL pointer.  We
+// choose 16 rather than some other number just in case the compiler would
+// be confused by an unaligned pointer.
+#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(TYPE, FIELD)    \
+  static_cast<int>(                                           \
+    reinterpret_cast<const char*>(                            \
+      &reinterpret_cast<const TYPE*>(16)->FIELD) -            \
+    reinterpret_cast<const char*>(16))
+
+// There are some places in proto2 where dynamic_cast would be useful as an
+// optimization.  For example, take Message::MergeFrom(const Message& other).
+// For a given generated message FooMessage, we generate these two methods:
+//   void MergeFrom(const FooMessage& other);
+//   void MergeFrom(const Message& other);
+// The former method can be implemented directly in terms of FooMessage's
+// inline accessors, but the latter method must work with the reflection
+// interface.  However, if the parameter to the latter method is actually of
+// type FooMessage, then we'd like to be able to just call the other method
+// as an optimization.  So, we use dynamic_cast to check this.
+//
+// That said, dynamic_cast requires RTTI, which many people like to disable
+// for performance and code size reasons.  When RTTI is not available, we
+// still need to produce correct results.  So, in this case we have to fall
+// back to using reflection, which is what we would have done anyway if the
+// objects were not of the exact same class.
+//
+// dynamic_cast_if_available() implements this logic.  If RTTI is
+// enabled, it does a dynamic_cast.  If RTTI is disabled, it just returns
+// NULL.
+//
+// If you need to compile without RTTI, simply #define GOOGLE_PROTOBUF_NO_RTTI.
+// On MSVC, this should be detected automatically.
+template<typename To, typename From>
+inline To dynamic_cast_if_available(From from) {
+#if defined(GOOGLE_PROTOBUF_NO_RTTI) || (defined(_MSC_VER)&&!defined(_CPPRTTI))
+  return NULL;
+#else
+  return dynamic_cast<To>(from);
+#endif
+}
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_message_util.h b/ps-lite/deps/include/google/protobuf/generated_message_util.h
new file mode 100644
index 00000000..b2fb8f0b
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/generated_message_util.h
@@ -0,0 +1,77 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains miscellaneous helper code used by generated code --
+// including lite types -- but which should not be used directly by users.
+
+#ifndef GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
+#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
+
+#include <string>
+
+#include <google/protobuf/stubs/common.h>
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// Annotation for the compiler to emit a deprecation message if a field marked
+// with option 'deprecated=true' is used in the code, or for other things in
+// generated code which are deprecated.
+//
+// For internal use in the pb.cc files, deprecation warnings are suppressed
+// there.
+#undef DEPRECATED_PROTOBUF_FIELD
+#define PROTOBUF_DEPRECATED
+
+
+// Constants for special floating point values.
+LIBPROTOBUF_EXPORT double Infinity();
+LIBPROTOBUF_EXPORT double NaN();
+
+// Constant used for empty default strings.
+LIBPROTOBUF_EXPORT extern const ::std::string kEmptyString;
+
+// Defined in generated_message_reflection.cc -- not actually part of the lite
+// library.
+//
+// TODO(jasonh): The various callers get this declaration from a variety of
+// places: probably in most cases repeated_field.h. Clean these up so they all
+// get the declaration from this file.
+LIBPROTOBUF_EXPORT int StringSpaceUsedExcludingSelf(const string& str);
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/coded_stream.h b/ps-lite/deps/include/google/protobuf/io/coded_stream.h
new file mode 100644
index 00000000..66cbee00
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/coded_stream.h
@@ -0,0 +1,1136 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains the CodedInputStream and CodedOutputStream classes,
+// which wrap a ZeroCopyInputStream or ZeroCopyOutputStream, respectively,
+// and allow you to read or write individual pieces of data in various
+// formats.  In particular, these implement the varint encoding for
+// integers, a simple variable-length encoding in which smaller numbers
+// take fewer bytes.
+//
+// Typically these classes will only be used internally by the protocol
+// buffer library in order to encode and decode protocol buffers.  Clients
+// of the library only need to know about this class if they wish to write
+// custom message parsing or serialization procedures.
+//
+// CodedOutputStream example:
+//   // Write some data to "myfile".  First we write a 4-byte "magic number"
+//   // to identify the file type, then write a length-delimited string.  The
+//   // string is composed of a varint giving the length followed by the raw
+//   // bytes.
+//   int fd = open("myfile", O_WRONLY);
+//   ZeroCopyOutputStream* raw_output = new FileOutputStream(fd);
+//   CodedOutputStream* coded_output = new CodedOutputStream(raw_output);
+//
+//   int magic_number = 1234;
+//   char text[] = "Hello world!";
+//   coded_output->WriteLittleEndian32(magic_number);
+//   coded_output->WriteVarint32(strlen(text));
+//   coded_output->WriteRaw(text, strlen(text));
+//
+//   delete coded_output;
+//   delete raw_output;
+//   close(fd);
+//
+// CodedInputStream example:
+//   // Read a file created by the above code.
+//   int fd = open("myfile", O_RDONLY);
+//   ZeroCopyInputStream* raw_input = new FileInputStream(fd);
+//   CodedInputStream coded_input = new CodedInputStream(raw_input);
+//
+//   coded_input->ReadLittleEndian32(&magic_number);
+//   if (magic_number != 1234) {
+//     cerr << "File not in expected format." << endl;
+//     return;
+//   }
+//
+//   uint32 size;
+//   coded_input->ReadVarint32(&size);
+//
+//   char* text = new char[size + 1];
+//   coded_input->ReadRaw(buffer, size);
+//   text[size] = '\0';
+//
+//   delete coded_input;
+//   delete raw_input;
+//   close(fd);
+//
+//   cout << "Text is: " << text << endl;
+//   delete [] text;
+//
+// For those who are interested, varint encoding is defined as follows:
+//
+// The encoding operates on unsigned integers of up to 64 bits in length.
+// Each byte of the encoded value has the format:
+// * bits 0-6: Seven bits of the number being encoded.
+// * bit 7: Zero if this is the last byte in the encoding (in which
+//   case all remaining bits of the number are zero) or 1 if
+//   more bytes follow.
+// The first byte contains the least-significant 7 bits of the number, the
+// second byte (if present) contains the next-least-significant 7 bits,
+// and so on.  So, the binary number 1011000101011 would be encoded in two
+// bytes as "10101011 00101100".
+//
+// In theory, varint could be used to encode integers of any length.
+// However, for practicality we set a limit at 64 bits.  The maximum encoded
+// length of a number is thus 10 bytes.
+
+#ifndef GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
+#define GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
+
+#include <string>
+#ifdef _MSC_VER
+  #if defined(_M_IX86) && \
+      !defined(PROTOBUF_DISABLE_LITTLE_ENDIAN_OPT_FOR_TEST)
+    #define PROTOBUF_LITTLE_ENDIAN 1
+  #endif
+  #if _MSC_VER >= 1300
+    // If MSVC has "/RTCc" set, it will complain about truncating casts at
+    // runtime.  This file contains some intentional truncating casts.
+    #pragma runtime_checks("c", off)
+  #endif
+#else
+  #include <sys/param.h>   // __BYTE_ORDER
+  #if defined(__BYTE_ORDER) && __BYTE_ORDER == __LITTLE_ENDIAN && \
+      !defined(PROTOBUF_DISABLE_LITTLE_ENDIAN_OPT_FOR_TEST)
+    #define PROTOBUF_LITTLE_ENDIAN 1
+  #endif
+#endif
+#include <google/protobuf/stubs/common.h>
+
+
+namespace google {
+namespace protobuf {
+
+class DescriptorPool;
+class MessageFactory;
+
+namespace io {
+
+// Defined in this file.
+class CodedInputStream;
+class CodedOutputStream;
+
+// Defined in other files.
+class ZeroCopyInputStream;           // zero_copy_stream.h
+class ZeroCopyOutputStream;          // zero_copy_stream.h
+
+// Class which reads and decodes binary data which is composed of varint-
+// encoded integers and fixed-width pieces.  Wraps a ZeroCopyInputStream.
+// Most users will not need to deal with CodedInputStream.
+//
+// Most methods of CodedInputStream that return a bool return false if an
+// underlying I/O error occurs or if the data is malformed.  Once such a
+// failure occurs, the CodedInputStream is broken and is no longer useful.
+class LIBPROTOBUF_EXPORT CodedInputStream {
+ public:
+  // Create a CodedInputStream that reads from the given ZeroCopyInputStream.
+  explicit CodedInputStream(ZeroCopyInputStream* input);
+
+  // Create a CodedInputStream that reads from the given flat array.  This is
+  // faster than using an ArrayInputStream.  PushLimit(size) is implied by
+  // this constructor.
+  explicit CodedInputStream(const uint8* buffer, int size);
+
+  // Destroy the CodedInputStream and position the underlying
+  // ZeroCopyInputStream at the first unread byte.  If an error occurred while
+  // reading (causing a method to return false), then the exact position of
+  // the input stream may be anywhere between the last value that was read
+  // successfully and the stream's byte limit.
+  ~CodedInputStream();
+
+  // Return true if this CodedInputStream reads from a flat array instead of
+  // a ZeroCopyInputStream.
+  inline bool IsFlat() const;
+
+  // Skips a number of bytes.  Returns false if an underlying read error
+  // occurs.
+  bool Skip(int count);
+
+  // Sets *data to point directly at the unread part of the CodedInputStream's
+  // underlying buffer, and *size to the size of that buffer, but does not
+  // advance the stream's current position.  This will always either produce
+  // a non-empty buffer or return false.  If the caller consumes any of
+  // this data, it should then call Skip() to skip over the consumed bytes.
+  // This may be useful for implementing external fast parsing routines for
+  // types of data not covered by the CodedInputStream interface.
+  bool GetDirectBufferPointer(const void** data, int* size);
+
+  // Like GetDirectBufferPointer, but this method is inlined, and does not
+  // attempt to Refresh() if the buffer is currently empty.
+  inline void GetDirectBufferPointerInline(const void** data,
+                                           int* size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  // Read raw bytes, copying them into the given buffer.
+  bool ReadRaw(void* buffer, int size);
+
+  // Like ReadRaw, but reads into a string.
+  //
+  // Implementation Note:  ReadString() grows the string gradually as it
+  // reads in the data, rather than allocating the entire requested size
+  // upfront.  This prevents denial-of-service attacks in which a client
+  // could claim that a string is going to be MAX_INT bytes long in order to
+  // crash the server because it can't allocate this much space at once.
+  bool ReadString(string* buffer, int size);
+  // Like the above, with inlined optimizations. This should only be used
+  // by the protobuf implementation.
+  inline bool InternalReadStringInline(string* buffer,
+                                       int size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+
+  // Read a 32-bit little-endian integer.
+  bool ReadLittleEndian32(uint32* value);
+  // Read a 64-bit little-endian integer.
+  bool ReadLittleEndian64(uint64* value);
+
+  // These methods read from an externally provided buffer. The caller is
+  // responsible for ensuring that the buffer has sufficient space.
+  // Read a 32-bit little-endian integer.
+  static const uint8* ReadLittleEndian32FromArray(const uint8* buffer,
+                                                   uint32* value);
+  // Read a 64-bit little-endian integer.
+  static const uint8* ReadLittleEndian64FromArray(const uint8* buffer,
+                                                   uint64* value);
+
+  // Read an unsigned integer with Varint encoding, truncating to 32 bits.
+  // Reading a 32-bit value is equivalent to reading a 64-bit one and casting
+  // it to uint32, but may be more efficient.
+  bool ReadVarint32(uint32* value);
+  // Read an unsigned integer with Varint encoding.
+  bool ReadVarint64(uint64* value);
+
+  // Read a tag.  This calls ReadVarint32() and returns the result, or returns
+  // zero (which is not a valid tag) if ReadVarint32() fails.  Also, it updates
+  // the last tag value, which can be checked with LastTagWas().
+  // Always inline because this is only called in once place per parse loop
+  // but it is called for every iteration of said loop, so it should be fast.
+  // GCC doesn't want to inline this by default.
+  uint32 ReadTag() GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  // Usually returns true if calling ReadVarint32() now would produce the given
+  // value.  Will always return false if ReadVarint32() would not return the
+  // given value.  If ExpectTag() returns true, it also advances past
+  // the varint.  For best performance, use a compile-time constant as the
+  // parameter.
+  // Always inline because this collapses to a small number of instructions
+  // when given a constant parameter, but GCC doesn't want to inline by default.
+  bool ExpectTag(uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  // Like above, except this reads from the specified buffer. The caller is
+  // responsible for ensuring that the buffer is large enough to read a varint
+  // of the expected size. For best performance, use a compile-time constant as
+  // the expected tag parameter.
+  //
+  // Returns a pointer beyond the expected tag if it was found, or NULL if it
+  // was not.
+  static const uint8* ExpectTagFromArray(
+      const uint8* buffer,
+      uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  // Usually returns true if no more bytes can be read.  Always returns false
+  // if more bytes can be read.  If ExpectAtEnd() returns true, a subsequent
+  // call to LastTagWas() will act as if ReadTag() had been called and returned
+  // zero, and ConsumedEntireMessage() will return true.
+  bool ExpectAtEnd();
+
+  // If the last call to ReadTag() returned the given value, returns true.
+  // Otherwise, returns false;
+  //
+  // This is needed because parsers for some types of embedded messages
+  // (with field type TYPE_GROUP) don't actually know that they've reached the
+  // end of a message until they see an ENDGROUP tag, which was actually part
+  // of the enclosing message.  The enclosing message would like to check that
+  // tag to make sure it had the right number, so it calls LastTagWas() on
+  // return from the embedded parser to check.
+  bool LastTagWas(uint32 expected);
+
+  // When parsing message (but NOT a group), this method must be called
+  // immediately after MergeFromCodedStream() returns (if it returns true)
+  // to further verify that the message ended in a legitimate way.  For
+  // example, this verifies that parsing did not end on an end-group tag.
+  // It also checks for some cases where, due to optimizations,
+  // MergeFromCodedStream() can incorrectly return true.
+  bool ConsumedEntireMessage();
+
+  // Limits ----------------------------------------------------------
+  // Limits are used when parsing length-delimited embedded messages.
+  // After the message's length is read, PushLimit() is used to prevent
+  // the CodedInputStream from reading beyond that length.  Once the
+  // embedded message has been parsed, PopLimit() is called to undo the
+  // limit.
+
+  // Opaque type used with PushLimit() and PopLimit().  Do not modify
+  // values of this type yourself.  The only reason that this isn't a
+  // struct with private internals is for efficiency.
+  typedef int Limit;
+
+  // Places a limit on the number of bytes that the stream may read,
+  // starting from the current position.  Once the stream hits this limit,
+  // it will act like the end of the input has been reached until PopLimit()
+  // is called.
+  //
+  // As the names imply, the stream conceptually has a stack of limits.  The
+  // shortest limit on the stack is always enforced, even if it is not the
+  // top limit.
+  //
+  // The value returned by PushLimit() is opaque to the caller, and must
+  // be passed unchanged to the corresponding call to PopLimit().
+  Limit PushLimit(int byte_limit);
+
+  // Pops the last limit pushed by PushLimit().  The input must be the value
+  // returned by that call to PushLimit().
+  void PopLimit(Limit limit);
+
+  // Returns the number of bytes left until the nearest limit on the
+  // stack is hit, or -1 if no limits are in place.
+  int BytesUntilLimit() const;
+
+  // Returns current position relative to the beginning of the input stream.
+  int CurrentPosition() const;
+
+  // Total Bytes Limit -----------------------------------------------
+  // To prevent malicious users from sending excessively large messages
+  // and causing integer overflows or memory exhaustion, CodedInputStream
+  // imposes a hard limit on the total number of bytes it will read.
+
+  // Sets the maximum number of bytes that this CodedInputStream will read
+  // before refusing to continue.  To prevent integer overflows in the
+  // protocol buffers implementation, as well as to prevent servers from
+  // allocating enormous amounts of memory to hold parsed messages, the
+  // maximum message length should be limited to the shortest length that
+  // will not harm usability.  The theoretical shortest message that could
+  // cause integer overflows is 512MB.  The default limit is 64MB.  Apps
+  // should set shorter limits if possible.  If warning_threshold is not -1,
+  // a warning will be printed to stderr after warning_threshold bytes are
+  // read.  For backwards compatibility all negative values get squached to -1,
+  // as other negative values might have special internal meanings.
+  // An error will always be printed to stderr if the limit is reached.
+  //
+  // This is unrelated to PushLimit()/PopLimit().
+  //
+  // Hint:  If you are reading this because your program is printing a
+  //   warning about dangerously large protocol messages, you may be
+  //   confused about what to do next.  The best option is to change your
+  //   design such that excessively large messages are not necessary.
+  //   For example, try to design file formats to consist of many small
+  //   messages rather than a single large one.  If this is infeasible,
+  //   you will need to increase the limit.  Chances are, though, that
+  //   your code never constructs a CodedInputStream on which the limit
+  //   can be set.  You probably parse messages by calling things like
+  //   Message::ParseFromString().  In this case, you will need to change
+  //   your code to instead construct some sort of ZeroCopyInputStream
+  //   (e.g. an ArrayInputStream), construct a CodedInputStream around
+  //   that, then call Message::ParseFromCodedStream() instead.  Then
+  //   you can adjust the limit.  Yes, it's more work, but you're doing
+  //   something unusual.
+  void SetTotalBytesLimit(int total_bytes_limit, int warning_threshold);
+
+  // Recursion Limit -------------------------------------------------
+  // To prevent corrupt or malicious messages from causing stack overflows,
+  // we must keep track of the depth of recursion when parsing embedded
+  // messages and groups.  CodedInputStream keeps track of this because it
+  // is the only object that is passed down the stack during parsing.
+
+  // Sets the maximum recursion depth.  The default is 100.
+  void SetRecursionLimit(int limit);
+
+
+  // Increments the current recursion depth.  Returns true if the depth is
+  // under the limit, false if it has gone over.
+  bool IncrementRecursionDepth();
+
+  // Decrements the recursion depth.
+  void DecrementRecursionDepth();
+
+  // Extension Registry ----------------------------------------------
+  // ADVANCED USAGE:  99.9% of people can ignore this section.
+  //
+  // By default, when parsing extensions, the parser looks for extension
+  // definitions in the pool which owns the outer message's Descriptor.
+  // However, you may call SetExtensionRegistry() to provide an alternative
+  // pool instead.  This makes it possible, for example, to parse a message
+  // using a generated class, but represent some extensions using
+  // DynamicMessage.
+
+  // Set the pool used to look up extensions.  Most users do not need to call
+  // this as the correct pool will be chosen automatically.
+  //
+  // WARNING:  It is very easy to misuse this.  Carefully read the requirements
+  //   below.  Do not use this unless you are sure you need it.  Almost no one
+  //   does.
+  //
+  // Let's say you are parsing a message into message object m, and you want
+  // to take advantage of SetExtensionRegistry().  You must follow these
+  // requirements:
+  //
+  // The given DescriptorPool must contain m->GetDescriptor().  It is not
+  // sufficient for it to simply contain a descriptor that has the same name
+  // and content -- it must be the *exact object*.  In other words:
+  //   assert(pool->FindMessageTypeByName(m->GetDescriptor()->full_name()) ==
+  //          m->GetDescriptor());
+  // There are two ways to satisfy this requirement:
+  // 1) Use m->GetDescriptor()->pool() as the pool.  This is generally useless
+  //    because this is the pool that would be used anyway if you didn't call
+  //    SetExtensionRegistry() at all.
+  // 2) Use a DescriptorPool which has m->GetDescriptor()->pool() as an
+  //    "underlay".  Read the documentation for DescriptorPool for more
+  //    information about underlays.
+  //
+  // You must also provide a MessageFactory.  This factory will be used to
+  // construct Message objects representing extensions.  The factory's
+  // GetPrototype() MUST return non-NULL for any Descriptor which can be found
+  // through the provided pool.
+  //
+  // If the provided factory might return instances of protocol-compiler-
+  // generated (i.e. compiled-in) types, or if the outer message object m is
+  // a generated type, then the given factory MUST have this property:  If
+  // GetPrototype() is given a Descriptor which resides in
+  // DescriptorPool::generated_pool(), the factory MUST return the same
+  // prototype which MessageFactory::generated_factory() would return.  That
+  // is, given a descriptor for a generated type, the factory must return an
+  // instance of the generated class (NOT DynamicMessage).  However, when
+  // given a descriptor for a type that is NOT in generated_pool, the factory
+  // is free to return any implementation.
+  //
+  // The reason for this requirement is that generated sub-objects may be
+  // accessed via the standard (non-reflection) extension accessor methods,
+  // and these methods will down-cast the object to the generated class type.
+  // If the object is not actually of that type, the results would be undefined.
+  // On the other hand, if an extension is not compiled in, then there is no
+  // way the code could end up accessing it via the standard accessors -- the
+  // only way to access the extension is via reflection.  When using reflection,
+  // DynamicMessage and generated messages are indistinguishable, so it's fine
+  // if these objects are represented using DynamicMessage.
+  //
+  // Using DynamicMessageFactory on which you have called
+  // SetDelegateToGeneratedFactory(true) should be sufficient to satisfy the
+  // above requirement.
+  //
+  // If either pool or factory is NULL, both must be NULL.
+  //
+  // Note that this feature is ignored when parsing "lite" messages as they do
+  // not have descriptors.
+  void SetExtensionRegistry(const DescriptorPool* pool,
+                            MessageFactory* factory);
+
+  // Get the DescriptorPool set via SetExtensionRegistry(), or NULL if no pool
+  // has been provided.
+  const DescriptorPool* GetExtensionPool();
+
+  // Get the MessageFactory set via SetExtensionRegistry(), or NULL if no
+  // factory has been provided.
+  MessageFactory* GetExtensionFactory();
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodedInputStream);
+
+  ZeroCopyInputStream* input_;
+  const uint8* buffer_;
+  const uint8* buffer_end_;     // pointer to the end of the buffer.
+  int total_bytes_read_;  // total bytes read from input_, including
+                          // the current buffer
+
+  // If total_bytes_read_ surpasses INT_MAX, we record the extra bytes here
+  // so that we can BackUp() on destruction.
+  int overflow_bytes_;
+
+  // LastTagWas() stuff.
+  uint32 last_tag_;         // result of last ReadTag().
+
+  // This is set true by ReadTag{Fallback/Slow}() if it is called when exactly
+  // at EOF, or by ExpectAtEnd() when it returns true.  This happens when we
+  // reach the end of a message and attempt to read another tag.
+  bool legitimate_message_end_;
+
+  // See EnableAliasing().
+  bool aliasing_enabled_;
+
+  // Limits
+  Limit current_limit_;   // if position = -1, no limit is applied
+
+  // For simplicity, if the current buffer crosses a limit (either a normal
+  // limit created by PushLimit() or the total bytes limit), buffer_size_
+  // only tracks the number of bytes before that limit.  This field
+  // contains the number of bytes after it.  Note that this implies that if
+  // buffer_size_ == 0 and buffer_size_after_limit_ > 0, we know we've
+  // hit a limit.  However, if both are zero, it doesn't necessarily mean
+  // we aren't at a limit -- the buffer may have ended exactly at the limit.
+  int buffer_size_after_limit_;
+
+  // Maximum number of bytes to read, period.  This is unrelated to
+  // current_limit_.  Set using SetTotalBytesLimit().
+  int total_bytes_limit_;
+
+  // If positive/0: Limit for bytes read after which a warning due to size
+  // should be logged.
+  // If -1: Printing of warning disabled. Can be set by client.
+  // If -2: Internal: Limit has been reached, print full size when destructing.
+  int total_bytes_warning_threshold_;
+
+  // Current recursion depth, controlled by IncrementRecursionDepth() and
+  // DecrementRecursionDepth().
+  int recursion_depth_;
+  // Recursion depth limit, set by SetRecursionLimit().
+  int recursion_limit_;
+
+  // See SetExtensionRegistry().
+  const DescriptorPool* extension_pool_;
+  MessageFactory* extension_factory_;
+
+  // Private member functions.
+
+  // Advance the buffer by a given number of bytes.
+  void Advance(int amount);
+
+  // Back up input_ to the current buffer position.
+  void BackUpInputToCurrentPosition();
+
+  // Recomputes the value of buffer_size_after_limit_.  Must be called after
+  // current_limit_ or total_bytes_limit_ changes.
+  void RecomputeBufferLimits();
+
+  // Writes an error message saying that we hit total_bytes_limit_.
+  void PrintTotalBytesLimitError();
+
+  // Called when the buffer runs out to request more data.  Implies an
+  // Advance(BufferSize()).
+  bool Refresh();
+
+  // When parsing varints, we optimize for the common case of small values, and
+  // then optimize for the case when the varint fits within the current buffer
+  // piece. The Fallback method is used when we can't use the one-byte
+  // optimization. The Slow method is yet another fallback when the buffer is
+  // not large enough. Making the slow path out-of-line speeds up the common
+  // case by 10-15%. The slow path is fairly uncommon: it only triggers when a
+  // message crosses multiple buffers.
+  bool ReadVarint32Fallback(uint32* value);
+  bool ReadVarint64Fallback(uint64* value);
+  bool ReadVarint32Slow(uint32* value);
+  bool ReadVarint64Slow(uint64* value);
+  bool ReadLittleEndian32Fallback(uint32* value);
+  bool ReadLittleEndian64Fallback(uint64* value);
+  // Fallback/slow methods for reading tags. These do not update last_tag_,
+  // but will set legitimate_message_end_ if we are at the end of the input
+  // stream.
+  uint32 ReadTagFallback();
+  uint32 ReadTagSlow();
+  bool ReadStringFallback(string* buffer, int size);
+
+  // Return the size of the buffer.
+  int BufferSize() const;
+
+  static const int kDefaultTotalBytesLimit = 64 << 20;  // 64MB
+
+  static const int kDefaultTotalBytesWarningThreshold = 32 << 20;  // 32MB
+
+  static int default_recursion_limit_;  // 100 by default.
+};
+
+// Class which encodes and writes binary data which is composed of varint-
+// encoded integers and fixed-width pieces.  Wraps a ZeroCopyOutputStream.
+// Most users will not need to deal with CodedOutputStream.
+//
+// Most methods of CodedOutputStream which return a bool return false if an
+// underlying I/O error occurs.  Once such a failure occurs, the
+// CodedOutputStream is broken and is no longer useful. The Write* methods do
+// not return the stream status, but will invalidate the stream if an error
+// occurs. The client can probe HadError() to determine the status.
+//
+// Note that every method of CodedOutputStream which writes some data has
+// a corresponding static "ToArray" version. These versions write directly
+// to the provided buffer, returning a pointer past the last written byte.
+// They require that the buffer has sufficient capacity for the encoded data.
+// This allows an optimization where we check if an output stream has enough
+// space for an entire message before we start writing and, if there is, we
+// call only the ToArray methods to avoid doing bound checks for each
+// individual value.
+// i.e., in the example above:
+//
+//   CodedOutputStream coded_output = new CodedOutputStream(raw_output);
+//   int magic_number = 1234;
+//   char text[] = "Hello world!";
+//
+//   int coded_size = sizeof(magic_number) +
+//                    CodedOutputStream::VarintSize32(strlen(text)) +
+//                    strlen(text);
+//
+//   uint8* buffer =
+//       coded_output->GetDirectBufferForNBytesAndAdvance(coded_size);
+//   if (buffer != NULL) {
+//     // The output stream has enough space in the buffer: write directly to
+//     // the array.
+//     buffer = CodedOutputStream::WriteLittleEndian32ToArray(magic_number,
+//                                                            buffer);
+//     buffer = CodedOutputStream::WriteVarint32ToArray(strlen(text), buffer);
+//     buffer = CodedOutputStream::WriteRawToArray(text, strlen(text), buffer);
+//   } else {
+//     // Make bound-checked writes, which will ask the underlying stream for
+//     // more space as needed.
+//     coded_output->WriteLittleEndian32(magic_number);
+//     coded_output->WriteVarint32(strlen(text));
+//     coded_output->WriteRaw(text, strlen(text));
+//   }
+//
+//   delete coded_output;
+class LIBPROTOBUF_EXPORT CodedOutputStream {
+ public:
+  // Create an CodedOutputStream that writes to the given ZeroCopyOutputStream.
+  explicit CodedOutputStream(ZeroCopyOutputStream* output);
+
+  // Destroy the CodedOutputStream and position the underlying
+  // ZeroCopyOutputStream immediately after the last byte written.
+  ~CodedOutputStream();
+
+  // Skips a number of bytes, leaving the bytes unmodified in the underlying
+  // buffer.  Returns false if an underlying write error occurs.  This is
+  // mainly useful with GetDirectBufferPointer().
+  bool Skip(int count);
+
+  // Sets *data to point directly at the unwritten part of the
+  // CodedOutputStream's underlying buffer, and *size to the size of that
+  // buffer, but does not advance the stream's current position.  This will
+  // always either produce a non-empty buffer or return false.  If the caller
+  // writes any data to this buffer, it should then call Skip() to skip over
+  // the consumed bytes.  This may be useful for implementing external fast
+  // serialization routines for types of data not covered by the
+  // CodedOutputStream interface.
+  bool GetDirectBufferPointer(void** data, int* size);
+
+  // If there are at least "size" bytes available in the current buffer,
+  // returns a pointer directly into the buffer and advances over these bytes.
+  // The caller may then write directly into this buffer (e.g. using the
+  // *ToArray static methods) rather than go through CodedOutputStream.  If
+  // there are not enough bytes available, returns NULL.  The return pointer is
+  // invalidated as soon as any other non-const method of CodedOutputStream
+  // is called.
+  inline uint8* GetDirectBufferForNBytesAndAdvance(int size);
+
+  // Write raw bytes, copying them from the given buffer.
+  void WriteRaw(const void* buffer, int size);
+  // Like WriteRaw()  but writing directly to the target array.
+  // This is _not_ inlined, as the compiler often optimizes memcpy into inline
+  // copy loops. Since this gets called by every field with string or bytes
+  // type, inlining may lead to a significant amount of code bloat, with only a
+  // minor performance gain.
+  static uint8* WriteRawToArray(const void* buffer, int size, uint8* target);
+
+  // Equivalent to WriteRaw(str.data(), str.size()).
+  void WriteString(const string& str);
+  // Like WriteString()  but writing directly to the target array.
+  static uint8* WriteStringToArray(const string& str, uint8* target);
+
+
+  // Write a 32-bit little-endian integer.
+  void WriteLittleEndian32(uint32 value);
+  // Like WriteLittleEndian32()  but writing directly to the target array.
+  static uint8* WriteLittleEndian32ToArray(uint32 value, uint8* target);
+  // Write a 64-bit little-endian integer.
+  void WriteLittleEndian64(uint64 value);
+  // Like WriteLittleEndian64()  but writing directly to the target array.
+  static uint8* WriteLittleEndian64ToArray(uint64 value, uint8* target);
+
+  // Write an unsigned integer with Varint encoding.  Writing a 32-bit value
+  // is equivalent to casting it to uint64 and writing it as a 64-bit value,
+  // but may be more efficient.
+  void WriteVarint32(uint32 value);
+  // Like WriteVarint32()  but writing directly to the target array.
+  static uint8* WriteVarint32ToArray(uint32 value, uint8* target);
+  // Write an unsigned integer with Varint encoding.
+  void WriteVarint64(uint64 value);
+  // Like WriteVarint64()  but writing directly to the target array.
+  static uint8* WriteVarint64ToArray(uint64 value, uint8* target);
+
+  // Equivalent to WriteVarint32() except when the value is negative,
+  // in which case it must be sign-extended to a full 10 bytes.
+  void WriteVarint32SignExtended(int32 value);
+  // Like WriteVarint32SignExtended()  but writing directly to the target array.
+  static uint8* WriteVarint32SignExtendedToArray(int32 value, uint8* target);
+
+  // This is identical to WriteVarint32(), but optimized for writing tags.
+  // In particular, if the input is a compile-time constant, this method
+  // compiles down to a couple instructions.
+  // Always inline because otherwise the aformentioned optimization can't work,
+  // but GCC by default doesn't want to inline this.
+  void WriteTag(uint32 value);
+  // Like WriteTag()  but writing directly to the target array.
+  static uint8* WriteTagToArray(
+      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  // Returns the number of bytes needed to encode the given value as a varint.
+  static int VarintSize32(uint32 value);
+  // Returns the number of bytes needed to encode the given value as a varint.
+  static int VarintSize64(uint64 value);
+
+  // If negative, 10 bytes.  Otheriwse, same as VarintSize32().
+  static int VarintSize32SignExtended(int32 value);
+
+  // Compile-time equivalent of VarintSize32().
+  template <uint32 Value>
+  struct StaticVarintSize32 {
+    static const int value =
+        (Value < (1 << 7))
+            ? 1
+            : (Value < (1 << 14))
+                ? 2
+                : (Value < (1 << 21))
+                    ? 3
+                    : (Value < (1 << 28))
+                        ? 4
+                        : 5;
+  };
+
+  // Returns the total number of bytes written since this object was created.
+  inline int ByteCount() const;
+
+  // Returns true if there was an underlying I/O error since this object was
+  // created.
+  bool HadError() const { return had_error_; }
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodedOutputStream);
+
+  ZeroCopyOutputStream* output_;
+  uint8* buffer_;
+  int buffer_size_;
+  int total_bytes_;  // Sum of sizes of all buffers seen so far.
+  bool had_error_;   // Whether an error occurred during output.
+
+  // Advance the buffer by a given number of bytes.
+  void Advance(int amount);
+
+  // Called when the buffer runs out to request more data.  Implies an
+  // Advance(buffer_size_).
+  bool Refresh();
+
+  static uint8* WriteVarint32FallbackToArray(uint32 value, uint8* target);
+
+  // Always-inlined versions of WriteVarint* functions so that code can be
+  // reused, while still controlling size. For instance, WriteVarint32ToArray()
+  // should not directly call this: since it is inlined itself, doing so
+  // would greatly increase the size of generated code. Instead, it should call
+  // WriteVarint32FallbackToArray.  Meanwhile, WriteVarint32() is already
+  // out-of-line, so it should just invoke this directly to avoid any extra
+  // function call overhead.
+  static uint8* WriteVarint32FallbackToArrayInline(
+      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+  static uint8* WriteVarint64ToArrayInline(
+      uint64 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  static int VarintSize32Fallback(uint32 value);
+};
+
+// inline methods ====================================================
+// The vast majority of varints are only one byte.  These inline
+// methods optimize for that case.
+
+inline bool CodedInputStream::ReadVarint32(uint32* value) {
+  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && *buffer_ < 0x80) {
+    *value = *buffer_;
+    Advance(1);
+    return true;
+  } else {
+    return ReadVarint32Fallback(value);
+  }
+}
+
+inline bool CodedInputStream::ReadVarint64(uint64* value) {
+  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && *buffer_ < 0x80) {
+    *value = *buffer_;
+    Advance(1);
+    return true;
+  } else {
+    return ReadVarint64Fallback(value);
+  }
+}
+
+// static
+inline const uint8* CodedInputStream::ReadLittleEndian32FromArray(
+    const uint8* buffer,
+    uint32* value) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  memcpy(value, buffer, sizeof(*value));
+  return buffer + sizeof(*value);
+#else
+  *value = (static_cast<uint32>(buffer[0])      ) |
+           (static_cast<uint32>(buffer[1]) <<  8) |
+           (static_cast<uint32>(buffer[2]) << 16) |
+           (static_cast<uint32>(buffer[3]) << 24);
+  return buffer + sizeof(*value);
+#endif
+}
+// static
+inline const uint8* CodedInputStream::ReadLittleEndian64FromArray(
+    const uint8* buffer,
+    uint64* value) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  memcpy(value, buffer, sizeof(*value));
+  return buffer + sizeof(*value);
+#else
+  uint32 part0 = (static_cast<uint32>(buffer[0])      ) |
+                 (static_cast<uint32>(buffer[1]) <<  8) |
+                 (static_cast<uint32>(buffer[2]) << 16) |
+                 (static_cast<uint32>(buffer[3]) << 24);
+  uint32 part1 = (static_cast<uint32>(buffer[4])      ) |
+                 (static_cast<uint32>(buffer[5]) <<  8) |
+                 (static_cast<uint32>(buffer[6]) << 16) |
+                 (static_cast<uint32>(buffer[7]) << 24);
+  *value = static_cast<uint64>(part0) |
+          (static_cast<uint64>(part1) << 32);
+  return buffer + sizeof(*value);
+#endif
+}
+
+inline bool CodedInputStream::ReadLittleEndian32(uint32* value) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  if (GOOGLE_PREDICT_TRUE(BufferSize() >= static_cast<int>(sizeof(*value)))) {
+    memcpy(value, buffer_, sizeof(*value));
+    Advance(sizeof(*value));
+    return true;
+  } else {
+    return ReadLittleEndian32Fallback(value);
+  }
+#else
+  return ReadLittleEndian32Fallback(value);
+#endif
+}
+
+inline bool CodedInputStream::ReadLittleEndian64(uint64* value) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  if (GOOGLE_PREDICT_TRUE(BufferSize() >= static_cast<int>(sizeof(*value)))) {
+    memcpy(value, buffer_, sizeof(*value));
+    Advance(sizeof(*value));
+    return true;
+  } else {
+    return ReadLittleEndian64Fallback(value);
+  }
+#else
+  return ReadLittleEndian64Fallback(value);
+#endif
+}
+
+inline uint32 CodedInputStream::ReadTag() {
+  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && buffer_[0] < 0x80) {
+    last_tag_ = buffer_[0];
+    Advance(1);
+    return last_tag_;
+  } else {
+    last_tag_ = ReadTagFallback();
+    return last_tag_;
+  }
+}
+
+inline bool CodedInputStream::LastTagWas(uint32 expected) {
+  return last_tag_ == expected;
+}
+
+inline bool CodedInputStream::ConsumedEntireMessage() {
+  return legitimate_message_end_;
+}
+
+inline bool CodedInputStream::ExpectTag(uint32 expected) {
+  if (expected < (1 << 7)) {
+    if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && buffer_[0] == expected) {
+      Advance(1);
+      return true;
+    } else {
+      return false;
+    }
+  } else if (expected < (1 << 14)) {
+    if (GOOGLE_PREDICT_TRUE(BufferSize() >= 2) &&
+        buffer_[0] == static_cast<uint8>(expected | 0x80) &&
+        buffer_[1] == static_cast<uint8>(expected >> 7)) {
+      Advance(2);
+      return true;
+    } else {
+      return false;
+    }
+  } else {
+    // Don't bother optimizing for larger values.
+    return false;
+  }
+}
+
+inline const uint8* CodedInputStream::ExpectTagFromArray(
+    const uint8* buffer, uint32 expected) {
+  if (expected < (1 << 7)) {
+    if (buffer[0] == expected) {
+      return buffer + 1;
+    }
+  } else if (expected < (1 << 14)) {
+    if (buffer[0] == static_cast<uint8>(expected | 0x80) &&
+        buffer[1] == static_cast<uint8>(expected >> 7)) {
+      return buffer + 2;
+    }
+  }
+  return NULL;
+}
+
+inline void CodedInputStream::GetDirectBufferPointerInline(const void** data,
+                                                           int* size) {
+  *data = buffer_;
+  *size = buffer_end_ - buffer_;
+}
+
+inline bool CodedInputStream::ExpectAtEnd() {
+  // If we are at a limit we know no more bytes can be read.  Otherwise, it's
+  // hard to say without calling Refresh(), and we'd rather not do that.
+
+  if (buffer_ == buffer_end_ &&
+      ((buffer_size_after_limit_ != 0) ||
+       (total_bytes_read_ == current_limit_))) {
+    last_tag_ = 0;                   // Pretend we called ReadTag()...
+    legitimate_message_end_ = true;  // ... and it hit EOF.
+    return true;
+  } else {
+    return false;
+  }
+}
+
+inline int CodedInputStream::CurrentPosition() const {
+  return total_bytes_read_ - (BufferSize() + buffer_size_after_limit_);
+}
+
+inline uint8* CodedOutputStream::GetDirectBufferForNBytesAndAdvance(int size) {
+  if (buffer_size_ < size) {
+    return NULL;
+  } else {
+    uint8* result = buffer_;
+    Advance(size);
+    return result;
+  }
+}
+
+inline uint8* CodedOutputStream::WriteVarint32ToArray(uint32 value,
+                                                        uint8* target) {
+  if (value < 0x80) {
+    *target = value;
+    return target + 1;
+  } else {
+    return WriteVarint32FallbackToArray(value, target);
+  }
+}
+
+inline void CodedOutputStream::WriteVarint32SignExtended(int32 value) {
+  if (value < 0) {
+    WriteVarint64(static_cast<uint64>(value));
+  } else {
+    WriteVarint32(static_cast<uint32>(value));
+  }
+}
+
+inline uint8* CodedOutputStream::WriteVarint32SignExtendedToArray(
+    int32 value, uint8* target) {
+  if (value < 0) {
+    return WriteVarint64ToArray(static_cast<uint64>(value), target);
+  } else {
+    return WriteVarint32ToArray(static_cast<uint32>(value), target);
+  }
+}
+
+inline uint8* CodedOutputStream::WriteLittleEndian32ToArray(uint32 value,
+                                                            uint8* target) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  memcpy(target, &value, sizeof(value));
+#else
+  target[0] = static_cast<uint8>(value);
+  target[1] = static_cast<uint8>(value >>  8);
+  target[2] = static_cast<uint8>(value >> 16);
+  target[3] = static_cast<uint8>(value >> 24);
+#endif
+  return target + sizeof(value);
+}
+
+inline uint8* CodedOutputStream::WriteLittleEndian64ToArray(uint64 value,
+                                                            uint8* target) {
+#if defined(PROTOBUF_LITTLE_ENDIAN)
+  memcpy(target, &value, sizeof(value));
+#else
+  uint32 part0 = static_cast<uint32>(value);
+  uint32 part1 = static_cast<uint32>(value >> 32);
+
+  target[0] = static_cast<uint8>(part0);
+  target[1] = static_cast<uint8>(part0 >>  8);
+  target[2] = static_cast<uint8>(part0 >> 16);
+  target[3] = static_cast<uint8>(part0 >> 24);
+  target[4] = static_cast<uint8>(part1);
+  target[5] = static_cast<uint8>(part1 >>  8);
+  target[6] = static_cast<uint8>(part1 >> 16);
+  target[7] = static_cast<uint8>(part1 >> 24);
+#endif
+  return target + sizeof(value);
+}
+
+inline void CodedOutputStream::WriteTag(uint32 value) {
+  WriteVarint32(value);
+}
+
+inline uint8* CodedOutputStream::WriteTagToArray(
+    uint32 value, uint8* target) {
+  if (value < (1 << 7)) {
+    target[0] = value;
+    return target + 1;
+  } else if (value < (1 << 14)) {
+    target[0] = static_cast<uint8>(value | 0x80);
+    target[1] = static_cast<uint8>(value >> 7);
+    return target + 2;
+  } else {
+    return WriteVarint32FallbackToArray(value, target);
+  }
+}
+
+inline int CodedOutputStream::VarintSize32(uint32 value) {
+  if (value < (1 << 7)) {
+    return 1;
+  } else  {
+    return VarintSize32Fallback(value);
+  }
+}
+
+inline int CodedOutputStream::VarintSize32SignExtended(int32 value) {
+  if (value < 0) {
+    return 10;     // TODO(kenton):  Make this a symbolic constant.
+  } else {
+    return VarintSize32(static_cast<uint32>(value));
+  }
+}
+
+inline void CodedOutputStream::WriteString(const string& str) {
+  WriteRaw(str.data(), static_cast<int>(str.size()));
+}
+
+inline uint8* CodedOutputStream::WriteStringToArray(
+    const string& str, uint8* target) {
+  return WriteRawToArray(str.data(), static_cast<int>(str.size()), target);
+}
+
+inline int CodedOutputStream::ByteCount() const {
+  return total_bytes_ - buffer_size_;
+}
+
+inline void CodedInputStream::Advance(int amount) {
+  buffer_ += amount;
+}
+
+inline void CodedOutputStream::Advance(int amount) {
+  buffer_ += amount;
+  buffer_size_ -= amount;
+}
+
+inline void CodedInputStream::SetRecursionLimit(int limit) {
+  recursion_limit_ = limit;
+}
+
+inline bool CodedInputStream::IncrementRecursionDepth() {
+  ++recursion_depth_;
+  return recursion_depth_ <= recursion_limit_;
+}
+
+inline void CodedInputStream::DecrementRecursionDepth() {
+  if (recursion_depth_ > 0) --recursion_depth_;
+}
+
+inline void CodedInputStream::SetExtensionRegistry(const DescriptorPool* pool,
+                                                   MessageFactory* factory) {
+  extension_pool_ = pool;
+  extension_factory_ = factory;
+}
+
+inline const DescriptorPool* CodedInputStream::GetExtensionPool() {
+  return extension_pool_;
+}
+
+inline MessageFactory* CodedInputStream::GetExtensionFactory() {
+  return extension_factory_;
+}
+
+inline int CodedInputStream::BufferSize() const {
+  return buffer_end_ - buffer_;
+}
+
+inline CodedInputStream::CodedInputStream(ZeroCopyInputStream* input)
+  : input_(input),
+    buffer_(NULL),
+    buffer_end_(NULL),
+    total_bytes_read_(0),
+    overflow_bytes_(0),
+    last_tag_(0),
+    legitimate_message_end_(false),
+    aliasing_enabled_(false),
+    current_limit_(kint32max),
+    buffer_size_after_limit_(0),
+    total_bytes_limit_(kDefaultTotalBytesLimit),
+    total_bytes_warning_threshold_(kDefaultTotalBytesWarningThreshold),
+    recursion_depth_(0),
+    recursion_limit_(default_recursion_limit_),
+    extension_pool_(NULL),
+    extension_factory_(NULL) {
+  // Eagerly Refresh() so buffer space is immediately available.
+  Refresh();
+}
+
+inline CodedInputStream::CodedInputStream(const uint8* buffer, int size)
+  : input_(NULL),
+    buffer_(buffer),
+    buffer_end_(buffer + size),
+    total_bytes_read_(size),
+    overflow_bytes_(0),
+    last_tag_(0),
+    legitimate_message_end_(false),
+    aliasing_enabled_(false),
+    current_limit_(size),
+    buffer_size_after_limit_(0),
+    total_bytes_limit_(kDefaultTotalBytesLimit),
+    total_bytes_warning_threshold_(kDefaultTotalBytesWarningThreshold),
+    recursion_depth_(0),
+    recursion_limit_(default_recursion_limit_),
+    extension_pool_(NULL),
+    extension_factory_(NULL) {
+  // Note that setting current_limit_ == size is important to prevent some
+  // code paths from trying to access input_ and segfaulting.
+}
+
+inline bool CodedInputStream::IsFlat() const {
+  return input_ == NULL;
+}
+
+}  // namespace io
+}  // namespace protobuf
+
+
+#if defined(_MSC_VER) && _MSC_VER >= 1300
+  #pragma runtime_checks("c", restore)
+#endif  // _MSC_VER
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/gzip_stream.h b/ps-lite/deps/include/google/protobuf/io/gzip_stream.h
new file mode 100644
index 00000000..365e9ea5
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/gzip_stream.h
@@ -0,0 +1,209 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: brianolson@google.com (Brian Olson)
+//
+// This file contains the definition for classes GzipInputStream and
+// GzipOutputStream.
+//
+// GzipInputStream decompresses data from an underlying
+// ZeroCopyInputStream and provides the decompressed data as a
+// ZeroCopyInputStream.
+//
+// GzipOutputStream is an ZeroCopyOutputStream that compresses data to
+// an underlying ZeroCopyOutputStream.
+
+#ifndef GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
+#define GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
+
+#include <zlib.h>
+
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/io/zero_copy_stream.h>
+
+namespace google {
+namespace protobuf {
+namespace io {
+
+// A ZeroCopyInputStream that reads compressed data through zlib
+class LIBPROTOBUF_EXPORT GzipInputStream : public ZeroCopyInputStream {
+ public:
+  // Format key for constructor
+  enum Format {
+    // zlib will autodetect gzip header or deflate stream
+    AUTO = 0,
+
+    // GZIP streams have some extra header data for file attributes.
+    GZIP = 1,
+
+    // Simpler zlib stream format.
+    ZLIB = 2,
+  };
+
+  // buffer_size and format may be -1 for default of 64kB and GZIP format
+  explicit GzipInputStream(
+      ZeroCopyInputStream* sub_stream,
+      Format format = AUTO,
+      int buffer_size = -1);
+  virtual ~GzipInputStream();
+
+  // Return last error message or NULL if no error.
+  inline const char* ZlibErrorMessage() const {
+    return zcontext_.msg;
+  }
+  inline int ZlibErrorCode() const {
+    return zerror_;
+  }
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+ private:
+  Format format_;
+
+  ZeroCopyInputStream* sub_stream_;
+
+  z_stream zcontext_;
+  int zerror_;
+
+  void* output_buffer_;
+  void* output_position_;
+  size_t output_buffer_length_;
+
+  int Inflate(int flush);
+  void DoNextOutput(const void** data, int* size);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GzipInputStream);
+};
+
+
+class LIBPROTOBUF_EXPORT GzipOutputStream : public ZeroCopyOutputStream {
+ public:
+  // Format key for constructor
+  enum Format {
+    // GZIP streams have some extra header data for file attributes.
+    GZIP = 1,
+
+    // Simpler zlib stream format.
+    ZLIB = 2,
+  };
+
+  struct LIBPROTOBUF_EXPORT Options {
+    // Defaults to GZIP.
+    Format format;
+
+    // What size buffer to use internally.  Defaults to 64kB.
+    int buffer_size;
+
+    // A number between 0 and 9, where 0 is no compression and 9 is best
+    // compression.  Defaults to Z_DEFAULT_COMPRESSION (see zlib.h).
+    int compression_level;
+
+    // Defaults to Z_DEFAULT_STRATEGY.  Can also be set to Z_FILTERED,
+    // Z_HUFFMAN_ONLY, or Z_RLE.  See the documentation for deflateInit2 in
+    // zlib.h for definitions of these constants.
+    int compression_strategy;
+
+    Options();  // Initializes with default values.
+  };
+
+  // Create a GzipOutputStream with default options.
+  explicit GzipOutputStream(ZeroCopyOutputStream* sub_stream);
+
+  // Create a GzipOutputStream with the given options.
+  GzipOutputStream(
+      ZeroCopyOutputStream* sub_stream,
+      const Options& options);
+
+  virtual ~GzipOutputStream();
+
+  // Return last error message or NULL if no error.
+  inline const char* ZlibErrorMessage() const {
+    return zcontext_.msg;
+  }
+  inline int ZlibErrorCode() const {
+    return zerror_;
+  }
+
+  // Flushes data written so far to zipped data in the underlying stream.
+  // It is the caller's responsibility to flush the underlying stream if
+  // necessary.
+  // Compression may be less efficient stopping and starting around flushes.
+  // Returns true if no error.
+  //
+  // Please ensure that block size is > 6. Here is an excerpt from the zlib
+  // doc that explains why:
+  //
+  // In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that avail_out
+  // is greater than six to avoid repeated flush markers due to
+  // avail_out == 0 on return.
+  bool Flush();
+
+  // Writes out all data and closes the gzip stream.
+  // It is the caller's responsibility to close the underlying stream if
+  // necessary.
+  // Returns true if no error.
+  bool Close();
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  ZeroCopyOutputStream* sub_stream_;
+  // Result from calling Next() on sub_stream_
+  void* sub_data_;
+  int sub_data_size_;
+
+  z_stream zcontext_;
+  int zerror_;
+  void* input_buffer_;
+  size_t input_buffer_length_;
+
+  // Shared constructor code.
+  void Init(ZeroCopyOutputStream* sub_stream, const Options& options);
+
+  // Do some compression.
+  // Takes zlib flush mode.
+  // Returns zlib error code.
+  int Deflate(int flush);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GzipOutputStream);
+};
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/printer.h b/ps-lite/deps/include/google/protobuf/io/printer.h
new file mode 100644
index 00000000..5be48543
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/printer.h
@@ -0,0 +1,136 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Utility class for writing text to a ZeroCopyOutputStream.
+
+#ifndef GOOGLE_PROTOBUF_IO_PRINTER_H__
+#define GOOGLE_PROTOBUF_IO_PRINTER_H__
+
+#include <string>
+#include <map>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+namespace io {
+
+class ZeroCopyOutputStream;     // zero_copy_stream.h
+
+// This simple utility class assists in code generation.  It basically
+// allows the caller to define a set of variables and then output some
+// text with variable substitutions.  Example usage:
+//
+//   Printer printer(output, '$');
+//   map<string, string> vars;
+//   vars["name"] = "Bob";
+//   printer.Print(vars, "My name is $name$.");
+//
+// The above writes "My name is Bob." to the output stream.
+//
+// Printer aggressively enforces correct usage, crashing (with assert failures)
+// in the case of undefined variables in debug builds. This helps greatly in
+// debugging code which uses it.
+class LIBPROTOBUF_EXPORT Printer {
+ public:
+  // Create a printer that writes text to the given output stream.  Use the
+  // given character as the delimiter for variables.
+  Printer(ZeroCopyOutputStream* output, char variable_delimiter);
+  ~Printer();
+
+  // Print some text after applying variable substitutions.  If a particular
+  // variable in the text is not defined, this will crash.  Variables to be
+  // substituted are identified by their names surrounded by delimiter
+  // characters (as given to the constructor).  The variable bindings are
+  // defined by the given map.
+  void Print(const map<string, string>& variables, const char* text);
+
+  // Like the first Print(), except the substitutions are given as parameters.
+  void Print(const char* text);
+  // Like the first Print(), except the substitutions are given as parameters.
+  void Print(const char* text, const char* variable, const string& value);
+  // Like the first Print(), except the substitutions are given as parameters.
+  void Print(const char* text, const char* variable1, const string& value1,
+                               const char* variable2, const string& value2);
+  // Like the first Print(), except the substitutions are given as parameters.
+  void Print(const char* text, const char* variable1, const string& value1,
+                               const char* variable2, const string& value2,
+                               const char* variable3, const string& value3);
+  // TODO(kenton):  Overloaded versions with more variables?  Three seems
+  //   to be enough.
+
+  // Indent text by two spaces.  After calling Indent(), two spaces will be
+  // inserted at the beginning of each line of text.  Indent() may be called
+  // multiple times to produce deeper indents.
+  void Indent();
+
+  // Reduces the current indent level by two spaces, or crashes if the indent
+  // level is zero.
+  void Outdent();
+
+  // Write a string to the output buffer.
+  // This method does not look for newlines to add indentation.
+  void PrintRaw(const string& data);
+
+  // Write a zero-delimited string to output buffer.
+  // This method does not look for newlines to add indentation.
+  void PrintRaw(const char* data);
+
+  // Write some bytes to the output buffer.
+  // This method does not look for newlines to add indentation.
+  void WriteRaw(const char* data, int size);
+
+  // True if any write to the underlying stream failed.  (We don't just
+  // crash in this case because this is an I/O failure, not a programming
+  // error.)
+  bool failed() const { return failed_; }
+
+ private:
+  const char variable_delimiter_;
+
+  ZeroCopyOutputStream* const output_;
+  char* buffer_;
+  int buffer_size_;
+
+  string indent_;
+  bool at_start_of_line_;
+  bool failed_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Printer);
+};
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_PRINTER_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/tokenizer.h b/ps-lite/deps/include/google/protobuf/io/tokenizer.h
new file mode 100644
index 00000000..d85b82f9
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/tokenizer.h
@@ -0,0 +1,384 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Class for parsing tokenized text from a ZeroCopyInputStream.
+
+#ifndef GOOGLE_PROTOBUF_IO_TOKENIZER_H__
+#define GOOGLE_PROTOBUF_IO_TOKENIZER_H__
+
+#include <string>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+namespace io {
+
+class ZeroCopyInputStream;     // zero_copy_stream.h
+
+// Defined in this file.
+class ErrorCollector;
+class Tokenizer;
+
+// Abstract interface for an object which collects the errors that occur
+// during parsing.  A typical implementation might simply print the errors
+// to stdout.
+class LIBPROTOBUF_EXPORT ErrorCollector {
+ public:
+  inline ErrorCollector() {}
+  virtual ~ErrorCollector();
+
+  // Indicates that there was an error in the input at the given line and
+  // column numbers.  The numbers are zero-based, so you may want to add
+  // 1 to each before printing them.
+  virtual void AddError(int line, int column, const string& message) = 0;
+
+  // Indicates that there was a warning in the input at the given line and
+  // column numbers.  The numbers are zero-based, so you may want to add
+  // 1 to each before printing them.
+  virtual void AddWarning(int line, int column, const string& message) { }
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ErrorCollector);
+};
+
+// This class converts a stream of raw text into a stream of tokens for
+// the protocol definition parser to parse.  The tokens recognized are
+// similar to those that make up the C language; see the TokenType enum for
+// precise descriptions.  Whitespace and comments are skipped.  By default,
+// C- and C++-style comments are recognized, but other styles can be used by
+// calling set_comment_style().
+class LIBPROTOBUF_EXPORT Tokenizer {
+ public:
+  // Construct a Tokenizer that reads and tokenizes text from the given
+  // input stream and writes errors to the given error_collector.
+  // The caller keeps ownership of input and error_collector.
+  Tokenizer(ZeroCopyInputStream* input, ErrorCollector* error_collector);
+  ~Tokenizer();
+
+  enum TokenType {
+    TYPE_START,       // Next() has not yet been called.
+    TYPE_END,         // End of input reached.  "text" is empty.
+
+    TYPE_IDENTIFIER,  // A sequence of letters, digits, and underscores, not
+                      // starting with a digit.  It is an error for a number
+                      // to be followed by an identifier with no space in
+                      // between.
+    TYPE_INTEGER,     // A sequence of digits representing an integer.  Normally
+                      // the digits are decimal, but a prefix of "0x" indicates
+                      // a hex number and a leading zero indicates octal, just
+                      // like with C numeric literals.  A leading negative sign
+                      // is NOT included in the token; it's up to the parser to
+                      // interpret the unary minus operator on its own.
+    TYPE_FLOAT,       // A floating point literal, with a fractional part and/or
+                      // an exponent.  Always in decimal.  Again, never
+                      // negative.
+    TYPE_STRING,      // A quoted sequence of escaped characters.  Either single
+                      // or double quotes can be used, but they must match.
+                      // A string literal cannot cross a line break.
+    TYPE_SYMBOL,      // Any other printable character, like '!' or '+'.
+                      // Symbols are always a single character, so "!+$%" is
+                      // four tokens.
+  };
+
+  // Structure representing a token read from the token stream.
+  struct Token {
+    TokenType type;
+    string text;       // The exact text of the token as it appeared in
+                       // the input.  e.g. tokens of TYPE_STRING will still
+                       // be escaped and in quotes.
+
+    // "line" and "column" specify the position of the first character of
+    // the token within the input stream.  They are zero-based.
+    int line;
+    int column;
+    int end_column;
+  };
+
+  // Get the current token.  This is updated when Next() is called.  Before
+  // the first call to Next(), current() has type TYPE_START and no contents.
+  const Token& current();
+
+  // Return the previous token -- i.e. what current() returned before the
+  // previous call to Next().
+  const Token& previous();
+
+  // Advance to the next token.  Returns false if the end of the input is
+  // reached.
+  bool Next();
+
+  // Like Next(), but also collects comments which appear between the previous
+  // and next tokens.
+  //
+  // Comments which appear to be attached to the previous token are stored
+  // in *prev_tailing_comments.  Comments which appear to be attached to the
+  // next token are stored in *next_leading_comments.  Comments appearing in
+  // between which do not appear to be attached to either will be added to
+  // detached_comments.  Any of these parameters can be NULL to simply discard
+  // the comments.
+  //
+  // A series of line comments appearing on consecutive lines, with no other
+  // tokens appearing on those lines, will be treated as a single comment.
+  //
+  // Only the comment content is returned; comment markers (e.g. //) are
+  // stripped out.  For block comments, leading whitespace and an asterisk will
+  // be stripped from the beginning of each line other than the first.  Newlines
+  // are included in the output.
+  //
+  // Examples:
+  //
+  //   optional int32 foo = 1;  // Comment attached to foo.
+  //   // Comment attached to bar.
+  //   optional int32 bar = 2;
+  //
+  //   optional string baz = 3;
+  //   // Comment attached to baz.
+  //   // Another line attached to baz.
+  //
+  //   // Comment attached to qux.
+  //   //
+  //   // Another line attached to qux.
+  //   optional double qux = 4;
+  //
+  //   // Detached comment.  This is not attached to qux or corge
+  //   // because there are blank lines separating it from both.
+  //
+  //   optional string corge = 5;
+  //   /* Block comment attached
+  //    * to corge.  Leading asterisks
+  //    * will be removed. */
+  //   /* Block comment attached to
+  //    * grault. */
+  //   optional int32 grault = 6;
+  bool NextWithComments(string* prev_trailing_comments,
+                        vector<string>* detached_comments,
+                        string* next_leading_comments);
+
+  // Parse helpers ---------------------------------------------------
+
+  // Parses a TYPE_FLOAT token.  This never fails, so long as the text actually
+  // comes from a TYPE_FLOAT token parsed by Tokenizer.  If it doesn't, the
+  // result is undefined (possibly an assert failure).
+  static double ParseFloat(const string& text);
+
+  // Parses a TYPE_STRING token.  This never fails, so long as the text actually
+  // comes from a TYPE_STRING token parsed by Tokenizer.  If it doesn't, the
+  // result is undefined (possibly an assert failure).
+  static void ParseString(const string& text, string* output);
+
+  // Identical to ParseString, but appends to output.
+  static void ParseStringAppend(const string& text, string* output);
+
+  // Parses a TYPE_INTEGER token.  Returns false if the result would be
+  // greater than max_value.  Otherwise, returns true and sets *output to the
+  // result.  If the text is not from a Token of type TYPE_INTEGER originally
+  // parsed by a Tokenizer, the result is undefined (possibly an assert
+  // failure).
+  static bool ParseInteger(const string& text, uint64 max_value,
+                           uint64* output);
+
+  // Options ---------------------------------------------------------
+
+  // Set true to allow floats to be suffixed with the letter 'f'.  Tokens
+  // which would otherwise be integers but which have the 'f' suffix will be
+  // forced to be interpreted as floats.  For all other purposes, the 'f' is
+  // ignored.
+  void set_allow_f_after_float(bool value) { allow_f_after_float_ = value; }
+
+  // Valid values for set_comment_style().
+  enum CommentStyle {
+    // Line comments begin with "//", block comments are delimited by "/*" and
+    // "*/".
+    CPP_COMMENT_STYLE,
+    // Line comments begin with "#".  No way to write block comments.
+    SH_COMMENT_STYLE
+  };
+
+  // Sets the comment style.
+  void set_comment_style(CommentStyle style) { comment_style_ = style; }
+
+  // -----------------------------------------------------------------
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Tokenizer);
+
+  Token current_;           // Returned by current().
+  Token previous_;          // Returned by previous().
+
+  ZeroCopyInputStream* input_;
+  ErrorCollector* error_collector_;
+
+  char current_char_;       // == buffer_[buffer_pos_], updated by NextChar().
+  const char* buffer_;      // Current buffer returned from input_.
+  int buffer_size_;         // Size of buffer_.
+  int buffer_pos_;          // Current position within the buffer.
+  bool read_error_;         // Did we previously encounter a read error?
+
+  // Line and column number of current_char_ within the whole input stream.
+  int line_;
+  int column_;
+
+  // String to which text should be appended as we advance through it.
+  // Call RecordTo(&str) to start recording and StopRecording() to stop.
+  // E.g. StartToken() calls RecordTo(&current_.text).  record_start_ is the
+  // position within the current buffer where recording started.
+  string* record_target_;
+  int record_start_;
+
+  // Options.
+  bool allow_f_after_float_;
+  CommentStyle comment_style_;
+
+  // Since we count columns we need to interpret tabs somehow.  We'll take
+  // the standard 8-character definition for lack of any way to do better.
+  static const int kTabWidth = 8;
+
+  // -----------------------------------------------------------------
+  // Helper methods.
+
+  // Consume this character and advance to the next one.
+  void NextChar();
+
+  // Read a new buffer from the input.
+  void Refresh();
+
+  inline void RecordTo(string* target);
+  inline void StopRecording();
+
+  // Called when the current character is the first character of a new
+  // token (not including whitespace or comments).
+  inline void StartToken();
+  // Called when the current character is the first character after the
+  // end of the last token.  After this returns, current_.text will
+  // contain all text consumed since StartToken() was called.
+  inline void EndToken();
+
+  // Convenience method to add an error at the current line and column.
+  void AddError(const string& message) {
+    error_collector_->AddError(line_, column_, message);
+  }
+
+  // -----------------------------------------------------------------
+  // The following four methods are used to consume tokens of specific
+  // types.  They are actually used to consume all characters *after*
+  // the first, since the calling function consumes the first character
+  // in order to decide what kind of token is being read.
+
+  // Read and consume a string, ending when the given delimiter is
+  // consumed.
+  void ConsumeString(char delimiter);
+
+  // Read and consume a number, returning TYPE_FLOAT or TYPE_INTEGER
+  // depending on what was read.  This needs to know if the first
+  // character was a zero in order to correctly recognize hex and octal
+  // numbers.
+  // It also needs to know if the first characted was a . to parse floating
+  // point correctly.
+  TokenType ConsumeNumber(bool started_with_zero, bool started_with_dot);
+
+  // Consume the rest of a line.
+  void ConsumeLineComment(string* content);
+  // Consume until "*/".
+  void ConsumeBlockComment(string* content);
+
+  enum NextCommentStatus {
+    // Started a line comment.
+    LINE_COMMENT,
+
+    // Started a block comment.
+    BLOCK_COMMENT,
+
+    // Consumed a slash, then realized it wasn't a comment.  current_ has
+    // been filled in with a slash token.  The caller should return it.
+    SLASH_NOT_COMMENT,
+
+    // We do not appear to be starting a comment here.
+    NO_COMMENT
+  };
+
+  // If we're at the start of a new comment, consume it and return what kind
+  // of comment it is.
+  NextCommentStatus TryConsumeCommentStart();
+
+  // -----------------------------------------------------------------
+  // These helper methods make the parsing code more readable.  The
+  // "character classes" refered to are defined at the top of the .cc file.
+  // Basically it is a C++ class with one method:
+  //   static bool InClass(char c);
+  // The method returns true if c is a member of this "class", like "Letter"
+  // or "Digit".
+
+  // Returns true if the current character is of the given character
+  // class, but does not consume anything.
+  template<typename CharacterClass>
+  inline bool LookingAt();
+
+  // If the current character is in the given class, consume it and return
+  // true.  Otherwise return false.
+  // e.g. TryConsumeOne<Letter>()
+  template<typename CharacterClass>
+  inline bool TryConsumeOne();
+
+  // Like above, but try to consume the specific character indicated.
+  inline bool TryConsume(char c);
+
+  // Consume zero or more of the given character class.
+  template<typename CharacterClass>
+  inline void ConsumeZeroOrMore();
+
+  // Consume one or more of the given character class or log the given
+  // error message.
+  // e.g. ConsumeOneOrMore<Digit>("Expected digits.");
+  template<typename CharacterClass>
+  inline void ConsumeOneOrMore(const char* error);
+};
+
+// inline methods ====================================================
+inline const Tokenizer::Token& Tokenizer::current() {
+  return current_;
+}
+
+inline const Tokenizer::Token& Tokenizer::previous() {
+  return previous_;
+}
+
+inline void Tokenizer::ParseString(const string& text, string* output) {
+  output->clear();
+  ParseStringAppend(text, output);
+}
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_TOKENIZER_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
new file mode 100644
index 00000000..db5326f7
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
@@ -0,0 +1,238 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains the ZeroCopyInputStream and ZeroCopyOutputStream
+// interfaces, which represent abstract I/O streams to and from which
+// protocol buffers can be read and written.  For a few simple
+// implementations of these interfaces, see zero_copy_stream_impl.h.
+//
+// These interfaces are different from classic I/O streams in that they
+// try to minimize the amount of data copying that needs to be done.
+// To accomplish this, responsibility for allocating buffers is moved to
+// the stream object, rather than being the responsibility of the caller.
+// So, the stream can return a buffer which actually points directly into
+// the final data structure where the bytes are to be stored, and the caller
+// can interact directly with that buffer, eliminating an intermediate copy
+// operation.
+//
+// As an example, consider the common case in which you are reading bytes
+// from an array that is already in memory (or perhaps an mmap()ed file).
+// With classic I/O streams, you would do something like:
+//   char buffer[BUFFER_SIZE];
+//   input->Read(buffer, BUFFER_SIZE);
+//   DoSomething(buffer, BUFFER_SIZE);
+// Then, the stream basically just calls memcpy() to copy the data from
+// the array into your buffer.  With a ZeroCopyInputStream, you would do
+// this instead:
+//   const void* buffer;
+//   int size;
+//   input->Next(&buffer, &size);
+//   DoSomething(buffer, size);
+// Here, no copy is performed.  The input stream returns a pointer directly
+// into the backing array, and the caller ends up reading directly from it.
+//
+// If you want to be able to read the old-fashion way, you can create
+// a CodedInputStream or CodedOutputStream wrapping these objects and use
+// their ReadRaw()/WriteRaw() methods.  These will, of course, add a copy
+// step, but Coded*Stream will handle buffering so at least it will be
+// reasonably efficient.
+//
+// ZeroCopyInputStream example:
+//   // Read in a file and print its contents to stdout.
+//   int fd = open("myfile", O_RDONLY);
+//   ZeroCopyInputStream* input = new FileInputStream(fd);
+//
+//   const void* buffer;
+//   int size;
+//   while (input->Next(&buffer, &size)) {
+//     cout.write(buffer, size);
+//   }
+//
+//   delete input;
+//   close(fd);
+//
+// ZeroCopyOutputStream example:
+//   // Copy the contents of "infile" to "outfile", using plain read() for
+//   // "infile" but a ZeroCopyOutputStream for "outfile".
+//   int infd = open("infile", O_RDONLY);
+//   int outfd = open("outfile", O_WRONLY);
+//   ZeroCopyOutputStream* output = new FileOutputStream(outfd);
+//
+//   void* buffer;
+//   int size;
+//   while (output->Next(&buffer, &size)) {
+//     int bytes = read(infd, buffer, size);
+//     if (bytes < size) {
+//       // Reached EOF.
+//       output->BackUp(size - bytes);
+//       break;
+//     }
+//   }
+//
+//   delete output;
+//   close(infd);
+//   close(outfd);
+
+#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
+#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
+
+#include <string>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+
+namespace protobuf {
+namespace io {
+
+// Defined in this file.
+class ZeroCopyInputStream;
+class ZeroCopyOutputStream;
+
+// Abstract interface similar to an input stream but designed to minimize
+// copying.
+class LIBPROTOBUF_EXPORT ZeroCopyInputStream {
+ public:
+  inline ZeroCopyInputStream() {}
+  virtual ~ZeroCopyInputStream();
+
+  // Obtains a chunk of data from the stream.
+  //
+  // Preconditions:
+  // * "size" and "data" are not NULL.
+  //
+  // Postconditions:
+  // * If the returned value is false, there is no more data to return or
+  //   an error occurred.  All errors are permanent.
+  // * Otherwise, "size" points to the actual number of bytes read and "data"
+  //   points to a pointer to a buffer containing these bytes.
+  // * Ownership of this buffer remains with the stream, and the buffer
+  //   remains valid only until some other method of the stream is called
+  //   or the stream is destroyed.
+  // * It is legal for the returned buffer to have zero size, as long
+  //   as repeatedly calling Next() eventually yields a buffer with non-zero
+  //   size.
+  virtual bool Next(const void** data, int* size) = 0;
+
+  // Backs up a number of bytes, so that the next call to Next() returns
+  // data again that was already returned by the last call to Next().  This
+  // is useful when writing procedures that are only supposed to read up
+  // to a certain point in the input, then return.  If Next() returns a
+  // buffer that goes beyond what you wanted to read, you can use BackUp()
+  // to return to the point where you intended to finish.
+  //
+  // Preconditions:
+  // * The last method called must have been Next().
+  // * count must be less than or equal to the size of the last buffer
+  //   returned by Next().
+  //
+  // Postconditions:
+  // * The last "count" bytes of the last buffer returned by Next() will be
+  //   pushed back into the stream.  Subsequent calls to Next() will return
+  //   the same data again before producing new data.
+  virtual void BackUp(int count) = 0;
+
+  // Skips a number of bytes.  Returns false if the end of the stream is
+  // reached or some input error occurred.  In the end-of-stream case, the
+  // stream is advanced to the end of the stream (so ByteCount() will return
+  // the total size of the stream).
+  virtual bool Skip(int count) = 0;
+
+  // Returns the total number of bytes read since this object was created.
+  virtual int64 ByteCount() const = 0;
+
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ZeroCopyInputStream);
+};
+
+// Abstract interface similar to an output stream but designed to minimize
+// copying.
+class LIBPROTOBUF_EXPORT ZeroCopyOutputStream {
+ public:
+  inline ZeroCopyOutputStream() {}
+  virtual ~ZeroCopyOutputStream();
+
+  // Obtains a buffer into which data can be written.  Any data written
+  // into this buffer will eventually (maybe instantly, maybe later on)
+  // be written to the output.
+  //
+  // Preconditions:
+  // * "size" and "data" are not NULL.
+  //
+  // Postconditions:
+  // * If the returned value is false, an error occurred.  All errors are
+  //   permanent.
+  // * Otherwise, "size" points to the actual number of bytes in the buffer
+  //   and "data" points to the buffer.
+  // * Ownership of this buffer remains with the stream, and the buffer
+  //   remains valid only until some other method of the stream is called
+  //   or the stream is destroyed.
+  // * Any data which the caller stores in this buffer will eventually be
+  //   written to the output (unless BackUp() is called).
+  // * It is legal for the returned buffer to have zero size, as long
+  //   as repeatedly calling Next() eventually yields a buffer with non-zero
+  //   size.
+  virtual bool Next(void** data, int* size) = 0;
+
+  // Backs up a number of bytes, so that the end of the last buffer returned
+  // by Next() is not actually written.  This is needed when you finish
+  // writing all the data you want to write, but the last buffer was bigger
+  // than you needed.  You don't want to write a bunch of garbage after the
+  // end of your data, so you use BackUp() to back up.
+  //
+  // Preconditions:
+  // * The last method called must have been Next().
+  // * count must be less than or equal to the size of the last buffer
+  //   returned by Next().
+  // * The caller must not have written anything to the last "count" bytes
+  //   of that buffer.
+  //
+  // Postconditions:
+  // * The last "count" bytes of the last buffer returned by Next() will be
+  //   ignored.
+  virtual void BackUp(int count) = 0;
+
+  // Returns the total number of bytes written since this object was created.
+  virtual int64 ByteCount() const = 0;
+
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ZeroCopyOutputStream);
+};
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
new file mode 100644
index 00000000..9fedb005
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
@@ -0,0 +1,357 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains common implementations of the interfaces defined in
+// zero_copy_stream.h which are only included in the full (non-lite)
+// protobuf library.  These implementations include Unix file descriptors
+// and C++ iostreams.  See also:  zero_copy_stream_impl_lite.h
+
+#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
+#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
+
+#include <string>
+#include <iosfwd>
+#include <google/protobuf/io/zero_copy_stream.h>
+#include <google/protobuf/io/zero_copy_stream_impl_lite.h>
+#include <google/protobuf/stubs/common.h>
+
+
+namespace google {
+namespace protobuf {
+namespace io {
+
+
+// ===================================================================
+
+// A ZeroCopyInputStream which reads from a file descriptor.
+//
+// FileInputStream is preferred over using an ifstream with IstreamInputStream.
+// The latter will introduce an extra layer of buffering, harming performance.
+// Also, it's conceivable that FileInputStream could someday be enhanced
+// to use zero-copy file descriptors on OSs which support them.
+class LIBPROTOBUF_EXPORT FileInputStream : public ZeroCopyInputStream {
+ public:
+  // Creates a stream that reads from the given Unix file descriptor.
+  // If a block_size is given, it specifies the number of bytes that
+  // should be read and returned with each call to Next().  Otherwise,
+  // a reasonable default is used.
+  explicit FileInputStream(int file_descriptor, int block_size = -1);
+  ~FileInputStream();
+
+  // Flushes any buffers and closes the underlying file.  Returns false if
+  // an error occurs during the process; use GetErrno() to examine the error.
+  // Even if an error occurs, the file descriptor is closed when this returns.
+  bool Close();
+
+  // By default, the file descriptor is not closed when the stream is
+  // destroyed.  Call SetCloseOnDelete(true) to change that.  WARNING:
+  // This leaves no way for the caller to detect if close() fails.  If
+  // detecting close() errors is important to you, you should arrange
+  // to close the descriptor yourself.
+  void SetCloseOnDelete(bool value) { copying_input_.SetCloseOnDelete(value); }
+
+  // If an I/O error has occurred on this file descriptor, this is the
+  // errno from that error.  Otherwise, this is zero.  Once an error
+  // occurs, the stream is broken and all subsequent operations will
+  // fail.
+  int GetErrno() { return copying_input_.GetErrno(); }
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+ private:
+  class LIBPROTOBUF_EXPORT CopyingFileInputStream : public CopyingInputStream {
+   public:
+    CopyingFileInputStream(int file_descriptor);
+    ~CopyingFileInputStream();
+
+    bool Close();
+    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }
+    int GetErrno() { return errno_; }
+
+    // implements CopyingInputStream ---------------------------------
+    int Read(void* buffer, int size);
+    int Skip(int count);
+
+   private:
+    // The file descriptor.
+    const int file_;
+    bool close_on_delete_;
+    bool is_closed_;
+
+    // The errno of the I/O error, if one has occurred.  Otherwise, zero.
+    int errno_;
+
+    // Did we try to seek once and fail?  If so, we assume this file descriptor
+    // doesn't support seeking and won't try again.
+    bool previous_seek_failed_;
+
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingFileInputStream);
+  };
+
+  CopyingFileInputStream copying_input_;
+  CopyingInputStreamAdaptor impl_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileInputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyOutputStream which writes to a file descriptor.
+//
+// FileOutputStream is preferred over using an ofstream with
+// OstreamOutputStream.  The latter will introduce an extra layer of buffering,
+// harming performance.  Also, it's conceivable that FileOutputStream could
+// someday be enhanced to use zero-copy file descriptors on OSs which
+// support them.
+class LIBPROTOBUF_EXPORT FileOutputStream : public ZeroCopyOutputStream {
+ public:
+  // Creates a stream that writes to the given Unix file descriptor.
+  // If a block_size is given, it specifies the size of the buffers
+  // that should be returned by Next().  Otherwise, a reasonable default
+  // is used.
+  explicit FileOutputStream(int file_descriptor, int block_size = -1);
+  ~FileOutputStream();
+
+  // Flushes any buffers and closes the underlying file.  Returns false if
+  // an error occurs during the process; use GetErrno() to examine the error.
+  // Even if an error occurs, the file descriptor is closed when this returns.
+  bool Close();
+
+  // Flushes FileOutputStream's buffers but does not close the
+  // underlying file. No special measures are taken to ensure that
+  // underlying operating system file object is synchronized to disk.
+  bool Flush();
+
+  // By default, the file descriptor is not closed when the stream is
+  // destroyed.  Call SetCloseOnDelete(true) to change that.  WARNING:
+  // This leaves no way for the caller to detect if close() fails.  If
+  // detecting close() errors is important to you, you should arrange
+  // to close the descriptor yourself.
+  void SetCloseOnDelete(bool value) { copying_output_.SetCloseOnDelete(value); }
+
+  // If an I/O error has occurred on this file descriptor, this is the
+  // errno from that error.  Otherwise, this is zero.  Once an error
+  // occurs, the stream is broken and all subsequent operations will
+  // fail.
+  int GetErrno() { return copying_output_.GetErrno(); }
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  class LIBPROTOBUF_EXPORT CopyingFileOutputStream : public CopyingOutputStream {
+   public:
+    CopyingFileOutputStream(int file_descriptor);
+    ~CopyingFileOutputStream();
+
+    bool Close();
+    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }
+    int GetErrno() { return errno_; }
+
+    // implements CopyingOutputStream --------------------------------
+    bool Write(const void* buffer, int size);
+
+   private:
+    // The file descriptor.
+    const int file_;
+    bool close_on_delete_;
+    bool is_closed_;
+
+    // The errno of the I/O error, if one has occurred.  Otherwise, zero.
+    int errno_;
+
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingFileOutputStream);
+  };
+
+  CopyingFileOutputStream copying_output_;
+  CopyingOutputStreamAdaptor impl_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileOutputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyInputStream which reads from a C++ istream.
+//
+// Note that for reading files (or anything represented by a file descriptor),
+// FileInputStream is more efficient.
+class LIBPROTOBUF_EXPORT IstreamInputStream : public ZeroCopyInputStream {
+ public:
+  // Creates a stream that reads from the given C++ istream.
+  // If a block_size is given, it specifies the number of bytes that
+  // should be read and returned with each call to Next().  Otherwise,
+  // a reasonable default is used.
+  explicit IstreamInputStream(istream* stream, int block_size = -1);
+  ~IstreamInputStream();
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+ private:
+  class LIBPROTOBUF_EXPORT CopyingIstreamInputStream : public CopyingInputStream {
+   public:
+    CopyingIstreamInputStream(istream* input);
+    ~CopyingIstreamInputStream();
+
+    // implements CopyingInputStream ---------------------------------
+    int Read(void* buffer, int size);
+    // (We use the default implementation of Skip().)
+
+   private:
+    // The stream.
+    istream* input_;
+
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingIstreamInputStream);
+  };
+
+  CopyingIstreamInputStream copying_input_;
+  CopyingInputStreamAdaptor impl_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(IstreamInputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyOutputStream which writes to a C++ ostream.
+//
+// Note that for writing files (or anything represented by a file descriptor),
+// FileOutputStream is more efficient.
+class LIBPROTOBUF_EXPORT OstreamOutputStream : public ZeroCopyOutputStream {
+ public:
+  // Creates a stream that writes to the given C++ ostream.
+  // If a block_size is given, it specifies the size of the buffers
+  // that should be returned by Next().  Otherwise, a reasonable default
+  // is used.
+  explicit OstreamOutputStream(ostream* stream, int block_size = -1);
+  ~OstreamOutputStream();
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  class LIBPROTOBUF_EXPORT CopyingOstreamOutputStream : public CopyingOutputStream {
+   public:
+    CopyingOstreamOutputStream(ostream* output);
+    ~CopyingOstreamOutputStream();
+
+    // implements CopyingOutputStream --------------------------------
+    bool Write(const void* buffer, int size);
+
+   private:
+    // The stream.
+    ostream* output_;
+
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingOstreamOutputStream);
+  };
+
+  CopyingOstreamOutputStream copying_output_;
+  CopyingOutputStreamAdaptor impl_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(OstreamOutputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyInputStream which reads from several other streams in sequence.
+// ConcatenatingInputStream is unable to distinguish between end-of-stream
+// and read errors in the underlying streams, so it assumes any errors mean
+// end-of-stream.  So, if the underlying streams fail for any other reason,
+// ConcatenatingInputStream may do odd things.  It is suggested that you do
+// not use ConcatenatingInputStream on streams that might produce read errors
+// other than end-of-stream.
+class LIBPROTOBUF_EXPORT ConcatenatingInputStream : public ZeroCopyInputStream {
+ public:
+  // All streams passed in as well as the array itself must remain valid
+  // until the ConcatenatingInputStream is destroyed.
+  ConcatenatingInputStream(ZeroCopyInputStream* const streams[], int count);
+  ~ConcatenatingInputStream();
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+
+ private:
+  // As streams are retired, streams_ is incremented and count_ is
+  // decremented.
+  ZeroCopyInputStream* const* streams_;
+  int stream_count_;
+  int64 bytes_retired_;  // Bytes read from previous streams.
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ConcatenatingInputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyInputStream which wraps some other stream and limits it to
+// a particular byte count.
+class LIBPROTOBUF_EXPORT LimitingInputStream : public ZeroCopyInputStream {
+ public:
+  LimitingInputStream(ZeroCopyInputStream* input, int64 limit);
+  ~LimitingInputStream();
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+
+ private:
+  ZeroCopyInputStream* input_;
+  int64 limit_;  // Decreases as we go, becomes negative if we overshoot.
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(LimitingInputStream);
+};
+
+// ===================================================================
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
new file mode 100644
index 00000000..153f543e
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
@@ -0,0 +1,340 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This file contains common implementations of the interfaces defined in
+// zero_copy_stream.h which are included in the "lite" protobuf library.
+// These implementations cover I/O on raw arrays and strings, as well as
+// adaptors which make it easy to implement streams based on traditional
+// streams.  Of course, many users will probably want to write their own
+// implementations of these interfaces specific to the particular I/O
+// abstractions they prefer to use, but these should cover the most common
+// cases.
+
+#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
+#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
+
+#include <string>
+#include <iosfwd>
+#include <google/protobuf/io/zero_copy_stream.h>
+#include <google/protobuf/stubs/common.h>
+
+
+namespace google {
+namespace protobuf {
+namespace io {
+
+// ===================================================================
+
+// A ZeroCopyInputStream backed by an in-memory array of bytes.
+class LIBPROTOBUF_EXPORT ArrayInputStream : public ZeroCopyInputStream {
+ public:
+  // Create an InputStream that returns the bytes pointed to by "data".
+  // "data" remains the property of the caller but must remain valid until
+  // the stream is destroyed.  If a block_size is given, calls to Next()
+  // will return data blocks no larger than the given size.  Otherwise, the
+  // first call to Next() returns the entire array.  block_size is mainly
+  // useful for testing; in production you would probably never want to set
+  // it.
+  ArrayInputStream(const void* data, int size, int block_size = -1);
+  ~ArrayInputStream();
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+
+ private:
+  const uint8* const data_;  // The byte array.
+  const int size_;           // Total size of the array.
+  const int block_size_;     // How many bytes to return at a time.
+
+  int position_;
+  int last_returned_size_;   // How many bytes we returned last time Next()
+                             // was called (used for error checking only).
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ArrayInputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyOutputStream backed by an in-memory array of bytes.
+class LIBPROTOBUF_EXPORT ArrayOutputStream : public ZeroCopyOutputStream {
+ public:
+  // Create an OutputStream that writes to the bytes pointed to by "data".
+  // "data" remains the property of the caller but must remain valid until
+  // the stream is destroyed.  If a block_size is given, calls to Next()
+  // will return data blocks no larger than the given size.  Otherwise, the
+  // first call to Next() returns the entire array.  block_size is mainly
+  // useful for testing; in production you would probably never want to set
+  // it.
+  ArrayOutputStream(void* data, int size, int block_size = -1);
+  ~ArrayOutputStream();
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  uint8* const data_;        // The byte array.
+  const int size_;           // Total size of the array.
+  const int block_size_;     // How many bytes to return at a time.
+
+  int position_;
+  int last_returned_size_;   // How many bytes we returned last time Next()
+                             // was called (used for error checking only).
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ArrayOutputStream);
+};
+
+// ===================================================================
+
+// A ZeroCopyOutputStream which appends bytes to a string.
+class LIBPROTOBUF_EXPORT StringOutputStream : public ZeroCopyOutputStream {
+ public:
+  // Create a StringOutputStream which appends bytes to the given string.
+  // The string remains property of the caller, but it MUST NOT be accessed
+  // in any way until the stream is destroyed.
+  //
+  // Hint:  If you call target->reserve(n) before creating the stream,
+  //   the first call to Next() will return at least n bytes of buffer
+  //   space.
+  explicit StringOutputStream(string* target);
+  ~StringOutputStream();
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  static const int kMinimumSize = 16;
+
+  string* target_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(StringOutputStream);
+};
+
+// Note:  There is no StringInputStream.  Instead, just create an
+// ArrayInputStream as follows:
+//   ArrayInputStream input(str.data(), str.size());
+
+// ===================================================================
+
+// A generic traditional input stream interface.
+//
+// Lots of traditional input streams (e.g. file descriptors, C stdio
+// streams, and C++ iostreams) expose an interface where every read
+// involves copying bytes into a buffer.  If you want to take such an
+// interface and make a ZeroCopyInputStream based on it, simply implement
+// CopyingInputStream and then use CopyingInputStreamAdaptor.
+//
+// CopyingInputStream implementations should avoid buffering if possible.
+// CopyingInputStreamAdaptor does its own buffering and will read data
+// in large blocks.
+class LIBPROTOBUF_EXPORT CopyingInputStream {
+ public:
+  virtual ~CopyingInputStream();
+
+  // Reads up to "size" bytes into the given buffer.  Returns the number of
+  // bytes read.  Read() waits until at least one byte is available, or
+  // returns zero if no bytes will ever become available (EOF), or -1 if a
+  // permanent read error occurred.
+  virtual int Read(void* buffer, int size) = 0;
+
+  // Skips the next "count" bytes of input.  Returns the number of bytes
+  // actually skipped.  This will always be exactly equal to "count" unless
+  // EOF was reached or a permanent read error occurred.
+  //
+  // The default implementation just repeatedly calls Read() into a scratch
+  // buffer.
+  virtual int Skip(int count);
+};
+
+// A ZeroCopyInputStream which reads from a CopyingInputStream.  This is
+// useful for implementing ZeroCopyInputStreams that read from traditional
+// streams.  Note that this class is not really zero-copy.
+//
+// If you want to read from file descriptors or C++ istreams, this is
+// already implemented for you:  use FileInputStream or IstreamInputStream
+// respectively.
+class LIBPROTOBUF_EXPORT CopyingInputStreamAdaptor : public ZeroCopyInputStream {
+ public:
+  // Creates a stream that reads from the given CopyingInputStream.
+  // If a block_size is given, it specifies the number of bytes that
+  // should be read and returned with each call to Next().  Otherwise,
+  // a reasonable default is used.  The caller retains ownership of
+  // copying_stream unless SetOwnsCopyingStream(true) is called.
+  explicit CopyingInputStreamAdaptor(CopyingInputStream* copying_stream,
+                                     int block_size = -1);
+  ~CopyingInputStreamAdaptor();
+
+  // Call SetOwnsCopyingStream(true) to tell the CopyingInputStreamAdaptor to
+  // delete the underlying CopyingInputStream when it is destroyed.
+  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }
+
+  // implements ZeroCopyInputStream ----------------------------------
+  bool Next(const void** data, int* size);
+  void BackUp(int count);
+  bool Skip(int count);
+  int64 ByteCount() const;
+
+ private:
+  // Insures that buffer_ is not NULL.
+  void AllocateBufferIfNeeded();
+  // Frees the buffer and resets buffer_used_.
+  void FreeBuffer();
+
+  // The underlying copying stream.
+  CopyingInputStream* copying_stream_;
+  bool owns_copying_stream_;
+
+  // True if we have seen a permenant error from the underlying stream.
+  bool failed_;
+
+  // The current position of copying_stream_, relative to the point where
+  // we started reading.
+  int64 position_;
+
+  // Data is read into this buffer.  It may be NULL if no buffer is currently
+  // in use.  Otherwise, it points to an array of size buffer_size_.
+  scoped_array<uint8> buffer_;
+  const int buffer_size_;
+
+  // Number of valid bytes currently in the buffer (i.e. the size last
+  // returned by Next()).  0 <= buffer_used_ <= buffer_size_.
+  int buffer_used_;
+
+  // Number of bytes in the buffer which were backed up over by a call to
+  // BackUp().  These need to be returned again.
+  // 0 <= backup_bytes_ <= buffer_used_
+  int backup_bytes_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingInputStreamAdaptor);
+};
+
+// ===================================================================
+
+// A generic traditional output stream interface.
+//
+// Lots of traditional output streams (e.g. file descriptors, C stdio
+// streams, and C++ iostreams) expose an interface where every write
+// involves copying bytes from a buffer.  If you want to take such an
+// interface and make a ZeroCopyOutputStream based on it, simply implement
+// CopyingOutputStream and then use CopyingOutputStreamAdaptor.
+//
+// CopyingOutputStream implementations should avoid buffering if possible.
+// CopyingOutputStreamAdaptor does its own buffering and will write data
+// in large blocks.
+class LIBPROTOBUF_EXPORT CopyingOutputStream {
+ public:
+  virtual ~CopyingOutputStream();
+
+  // Writes "size" bytes from the given buffer to the output.  Returns true
+  // if successful, false on a write error.
+  virtual bool Write(const void* buffer, int size) = 0;
+};
+
+// A ZeroCopyOutputStream which writes to a CopyingOutputStream.  This is
+// useful for implementing ZeroCopyOutputStreams that write to traditional
+// streams.  Note that this class is not really zero-copy.
+//
+// If you want to write to file descriptors or C++ ostreams, this is
+// already implemented for you:  use FileOutputStream or OstreamOutputStream
+// respectively.
+class LIBPROTOBUF_EXPORT CopyingOutputStreamAdaptor : public ZeroCopyOutputStream {
+ public:
+  // Creates a stream that writes to the given Unix file descriptor.
+  // If a block_size is given, it specifies the size of the buffers
+  // that should be returned by Next().  Otherwise, a reasonable default
+  // is used.
+  explicit CopyingOutputStreamAdaptor(CopyingOutputStream* copying_stream,
+                                      int block_size = -1);
+  ~CopyingOutputStreamAdaptor();
+
+  // Writes all pending data to the underlying stream.  Returns false if a
+  // write error occurred on the underlying stream.  (The underlying
+  // stream itself is not necessarily flushed.)
+  bool Flush();
+
+  // Call SetOwnsCopyingStream(true) to tell the CopyingOutputStreamAdaptor to
+  // delete the underlying CopyingOutputStream when it is destroyed.
+  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }
+
+  // implements ZeroCopyOutputStream ---------------------------------
+  bool Next(void** data, int* size);
+  void BackUp(int count);
+  int64 ByteCount() const;
+
+ private:
+  // Write the current buffer, if it is present.
+  bool WriteBuffer();
+  // Insures that buffer_ is not NULL.
+  void AllocateBufferIfNeeded();
+  // Frees the buffer.
+  void FreeBuffer();
+
+  // The underlying copying stream.
+  CopyingOutputStream* copying_stream_;
+  bool owns_copying_stream_;
+
+  // True if we have seen a permenant error from the underlying stream.
+  bool failed_;
+
+  // The current position of copying_stream_, relative to the point where
+  // we started writing.
+  int64 position_;
+
+  // Data is written from this buffer.  It may be NULL if no buffer is
+  // currently in use.  Otherwise, it points to an array of size buffer_size_.
+  scoped_array<uint8> buffer_;
+  const int buffer_size_;
+
+  // Number of valid bytes currently in the buffer (i.e. the size last
+  // returned by Next()).  When BackUp() is called, we just reduce this.
+  // 0 <= buffer_used_ <= buffer_size_.
+  int buffer_used_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingOutputStreamAdaptor);
+};
+
+// ===================================================================
+
+}  // namespace io
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/message.h b/ps-lite/deps/include/google/protobuf/message.h
new file mode 100644
index 00000000..0f90bc1a
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/message.h
@@ -0,0 +1,837 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Defines Message, the abstract interface implemented by non-lite
+// protocol message objects.  Although it's possible to implement this
+// interface manually, most users will use the protocol compiler to
+// generate implementations.
+//
+// Example usage:
+//
+// Say you have a message defined as:
+//
+//   message Foo {
+//     optional string text = 1;
+//     repeated int32 numbers = 2;
+//   }
+//
+// Then, if you used the protocol compiler to generate a class from the above
+// definition, you could use it like so:
+//
+//   string data;  // Will store a serialized version of the message.
+//
+//   {
+//     // Create a message and serialize it.
+//     Foo foo;
+//     foo.set_text("Hello World!");
+//     foo.add_numbers(1);
+//     foo.add_numbers(5);
+//     foo.add_numbers(42);
+//
+//     foo.SerializeToString(&data);
+//   }
+//
+//   {
+//     // Parse the serialized message and check that it contains the
+//     // correct data.
+//     Foo foo;
+//     foo.ParseFromString(data);
+//
+//     assert(foo.text() == "Hello World!");
+//     assert(foo.numbers_size() == 3);
+//     assert(foo.numbers(0) == 1);
+//     assert(foo.numbers(1) == 5);
+//     assert(foo.numbers(2) == 42);
+//   }
+//
+//   {
+//     // Same as the last block, but do it dynamically via the Message
+//     // reflection interface.
+//     Message* foo = new Foo;
+//     const Descriptor* descriptor = foo->GetDescriptor();
+//
+//     // Get the descriptors for the fields we're interested in and verify
+//     // their types.
+//     const FieldDescriptor* text_field = descriptor->FindFieldByName("text");
+//     assert(text_field != NULL);
+//     assert(text_field->type() == FieldDescriptor::TYPE_STRING);
+//     assert(text_field->label() == FieldDescriptor::LABEL_OPTIONAL);
+//     const FieldDescriptor* numbers_field = descriptor->
+//                                            FindFieldByName("numbers");
+//     assert(numbers_field != NULL);
+//     assert(numbers_field->type() == FieldDescriptor::TYPE_INT32);
+//     assert(numbers_field->label() == FieldDescriptor::LABEL_REPEATED);
+//
+//     // Parse the message.
+//     foo->ParseFromString(data);
+//
+//     // Use the reflection interface to examine the contents.
+//     const Reflection* reflection = foo->GetReflection();
+//     assert(reflection->GetString(foo, text_field) == "Hello World!");
+//     assert(reflection->FieldSize(foo, numbers_field) == 3);
+//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 0) == 1);
+//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 1) == 5);
+//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 2) == 42);
+//
+//     delete foo;
+//   }
+
+#ifndef GOOGLE_PROTOBUF_MESSAGE_H__
+#define GOOGLE_PROTOBUF_MESSAGE_H__
+
+#include <vector>
+#include <string>
+
+#ifdef __DECCXX
+// HP C++'s iosfwd doesn't work.
+#include <iostream>
+#else
+#include <iosfwd>
+#endif
+
+#include <google/protobuf/message_lite.h>
+
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/descriptor.h>
+
+
+namespace google {
+namespace protobuf {
+
+// Defined in this file.
+class Message;
+class Reflection;
+class MessageFactory;
+
+// Defined in other files.
+class UnknownFieldSet;         // unknown_field_set.h
+namespace io {
+  class ZeroCopyInputStream;   // zero_copy_stream.h
+  class ZeroCopyOutputStream;  // zero_copy_stream.h
+  class CodedInputStream;      // coded_stream.h
+  class CodedOutputStream;     // coded_stream.h
+}
+
+
+template<typename T>
+class RepeatedField;     // repeated_field.h
+
+template<typename T>
+class RepeatedPtrField;  // repeated_field.h
+
+// A container to hold message metadata.
+struct Metadata {
+  const Descriptor* descriptor;
+  const Reflection* reflection;
+};
+
+// Abstract interface for protocol messages.
+//
+// See also MessageLite, which contains most every-day operations.  Message
+// adds descriptors and reflection on top of that.
+//
+// The methods of this class that are virtual but not pure-virtual have
+// default implementations based on reflection.  Message classes which are
+// optimized for speed will want to override these with faster implementations,
+// but classes optimized for code size may be happy with keeping them.  See
+// the optimize_for option in descriptor.proto.
+class LIBPROTOBUF_EXPORT Message : public MessageLite {
+ public:
+  inline Message() {}
+  virtual ~Message();
+
+  // Basic Operations ------------------------------------------------
+
+  // Construct a new instance of the same type.  Ownership is passed to the
+  // caller.  (This is also defined in MessageLite, but is defined again here
+  // for return-type covariance.)
+  virtual Message* New() const = 0;
+
+  // Make this message into a copy of the given message.  The given message
+  // must have the same descriptor, but need not necessarily be the same class.
+  // By default this is just implemented as "Clear(); MergeFrom(from);".
+  virtual void CopyFrom(const Message& from);
+
+  // Merge the fields from the given message into this message.  Singular
+  // fields will be overwritten, except for embedded messages which will
+  // be merged.  Repeated fields will be concatenated.  The given message
+  // must be of the same type as this message (i.e. the exact same class).
+  virtual void MergeFrom(const Message& from);
+
+  // Verifies that IsInitialized() returns true.  GOOGLE_CHECK-fails otherwise, with
+  // a nice error message.
+  void CheckInitialized() const;
+
+  // Slowly build a list of all required fields that are not set.
+  // This is much, much slower than IsInitialized() as it is implemented
+  // purely via reflection.  Generally, you should not call this unless you
+  // have already determined that an error exists by calling IsInitialized().
+  void FindInitializationErrors(vector<string>* errors) const;
+
+  // Like FindInitializationErrors, but joins all the strings, delimited by
+  // commas, and returns them.
+  string InitializationErrorString() const;
+
+  // Clears all unknown fields from this message and all embedded messages.
+  // Normally, if unknown tag numbers are encountered when parsing a message,
+  // the tag and value are stored in the message's UnknownFieldSet and
+  // then written back out when the message is serialized.  This allows servers
+  // which simply route messages to other servers to pass through messages
+  // that have new field definitions which they don't yet know about.  However,
+  // this behavior can have security implications.  To avoid it, call this
+  // method after parsing.
+  //
+  // See Reflection::GetUnknownFields() for more on unknown fields.
+  virtual void DiscardUnknownFields();
+
+  // Computes (an estimate of) the total number of bytes currently used for
+  // storing the message in memory.  The default implementation calls the
+  // Reflection object's SpaceUsed() method.
+  virtual int SpaceUsed() const;
+
+  // Debugging & Testing----------------------------------------------
+
+  // Generates a human readable form of this message, useful for debugging
+  // and other purposes.
+  string DebugString() const;
+  // Like DebugString(), but with less whitespace.
+  string ShortDebugString() const;
+  // Like DebugString(), but do not escape UTF-8 byte sequences.
+  string Utf8DebugString() const;
+  // Convenience function useful in GDB.  Prints DebugString() to stdout.
+  void PrintDebugString() const;
+
+  // Heavy I/O -------------------------------------------------------
+  // Additional parsing and serialization methods not implemented by
+  // MessageLite because they are not supported by the lite library.
+
+  // Parse a protocol buffer from a file descriptor.  If successful, the entire
+  // input will be consumed.
+  bool ParseFromFileDescriptor(int file_descriptor);
+  // Like ParseFromFileDescriptor(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromFileDescriptor(int file_descriptor);
+  // Parse a protocol buffer from a C++ istream.  If successful, the entire
+  // input will be consumed.
+  bool ParseFromIstream(istream* input);
+  // Like ParseFromIstream(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromIstream(istream* input);
+
+  // Serialize the message and write it to the given file descriptor.  All
+  // required fields must be set.
+  bool SerializeToFileDescriptor(int file_descriptor) const;
+  // Like SerializeToFileDescriptor(), but allows missing required fields.
+  bool SerializePartialToFileDescriptor(int file_descriptor) const;
+  // Serialize the message and write it to the given C++ ostream.  All
+  // required fields must be set.
+  bool SerializeToOstream(ostream* output) const;
+  // Like SerializeToOstream(), but allows missing required fields.
+  bool SerializePartialToOstream(ostream* output) const;
+
+
+  // Reflection-based methods ----------------------------------------
+  // These methods are pure-virtual in MessageLite, but Message provides
+  // reflection-based default implementations.
+
+  virtual string GetTypeName() const;
+  virtual void Clear();
+  virtual bool IsInitialized() const;
+  virtual void CheckTypeAndMergeFrom(const MessageLite& other);
+  virtual bool MergePartialFromCodedStream(io::CodedInputStream* input);
+  virtual int ByteSize() const;
+  virtual void SerializeWithCachedSizes(io::CodedOutputStream* output) const;
+
+ private:
+  // This is called only by the default implementation of ByteSize(), to
+  // update the cached size.  If you override ByteSize(), you do not need
+  // to override this.  If you do not override ByteSize(), you MUST override
+  // this; the default implementation will crash.
+  //
+  // The method is private because subclasses should never call it; only
+  // override it.  Yes, C++ lets you do that.  Crazy, huh?
+  virtual void SetCachedSize(int size) const;
+
+ public:
+
+  // Introspection ---------------------------------------------------
+
+  // Typedef for backwards-compatibility.
+  typedef google::protobuf::Reflection Reflection;
+
+  // Get a Descriptor for this message's type.  This describes what
+  // fields the message contains, the types of those fields, etc.
+  const Descriptor* GetDescriptor() const { return GetMetadata().descriptor; }
+
+  // Get the Reflection interface for this Message, which can be used to
+  // read and modify the fields of the Message dynamically (in other words,
+  // without knowing the message type at compile time).  This object remains
+  // property of the Message.
+  //
+  // This method remains virtual in case a subclass does not implement
+  // reflection and wants to override the default behavior.
+  virtual const Reflection* GetReflection() const {
+    return GetMetadata().reflection;
+  }
+
+ protected:
+  // Get a struct containing the metadata for the Message. Most subclasses only
+  // need to implement this method, rather than the GetDescriptor() and
+  // GetReflection() wrappers.
+  virtual Metadata GetMetadata() const  = 0;
+
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Message);
+};
+
+// This interface contains methods that can be used to dynamically access
+// and modify the fields of a protocol message.  Their semantics are
+// similar to the accessors the protocol compiler generates.
+//
+// To get the Reflection for a given Message, call Message::GetReflection().
+//
+// This interface is separate from Message only for efficiency reasons;
+// the vast majority of implementations of Message will share the same
+// implementation of Reflection (GeneratedMessageReflection,
+// defined in generated_message.h), and all Messages of a particular class
+// should share the same Reflection object (though you should not rely on
+// the latter fact).
+//
+// There are several ways that these methods can be used incorrectly.  For
+// example, any of the following conditions will lead to undefined
+// results (probably assertion failures):
+// - The FieldDescriptor is not a field of this message type.
+// - The method called is not appropriate for the field's type.  For
+//   each field type in FieldDescriptor::TYPE_*, there is only one
+//   Get*() method, one Set*() method, and one Add*() method that is
+//   valid for that type.  It should be obvious which (except maybe
+//   for TYPE_BYTES, which are represented using strings in C++).
+// - A Get*() or Set*() method for singular fields is called on a repeated
+//   field.
+// - GetRepeated*(), SetRepeated*(), or Add*() is called on a non-repeated
+//   field.
+// - The Message object passed to any method is not of the right type for
+//   this Reflection object (i.e. message.GetReflection() != reflection).
+//
+// You might wonder why there is not any abstract representation for a field
+// of arbitrary type.  E.g., why isn't there just a "GetField()" method that
+// returns "const Field&", where "Field" is some class with accessors like
+// "GetInt32Value()".  The problem is that someone would have to deal with
+// allocating these Field objects.  For generated message classes, having to
+// allocate space for an additional object to wrap every field would at least
+// double the message's memory footprint, probably worse.  Allocating the
+// objects on-demand, on the other hand, would be expensive and prone to
+// memory leaks.  So, instead we ended up with this flat interface.
+//
+// TODO(kenton):  Create a utility class which callers can use to read and
+//   write fields from a Reflection without paying attention to the type.
+class LIBPROTOBUF_EXPORT Reflection {
+ public:
+  inline Reflection() {}
+  virtual ~Reflection();
+
+  // Get the UnknownFieldSet for the message.  This contains fields which
+  // were seen when the Message was parsed but were not recognized according
+  // to the Message's definition.
+  virtual const UnknownFieldSet& GetUnknownFields(
+      const Message& message) const = 0;
+  // Get a mutable pointer to the UnknownFieldSet for the message.  This
+  // contains fields which were seen when the Message was parsed but were not
+  // recognized according to the Message's definition.
+  virtual UnknownFieldSet* MutableUnknownFields(Message* message) const = 0;
+
+  // Estimate the amount of memory used by the message object.
+  virtual int SpaceUsed(const Message& message) const = 0;
+
+  // Check if the given non-repeated field is set.
+  virtual bool HasField(const Message& message,
+                        const FieldDescriptor* field) const = 0;
+
+  // Get the number of elements of a repeated field.
+  virtual int FieldSize(const Message& message,
+                        const FieldDescriptor* field) const = 0;
+
+  // Clear the value of a field, so that HasField() returns false or
+  // FieldSize() returns zero.
+  virtual void ClearField(Message* message,
+                          const FieldDescriptor* field) const = 0;
+
+  // Removes the last element of a repeated field.
+  // We don't provide a way to remove any element other than the last
+  // because it invites inefficient use, such as O(n^2) filtering loops
+  // that should have been O(n).  If you want to remove an element other
+  // than the last, the best way to do it is to re-arrange the elements
+  // (using Swap()) so that the one you want removed is at the end, then
+  // call RemoveLast().
+  virtual void RemoveLast(Message* message,
+                          const FieldDescriptor* field) const = 0;
+  // Removes the last element of a repeated message field, and returns the
+  // pointer to the caller.  Caller takes ownership of the returned pointer.
+  virtual Message* ReleaseLast(Message* message,
+                               const FieldDescriptor* field) const = 0;
+
+  // Swap the complete contents of two messages.
+  virtual void Swap(Message* message1, Message* message2) const = 0;
+
+  // Swap two elements of a repeated field.
+  virtual void SwapElements(Message* message,
+                    const FieldDescriptor* field,
+                    int index1,
+                    int index2) const = 0;
+
+  // List all fields of the message which are currently set.  This includes
+  // extensions.  Singular fields will only be listed if HasField(field) would
+  // return true and repeated fields will only be listed if FieldSize(field)
+  // would return non-zero.  Fields (both normal fields and extension fields)
+  // will be listed ordered by field number.
+  virtual void ListFields(const Message& message,
+                          vector<const FieldDescriptor*>* output) const = 0;
+
+  // Singular field getters ------------------------------------------
+  // These get the value of a non-repeated field.  They return the default
+  // value for fields that aren't set.
+
+  virtual int32  GetInt32 (const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual int64  GetInt64 (const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual uint32 GetUInt32(const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual uint64 GetUInt64(const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual float  GetFloat (const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual double GetDouble(const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual bool   GetBool  (const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual string GetString(const Message& message,
+                           const FieldDescriptor* field) const = 0;
+  virtual const EnumValueDescriptor* GetEnum(
+      const Message& message, const FieldDescriptor* field) const = 0;
+  // See MutableMessage() for the meaning of the "factory" parameter.
+  virtual const Message& GetMessage(const Message& message,
+                                    const FieldDescriptor* field,
+                                    MessageFactory* factory = NULL) const = 0;
+
+  // Get a string value without copying, if possible.
+  //
+  // GetString() necessarily returns a copy of the string.  This can be
+  // inefficient when the string is already stored in a string object in the
+  // underlying message.  GetStringReference() will return a reference to the
+  // underlying string in this case.  Otherwise, it will copy the string into
+  // *scratch and return that.
+  //
+  // Note:  It is perfectly reasonable and useful to write code like:
+  //     str = reflection->GetStringReference(field, &str);
+  //   This line would ensure that only one copy of the string is made
+  //   regardless of the field's underlying representation.  When initializing
+  //   a newly-constructed string, though, it's just as fast and more readable
+  //   to use code like:
+  //     string str = reflection->GetString(field);
+  virtual const string& GetStringReference(const Message& message,
+                                           const FieldDescriptor* field,
+                                           string* scratch) const = 0;
+
+
+  // Singular field mutators -----------------------------------------
+  // These mutate the value of a non-repeated field.
+
+  virtual void SetInt32 (Message* message,
+                         const FieldDescriptor* field, int32  value) const = 0;
+  virtual void SetInt64 (Message* message,
+                         const FieldDescriptor* field, int64  value) const = 0;
+  virtual void SetUInt32(Message* message,
+                         const FieldDescriptor* field, uint32 value) const = 0;
+  virtual void SetUInt64(Message* message,
+                         const FieldDescriptor* field, uint64 value) const = 0;
+  virtual void SetFloat (Message* message,
+                         const FieldDescriptor* field, float  value) const = 0;
+  virtual void SetDouble(Message* message,
+                         const FieldDescriptor* field, double value) const = 0;
+  virtual void SetBool  (Message* message,
+                         const FieldDescriptor* field, bool   value) const = 0;
+  virtual void SetString(Message* message,
+                         const FieldDescriptor* field,
+                         const string& value) const = 0;
+  virtual void SetEnum  (Message* message,
+                         const FieldDescriptor* field,
+                         const EnumValueDescriptor* value) const = 0;
+  // Get a mutable pointer to a field with a message type.  If a MessageFactory
+  // is provided, it will be used to construct instances of the sub-message;
+  // otherwise, the default factory is used.  If the field is an extension that
+  // does not live in the same pool as the containing message's descriptor (e.g.
+  // it lives in an overlay pool), then a MessageFactory must be provided.
+  // If you have no idea what that meant, then you probably don't need to worry
+  // about it (don't provide a MessageFactory).  WARNING:  If the
+  // FieldDescriptor is for a compiled-in extension, then
+  // factory->GetPrototype(field->message_type() MUST return an instance of the
+  // compiled-in class for this type, NOT DynamicMessage.
+  virtual Message* MutableMessage(Message* message,
+                                  const FieldDescriptor* field,
+                                  MessageFactory* factory = NULL) const = 0;
+  // Releases the message specified by 'field' and returns the pointer,
+  // ReleaseMessage() will return the message the message object if it exists.
+  // Otherwise, it may or may not return NULL.  In any case, if the return value
+  // is non-NULL, the caller takes ownership of the pointer.
+  // If the field existed (HasField() is true), then the returned pointer will
+  // be the same as the pointer returned by MutableMessage().
+  // This function has the same effect as ClearField().
+  virtual Message* ReleaseMessage(Message* message,
+                                  const FieldDescriptor* field,
+                                  MessageFactory* factory = NULL) const = 0;
+
+
+  // Repeated field getters ------------------------------------------
+  // These get the value of one element of a repeated field.
+
+  virtual int32  GetRepeatedInt32 (const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual int64  GetRepeatedInt64 (const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual uint32 GetRepeatedUInt32(const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual uint64 GetRepeatedUInt64(const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual float  GetRepeatedFloat (const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual double GetRepeatedDouble(const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual bool   GetRepeatedBool  (const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual string GetRepeatedString(const Message& message,
+                                   const FieldDescriptor* field,
+                                   int index) const = 0;
+  virtual const EnumValueDescriptor* GetRepeatedEnum(
+      const Message& message,
+      const FieldDescriptor* field, int index) const = 0;
+  virtual const Message& GetRepeatedMessage(
+      const Message& message,
+      const FieldDescriptor* field, int index) const = 0;
+
+  // See GetStringReference(), above.
+  virtual const string& GetRepeatedStringReference(
+      const Message& message, const FieldDescriptor* field,
+      int index, string* scratch) const = 0;
+
+
+  // Repeated field mutators -----------------------------------------
+  // These mutate the value of one element of a repeated field.
+
+  virtual void SetRepeatedInt32 (Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, int32  value) const = 0;
+  virtual void SetRepeatedInt64 (Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, int64  value) const = 0;
+  virtual void SetRepeatedUInt32(Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, uint32 value) const = 0;
+  virtual void SetRepeatedUInt64(Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, uint64 value) const = 0;
+  virtual void SetRepeatedFloat (Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, float  value) const = 0;
+  virtual void SetRepeatedDouble(Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, double value) const = 0;
+  virtual void SetRepeatedBool  (Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, bool   value) const = 0;
+  virtual void SetRepeatedString(Message* message,
+                                 const FieldDescriptor* field,
+                                 int index, const string& value) const = 0;
+  virtual void SetRepeatedEnum(Message* message,
+                               const FieldDescriptor* field, int index,
+                               const EnumValueDescriptor* value) const = 0;
+  // Get a mutable pointer to an element of a repeated field with a message
+  // type.
+  virtual Message* MutableRepeatedMessage(
+      Message* message, const FieldDescriptor* field, int index) const = 0;
+
+
+  // Repeated field adders -------------------------------------------
+  // These add an element to a repeated field.
+
+  virtual void AddInt32 (Message* message,
+                         const FieldDescriptor* field, int32  value) const = 0;
+  virtual void AddInt64 (Message* message,
+                         const FieldDescriptor* field, int64  value) const = 0;
+  virtual void AddUInt32(Message* message,
+                         const FieldDescriptor* field, uint32 value) const = 0;
+  virtual void AddUInt64(Message* message,
+                         const FieldDescriptor* field, uint64 value) const = 0;
+  virtual void AddFloat (Message* message,
+                         const FieldDescriptor* field, float  value) const = 0;
+  virtual void AddDouble(Message* message,
+                         const FieldDescriptor* field, double value) const = 0;
+  virtual void AddBool  (Message* message,
+                         const FieldDescriptor* field, bool   value) const = 0;
+  virtual void AddString(Message* message,
+                         const FieldDescriptor* field,
+                         const string& value) const = 0;
+  virtual void AddEnum  (Message* message,
+                         const FieldDescriptor* field,
+                         const EnumValueDescriptor* value) const = 0;
+  // See MutableMessage() for comments on the "factory" parameter.
+  virtual Message* AddMessage(Message* message,
+                              const FieldDescriptor* field,
+                              MessageFactory* factory = NULL) const = 0;
+
+
+  // Repeated field accessors  -------------------------------------------------
+  // The methods above, e.g. GetRepeatedInt32(msg, fd, index), provide singular
+  // access to the data in a RepeatedField.  The methods below provide aggregate
+  // access by exposing the RepeatedField object itself with the Message.
+  // Applying these templates to inappropriate types will lead to an undefined
+  // reference at link time (e.g. GetRepeatedField<***double>), or possibly a
+  // template matching error at compile time (e.g. GetRepeatedPtrField<File>).
+  //
+  // Usage example: my_doubs = refl->GetRepeatedField<double>(msg, fd);
+
+  // for T = Cord and all protobuf scalar types except enums.
+  template<typename T>
+  const RepeatedField<T>& GetRepeatedField(
+      const Message&, const FieldDescriptor*) const;
+
+  // for T = Cord and all protobuf scalar types except enums.
+  template<typename T>
+  RepeatedField<T>* MutableRepeatedField(
+      Message*, const FieldDescriptor*) const;
+
+  // for T = string, google::protobuf::internal::StringPieceField
+  //         google::protobuf::Message & descendants.
+  template<typename T>
+  const RepeatedPtrField<T>& GetRepeatedPtrField(
+      const Message&, const FieldDescriptor*) const;
+
+  // for T = string, google::protobuf::internal::StringPieceField
+  //         google::protobuf::Message & descendants.
+  template<typename T>
+  RepeatedPtrField<T>* MutableRepeatedPtrField(
+      Message*, const FieldDescriptor*) const;
+
+  // Extensions ----------------------------------------------------------------
+
+  // Try to find an extension of this message type by fully-qualified field
+  // name.  Returns NULL if no extension is known for this name or number.
+  virtual const FieldDescriptor* FindKnownExtensionByName(
+      const string& name) const = 0;
+
+  // Try to find an extension of this message type by field number.
+  // Returns NULL if no extension is known for this name or number.
+  virtual const FieldDescriptor* FindKnownExtensionByNumber(
+      int number) const = 0;
+
+  // ---------------------------------------------------------------------------
+
+ protected:
+  // Obtain a pointer to a Repeated Field Structure and do some type checking:
+  //   on field->cpp_type(),
+  //   on field->field_option().ctype() (if ctype >= 0)
+  //   of field->message_type() (if message_type != NULL).
+  // We use 1 routine rather than 4 (const vs mutable) x (scalar vs pointer).
+  virtual void* MutableRawRepeatedField(
+      Message* message, const FieldDescriptor* field, FieldDescriptor::CppType,
+      int ctype, const Descriptor* message_type) const = 0;
+
+ private:
+  // Special version for specialized implementations of string.  We can't call
+  // MutableRawRepeatedField directly here because we don't have access to
+  // FieldOptions::* which are defined in descriptor.pb.h.  Including that
+  // file here is not possible because it would cause a circular include cycle.
+  void* MutableRawRepeatedString(
+      Message* message, const FieldDescriptor* field, bool is_string) const;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Reflection);
+};
+
+// Abstract interface for a factory for message objects.
+class LIBPROTOBUF_EXPORT MessageFactory {
+ public:
+  inline MessageFactory() {}
+  virtual ~MessageFactory();
+
+  // Given a Descriptor, gets or constructs the default (prototype) Message
+  // of that type.  You can then call that message's New() method to construct
+  // a mutable message of that type.
+  //
+  // Calling this method twice with the same Descriptor returns the same
+  // object.  The returned object remains property of the factory.  Also, any
+  // objects created by calling the prototype's New() method share some data
+  // with the prototype, so these must be destoyed before the MessageFactory
+  // is destroyed.
+  //
+  // The given descriptor must outlive the returned message, and hence must
+  // outlive the MessageFactory.
+  //
+  // Some implementations do not support all types.  GetPrototype() will
+  // return NULL if the descriptor passed in is not supported.
+  //
+  // This method may or may not be thread-safe depending on the implementation.
+  // Each implementation should document its own degree thread-safety.
+  virtual const Message* GetPrototype(const Descriptor* type) = 0;
+
+  // Gets a MessageFactory which supports all generated, compiled-in messages.
+  // In other words, for any compiled-in type FooMessage, the following is true:
+  //   MessageFactory::generated_factory()->GetPrototype(
+  //     FooMessage::descriptor()) == FooMessage::default_instance()
+  // This factory supports all types which are found in
+  // DescriptorPool::generated_pool().  If given a descriptor from any other
+  // pool, GetPrototype() will return NULL.  (You can also check if a
+  // descriptor is for a generated message by checking if
+  // descriptor->file()->pool() == DescriptorPool::generated_pool().)
+  //
+  // This factory is 100% thread-safe; calling GetPrototype() does not modify
+  // any shared data.
+  //
+  // This factory is a singleton.  The caller must not delete the object.
+  static MessageFactory* generated_factory();
+
+  // For internal use only:  Registers a .proto file at static initialization
+  // time, to be placed in generated_factory.  The first time GetPrototype()
+  // is called with a descriptor from this file, |register_messages| will be
+  // called, with the file name as the parameter.  It must call
+  // InternalRegisterGeneratedMessage() (below) to register each message type
+  // in the file.  This strange mechanism is necessary because descriptors are
+  // built lazily, so we can't register types by their descriptor until we
+  // know that the descriptor exists.  |filename| must be a permanent string.
+  static void InternalRegisterGeneratedFile(
+      const char* filename, void (*register_messages)(const string&));
+
+  // For internal use only:  Registers a message type.  Called only by the
+  // functions which are registered with InternalRegisterGeneratedFile(),
+  // above.
+  static void InternalRegisterGeneratedMessage(const Descriptor* descriptor,
+                                               const Message* prototype);
+
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MessageFactory);
+};
+
+#define DECLARE_GET_REPEATED_FIELD(TYPE)                         \
+template<>                                                       \
+LIBPROTOBUF_EXPORT                                               \
+const RepeatedField<TYPE>& Reflection::GetRepeatedField<TYPE>(   \
+    const Message& message, const FieldDescriptor* field) const; \
+                                                                 \
+template<>                                                       \
+LIBPROTOBUF_EXPORT                                               \
+RepeatedField<TYPE>* Reflection::MutableRepeatedField<TYPE>(     \
+    Message* message, const FieldDescriptor* field) const;
+
+DECLARE_GET_REPEATED_FIELD(int32)
+DECLARE_GET_REPEATED_FIELD(int64)
+DECLARE_GET_REPEATED_FIELD(uint32)
+DECLARE_GET_REPEATED_FIELD(uint64)
+DECLARE_GET_REPEATED_FIELD(float)
+DECLARE_GET_REPEATED_FIELD(double)
+DECLARE_GET_REPEATED_FIELD(bool)
+
+#undef DECLARE_GET_REPEATED_FIELD
+
+// =============================================================================
+// Implementation details for {Get,Mutable}RawRepeatedPtrField.  We provide
+// specializations for <string>, <StringPieceField> and <Message> and handle
+// everything else with the default template which will match any type having
+// a method with signature "static const google::protobuf::Descriptor* descriptor()".
+// Such a type presumably is a descendant of google::protobuf::Message.
+
+template<>
+inline const RepeatedPtrField<string>& Reflection::GetRepeatedPtrField<string>(
+    const Message& message, const FieldDescriptor* field) const {
+  return *static_cast<RepeatedPtrField<string>* >(
+      MutableRawRepeatedString(const_cast<Message*>(&message), field, true));
+}
+
+template<>
+inline RepeatedPtrField<string>* Reflection::MutableRepeatedPtrField<string>(
+    Message* message, const FieldDescriptor* field) const {
+  return static_cast<RepeatedPtrField<string>* >(
+      MutableRawRepeatedString(message, field, true));
+}
+
+
+// -----
+
+template<>
+inline const RepeatedPtrField<Message>& Reflection::GetRepeatedPtrField(
+    const Message& message, const FieldDescriptor* field) const {
+  return *static_cast<RepeatedPtrField<Message>* >(
+      MutableRawRepeatedField(const_cast<Message*>(&message), field,
+          FieldDescriptor::CPPTYPE_MESSAGE, -1,
+          NULL));
+}
+
+template<>
+inline RepeatedPtrField<Message>* Reflection::MutableRepeatedPtrField(
+    Message* message, const FieldDescriptor* field) const {
+  return static_cast<RepeatedPtrField<Message>* >(
+      MutableRawRepeatedField(message, field,
+          FieldDescriptor::CPPTYPE_MESSAGE, -1,
+          NULL));
+}
+
+template<typename PB>
+inline const RepeatedPtrField<PB>& Reflection::GetRepeatedPtrField(
+    const Message& message, const FieldDescriptor* field) const {
+  return *static_cast<RepeatedPtrField<PB>* >(
+      MutableRawRepeatedField(const_cast<Message*>(&message), field,
+          FieldDescriptor::CPPTYPE_MESSAGE, -1,
+          PB::default_instance().GetDescriptor()));
+}
+
+template<typename PB>
+inline RepeatedPtrField<PB>* Reflection::MutableRepeatedPtrField(
+    Message* message, const FieldDescriptor* field) const {
+  return static_cast<RepeatedPtrField<PB>* >(
+      MutableRawRepeatedField(message, field,
+          FieldDescriptor::CPPTYPE_MESSAGE, -1,
+          PB::default_instance().GetDescriptor()));
+}
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_MESSAGE_H__
diff --git a/ps-lite/deps/include/google/protobuf/message_lite.h b/ps-lite/deps/include/google/protobuf/message_lite.h
new file mode 100644
index 00000000..1ec3068c
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/message_lite.h
@@ -0,0 +1,246 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Authors: wink@google.com (Wink Saville),
+//          kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Defines MessageLite, the abstract interface implemented by all (lite
+// and non-lite) protocol message objects.
+
+#ifndef GOOGLE_PROTOBUF_MESSAGE_LITE_H__
+#define GOOGLE_PROTOBUF_MESSAGE_LITE_H__
+
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+
+namespace io {
+  class CodedInputStream;
+  class CodedOutputStream;
+  class ZeroCopyInputStream;
+  class ZeroCopyOutputStream;
+}
+
+// Interface to light weight protocol messages.
+//
+// This interface is implemented by all protocol message objects.  Non-lite
+// messages additionally implement the Message interface, which is a
+// subclass of MessageLite.  Use MessageLite instead when you only need
+// the subset of features which it supports -- namely, nothing that uses
+// descriptors or reflection.  You can instruct the protocol compiler
+// to generate classes which implement only MessageLite, not the full
+// Message interface, by adding the following line to the .proto file:
+//
+//   option optimize_for = LITE_RUNTIME;
+//
+// This is particularly useful on resource-constrained systems where
+// the full protocol buffers runtime library is too big.
+//
+// Note that on non-constrained systems (e.g. servers) when you need
+// to link in lots of protocol definitions, a better way to reduce
+// total code footprint is to use optimize_for = CODE_SIZE.  This
+// will make the generated code smaller while still supporting all the
+// same features (at the expense of speed).  optimize_for = LITE_RUNTIME
+// is best when you only have a small number of message types linked
+// into your binary, in which case the size of the protocol buffers
+// runtime itself is the biggest problem.
+class LIBPROTOBUF_EXPORT MessageLite {
+ public:
+  inline MessageLite() {}
+  virtual ~MessageLite();
+
+  // Basic Operations ------------------------------------------------
+
+  // Get the name of this message type, e.g. "foo.bar.BazProto".
+  virtual string GetTypeName() const = 0;
+
+  // Construct a new instance of the same type.  Ownership is passed to the
+  // caller.
+  virtual MessageLite* New() const = 0;
+
+  // Clear all fields of the message and set them to their default values.
+  // Clear() avoids freeing memory, assuming that any memory allocated
+  // to hold parts of the message will be needed again to hold the next
+  // message.  If you actually want to free the memory used by a Message,
+  // you must delete it.
+  virtual void Clear() = 0;
+
+  // Quickly check if all required fields have values set.
+  virtual bool IsInitialized() const = 0;
+
+  // This is not implemented for Lite messages -- it just returns "(cannot
+  // determine missing fields for lite message)".  However, it is implemented
+  // for full messages.  See message.h.
+  virtual string InitializationErrorString() const;
+
+  // If |other| is the exact same class as this, calls MergeFrom().  Otherwise,
+  // results are undefined (probably crash).
+  virtual void CheckTypeAndMergeFrom(const MessageLite& other) = 0;
+
+  // Parsing ---------------------------------------------------------
+  // Methods for parsing in protocol buffer format.  Most of these are
+  // just simple wrappers around MergeFromCodedStream().
+
+  // Fill the message with a protocol buffer parsed from the given input
+  // stream.  Returns false on a read error or if the input is in the
+  // wrong format.
+  bool ParseFromCodedStream(io::CodedInputStream* input);
+  // Like ParseFromCodedStream(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromCodedStream(io::CodedInputStream* input);
+  // Read a protocol buffer from the given zero-copy input stream.  If
+  // successful, the entire input will be consumed.
+  bool ParseFromZeroCopyStream(io::ZeroCopyInputStream* input);
+  // Like ParseFromZeroCopyStream(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromZeroCopyStream(io::ZeroCopyInputStream* input);
+  // Read a protocol buffer from the given zero-copy input stream, expecting
+  // the message to be exactly "size" bytes long.  If successful, exactly
+  // this many bytes will have been consumed from the input.
+  bool ParseFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input, int size);
+  // Like ParseFromBoundedZeroCopyStream(), but accepts messages that are
+  // missing required fields.
+  bool ParsePartialFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input,
+                                             int size);
+  // Parse a protocol buffer contained in a string.
+  bool ParseFromString(const string& data);
+  // Like ParseFromString(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromString(const string& data);
+  // Parse a protocol buffer contained in an array of bytes.
+  bool ParseFromArray(const void* data, int size);
+  // Like ParseFromArray(), but accepts messages that are missing
+  // required fields.
+  bool ParsePartialFromArray(const void* data, int size);
+
+
+  // Reads a protocol buffer from the stream and merges it into this
+  // Message.  Singular fields read from the input overwrite what is
+  // already in the Message and repeated fields are appended to those
+  // already present.
+  //
+  // It is the responsibility of the caller to call input->LastTagWas()
+  // (for groups) or input->ConsumedEntireMessage() (for non-groups) after
+  // this returns to verify that the message's end was delimited correctly.
+  //
+  // ParsefromCodedStream() is implemented as Clear() followed by
+  // MergeFromCodedStream().
+  bool MergeFromCodedStream(io::CodedInputStream* input);
+
+  // Like MergeFromCodedStream(), but succeeds even if required fields are
+  // missing in the input.
+  //
+  // MergeFromCodedStream() is just implemented as MergePartialFromCodedStream()
+  // followed by IsInitialized().
+  virtual bool MergePartialFromCodedStream(io::CodedInputStream* input) = 0;
+
+
+  // Serialization ---------------------------------------------------
+  // Methods for serializing in protocol buffer format.  Most of these
+  // are just simple wrappers around ByteSize() and SerializeWithCachedSizes().
+
+  // Write a protocol buffer of this message to the given output.  Returns
+  // false on a write error.  If the message is missing required fields,
+  // this may GOOGLE_CHECK-fail.
+  bool SerializeToCodedStream(io::CodedOutputStream* output) const;
+  // Like SerializeToCodedStream(), but allows missing required fields.
+  bool SerializePartialToCodedStream(io::CodedOutputStream* output) const;
+  // Write the message to the given zero-copy output stream.  All required
+  // fields must be set.
+  bool SerializeToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
+  // Like SerializeToZeroCopyStream(), but allows missing required fields.
+  bool SerializePartialToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
+  // Serialize the message and store it in the given string.  All required
+  // fields must be set.
+  bool SerializeToString(string* output) const;
+  // Like SerializeToString(), but allows missing required fields.
+  bool SerializePartialToString(string* output) const;
+  // Serialize the message and store it in the given byte array.  All required
+  // fields must be set.
+  bool SerializeToArray(void* data, int size) const;
+  // Like SerializeToArray(), but allows missing required fields.
+  bool SerializePartialToArray(void* data, int size) const;
+
+  // Make a string encoding the message. Is equivalent to calling
+  // SerializeToString() on a string and using that.  Returns the empty
+  // string if SerializeToString() would have returned an error.
+  // Note: If you intend to generate many such strings, you may
+  // reduce heap fragmentation by instead re-using the same string
+  // object with calls to SerializeToString().
+  string SerializeAsString() const;
+  // Like SerializeAsString(), but allows missing required fields.
+  string SerializePartialAsString() const;
+
+  // Like SerializeToString(), but appends to the data to the string's existing
+  // contents.  All required fields must be set.
+  bool AppendToString(string* output) const;
+  // Like AppendToString(), but allows missing required fields.
+  bool AppendPartialToString(string* output) const;
+
+  // Computes the serialized size of the message.  This recursively calls
+  // ByteSize() on all embedded messages.  If a subclass does not override
+  // this, it MUST override SetCachedSize().
+  virtual int ByteSize() const = 0;
+
+  // Serializes the message without recomputing the size.  The message must
+  // not have changed since the last call to ByteSize(); if it has, the results
+  // are undefined.
+  virtual void SerializeWithCachedSizes(
+      io::CodedOutputStream* output) const = 0;
+
+  // Like SerializeWithCachedSizes, but writes directly to *target, returning
+  // a pointer to the byte immediately after the last byte written.  "target"
+  // must point at a byte array of at least ByteSize() bytes.
+  virtual uint8* SerializeWithCachedSizesToArray(uint8* target) const;
+
+  // Returns the result of the last call to ByteSize().  An embedded message's
+  // size is needed both to serialize it (because embedded messages are
+  // length-delimited) and to compute the outer message's size.  Caching
+  // the size avoids computing it multiple times.
+  //
+  // ByteSize() does not automatically use the cached size when available
+  // because this would require invalidating it every time the message was
+  // modified, which would be too hard and expensive.  (E.g. if a deeply-nested
+  // sub-message is changed, all of its parents' cached sizes would need to be
+  // invalidated, which is too much work for an otherwise inlined setter
+  // method.)
+  virtual int GetCachedSize() const = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MessageLite);
+};
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_MESSAGE_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/reflection_ops.h b/ps-lite/deps/include/google/protobuf/reflection_ops.h
new file mode 100644
index 00000000..60165c2a
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/reflection_ops.h
@@ -0,0 +1,81 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+
+#ifndef GOOGLE_PROTOBUF_REFLECTION_OPS_H__
+#define GOOGLE_PROTOBUF_REFLECTION_OPS_H__
+
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/message.h>
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// Basic operations that can be performed using reflection.
+// These can be used as a cheap way to implement the corresponding
+// methods of the Message interface, though they are likely to be
+// slower than implementations tailored for the specific message type.
+//
+// This class should stay limited to operations needed to implement
+// the Message interface.
+//
+// This class is really a namespace that contains only static methods.
+class LIBPROTOBUF_EXPORT ReflectionOps {
+ public:
+  static void Copy(const Message& from, Message* to);
+  static void Merge(const Message& from, Message* to);
+  static void Clear(Message* message);
+  static bool IsInitialized(const Message& message);
+  static void DiscardUnknownFields(Message* message);
+
+  // Finds all unset required fields in the message and adds their full
+  // paths (e.g. "foo.bar[5].baz") to *names.  "prefix" will be attached to
+  // the front of each name.
+  static void FindInitializationErrors(const Message& message,
+                                       const string& prefix,
+                                       vector<string>* errors);
+
+ private:
+  // All methods are static.  No need to construct.
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ReflectionOps);
+};
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_REFLECTION_OPS_H__
diff --git a/ps-lite/deps/include/google/protobuf/repeated_field.h b/ps-lite/deps/include/google/protobuf/repeated_field.h
new file mode 100644
index 00000000..570d4b75
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/repeated_field.h
@@ -0,0 +1,1519 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// RepeatedField and RepeatedPtrField are used by generated protocol message
+// classes to manipulate repeated fields.  These classes are very similar to
+// STL's vector, but include a number of optimizations found to be useful
+// specifically in the case of Protocol Buffers.  RepeatedPtrField is
+// particularly different from STL vector as it manages ownership of the
+// pointers that it contains.
+//
+// Typically, clients should not need to access RepeatedField objects directly,
+// but should instead use the accessor functions generated automatically by the
+// protocol compiler.
+
+#ifndef GOOGLE_PROTOBUF_REPEATED_FIELD_H__
+#define GOOGLE_PROTOBUF_REPEATED_FIELD_H__
+
+#include <algorithm>
+#include <string>
+#include <iterator>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/stubs/type_traits.h>
+#include <google/protobuf/generated_message_util.h>
+#include <google/protobuf/message_lite.h>
+
+namespace google {
+
+namespace upb {
+namespace google_opensource {
+class GMR_Handlers;
+}  // namespace google_opensource
+}  // namespace upb
+
+namespace protobuf {
+
+class Message;
+
+namespace internal {
+
+static const int kMinRepeatedFieldAllocationSize = 4;
+
+// A utility function for logging that doesn't need any template types.
+void LogIndexOutOfBounds(int index, int size);
+}  // namespace internal
+
+
+// RepeatedField is used to represent repeated fields of a primitive type (in
+// other words, everything except strings and nested Messages).  Most users will
+// not ever use a RepeatedField directly; they will use the get-by-index,
+// set-by-index, and add accessors that are generated for all repeated fields.
+template <typename Element>
+class RepeatedField {
+ public:
+  RepeatedField();
+  RepeatedField(const RepeatedField& other);
+  template <typename Iter>
+  RepeatedField(Iter begin, const Iter& end);
+  ~RepeatedField();
+
+  RepeatedField& operator=(const RepeatedField& other);
+
+  int size() const;
+
+  const Element& Get(int index) const;
+  Element* Mutable(int index);
+  void Set(int index, const Element& value);
+  void Add(const Element& value);
+  Element* Add();
+  // Remove the last element in the array.
+  void RemoveLast();
+
+  // Extract elements with indices in "[start .. start+num-1]".
+  // Copy them into "elements[0 .. num-1]" if "elements" is not NULL.
+  // Caution: implementation also moves elements with indices [start+num ..].
+  // Calling this routine inside a loop can cause quadratic behavior.
+  void ExtractSubrange(int start, int num, Element* elements);
+
+  void Clear();
+  void MergeFrom(const RepeatedField& other);
+  void CopyFrom(const RepeatedField& other);
+
+  // Reserve space to expand the field to at least the given size.  If the
+  // array is grown, it will always be at least doubled in size.
+  void Reserve(int new_size);
+
+  // Resize the RepeatedField to a new, smaller size.  This is O(1).
+  void Truncate(int new_size);
+
+  void AddAlreadyReserved(const Element& value);
+  Element* AddAlreadyReserved();
+  int Capacity() const;
+
+  // Gets the underlying array.  This pointer is possibly invalidated by
+  // any add or remove operation.
+  Element* mutable_data();
+  const Element* data() const;
+
+  // Swap entire contents with "other".
+  void Swap(RepeatedField* other);
+
+  // Swap two elements.
+  void SwapElements(int index1, int index2);
+
+  // STL-like iterator support
+  typedef Element* iterator;
+  typedef const Element* const_iterator;
+  typedef Element value_type;
+  typedef value_type& reference;
+  typedef const value_type& const_reference;
+  typedef value_type* pointer;
+  typedef const value_type* const_pointer;
+  typedef int size_type;
+  typedef ptrdiff_t difference_type;
+
+  iterator begin();
+  const_iterator begin() const;
+  iterator end();
+  const_iterator end() const;
+
+  // Reverse iterator support
+  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+  typedef std::reverse_iterator<iterator> reverse_iterator;
+  reverse_iterator rbegin() {
+    return reverse_iterator(end());
+  }
+  const_reverse_iterator rbegin() const {
+    return const_reverse_iterator(end());
+  }
+  reverse_iterator rend() {
+    return reverse_iterator(begin());
+  }
+  const_reverse_iterator rend() const {
+    return const_reverse_iterator(begin());
+  }
+
+  // Returns the number of bytes used by the repeated field, excluding
+  // sizeof(*this)
+  int SpaceUsedExcludingSelf() const;
+
+ private:
+  static const int kInitialSize = 0;
+
+  Element* elements_;
+  int      current_size_;
+  int      total_size_;
+
+  // Move the contents of |from| into |to|, possibly clobbering |from| in the
+  // process.  For primitive types this is just a memcpy(), but it could be
+  // specialized for non-primitive types to, say, swap each element instead.
+  void MoveArray(Element to[], Element from[], int size);
+
+  // Copy the elements of |from| into |to|.
+  void CopyArray(Element to[], const Element from[], int size);
+};
+
+namespace internal {
+template <typename It> class RepeatedPtrIterator;
+template <typename It, typename VoidPtr> class RepeatedPtrOverPtrsIterator;
+}  // namespace internal
+
+namespace internal {
+
+// This is a helper template to copy an array of elements effeciently when they
+// have a trivial copy constructor, and correctly otherwise. This really
+// shouldn't be necessary, but our compiler doesn't optimize std::copy very
+// effectively.
+template <typename Element,
+          bool HasTrivialCopy = has_trivial_copy<Element>::value>
+struct ElementCopier {
+  void operator()(Element to[], const Element from[], int array_size);
+};
+
+}  // namespace internal
+
+namespace internal {
+
+// This is the common base class for RepeatedPtrFields.  It deals only in void*
+// pointers.  Users should not use this interface directly.
+//
+// The methods of this interface correspond to the methods of RepeatedPtrField,
+// but may have a template argument called TypeHandler.  Its signature is:
+//   class TypeHandler {
+//    public:
+//     typedef MyType Type;
+//     static Type* New();
+//     static void Delete(Type*);
+//     static void Clear(Type*);
+//     static void Merge(const Type& from, Type* to);
+//
+//     // Only needs to be implemented if SpaceUsedExcludingSelf() is called.
+//     static int SpaceUsed(const Type&);
+//   };
+class LIBPROTOBUF_EXPORT RepeatedPtrFieldBase {
+ protected:
+  // The reflection implementation needs to call protected methods directly,
+  // reinterpreting pointers as being to Message instead of a specific Message
+  // subclass.
+  friend class GeneratedMessageReflection;
+
+  // ExtensionSet stores repeated message extensions as
+  // RepeatedPtrField<MessageLite>, but non-lite ExtensionSets need to
+  // implement SpaceUsed(), and thus need to call SpaceUsedExcludingSelf()
+  // reinterpreting MessageLite as Message.  ExtensionSet also needs to make
+  // use of AddFromCleared(), which is not part of the public interface.
+  friend class ExtensionSet;
+
+  // To parse directly into a proto2 generated class, the upb class GMR_Handlers
+  // needs to be able to modify a RepeatedPtrFieldBase directly.
+  friend class LIBPROTOBUF_EXPORT upb::google_opensource::GMR_Handlers;
+
+  RepeatedPtrFieldBase();
+
+  // Must be called from destructor.
+  template <typename TypeHandler>
+  void Destroy();
+
+  int size() const;
+
+  template <typename TypeHandler>
+  const typename TypeHandler::Type& Get(int index) const;
+  template <typename TypeHandler>
+  typename TypeHandler::Type* Mutable(int index);
+  template <typename TypeHandler>
+  typename TypeHandler::Type* Add();
+  template <typename TypeHandler>
+  void RemoveLast();
+  template <typename TypeHandler>
+  void Clear();
+  template <typename TypeHandler>
+  void MergeFrom(const RepeatedPtrFieldBase& other);
+  template <typename TypeHandler>
+  void CopyFrom(const RepeatedPtrFieldBase& other);
+
+  void CloseGap(int start, int num) {
+    // Close up a gap of "num" elements starting at offset "start".
+    for (int i = start + num; i < allocated_size_; ++i)
+      elements_[i - num] = elements_[i];
+    current_size_ -= num;
+    allocated_size_ -= num;
+  }
+
+  void Reserve(int new_size);
+
+  int Capacity() const;
+
+  // Used for constructing iterators.
+  void* const* raw_data() const;
+  void** raw_mutable_data() const;
+
+  template <typename TypeHandler>
+  typename TypeHandler::Type** mutable_data();
+  template <typename TypeHandler>
+  const typename TypeHandler::Type* const* data() const;
+
+  void Swap(RepeatedPtrFieldBase* other);
+
+  void SwapElements(int index1, int index2);
+
+  template <typename TypeHandler>
+  int SpaceUsedExcludingSelf() const;
+
+
+  // Advanced memory management --------------------------------------
+
+  // Like Add(), but if there are no cleared objects to use, returns NULL.
+  template <typename TypeHandler>
+  typename TypeHandler::Type* AddFromCleared();
+
+  template <typename TypeHandler>
+  void AddAllocated(typename TypeHandler::Type* value);
+  template <typename TypeHandler>
+  typename TypeHandler::Type* ReleaseLast();
+
+  int ClearedCount() const;
+  template <typename TypeHandler>
+  void AddCleared(typename TypeHandler::Type* value);
+  template <typename TypeHandler>
+  typename TypeHandler::Type* ReleaseCleared();
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RepeatedPtrFieldBase);
+
+  static const int kInitialSize = 0;
+
+  void** elements_;
+  int    current_size_;
+  int    allocated_size_;
+  int    total_size_;
+
+  template <typename TypeHandler>
+  static inline typename TypeHandler::Type* cast(void* element) {
+    return reinterpret_cast<typename TypeHandler::Type*>(element);
+  }
+  template <typename TypeHandler>
+  static inline const typename TypeHandler::Type* cast(const void* element) {
+    return reinterpret_cast<const typename TypeHandler::Type*>(element);
+  }
+};
+
+template <typename GenericType>
+class GenericTypeHandler {
+ public:
+  typedef GenericType Type;
+  static GenericType* New() { return new GenericType; }
+  static void Delete(GenericType* value) { delete value; }
+  static void Clear(GenericType* value) { value->Clear(); }
+  static void Merge(const GenericType& from, GenericType* to) {
+    to->MergeFrom(from);
+  }
+  static int SpaceUsed(const GenericType& value) { return value.SpaceUsed(); }
+  static const Type& default_instance() { return Type::default_instance(); }
+};
+
+template <>
+inline void GenericTypeHandler<MessageLite>::Merge(
+    const MessageLite& from, MessageLite* to) {
+  to->CheckTypeAndMergeFrom(from);
+}
+
+template <>
+inline const MessageLite& GenericTypeHandler<MessageLite>::default_instance() {
+  // Yes, the behavior of the code is undefined, but this function is only
+  // called when we're already deep into the world of undefined, because the
+  // caller called Get(index) out of bounds.
+  MessageLite* null = NULL;
+  return *null;
+}
+
+template <>
+inline const Message& GenericTypeHandler<Message>::default_instance() {
+  // Yes, the behavior of the code is undefined, but this function is only
+  // called when we're already deep into the world of undefined, because the
+  // caller called Get(index) out of bounds.
+  Message* null = NULL;
+  return *null;
+}
+
+
+// HACK:  If a class is declared as DLL-exported in MSVC, it insists on
+//   generating copies of all its methods -- even inline ones -- to include
+//   in the DLL.  But SpaceUsed() calls StringSpaceUsedExcludingSelf() which
+//   isn't in the lite library, therefore the lite library cannot link if
+//   StringTypeHandler is exported.  So, we factor out StringTypeHandlerBase,
+//   export that, then make StringTypeHandler be a subclass which is NOT
+//   exported.
+// TODO(kenton):  There has to be a better way.
+class LIBPROTOBUF_EXPORT StringTypeHandlerBase {
+ public:
+  typedef string Type;
+  static string* New();
+  static void Delete(string* value);
+  static void Clear(string* value) { value->clear(); }
+  static void Merge(const string& from, string* to) { *to = from; }
+  static const Type& default_instance() {
+    return ::google::protobuf::internal::kEmptyString;
+  }
+};
+
+class StringTypeHandler : public StringTypeHandlerBase {
+ public:
+  static int SpaceUsed(const string& value)  {
+    return sizeof(value) + StringSpaceUsedExcludingSelf(value);
+  }
+};
+
+
+}  // namespace internal
+
+// RepeatedPtrField is like RepeatedField, but used for repeated strings or
+// Messages.
+template <typename Element>
+class RepeatedPtrField : public internal::RepeatedPtrFieldBase {
+ public:
+  RepeatedPtrField();
+  RepeatedPtrField(const RepeatedPtrField& other);
+  template <typename Iter>
+  RepeatedPtrField(Iter begin, const Iter& end);
+  ~RepeatedPtrField();
+
+  RepeatedPtrField& operator=(const RepeatedPtrField& other);
+
+  int size() const;
+
+  const Element& Get(int index) const;
+  Element* Mutable(int index);
+  Element* Add();
+
+  // Remove the last element in the array.
+  // Ownership of the element is retained by the array.
+  void RemoveLast();
+
+  // Delete elements with indices in the range [start .. start+num-1].
+  // Caution: implementation moves all elements with indices [start+num .. ].
+  // Calling this routine inside a loop can cause quadratic behavior.
+  void DeleteSubrange(int start, int num);
+
+  void Clear();
+  void MergeFrom(const RepeatedPtrField& other);
+  void CopyFrom(const RepeatedPtrField& other);
+
+  // Reserve space to expand the field to at least the given size.  This only
+  // resizes the pointer array; it doesn't allocate any objects.  If the
+  // array is grown, it will always be at least doubled in size.
+  void Reserve(int new_size);
+
+  int Capacity() const;
+
+  // Gets the underlying array.  This pointer is possibly invalidated by
+  // any add or remove operation.
+  Element** mutable_data();
+  const Element* const* data() const;
+
+  // Swap entire contents with "other".
+  void Swap(RepeatedPtrField* other);
+
+  // Swap two elements.
+  void SwapElements(int index1, int index2);
+
+  // STL-like iterator support
+  typedef internal::RepeatedPtrIterator<Element> iterator;
+  typedef internal::RepeatedPtrIterator<const Element> const_iterator;
+  typedef Element value_type;
+  typedef value_type& reference;
+  typedef const value_type& const_reference;
+  typedef value_type* pointer;
+  typedef const value_type* const_pointer;
+  typedef int size_type;
+  typedef ptrdiff_t difference_type;
+
+  iterator begin();
+  const_iterator begin() const;
+  iterator end();
+  const_iterator end() const;
+
+  // Reverse iterator support
+  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
+  typedef std::reverse_iterator<iterator> reverse_iterator;
+  reverse_iterator rbegin() {
+    return reverse_iterator(end());
+  }
+  const_reverse_iterator rbegin() const {
+    return const_reverse_iterator(end());
+  }
+  reverse_iterator rend() {
+    return reverse_iterator(begin());
+  }
+  const_reverse_iterator rend() const {
+    return const_reverse_iterator(begin());
+  }
+
+  // Custom STL-like iterator that iterates over and returns the underlying
+  // pointers to Element rather than Element itself.
+  typedef internal::RepeatedPtrOverPtrsIterator<Element, void*>
+  pointer_iterator;
+  typedef internal::RepeatedPtrOverPtrsIterator<const Element, const void*>
+  const_pointer_iterator;
+  pointer_iterator pointer_begin();
+  const_pointer_iterator pointer_begin() const;
+  pointer_iterator pointer_end();
+  const_pointer_iterator pointer_end() const;
+
+  // Returns (an estimate of) the number of bytes used by the repeated field,
+  // excluding sizeof(*this).
+  int SpaceUsedExcludingSelf() const;
+
+  // Advanced memory management --------------------------------------
+  // When hardcore memory management becomes necessary -- as it sometimes
+  // does here at Google -- the following methods may be useful.
+
+  // Add an already-allocated object, passing ownership to the
+  // RepeatedPtrField.
+  void AddAllocated(Element* value);
+  // Remove the last element and return it, passing ownership to the caller.
+  // Requires:  size() > 0
+  Element* ReleaseLast();
+
+  // Extract elements with indices in the range "[start .. start+num-1]".
+  // The caller assumes ownership of the extracted elements and is responsible
+  // for deleting them when they are no longer needed.
+  // If "elements" is non-NULL, then pointers to the extracted elements
+  // are stored in "elements[0 .. num-1]" for the convenience of the caller.
+  // If "elements" is NULL, then the caller must use some other mechanism
+  // to perform any further operations (like deletion) on these elements.
+  // Caution: implementation also moves elements with indices [start+num ..].
+  // Calling this routine inside a loop can cause quadratic behavior.
+  void ExtractSubrange(int start, int num, Element** elements);
+
+  // When elements are removed by calls to RemoveLast() or Clear(), they
+  // are not actually freed.  Instead, they are cleared and kept so that
+  // they can be reused later.  This can save lots of CPU time when
+  // repeatedly reusing a protocol message for similar purposes.
+  //
+  // Hardcore programs may choose to manipulate these cleared objects
+  // to better optimize memory management using the following routines.
+
+  // Get the number of cleared objects that are currently being kept
+  // around for reuse.
+  int ClearedCount() const;
+  // Add an element to the pool of cleared objects, passing ownership to
+  // the RepeatedPtrField.  The element must be cleared prior to calling
+  // this method.
+  void AddCleared(Element* value);
+  // Remove a single element from the cleared pool and return it, passing
+  // ownership to the caller.  The element is guaranteed to be cleared.
+  // Requires:  ClearedCount() > 0
+  Element* ReleaseCleared();
+
+ protected:
+  // Note:  RepeatedPtrField SHOULD NOT be subclassed by users.  We only
+  //   subclass it in one place as a hack for compatibility with proto1.  The
+  //   subclass needs to know about TypeHandler in order to call protected
+  //   methods on RepeatedPtrFieldBase.
+  class TypeHandler;
+
+};
+
+// implementation ====================================================
+
+template <typename Element>
+inline RepeatedField<Element>::RepeatedField()
+  : elements_(NULL),
+    current_size_(0),
+    total_size_(kInitialSize) {
+}
+
+template <typename Element>
+inline RepeatedField<Element>::RepeatedField(const RepeatedField& other)
+  : elements_(NULL),
+    current_size_(0),
+    total_size_(kInitialSize) {
+  CopyFrom(other);
+}
+
+template <typename Element>
+template <typename Iter>
+inline RepeatedField<Element>::RepeatedField(Iter begin, const Iter& end)
+  : elements_(NULL),
+    current_size_(0),
+    total_size_(kInitialSize) {
+  for (; begin != end; ++begin) {
+    Add(*begin);
+  }
+}
+
+template <typename Element>
+RepeatedField<Element>::~RepeatedField() {
+  delete [] elements_;
+}
+
+template <typename Element>
+inline RepeatedField<Element>&
+RepeatedField<Element>::operator=(const RepeatedField& other) {
+  if (this != &other)
+    CopyFrom(other);
+  return *this;
+}
+
+template <typename Element>
+inline int RepeatedField<Element>::size() const {
+  return current_size_;
+}
+
+template <typename Element>
+inline int RepeatedField<Element>::Capacity() const {
+  return total_size_;
+}
+
+template<typename Element>
+inline void RepeatedField<Element>::AddAlreadyReserved(const Element& value) {
+  GOOGLE_DCHECK_LT(size(), Capacity());
+  elements_[current_size_++] = value;
+}
+
+template<typename Element>
+inline Element* RepeatedField<Element>::AddAlreadyReserved() {
+  GOOGLE_DCHECK_LT(size(), Capacity());
+  return &elements_[current_size_++];
+}
+
+template <typename Element>
+inline const Element& RepeatedField<Element>::Get(int index) const {
+  GOOGLE_DCHECK_LT(index, size());
+  return elements_[index];
+}
+
+template <typename Element>
+inline Element* RepeatedField<Element>::Mutable(int index) {
+  GOOGLE_DCHECK_LT(index, size());
+  return elements_ + index;
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::Set(int index, const Element& value) {
+  GOOGLE_DCHECK_LT(index, size());
+  elements_[index] = value;
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::Add(const Element& value) {
+  if (current_size_ == total_size_) Reserve(total_size_ + 1);
+  elements_[current_size_++] = value;
+}
+
+template <typename Element>
+inline Element* RepeatedField<Element>::Add() {
+  if (current_size_ == total_size_) Reserve(total_size_ + 1);
+  return &elements_[current_size_++];
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::RemoveLast() {
+  GOOGLE_DCHECK_GT(current_size_, 0);
+  --current_size_;
+}
+
+template <typename Element>
+void RepeatedField<Element>::ExtractSubrange(
+    int start, int num, Element* elements) {
+  GOOGLE_DCHECK_GE(start, 0);
+  GOOGLE_DCHECK_GE(num, 0);
+  GOOGLE_DCHECK_LE(start + num, this->size());
+
+  // Save the values of the removed elements if requested.
+  if (elements != NULL) {
+    for (int i = 0; i < num; ++i)
+      elements[i] = this->Get(i + start);
+  }
+
+  // Slide remaining elements down to fill the gap.
+  if (num > 0) {
+    for (int i = start + num; i < this->size(); ++i)
+      this->Set(i - num, this->Get(i));
+    this->Truncate(this->size() - num);
+  }
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::Clear() {
+  current_size_ = 0;
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::MergeFrom(const RepeatedField& other) {
+  if (other.current_size_ != 0) {
+    Reserve(current_size_ + other.current_size_);
+    CopyArray(elements_ + current_size_, other.elements_, other.current_size_);
+    current_size_ += other.current_size_;
+  }
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::CopyFrom(const RepeatedField& other) {
+  Clear();
+  MergeFrom(other);
+}
+
+template <typename Element>
+inline Element* RepeatedField<Element>::mutable_data() {
+  return elements_;
+}
+
+template <typename Element>
+inline const Element* RepeatedField<Element>::data() const {
+  return elements_;
+}
+
+
+template <typename Element>
+void RepeatedField<Element>::Swap(RepeatedField* other) {
+  if (this == other) return;
+  Element* swap_elements     = elements_;
+  int      swap_current_size = current_size_;
+  int      swap_total_size   = total_size_;
+
+  elements_     = other->elements_;
+  current_size_ = other->current_size_;
+  total_size_   = other->total_size_;
+
+  other->elements_     = swap_elements;
+  other->current_size_ = swap_current_size;
+  other->total_size_   = swap_total_size;
+}
+
+template <typename Element>
+void RepeatedField<Element>::SwapElements(int index1, int index2) {
+  std::swap(elements_[index1], elements_[index2]);
+}
+
+template <typename Element>
+inline typename RepeatedField<Element>::iterator
+RepeatedField<Element>::begin() {
+  return elements_;
+}
+template <typename Element>
+inline typename RepeatedField<Element>::const_iterator
+RepeatedField<Element>::begin() const {
+  return elements_;
+}
+template <typename Element>
+inline typename RepeatedField<Element>::iterator
+RepeatedField<Element>::end() {
+  return elements_ + current_size_;
+}
+template <typename Element>
+inline typename RepeatedField<Element>::const_iterator
+RepeatedField<Element>::end() const {
+  return elements_ + current_size_;
+}
+
+template <typename Element>
+inline int RepeatedField<Element>::SpaceUsedExcludingSelf() const {
+  return (elements_ != NULL) ? total_size_ * sizeof(elements_[0]) : 0;
+}
+
+// Avoid inlining of Reserve(): new, copy, and delete[] lead to a significant
+// amount of code bloat.
+template <typename Element>
+void RepeatedField<Element>::Reserve(int new_size) {
+  if (total_size_ >= new_size) return;
+
+  Element* old_elements = elements_;
+  total_size_ = max(google::protobuf::internal::kMinRepeatedFieldAllocationSize,
+                    max(total_size_ * 2, new_size));
+  elements_ = new Element[total_size_];
+  if (old_elements != NULL) {
+    MoveArray(elements_, old_elements, current_size_);
+    delete [] old_elements;
+  }
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::Truncate(int new_size) {
+  GOOGLE_DCHECK_LE(new_size, current_size_);
+  current_size_ = new_size;
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::MoveArray(
+    Element to[], Element from[], int array_size) {
+  CopyArray(to, from, array_size);
+}
+
+template <typename Element>
+inline void RepeatedField<Element>::CopyArray(
+    Element to[], const Element from[], int array_size) {
+  internal::ElementCopier<Element>()(to, from, array_size);
+}
+
+namespace internal {
+
+template <typename Element, bool HasTrivialCopy>
+void ElementCopier<Element, HasTrivialCopy>::operator()(
+    Element to[], const Element from[], int array_size) {
+  std::copy(from, from + array_size, to);
+}
+
+template <typename Element>
+struct ElementCopier<Element, true> {
+  void operator()(Element to[], const Element from[], int array_size) {
+    memcpy(to, from, array_size * sizeof(Element));
+  }
+};
+
+}  // namespace internal
+
+
+// -------------------------------------------------------------------
+
+namespace internal {
+
+inline RepeatedPtrFieldBase::RepeatedPtrFieldBase()
+  : elements_(NULL),
+    current_size_(0),
+    allocated_size_(0),
+    total_size_(kInitialSize) {
+}
+
+template <typename TypeHandler>
+void RepeatedPtrFieldBase::Destroy() {
+  for (int i = 0; i < allocated_size_; i++) {
+    TypeHandler::Delete(cast<TypeHandler>(elements_[i]));
+  }
+  delete [] elements_;
+}
+
+inline int RepeatedPtrFieldBase::size() const {
+  return current_size_;
+}
+
+template <typename TypeHandler>
+inline const typename TypeHandler::Type&
+RepeatedPtrFieldBase::Get(int index) const {
+  GOOGLE_DCHECK_LT(index, size());
+  return *cast<TypeHandler>(elements_[index]);
+}
+
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type*
+RepeatedPtrFieldBase::Mutable(int index) {
+  GOOGLE_DCHECK_LT(index, size());
+  return cast<TypeHandler>(elements_[index]);
+}
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type* RepeatedPtrFieldBase::Add() {
+  if (current_size_ < allocated_size_) {
+    return cast<TypeHandler>(elements_[current_size_++]);
+  }
+  if (allocated_size_ == total_size_) Reserve(total_size_ + 1);
+  ++allocated_size_;
+  typename TypeHandler::Type* result = TypeHandler::New();
+  elements_[current_size_++] = result;
+  return result;
+}
+
+template <typename TypeHandler>
+inline void RepeatedPtrFieldBase::RemoveLast() {
+  GOOGLE_DCHECK_GT(current_size_, 0);
+  TypeHandler::Clear(cast<TypeHandler>(elements_[--current_size_]));
+}
+
+template <typename TypeHandler>
+void RepeatedPtrFieldBase::Clear() {
+  for (int i = 0; i < current_size_; i++) {
+    TypeHandler::Clear(cast<TypeHandler>(elements_[i]));
+  }
+  current_size_ = 0;
+}
+
+template <typename TypeHandler>
+inline void RepeatedPtrFieldBase::MergeFrom(const RepeatedPtrFieldBase& other) {
+  Reserve(current_size_ + other.current_size_);
+  for (int i = 0; i < other.current_size_; i++) {
+    TypeHandler::Merge(other.template Get<TypeHandler>(i), Add<TypeHandler>());
+  }
+}
+
+template <typename TypeHandler>
+inline void RepeatedPtrFieldBase::CopyFrom(const RepeatedPtrFieldBase& other) {
+  RepeatedPtrFieldBase::Clear<TypeHandler>();
+  RepeatedPtrFieldBase::MergeFrom<TypeHandler>(other);
+}
+
+inline int RepeatedPtrFieldBase::Capacity() const {
+  return total_size_;
+}
+
+inline void* const* RepeatedPtrFieldBase::raw_data() const {
+  return elements_;
+}
+
+inline void** RepeatedPtrFieldBase::raw_mutable_data() const {
+  return elements_;
+}
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type** RepeatedPtrFieldBase::mutable_data() {
+  // TODO(kenton):  Breaks C++ aliasing rules.  We should probably remove this
+  //   method entirely.
+  return reinterpret_cast<typename TypeHandler::Type**>(elements_);
+}
+
+template <typename TypeHandler>
+inline const typename TypeHandler::Type* const*
+RepeatedPtrFieldBase::data() const {
+  // TODO(kenton):  Breaks C++ aliasing rules.  We should probably remove this
+  //   method entirely.
+  return reinterpret_cast<const typename TypeHandler::Type* const*>(elements_);
+}
+
+inline void RepeatedPtrFieldBase::SwapElements(int index1, int index2) {
+  std::swap(elements_[index1], elements_[index2]);
+}
+
+template <typename TypeHandler>
+inline int RepeatedPtrFieldBase::SpaceUsedExcludingSelf() const {
+  int allocated_bytes =
+      (elements_ != NULL) ? total_size_ * sizeof(elements_[0]) : 0;
+  for (int i = 0; i < allocated_size_; ++i) {
+    allocated_bytes += TypeHandler::SpaceUsed(*cast<TypeHandler>(elements_[i]));
+  }
+  return allocated_bytes;
+}
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type* RepeatedPtrFieldBase::AddFromCleared() {
+  if (current_size_ < allocated_size_) {
+    return cast<TypeHandler>(elements_[current_size_++]);
+  } else {
+    return NULL;
+  }
+}
+
+template <typename TypeHandler>
+void RepeatedPtrFieldBase::AddAllocated(
+    typename TypeHandler::Type* value) {
+  // Make room for the new pointer.
+  if (current_size_ == total_size_) {
+    // The array is completely full with no cleared objects, so grow it.
+    Reserve(total_size_ + 1);
+    ++allocated_size_;
+  } else if (allocated_size_ == total_size_) {
+    // There is no more space in the pointer array because it contains some
+    // cleared objects awaiting reuse.  We don't want to grow the array in this
+    // case because otherwise a loop calling AddAllocated() followed by Clear()
+    // would leak memory.
+    TypeHandler::Delete(cast<TypeHandler>(elements_[current_size_]));
+  } else if (current_size_ < allocated_size_) {
+    // We have some cleared objects.  We don't care about their order, so we
+    // can just move the first one to the end to make space.
+    elements_[allocated_size_] = elements_[current_size_];
+    ++allocated_size_;
+  } else {
+    // There are no cleared objects.
+    ++allocated_size_;
+  }
+
+  elements_[current_size_++] = value;
+}
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseLast() {
+  GOOGLE_DCHECK_GT(current_size_, 0);
+  typename TypeHandler::Type* result =
+      cast<TypeHandler>(elements_[--current_size_]);
+  --allocated_size_;
+  if (current_size_ < allocated_size_) {
+    // There are cleared elements on the end; replace the removed element
+    // with the last allocated element.
+    elements_[current_size_] = elements_[allocated_size_];
+  }
+  return result;
+}
+
+inline int RepeatedPtrFieldBase::ClearedCount() const {
+  return allocated_size_ - current_size_;
+}
+
+template <typename TypeHandler>
+inline void RepeatedPtrFieldBase::AddCleared(
+    typename TypeHandler::Type* value) {
+  if (allocated_size_ == total_size_) Reserve(total_size_ + 1);
+  elements_[allocated_size_++] = value;
+}
+
+template <typename TypeHandler>
+inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseCleared() {
+  GOOGLE_DCHECK_GT(allocated_size_, current_size_);
+  return cast<TypeHandler>(elements_[--allocated_size_]);
+}
+
+}  // namespace internal
+
+// -------------------------------------------------------------------
+
+template <typename Element>
+class RepeatedPtrField<Element>::TypeHandler
+    : public internal::GenericTypeHandler<Element> {
+};
+
+template <>
+class RepeatedPtrField<string>::TypeHandler
+    : public internal::StringTypeHandler {
+};
+
+
+template <typename Element>
+inline RepeatedPtrField<Element>::RepeatedPtrField() {}
+
+template <typename Element>
+inline RepeatedPtrField<Element>::RepeatedPtrField(
+    const RepeatedPtrField& other) {
+  CopyFrom(other);
+}
+
+template <typename Element>
+template <typename Iter>
+inline RepeatedPtrField<Element>::RepeatedPtrField(
+    Iter begin, const Iter& end) {
+  for (; begin != end; ++begin) {
+    *Add() = *begin;
+  }
+}
+
+template <typename Element>
+RepeatedPtrField<Element>::~RepeatedPtrField() {
+  Destroy<TypeHandler>();
+}
+
+template <typename Element>
+inline RepeatedPtrField<Element>& RepeatedPtrField<Element>::operator=(
+    const RepeatedPtrField& other) {
+  if (this != &other)
+    CopyFrom(other);
+  return *this;
+}
+
+template <typename Element>
+inline int RepeatedPtrField<Element>::size() const {
+  return RepeatedPtrFieldBase::size();
+}
+
+template <typename Element>
+inline const Element& RepeatedPtrField<Element>::Get(int index) const {
+  return RepeatedPtrFieldBase::Get<TypeHandler>(index);
+}
+
+
+template <typename Element>
+inline Element* RepeatedPtrField<Element>::Mutable(int index) {
+  return RepeatedPtrFieldBase::Mutable<TypeHandler>(index);
+}
+
+template <typename Element>
+inline Element* RepeatedPtrField<Element>::Add() {
+  return RepeatedPtrFieldBase::Add<TypeHandler>();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::RemoveLast() {
+  RepeatedPtrFieldBase::RemoveLast<TypeHandler>();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::DeleteSubrange(int start, int num) {
+  GOOGLE_DCHECK_GE(start, 0);
+  GOOGLE_DCHECK_GE(num, 0);
+  GOOGLE_DCHECK_LE(start + num, size());
+  for (int i = 0; i < num; ++i)
+    delete RepeatedPtrFieldBase::Mutable<TypeHandler>(start + i);
+  ExtractSubrange(start, num, NULL);
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::ExtractSubrange(
+    int start, int num, Element** elements) {
+  GOOGLE_DCHECK_GE(start, 0);
+  GOOGLE_DCHECK_GE(num, 0);
+  GOOGLE_DCHECK_LE(start + num, size());
+
+  if (num > 0) {
+    // Save the values of the removed elements if requested.
+    if (elements != NULL) {
+      for (int i = 0; i < num; ++i)
+        elements[i] = RepeatedPtrFieldBase::Mutable<TypeHandler>(i + start);
+    }
+    CloseGap(start, num);
+  }
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::Clear() {
+  RepeatedPtrFieldBase::Clear<TypeHandler>();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::MergeFrom(
+    const RepeatedPtrField& other) {
+  RepeatedPtrFieldBase::MergeFrom<TypeHandler>(other);
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::CopyFrom(
+    const RepeatedPtrField& other) {
+  RepeatedPtrFieldBase::CopyFrom<TypeHandler>(other);
+}
+
+template <typename Element>
+inline Element** RepeatedPtrField<Element>::mutable_data() {
+  return RepeatedPtrFieldBase::mutable_data<TypeHandler>();
+}
+
+template <typename Element>
+inline const Element* const* RepeatedPtrField<Element>::data() const {
+  return RepeatedPtrFieldBase::data<TypeHandler>();
+}
+
+template <typename Element>
+void RepeatedPtrField<Element>::Swap(RepeatedPtrField* other) {
+  RepeatedPtrFieldBase::Swap(other);
+}
+
+template <typename Element>
+void RepeatedPtrField<Element>::SwapElements(int index1, int index2) {
+  RepeatedPtrFieldBase::SwapElements(index1, index2);
+}
+
+template <typename Element>
+inline int RepeatedPtrField<Element>::SpaceUsedExcludingSelf() const {
+  return RepeatedPtrFieldBase::SpaceUsedExcludingSelf<TypeHandler>();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::AddAllocated(Element* value) {
+  RepeatedPtrFieldBase::AddAllocated<TypeHandler>(value);
+}
+
+template <typename Element>
+inline Element* RepeatedPtrField<Element>::ReleaseLast() {
+  return RepeatedPtrFieldBase::ReleaseLast<TypeHandler>();
+}
+
+
+template <typename Element>
+inline int RepeatedPtrField<Element>::ClearedCount() const {
+  return RepeatedPtrFieldBase::ClearedCount();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::AddCleared(Element* value) {
+  return RepeatedPtrFieldBase::AddCleared<TypeHandler>(value);
+}
+
+template <typename Element>
+inline Element* RepeatedPtrField<Element>::ReleaseCleared() {
+  return RepeatedPtrFieldBase::ReleaseCleared<TypeHandler>();
+}
+
+template <typename Element>
+inline void RepeatedPtrField<Element>::Reserve(int new_size) {
+  return RepeatedPtrFieldBase::Reserve(new_size);
+}
+
+template <typename Element>
+inline int RepeatedPtrField<Element>::Capacity() const {
+  return RepeatedPtrFieldBase::Capacity();
+}
+
+// -------------------------------------------------------------------
+
+namespace internal {
+
+// STL-like iterator implementation for RepeatedPtrField.  You should not
+// refer to this class directly; use RepeatedPtrField<T>::iterator instead.
+//
+// The iterator for RepeatedPtrField<T>, RepeatedPtrIterator<T>, is
+// very similar to iterator_ptr<T**> in util/gtl/iterator_adaptors.h,
+// but adds random-access operators and is modified to wrap a void** base
+// iterator (since RepeatedPtrField stores its array as a void* array and
+// casting void** to T** would violate C++ aliasing rules).
+//
+// This code based on net/proto/proto-array-internal.h by Jeffrey Yasskin
+// (jyasskin@google.com).
+template<typename Element>
+class RepeatedPtrIterator
+    : public std::iterator<
+          std::random_access_iterator_tag, Element> {
+ public:
+  typedef RepeatedPtrIterator<Element> iterator;
+  typedef std::iterator<
+          std::random_access_iterator_tag, Element> superclass;
+
+  // Let the compiler know that these are type names, so we don't have to
+  // write "typename" in front of them everywhere.
+  typedef typename superclass::reference reference;
+  typedef typename superclass::pointer pointer;
+  typedef typename superclass::difference_type difference_type;
+
+  RepeatedPtrIterator() : it_(NULL) {}
+  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
+
+  // Allow "upcasting" from RepeatedPtrIterator<T**> to
+  // RepeatedPtrIterator<const T*const*>.
+  template<typename OtherElement>
+  RepeatedPtrIterator(const RepeatedPtrIterator<OtherElement>& other)
+      : it_(other.it_) {
+    // Force a compiler error if the other type is not convertible to ours.
+    if (false) {
+      implicit_cast<Element*, OtherElement*>(0);
+    }
+  }
+
+  // dereferenceable
+  reference operator*() const { return *reinterpret_cast<Element*>(*it_); }
+  pointer   operator->() const { return &(operator*()); }
+
+  // {inc,dec}rementable
+  iterator& operator++() { ++it_; return *this; }
+  iterator  operator++(int) { return iterator(it_++); }
+  iterator& operator--() { --it_; return *this; }
+  iterator  operator--(int) { return iterator(it_--); }
+
+  // equality_comparable
+  bool operator==(const iterator& x) const { return it_ == x.it_; }
+  bool operator!=(const iterator& x) const { return it_ != x.it_; }
+
+  // less_than_comparable
+  bool operator<(const iterator& x) const { return it_ < x.it_; }
+  bool operator<=(const iterator& x) const { return it_ <= x.it_; }
+  bool operator>(const iterator& x) const { return it_ > x.it_; }
+  bool operator>=(const iterator& x) const { return it_ >= x.it_; }
+
+  // addable, subtractable
+  iterator& operator+=(difference_type d) {
+    it_ += d;
+    return *this;
+  }
+  friend iterator operator+(iterator it, difference_type d) {
+    it += d;
+    return it;
+  }
+  friend iterator operator+(difference_type d, iterator it) {
+    it += d;
+    return it;
+  }
+  iterator& operator-=(difference_type d) {
+    it_ -= d;
+    return *this;
+  }
+  friend iterator operator-(iterator it, difference_type d) {
+    it -= d;
+    return it;
+  }
+
+  // indexable
+  reference operator[](difference_type d) const { return *(*this + d); }
+
+  // random access iterator
+  difference_type operator-(const iterator& x) const { return it_ - x.it_; }
+
+ private:
+  template<typename OtherElement>
+  friend class RepeatedPtrIterator;
+
+  // The internal iterator.
+  void* const* it_;
+};
+
+// Provide an iterator that operates on pointers to the underlying objects
+// rather than the objects themselves as RepeatedPtrIterator does.
+// Consider using this when working with stl algorithms that change
+// the array.
+// The VoidPtr template parameter holds the type-agnostic pointer value
+// referenced by the iterator.  It should either be "void *" for a mutable
+// iterator, or "const void *" for a constant iterator.
+template<typename Element, typename VoidPtr>
+class RepeatedPtrOverPtrsIterator
+    : public std::iterator<std::random_access_iterator_tag, Element*> {
+ public:
+  typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator;
+  typedef std::iterator<
+          std::random_access_iterator_tag, Element*> superclass;
+
+  // Let the compiler know that these are type names, so we don't have to
+  // write "typename" in front of them everywhere.
+  typedef typename superclass::reference reference;
+  typedef typename superclass::pointer pointer;
+  typedef typename superclass::difference_type difference_type;
+
+  RepeatedPtrOverPtrsIterator() : it_(NULL) {}
+  explicit RepeatedPtrOverPtrsIterator(VoidPtr* it) : it_(it) {}
+
+  // dereferenceable
+  reference operator*() const { return *reinterpret_cast<Element**>(it_); }
+  pointer   operator->() const { return &(operator*()); }
+
+  // {inc,dec}rementable
+  iterator& operator++() { ++it_; return *this; }
+  iterator  operator++(int) { return iterator(it_++); }
+  iterator& operator--() { --it_; return *this; }
+  iterator  operator--(int) { return iterator(it_--); }
+
+  // equality_comparable
+  bool operator==(const iterator& x) const { return it_ == x.it_; }
+  bool operator!=(const iterator& x) const { return it_ != x.it_; }
+
+  // less_than_comparable
+  bool operator<(const iterator& x) const { return it_ < x.it_; }
+  bool operator<=(const iterator& x) const { return it_ <= x.it_; }
+  bool operator>(const iterator& x) const { return it_ > x.it_; }
+  bool operator>=(const iterator& x) const { return it_ >= x.it_; }
+
+  // addable, subtractable
+  iterator& operator+=(difference_type d) {
+    it_ += d;
+    return *this;
+  }
+  friend iterator operator+(iterator it, difference_type d) {
+    it += d;
+    return it;
+  }
+  friend iterator operator+(difference_type d, iterator it) {
+    it += d;
+    return it;
+  }
+  iterator& operator-=(difference_type d) {
+    it_ -= d;
+    return *this;
+  }
+  friend iterator operator-(iterator it, difference_type d) {
+    it -= d;
+    return it;
+  }
+
+  // indexable
+  reference operator[](difference_type d) const { return *(*this + d); }
+
+  // random access iterator
+  difference_type operator-(const iterator& x) const { return it_ - x.it_; }
+
+ private:
+  template<typename OtherElement>
+  friend class RepeatedPtrIterator;
+
+  // The internal iterator.
+  VoidPtr* it_;
+};
+
+}  // namespace internal
+
+template <typename Element>
+inline typename RepeatedPtrField<Element>::iterator
+RepeatedPtrField<Element>::begin() {
+  return iterator(raw_data());
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::const_iterator
+RepeatedPtrField<Element>::begin() const {
+  return iterator(raw_data());
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::iterator
+RepeatedPtrField<Element>::end() {
+  return iterator(raw_data() + size());
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::const_iterator
+RepeatedPtrField<Element>::end() const {
+  return iterator(raw_data() + size());
+}
+
+template <typename Element>
+inline typename RepeatedPtrField<Element>::pointer_iterator
+RepeatedPtrField<Element>::pointer_begin() {
+  return pointer_iterator(raw_mutable_data());
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::const_pointer_iterator
+RepeatedPtrField<Element>::pointer_begin() const {
+  return const_pointer_iterator(const_cast<const void**>(raw_mutable_data()));
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::pointer_iterator
+RepeatedPtrField<Element>::pointer_end() {
+  return pointer_iterator(raw_mutable_data() + size());
+}
+template <typename Element>
+inline typename RepeatedPtrField<Element>::const_pointer_iterator
+RepeatedPtrField<Element>::pointer_end() const {
+  return const_pointer_iterator(
+      const_cast<const void**>(raw_mutable_data() + size()));
+}
+
+
+// Iterators and helper functions that follow the spirit of the STL
+// std::back_insert_iterator and std::back_inserter but are tailor-made
+// for RepeatedField and RepatedPtrField. Typical usage would be:
+//
+//   std::copy(some_sequence.begin(), some_sequence.end(),
+//             google::protobuf::RepeatedFieldBackInserter(proto.mutable_sequence()));
+//
+// Ported by johannes from util/gtl/proto-array-iterators.h
+
+namespace internal {
+// A back inserter for RepeatedField objects.
+template<typename T> class RepeatedFieldBackInsertIterator
+    : public std::iterator<std::output_iterator_tag, T> {
+ public:
+  explicit RepeatedFieldBackInsertIterator(
+      RepeatedField<T>* const mutable_field)
+      : field_(mutable_field) {
+  }
+  RepeatedFieldBackInsertIterator<T>& operator=(const T& value) {
+    field_->Add(value);
+    return *this;
+  }
+  RepeatedFieldBackInsertIterator<T>& operator*() {
+    return *this;
+  }
+  RepeatedFieldBackInsertIterator<T>& operator++() {
+    return *this;
+  }
+  RepeatedFieldBackInsertIterator<T>& operator++(int /* unused */) {
+    return *this;
+  }
+
+ private:
+  RepeatedField<T>* field_;
+};
+
+// A back inserter for RepeatedPtrField objects.
+template<typename T> class RepeatedPtrFieldBackInsertIterator
+    : public std::iterator<std::output_iterator_tag, T> {
+ public:
+  RepeatedPtrFieldBackInsertIterator(
+      RepeatedPtrField<T>* const mutable_field)
+      : field_(mutable_field) {
+  }
+  RepeatedPtrFieldBackInsertIterator<T>& operator=(const T& value) {
+    *field_->Add() = value;
+    return *this;
+  }
+  RepeatedPtrFieldBackInsertIterator<T>& operator=(
+      const T* const ptr_to_value) {
+    *field_->Add() = *ptr_to_value;
+    return *this;
+  }
+  RepeatedPtrFieldBackInsertIterator<T>& operator*() {
+    return *this;
+  }
+  RepeatedPtrFieldBackInsertIterator<T>& operator++() {
+    return *this;
+  }
+  RepeatedPtrFieldBackInsertIterator<T>& operator++(int /* unused */) {
+    return *this;
+  }
+
+ private:
+  RepeatedPtrField<T>* field_;
+};
+
+// A back inserter for RepeatedPtrFields that inserts by transfering ownership
+// of a pointer.
+template<typename T> class AllocatedRepeatedPtrFieldBackInsertIterator
+    : public std::iterator<std::output_iterator_tag, T> {
+ public:
+  explicit AllocatedRepeatedPtrFieldBackInsertIterator(
+      RepeatedPtrField<T>* const mutable_field)
+      : field_(mutable_field) {
+  }
+  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator=(
+      T* const ptr_to_value) {
+    field_->AddAllocated(ptr_to_value);
+    return *this;
+  }
+  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator*() {
+    return *this;
+  }
+  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++() {
+    return *this;
+  }
+  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++(
+      int /* unused */) {
+    return *this;
+  }
+
+ private:
+  RepeatedPtrField<T>* field_;
+};
+}  // namespace internal
+
+// Provides a back insert iterator for RepeatedField instances,
+// similar to std::back_inserter().
+template<typename T> internal::RepeatedFieldBackInsertIterator<T>
+RepeatedFieldBackInserter(RepeatedField<T>* const mutable_field) {
+  return internal::RepeatedFieldBackInsertIterator<T>(mutable_field);
+}
+
+// Provides a back insert iterator for RepeatedPtrField instances,
+// similar to std::back_inserter().
+template<typename T> internal::RepeatedPtrFieldBackInsertIterator<T>
+RepeatedPtrFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {
+  return internal::RepeatedPtrFieldBackInsertIterator<T>(mutable_field);
+}
+
+// Special back insert iterator for RepeatedPtrField instances, just in
+// case someone wants to write generic template code that can access both
+// RepeatedFields and RepeatedPtrFields using a common name.
+template<typename T> internal::RepeatedPtrFieldBackInsertIterator<T>
+RepeatedFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {
+  return internal::RepeatedPtrFieldBackInsertIterator<T>(mutable_field);
+}
+
+// Provides a back insert iterator for RepeatedPtrField instances
+// similar to std::back_inserter() which transfers the ownership while
+// copying elements.
+template<typename T> internal::AllocatedRepeatedPtrFieldBackInsertIterator<T>
+AllocatedRepeatedPtrFieldBackInserter(
+    RepeatedPtrField<T>* const mutable_field) {
+  return internal::AllocatedRepeatedPtrFieldBackInsertIterator<T>(
+      mutable_field);
+}
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_REPEATED_FIELD_H__
diff --git a/ps-lite/deps/include/google/protobuf/service.h b/ps-lite/deps/include/google/protobuf/service.h
new file mode 100644
index 00000000..a6a7d16d
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/service.h
@@ -0,0 +1,291 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// DEPRECATED:  This module declares the abstract interfaces underlying proto2
+// RPC services.  These are intented to be independent of any particular RPC
+// implementation, so that proto2 services can be used on top of a variety
+// of implementations.  Starting with version 2.3.0, RPC implementations should
+// not try to build on these, but should instead provide code generator plugins
+// which generate code specific to the particular RPC implementation.  This way
+// the generated code can be more appropriate for the implementation in use
+// and can avoid unnecessary layers of indirection.
+//
+//
+// When you use the protocol compiler to compile a service definition, it
+// generates two classes:  An abstract interface for the service (with
+// methods matching the service definition) and a "stub" implementation.
+// A stub is just a type-safe wrapper around an RpcChannel which emulates a
+// local implementation of the service.
+//
+// For example, the service definition:
+//   service MyService {
+//     rpc Foo(MyRequest) returns(MyResponse);
+//   }
+// will generate abstract interface "MyService" and class "MyService::Stub".
+// You could implement a MyService as follows:
+//   class MyServiceImpl : public MyService {
+//    public:
+//     MyServiceImpl() {}
+//     ~MyServiceImpl() {}
+//
+//     // implements MyService ---------------------------------------
+//
+//     void Foo(google::protobuf::RpcController* controller,
+//              const MyRequest* request,
+//              MyResponse* response,
+//              Closure* done) {
+//       // ... read request and fill in response ...
+//       done->Run();
+//     }
+//   };
+// You would then register an instance of MyServiceImpl with your RPC server
+// implementation.  (How to do that depends on the implementation.)
+//
+// To call a remote MyServiceImpl, first you need an RpcChannel connected to it.
+// How to construct a channel depends, again, on your RPC implementation.
+// Here we use a hypothentical "MyRpcChannel" as an example:
+//   MyRpcChannel channel("rpc:hostname:1234/myservice");
+//   MyRpcController controller;
+//   MyServiceImpl::Stub stub(&channel);
+//   FooRequest request;
+//   FooRespnose response;
+//
+//   // ... fill in request ...
+//
+//   stub.Foo(&controller, request, &response, NewCallback(HandleResponse));
+//
+// On Thread-Safety:
+//
+// Different RPC implementations may make different guarantees about what
+// threads they may run callbacks on, and what threads the application is
+// allowed to use to call the RPC system.  Portable software should be ready
+// for callbacks to be called on any thread, but should not try to call the
+// RPC system from any thread except for the ones on which it received the
+// callbacks.  Realistically, though, simple software will probably want to
+// use a single-threaded RPC system while high-end software will want to
+// use multiple threads.  RPC implementations should provide multiple
+// choices.
+
+#ifndef GOOGLE_PROTOBUF_SERVICE_H__
+#define GOOGLE_PROTOBUF_SERVICE_H__
+
+#include <string>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+
+// Defined in this file.
+class Service;
+class RpcController;
+class RpcChannel;
+
+// Defined in other files.
+class Descriptor;            // descriptor.h
+class ServiceDescriptor;     // descriptor.h
+class MethodDescriptor;      // descriptor.h
+class Message;               // message.h
+
+// Abstract base interface for protocol-buffer-based RPC services.  Services
+// themselves are abstract interfaces (implemented either by servers or as
+// stubs), but they subclass this base interface.  The methods of this
+// interface can be used to call the methods of the Service without knowing
+// its exact type at compile time (analogous to Reflection).
+class LIBPROTOBUF_EXPORT Service {
+ public:
+  inline Service() {}
+  virtual ~Service();
+
+  // When constructing a stub, you may pass STUB_OWNS_CHANNEL as the second
+  // parameter to the constructor to tell it to delete its RpcChannel when
+  // destroyed.
+  enum ChannelOwnership {
+    STUB_OWNS_CHANNEL,
+    STUB_DOESNT_OWN_CHANNEL
+  };
+
+  // Get the ServiceDescriptor describing this service and its methods.
+  virtual const ServiceDescriptor* GetDescriptor() = 0;
+
+  // Call a method of the service specified by MethodDescriptor.  This is
+  // normally implemented as a simple switch() that calls the standard
+  // definitions of the service's methods.
+  //
+  // Preconditions:
+  // * method->service() == GetDescriptor()
+  // * request and response are of the exact same classes as the objects
+  //   returned by GetRequestPrototype(method) and
+  //   GetResponsePrototype(method).
+  // * After the call has started, the request must not be modified and the
+  //   response must not be accessed at all until "done" is called.
+  // * "controller" is of the correct type for the RPC implementation being
+  //   used by this Service.  For stubs, the "correct type" depends on the
+  //   RpcChannel which the stub is using.  Server-side Service
+  //   implementations are expected to accept whatever type of RpcController
+  //   the server-side RPC implementation uses.
+  //
+  // Postconditions:
+  // * "done" will be called when the method is complete.  This may be
+  //   before CallMethod() returns or it may be at some point in the future.
+  // * If the RPC succeeded, "response" contains the response returned by
+  //   the server.
+  // * If the RPC failed, "response"'s contents are undefined.  The
+  //   RpcController can be queried to determine if an error occurred and
+  //   possibly to get more information about the error.
+  virtual void CallMethod(const MethodDescriptor* method,
+                          RpcController* controller,
+                          const Message* request,
+                          Message* response,
+                          Closure* done) = 0;
+
+  // CallMethod() requires that the request and response passed in are of a
+  // particular subclass of Message.  GetRequestPrototype() and
+  // GetResponsePrototype() get the default instances of these required types.
+  // You can then call Message::New() on these instances to construct mutable
+  // objects which you can then pass to CallMethod().
+  //
+  // Example:
+  //   const MethodDescriptor* method =
+  //     service->GetDescriptor()->FindMethodByName("Foo");
+  //   Message* request  = stub->GetRequestPrototype (method)->New();
+  //   Message* response = stub->GetResponsePrototype(method)->New();
+  //   request->ParseFromString(input);
+  //   service->CallMethod(method, *request, response, callback);
+  virtual const Message& GetRequestPrototype(
+    const MethodDescriptor* method) const = 0;
+  virtual const Message& GetResponsePrototype(
+    const MethodDescriptor* method) const = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Service);
+};
+
+// An RpcController mediates a single method call.  The primary purpose of
+// the controller is to provide a way to manipulate settings specific to the
+// RPC implementation and to find out about RPC-level errors.
+//
+// The methods provided by the RpcController interface are intended to be a
+// "least common denominator" set of features which we expect all
+// implementations to support.  Specific implementations may provide more
+// advanced features (e.g. deadline propagation).
+class LIBPROTOBUF_EXPORT RpcController {
+ public:
+  inline RpcController() {}
+  virtual ~RpcController();
+
+  // Client-side methods ---------------------------------------------
+  // These calls may be made from the client side only.  Their results
+  // are undefined on the server side (may crash).
+
+  // Resets the RpcController to its initial state so that it may be reused in
+  // a new call.  Must not be called while an RPC is in progress.
+  virtual void Reset() = 0;
+
+  // After a call has finished, returns true if the call failed.  The possible
+  // reasons for failure depend on the RPC implementation.  Failed() must not
+  // be called before a call has finished.  If Failed() returns true, the
+  // contents of the response message are undefined.
+  virtual bool Failed() const = 0;
+
+  // If Failed() is true, returns a human-readable description of the error.
+  virtual string ErrorText() const = 0;
+
+  // Advises the RPC system that the caller desires that the RPC call be
+  // canceled.  The RPC system may cancel it immediately, may wait awhile and
+  // then cancel it, or may not even cancel the call at all.  If the call is
+  // canceled, the "done" callback will still be called and the RpcController
+  // will indicate that the call failed at that time.
+  virtual void StartCancel() = 0;
+
+  // Server-side methods ---------------------------------------------
+  // These calls may be made from the server side only.  Their results
+  // are undefined on the client side (may crash).
+
+  // Causes Failed() to return true on the client side.  "reason" will be
+  // incorporated into the message returned by ErrorText().  If you find
+  // you need to return machine-readable information about failures, you
+  // should incorporate it into your response protocol buffer and should
+  // NOT call SetFailed().
+  virtual void SetFailed(const string& reason) = 0;
+
+  // If true, indicates that the client canceled the RPC, so the server may
+  // as well give up on replying to it.  The server should still call the
+  // final "done" callback.
+  virtual bool IsCanceled() const = 0;
+
+  // Asks that the given callback be called when the RPC is canceled.  The
+  // callback will always be called exactly once.  If the RPC completes without
+  // being canceled, the callback will be called after completion.  If the RPC
+  // has already been canceled when NotifyOnCancel() is called, the callback
+  // will be called immediately.
+  //
+  // NotifyOnCancel() must be called no more than once per request.
+  virtual void NotifyOnCancel(Closure* callback) = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RpcController);
+};
+
+// Abstract interface for an RPC channel.  An RpcChannel represents a
+// communication line to a Service which can be used to call that Service's
+// methods.  The Service may be running on another machine.  Normally, you
+// should not call an RpcChannel directly, but instead construct a stub Service
+// wrapping it.  Example:
+//   RpcChannel* channel = new MyRpcChannel("remotehost.example.com:1234");
+//   MyService* service = new MyService::Stub(channel);
+//   service->MyMethod(request, &response, callback);
+class LIBPROTOBUF_EXPORT RpcChannel {
+ public:
+  inline RpcChannel() {}
+  virtual ~RpcChannel();
+
+  // Call the given method of the remote service.  The signature of this
+  // procedure looks the same as Service::CallMethod(), but the requirements
+  // are less strict in one important way:  the request and response objects
+  // need not be of any specific class as long as their descriptors are
+  // method->input_type() and method->output_type().
+  virtual void CallMethod(const MethodDescriptor* method,
+                          RpcController* controller,
+                          const Message* request,
+                          Message* response,
+                          Closure* done) = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RpcChannel);
+};
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_SERVICE_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops.h
new file mode 100644
index 00000000..b8581fa2
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops.h
@@ -0,0 +1,206 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// The routines exported by this module are subtle.  If you use them, even if
+// you get the code right, it will depend on careful reasoning about atomicity
+// and memory ordering; it will be less readable, and harder to maintain.  If
+// you plan to use these routines, you should have a good reason, such as solid
+// evidence that performance would otherwise suffer, or there being no
+// alternative.  You should assume only properties explicitly guaranteed by the
+// specifications in this file.  You are almost certainly _not_ writing code
+// just for the x86; if you assume x86 semantics, x86 hardware bugs and
+// implementations on other archtectures will cause your code to break.  If you
+// do not know what you are doing, avoid these routines, and use a Mutex.
+//
+// It is incorrect to make direct assignments to/from an atomic variable.
+// You should use one of the Load or Store routines.  The NoBarrier
+// versions are provided when no barriers are needed:
+//   NoBarrier_Store()
+//   NoBarrier_Load()
+// Although there are currently no compiler enforcement, you are encouraged
+// to use these.
+
+// This header and the implementations for each platform (located in
+// atomicops_internals_*) must be kept in sync with the upstream code (V8).
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_H_
+
+// Don't include this file for people not concerned about thread safety.
+#ifndef GOOGLE_PROTOBUF_NO_THREAD_SAFETY
+
+#include <google/protobuf/stubs/platform_macros.h>
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+typedef int32 Atomic32;
+#ifdef GOOGLE_PROTOBUF_ARCH_64_BIT
+// We need to be able to go between Atomic64 and AtomicWord implicitly.  This
+// means Atomic64 and AtomicWord should be the same type on 64-bit.
+#if defined(GOOGLE_PROTOBUF_OS_NACL)
+// NaCl's intptr_t is not actually 64-bits on 64-bit!
+// http://code.google.com/p/nativeclient/issues/detail?id=1162
+typedef int64 Atomic64;
+#else
+typedef intptr_t Atomic64;
+#endif
+#endif
+
+// Use AtomicWord for a machine-sized pointer.  It will use the Atomic32 or
+// Atomic64 routines below, depending on your architecture.
+typedef intptr_t AtomicWord;
+
+// Atomically execute:
+//      result = *ptr;
+//      if (*ptr == old_value)
+//        *ptr = new_value;
+//      return result;
+//
+// I.e., replace "*ptr" with "new_value" if "*ptr" used to be "old_value".
+// Always return the old value of "*ptr"
+//
+// This routine implies no memory barriers.
+Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                  Atomic32 old_value,
+                                  Atomic32 new_value);
+
+// Atomically store new_value into *ptr, returning the previous value held in
+// *ptr.  This routine implies no memory barriers.
+Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr, Atomic32 new_value);
+
+// Atomically increment *ptr by "increment".  Returns the new value of
+// *ptr with the increment applied.  This routine implies no memory barriers.
+Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr, Atomic32 increment);
+
+Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                 Atomic32 increment);
+
+// These following lower-level operations are typically useful only to people
+// implementing higher-level synchronization operations like spinlocks,
+// mutexes, and condition-variables.  They combine CompareAndSwap(), a load, or
+// a store with appropriate memory-ordering instructions.  "Acquire" operations
+// ensure that no later memory access can be reordered ahead of the operation.
+// "Release" operations ensure that no previous memory access can be reordered
+// after the operation.  "Barrier" operations have both "Acquire" and "Release"
+// semantics.   A MemoryBarrier() has "Barrier" semantics, but does no memory
+// access.
+Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                Atomic32 old_value,
+                                Atomic32 new_value);
+Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                Atomic32 old_value,
+                                Atomic32 new_value);
+
+void MemoryBarrier();
+void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value);
+void Acquire_Store(volatile Atomic32* ptr, Atomic32 value);
+void Release_Store(volatile Atomic32* ptr, Atomic32 value);
+
+Atomic32 NoBarrier_Load(volatile const Atomic32* ptr);
+Atomic32 Acquire_Load(volatile const Atomic32* ptr);
+Atomic32 Release_Load(volatile const Atomic32* ptr);
+
+// 64-bit atomic operations (only available on 64-bit processors).
+#ifdef GOOGLE_PROTOBUF_ARCH_64_BIT
+Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
+                                  Atomic64 old_value,
+                                  Atomic64 new_value);
+Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr, Atomic64 new_value);
+Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr, Atomic64 increment);
+Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr, Atomic64 increment);
+
+Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
+                                Atomic64 old_value,
+                                Atomic64 new_value);
+Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
+                                Atomic64 old_value,
+                                Atomic64 new_value);
+void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value);
+void Acquire_Store(volatile Atomic64* ptr, Atomic64 value);
+void Release_Store(volatile Atomic64* ptr, Atomic64 value);
+Atomic64 NoBarrier_Load(volatile const Atomic64* ptr);
+Atomic64 Acquire_Load(volatile const Atomic64* ptr);
+Atomic64 Release_Load(volatile const Atomic64* ptr);
+#endif  // GOOGLE_PROTOBUF_ARCH_64_BIT
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+// Include our platform specific implementation.
+#define GOOGLE_PROTOBUF_ATOMICOPS_ERROR \
+#error "Atomic operations are not supported on your platform"
+
+// MSVC.
+#if defined(_MSC_VER)
+#if defined(GOOGLE_PROTOBUF_ARCH_IA32) || defined(GOOGLE_PROTOBUF_ARCH_X64)
+#include <google/protobuf/stubs/atomicops_internals_x86_msvc.h>
+#else
+GOOGLE_PROTOBUF_ATOMICOPS_ERROR
+#endif
+
+// Apple.
+#elif defined(GOOGLE_PROTOBUF_OS_APPLE)
+#include <google/protobuf/stubs/atomicops_internals_macosx.h>
+
+// GCC.
+#elif defined(__GNUC__)
+#if defined(GOOGLE_PROTOBUF_ARCH_IA32) || defined(GOOGLE_PROTOBUF_ARCH_X64)
+#include <google/protobuf/stubs/atomicops_internals_x86_gcc.h>
+#elif defined(GOOGLE_PROTOBUF_ARCH_ARM)
+#include <google/protobuf/stubs/atomicops_internals_arm_gcc.h>
+#elif defined(GOOGLE_PROTOBUF_ARCH_ARM_QNX)
+#include <google/protobuf/stubs/atomicops_internals_arm_qnx.h>
+#elif defined(GOOGLE_PROTOBUF_ARCH_MIPS)
+#include <google/protobuf/stubs/atomicops_internals_mips_gcc.h>
+#elif defined(__pnacl__)
+#include <google/protobuf/stubs/atomicops_internals_pnacl.h>
+#else
+GOOGLE_PROTOBUF_ATOMICOPS_ERROR
+#endif
+
+// Unknown.
+#else
+GOOGLE_PROTOBUF_ATOMICOPS_ERROR
+#endif
+
+// On some platforms we need additional declarations to make AtomicWord
+// compatible with our other Atomic* types.
+#if defined(GOOGLE_PROTOBUF_OS_APPLE)
+#include <google/protobuf/stubs/atomicops_internals_atomicword_compat.h>
+#endif
+
+#undef GOOGLE_PROTOBUF_ATOMICOPS_ERROR
+
+#endif  // GOOGLE_PROTOBUF_NO_THREAD_SAFETY
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
new file mode 100644
index 00000000..1f4dedc0
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
@@ -0,0 +1,151 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+//
+// LinuxKernelCmpxchg and Barrier_AtomicIncrement are from Google Gears.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// 0xffff0fc0 is the hard coded address of a function provided by
+// the kernel which implements an atomic compare-exchange. On older
+// ARM architecture revisions (pre-v6) this may be implemented using
+// a syscall. This address is stable, and in active use (hard coded)
+// by at least glibc-2.7 and the Android C library.
+typedef Atomic32 (*LinuxKernelCmpxchgFunc)(Atomic32 old_value,
+                                           Atomic32 new_value,
+                                           volatile Atomic32* ptr);
+LinuxKernelCmpxchgFunc pLinuxKernelCmpxchg __attribute__((weak)) =
+    (LinuxKernelCmpxchgFunc) 0xffff0fc0;
+
+typedef void (*LinuxKernelMemoryBarrierFunc)(void);
+LinuxKernelMemoryBarrierFunc pLinuxKernelMemoryBarrier __attribute__((weak)) =
+    (LinuxKernelMemoryBarrierFunc) 0xffff0fa0;
+
+
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  Atomic32 prev_value = *ptr;
+  do {
+    if (!pLinuxKernelCmpxchg(old_value, new_value,
+                             const_cast<Atomic32*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
+                                         Atomic32 new_value) {
+  Atomic32 old_value;
+  do {
+    old_value = *ptr;
+  } while (pLinuxKernelCmpxchg(old_value, new_value,
+                               const_cast<Atomic32*>(ptr)));
+  return old_value;
+}
+
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  return Barrier_AtomicIncrement(ptr, increment);
+}
+
+inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                        Atomic32 increment) {
+  for (;;) {
+    // Atomic exchange the old value with an incremented one.
+    Atomic32 old_value = *ptr;
+    Atomic32 new_value = old_value + increment;
+    if (pLinuxKernelCmpxchg(old_value, new_value,
+                            const_cast<Atomic32*>(ptr)) == 0) {
+      // The exchange took place as expected.
+      return new_value;
+    }
+    // Otherwise, *ptr changed mid-loop and we need to retry.
+  }
+}
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+inline void MemoryBarrier() {
+  pLinuxKernelMemoryBarrier();
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
new file mode 100644
index 00000000..f0507697
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
@@ -0,0 +1,146 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
+
+// For _smp_cmpxchg()
+#include <pthread.h>
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+inline Atomic32 QNXCmpxchg(Atomic32 old_value,
+                           Atomic32 new_value,
+                           volatile Atomic32* ptr) {
+  return static_cast<Atomic32>(
+      _smp_cmpxchg((volatile unsigned *)ptr,
+                   (unsigned)old_value,
+                   (unsigned)new_value));
+}
+
+
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  Atomic32 prev_value = *ptr;
+  do {
+    if (!QNXCmpxchg(old_value, new_value,
+                    const_cast<Atomic32*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
+                                         Atomic32 new_value) {
+  Atomic32 old_value;
+  do {
+    old_value = *ptr;
+  } while (QNXCmpxchg(old_value, new_value,
+                      const_cast<Atomic32*>(ptr)));
+  return old_value;
+}
+
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  return Barrier_AtomicIncrement(ptr, increment);
+}
+
+inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                        Atomic32 increment) {
+  for (;;) {
+    // Atomic exchange the old value with an incremented one.
+    Atomic32 old_value = *ptr;
+    Atomic32 new_value = old_value + increment;
+    if (QNXCmpxchg(old_value, new_value,
+                   const_cast<Atomic32*>(ptr)) == 0) {
+      // The exchange took place as expected.
+      return new_value;
+    }
+    // Otherwise, *ptr changed mid-loop and we need to retry.
+  }
+}
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+inline void MemoryBarrier() {
+  __sync_synchronize();
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
new file mode 100644
index 00000000..e9d86797
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
@@ -0,0 +1,122 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
+
+// AtomicWord is a synonym for intptr_t, and Atomic32 is a synonym for int32,
+// which in turn means int. On some LP32 platforms, intptr_t is an int, but
+// on others, it's a long. When AtomicWord and Atomic32 are based on different
+// fundamental types, their pointers are incompatible.
+//
+// This file defines function overloads to allow both AtomicWord and Atomic32
+// data to be used with this interface.
+//
+// On LP64 platforms, AtomicWord and Atomic64 are both always long,
+// so this problem doesn't occur.
+
+#if !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,
+                                           AtomicWord old_value,
+                                           AtomicWord new_value) {
+  return NoBarrier_CompareAndSwap(
+      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
+}
+
+inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,
+                                           AtomicWord new_value) {
+  return NoBarrier_AtomicExchange(
+      reinterpret_cast<volatile Atomic32*>(ptr), new_value);
+}
+
+inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,
+                                            AtomicWord increment) {
+  return NoBarrier_AtomicIncrement(
+      reinterpret_cast<volatile Atomic32*>(ptr), increment);
+}
+
+inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,
+                                          AtomicWord increment) {
+  return Barrier_AtomicIncrement(
+      reinterpret_cast<volatile Atomic32*>(ptr), increment);
+}
+
+inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,
+                                         AtomicWord old_value,
+                                         AtomicWord new_value) {
+  return Acquire_CompareAndSwap(
+      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
+}
+
+inline AtomicWord Release_CompareAndSwap(volatile AtomicWord* ptr,
+                                         AtomicWord old_value,
+                                         AtomicWord new_value) {
+  return Release_CompareAndSwap(
+      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile AtomicWord *ptr, AtomicWord value) {
+  NoBarrier_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
+}
+
+inline void Acquire_Store(volatile AtomicWord* ptr, AtomicWord value) {
+  return Acquire_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
+}
+
+inline void Release_Store(volatile AtomicWord* ptr, AtomicWord value) {
+  return Release_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
+}
+
+inline AtomicWord NoBarrier_Load(volatile const AtomicWord *ptr) {
+  return NoBarrier_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
+}
+
+inline AtomicWord Acquire_Load(volatile const AtomicWord* ptr) {
+  return Acquire_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
+}
+
+inline AtomicWord Release_Load(volatile const AtomicWord* ptr) {
+  return Release_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
+}
+
+}   // namespace internal
+}   // namespace protobuf
+}   // namespace google
+
+#endif  // !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
new file mode 100644
index 00000000..f9b7581a
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
@@ -0,0 +1,225 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
+
+#include <libkern/OSAtomic.h>
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  Atomic32 prev_value;
+  do {
+    if (OSAtomicCompareAndSwap32(old_value, new_value,
+                                 const_cast<Atomic32*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
+                                         Atomic32 new_value) {
+  Atomic32 old_value;
+  do {
+    old_value = *ptr;
+  } while (!OSAtomicCompareAndSwap32(old_value, new_value,
+                                     const_cast<Atomic32*>(ptr)));
+  return old_value;
+}
+
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  return OSAtomicAdd32(increment, const_cast<Atomic32*>(ptr));
+}
+
+inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  return OSAtomicAdd32Barrier(increment, const_cast<Atomic32*>(ptr));
+}
+
+inline void MemoryBarrier() {
+  OSMemoryBarrier();
+}
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  Atomic32 prev_value;
+  do {
+    if (OSAtomicCompareAndSwap32Barrier(old_value, new_value,
+                                        const_cast<Atomic32*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return Acquire_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+#ifdef __LP64__
+
+// 64-bit implementation on 64-bit platform
+
+inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
+                                         Atomic64 old_value,
+                                         Atomic64 new_value) {
+  Atomic64 prev_value;
+  do {
+    if (OSAtomicCompareAndSwap64(old_value, new_value,
+                                 reinterpret_cast<volatile int64_t*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,
+                                         Atomic64 new_value) {
+  Atomic64 old_value;
+  do {
+    old_value = *ptr;
+  } while (!OSAtomicCompareAndSwap64(old_value, new_value,
+                                     reinterpret_cast<volatile int64_t*>(ptr)));
+  return old_value;
+}
+
+inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
+                                          Atomic64 increment) {
+  return OSAtomicAdd64(increment, reinterpret_cast<volatile int64_t*>(ptr));
+}
+
+inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,
+                                        Atomic64 increment) {
+  return OSAtomicAdd64Barrier(increment,
+                              reinterpret_cast<volatile int64_t*>(ptr));
+}
+
+inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  Atomic64 prev_value;
+  do {
+    if (OSAtomicCompareAndSwap64Barrier(
+        old_value, new_value, reinterpret_cast<volatile int64_t*>(ptr))) {
+      return old_value;
+    }
+    prev_value = *ptr;
+  } while (prev_value == old_value);
+  return prev_value;
+}
+
+inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  // The lib kern interface does not distinguish between
+  // Acquire and Release memory barriers; they are equivalent.
+  return Acquire_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;
+}
+
+inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
+  return *ptr;
+}
+
+inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
+  Atomic64 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+#endif  // defined(__LP64__)
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
new file mode 100644
index 00000000..dc468517
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
@@ -0,0 +1,187 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
+
+#define ATOMICOPS_COMPILER_BARRIER() __asm__ __volatile__("" : : : "memory")
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// Atomically execute:
+//      result = *ptr;
+//      if (*ptr == old_value)
+//        *ptr = new_value;
+//      return result;
+//
+// I.e., replace "*ptr" with "new_value" if "*ptr" used to be "old_value".
+// Always return the old value of "*ptr"
+//
+// This routine implies no memory barriers.
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  Atomic32 prev, tmp;
+  __asm__ __volatile__(".set push\n"
+                       ".set noreorder\n"
+                       "1:\n"
+                       "ll %0, %5\n"  // prev = *ptr
+                       "bne %0, %3, 2f\n"  // if (prev != old_value) goto 2
+                       "move %2, %4\n"  // tmp = new_value
+                       "sc %2, %1\n"  // *ptr = tmp (with atomic check)
+                       "beqz %2, 1b\n"  // start again on atomic error
+                       "nop\n"  // delay slot nop
+                       "2:\n"
+                       ".set pop\n"
+                       : "=&r" (prev), "=m" (*ptr), "=&r" (tmp)
+                       : "Ir" (old_value), "r" (new_value), "m" (*ptr)
+                       : "memory");
+  return prev;
+}
+
+// Atomically store new_value into *ptr, returning the previous value held in
+// *ptr.  This routine implies no memory barriers.
+inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
+                                         Atomic32 new_value) {
+  Atomic32 temp, old;
+  __asm__ __volatile__(".set push\n"
+                       ".set noreorder\n"
+                       "1:\n"
+                       "ll %1, %2\n"  // old = *ptr
+                       "move %0, %3\n"  // temp = new_value
+                       "sc %0, %2\n"  // *ptr = temp (with atomic check)
+                       "beqz %0, 1b\n"  // start again on atomic error
+                       "nop\n"  // delay slot nop
+                       ".set pop\n"
+                       : "=&r" (temp), "=&r" (old), "=m" (*ptr)
+                       : "r" (new_value), "m" (*ptr)
+                       : "memory");
+
+  return old;
+}
+
+// Atomically increment *ptr by "increment".  Returns the new value of
+// *ptr with the increment applied.  This routine implies no memory barriers.
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  Atomic32 temp, temp2;
+
+  __asm__ __volatile__(".set push\n"
+                       ".set noreorder\n"
+                       "1:\n"
+                       "ll %0, %2\n"  // temp = *ptr
+                       "addu %1, %0, %3\n"  // temp2 = temp + increment
+                       "sc %1, %2\n"  // *ptr = temp2 (with atomic check)
+                       "beqz %1, 1b\n"  // start again on atomic error
+                       "addu %1, %0, %3\n"  // temp2 = temp + increment
+                       ".set pop\n"
+                       : "=&r" (temp), "=&r" (temp2), "=m" (*ptr)
+                       : "Ir" (increment), "m" (*ptr)
+                       : "memory");
+  // temp2 now holds the final value.
+  return temp2;
+}
+
+inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                        Atomic32 increment) {
+  ATOMICOPS_COMPILER_BARRIER();
+  Atomic32 res = NoBarrier_AtomicIncrement(ptr, increment);
+  ATOMICOPS_COMPILER_BARRIER();
+  return res;
+}
+
+// "Acquire" operations
+// ensure that no later memory access can be reordered ahead of the operation.
+// "Release" operations ensure that no previous memory access can be reordered
+// after the operation.  "Barrier" operations have both "Acquire" and "Release"
+// semantics.   A MemoryBarrier() has "Barrier" semantics, but does no memory
+// access.
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  ATOMICOPS_COMPILER_BARRIER();
+  Atomic32 res = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+  ATOMICOPS_COMPILER_BARRIER();
+  return res;
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  ATOMICOPS_COMPILER_BARRIER();
+  Atomic32 res = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+  ATOMICOPS_COMPILER_BARRIER();
+  return res;
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+inline void MemoryBarrier() {
+  __asm__ __volatile__("sync" : : : "memory");
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#undef ATOMICOPS_COMPILER_BARRIER
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
new file mode 100644
index 00000000..04a91a83
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
@@ -0,0 +1,73 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  return __sync_val_compare_and_swap(ptr, old_value, new_value);
+}
+
+inline void MemoryBarrier() {
+  __sync_synchronize();
+}
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+  MemoryBarrier();
+  return ret;
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  MemoryBarrier();
+  *ptr = value;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  MemoryBarrier();
+  return value;
+}
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
new file mode 100644
index 00000000..5324dfbc
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
@@ -0,0 +1,293 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// This struct is not part of the public API of this module; clients may not
+// use it.
+// Features of this x86.  Values may not be correct before main() is run,
+// but are set conservatively.
+struct AtomicOps_x86CPUFeatureStruct {
+  bool has_amd_lock_mb_bug;  // Processor has AMD memory-barrier bug; do lfence
+                             // after acquire compare-and-swap.
+  bool has_sse2;             // Processor has SSE2.
+};
+extern struct AtomicOps_x86CPUFeatureStruct AtomicOps_Internalx86CPUFeatures;
+
+#define ATOMICOPS_COMPILER_BARRIER() __asm__ __volatile__("" : : : "memory")
+
+// 32-bit low-level operations on any platform.
+
+inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
+                                         Atomic32 old_value,
+                                         Atomic32 new_value) {
+  Atomic32 prev;
+  __asm__ __volatile__("lock; cmpxchgl %1,%2"
+                       : "=a" (prev)
+                       : "q" (new_value), "m" (*ptr), "0" (old_value)
+                       : "memory");
+  return prev;
+}
+
+inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
+                                         Atomic32 new_value) {
+  __asm__ __volatile__("xchgl %1,%0"  // The lock prefix is implicit for xchg.
+                       : "=r" (new_value)
+                       : "m" (*ptr), "0" (new_value)
+                       : "memory");
+  return new_value;  // Now it's the previous value.
+}
+
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  Atomic32 temp = increment;
+  __asm__ __volatile__("lock; xaddl %0,%1"
+                       : "+r" (temp), "+m" (*ptr)
+                       : : "memory");
+  // temp now holds the old value of *ptr
+  return temp + increment;
+}
+
+inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
+                                        Atomic32 increment) {
+  Atomic32 temp = increment;
+  __asm__ __volatile__("lock; xaddl %0,%1"
+                       : "+r" (temp), "+m" (*ptr)
+                       : : "memory");
+  // temp now holds the old value of *ptr
+  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
+    __asm__ __volatile__("lfence" : : : "memory");
+  }
+  return temp + increment;
+}
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  Atomic32 x = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
+    __asm__ __volatile__("lfence" : : : "memory");
+  }
+  return x;
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+#if defined(__x86_64__)
+
+// 64-bit implementations of memory barrier can be simpler, because it
+// "mfence" is guaranteed to exist.
+inline void MemoryBarrier() {
+  __asm__ __volatile__("mfence" : : : "memory");
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+#else
+
+inline void MemoryBarrier() {
+  if (AtomicOps_Internalx86CPUFeatures.has_sse2) {
+    __asm__ __volatile__("mfence" : : : "memory");
+  } else {  // mfence is faster but not present on PIII
+    Atomic32 x = 0;
+    NoBarrier_AtomicExchange(&x, 0);  // acts as a barrier on PIII
+  }
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  if (AtomicOps_Internalx86CPUFeatures.has_sse2) {
+    *ptr = value;
+    __asm__ __volatile__("mfence" : : : "memory");
+  } else {
+    NoBarrier_AtomicExchange(ptr, value);
+                          // acts as a barrier on PIII
+  }
+}
+#endif
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  ATOMICOPS_COMPILER_BARRIER();
+  *ptr = value;  // An x86 store acts as a release barrier.
+  // See comments in Atomic64 version of Release_Store(), below.
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;  // An x86 load acts as a acquire barrier.
+  // See comments in Atomic64 version of Release_Store(), below.
+  ATOMICOPS_COMPILER_BARRIER();
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+#if defined(__x86_64__)
+
+// 64-bit low-level operations on 64-bit platform.
+
+inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
+                                         Atomic64 old_value,
+                                         Atomic64 new_value) {
+  Atomic64 prev;
+  __asm__ __volatile__("lock; cmpxchgq %1,%2"
+                       : "=a" (prev)
+                       : "q" (new_value), "m" (*ptr), "0" (old_value)
+                       : "memory");
+  return prev;
+}
+
+inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,
+                                         Atomic64 new_value) {
+  __asm__ __volatile__("xchgq %1,%0"  // The lock prefix is implicit for xchg.
+                       : "=r" (new_value)
+                       : "m" (*ptr), "0" (new_value)
+                       : "memory");
+  return new_value;  // Now it's the previous value.
+}
+
+inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
+                                          Atomic64 increment) {
+  Atomic64 temp = increment;
+  __asm__ __volatile__("lock; xaddq %0,%1"
+                       : "+r" (temp), "+m" (*ptr)
+                       : : "memory");
+  // temp now contains the previous value of *ptr
+  return temp + increment;
+}
+
+inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,
+                                        Atomic64 increment) {
+  Atomic64 temp = increment;
+  __asm__ __volatile__("lock; xaddq %0,%1"
+                       : "+r" (temp), "+m" (*ptr)
+                       : : "memory");
+  // temp now contains the previous value of *ptr
+  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
+    __asm__ __volatile__("lfence" : : : "memory");
+  }
+  return temp + increment;
+}
+
+inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;
+}
+
+inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;
+  MemoryBarrier();
+}
+
+inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
+  ATOMICOPS_COMPILER_BARRIER();
+
+  *ptr = value;  // An x86 store acts as a release barrier
+                 // for current AMD/Intel chips as of Jan 2008.
+                 // See also Acquire_Load(), below.
+
+  // When new chips come out, check:
+  //  IA-32 Intel Architecture Software Developer's Manual, Volume 3:
+  //  System Programming Guide, Chatper 7: Multiple-processor management,
+  //  Section 7.2, Memory Ordering.
+  // Last seen at:
+  //   http://developer.intel.com/design/pentium4/manuals/index_new.htm
+  //
+  // x86 stores/loads fail to act as barriers for a few instructions (clflush
+  // maskmovdqu maskmovq movntdq movnti movntpd movntps movntq) but these are
+  // not generated by the compiler, and are rare.  Users of these instructions
+  // need to know about cache behaviour in any case since all of these involve
+  // either flushing cache lines or non-temporal cache hints.
+}
+
+inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
+  return *ptr;
+}
+
+inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
+  Atomic64 value = *ptr;  // An x86 load acts as a acquire barrier,
+                          // for current AMD/Intel chips as of Jan 2008.
+                          // See also Release_Store(), above.
+  ATOMICOPS_COMPILER_BARRIER();
+  return value;
+}
+
+inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  Atomic64 x = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
+    __asm__ __volatile__("lfence" : : : "memory");
+  }
+  return x;
+}
+
+inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+#endif  // defined(__x86_64__)
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#undef ATOMICOPS_COMPILER_BARRIER
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
new file mode 100644
index 00000000..6f9869d1
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
@@ -0,0 +1,150 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// This file is an internal atomic implementation, use atomicops.h instead.
+
+#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
+#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
+                                          Atomic32 increment) {
+  return Barrier_AtomicIncrement(ptr, increment);
+}
+
+#if !(defined(_MSC_VER) && _MSC_VER >= 1400)
+#error "We require at least vs2005 for MemoryBarrier"
+#endif
+
+inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
+                                       Atomic32 old_value,
+                                       Atomic32 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;
+}
+
+inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
+  NoBarrier_AtomicExchange(ptr, value);
+              // acts as a barrier in this implementation
+}
+
+inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
+  *ptr = value;  // works w/o barrier for current Intel chips as of June 2005
+  // See comments in Atomic64 version of Release_Store() below.
+}
+
+inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
+  return *ptr;
+}
+
+inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
+  Atomic32 value = *ptr;
+  return value;
+}
+
+inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+#if defined(_WIN64)
+
+// 64-bit low-level operations on 64-bit platform.
+
+inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
+                                          Atomic64 increment) {
+  return Barrier_AtomicIncrement(ptr, increment);
+}
+
+inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;
+}
+
+inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
+  NoBarrier_AtomicExchange(ptr, value);
+              // acts as a barrier in this implementation
+}
+
+inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
+  *ptr = value;  // works w/o barrier for current Intel chips as of June 2005
+
+  // When new chips come out, check:
+  //  IA-32 Intel Architecture Software Developer's Manual, Volume 3:
+  //  System Programming Guide, Chatper 7: Multiple-processor management,
+  //  Section 7.2, Memory Ordering.
+  // Last seen at:
+  //   http://developer.intel.com/design/pentium4/manuals/index_new.htm
+}
+
+inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
+  return *ptr;
+}
+
+inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
+  Atomic64 value = *ptr;
+  return value;
+}
+
+inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
+  MemoryBarrier();
+  return *ptr;
+}
+
+inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
+                                       Atomic64 old_value,
+                                       Atomic64 new_value) {
+  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
+}
+
+#endif  // defined(_WIN64)
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/common.h b/ps-lite/deps/include/google/protobuf/stubs/common.h
new file mode 100644
index 00000000..f287ddfb
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/common.h
@@ -0,0 +1,1223 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda) and others
+//
+// Contains basic types and utilities used by the rest of the library.
+
+#ifndef GOOGLE_PROTOBUF_COMMON_H__
+#define GOOGLE_PROTOBUF_COMMON_H__
+
+#include <assert.h>
+#include <stdlib.h>
+#include <cstddef>
+#include <string>
+#include <string.h>
+#if defined(__osf__)
+// Tru64 lacks stdint.h, but has inttypes.h which defines a superset of
+// what stdint.h would define.
+#include <inttypes.h>
+#elif !defined(_MSC_VER)
+#include <stdint.h>
+#endif
+
+#ifndef PROTOBUF_USE_EXCEPTIONS
+#if defined(_MSC_VER) && defined(_CPPUNWIND)
+  #define PROTOBUF_USE_EXCEPTIONS 1
+#elif defined(__EXCEPTIONS)
+  #define PROTOBUF_USE_EXCEPTIONS 1
+#else
+  #define PROTOBUF_USE_EXCEPTIONS 0
+#endif
+#endif
+
+#if PROTOBUF_USE_EXCEPTIONS
+#include <exception>
+#endif
+
+#if defined(_WIN32) && defined(GetMessage)
+// Allow GetMessage to be used as a valid method name in protobuf classes.
+// windows.h defines GetMessage() as a macro.  Let's re-define it as an inline
+// function.  The inline function should be equivalent for C++ users.
+inline BOOL GetMessage_Win32(
+    LPMSG lpMsg, HWND hWnd,
+    UINT wMsgFilterMin, UINT wMsgFilterMax) {
+  return GetMessage(lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax);
+}
+#undef GetMessage
+inline BOOL GetMessage(
+    LPMSG lpMsg, HWND hWnd,
+    UINT wMsgFilterMin, UINT wMsgFilterMax) {
+  return GetMessage_Win32(lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax);
+}
+#endif
+
+
+namespace std {}
+
+namespace google {
+namespace protobuf {
+
+#undef GOOGLE_DISALLOW_EVIL_CONSTRUCTORS
+#define GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(TypeName)    \
+  TypeName(const TypeName&);                           \
+  void operator=(const TypeName&)
+
+#if defined(_MSC_VER) && defined(PROTOBUF_USE_DLLS)
+  #ifdef LIBPROTOBUF_EXPORTS
+    #define LIBPROTOBUF_EXPORT __declspec(dllexport)
+  #else
+    #define LIBPROTOBUF_EXPORT __declspec(dllimport)
+  #endif
+  #ifdef LIBPROTOC_EXPORTS
+    #define LIBPROTOC_EXPORT   __declspec(dllexport)
+  #else
+    #define LIBPROTOC_EXPORT   __declspec(dllimport)
+  #endif
+#else
+  #define LIBPROTOBUF_EXPORT
+  #define LIBPROTOC_EXPORT
+#endif
+
+namespace internal {
+
+// Some of these constants are macros rather than const ints so that they can
+// be used in #if directives.
+
+// The current version, represented as a single integer to make comparison
+// easier:  major * 10^6 + minor * 10^3 + micro
+#define GOOGLE_PROTOBUF_VERSION 2005000
+
+// The minimum library version which works with the current version of the
+// headers.
+#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 2005000
+
+// The minimum header version which works with the current version of
+// the library.  This constant should only be used by protoc's C++ code
+// generator.
+static const int kMinHeaderVersionForLibrary = 2005000;
+
+// The minimum protoc version which works with the current version of the
+// headers.
+#define GOOGLE_PROTOBUF_MIN_PROTOC_VERSION 2005000
+
+// The minimum header version which works with the current version of
+// protoc.  This constant should only be used in VerifyVersion().
+static const int kMinHeaderVersionForProtoc = 2005000;
+
+// Verifies that the headers and libraries are compatible.  Use the macro
+// below to call this.
+void LIBPROTOBUF_EXPORT VerifyVersion(int headerVersion, int minLibraryVersion,
+                                      const char* filename);
+
+// Converts a numeric version number to a string.
+std::string LIBPROTOBUF_EXPORT VersionString(int version);
+
+}  // namespace internal
+
+// Place this macro in your main() function (or somewhere before you attempt
+// to use the protobuf library) to verify that the version you link against
+// matches the headers you compiled against.  If a version mismatch is
+// detected, the process will abort.
+#define GOOGLE_PROTOBUF_VERIFY_VERSION                                    \
+  ::google::protobuf::internal::VerifyVersion(                            \
+    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
+    __FILE__)
+
+// ===================================================================
+// from google3/base/port.h
+
+typedef unsigned int uint;
+
+#ifdef _MSC_VER
+typedef __int8  int8;
+typedef __int16 int16;
+typedef __int32 int32;
+typedef __int64 int64;
+
+typedef unsigned __int8  uint8;
+typedef unsigned __int16 uint16;
+typedef unsigned __int32 uint32;
+typedef unsigned __int64 uint64;
+#else
+typedef int8_t  int8;
+typedef int16_t int16;
+typedef int32_t int32;
+typedef int64_t int64;
+
+typedef uint8_t  uint8;
+typedef uint16_t uint16;
+typedef uint32_t uint32;
+typedef uint64_t uint64;
+#endif
+
+// long long macros to be used because gcc and vc++ use different suffixes,
+// and different size specifiers in format strings
+#undef GOOGLE_LONGLONG
+#undef GOOGLE_ULONGLONG
+#undef GOOGLE_LL_FORMAT
+
+#ifdef _MSC_VER
+#define GOOGLE_LONGLONG(x) x##I64
+#define GOOGLE_ULONGLONG(x) x##UI64
+#define GOOGLE_LL_FORMAT "I64"  // As in printf("%I64d", ...)
+#else
+#define GOOGLE_LONGLONG(x) x##LL
+#define GOOGLE_ULONGLONG(x) x##ULL
+#define GOOGLE_LL_FORMAT "ll"  // As in "%lld". Note that "q" is poor form also.
+#endif
+
+static const int32 kint32max = 0x7FFFFFFF;
+static const int32 kint32min = -kint32max - 1;
+static const int64 kint64max = GOOGLE_LONGLONG(0x7FFFFFFFFFFFFFFF);
+static const int64 kint64min = -kint64max - 1;
+static const uint32 kuint32max = 0xFFFFFFFFu;
+static const uint64 kuint64max = GOOGLE_ULONGLONG(0xFFFFFFFFFFFFFFFF);
+
+// -------------------------------------------------------------------
+// Annotations:  Some parts of the code have been annotated in ways that might
+//   be useful to some compilers or tools, but are not supported universally.
+//   You can #define these annotations yourself if the default implementation
+//   is not right for you.
+
+#ifndef GOOGLE_ATTRIBUTE_ALWAYS_INLINE
+#if defined(__GNUC__) && (__GNUC__ > 3 ||(__GNUC__ == 3 && __GNUC_MINOR__ >= 1))
+// For functions we want to force inline.
+// Introduced in gcc 3.1.
+#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE __attribute__ ((always_inline))
+#else
+// Other compilers will have to figure it out for themselves.
+#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE
+#endif
+#endif
+
+#ifndef GOOGLE_ATTRIBUTE_DEPRECATED
+#ifdef __GNUC__
+// If the method/variable/type is used anywhere, produce a warning.
+#define GOOGLE_ATTRIBUTE_DEPRECATED __attribute__((deprecated))
+#else
+#define GOOGLE_ATTRIBUTE_DEPRECATED
+#endif
+#endif
+
+#ifndef GOOGLE_PREDICT_TRUE
+#ifdef __GNUC__
+// Provided at least since GCC 3.0.
+#define GOOGLE_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
+#else
+#define GOOGLE_PREDICT_TRUE
+#endif
+#endif
+
+// Delimits a block of code which may write to memory which is simultaneously
+// written by other threads, but which has been determined to be thread-safe
+// (e.g. because it is an idempotent write).
+#ifndef GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN
+#define GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN()
+#endif
+#ifndef GOOGLE_SAFE_CONCURRENT_WRITES_END
+#define GOOGLE_SAFE_CONCURRENT_WRITES_END()
+#endif
+
+// ===================================================================
+// from google3/base/basictypes.h
+
+// The GOOGLE_ARRAYSIZE(arr) macro returns the # of elements in an array arr.
+// The expression is a compile-time constant, and therefore can be
+// used in defining new arrays, for example.
+//
+// GOOGLE_ARRAYSIZE catches a few type errors.  If you see a compiler error
+//
+//   "warning: division by zero in ..."
+//
+// when using GOOGLE_ARRAYSIZE, you are (wrongfully) giving it a pointer.
+// You should only use GOOGLE_ARRAYSIZE on statically allocated arrays.
+//
+// The following comments are on the implementation details, and can
+// be ignored by the users.
+//
+// ARRAYSIZE(arr) works by inspecting sizeof(arr) (the # of bytes in
+// the array) and sizeof(*(arr)) (the # of bytes in one array
+// element).  If the former is divisible by the latter, perhaps arr is
+// indeed an array, in which case the division result is the # of
+// elements in the array.  Otherwise, arr cannot possibly be an array,
+// and we generate a compiler error to prevent the code from
+// compiling.
+//
+// Since the size of bool is implementation-defined, we need to cast
+// !(sizeof(a) & sizeof(*(a))) to size_t in order to ensure the final
+// result has type size_t.
+//
+// This macro is not perfect as it wrongfully accepts certain
+// pointers, namely where the pointer size is divisible by the pointee
+// size.  Since all our code has to go through a 32-bit compiler,
+// where a pointer is 4 bytes, this means all pointers to a type whose
+// size is 3 or greater than 4 will be (righteously) rejected.
+//
+// Kudos to Jorg Brown for this simple and elegant implementation.
+
+#undef GOOGLE_ARRAYSIZE
+#define GOOGLE_ARRAYSIZE(a) \
+  ((sizeof(a) / sizeof(*(a))) / \
+   static_cast<size_t>(!(sizeof(a) % sizeof(*(a)))))
+
+namespace internal {
+
+// Use implicit_cast as a safe version of static_cast or const_cast
+// for upcasting in the type hierarchy (i.e. casting a pointer to Foo
+// to a pointer to SuperclassOfFoo or casting a pointer to Foo to
+// a const pointer to Foo).
+// When you use implicit_cast, the compiler checks that the cast is safe.
+// Such explicit implicit_casts are necessary in surprisingly many
+// situations where C++ demands an exact type match instead of an
+// argument type convertable to a target type.
+//
+// The From type can be inferred, so the preferred syntax for using
+// implicit_cast is the same as for static_cast etc.:
+//
+//   implicit_cast<ToType>(expr)
+//
+// implicit_cast would have been part of the C++ standard library,
+// but the proposal was submitted too late.  It will probably make
+// its way into the language in the future.
+template<typename To, typename From>
+inline To implicit_cast(From const &f) {
+  return f;
+}
+
+// When you upcast (that is, cast a pointer from type Foo to type
+// SuperclassOfFoo), it's fine to use implicit_cast<>, since upcasts
+// always succeed.  When you downcast (that is, cast a pointer from
+// type Foo to type SubclassOfFoo), static_cast<> isn't safe, because
+// how do you know the pointer is really of type SubclassOfFoo?  It
+// could be a bare Foo, or of type DifferentSubclassOfFoo.  Thus,
+// when you downcast, you should use this macro.  In debug mode, we
+// use dynamic_cast<> to double-check the downcast is legal (we die
+// if it's not).  In normal mode, we do the efficient static_cast<>
+// instead.  Thus, it's important to test in debug mode to make sure
+// the cast is legal!
+//    This is the only place in the code we should use dynamic_cast<>.
+// In particular, you SHOULDN'T be using dynamic_cast<> in order to
+// do RTTI (eg code like this:
+//    if (dynamic_cast<Subclass1>(foo)) HandleASubclass1Object(foo);
+//    if (dynamic_cast<Subclass2>(foo)) HandleASubclass2Object(foo);
+// You should design the code some other way not to need this.
+
+template<typename To, typename From>     // use like this: down_cast<T*>(foo);
+inline To down_cast(From* f) {                   // so we only accept pointers
+  // Ensures that To is a sub-type of From *.  This test is here only
+  // for compile-time type checking, and has no overhead in an
+  // optimized build at run-time, as it will be optimized away
+  // completely.
+  if (false) {
+    implicit_cast<From*, To>(0);
+  }
+
+#if !defined(NDEBUG) && !defined(GOOGLE_PROTOBUF_NO_RTTI)
+  assert(f == NULL || dynamic_cast<To>(f) != NULL);  // RTTI: debug mode only!
+#endif
+  return static_cast<To>(f);
+}
+
+}  // namespace internal
+
+// We made these internal so that they would show up as such in the docs,
+// but we don't want to stick "internal::" in front of them everywhere.
+using internal::implicit_cast;
+using internal::down_cast;
+
+// The COMPILE_ASSERT macro can be used to verify that a compile time
+// expression is true. For example, you could use it to verify the
+// size of a static array:
+//
+//   COMPILE_ASSERT(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES,
+//                  content_type_names_incorrect_size);
+//
+// or to make sure a struct is smaller than a certain size:
+//
+//   COMPILE_ASSERT(sizeof(foo) < 128, foo_too_large);
+//
+// The second argument to the macro is the name of the variable. If
+// the expression is false, most compilers will issue a warning/error
+// containing the name of the variable.
+
+namespace internal {
+
+template <bool>
+struct CompileAssert {
+};
+
+}  // namespace internal
+
+#undef GOOGLE_COMPILE_ASSERT
+#define GOOGLE_COMPILE_ASSERT(expr, msg) \
+  typedef ::google::protobuf::internal::CompileAssert<(bool(expr))> \
+          msg[bool(expr) ? 1 : -1]
+
+
+// Implementation details of COMPILE_ASSERT:
+//
+// - COMPILE_ASSERT works by defining an array type that has -1
+//   elements (and thus is invalid) when the expression is false.
+//
+// - The simpler definition
+//
+//     #define COMPILE_ASSERT(expr, msg) typedef char msg[(expr) ? 1 : -1]
+//
+//   does not work, as gcc supports variable-length arrays whose sizes
+//   are determined at run-time (this is gcc's extension and not part
+//   of the C++ standard).  As a result, gcc fails to reject the
+//   following code with the simple definition:
+//
+//     int foo;
+//     COMPILE_ASSERT(foo, msg); // not supposed to compile as foo is
+//                               // not a compile-time constant.
+//
+// - By using the type CompileAssert<(bool(expr))>, we ensures that
+//   expr is a compile-time constant.  (Template arguments must be
+//   determined at compile-time.)
+//
+// - The outter parentheses in CompileAssert<(bool(expr))> are necessary
+//   to work around a bug in gcc 3.4.4 and 4.0.1.  If we had written
+//
+//     CompileAssert<bool(expr)>
+//
+//   instead, these compilers will refuse to compile
+//
+//     COMPILE_ASSERT(5 > 0, some_message);
+//
+//   (They seem to think the ">" in "5 > 0" marks the end of the
+//   template argument list.)
+//
+// - The array size is (bool(expr) ? 1 : -1), instead of simply
+//
+//     ((expr) ? 1 : -1).
+//
+//   This is to avoid running into a bug in MS VC 7.1, which
+//   causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1.
+
+// ===================================================================
+// from google3/base/scoped_ptr.h
+
+namespace internal {
+
+//  This is an implementation designed to match the anticipated future TR2
+//  implementation of the scoped_ptr class, and its closely-related brethren,
+//  scoped_array, scoped_ptr_malloc, and make_scoped_ptr.
+
+template <class C> class scoped_ptr;
+template <class C> class scoped_array;
+
+// A scoped_ptr<T> is like a T*, except that the destructor of scoped_ptr<T>
+// automatically deletes the pointer it holds (if any).
+// That is, scoped_ptr<T> owns the T object that it points to.
+// Like a T*, a scoped_ptr<T> may hold either NULL or a pointer to a T object.
+//
+// The size of a scoped_ptr is small:
+// sizeof(scoped_ptr<C>) == sizeof(C*)
+template <class C>
+class scoped_ptr {
+ public:
+
+  // The element type
+  typedef C element_type;
+
+  // Constructor.  Defaults to intializing with NULL.
+  // There is no way to create an uninitialized scoped_ptr.
+  // The input parameter must be allocated with new.
+  explicit scoped_ptr(C* p = NULL) : ptr_(p) { }
+
+  // Destructor.  If there is a C object, delete it.
+  // We don't need to test ptr_ == NULL because C++ does that for us.
+  ~scoped_ptr() {
+    enum { type_must_be_complete = sizeof(C) };
+    delete ptr_;
+  }
+
+  // Reset.  Deletes the current owned object, if any.
+  // Then takes ownership of a new object, if given.
+  // this->reset(this->get()) works.
+  void reset(C* p = NULL) {
+    if (p != ptr_) {
+      enum { type_must_be_complete = sizeof(C) };
+      delete ptr_;
+      ptr_ = p;
+    }
+  }
+
+  // Accessors to get the owned object.
+  // operator* and operator-> will assert() if there is no current object.
+  C& operator*() const {
+    assert(ptr_ != NULL);
+    return *ptr_;
+  }
+  C* operator->() const  {
+    assert(ptr_ != NULL);
+    return ptr_;
+  }
+  C* get() const { return ptr_; }
+
+  // Comparison operators.
+  // These return whether two scoped_ptr refer to the same object, not just to
+  // two different but equal objects.
+  bool operator==(C* p) const { return ptr_ == p; }
+  bool operator!=(C* p) const { return ptr_ != p; }
+
+  // Swap two scoped pointers.
+  void swap(scoped_ptr& p2) {
+    C* tmp = ptr_;
+    ptr_ = p2.ptr_;
+    p2.ptr_ = tmp;
+  }
+
+  // Release a pointer.
+  // The return value is the current pointer held by this object.
+  // If this object holds a NULL pointer, the return value is NULL.
+  // After this operation, this object will hold a NULL pointer,
+  // and will not own the object any more.
+  C* release() {
+    C* retVal = ptr_;
+    ptr_ = NULL;
+    return retVal;
+  }
+
+ private:
+  C* ptr_;
+
+  // Forbid comparison of scoped_ptr types.  If C2 != C, it totally doesn't
+  // make sense, and if C2 == C, it still doesn't make sense because you should
+  // never have the same object owned by two different scoped_ptrs.
+  template <class C2> bool operator==(scoped_ptr<C2> const& p2) const;
+  template <class C2> bool operator!=(scoped_ptr<C2> const& p2) const;
+
+  // Disallow evil constructors
+  scoped_ptr(const scoped_ptr&);
+  void operator=(const scoped_ptr&);
+};
+
+// scoped_array<C> is like scoped_ptr<C>, except that the caller must allocate
+// with new [] and the destructor deletes objects with delete [].
+//
+// As with scoped_ptr<C>, a scoped_array<C> either points to an object
+// or is NULL.  A scoped_array<C> owns the object that it points to.
+//
+// Size: sizeof(scoped_array<C>) == sizeof(C*)
+template <class C>
+class scoped_array {
+ public:
+
+  // The element type
+  typedef C element_type;
+
+  // Constructor.  Defaults to intializing with NULL.
+  // There is no way to create an uninitialized scoped_array.
+  // The input parameter must be allocated with new [].
+  explicit scoped_array(C* p = NULL) : array_(p) { }
+
+  // Destructor.  If there is a C object, delete it.
+  // We don't need to test ptr_ == NULL because C++ does that for us.
+  ~scoped_array() {
+    enum { type_must_be_complete = sizeof(C) };
+    delete[] array_;
+  }
+
+  // Reset.  Deletes the current owned object, if any.
+  // Then takes ownership of a new object, if given.
+  // this->reset(this->get()) works.
+  void reset(C* p = NULL) {
+    if (p != array_) {
+      enum { type_must_be_complete = sizeof(C) };
+      delete[] array_;
+      array_ = p;
+    }
+  }
+
+  // Get one element of the current object.
+  // Will assert() if there is no current object, or index i is negative.
+  C& operator[](std::ptrdiff_t i) const {
+    assert(i >= 0);
+    assert(array_ != NULL);
+    return array_[i];
+  }
+
+  // Get a pointer to the zeroth element of the current object.
+  // If there is no current object, return NULL.
+  C* get() const {
+    return array_;
+  }
+
+  // Comparison operators.
+  // These return whether two scoped_array refer to the same object, not just to
+  // two different but equal objects.
+  bool operator==(C* p) const { return array_ == p; }
+  bool operator!=(C* p) const { return array_ != p; }
+
+  // Swap two scoped arrays.
+  void swap(scoped_array& p2) {
+    C* tmp = array_;
+    array_ = p2.array_;
+    p2.array_ = tmp;
+  }
+
+  // Release an array.
+  // The return value is the current pointer held by this object.
+  // If this object holds a NULL pointer, the return value is NULL.
+  // After this operation, this object will hold a NULL pointer,
+  // and will not own the object any more.
+  C* release() {
+    C* retVal = array_;
+    array_ = NULL;
+    return retVal;
+  }
+
+ private:
+  C* array_;
+
+  // Forbid comparison of different scoped_array types.
+  template <class C2> bool operator==(scoped_array<C2> const& p2) const;
+  template <class C2> bool operator!=(scoped_array<C2> const& p2) const;
+
+  // Disallow evil constructors
+  scoped_array(const scoped_array&);
+  void operator=(const scoped_array&);
+};
+
+}  // namespace internal
+
+// We made these internal so that they would show up as such in the docs,
+// but we don't want to stick "internal::" in front of them everywhere.
+using internal::scoped_ptr;
+using internal::scoped_array;
+
+// ===================================================================
+// emulates google3/base/logging.h
+
+enum LogLevel {
+  LOGLEVEL_INFO,     // Informational.  This is never actually used by
+                     // libprotobuf.
+  LOGLEVEL_WARNING,  // Warns about issues that, although not technically a
+                     // problem now, could cause problems in the future.  For
+                     // example, a // warning will be printed when parsing a
+                     // message that is near the message size limit.
+  LOGLEVEL_ERROR,    // An error occurred which should never happen during
+                     // normal use.
+  LOGLEVEL_FATAL,    // An error occurred from which the library cannot
+                     // recover.  This usually indicates a programming error
+                     // in the code which calls the library, especially when
+                     // compiled in debug mode.
+
+#ifdef NDEBUG
+  LOGLEVEL_DFATAL = LOGLEVEL_ERROR
+#else
+  LOGLEVEL_DFATAL = LOGLEVEL_FATAL
+#endif
+};
+
+namespace internal {
+
+class LogFinisher;
+
+class LIBPROTOBUF_EXPORT LogMessage {
+ public:
+  LogMessage(LogLevel level, const char* filename, int line);
+  ~LogMessage();
+
+  LogMessage& operator<<(const std::string& value);
+  LogMessage& operator<<(const char* value);
+  LogMessage& operator<<(char value);
+  LogMessage& operator<<(int value);
+  LogMessage& operator<<(uint value);
+  LogMessage& operator<<(long value);
+  LogMessage& operator<<(unsigned long value);
+  LogMessage& operator<<(double value);
+
+ private:
+  friend class LogFinisher;
+  void Finish();
+
+  LogLevel level_;
+  const char* filename_;
+  int line_;
+  std::string message_;
+};
+
+// Used to make the entire "LOG(BLAH) << etc." expression have a void return
+// type and print a newline after each message.
+class LIBPROTOBUF_EXPORT LogFinisher {
+ public:
+  void operator=(LogMessage& other);
+};
+
+}  // namespace internal
+
+// Undef everything in case we're being mixed with some other Google library
+// which already defined them itself.  Presumably all Google libraries will
+// support the same syntax for these so it should not be a big deal if they
+// end up using our definitions instead.
+#undef GOOGLE_LOG
+#undef GOOGLE_LOG_IF
+
+#undef GOOGLE_CHECK
+#undef GOOGLE_CHECK_EQ
+#undef GOOGLE_CHECK_NE
+#undef GOOGLE_CHECK_LT
+#undef GOOGLE_CHECK_LE
+#undef GOOGLE_CHECK_GT
+#undef GOOGLE_CHECK_GE
+#undef GOOGLE_CHECK_NOTNULL
+
+#undef GOOGLE_DLOG
+#undef GOOGLE_DCHECK
+#undef GOOGLE_DCHECK_EQ
+#undef GOOGLE_DCHECK_NE
+#undef GOOGLE_DCHECK_LT
+#undef GOOGLE_DCHECK_LE
+#undef GOOGLE_DCHECK_GT
+#undef GOOGLE_DCHECK_GE
+
+#define GOOGLE_LOG(LEVEL)                                                 \
+  ::google::protobuf::internal::LogFinisher() =                           \
+    ::google::protobuf::internal::LogMessage(                             \
+      ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
+#define GOOGLE_LOG_IF(LEVEL, CONDITION) \
+  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
+
+#define GOOGLE_CHECK(EXPRESSION) \
+  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
+#define GOOGLE_CHECK_EQ(A, B) GOOGLE_CHECK((A) == (B))
+#define GOOGLE_CHECK_NE(A, B) GOOGLE_CHECK((A) != (B))
+#define GOOGLE_CHECK_LT(A, B) GOOGLE_CHECK((A) <  (B))
+#define GOOGLE_CHECK_LE(A, B) GOOGLE_CHECK((A) <= (B))
+#define GOOGLE_CHECK_GT(A, B) GOOGLE_CHECK((A) >  (B))
+#define GOOGLE_CHECK_GE(A, B) GOOGLE_CHECK((A) >= (B))
+
+namespace internal {
+template<typename T>
+T* CheckNotNull(const char *file, int line, const char *name, T* val) {
+  if (val == NULL) {
+    GOOGLE_LOG(FATAL) << name;
+  }
+  return val;
+}
+}  // namespace internal
+#define GOOGLE_CHECK_NOTNULL(A) \
+  internal::CheckNotNull(__FILE__, __LINE__, "'" #A "' must not be NULL", (A))
+
+#ifdef NDEBUG
+
+#define GOOGLE_DLOG GOOGLE_LOG_IF(INFO, false)
+
+#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
+#define GOOGLE_DCHECK_EQ(A, B) GOOGLE_DCHECK((A) == (B))
+#define GOOGLE_DCHECK_NE(A, B) GOOGLE_DCHECK((A) != (B))
+#define GOOGLE_DCHECK_LT(A, B) GOOGLE_DCHECK((A) <  (B))
+#define GOOGLE_DCHECK_LE(A, B) GOOGLE_DCHECK((A) <= (B))
+#define GOOGLE_DCHECK_GT(A, B) GOOGLE_DCHECK((A) >  (B))
+#define GOOGLE_DCHECK_GE(A, B) GOOGLE_DCHECK((A) >= (B))
+
+#else  // NDEBUG
+
+#define GOOGLE_DLOG GOOGLE_LOG
+
+#define GOOGLE_DCHECK    GOOGLE_CHECK
+#define GOOGLE_DCHECK_EQ GOOGLE_CHECK_EQ
+#define GOOGLE_DCHECK_NE GOOGLE_CHECK_NE
+#define GOOGLE_DCHECK_LT GOOGLE_CHECK_LT
+#define GOOGLE_DCHECK_LE GOOGLE_CHECK_LE
+#define GOOGLE_DCHECK_GT GOOGLE_CHECK_GT
+#define GOOGLE_DCHECK_GE GOOGLE_CHECK_GE
+
+#endif  // !NDEBUG
+
+typedef void LogHandler(LogLevel level, const char* filename, int line,
+                        const std::string& message);
+
+// The protobuf library sometimes writes warning and error messages to
+// stderr.  These messages are primarily useful for developers, but may
+// also help end users figure out a problem.  If you would prefer that
+// these messages be sent somewhere other than stderr, call SetLogHandler()
+// to set your own handler.  This returns the old handler.  Set the handler
+// to NULL to ignore log messages (but see also LogSilencer, below).
+//
+// Obviously, SetLogHandler is not thread-safe.  You should only call it
+// at initialization time, and probably not from library code.  If you
+// simply want to suppress log messages temporarily (e.g. because you
+// have some code that tends to trigger them frequently and you know
+// the warnings are not important to you), use the LogSilencer class
+// below.
+LIBPROTOBUF_EXPORT LogHandler* SetLogHandler(LogHandler* new_func);
+
+// Create a LogSilencer if you want to temporarily suppress all log
+// messages.  As long as any LogSilencer objects exist, non-fatal
+// log messages will be discarded (the current LogHandler will *not*
+// be called).  Constructing a LogSilencer is thread-safe.  You may
+// accidentally suppress log messages occurring in another thread, but
+// since messages are generally for debugging purposes only, this isn't
+// a big deal.  If you want to intercept log messages, use SetLogHandler().
+class LIBPROTOBUF_EXPORT LogSilencer {
+ public:
+  LogSilencer();
+  ~LogSilencer();
+};
+
+// ===================================================================
+// emulates google3/base/callback.h
+
+// Abstract interface for a callback.  When calling an RPC, you must provide
+// a Closure to call when the procedure completes.  See the Service interface
+// in service.h.
+//
+// To automatically construct a Closure which calls a particular function or
+// method with a particular set of parameters, use the NewCallback() function.
+// Example:
+//   void FooDone(const FooResponse* response) {
+//     ...
+//   }
+//
+//   void CallFoo() {
+//     ...
+//     // When done, call FooDone() and pass it a pointer to the response.
+//     Closure* callback = NewCallback(&FooDone, response);
+//     // Make the call.
+//     service->Foo(controller, request, response, callback);
+//   }
+//
+// Example that calls a method:
+//   class Handler {
+//    public:
+//     ...
+//
+//     void FooDone(const FooResponse* response) {
+//       ...
+//     }
+//
+//     void CallFoo() {
+//       ...
+//       // When done, call FooDone() and pass it a pointer to the response.
+//       Closure* callback = NewCallback(this, &Handler::FooDone, response);
+//       // Make the call.
+//       service->Foo(controller, request, response, callback);
+//     }
+//   };
+//
+// Currently NewCallback() supports binding zero, one, or two arguments.
+//
+// Callbacks created with NewCallback() automatically delete themselves when
+// executed.  They should be used when a callback is to be called exactly
+// once (usually the case with RPC callbacks).  If a callback may be called
+// a different number of times (including zero), create it with
+// NewPermanentCallback() instead.  You are then responsible for deleting the
+// callback (using the "delete" keyword as normal).
+//
+// Note that NewCallback() is a bit touchy regarding argument types.  Generally,
+// the values you provide for the parameter bindings must exactly match the
+// types accepted by the callback function.  For example:
+//   void Foo(string s);
+//   NewCallback(&Foo, "foo");          // WON'T WORK:  const char* != string
+//   NewCallback(&Foo, string("foo"));  // WORKS
+// Also note that the arguments cannot be references:
+//   void Foo(const string& s);
+//   string my_str;
+//   NewCallback(&Foo, my_str);  // WON'T WORK:  Can't use referecnes.
+// However, correctly-typed pointers will work just fine.
+class LIBPROTOBUF_EXPORT Closure {
+ public:
+  Closure() {}
+  virtual ~Closure();
+
+  virtual void Run() = 0;
+
+ private:
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Closure);
+};
+
+namespace internal {
+
+class LIBPROTOBUF_EXPORT FunctionClosure0 : public Closure {
+ public:
+  typedef void (*FunctionType)();
+
+  FunctionClosure0(FunctionType function, bool self_deleting)
+    : function_(function), self_deleting_(self_deleting) {}
+  ~FunctionClosure0();
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    function_();
+    if (needs_delete) delete this;
+  }
+
+ private:
+  FunctionType function_;
+  bool self_deleting_;
+};
+
+template <typename Class>
+class MethodClosure0 : public Closure {
+ public:
+  typedef void (Class::*MethodType)();
+
+  MethodClosure0(Class* object, MethodType method, bool self_deleting)
+    : object_(object), method_(method), self_deleting_(self_deleting) {}
+  ~MethodClosure0() {}
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    (object_->*method_)();
+    if (needs_delete) delete this;
+  }
+
+ private:
+  Class* object_;
+  MethodType method_;
+  bool self_deleting_;
+};
+
+template <typename Arg1>
+class FunctionClosure1 : public Closure {
+ public:
+  typedef void (*FunctionType)(Arg1 arg1);
+
+  FunctionClosure1(FunctionType function, bool self_deleting,
+                   Arg1 arg1)
+    : function_(function), self_deleting_(self_deleting),
+      arg1_(arg1) {}
+  ~FunctionClosure1() {}
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    function_(arg1_);
+    if (needs_delete) delete this;
+  }
+
+ private:
+  FunctionType function_;
+  bool self_deleting_;
+  Arg1 arg1_;
+};
+
+template <typename Class, typename Arg1>
+class MethodClosure1 : public Closure {
+ public:
+  typedef void (Class::*MethodType)(Arg1 arg1);
+
+  MethodClosure1(Class* object, MethodType method, bool self_deleting,
+                 Arg1 arg1)
+    : object_(object), method_(method), self_deleting_(self_deleting),
+      arg1_(arg1) {}
+  ~MethodClosure1() {}
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    (object_->*method_)(arg1_);
+    if (needs_delete) delete this;
+  }
+
+ private:
+  Class* object_;
+  MethodType method_;
+  bool self_deleting_;
+  Arg1 arg1_;
+};
+
+template <typename Arg1, typename Arg2>
+class FunctionClosure2 : public Closure {
+ public:
+  typedef void (*FunctionType)(Arg1 arg1, Arg2 arg2);
+
+  FunctionClosure2(FunctionType function, bool self_deleting,
+                   Arg1 arg1, Arg2 arg2)
+    : function_(function), self_deleting_(self_deleting),
+      arg1_(arg1), arg2_(arg2) {}
+  ~FunctionClosure2() {}
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    function_(arg1_, arg2_);
+    if (needs_delete) delete this;
+  }
+
+ private:
+  FunctionType function_;
+  bool self_deleting_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+};
+
+template <typename Class, typename Arg1, typename Arg2>
+class MethodClosure2 : public Closure {
+ public:
+  typedef void (Class::*MethodType)(Arg1 arg1, Arg2 arg2);
+
+  MethodClosure2(Class* object, MethodType method, bool self_deleting,
+                 Arg1 arg1, Arg2 arg2)
+    : object_(object), method_(method), self_deleting_(self_deleting),
+      arg1_(arg1), arg2_(arg2) {}
+  ~MethodClosure2() {}
+
+  void Run() {
+    bool needs_delete = self_deleting_;  // read in case callback deletes
+    (object_->*method_)(arg1_, arg2_);
+    if (needs_delete) delete this;
+  }
+
+ private:
+  Class* object_;
+  MethodType method_;
+  bool self_deleting_;
+  Arg1 arg1_;
+  Arg2 arg2_;
+};
+
+}  // namespace internal
+
+// See Closure.
+inline Closure* NewCallback(void (*function)()) {
+  return new internal::FunctionClosure0(function, true);
+}
+
+// See Closure.
+inline Closure* NewPermanentCallback(void (*function)()) {
+  return new internal::FunctionClosure0(function, false);
+}
+
+// See Closure.
+template <typename Class>
+inline Closure* NewCallback(Class* object, void (Class::*method)()) {
+  return new internal::MethodClosure0<Class>(object, method, true);
+}
+
+// See Closure.
+template <typename Class>
+inline Closure* NewPermanentCallback(Class* object, void (Class::*method)()) {
+  return new internal::MethodClosure0<Class>(object, method, false);
+}
+
+// See Closure.
+template <typename Arg1>
+inline Closure* NewCallback(void (*function)(Arg1),
+                            Arg1 arg1) {
+  return new internal::FunctionClosure1<Arg1>(function, true, arg1);
+}
+
+// See Closure.
+template <typename Arg1>
+inline Closure* NewPermanentCallback(void (*function)(Arg1),
+                                     Arg1 arg1) {
+  return new internal::FunctionClosure1<Arg1>(function, false, arg1);
+}
+
+// See Closure.
+template <typename Class, typename Arg1>
+inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1),
+                            Arg1 arg1) {
+  return new internal::MethodClosure1<Class, Arg1>(object, method, true, arg1);
+}
+
+// See Closure.
+template <typename Class, typename Arg1>
+inline Closure* NewPermanentCallback(Class* object, void (Class::*method)(Arg1),
+                                     Arg1 arg1) {
+  return new internal::MethodClosure1<Class, Arg1>(object, method, false, arg1);
+}
+
+// See Closure.
+template <typename Arg1, typename Arg2>
+inline Closure* NewCallback(void (*function)(Arg1, Arg2),
+                            Arg1 arg1, Arg2 arg2) {
+  return new internal::FunctionClosure2<Arg1, Arg2>(
+    function, true, arg1, arg2);
+}
+
+// See Closure.
+template <typename Arg1, typename Arg2>
+inline Closure* NewPermanentCallback(void (*function)(Arg1, Arg2),
+                                     Arg1 arg1, Arg2 arg2) {
+  return new internal::FunctionClosure2<Arg1, Arg2>(
+    function, false, arg1, arg2);
+}
+
+// See Closure.
+template <typename Class, typename Arg1, typename Arg2>
+inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1, Arg2),
+                            Arg1 arg1, Arg2 arg2) {
+  return new internal::MethodClosure2<Class, Arg1, Arg2>(
+    object, method, true, arg1, arg2);
+}
+
+// See Closure.
+template <typename Class, typename Arg1, typename Arg2>
+inline Closure* NewPermanentCallback(
+    Class* object, void (Class::*method)(Arg1, Arg2),
+    Arg1 arg1, Arg2 arg2) {
+  return new internal::MethodClosure2<Class, Arg1, Arg2>(
+    object, method, false, arg1, arg2);
+}
+
+// A function which does nothing.  Useful for creating no-op callbacks, e.g.:
+//   Closure* nothing = NewCallback(&DoNothing);
+void LIBPROTOBUF_EXPORT DoNothing();
+
+// ===================================================================
+// emulates google3/base/mutex.h
+
+namespace internal {
+
+// A Mutex is a non-reentrant (aka non-recursive) mutex.  At most one thread T
+// may hold a mutex at a given time.  If T attempts to Lock() the same Mutex
+// while holding it, T will deadlock.
+class LIBPROTOBUF_EXPORT Mutex {
+ public:
+  // Create a Mutex that is not held by anybody.
+  Mutex();
+
+  // Destructor
+  ~Mutex();
+
+  // Block if necessary until this Mutex is free, then acquire it exclusively.
+  void Lock();
+
+  // Release this Mutex.  Caller must hold it exclusively.
+  void Unlock();
+
+  // Crash if this Mutex is not held exclusively by this thread.
+  // May fail to crash when it should; will never crash when it should not.
+  void AssertHeld();
+
+ private:
+  struct Internal;
+  Internal* mInternal;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Mutex);
+};
+
+// MutexLock(mu) acquires mu when constructed and releases it when destroyed.
+class LIBPROTOBUF_EXPORT MutexLock {
+ public:
+  explicit MutexLock(Mutex *mu) : mu_(mu) { this->mu_->Lock(); }
+  ~MutexLock() { this->mu_->Unlock(); }
+ private:
+  Mutex *const mu_;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MutexLock);
+};
+
+// TODO(kenton):  Implement these?  Hard to implement portably.
+typedef MutexLock ReaderMutexLock;
+typedef MutexLock WriterMutexLock;
+
+// MutexLockMaybe is like MutexLock, but is a no-op when mu is NULL.
+class LIBPROTOBUF_EXPORT MutexLockMaybe {
+ public:
+  explicit MutexLockMaybe(Mutex *mu) :
+    mu_(mu) { if (this->mu_ != NULL) { this->mu_->Lock(); } }
+  ~MutexLockMaybe() { if (this->mu_ != NULL) { this->mu_->Unlock(); } }
+ private:
+  Mutex *const mu_;
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MutexLockMaybe);
+};
+
+}  // namespace internal
+
+// We made these internal so that they would show up as such in the docs,
+// but we don't want to stick "internal::" in front of them everywhere.
+using internal::Mutex;
+using internal::MutexLock;
+using internal::ReaderMutexLock;
+using internal::WriterMutexLock;
+using internal::MutexLockMaybe;
+
+// ===================================================================
+// from google3/util/utf8/public/unilib.h
+
+namespace internal {
+
+// Checks if the buffer contains structurally-valid UTF-8.  Implemented in
+// structurally_valid.cc.
+LIBPROTOBUF_EXPORT bool IsStructurallyValidUTF8(const char* buf, int len);
+
+}  // namespace internal
+
+// ===================================================================
+// from google3/util/endian/endian.h
+LIBPROTOBUF_EXPORT uint32 ghtonl(uint32 x);
+
+// ===================================================================
+// Shutdown support.
+
+// Shut down the entire protocol buffers library, deleting all static-duration
+// objects allocated by the library or by generated .pb.cc files.
+//
+// There are two reasons you might want to call this:
+// * You use a draconian definition of "memory leak" in which you expect
+//   every single malloc() to have a corresponding free(), even for objects
+//   which live until program exit.
+// * You are writing a dynamically-loaded library which needs to clean up
+//   after itself when the library is unloaded.
+//
+// It is safe to call this multiple times.  However, it is not safe to use
+// any other part of the protocol buffers library after
+// ShutdownProtobufLibrary() has been called.
+LIBPROTOBUF_EXPORT void ShutdownProtobufLibrary();
+
+namespace internal {
+
+// Register a function to be called when ShutdownProtocolBuffers() is called.
+LIBPROTOBUF_EXPORT void OnShutdown(void (*func)());
+
+}  // namespace internal
+
+#if PROTOBUF_USE_EXCEPTIONS
+class FatalException : public std::exception {
+ public:
+  FatalException(const char* filename, int line, const std::string& message)
+      : filename_(filename), line_(line), message_(message) {}
+  virtual ~FatalException() throw();
+
+  virtual const char* what() const throw();
+
+  const char* filename() const { return filename_; }
+  int line() const { return line_; }
+  const std::string& message() const { return message_; }
+
+ private:
+  const char* filename_;
+  const int line_;
+  const std::string message_;
+};
+#endif
+
+// This is at the end of the file instead of the beginning to work around a bug
+// in some versions of MSVC.
+using namespace std;  // Don't do this at home, kids.
+
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_COMMON_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/once.h b/ps-lite/deps/include/google/protobuf/stubs/once.h
new file mode 100644
index 00000000..7fbc117f
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/once.h
@@ -0,0 +1,148 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//
+// emulates google3/base/once.h
+//
+// This header is intended to be included only by internal .cc files and
+// generated .pb.cc files.  Users should not use this directly.
+//
+// This is basically a portable version of pthread_once().
+//
+// This header declares:
+// * A type called ProtobufOnceType.
+// * A macro GOOGLE_PROTOBUF_DECLARE_ONCE() which declares a variable of type
+//   ProtobufOnceType.  This is the only legal way to declare such a variable.
+//   The macro may only be used at the global scope (you cannot create local or
+//   class member variables of this type).
+// * A function GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()).
+//   This function, when invoked multiple times given the same ProtobufOnceType
+//   object, will invoke init_func on the first call only, and will make sure
+//   none of the calls return before that first call to init_func has finished.
+// * The user can provide a parameter which GoogleOnceInit() forwards to the
+//   user-provided function when it is called. Usage example:
+//     int a = 10;
+//     GoogleOnceInit(&my_once, &MyFunctionExpectingIntArgument, &a);
+// * This implementation guarantees that ProtobufOnceType is a POD (i.e. no
+//   static initializer generated).
+//
+// This implements a way to perform lazy initialization.  It's more efficient
+// than using mutexes as no lock is needed if initialization has already
+// happened.
+//
+// Example usage:
+//   void Init();
+//   GOOGLE_PROTOBUF_DECLARE_ONCE(once_init);
+//
+//   // Calls Init() exactly once.
+//   void InitOnce() {
+//     GoogleOnceInit(&once_init, &Init);
+//   }
+//
+// Note that if GoogleOnceInit() is called before main() has begun, it must
+// only be called by the thread that will eventually call main() -- that is,
+// the thread that performs dynamic initialization.  In general this is a safe
+// assumption since people don't usually construct threads before main() starts,
+// but it is technically not guaranteed.  Unfortunately, Win32 provides no way
+// whatsoever to statically-initialize its synchronization primitives, so our
+// only choice is to assume that dynamic initialization is single-threaded.
+
+#ifndef GOOGLE_PROTOBUF_STUBS_ONCE_H__
+#define GOOGLE_PROTOBUF_STUBS_ONCE_H__
+
+#include <google/protobuf/stubs/atomicops.h>
+#include <google/protobuf/stubs/common.h>
+
+namespace google {
+namespace protobuf {
+
+#ifdef GOOGLE_PROTOBUF_NO_THREAD_SAFETY
+
+typedef bool ProtobufOnceType;
+
+#define GOOGLE_PROTOBUF_ONCE_INIT false
+
+inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {
+  if (!*once) {
+    *once = true;
+    init_func();
+  }
+}
+
+template <typename Arg>
+inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg),
+    Arg arg) {
+  if (!*once) {
+    *once = true;
+    init_func(arg);
+  }
+}
+
+#else
+
+enum {
+  ONCE_STATE_UNINITIALIZED = 0,
+  ONCE_STATE_EXECUTING_CLOSURE = 1,
+  ONCE_STATE_DONE = 2
+};
+
+typedef internal::AtomicWord ProtobufOnceType;
+
+#define GOOGLE_PROTOBUF_ONCE_INIT ::google::protobuf::ONCE_STATE_UNINITIALIZED
+
+LIBPROTOBUF_EXPORT
+void GoogleOnceInitImpl(ProtobufOnceType* once, Closure* closure);
+
+inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {
+  if (internal::Acquire_Load(once) != ONCE_STATE_DONE) {
+    internal::FunctionClosure0 func(init_func, false);
+    GoogleOnceInitImpl(once, &func);
+  }
+}
+
+template <typename Arg>
+inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg*),
+    Arg* arg) {
+  if (internal::Acquire_Load(once) != ONCE_STATE_DONE) {
+    internal::FunctionClosure1<Arg*> func(init_func, false, arg);
+    GoogleOnceInitImpl(once, &func);
+  }
+}
+
+#endif  // GOOGLE_PROTOBUF_NO_THREAD_SAFETY
+
+#define GOOGLE_PROTOBUF_DECLARE_ONCE(NAME) \
+  ::google::protobuf::ProtobufOnceType NAME = GOOGLE_PROTOBUF_ONCE_INIT
+
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_STUBS_ONCE_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h b/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
new file mode 100644
index 00000000..b1df60e4
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
@@ -0,0 +1,70 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2012 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+#ifndef GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
+#define GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
+
+#include <google/protobuf/stubs/common.h>
+
+// Processor architecture detection.  For more info on what's defined, see:
+//   http://msdn.microsoft.com/en-us/library/b0084kay.aspx
+//   http://www.agner.org/optimize/calling_conventions.pdf
+//   or with gcc, run: "echo | gcc -E -dM -"
+#if defined(_M_X64) || defined(__x86_64__)
+#define GOOGLE_PROTOBUF_ARCH_X64 1
+#define GOOGLE_PROTOBUF_ARCH_64_BIT 1
+#elif defined(_M_IX86) || defined(__i386__)
+#define GOOGLE_PROTOBUF_ARCH_IA32 1
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#elif defined(__QNX__)
+#define GOOGLE_PROTOBUF_ARCH_ARM_QNX 1
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#elif defined(__ARMEL__)
+#define GOOGLE_PROTOBUF_ARCH_ARM 1
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#elif defined(__MIPSEL__)
+#define GOOGLE_PROTOBUF_ARCH_MIPS 1
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#elif defined(__pnacl__)
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#elif defined(__ppc__)
+#define GOOGLE_PROTOBUF_ARCH_PPC 1
+#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
+#else
+#error Host architecture was not detected as supported by protobuf
+#endif
+
+#if defined(__APPLE__)
+#define GOOGLE_PROTOBUF_OS_APPLE
+#elif defined(__native_client__)
+#define GOOGLE_PROTOBUF_OS_NACL
+#endif
+
+#endif  // GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/template_util.h b/ps-lite/deps/include/google/protobuf/stubs/template_util.h
new file mode 100644
index 00000000..4f30ffa3
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/template_util.h
@@ -0,0 +1,138 @@
+// Copyright 2005 Google Inc.
+// All rights reserved.
+//
+// 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.
+
+// ----
+// Author: lar@google.com (Laramie Leavitt)
+//
+// Template metaprogramming utility functions.
+//
+// This code is compiled directly on many platforms, including client
+// platforms like Windows, Mac, and embedded systems.  Before making
+// any changes here, make sure that you're not breaking any platforms.
+//
+//
+// The names choosen here reflect those used in tr1 and the boost::mpl
+// library, there are similar operations used in the Loki library as
+// well.  I prefer the boost names for 2 reasons:
+// 1.  I think that portions of the Boost libraries are more likely to
+// be included in the c++ standard.
+// 2.  It is not impossible that some of the boost libraries will be
+// included in our own build in the future.
+// Both of these outcomes means that we may be able to directly replace
+// some of these with boost equivalents.
+//
+#ifndef GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
+#define GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// Types small_ and big_ are guaranteed such that sizeof(small_) <
+// sizeof(big_)
+typedef char small_;
+
+struct big_ {
+  char dummy[2];
+};
+
+// Identity metafunction.
+template <class T>
+struct identity_ {
+  typedef T type;
+};
+
+// integral_constant, defined in tr1, is a wrapper for an integer
+// value. We don't really need this generality; we could get away
+// with hardcoding the integer type to bool. We use the fully
+// general integer_constant for compatibility with tr1.
+
+template<class T, T v>
+struct integral_constant {
+  static const T value = v;
+  typedef T value_type;
+  typedef integral_constant<T, v> type;
+};
+
+template <class T, T v> const T integral_constant<T, v>::value;
+
+
+// Abbreviations: true_type and false_type are structs that represent boolean
+// true and false values. Also define the boost::mpl versions of those names,
+// true_ and false_.
+typedef integral_constant<bool, true>  true_type;
+typedef integral_constant<bool, false> false_type;
+typedef true_type  true_;
+typedef false_type false_;
+
+// if_ is a templatized conditional statement.
+// if_<cond, A, B> is a compile time evaluation of cond.
+// if_<>::type contains A if cond is true, B otherwise.
+template<bool cond, typename A, typename B>
+struct if_{
+  typedef A type;
+};
+
+template<typename A, typename B>
+struct if_<false, A, B> {
+  typedef B type;
+};
+
+
+// type_equals_ is a template type comparator, similar to Loki IsSameType.
+// type_equals_<A, B>::value is true iff "A" is the same type as "B".
+//
+// New code should prefer base::is_same, defined in base/type_traits.h.
+// It is functionally identical, but is_same is the standard spelling.
+template<typename A, typename B>
+struct type_equals_ : public false_ {
+};
+
+template<typename A>
+struct type_equals_<A, A> : public true_ {
+};
+
+// and_ is a template && operator.
+// and_<A, B>::value evaluates "A::value && B::value".
+template<typename A, typename B>
+struct and_ : public integral_constant<bool, (A::value && B::value)> {
+};
+
+// or_ is a template || operator.
+// or_<A, B>::value evaluates "A::value || B::value".
+template<typename A, typename B>
+struct or_ : public integral_constant<bool, (A::value || B::value)> {
+};
+
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/type_traits.h b/ps-lite/deps/include/google/protobuf/stubs/type_traits.h
new file mode 100644
index 00000000..e41f5e6f
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/stubs/type_traits.h
@@ -0,0 +1,336 @@
+// Copyright (c) 2006, Google Inc.
+// All rights reserved.
+//
+// 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.
+
+// ----
+// Author: Matt Austern
+//
+// This code is compiled directly on many platforms, including client
+// platforms like Windows, Mac, and embedded systems.  Before making
+// any changes here, make sure that you're not breaking any platforms.
+//
+// Define a small subset of tr1 type traits. The traits we define are:
+//   is_integral
+//   is_floating_point
+//   is_pointer
+//   is_enum
+//   is_reference
+//   is_pod
+//   has_trivial_constructor
+//   has_trivial_copy
+//   has_trivial_assign
+//   has_trivial_destructor
+//   remove_const
+//   remove_volatile
+//   remove_cv
+//   remove_reference
+//   add_reference
+//   remove_pointer
+//   is_same
+//   is_convertible
+// We can add more type traits as required.
+
+#ifndef GOOGLE_PROTOBUF_TYPE_TRAITS_H_
+#define GOOGLE_PROTOBUF_TYPE_TRAITS_H_
+
+#include <utility>                  // For pair
+
+#include <google/protobuf/stubs/template_util.h>  // For true_type and false_type
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+template <class T> struct is_integral;
+template <class T> struct is_floating_point;
+template <class T> struct is_pointer;
+// MSVC can't compile this correctly, and neither can gcc 3.3.5 (at least)
+#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
+// is_enum uses is_convertible, which is not available on MSVC.
+template <class T> struct is_enum;
+#endif
+template <class T> struct is_reference;
+template <class T> struct is_pod;
+template <class T> struct has_trivial_constructor;
+template <class T> struct has_trivial_copy;
+template <class T> struct has_trivial_assign;
+template <class T> struct has_trivial_destructor;
+template <class T> struct remove_const;
+template <class T> struct remove_volatile;
+template <class T> struct remove_cv;
+template <class T> struct remove_reference;
+template <class T> struct add_reference;
+template <class T> struct remove_pointer;
+template <class T, class U> struct is_same;
+#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
+template <class From, class To> struct is_convertible;
+#endif
+
+// is_integral is false except for the built-in integer types. A
+// cv-qualified type is integral if and only if the underlying type is.
+template <class T> struct is_integral : false_type { };
+template<> struct is_integral<bool> : true_type { };
+template<> struct is_integral<char> : true_type { };
+template<> struct is_integral<unsigned char> : true_type { };
+template<> struct is_integral<signed char> : true_type { };
+#if defined(_MSC_VER)
+// wchar_t is not by default a distinct type from unsigned short in
+// Microsoft C.
+// See http://msdn2.microsoft.com/en-us/library/dh8che7s(VS.80).aspx
+template<> struct is_integral<__wchar_t> : true_type { };
+#else
+template<> struct is_integral<wchar_t> : true_type { };
+#endif
+template<> struct is_integral<short> : true_type { };
+template<> struct is_integral<unsigned short> : true_type { };
+template<> struct is_integral<int> : true_type { };
+template<> struct is_integral<unsigned int> : true_type { };
+template<> struct is_integral<long> : true_type { };
+template<> struct is_integral<unsigned long> : true_type { };
+#ifdef HAVE_LONG_LONG
+template<> struct is_integral<long long> : true_type { };
+template<> struct is_integral<unsigned long long> : true_type { };
+#endif
+template <class T> struct is_integral<const T> : is_integral<T> { };
+template <class T> struct is_integral<volatile T> : is_integral<T> { };
+template <class T> struct is_integral<const volatile T> : is_integral<T> { };
+
+// is_floating_point is false except for the built-in floating-point types.
+// A cv-qualified type is integral if and only if the underlying type is.
+template <class T> struct is_floating_point : false_type { };
+template<> struct is_floating_point<float> : true_type { };
+template<> struct is_floating_point<double> : true_type { };
+template<> struct is_floating_point<long double> : true_type { };
+template <class T> struct is_floating_point<const T>
+    : is_floating_point<T> { };
+template <class T> struct is_floating_point<volatile T>
+    : is_floating_point<T> { };
+template <class T> struct is_floating_point<const volatile T>
+    : is_floating_point<T> { };
+
+// is_pointer is false except for pointer types. A cv-qualified type (e.g.
+// "int* const", as opposed to "int const*") is cv-qualified if and only if
+// the underlying type is.
+template <class T> struct is_pointer : false_type { };
+template <class T> struct is_pointer<T*> : true_type { };
+template <class T> struct is_pointer<const T> : is_pointer<T> { };
+template <class T> struct is_pointer<volatile T> : is_pointer<T> { };
+template <class T> struct is_pointer<const volatile T> : is_pointer<T> { };
+
+#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
+
+namespace internal {
+
+template <class T> struct is_class_or_union {
+  template <class U> static small_ tester(void (U::*)());
+  template <class U> static big_ tester(...);
+  static const bool value = sizeof(tester<T>(0)) == sizeof(small_);
+};
+
+// is_convertible chokes if the first argument is an array. That's why
+// we use add_reference here.
+template <bool NotUnum, class T> struct is_enum_impl
+    : is_convertible<typename add_reference<T>::type, int> { };
+
+template <class T> struct is_enum_impl<true, T> : false_type { };
+
+}  // namespace internal
+
+// Specified by TR1 [4.5.1] primary type categories.
+
+// Implementation note:
+//
+// Each type is either void, integral, floating point, array, pointer,
+// reference, member object pointer, member function pointer, enum,
+// union or class. Out of these, only integral, floating point, reference,
+// class and enum types are potentially convertible to int. Therefore,
+// if a type is not a reference, integral, floating point or class and
+// is convertible to int, it's a enum. Adding cv-qualification to a type
+// does not change whether it's an enum.
+//
+// Is-convertible-to-int check is done only if all other checks pass,
+// because it can't be used with some types (e.g. void or classes with
+// inaccessible conversion operators).
+template <class T> struct is_enum
+    : internal::is_enum_impl<
+          is_same<T, void>::value ||
+              is_integral<T>::value ||
+              is_floating_point<T>::value ||
+              is_reference<T>::value ||
+              internal::is_class_or_union<T>::value,
+          T> { };
+
+template <class T> struct is_enum<const T> : is_enum<T> { };
+template <class T> struct is_enum<volatile T> : is_enum<T> { };
+template <class T> struct is_enum<const volatile T> : is_enum<T> { };
+
+#endif
+
+// is_reference is false except for reference types.
+template<typename T> struct is_reference : false_type {};
+template<typename T> struct is_reference<T&> : true_type {};
+
+
+// We can't get is_pod right without compiler help, so fail conservatively.
+// We will assume it's false except for arithmetic types, enumerations,
+// pointers and cv-qualified versions thereof. Note that std::pair<T,U>
+// is not a POD even if T and U are PODs.
+template <class T> struct is_pod
+ : integral_constant<bool, (is_integral<T>::value ||
+                            is_floating_point<T>::value ||
+#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
+                            // is_enum is not available on MSVC.
+                            is_enum<T>::value ||
+#endif
+                            is_pointer<T>::value)> { };
+template <class T> struct is_pod<const T> : is_pod<T> { };
+template <class T> struct is_pod<volatile T> : is_pod<T> { };
+template <class T> struct is_pod<const volatile T> : is_pod<T> { };
+
+
+// We can't get has_trivial_constructor right without compiler help, so
+// fail conservatively. We will assume it's false except for: (1) types
+// for which is_pod is true. (2) std::pair of types with trivial
+// constructors. (3) array of a type with a trivial constructor.
+// (4) const versions thereof.
+template <class T> struct has_trivial_constructor : is_pod<T> { };
+template <class T, class U> struct has_trivial_constructor<std::pair<T, U> >
+  : integral_constant<bool,
+                      (has_trivial_constructor<T>::value &&
+                       has_trivial_constructor<U>::value)> { };
+template <class A, int N> struct has_trivial_constructor<A[N]>
+  : has_trivial_constructor<A> { };
+template <class T> struct has_trivial_constructor<const T>
+  : has_trivial_constructor<T> { };
+
+// We can't get has_trivial_copy right without compiler help, so fail
+// conservatively. We will assume it's false except for: (1) types
+// for which is_pod is true. (2) std::pair of types with trivial copy
+// constructors. (3) array of a type with a trivial copy constructor.
+// (4) const versions thereof.
+template <class T> struct has_trivial_copy : is_pod<T> { };
+template <class T, class U> struct has_trivial_copy<std::pair<T, U> >
+  : integral_constant<bool,
+                      (has_trivial_copy<T>::value &&
+                       has_trivial_copy<U>::value)> { };
+template <class A, int N> struct has_trivial_copy<A[N]>
+  : has_trivial_copy<A> { };
+template <class T> struct has_trivial_copy<const T> : has_trivial_copy<T> { };
+
+// We can't get has_trivial_assign right without compiler help, so fail
+// conservatively. We will assume it's false except for: (1) types
+// for which is_pod is true. (2) std::pair of types with trivial copy
+// constructors. (3) array of a type with a trivial assign constructor.
+template <class T> struct has_trivial_assign : is_pod<T> { };
+template <class T, class U> struct has_trivial_assign<std::pair<T, U> >
+  : integral_constant<bool,
+                      (has_trivial_assign<T>::value &&
+                       has_trivial_assign<U>::value)> { };
+template <class A, int N> struct has_trivial_assign<A[N]>
+  : has_trivial_assign<A> { };
+
+// We can't get has_trivial_destructor right without compiler help, so
+// fail conservatively. We will assume it's false except for: (1) types
+// for which is_pod is true. (2) std::pair of types with trivial
+// destructors. (3) array of a type with a trivial destructor.
+// (4) const versions thereof.
+template <class T> struct has_trivial_destructor : is_pod<T> { };
+template <class T, class U> struct has_trivial_destructor<std::pair<T, U> >
+  : integral_constant<bool,
+                      (has_trivial_destructor<T>::value &&
+                       has_trivial_destructor<U>::value)> { };
+template <class A, int N> struct has_trivial_destructor<A[N]>
+  : has_trivial_destructor<A> { };
+template <class T> struct has_trivial_destructor<const T>
+  : has_trivial_destructor<T> { };
+
+// Specified by TR1 [4.7.1]
+template<typename T> struct remove_const { typedef T type; };
+template<typename T> struct remove_const<T const> { typedef T type; };
+template<typename T> struct remove_volatile { typedef T type; };
+template<typename T> struct remove_volatile<T volatile> { typedef T type; };
+template<typename T> struct remove_cv {
+  typedef typename remove_const<typename remove_volatile<T>::type>::type type;
+};
+
+
+// Specified by TR1 [4.7.2] Reference modifications.
+template<typename T> struct remove_reference { typedef T type; };
+template<typename T> struct remove_reference<T&> { typedef T type; };
+
+template <typename T> struct add_reference { typedef T& type; };
+template <typename T> struct add_reference<T&> { typedef T& type; };
+
+// Specified by TR1 [4.7.4] Pointer modifications.
+template<typename T> struct remove_pointer { typedef T type; };
+template<typename T> struct remove_pointer<T*> { typedef T type; };
+template<typename T> struct remove_pointer<T* const> { typedef T type; };
+template<typename T> struct remove_pointer<T* volatile> { typedef T type; };
+template<typename T> struct remove_pointer<T* const volatile> {
+  typedef T type; };
+
+// Specified by TR1 [4.6] Relationships between types
+template<typename T, typename U> struct is_same : public false_type { };
+template<typename T> struct is_same<T, T> : public true_type { };
+
+// Specified by TR1 [4.6] Relationships between types
+#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
+namespace internal {
+
+// This class is an implementation detail for is_convertible, and you
+// don't need to know how it works to use is_convertible. For those
+// who care: we declare two different functions, one whose argument is
+// of type To and one with a variadic argument list. We give them
+// return types of different size, so we can use sizeof to trick the
+// compiler into telling us which function it would have chosen if we
+// had called it with an argument of type From.  See Alexandrescu's
+// _Modern C++ Design_ for more details on this sort of trick.
+
+template <typename From, typename To>
+struct ConvertHelper {
+  static small_ Test(To);
+  static big_ Test(...);
+  static From Create();
+};
+}  // namespace internal
+
+// Inherits from true_type if From is convertible to To, false_type otherwise.
+template <typename From, typename To>
+struct is_convertible
+    : integral_constant<bool,
+                        sizeof(internal::ConvertHelper<From, To>::Test(
+                                  internal::ConvertHelper<From, To>::Create()))
+                        == sizeof(small_)> {
+};
+#endif
+
+}  // namespace internal
+}  // namespace protobuf
+}  // namespace google
+
+#endif  // GOOGLE_PROTOBUF_TYPE_TRAITS_H_
diff --git a/ps-lite/deps/include/google/protobuf/text_format.h b/ps-lite/deps/include/google/protobuf/text_format.h
new file mode 100644
index 00000000..01f3ffb0
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/text_format.h
@@ -0,0 +1,369 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: jschorr@google.com (Joseph Schorr)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Utilities for printing and parsing protocol messages in a human-readable,
+// text-based format.
+
+#ifndef GOOGLE_PROTOBUF_TEXT_FORMAT_H__
+#define GOOGLE_PROTOBUF_TEXT_FORMAT_H__
+
+#include <map>
+#include <string>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/message.h>
+#include <google/protobuf/descriptor.h>
+
+namespace google {
+namespace protobuf {
+
+namespace io {
+  class ErrorCollector;      // tokenizer.h
+}
+
+// This class implements protocol buffer text format.  Printing and parsing
+// protocol messages in text format is useful for debugging and human editing
+// of messages.
+//
+// This class is really a namespace that contains only static methods.
+class LIBPROTOBUF_EXPORT TextFormat {
+ public:
+  // Outputs a textual representation of the given message to the given
+  // output stream.
+  static bool Print(const Message& message, io::ZeroCopyOutputStream* output);
+
+  // Print the fields in an UnknownFieldSet.  They are printed by tag number
+  // only.  Embedded messages are heuristically identified by attempting to
+  // parse them.
+  static bool PrintUnknownFields(const UnknownFieldSet& unknown_fields,
+                                 io::ZeroCopyOutputStream* output);
+
+  // Like Print(), but outputs directly to a string.
+  static bool PrintToString(const Message& message, string* output);
+
+  // Like PrintUnknownFields(), but outputs directly to a string.
+  static bool PrintUnknownFieldsToString(const UnknownFieldSet& unknown_fields,
+                                         string* output);
+
+  // Outputs a textual representation of the value of the field supplied on
+  // the message supplied. For non-repeated fields, an index of -1 must
+  // be supplied. Note that this method will print the default value for a
+  // field if it is not set.
+  static void PrintFieldValueToString(const Message& message,
+                                      const FieldDescriptor* field,
+                                      int index,
+                                      string* output);
+
+  // Class for those users which require more fine-grained control over how
+  // a protobuffer message is printed out.
+  class LIBPROTOBUF_EXPORT Printer {
+   public:
+    Printer();
+    ~Printer();
+
+    // Like TextFormat::Print
+    bool Print(const Message& message, io::ZeroCopyOutputStream* output) const;
+    // Like TextFormat::PrintUnknownFields
+    bool PrintUnknownFields(const UnknownFieldSet& unknown_fields,
+                            io::ZeroCopyOutputStream* output) const;
+    // Like TextFormat::PrintToString
+    bool PrintToString(const Message& message, string* output) const;
+    // Like TextFormat::PrintUnknownFieldsToString
+    bool PrintUnknownFieldsToString(const UnknownFieldSet& unknown_fields,
+                                    string* output) const;
+    // Like TextFormat::PrintFieldValueToString
+    void PrintFieldValueToString(const Message& message,
+                                 const FieldDescriptor* field,
+                                 int index,
+                                 string* output) const;
+
+    // Adjust the initial indent level of all output.  Each indent level is
+    // equal to two spaces.
+    void SetInitialIndentLevel(int indent_level) {
+      initial_indent_level_ = indent_level;
+    }
+
+    // If printing in single line mode, then the entire message will be output
+    // on a single line with no line breaks.
+    void SetSingleLineMode(bool single_line_mode) {
+      single_line_mode_ = single_line_mode;
+    }
+
+    // Set true to print repeated primitives in a format like:
+    //   field_name: [1, 2, 3, 4]
+    // instead of printing each value on its own line.  Short format applies
+    // only to primitive values -- i.e. everything except strings and
+    // sub-messages/groups.
+    void SetUseShortRepeatedPrimitives(bool use_short_repeated_primitives) {
+      use_short_repeated_primitives_ = use_short_repeated_primitives;
+    }
+
+    // Set true to output UTF-8 instead of ASCII.  The only difference
+    // is that bytes >= 0x80 in string fields will not be escaped,
+    // because they are assumed to be part of UTF-8 multi-byte
+    // sequences.
+    void SetUseUtf8StringEscaping(bool as_utf8) {
+      utf8_string_escaping_ = as_utf8;
+    }
+
+   private:
+    // Forward declaration of an internal class used to print the text
+    // output to the OutputStream (see text_format.cc for implementation).
+    class TextGenerator;
+
+    // Internal Print method, used for writing to the OutputStream via
+    // the TextGenerator class.
+    void Print(const Message& message,
+               TextGenerator& generator) const;
+
+    // Print a single field.
+    void PrintField(const Message& message,
+                    const Reflection* reflection,
+                    const FieldDescriptor* field,
+                    TextGenerator& generator) const;
+
+    // Print a repeated primitive field in short form.
+    void PrintShortRepeatedField(const Message& message,
+                                 const Reflection* reflection,
+                                 const FieldDescriptor* field,
+                                 TextGenerator& generator) const;
+
+    // Print the name of a field -- i.e. everything that comes before the
+    // ':' for a single name/value pair.
+    void PrintFieldName(const Message& message,
+                        const Reflection* reflection,
+                        const FieldDescriptor* field,
+                        TextGenerator& generator) const;
+
+    // Outputs a textual representation of the value of the field supplied on
+    // the message supplied or the default value if not set.
+    void PrintFieldValue(const Message& message,
+                         const Reflection* reflection,
+                         const FieldDescriptor* field,
+                         int index,
+                         TextGenerator& generator) const;
+
+    // Print the fields in an UnknownFieldSet.  They are printed by tag number
+    // only.  Embedded messages are heuristically identified by attempting to
+    // parse them.
+    void PrintUnknownFields(const UnknownFieldSet& unknown_fields,
+                            TextGenerator& generator) const;
+
+    int initial_indent_level_;
+
+    bool single_line_mode_;
+
+    bool use_short_repeated_primitives_;
+
+    bool utf8_string_escaping_;
+  };
+
+  // Parses a text-format protocol message from the given input stream to
+  // the given message object.  This function parses the format written
+  // by Print().
+  static bool Parse(io::ZeroCopyInputStream* input, Message* output);
+  // Like Parse(), but reads directly from a string.
+  static bool ParseFromString(const string& input, Message* output);
+
+  // Like Parse(), but the data is merged into the given message, as if
+  // using Message::MergeFrom().
+  static bool Merge(io::ZeroCopyInputStream* input, Message* output);
+  // Like Merge(), but reads directly from a string.
+  static bool MergeFromString(const string& input, Message* output);
+
+  // Parse the given text as a single field value and store it into the
+  // given field of the given message. If the field is a repeated field,
+  // the new value will be added to the end
+  static bool ParseFieldValueFromString(const string& input,
+                                        const FieldDescriptor* field,
+                                        Message* message);
+
+  // Interface that TextFormat::Parser can use to find extensions.
+  // This class may be extended in the future to find more information
+  // like fields, etc.
+  class LIBPROTOBUF_EXPORT Finder {
+   public:
+    virtual ~Finder();
+
+    // Try to find an extension of *message by fully-qualified field
+    // name.  Returns NULL if no extension is known for this name or number.
+    virtual const FieldDescriptor* FindExtension(
+        Message* message,
+        const string& name) const = 0;
+  };
+
+  // A location in the parsed text.
+  struct ParseLocation {
+    int line;
+    int column;
+
+    ParseLocation() : line(-1), column(-1) {}
+    ParseLocation(int line_param, int column_param)
+        : line(line_param), column(column_param) {}
+  };
+
+  // Data structure which is populated with the locations of each field
+  // value parsed from the text.
+  class LIBPROTOBUF_EXPORT ParseInfoTree {
+   public:
+    ParseInfoTree();
+    ~ParseInfoTree();
+
+    // Returns the parse location for index-th value of the field in the parsed
+    // text. If none exists, returns a location with line = -1. Index should be
+    // -1 for not-repeated fields.
+    ParseLocation GetLocation(const FieldDescriptor* field, int index) const;
+
+    // Returns the parse info tree for the given field, which must be a message
+    // type. The nested information tree is owned by the root tree and will be
+    // deleted when it is deleted.
+    ParseInfoTree* GetTreeForNested(const FieldDescriptor* field,
+                                    int index) const;
+
+   private:
+    // Allow the text format parser to record information into the tree.
+    friend class TextFormat;
+
+    // Records the starting location of a single value for a field.
+    void RecordLocation(const FieldDescriptor* field, ParseLocation location);
+
+    // Create and records a nested tree for a nested message field.
+    ParseInfoTree* CreateNested(const FieldDescriptor* field);
+
+    // Defines the map from the index-th field descriptor to its parse location.
+    typedef map<const FieldDescriptor*, vector<ParseLocation> > LocationMap;
+
+    // Defines the map from the index-th field descriptor to the nested parse
+    // info tree.
+    typedef map<const FieldDescriptor*, vector<ParseInfoTree*> > NestedMap;
+
+    LocationMap locations_;
+    NestedMap nested_;
+
+    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ParseInfoTree);
+  };
+
+  // For more control over parsing, use this class.
+  class LIBPROTOBUF_EXPORT Parser {
+   public:
+    Parser();
+    ~Parser();
+
+    // Like TextFormat::Parse().
+    bool Parse(io::ZeroCopyInputStream* input, Message* output);
+    // Like TextFormat::ParseFromString().
+    bool ParseFromString(const string& input, Message* output);
+    // Like TextFormat::Merge().
+    bool Merge(io::ZeroCopyInputStream* input, Message* output);
+    // Like TextFormat::MergeFromString().
+    bool MergeFromString(const string& input, Message* output);
+
+    // Set where to report parse errors.  If NULL (the default), errors will
+    // be printed to stderr.
+    void RecordErrorsTo(io::ErrorCollector* error_collector) {
+      error_collector_ = error_collector;
+    }
+
+    // Set how parser finds extensions.  If NULL (the default), the
+    // parser will use the standard Reflection object associated with
+    // the message being parsed.
+    void SetFinder(Finder* finder) {
+      finder_ = finder;
+    }
+
+    // Sets where location information about the parse will be written. If NULL
+    // (the default), then no location will be written.
+    void WriteLocationsTo(ParseInfoTree* tree) {
+      parse_info_tree_ = tree;
+    }
+
+    // Normally parsing fails if, after parsing, output->IsInitialized()
+    // returns false.  Call AllowPartialMessage(true) to skip this check.
+    void AllowPartialMessage(bool allow) {
+      allow_partial_ = allow;
+    }
+
+    // Like TextFormat::ParseFieldValueFromString
+    bool ParseFieldValueFromString(const string& input,
+                                   const FieldDescriptor* field,
+                                   Message* output);
+
+
+   private:
+    // Forward declaration of an internal class used to parse text
+    // representations (see text_format.cc for implementation).
+    class ParserImpl;
+
+    // Like TextFormat::Merge().  The provided implementation is used
+    // to do the parsing.
+    bool MergeUsingImpl(io::ZeroCopyInputStream* input,
+                        Message* output,
+                        ParserImpl* parser_impl);
+
+    io::ErrorCollector* error_collector_;
+    Finder* finder_;
+    ParseInfoTree* parse_info_tree_;
+    bool allow_partial_;
+    bool allow_unknown_field_;
+  };
+
+ private:
+  // Hack: ParseInfoTree declares TextFormat as a friend which should extend
+  // the friendship to TextFormat::Parser::ParserImpl, but unfortunately some
+  // old compilers (e.g. GCC 3.4.6) don't implement this correctly. We provide
+  // helpers for ParserImpl to call methods of ParseInfoTree.
+  static inline void RecordLocation(ParseInfoTree* info_tree,
+                                    const FieldDescriptor* field,
+                                    ParseLocation location);
+  static inline ParseInfoTree* CreateNested(ParseInfoTree* info_tree,
+                                            const FieldDescriptor* field);
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(TextFormat);
+};
+
+inline void TextFormat::RecordLocation(ParseInfoTree* info_tree,
+                                       const FieldDescriptor* field,
+                                       ParseLocation location) {
+  info_tree->RecordLocation(field, location);
+}
+
+inline TextFormat::ParseInfoTree* TextFormat::CreateNested(
+    ParseInfoTree* info_tree, const FieldDescriptor* field) {
+  return info_tree->CreateNested(field);
+}
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_TEXT_FORMAT_H__
diff --git a/ps-lite/deps/include/google/protobuf/unknown_field_set.h b/ps-lite/deps/include/google/protobuf/unknown_field_set.h
new file mode 100644
index 00000000..825bba83
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/unknown_field_set.h
@@ -0,0 +1,311 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// Contains classes used to keep track of unrecognized fields seen while
+// parsing a protocol message.
+
+#ifndef GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
+#define GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
+
+#include <assert.h>
+#include <string>
+#include <vector>
+#include <google/protobuf/stubs/common.h>
+// TODO(jasonh): some people seem to rely on protobufs to include this for them!
+
+namespace google {
+namespace protobuf {
+  namespace io {
+    class CodedInputStream;         // coded_stream.h
+    class CodedOutputStream;        // coded_stream.h
+    class ZeroCopyInputStream;      // zero_copy_stream.h
+  }
+  namespace internal {
+    class WireFormat;               // wire_format.h
+    class UnknownFieldSetFieldSkipperUsingCord;
+                                    // extension_set_heavy.cc
+  }
+
+class Message;                      // message.h
+class UnknownField;                 // below
+
+// An UnknownFieldSet contains fields that were encountered while parsing a
+// message but were not defined by its type.  Keeping track of these can be
+// useful, especially in that they may be written if the message is serialized
+// again without being cleared in between.  This means that software which
+// simply receives messages and forwards them to other servers does not need
+// to be updated every time a new field is added to the message definition.
+//
+// To get the UnknownFieldSet attached to any message, call
+// Reflection::GetUnknownFields().
+//
+// This class is necessarily tied to the protocol buffer wire format, unlike
+// the Reflection interface which is independent of any serialization scheme.
+class LIBPROTOBUF_EXPORT UnknownFieldSet {
+ public:
+  UnknownFieldSet();
+  ~UnknownFieldSet();
+
+  // Remove all fields.
+  inline void Clear();
+
+  // Remove all fields and deallocate internal data objects
+  void ClearAndFreeMemory();
+
+  // Is this set empty?
+  inline bool empty() const;
+
+  // Merge the contents of some other UnknownFieldSet with this one.
+  void MergeFrom(const UnknownFieldSet& other);
+
+  // Swaps the contents of some other UnknownFieldSet with this one.
+  inline void Swap(UnknownFieldSet* x);
+
+  // Computes (an estimate of) the total number of bytes currently used for
+  // storing the unknown fields in memory. Does NOT include
+  // sizeof(*this) in the calculation.
+  int SpaceUsedExcludingSelf() const;
+
+  // Version of SpaceUsed() including sizeof(*this).
+  int SpaceUsed() const;
+
+  // Returns the number of fields present in the UnknownFieldSet.
+  inline int field_count() const;
+  // Get a field in the set, where 0 <= index < field_count().  The fields
+  // appear in the order in which they were added.
+  inline const UnknownField& field(int index) const;
+  // Get a mutable pointer to a field in the set, where
+  // 0 <= index < field_count().  The fields appear in the order in which
+  // they were added.
+  inline UnknownField* mutable_field(int index);
+
+  // Adding fields ---------------------------------------------------
+
+  void AddVarint(int number, uint64 value);
+  void AddFixed32(int number, uint32 value);
+  void AddFixed64(int number, uint64 value);
+  void AddLengthDelimited(int number, const string& value);
+  string* AddLengthDelimited(int number);
+  UnknownFieldSet* AddGroup(int number);
+
+  // Adds an unknown field from another set.
+  void AddField(const UnknownField& field);
+
+  // Delete fields with indices in the range [start .. start+num-1].
+  // Caution: implementation moves all fields with indices [start+num .. ].
+  void DeleteSubrange(int start, int num);
+
+  // Delete all fields with a specific field number. The order of left fields
+  // is preserved.
+  // Caution: implementation moves all fields after the first deleted field.
+  void DeleteByNumber(int number);
+
+  // Parsing helpers -------------------------------------------------
+  // These work exactly like the similarly-named methods of Message.
+
+  bool MergeFromCodedStream(io::CodedInputStream* input);
+  bool ParseFromCodedStream(io::CodedInputStream* input);
+  bool ParseFromZeroCopyStream(io::ZeroCopyInputStream* input);
+  bool ParseFromArray(const void* data, int size);
+  inline bool ParseFromString(const string& data) {
+    return ParseFromArray(data.data(), data.size());
+  }
+
+ private:
+
+  void ClearFallback();
+
+  vector<UnknownField>* fields_;
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(UnknownFieldSet);
+};
+
+// Represents one field in an UnknownFieldSet.
+class LIBPROTOBUF_EXPORT UnknownField {
+ public:
+  enum Type {
+    TYPE_VARINT,
+    TYPE_FIXED32,
+    TYPE_FIXED64,
+    TYPE_LENGTH_DELIMITED,
+    TYPE_GROUP
+  };
+
+  // The field's tag number, as seen on the wire.
+  inline int number() const;
+
+  // The field type.
+  inline Type type() const;
+
+  // Accessors -------------------------------------------------------
+  // Each method works only for UnknownFields of the corresponding type.
+
+  inline uint64 varint() const;
+  inline uint32 fixed32() const;
+  inline uint64 fixed64() const;
+  inline const string& length_delimited() const;
+  inline const UnknownFieldSet& group() const;
+
+  inline void set_varint(uint64 value);
+  inline void set_fixed32(uint32 value);
+  inline void set_fixed64(uint64 value);
+  inline void set_length_delimited(const string& value);
+  inline string* mutable_length_delimited();
+  inline UnknownFieldSet* mutable_group();
+
+  // Serialization API.
+  // These methods can take advantage of the underlying implementation and may
+  // archieve a better performance than using getters to retrieve the data and
+  // do the serialization yourself.
+  void SerializeLengthDelimitedNoTag(io::CodedOutputStream* output) const;
+  uint8* SerializeLengthDelimitedNoTagToArray(uint8* target) const;
+
+  inline int GetLengthDelimitedSize() const;
+
+ private:
+  friend class UnknownFieldSet;
+
+  // If this UnknownField contains a pointer, delete it.
+  void Delete();
+
+  // Make a deep copy of any pointers in this UnknownField.
+  void DeepCopy();
+
+
+  unsigned int number_ : 29;
+  unsigned int type_   : 3;
+  union {
+    uint64 varint_;
+    uint32 fixed32_;
+    uint64 fixed64_;
+    mutable union {
+      string* string_value_;
+    } length_delimited_;
+    UnknownFieldSet* group_;
+  };
+};
+
+// ===================================================================
+// inline implementations
+
+inline void UnknownFieldSet::Clear() {
+  if (fields_ != NULL) {
+    ClearFallback();
+  }
+}
+
+inline bool UnknownFieldSet::empty() const {
+  return fields_ == NULL || fields_->empty();
+}
+
+inline void UnknownFieldSet::Swap(UnknownFieldSet* x) {
+  std::swap(fields_, x->fields_);
+}
+
+inline int UnknownFieldSet::field_count() const {
+  return (fields_ == NULL) ? 0 : fields_->size();
+}
+inline const UnknownField& UnknownFieldSet::field(int index) const {
+  return (*fields_)[index];
+}
+inline UnknownField* UnknownFieldSet::mutable_field(int index) {
+  return &(*fields_)[index];
+}
+
+inline void UnknownFieldSet::AddLengthDelimited(
+    int number, const string& value) {
+  AddLengthDelimited(number)->assign(value);
+}
+
+
+inline int UnknownField::number() const { return number_; }
+inline UnknownField::Type UnknownField::type() const {
+  return static_cast<Type>(type_);
+}
+
+inline uint64 UnknownField::varint () const {
+  assert(type_ == TYPE_VARINT);
+  return varint_;
+}
+inline uint32 UnknownField::fixed32() const {
+  assert(type_ == TYPE_FIXED32);
+  return fixed32_;
+}
+inline uint64 UnknownField::fixed64() const {
+  assert(type_ == TYPE_FIXED64);
+  return fixed64_;
+}
+inline const string& UnknownField::length_delimited() const {
+  assert(type_ == TYPE_LENGTH_DELIMITED);
+  return *length_delimited_.string_value_;
+}
+inline const UnknownFieldSet& UnknownField::group() const {
+  assert(type_ == TYPE_GROUP);
+  return *group_;
+}
+
+inline void UnknownField::set_varint(uint64 value) {
+  assert(type_ == TYPE_VARINT);
+  varint_ = value;
+}
+inline void UnknownField::set_fixed32(uint32 value) {
+  assert(type_ == TYPE_FIXED32);
+  fixed32_ = value;
+}
+inline void UnknownField::set_fixed64(uint64 value) {
+  assert(type_ == TYPE_FIXED64);
+  fixed64_ = value;
+}
+inline void UnknownField::set_length_delimited(const string& value) {
+  assert(type_ == TYPE_LENGTH_DELIMITED);
+  length_delimited_.string_value_->assign(value);
+}
+inline string* UnknownField::mutable_length_delimited() {
+  assert(type_ == TYPE_LENGTH_DELIMITED);
+  return length_delimited_.string_value_;
+}
+inline UnknownFieldSet* UnknownField::mutable_group() {
+  assert(type_ == TYPE_GROUP);
+  return group_;
+}
+
+inline int UnknownField::GetLengthDelimitedSize() const {
+  GOOGLE_DCHECK_EQ(TYPE_LENGTH_DELIMITED, type_);
+  return length_delimited_.string_value_->size();
+}
+
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format.h b/ps-lite/deps/include/google/protobuf/wire_format.h
new file mode 100644
index 00000000..6cc90029
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/wire_format.h
@@ -0,0 +1,308 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//         atenasio@google.com (Chris Atenasio) (ZigZag transform)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+
+#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_H__
+#define GOOGLE_PROTOBUF_WIRE_FORMAT_H__
+
+#include <string>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/descriptor.pb.h>
+#include <google/protobuf/descriptor.h>
+#include <google/protobuf/message.h>
+#include <google/protobuf/wire_format_lite.h>
+
+// Do UTF-8 validation on string type in Debug build only
+#ifndef NDEBUG
+#define GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED
+#endif
+
+namespace google {
+namespace protobuf {
+  namespace io {
+    class CodedInputStream;      // coded_stream.h
+    class CodedOutputStream;     // coded_stream.h
+  }
+  class UnknownFieldSet;         // unknown_field_set.h
+}
+
+namespace protobuf {
+namespace internal {
+
+// This class is for internal use by the protocol buffer library and by
+// protocol-complier-generated message classes.  It must not be called
+// directly by clients.
+//
+// This class contains code for implementing the binary protocol buffer
+// wire format via reflection.  The WireFormatLite class implements the
+// non-reflection based routines.
+//
+// This class is really a namespace that contains only static methods
+class LIBPROTOBUF_EXPORT WireFormat {
+ public:
+
+  // Given a field return its WireType
+  static inline WireFormatLite::WireType WireTypeForField(
+      const FieldDescriptor* field);
+
+  // Given a FieldSescriptor::Type return its WireType
+  static inline WireFormatLite::WireType WireTypeForFieldType(
+      FieldDescriptor::Type type);
+
+  // Compute the byte size of a tag.  For groups, this includes both the start
+  // and end tags.
+  static inline int TagSize(int field_number, FieldDescriptor::Type type);
+
+  // These procedures can be used to implement the methods of Message which
+  // handle parsing and serialization of the protocol buffer wire format
+  // using only the Reflection interface.  When you ask the protocol
+  // compiler to optimize for code size rather than speed, it will implement
+  // those methods in terms of these procedures.  Of course, these are much
+  // slower than the specialized implementations which the protocol compiler
+  // generates when told to optimize for speed.
+
+  // Read a message in protocol buffer wire format.
+  //
+  // This procedure reads either to the end of the input stream or through
+  // a WIRETYPE_END_GROUP tag ending the message, whichever comes first.
+  // It returns false if the input is invalid.
+  //
+  // Required fields are NOT checked by this method.  You must call
+  // IsInitialized() on the resulting message yourself.
+  static bool ParseAndMergePartial(io::CodedInputStream* input,
+                                   Message* message);
+
+  // Serialize a message in protocol buffer wire format.
+  //
+  // Any embedded messages within the message must have their correct sizes
+  // cached.  However, the top-level message need not; its size is passed as
+  // a parameter to this procedure.
+  //
+  // These return false iff the underlying stream returns a write error.
+  static void SerializeWithCachedSizes(
+      const Message& message,
+      int size, io::CodedOutputStream* output);
+
+  // Implements Message::ByteSize() via reflection.  WARNING:  The result
+  // of this method is *not* cached anywhere.  However, all embedded messages
+  // will have their ByteSize() methods called, so their sizes will be cached.
+  // Therefore, calling this method is sufficient to allow you to call
+  // WireFormat::SerializeWithCachedSizes() on the same object.
+  static int ByteSize(const Message& message);
+
+  // -----------------------------------------------------------------
+  // Helpers for dealing with unknown fields
+
+  // Skips a field value of the given WireType.  The input should start
+  // positioned immediately after the tag.  If unknown_fields is non-NULL,
+  // the contents of the field will be added to it.
+  static bool SkipField(io::CodedInputStream* input, uint32 tag,
+                        UnknownFieldSet* unknown_fields);
+
+  // Reads and ignores a message from the input.  If unknown_fields is non-NULL,
+  // the contents will be added to it.
+  static bool SkipMessage(io::CodedInputStream* input,
+                          UnknownFieldSet* unknown_fields);
+
+  // Write the contents of an UnknownFieldSet to the output.
+  static void SerializeUnknownFields(const UnknownFieldSet& unknown_fields,
+                                     io::CodedOutputStream* output);
+  // Same as above, except writing directly to the provided buffer.
+  // Requires that the buffer have sufficient capacity for
+  // ComputeUnknownFieldsSize(unknown_fields).
+  //
+  // Returns a pointer past the last written byte.
+  static uint8* SerializeUnknownFieldsToArray(
+      const UnknownFieldSet& unknown_fields,
+      uint8* target);
+
+  // Same thing except for messages that have the message_set_wire_format
+  // option.
+  static void SerializeUnknownMessageSetItems(
+      const UnknownFieldSet& unknown_fields,
+      io::CodedOutputStream* output);
+  // Same as above, except writing directly to the provided buffer.
+  // Requires that the buffer have sufficient capacity for
+  // ComputeUnknownMessageSetItemsSize(unknown_fields).
+  //
+  // Returns a pointer past the last written byte.
+  static uint8* SerializeUnknownMessageSetItemsToArray(
+      const UnknownFieldSet& unknown_fields,
+      uint8* target);
+
+  // Compute the size of the UnknownFieldSet on the wire.
+  static int ComputeUnknownFieldsSize(const UnknownFieldSet& unknown_fields);
+
+  // Same thing except for messages that have the message_set_wire_format
+  // option.
+  static int ComputeUnknownMessageSetItemsSize(
+      const UnknownFieldSet& unknown_fields);
+
+
+  // Helper functions for encoding and decoding tags.  (Inlined below and in
+  // _inl.h)
+  //
+  // This is different from MakeTag(field->number(), field->type()) in the case
+  // of packed repeated fields.
+  static uint32 MakeTag(const FieldDescriptor* field);
+
+  // Parse a single field.  The input should start out positioned immidately
+  // after the tag.
+  static bool ParseAndMergeField(
+      uint32 tag,
+      const FieldDescriptor* field,        // May be NULL for unknown
+      Message* message,
+      io::CodedInputStream* input);
+
+  // Serialize a single field.
+  static void SerializeFieldWithCachedSizes(
+      const FieldDescriptor* field,        // Cannot be NULL
+      const Message& message,
+      io::CodedOutputStream* output);
+
+  // Compute size of a single field.  If the field is a message type, this
+  // will call ByteSize() for the embedded message, insuring that it caches
+  // its size.
+  static int FieldByteSize(
+      const FieldDescriptor* field,        // Cannot be NULL
+      const Message& message);
+
+  // Parse/serialize a MessageSet::Item group.  Used with messages that use
+  // opion message_set_wire_format = true.
+  static bool ParseAndMergeMessageSetItem(
+      io::CodedInputStream* input,
+      Message* message);
+  static void SerializeMessageSetItemWithCachedSizes(
+      const FieldDescriptor* field,
+      const Message& message,
+      io::CodedOutputStream* output);
+  static int MessageSetItemByteSize(
+      const FieldDescriptor* field,
+      const Message& message);
+
+  // Computes the byte size of a field, excluding tags. For packed fields, it
+  // only includes the size of the raw data, and not the size of the total
+  // length, but for other length-delimited types, the size of the length is
+  // included.
+  static int FieldDataOnlyByteSize(
+      const FieldDescriptor* field,        // Cannot be NULL
+      const Message& message);
+
+  enum Operation {
+    PARSE,
+    SERIALIZE,
+  };
+
+  // Verifies that a string field is valid UTF8, logging an error if not.
+  static void VerifyUTF8String(const char* data, int size, Operation op);
+
+ private:
+  // Verifies that a string field is valid UTF8, logging an error if not.
+  static void VerifyUTF8StringFallback(
+      const char* data,
+      int size,
+      Operation op);
+
+
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(WireFormat);
+};
+
+// Subclass of FieldSkipper which saves skipped fields to an UnknownFieldSet.
+class LIBPROTOBUF_EXPORT UnknownFieldSetFieldSkipper : public FieldSkipper {
+ public:
+  UnknownFieldSetFieldSkipper(UnknownFieldSet* unknown_fields)
+      : unknown_fields_(unknown_fields) {}
+  virtual ~UnknownFieldSetFieldSkipper() {}
+
+  // implements FieldSkipper -----------------------------------------
+  virtual bool SkipField(io::CodedInputStream* input, uint32 tag);
+  virtual bool SkipMessage(io::CodedInputStream* input);
+  virtual void SkipUnknownEnum(int field_number, int value);
+
+ protected:
+  UnknownFieldSet* unknown_fields_;
+};
+
+// inline methods ====================================================
+
+inline WireFormatLite::WireType WireFormat::WireTypeForField(
+    const FieldDescriptor* field) {
+  if (field->options().packed()) {
+    return WireFormatLite::WIRETYPE_LENGTH_DELIMITED;
+  } else {
+    return WireTypeForFieldType(field->type());
+  }
+}
+
+inline WireFormatLite::WireType WireFormat::WireTypeForFieldType(
+    FieldDescriptor::Type type) {
+  // Some compilers don't like enum -> enum casts, so we implicit_cast to
+  // int first.
+  return WireFormatLite::WireTypeForFieldType(
+      static_cast<WireFormatLite::FieldType>(
+        implicit_cast<int>(type)));
+}
+
+inline uint32 WireFormat::MakeTag(const FieldDescriptor* field) {
+  return WireFormatLite::MakeTag(field->number(), WireTypeForField(field));
+}
+
+inline int WireFormat::TagSize(int field_number, FieldDescriptor::Type type) {
+  // Some compilers don't like enum -> enum casts, so we implicit_cast to
+  // int first.
+  return WireFormatLite::TagSize(field_number,
+      static_cast<WireFormatLite::FieldType>(
+        implicit_cast<int>(type)));
+}
+
+inline void WireFormat::VerifyUTF8String(const char* data, int size,
+    WireFormat::Operation op) {
+#ifdef GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED
+  WireFormat::VerifyUTF8StringFallback(data, size, op);
+#else
+  // Avoid the compiler warning about unsued variables.
+  (void)data; (void)size; (void)op;
+#endif
+}
+
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format_lite.h b/ps-lite/deps/include/google/protobuf/wire_format_lite.h
new file mode 100644
index 00000000..cb4fc918
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/wire_format_lite.h
@@ -0,0 +1,622 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//         atenasio@google.com (Chris Atenasio) (ZigZag transform)
+//         wink@google.com (Wink Saville) (refactored from wire_format.h)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+//
+// This header is logically internal, but is made public because it is used
+// from protocol-compiler-generated code, which may reside in other components.
+
+#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
+#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
+
+#include <string>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/message_lite.h>
+#include <google/protobuf/io/coded_stream.h>  // for CodedOutputStream::Varint32Size
+
+namespace google {
+
+namespace protobuf {
+  template <typename T> class RepeatedField;  // repeated_field.h
+}
+
+namespace protobuf {
+namespace internal {
+
+class StringPieceField;
+
+// This class is for internal use by the protocol buffer library and by
+// protocol-complier-generated message classes.  It must not be called
+// directly by clients.
+//
+// This class contains helpers for implementing the binary protocol buffer
+// wire format without the need for reflection. Use WireFormat when using
+// reflection.
+//
+// This class is really a namespace that contains only static methods.
+class LIBPROTOBUF_EXPORT WireFormatLite {
+ public:
+
+  // -----------------------------------------------------------------
+  // Helper constants and functions related to the format.  These are
+  // mostly meant for internal and generated code to use.
+
+  // The wire format is composed of a sequence of tag/value pairs, each
+  // of which contains the value of one field (or one element of a repeated
+  // field).  Each tag is encoded as a varint.  The lower bits of the tag
+  // identify its wire type, which specifies the format of the data to follow.
+  // The rest of the bits contain the field number.  Each type of field (as
+  // declared by FieldDescriptor::Type, in descriptor.h) maps to one of
+  // these wire types.  Immediately following each tag is the field's value,
+  // encoded in the format specified by the wire type.  Because the tag
+  // identifies the encoding of this data, it is possible to skip
+  // unrecognized fields for forwards compatibility.
+
+  enum WireType {
+    WIRETYPE_VARINT           = 0,
+    WIRETYPE_FIXED64          = 1,
+    WIRETYPE_LENGTH_DELIMITED = 2,
+    WIRETYPE_START_GROUP      = 3,
+    WIRETYPE_END_GROUP        = 4,
+    WIRETYPE_FIXED32          = 5,
+  };
+
+  // Lite alternative to FieldDescriptor::Type.  Must be kept in sync.
+  enum FieldType {
+    TYPE_DOUBLE         = 1,
+    TYPE_FLOAT          = 2,
+    TYPE_INT64          = 3,
+    TYPE_UINT64         = 4,
+    TYPE_INT32          = 5,
+    TYPE_FIXED64        = 6,
+    TYPE_FIXED32        = 7,
+    TYPE_BOOL           = 8,
+    TYPE_STRING         = 9,
+    TYPE_GROUP          = 10,
+    TYPE_MESSAGE        = 11,
+    TYPE_BYTES          = 12,
+    TYPE_UINT32         = 13,
+    TYPE_ENUM           = 14,
+    TYPE_SFIXED32       = 15,
+    TYPE_SFIXED64       = 16,
+    TYPE_SINT32         = 17,
+    TYPE_SINT64         = 18,
+    MAX_FIELD_TYPE      = 18,
+  };
+
+  // Lite alternative to FieldDescriptor::CppType.  Must be kept in sync.
+  enum CppType {
+    CPPTYPE_INT32       = 1,
+    CPPTYPE_INT64       = 2,
+    CPPTYPE_UINT32      = 3,
+    CPPTYPE_UINT64      = 4,
+    CPPTYPE_DOUBLE      = 5,
+    CPPTYPE_FLOAT       = 6,
+    CPPTYPE_BOOL        = 7,
+    CPPTYPE_ENUM        = 8,
+    CPPTYPE_STRING      = 9,
+    CPPTYPE_MESSAGE     = 10,
+    MAX_CPPTYPE         = 10,
+  };
+
+  // Helper method to get the CppType for a particular Type.
+  static CppType FieldTypeToCppType(FieldType type);
+
+  // Given a FieldSescriptor::Type return its WireType
+  static inline WireFormatLite::WireType WireTypeForFieldType(
+      WireFormatLite::FieldType type) {
+    return kWireTypeForFieldType[type];
+  }
+
+  // Number of bits in a tag which identify the wire type.
+  static const int kTagTypeBits = 3;
+  // Mask for those bits.
+  static const uint32 kTagTypeMask = (1 << kTagTypeBits) - 1;
+
+  // Helper functions for encoding and decoding tags.  (Inlined below and in
+  // _inl.h)
+  //
+  // This is different from MakeTag(field->number(), field->type()) in the case
+  // of packed repeated fields.
+  static uint32 MakeTag(int field_number, WireType type);
+  static WireType GetTagWireType(uint32 tag);
+  static int GetTagFieldNumber(uint32 tag);
+
+  // Compute the byte size of a tag.  For groups, this includes both the start
+  // and end tags.
+  static inline int TagSize(int field_number, WireFormatLite::FieldType type);
+
+  // Skips a field value with the given tag.  The input should start
+  // positioned immediately after the tag.  Skipped values are simply discarded,
+  // not recorded anywhere.  See WireFormat::SkipField() for a version that
+  // records to an UnknownFieldSet.
+  static bool SkipField(io::CodedInputStream* input, uint32 tag);
+
+  // Reads and ignores a message from the input.  Skipped values are simply
+  // discarded, not recorded anywhere.  See WireFormat::SkipMessage() for a
+  // version that records to an UnknownFieldSet.
+  static bool SkipMessage(io::CodedInputStream* input);
+
+// This macro does the same thing as WireFormatLite::MakeTag(), but the
+// result is usable as a compile-time constant, which makes it usable
+// as a switch case or a template input.  WireFormatLite::MakeTag() is more
+// type-safe, though, so prefer it if possible.
+#define GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(FIELD_NUMBER, TYPE)                  \
+  static_cast<uint32>(                                                   \
+    ((FIELD_NUMBER) << ::google::protobuf::internal::WireFormatLite::kTagTypeBits) \
+      | (TYPE))
+
+  // These are the tags for the old MessageSet format, which was defined as:
+  //   message MessageSet {
+  //     repeated group Item = 1 {
+  //       required int32 type_id = 2;
+  //       required string message = 3;
+  //     }
+  //   }
+  static const int kMessageSetItemNumber = 1;
+  static const int kMessageSetTypeIdNumber = 2;
+  static const int kMessageSetMessageNumber = 3;
+  static const int kMessageSetItemStartTag =
+    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetItemNumber,
+                                WireFormatLite::WIRETYPE_START_GROUP);
+  static const int kMessageSetItemEndTag =
+    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetItemNumber,
+                                WireFormatLite::WIRETYPE_END_GROUP);
+  static const int kMessageSetTypeIdTag =
+    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetTypeIdNumber,
+                                WireFormatLite::WIRETYPE_VARINT);
+  static const int kMessageSetMessageTag =
+    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetMessageNumber,
+                                WireFormatLite::WIRETYPE_LENGTH_DELIMITED);
+
+  // Byte size of all tags of a MessageSet::Item combined.
+  static const int kMessageSetItemTagsSize;
+
+  // Helper functions for converting between floats/doubles and IEEE-754
+  // uint32s/uint64s so that they can be written.  (Assumes your platform
+  // uses IEEE-754 floats.)
+  static uint32 EncodeFloat(float value);
+  static float DecodeFloat(uint32 value);
+  static uint64 EncodeDouble(double value);
+  static double DecodeDouble(uint64 value);
+
+  // Helper functions for mapping signed integers to unsigned integers in
+  // such a way that numbers with small magnitudes will encode to smaller
+  // varints.  If you simply static_cast a negative number to an unsigned
+  // number and varint-encode it, it will always take 10 bytes, defeating
+  // the purpose of varint.  So, for the "sint32" and "sint64" field types,
+  // we ZigZag-encode the values.
+  static uint32 ZigZagEncode32(int32 n);
+  static int32  ZigZagDecode32(uint32 n);
+  static uint64 ZigZagEncode64(int64 n);
+  static int64  ZigZagDecode64(uint64 n);
+
+  // =================================================================
+  // Methods for reading/writing individual field.  The implementations
+  // of these methods are defined in wire_format_lite_inl.h; you must #include
+  // that file to use these.
+
+// Avoid ugly line wrapping
+#define input  io::CodedInputStream*  input
+#define output io::CodedOutputStream* output
+#define field_number int field_number
+#define INL GOOGLE_ATTRIBUTE_ALWAYS_INLINE
+
+  // Read fields, not including tags.  The assumption is that you already
+  // read the tag to determine what field to read.
+
+  // For primitive fields, we just use a templatized routine parameterized by
+  // the represented type and the FieldType. These are specialized with the
+  // appropriate definition for each declared type.
+  template <typename CType, enum FieldType DeclaredType>
+  static inline bool ReadPrimitive(input, CType* value) INL;
+
+  // Reads repeated primitive values, with optimizations for repeats.
+  // tag_size and tag should both be compile-time constants provided by the
+  // protocol compiler.
+  template <typename CType, enum FieldType DeclaredType>
+  static inline bool ReadRepeatedPrimitive(int tag_size,
+                                           uint32 tag,
+                                           input,
+                                           RepeatedField<CType>* value) INL;
+
+  // Identical to ReadRepeatedPrimitive, except will not inline the
+  // implementation.
+  template <typename CType, enum FieldType DeclaredType>
+  static bool ReadRepeatedPrimitiveNoInline(int tag_size,
+                                            uint32 tag,
+                                            input,
+                                            RepeatedField<CType>* value);
+
+  // Reads a primitive value directly from the provided buffer. It returns a
+  // pointer past the segment of data that was read.
+  //
+  // This is only implemented for the types with fixed wire size, e.g.
+  // float, double, and the (s)fixed* types.
+  template <typename CType, enum FieldType DeclaredType>
+  static inline const uint8* ReadPrimitiveFromArray(const uint8* buffer,
+                                                    CType* value) INL;
+
+  // Reads a primitive packed field.
+  //
+  // This is only implemented for packable types.
+  template <typename CType, enum FieldType DeclaredType>
+  static inline bool ReadPackedPrimitive(input,
+                                         RepeatedField<CType>* value) INL;
+
+  // Identical to ReadPackedPrimitive, except will not inline the
+  // implementation.
+  template <typename CType, enum FieldType DeclaredType>
+  static bool ReadPackedPrimitiveNoInline(input, RepeatedField<CType>* value);
+
+  // Read a packed enum field. Values for which is_valid() returns false are
+  // dropped.
+  static bool ReadPackedEnumNoInline(input,
+                                     bool (*is_valid)(int),
+                                     RepeatedField<int>* value);
+
+  static bool ReadString(input, string* value);
+  static bool ReadBytes (input, string* value);
+
+  static inline bool ReadGroup  (field_number, input, MessageLite* value);
+  static inline bool ReadMessage(input, MessageLite* value);
+
+  // Like above, but de-virtualize the call to MergePartialFromCodedStream().
+  // The pointer must point at an instance of MessageType, *not* a subclass (or
+  // the subclass must not override MergePartialFromCodedStream()).
+  template<typename MessageType>
+  static inline bool ReadGroupNoVirtual(field_number, input,
+                                        MessageType* value);
+  template<typename MessageType>
+  static inline bool ReadMessageNoVirtual(input, MessageType* value);
+
+  // Write a tag.  The Write*() functions typically include the tag, so
+  // normally there's no need to call this unless using the Write*NoTag()
+  // variants.
+  static inline void WriteTag(field_number, WireType type, output) INL;
+
+  // Write fields, without tags.
+  static inline void WriteInt32NoTag   (int32 value, output) INL;
+  static inline void WriteInt64NoTag   (int64 value, output) INL;
+  static inline void WriteUInt32NoTag  (uint32 value, output) INL;
+  static inline void WriteUInt64NoTag  (uint64 value, output) INL;
+  static inline void WriteSInt32NoTag  (int32 value, output) INL;
+  static inline void WriteSInt64NoTag  (int64 value, output) INL;
+  static inline void WriteFixed32NoTag (uint32 value, output) INL;
+  static inline void WriteFixed64NoTag (uint64 value, output) INL;
+  static inline void WriteSFixed32NoTag(int32 value, output) INL;
+  static inline void WriteSFixed64NoTag(int64 value, output) INL;
+  static inline void WriteFloatNoTag   (float value, output) INL;
+  static inline void WriteDoubleNoTag  (double value, output) INL;
+  static inline void WriteBoolNoTag    (bool value, output) INL;
+  static inline void WriteEnumNoTag    (int value, output) INL;
+
+  // Write fields, including tags.
+  static void WriteInt32   (field_number,  int32 value, output);
+  static void WriteInt64   (field_number,  int64 value, output);
+  static void WriteUInt32  (field_number, uint32 value, output);
+  static void WriteUInt64  (field_number, uint64 value, output);
+  static void WriteSInt32  (field_number,  int32 value, output);
+  static void WriteSInt64  (field_number,  int64 value, output);
+  static void WriteFixed32 (field_number, uint32 value, output);
+  static void WriteFixed64 (field_number, uint64 value, output);
+  static void WriteSFixed32(field_number,  int32 value, output);
+  static void WriteSFixed64(field_number,  int64 value, output);
+  static void WriteFloat   (field_number,  float value, output);
+  static void WriteDouble  (field_number, double value, output);
+  static void WriteBool    (field_number,   bool value, output);
+  static void WriteEnum    (field_number,    int value, output);
+
+  static void WriteString(field_number, const string& value, output);
+  static void WriteBytes (field_number, const string& value, output);
+
+  static void WriteGroup(
+    field_number, const MessageLite& value, output);
+  static void WriteMessage(
+    field_number, const MessageLite& value, output);
+  // Like above, but these will check if the output stream has enough
+  // space to write directly to a flat array.
+  static void WriteGroupMaybeToArray(
+    field_number, const MessageLite& value, output);
+  static void WriteMessageMaybeToArray(
+    field_number, const MessageLite& value, output);
+
+  // Like above, but de-virtualize the call to SerializeWithCachedSizes().  The
+  // pointer must point at an instance of MessageType, *not* a subclass (or
+  // the subclass must not override SerializeWithCachedSizes()).
+  template<typename MessageType>
+  static inline void WriteGroupNoVirtual(
+    field_number, const MessageType& value, output);
+  template<typename MessageType>
+  static inline void WriteMessageNoVirtual(
+    field_number, const MessageType& value, output);
+
+#undef output
+#define output uint8* target
+
+  // Like above, but use only *ToArray methods of CodedOutputStream.
+  static inline uint8* WriteTagToArray(field_number, WireType type, output) INL;
+
+  // Write fields, without tags.
+  static inline uint8* WriteInt32NoTagToArray   (int32 value, output) INL;
+  static inline uint8* WriteInt64NoTagToArray   (int64 value, output) INL;
+  static inline uint8* WriteUInt32NoTagToArray  (uint32 value, output) INL;
+  static inline uint8* WriteUInt64NoTagToArray  (uint64 value, output) INL;
+  static inline uint8* WriteSInt32NoTagToArray  (int32 value, output) INL;
+  static inline uint8* WriteSInt64NoTagToArray  (int64 value, output) INL;
+  static inline uint8* WriteFixed32NoTagToArray (uint32 value, output) INL;
+  static inline uint8* WriteFixed64NoTagToArray (uint64 value, output) INL;
+  static inline uint8* WriteSFixed32NoTagToArray(int32 value, output) INL;
+  static inline uint8* WriteSFixed64NoTagToArray(int64 value, output) INL;
+  static inline uint8* WriteFloatNoTagToArray   (float value, output) INL;
+  static inline uint8* WriteDoubleNoTagToArray  (double value, output) INL;
+  static inline uint8* WriteBoolNoTagToArray    (bool value, output) INL;
+  static inline uint8* WriteEnumNoTagToArray    (int value, output) INL;
+
+  // Write fields, including tags.
+  static inline uint8* WriteInt32ToArray(
+    field_number, int32 value, output) INL;
+  static inline uint8* WriteInt64ToArray(
+    field_number, int64 value, output) INL;
+  static inline uint8* WriteUInt32ToArray(
+    field_number, uint32 value, output) INL;
+  static inline uint8* WriteUInt64ToArray(
+    field_number, uint64 value, output) INL;
+  static inline uint8* WriteSInt32ToArray(
+    field_number, int32 value, output) INL;
+  static inline uint8* WriteSInt64ToArray(
+    field_number, int64 value, output) INL;
+  static inline uint8* WriteFixed32ToArray(
+    field_number, uint32 value, output) INL;
+  static inline uint8* WriteFixed64ToArray(
+    field_number, uint64 value, output) INL;
+  static inline uint8* WriteSFixed32ToArray(
+    field_number, int32 value, output) INL;
+  static inline uint8* WriteSFixed64ToArray(
+    field_number, int64 value, output) INL;
+  static inline uint8* WriteFloatToArray(
+    field_number, float value, output) INL;
+  static inline uint8* WriteDoubleToArray(
+    field_number, double value, output) INL;
+  static inline uint8* WriteBoolToArray(
+    field_number, bool value, output) INL;
+  static inline uint8* WriteEnumToArray(
+    field_number, int value, output) INL;
+
+  static inline uint8* WriteStringToArray(
+    field_number, const string& value, output) INL;
+  static inline uint8* WriteBytesToArray(
+    field_number, const string& value, output) INL;
+
+  static inline uint8* WriteGroupToArray(
+      field_number, const MessageLite& value, output) INL;
+  static inline uint8* WriteMessageToArray(
+      field_number, const MessageLite& value, output) INL;
+
+  // Like above, but de-virtualize the call to SerializeWithCachedSizes().  The
+  // pointer must point at an instance of MessageType, *not* a subclass (or
+  // the subclass must not override SerializeWithCachedSizes()).
+  template<typename MessageType>
+  static inline uint8* WriteGroupNoVirtualToArray(
+    field_number, const MessageType& value, output) INL;
+  template<typename MessageType>
+  static inline uint8* WriteMessageNoVirtualToArray(
+    field_number, const MessageType& value, output) INL;
+
+#undef output
+#undef input
+#undef INL
+
+#undef field_number
+
+  // Compute the byte size of a field.  The XxSize() functions do NOT include
+  // the tag, so you must also call TagSize().  (This is because, for repeated
+  // fields, you should only call TagSize() once and multiply it by the element
+  // count, but you may have to call XxSize() for each individual element.)
+  static inline int Int32Size   ( int32 value);
+  static inline int Int64Size   ( int64 value);
+  static inline int UInt32Size  (uint32 value);
+  static inline int UInt64Size  (uint64 value);
+  static inline int SInt32Size  ( int32 value);
+  static inline int SInt64Size  ( int64 value);
+  static inline int EnumSize    (   int value);
+
+  // These types always have the same size.
+  static const int kFixed32Size  = 4;
+  static const int kFixed64Size  = 8;
+  static const int kSFixed32Size = 4;
+  static const int kSFixed64Size = 8;
+  static const int kFloatSize    = 4;
+  static const int kDoubleSize   = 8;
+  static const int kBoolSize     = 1;
+
+  static inline int StringSize(const string& value);
+  static inline int BytesSize (const string& value);
+
+  static inline int GroupSize  (const MessageLite& value);
+  static inline int MessageSize(const MessageLite& value);
+
+  // Like above, but de-virtualize the call to ByteSize().  The
+  // pointer must point at an instance of MessageType, *not* a subclass (or
+  // the subclass must not override ByteSize()).
+  template<typename MessageType>
+  static inline int GroupSizeNoVirtual  (const MessageType& value);
+  template<typename MessageType>
+  static inline int MessageSizeNoVirtual(const MessageType& value);
+
+  // Given the length of data, calculate the byte size of the data on the
+  // wire if we encode the data as a length delimited field.
+  static inline int LengthDelimitedSize(int length);
+
+ private:
+  // A helper method for the repeated primitive reader. This method has
+  // optimizations for primitive types that have fixed size on the wire, and
+  // can be read using potentially faster paths.
+  template <typename CType, enum FieldType DeclaredType>
+  static inline bool ReadRepeatedFixedSizePrimitive(
+      int tag_size,
+      uint32 tag,
+      google::protobuf::io::CodedInputStream* input,
+      RepeatedField<CType>* value) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
+
+  static const CppType kFieldTypeToCppTypeMap[];
+  static const WireFormatLite::WireType kWireTypeForFieldType[];
+
+  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(WireFormatLite);
+};
+
+// A class which deals with unknown values.  The default implementation just
+// discards them.  WireFormat defines a subclass which writes to an
+// UnknownFieldSet.  This class is used by ExtensionSet::ParseField(), since
+// ExtensionSet is part of the lite library but UnknownFieldSet is not.
+class LIBPROTOBUF_EXPORT FieldSkipper {
+ public:
+  FieldSkipper() {}
+  virtual ~FieldSkipper() {}
+
+  // Skip a field whose tag has already been consumed.
+  virtual bool SkipField(io::CodedInputStream* input, uint32 tag);
+
+  // Skip an entire message or group, up to an end-group tag (which is consumed)
+  // or end-of-stream.
+  virtual bool SkipMessage(io::CodedInputStream* input);
+
+  // Deal with an already-parsed unrecognized enum value.  The default
+  // implementation does nothing, but the UnknownFieldSet-based implementation
+  // saves it as an unknown varint.
+  virtual void SkipUnknownEnum(int field_number, int value);
+};
+
+// inline methods ====================================================
+
+inline WireFormatLite::CppType
+WireFormatLite::FieldTypeToCppType(FieldType type) {
+  return kFieldTypeToCppTypeMap[type];
+}
+
+inline uint32 WireFormatLite::MakeTag(int field_number, WireType type) {
+  return GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(field_number, type);
+}
+
+inline WireFormatLite::WireType WireFormatLite::GetTagWireType(uint32 tag) {
+  return static_cast<WireType>(tag & kTagTypeMask);
+}
+
+inline int WireFormatLite::GetTagFieldNumber(uint32 tag) {
+  return static_cast<int>(tag >> kTagTypeBits);
+}
+
+inline int WireFormatLite::TagSize(int field_number,
+                                   WireFormatLite::FieldType type) {
+  int result = io::CodedOutputStream::VarintSize32(
+    field_number << kTagTypeBits);
+  if (type == TYPE_GROUP) {
+    // Groups have both a start and an end tag.
+    return result * 2;
+  } else {
+    return result;
+  }
+}
+
+inline uint32 WireFormatLite::EncodeFloat(float value) {
+  union {float f; uint32 i;};
+  f = value;
+  return i;
+}
+
+inline float WireFormatLite::DecodeFloat(uint32 value) {
+  union {float f; uint32 i;};
+  i = value;
+  return f;
+}
+
+inline uint64 WireFormatLite::EncodeDouble(double value) {
+  union {double f; uint64 i;};
+  f = value;
+  return i;
+}
+
+inline double WireFormatLite::DecodeDouble(uint64 value) {
+  union {double f; uint64 i;};
+  i = value;
+  return f;
+}
+
+// ZigZag Transform:  Encodes signed integers so that they can be
+// effectively used with varint encoding.
+//
+// varint operates on unsigned integers, encoding smaller numbers into
+// fewer bytes.  If you try to use it on a signed integer, it will treat
+// this number as a very large unsigned integer, which means that even
+// small signed numbers like -1 will take the maximum number of bytes
+// (10) to encode.  ZigZagEncode() maps signed integers to unsigned
+// in such a way that those with a small absolute value will have smaller
+// encoded values, making them appropriate for encoding using varint.
+//
+//       int32 ->     uint32
+// -------------------------
+//           0 ->          0
+//          -1 ->          1
+//           1 ->          2
+//          -2 ->          3
+//         ... ->        ...
+//  2147483647 -> 4294967294
+// -2147483648 -> 4294967295
+//
+//        >> encode >>
+//        << decode <<
+
+inline uint32 WireFormatLite::ZigZagEncode32(int32 n) {
+  // Note:  the right-shift must be arithmetic
+  return (n << 1) ^ (n >> 31);
+}
+
+inline int32 WireFormatLite::ZigZagDecode32(uint32 n) {
+  return (n >> 1) ^ -static_cast<int32>(n & 1);
+}
+
+inline uint64 WireFormatLite::ZigZagEncode64(int64 n) {
+  // Note:  the right-shift must be arithmetic
+  return (n << 1) ^ (n >> 63);
+}
+
+inline int64 WireFormatLite::ZigZagDecode64(uint64 n) {
+  return (n >> 1) ^ -static_cast<int64>(n & 1);
+}
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h b/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
new file mode 100644
index 00000000..641cc92f
--- /dev/null
+++ b/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
@@ -0,0 +1,776 @@
+// Protocol Buffers - Google's data interchange format
+// Copyright 2008 Google Inc.  All rights reserved.
+// http://code.google.com/p/protobuf/
+//
+// 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.
+
+// Author: kenton@google.com (Kenton Varda)
+//         wink@google.com (Wink Saville) (refactored from wire_format.h)
+//  Based on original Protocol Buffers design by
+//  Sanjay Ghemawat, Jeff Dean, and others.
+
+#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
+#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
+
+#include <string>
+#include <google/protobuf/stubs/common.h>
+#include <google/protobuf/message_lite.h>
+#include <google/protobuf/repeated_field.h>
+#include <google/protobuf/wire_format_lite.h>
+#include <google/protobuf/io/coded_stream.h>
+
+
+namespace google {
+namespace protobuf {
+namespace internal {
+
+// Implementation details of ReadPrimitive.
+
+template <>
+inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_INT32>(
+    io::CodedInputStream* input,
+    int32* value) {
+  uint32 temp;
+  if (!input->ReadVarint32(&temp)) return false;
+  *value = static_cast<int32>(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_INT64>(
+    io::CodedInputStream* input,
+    int64* value) {
+  uint64 temp;
+  if (!input->ReadVarint64(&temp)) return false;
+  *value = static_cast<int64>(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_UINT32>(
+    io::CodedInputStream* input,
+    uint32* value) {
+  return input->ReadVarint32(value);
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_UINT64>(
+    io::CodedInputStream* input,
+    uint64* value) {
+  return input->ReadVarint64(value);
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SINT32>(
+    io::CodedInputStream* input,
+    int32* value) {
+  uint32 temp;
+  if (!input->ReadVarint32(&temp)) return false;
+  *value = ZigZagDecode32(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SINT64>(
+    io::CodedInputStream* input,
+    int64* value) {
+  uint64 temp;
+  if (!input->ReadVarint64(&temp)) return false;
+  *value = ZigZagDecode64(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_FIXED32>(
+    io::CodedInputStream* input,
+    uint32* value) {
+  return input->ReadLittleEndian32(value);
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_FIXED64>(
+    io::CodedInputStream* input,
+    uint64* value) {
+  return input->ReadLittleEndian64(value);
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SFIXED32>(
+    io::CodedInputStream* input,
+    int32* value) {
+  uint32 temp;
+  if (!input->ReadLittleEndian32(&temp)) return false;
+  *value = static_cast<int32>(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SFIXED64>(
+    io::CodedInputStream* input,
+    int64* value) {
+  uint64 temp;
+  if (!input->ReadLittleEndian64(&temp)) return false;
+  *value = static_cast<int64>(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<float, WireFormatLite::TYPE_FLOAT>(
+    io::CodedInputStream* input,
+    float* value) {
+  uint32 temp;
+  if (!input->ReadLittleEndian32(&temp)) return false;
+  *value = DecodeFloat(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<double, WireFormatLite::TYPE_DOUBLE>(
+    io::CodedInputStream* input,
+    double* value) {
+  uint64 temp;
+  if (!input->ReadLittleEndian64(&temp)) return false;
+  *value = DecodeDouble(temp);
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<bool, WireFormatLite::TYPE_BOOL>(
+    io::CodedInputStream* input,
+    bool* value) {
+  uint32 temp;
+  if (!input->ReadVarint32(&temp)) return false;
+  *value = temp != 0;
+  return true;
+}
+template <>
+inline bool WireFormatLite::ReadPrimitive<int, WireFormatLite::TYPE_ENUM>(
+    io::CodedInputStream* input,
+    int* value) {
+  uint32 temp;
+  if (!input->ReadVarint32(&temp)) return false;
+  *value = static_cast<int>(temp);
+  return true;
+}
+
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  uint32, WireFormatLite::TYPE_FIXED32>(
+    const uint8* buffer,
+    uint32* value) {
+  return io::CodedInputStream::ReadLittleEndian32FromArray(buffer, value);
+}
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  uint64, WireFormatLite::TYPE_FIXED64>(
+    const uint8* buffer,
+    uint64* value) {
+  return io::CodedInputStream::ReadLittleEndian64FromArray(buffer, value);
+}
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  int32, WireFormatLite::TYPE_SFIXED32>(
+    const uint8* buffer,
+    int32* value) {
+  uint32 temp;
+  buffer = io::CodedInputStream::ReadLittleEndian32FromArray(buffer, &temp);
+  *value = static_cast<int32>(temp);
+  return buffer;
+}
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  int64, WireFormatLite::TYPE_SFIXED64>(
+    const uint8* buffer,
+    int64* value) {
+  uint64 temp;
+  buffer = io::CodedInputStream::ReadLittleEndian64FromArray(buffer, &temp);
+  *value = static_cast<int64>(temp);
+  return buffer;
+}
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  float, WireFormatLite::TYPE_FLOAT>(
+    const uint8* buffer,
+    float* value) {
+  uint32 temp;
+  buffer = io::CodedInputStream::ReadLittleEndian32FromArray(buffer, &temp);
+  *value = DecodeFloat(temp);
+  return buffer;
+}
+template <>
+inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
+  double, WireFormatLite::TYPE_DOUBLE>(
+    const uint8* buffer,
+    double* value) {
+  uint64 temp;
+  buffer = io::CodedInputStream::ReadLittleEndian64FromArray(buffer, &temp);
+  *value = DecodeDouble(temp);
+  return buffer;
+}
+
+template <typename CType, enum WireFormatLite::FieldType DeclaredType>
+inline bool WireFormatLite::ReadRepeatedPrimitive(int, // tag_size, unused.
+                                               uint32 tag,
+                                               io::CodedInputStream* input,
+                                               RepeatedField<CType>* values) {
+  CType value;
+  if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
+  values->Add(value);
+  int elements_already_reserved = values->Capacity() - values->size();
+  while (elements_already_reserved > 0 && input->ExpectTag(tag)) {
+    if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
+    values->AddAlreadyReserved(value);
+    elements_already_reserved--;
+  }
+  return true;
+}
+
+template <typename CType, enum WireFormatLite::FieldType DeclaredType>
+inline bool WireFormatLite::ReadRepeatedFixedSizePrimitive(
+    int tag_size,
+    uint32 tag,
+    io::CodedInputStream* input,
+    RepeatedField<CType>* values) {
+  GOOGLE_DCHECK_EQ(UInt32Size(tag), tag_size);
+  CType value;
+  if (!ReadPrimitive<CType, DeclaredType>(input, &value))
+    return false;
+  values->Add(value);
+
+  // For fixed size values, repeated values can be read more quickly by
+  // reading directly from a raw array.
+  //
+  // We can get a tight loop by only reading as many elements as can be
+  // added to the RepeatedField without having to do any resizing. Additionally,
+  // we only try to read as many elements as are available from the current
+  // buffer space. Doing so avoids having to perform boundary checks when
+  // reading the value: the maximum number of elements that can be read is
+  // known outside of the loop.
+  const void* void_pointer;
+  int size;
+  input->GetDirectBufferPointerInline(&void_pointer, &size);
+  if (size > 0) {
+    const uint8* buffer = reinterpret_cast<const uint8*>(void_pointer);
+    // The number of bytes each type occupies on the wire.
+    const int per_value_size = tag_size + sizeof(value);
+
+    int elements_available = min(values->Capacity() - values->size(),
+                                 size / per_value_size);
+    int num_read = 0;
+    while (num_read < elements_available &&
+           (buffer = io::CodedInputStream::ExpectTagFromArray(
+               buffer, tag)) != NULL) {
+      buffer = ReadPrimitiveFromArray<CType, DeclaredType>(buffer, &value);
+      values->AddAlreadyReserved(value);
+      ++num_read;
+    }
+    const int read_bytes = num_read * per_value_size;
+    if (read_bytes > 0) {
+      input->Skip(read_bytes);
+    }
+  }
+  return true;
+}
+
+// Specializations of ReadRepeatedPrimitive for the fixed size types, which use 
+// the optimized code path.
+#define READ_REPEATED_FIXED_SIZE_PRIMITIVE(CPPTYPE, DECLARED_TYPE)             \
+template <>                                                                    \
+inline bool WireFormatLite::ReadRepeatedPrimitive<                             \
+  CPPTYPE, WireFormatLite::DECLARED_TYPE>(                                     \
+    int tag_size,                                                              \
+    uint32 tag,                                                                \
+    io::CodedInputStream* input,                                               \
+    RepeatedField<CPPTYPE>* values) {                                          \
+  return ReadRepeatedFixedSizePrimitive<                                       \
+    CPPTYPE, WireFormatLite::DECLARED_TYPE>(                                   \
+      tag_size, tag, input, values);                                           \
+}
+
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(uint32, TYPE_FIXED32)
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(uint64, TYPE_FIXED64)
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(int32, TYPE_SFIXED32)
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(int64, TYPE_SFIXED64)
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(float, TYPE_FLOAT)
+READ_REPEATED_FIXED_SIZE_PRIMITIVE(double, TYPE_DOUBLE)
+
+#undef READ_REPEATED_FIXED_SIZE_PRIMITIVE
+
+template <typename CType, enum WireFormatLite::FieldType DeclaredType>
+bool WireFormatLite::ReadRepeatedPrimitiveNoInline(
+    int tag_size,
+    uint32 tag,
+    io::CodedInputStream* input,
+    RepeatedField<CType>* value) {
+  return ReadRepeatedPrimitive<CType, DeclaredType>(
+      tag_size, tag, input, value);
+}
+
+template <typename CType, enum WireFormatLite::FieldType DeclaredType>
+inline bool WireFormatLite::ReadPackedPrimitive(io::CodedInputStream* input,
+                                                RepeatedField<CType>* values) {
+  uint32 length;
+  if (!input->ReadVarint32(&length)) return false;
+  io::CodedInputStream::Limit limit = input->PushLimit(length);
+  while (input->BytesUntilLimit() > 0) {
+    CType value;
+    if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
+    values->Add(value);
+  }
+  input->PopLimit(limit);
+  return true;
+}
+
+template <typename CType, enum WireFormatLite::FieldType DeclaredType>
+bool WireFormatLite::ReadPackedPrimitiveNoInline(io::CodedInputStream* input,
+                                                 RepeatedField<CType>* values) {
+  return ReadPackedPrimitive<CType, DeclaredType>(input, values);
+}
+
+
+inline bool WireFormatLite::ReadGroup(int field_number,
+                                      io::CodedInputStream* input,
+                                      MessageLite* value) {
+  if (!input->IncrementRecursionDepth()) return false;
+  if (!value->MergePartialFromCodedStream(input)) return false;
+  input->DecrementRecursionDepth();
+  // Make sure the last thing read was an end tag for this group.
+  if (!input->LastTagWas(MakeTag(field_number, WIRETYPE_END_GROUP))) {
+    return false;
+  }
+  return true;
+}
+inline bool WireFormatLite::ReadMessage(io::CodedInputStream* input,
+                                        MessageLite* value) {
+  uint32 length;
+  if (!input->ReadVarint32(&length)) return false;
+  if (!input->IncrementRecursionDepth()) return false;
+  io::CodedInputStream::Limit limit = input->PushLimit(length);
+  if (!value->MergePartialFromCodedStream(input)) return false;
+  // Make sure that parsing stopped when the limit was hit, not at an endgroup
+  // tag.
+  if (!input->ConsumedEntireMessage()) return false;
+  input->PopLimit(limit);
+  input->DecrementRecursionDepth();
+  return true;
+}
+
+// We name the template parameter something long and extremely unlikely to occur
+// elsewhere because a *qualified* member access expression designed to avoid
+// virtual dispatch, C++03 [basic.lookup.classref] 3.4.5/4 requires that the
+// name of the qualifying class to be looked up both in the context of the full
+// expression (finding the template parameter) and in the context of the object
+// whose member we are accessing. This could potentially find a nested type
+// within that object. The standard goes on to require these names to refer to
+// the same entity, which this collision would violate. The lack of a safe way
+// to avoid this collision appears to be a defect in the standard, but until it
+// is corrected, we choose the name to avoid accidental collisions.
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline bool WireFormatLite::ReadGroupNoVirtual(
+    int field_number, io::CodedInputStream* input,
+    MessageType_WorkAroundCppLookupDefect* value) {
+  if (!input->IncrementRecursionDepth()) return false;
+  if (!value->
+      MessageType_WorkAroundCppLookupDefect::MergePartialFromCodedStream(input))
+    return false;
+  input->DecrementRecursionDepth();
+  // Make sure the last thing read was an end tag for this group.
+  if (!input->LastTagWas(MakeTag(field_number, WIRETYPE_END_GROUP))) {
+    return false;
+  }
+  return true;
+}
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline bool WireFormatLite::ReadMessageNoVirtual(
+    io::CodedInputStream* input, MessageType_WorkAroundCppLookupDefect* value) {
+  uint32 length;
+  if (!input->ReadVarint32(&length)) return false;
+  if (!input->IncrementRecursionDepth()) return false;
+  io::CodedInputStream::Limit limit = input->PushLimit(length);
+  if (!value->
+      MessageType_WorkAroundCppLookupDefect::MergePartialFromCodedStream(input))
+    return false;
+  // Make sure that parsing stopped when the limit was hit, not at an endgroup
+  // tag.
+  if (!input->ConsumedEntireMessage()) return false;
+  input->PopLimit(limit);
+  input->DecrementRecursionDepth();
+  return true;
+}
+
+// ===================================================================
+
+inline void WireFormatLite::WriteTag(int field_number, WireType type,
+                                     io::CodedOutputStream* output) {
+  output->WriteTag(MakeTag(field_number, type));
+}
+
+inline void WireFormatLite::WriteInt32NoTag(int32 value,
+                                            io::CodedOutputStream* output) {
+  output->WriteVarint32SignExtended(value);
+}
+inline void WireFormatLite::WriteInt64NoTag(int64 value,
+                                            io::CodedOutputStream* output) {
+  output->WriteVarint64(static_cast<uint64>(value));
+}
+inline void WireFormatLite::WriteUInt32NoTag(uint32 value,
+                                             io::CodedOutputStream* output) {
+  output->WriteVarint32(value);
+}
+inline void WireFormatLite::WriteUInt64NoTag(uint64 value,
+                                             io::CodedOutputStream* output) {
+  output->WriteVarint64(value);
+}
+inline void WireFormatLite::WriteSInt32NoTag(int32 value,
+                                             io::CodedOutputStream* output) {
+  output->WriteVarint32(ZigZagEncode32(value));
+}
+inline void WireFormatLite::WriteSInt64NoTag(int64 value,
+                                             io::CodedOutputStream* output) {
+  output->WriteVarint64(ZigZagEncode64(value));
+}
+inline void WireFormatLite::WriteFixed32NoTag(uint32 value,
+                                              io::CodedOutputStream* output) {
+  output->WriteLittleEndian32(value);
+}
+inline void WireFormatLite::WriteFixed64NoTag(uint64 value,
+                                              io::CodedOutputStream* output) {
+  output->WriteLittleEndian64(value);
+}
+inline void WireFormatLite::WriteSFixed32NoTag(int32 value,
+                                               io::CodedOutputStream* output) {
+  output->WriteLittleEndian32(static_cast<uint32>(value));
+}
+inline void WireFormatLite::WriteSFixed64NoTag(int64 value,
+                                               io::CodedOutputStream* output) {
+  output->WriteLittleEndian64(static_cast<uint64>(value));
+}
+inline void WireFormatLite::WriteFloatNoTag(float value,
+                                            io::CodedOutputStream* output) {
+  output->WriteLittleEndian32(EncodeFloat(value));
+}
+inline void WireFormatLite::WriteDoubleNoTag(double value,
+                                             io::CodedOutputStream* output) {
+  output->WriteLittleEndian64(EncodeDouble(value));
+}
+inline void WireFormatLite::WriteBoolNoTag(bool value,
+                                           io::CodedOutputStream* output) {
+  output->WriteVarint32(value ? 1 : 0);
+}
+inline void WireFormatLite::WriteEnumNoTag(int value,
+                                           io::CodedOutputStream* output) {
+  output->WriteVarint32SignExtended(value);
+}
+
+// See comment on ReadGroupNoVirtual to understand the need for this template
+// parameter name.
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline void WireFormatLite::WriteGroupNoVirtual(
+    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
+    io::CodedOutputStream* output) {
+  WriteTag(field_number, WIRETYPE_START_GROUP, output);
+  value.MessageType_WorkAroundCppLookupDefect::SerializeWithCachedSizes(output);
+  WriteTag(field_number, WIRETYPE_END_GROUP, output);
+}
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline void WireFormatLite::WriteMessageNoVirtual(
+    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
+    io::CodedOutputStream* output) {
+  WriteTag(field_number, WIRETYPE_LENGTH_DELIMITED, output);
+  output->WriteVarint32(
+      value.MessageType_WorkAroundCppLookupDefect::GetCachedSize());
+  value.MessageType_WorkAroundCppLookupDefect::SerializeWithCachedSizes(output);
+}
+
+// ===================================================================
+
+inline uint8* WireFormatLite::WriteTagToArray(int field_number,
+                                              WireType type,
+                                              uint8* target) {
+  return io::CodedOutputStream::WriteTagToArray(MakeTag(field_number, type),
+                                                target);
+}
+
+inline uint8* WireFormatLite::WriteInt32NoTagToArray(int32 value,
+                                                     uint8* target) {
+  return io::CodedOutputStream::WriteVarint32SignExtendedToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteInt64NoTagToArray(int64 value,
+                                                     uint8* target) {
+  return io::CodedOutputStream::WriteVarint64ToArray(
+      static_cast<uint64>(value), target);
+}
+inline uint8* WireFormatLite::WriteUInt32NoTagToArray(uint32 value,
+                                                      uint8* target) {
+  return io::CodedOutputStream::WriteVarint32ToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteUInt64NoTagToArray(uint64 value,
+                                                      uint8* target) {
+  return io::CodedOutputStream::WriteVarint64ToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSInt32NoTagToArray(int32 value,
+                                                      uint8* target) {
+  return io::CodedOutputStream::WriteVarint32ToArray(ZigZagEncode32(value),
+                                                     target);
+}
+inline uint8* WireFormatLite::WriteSInt64NoTagToArray(int64 value,
+                                                      uint8* target) {
+  return io::CodedOutputStream::WriteVarint64ToArray(ZigZagEncode64(value),
+                                                     target);
+}
+inline uint8* WireFormatLite::WriteFixed32NoTagToArray(uint32 value,
+                                                       uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian32ToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteFixed64NoTagToArray(uint64 value,
+                                                       uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian64ToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSFixed32NoTagToArray(int32 value,
+                                                        uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian32ToArray(
+      static_cast<uint32>(value), target);
+}
+inline uint8* WireFormatLite::WriteSFixed64NoTagToArray(int64 value,
+                                                        uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian64ToArray(
+      static_cast<uint64>(value), target);
+}
+inline uint8* WireFormatLite::WriteFloatNoTagToArray(float value,
+                                                     uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian32ToArray(EncodeFloat(value),
+                                                           target);
+}
+inline uint8* WireFormatLite::WriteDoubleNoTagToArray(double value,
+                                                      uint8* target) {
+  return io::CodedOutputStream::WriteLittleEndian64ToArray(EncodeDouble(value),
+                                                           target);
+}
+inline uint8* WireFormatLite::WriteBoolNoTagToArray(bool value,
+                                                    uint8* target) {
+  return io::CodedOutputStream::WriteVarint32ToArray(value ? 1 : 0, target);
+}
+inline uint8* WireFormatLite::WriteEnumNoTagToArray(int value,
+                                                    uint8* target) {
+  return io::CodedOutputStream::WriteVarint32SignExtendedToArray(value, target);
+}
+
+inline uint8* WireFormatLite::WriteInt32ToArray(int field_number,
+                                                int32 value,
+                                                uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteInt32NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteInt64ToArray(int field_number,
+                                                int64 value,
+                                                uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteInt64NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteUInt32ToArray(int field_number,
+                                                 uint32 value,
+                                                 uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteUInt32NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteUInt64ToArray(int field_number,
+                                                 uint64 value,
+                                                 uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteUInt64NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSInt32ToArray(int field_number,
+                                                 int32 value,
+                                                 uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteSInt32NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSInt64ToArray(int field_number,
+                                                 int64 value,
+                                                 uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteSInt64NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteFixed32ToArray(int field_number,
+                                                  uint32 value,
+                                                  uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
+  return WriteFixed32NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteFixed64ToArray(int field_number,
+                                                  uint64 value,
+                                                  uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
+  return WriteFixed64NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSFixed32ToArray(int field_number,
+                                                   int32 value,
+                                                   uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
+  return WriteSFixed32NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteSFixed64ToArray(int field_number,
+                                                   int64 value,
+                                                   uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
+  return WriteSFixed64NoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteFloatToArray(int field_number,
+                                                float value,
+                                                uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
+  return WriteFloatNoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteDoubleToArray(int field_number,
+                                                 double value,
+                                                 uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
+  return WriteDoubleNoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteBoolToArray(int field_number,
+                                               bool value,
+                                               uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteBoolNoTagToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteEnumToArray(int field_number,
+                                               int value,
+                                               uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
+  return WriteEnumNoTagToArray(value, target);
+}
+
+inline uint8* WireFormatLite::WriteStringToArray(int field_number,
+                                                 const string& value,
+                                                 uint8* target) {
+  // String is for UTF-8 text only
+  // WARNING:  In wire_format.cc, both strings and bytes are handled by
+  //   WriteString() to avoid code duplication.  If the implementations become
+  //   different, you will need to update that usage.
+  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
+  target = io::CodedOutputStream::WriteVarint32ToArray(value.size(), target);
+  return io::CodedOutputStream::WriteStringToArray(value, target);
+}
+inline uint8* WireFormatLite::WriteBytesToArray(int field_number,
+                                                const string& value,
+                                                uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
+  target = io::CodedOutputStream::WriteVarint32ToArray(value.size(), target);
+  return io::CodedOutputStream::WriteStringToArray(value, target);
+}
+
+
+inline uint8* WireFormatLite::WriteGroupToArray(int field_number,
+                                                const MessageLite& value,
+                                                uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_START_GROUP, target);
+  target = value.SerializeWithCachedSizesToArray(target);
+  return WriteTagToArray(field_number, WIRETYPE_END_GROUP, target);
+}
+inline uint8* WireFormatLite::WriteMessageToArray(int field_number,
+                                                  const MessageLite& value,
+                                                  uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
+  target = io::CodedOutputStream::WriteVarint32ToArray(
+    value.GetCachedSize(), target);
+  return value.SerializeWithCachedSizesToArray(target);
+}
+
+// See comment on ReadGroupNoVirtual to understand the need for this template
+// parameter name.
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline uint8* WireFormatLite::WriteGroupNoVirtualToArray(
+    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
+    uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_START_GROUP, target);
+  target = value.MessageType_WorkAroundCppLookupDefect
+      ::SerializeWithCachedSizesToArray(target);
+  return WriteTagToArray(field_number, WIRETYPE_END_GROUP, target);
+}
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline uint8* WireFormatLite::WriteMessageNoVirtualToArray(
+    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
+    uint8* target) {
+  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
+  target = io::CodedOutputStream::WriteVarint32ToArray(
+    value.MessageType_WorkAroundCppLookupDefect::GetCachedSize(), target);
+  return value.MessageType_WorkAroundCppLookupDefect
+      ::SerializeWithCachedSizesToArray(target);
+}
+
+// ===================================================================
+
+inline int WireFormatLite::Int32Size(int32 value) {
+  return io::CodedOutputStream::VarintSize32SignExtended(value);
+}
+inline int WireFormatLite::Int64Size(int64 value) {
+  return io::CodedOutputStream::VarintSize64(static_cast<uint64>(value));
+}
+inline int WireFormatLite::UInt32Size(uint32 value) {
+  return io::CodedOutputStream::VarintSize32(value);
+}
+inline int WireFormatLite::UInt64Size(uint64 value) {
+  return io::CodedOutputStream::VarintSize64(value);
+}
+inline int WireFormatLite::SInt32Size(int32 value) {
+  return io::CodedOutputStream::VarintSize32(ZigZagEncode32(value));
+}
+inline int WireFormatLite::SInt64Size(int64 value) {
+  return io::CodedOutputStream::VarintSize64(ZigZagEncode64(value));
+}
+inline int WireFormatLite::EnumSize(int value) {
+  return io::CodedOutputStream::VarintSize32SignExtended(value);
+}
+
+inline int WireFormatLite::StringSize(const string& value) {
+  return io::CodedOutputStream::VarintSize32(value.size()) +
+         value.size();
+}
+inline int WireFormatLite::BytesSize(const string& value) {
+  return io::CodedOutputStream::VarintSize32(value.size()) +
+         value.size();
+}
+
+
+inline int WireFormatLite::GroupSize(const MessageLite& value) {
+  return value.ByteSize();
+}
+inline int WireFormatLite::MessageSize(const MessageLite& value) {
+  return LengthDelimitedSize(value.ByteSize());
+}
+
+// See comment on ReadGroupNoVirtual to understand the need for this template
+// parameter name.
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline int WireFormatLite::GroupSizeNoVirtual(
+    const MessageType_WorkAroundCppLookupDefect& value) {
+  return value.MessageType_WorkAroundCppLookupDefect::ByteSize();
+}
+template<typename MessageType_WorkAroundCppLookupDefect>
+inline int WireFormatLite::MessageSizeNoVirtual(
+    const MessageType_WorkAroundCppLookupDefect& value) {
+  return LengthDelimitedSize(
+      value.MessageType_WorkAroundCppLookupDefect::ByteSize());
+}
+
+inline int WireFormatLite::LengthDelimitedSize(int length) {
+  return io::CodedOutputStream::VarintSize32(length) + length;
+}
+
+}  // namespace internal
+}  // namespace protobuf
+
+}  // namespace google
+#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
diff --git a/ps-lite/deps/include/zmq.h b/ps-lite/deps/include/zmq.h
new file mode 100644
index 00000000..c58885b4
--- /dev/null
+++ b/ps-lite/deps/include/zmq.h
@@ -0,0 +1,463 @@
+/*
+    Copyright (c) 2007-2015 Contributors as noted in the AUTHORS file
+
+    This file is part of 0MQ.
+
+    0MQ is free software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation; either version 3 of the License, or
+    (at your option) any later version.
+
+    0MQ is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+    *************************************************************************
+    NOTE to contributors. This file comprises the principal public contract
+    for ZeroMQ API users (along with zmq_utils.h). Any change to this file
+    supplied in a stable release SHOULD not break existing applications.
+    In practice this means that the value of constants must not change, and
+    that old values may not be reused for new constants.
+    *************************************************************************
+*/
+
+#ifndef __ZMQ_H_INCLUDED__
+#define __ZMQ_H_INCLUDED__
+
+/*  Version macros for compile-time API version detection                     */
+#define ZMQ_VERSION_MAJOR 4
+#define ZMQ_VERSION_MINOR 1
+#define ZMQ_VERSION_PATCH 4
+
+#define ZMQ_MAKE_VERSION(major, minor, patch) \
+    ((major) * 10000 + (minor) * 100 + (patch))
+#define ZMQ_VERSION \
+    ZMQ_MAKE_VERSION(ZMQ_VERSION_MAJOR, ZMQ_VERSION_MINOR, ZMQ_VERSION_PATCH)
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#if !defined _WIN32_WCE
+#include <errno.h>
+#endif
+#include <stddef.h>
+#include <stdio.h>
+#if defined _WIN32
+#include <winsock2.h>
+#endif
+
+/*  Handle DSO symbol visibility                                             */
+#if defined _WIN32
+#   if defined ZMQ_STATIC
+#       define ZMQ_EXPORT
+#   elif defined DLL_EXPORT
+#       define ZMQ_EXPORT __declspec(dllexport)
+#   else
+#       define ZMQ_EXPORT __declspec(dllimport)
+#   endif
+#else
+#   if defined __SUNPRO_C  || defined __SUNPRO_CC
+#       define ZMQ_EXPORT __global
+#   elif (defined __GNUC__ && __GNUC__ >= 4) || defined __INTEL_COMPILER
+#       define ZMQ_EXPORT __attribute__ ((visibility("default")))
+#   else
+#       define ZMQ_EXPORT
+#   endif
+#endif
+
+/*  Define integer types needed for event interface                          */
+#define ZMQ_DEFINED_STDINT 1
+#if defined ZMQ_HAVE_SOLARIS || defined ZMQ_HAVE_OPENVMS
+#   include <inttypes.h>
+#else
+#   include <stdint.h>
+#endif
+
+
+/******************************************************************************/
+/*  0MQ errors.                                                               */
+/******************************************************************************/
+
+/*  A number random enough not to collide with different errno ranges on      */
+/*  different OSes. The assumption is that error_t is at least 32-bit type.   */
+#define ZMQ_HAUSNUMERO 156384712
+
+/*  On Windows platform some of the standard POSIX errnos are not defined.    */
+#ifndef ENOTSUP
+#define ENOTSUP (ZMQ_HAUSNUMERO + 1)
+#endif
+#ifndef EPROTONOSUPPORT
+#define EPROTONOSUPPORT (ZMQ_HAUSNUMERO + 2)
+#endif
+#ifndef ENOBUFS
+#define ENOBUFS (ZMQ_HAUSNUMERO + 3)
+#endif
+#ifndef ENETDOWN
+#define ENETDOWN (ZMQ_HAUSNUMERO + 4)
+#endif
+#ifndef EADDRINUSE
+#define EADDRINUSE (ZMQ_HAUSNUMERO + 5)
+#endif
+#ifndef EADDRNOTAVAIL
+#define EADDRNOTAVAIL (ZMQ_HAUSNUMERO + 6)
+#endif
+#ifndef ECONNREFUSED
+#define ECONNREFUSED (ZMQ_HAUSNUMERO + 7)
+#endif
+#ifndef EINPROGRESS
+#define EINPROGRESS (ZMQ_HAUSNUMERO + 8)
+#endif
+#ifndef ENOTSOCK
+#define ENOTSOCK (ZMQ_HAUSNUMERO + 9)
+#endif
+#ifndef EMSGSIZE
+#define EMSGSIZE (ZMQ_HAUSNUMERO + 10)
+#endif
+#ifndef EAFNOSUPPORT
+#define EAFNOSUPPORT (ZMQ_HAUSNUMERO + 11)
+#endif
+#ifndef ENETUNREACH
+#define ENETUNREACH (ZMQ_HAUSNUMERO + 12)
+#endif
+#ifndef ECONNABORTED
+#define ECONNABORTED (ZMQ_HAUSNUMERO + 13)
+#endif
+#ifndef ECONNRESET
+#define ECONNRESET (ZMQ_HAUSNUMERO + 14)
+#endif
+#ifndef ENOTCONN
+#define ENOTCONN (ZMQ_HAUSNUMERO + 15)
+#endif
+#ifndef ETIMEDOUT
+#define ETIMEDOUT (ZMQ_HAUSNUMERO + 16)
+#endif
+#ifndef EHOSTUNREACH
+#define EHOSTUNREACH (ZMQ_HAUSNUMERO + 17)
+#endif
+#ifndef ENETRESET
+#define ENETRESET (ZMQ_HAUSNUMERO + 18)
+#endif
+
+/*  Native 0MQ error codes.                                                   */
+#define EFSM (ZMQ_HAUSNUMERO + 51)
+#define ENOCOMPATPROTO (ZMQ_HAUSNUMERO + 52)
+#define ETERM (ZMQ_HAUSNUMERO + 53)
+#define EMTHREAD (ZMQ_HAUSNUMERO + 54)
+
+/*  This function retrieves the errno as it is known to 0MQ library. The goal */
+/*  of this function is to make the code 100% portable, including where 0MQ   */
+/*  compiled with certain CRT library (on Windows) is linked to an            */
+/*  application that uses different CRT library.                              */
+ZMQ_EXPORT int zmq_errno (void);
+
+/*  Resolves system errors and 0MQ errors to human-readable string.           */
+ZMQ_EXPORT const char *zmq_strerror (int errnum);
+
+/*  Run-time API version detection                                            */
+ZMQ_EXPORT void zmq_version (int *major, int *minor, int *patch);
+
+/******************************************************************************/
+/*  0MQ infrastructure (a.k.a. context) initialisation & termination.         */
+/******************************************************************************/
+
+/*  New API                                                                   */
+/*  Context options                                                           */
+#define ZMQ_IO_THREADS  1
+#define ZMQ_MAX_SOCKETS 2
+#define ZMQ_SOCKET_LIMIT 3
+#define ZMQ_THREAD_PRIORITY 3
+#define ZMQ_THREAD_SCHED_POLICY 4
+
+/*  Default for new contexts                                                  */
+#define ZMQ_IO_THREADS_DFLT  1
+#define ZMQ_MAX_SOCKETS_DFLT 1023
+#define ZMQ_THREAD_PRIORITY_DFLT -1
+#define ZMQ_THREAD_SCHED_POLICY_DFLT -1
+
+ZMQ_EXPORT void *zmq_ctx_new (void);
+ZMQ_EXPORT int zmq_ctx_term (void *context);
+ZMQ_EXPORT int zmq_ctx_shutdown (void *ctx_);
+ZMQ_EXPORT int zmq_ctx_set (void *context, int option, int optval);
+ZMQ_EXPORT int zmq_ctx_get (void *context, int option);
+
+/*  Old (legacy) API                                                          */
+ZMQ_EXPORT void *zmq_init (int io_threads);
+ZMQ_EXPORT int zmq_term (void *context);
+ZMQ_EXPORT int zmq_ctx_destroy (void *context);
+
+
+/******************************************************************************/
+/*  0MQ message definition.                                                   */
+/******************************************************************************/
+
+typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;
+
+typedef void (zmq_free_fn) (void *data, void *hint);
+
+ZMQ_EXPORT int zmq_msg_init (zmq_msg_t *msg);
+ZMQ_EXPORT int zmq_msg_init_size (zmq_msg_t *msg, size_t size);
+ZMQ_EXPORT int zmq_msg_init_data (zmq_msg_t *msg, void *data,
+    size_t size, zmq_free_fn *ffn, void *hint);
+ZMQ_EXPORT int zmq_msg_send (zmq_msg_t *msg, void *s, int flags);
+ZMQ_EXPORT int zmq_msg_recv (zmq_msg_t *msg, void *s, int flags);
+ZMQ_EXPORT int zmq_msg_close (zmq_msg_t *msg);
+ZMQ_EXPORT int zmq_msg_move (zmq_msg_t *dest, zmq_msg_t *src);
+ZMQ_EXPORT int zmq_msg_copy (zmq_msg_t *dest, zmq_msg_t *src);
+ZMQ_EXPORT void *zmq_msg_data (zmq_msg_t *msg);
+ZMQ_EXPORT size_t zmq_msg_size (zmq_msg_t *msg);
+ZMQ_EXPORT int zmq_msg_more (zmq_msg_t *msg);
+ZMQ_EXPORT int zmq_msg_get (zmq_msg_t *msg, int property);
+ZMQ_EXPORT int zmq_msg_set (zmq_msg_t *msg, int property, int optval);
+ZMQ_EXPORT const char *zmq_msg_gets (zmq_msg_t *msg, const char *property);
+
+
+/******************************************************************************/
+/*  0MQ socket definition.                                                    */
+/******************************************************************************/
+
+/*  Socket types.                                                             */
+#define ZMQ_PAIR 0
+#define ZMQ_PUB 1
+#define ZMQ_SUB 2
+#define ZMQ_REQ 3
+#define ZMQ_REP 4
+#define ZMQ_DEALER 5
+#define ZMQ_ROUTER 6
+#define ZMQ_PULL 7
+#define ZMQ_PUSH 8
+#define ZMQ_XPUB 9
+#define ZMQ_XSUB 10
+#define ZMQ_STREAM 11
+
+/*  Deprecated aliases                                                        */
+#define ZMQ_XREQ ZMQ_DEALER
+#define ZMQ_XREP ZMQ_ROUTER
+
+/*  Socket options.                                                           */
+#define ZMQ_AFFINITY 4
+#define ZMQ_IDENTITY 5
+#define ZMQ_SUBSCRIBE 6
+#define ZMQ_UNSUBSCRIBE 7
+#define ZMQ_RATE 8
+#define ZMQ_RECOVERY_IVL 9
+#define ZMQ_SNDBUF 11
+#define ZMQ_RCVBUF 12
+#define ZMQ_RCVMORE 13
+#define ZMQ_FD 14
+#define ZMQ_EVENTS 15
+#define ZMQ_TYPE 16
+#define ZMQ_LINGER 17
+#define ZMQ_RECONNECT_IVL 18
+#define ZMQ_BACKLOG 19
+#define ZMQ_RECONNECT_IVL_MAX 21
+#define ZMQ_MAXMSGSIZE 22
+#define ZMQ_SNDHWM 23
+#define ZMQ_RCVHWM 24
+#define ZMQ_MULTICAST_HOPS 25
+#define ZMQ_RCVTIMEO 27
+#define ZMQ_SNDTIMEO 28
+#define ZMQ_LAST_ENDPOINT 32
+#define ZMQ_ROUTER_MANDATORY 33
+#define ZMQ_TCP_KEEPALIVE 34
+#define ZMQ_TCP_KEEPALIVE_CNT 35
+#define ZMQ_TCP_KEEPALIVE_IDLE 36
+#define ZMQ_TCP_KEEPALIVE_INTVL 37
+#define ZMQ_IMMEDIATE 39
+#define ZMQ_XPUB_VERBOSE 40
+#define ZMQ_ROUTER_RAW 41
+#define ZMQ_IPV6 42
+#define ZMQ_MECHANISM 43
+#define ZMQ_PLAIN_SERVER 44
+#define ZMQ_PLAIN_USERNAME 45
+#define ZMQ_PLAIN_PASSWORD 46
+#define ZMQ_CURVE_SERVER 47
+#define ZMQ_CURVE_PUBLICKEY 48
+#define ZMQ_CURVE_SECRETKEY 49
+#define ZMQ_CURVE_SERVERKEY 50
+#define ZMQ_PROBE_ROUTER 51
+#define ZMQ_REQ_CORRELATE 52
+#define ZMQ_REQ_RELAXED 53
+#define ZMQ_CONFLATE 54
+#define ZMQ_ZAP_DOMAIN 55
+#define ZMQ_ROUTER_HANDOVER 56
+#define ZMQ_TOS 57
+#define ZMQ_CONNECT_RID 61
+#define ZMQ_GSSAPI_SERVER 62
+#define ZMQ_GSSAPI_PRINCIPAL 63
+#define ZMQ_GSSAPI_SERVICE_PRINCIPAL 64
+#define ZMQ_GSSAPI_PLAINTEXT 65
+#define ZMQ_HANDSHAKE_IVL 66
+#define ZMQ_SOCKS_PROXY 68
+#define ZMQ_XPUB_NODROP 69
+
+/*  Message options                                                           */
+#define ZMQ_MORE 1
+#define ZMQ_SRCFD 2
+#define ZMQ_SHARED 3
+
+/*  Send/recv options.                                                        */
+#define ZMQ_DONTWAIT 1
+#define ZMQ_SNDMORE 2
+
+/*  Security mechanisms                                                       */
+#define ZMQ_NULL 0
+#define ZMQ_PLAIN 1
+#define ZMQ_CURVE 2
+#define ZMQ_GSSAPI 3
+
+/*  Deprecated options and aliases                                            */
+#define ZMQ_TCP_ACCEPT_FILTER       38
+#define ZMQ_IPC_FILTER_PID          58
+#define ZMQ_IPC_FILTER_UID          59
+#define ZMQ_IPC_FILTER_GID          60
+#define ZMQ_IPV4ONLY                31
+#define ZMQ_DELAY_ATTACH_ON_CONNECT ZMQ_IMMEDIATE
+#define ZMQ_NOBLOCK                 ZMQ_DONTWAIT
+#define ZMQ_FAIL_UNROUTABLE         ZMQ_ROUTER_MANDATORY
+#define ZMQ_ROUTER_BEHAVIOR         ZMQ_ROUTER_MANDATORY
+
+/******************************************************************************/
+/*  0MQ socket events and monitoring                                          */
+/******************************************************************************/
+
+/*  Socket transport events (TCP and IPC only)                                */
+
+#define ZMQ_EVENT_CONNECTED         0x0001
+#define ZMQ_EVENT_CONNECT_DELAYED   0x0002
+#define ZMQ_EVENT_CONNECT_RETRIED   0x0004
+#define ZMQ_EVENT_LISTENING         0x0008
+#define ZMQ_EVENT_BIND_FAILED       0x0010
+#define ZMQ_EVENT_ACCEPTED          0x0020
+#define ZMQ_EVENT_ACCEPT_FAILED     0x0040
+#define ZMQ_EVENT_CLOSED            0x0080
+#define ZMQ_EVENT_CLOSE_FAILED      0x0100
+#define ZMQ_EVENT_DISCONNECTED      0x0200
+#define ZMQ_EVENT_MONITOR_STOPPED   0x0400
+#define ZMQ_EVENT_ALL               0xFFFF
+
+ZMQ_EXPORT void *zmq_socket (void *, int type);
+ZMQ_EXPORT int zmq_close (void *s);
+ZMQ_EXPORT int zmq_setsockopt (void *s, int option, const void *optval,
+    size_t optvallen);
+ZMQ_EXPORT int zmq_getsockopt (void *s, int option, void *optval,
+    size_t *optvallen);
+ZMQ_EXPORT int zmq_bind (void *s, const char *addr);
+ZMQ_EXPORT int zmq_connect (void *s, const char *addr);
+ZMQ_EXPORT int zmq_unbind (void *s, const char *addr);
+ZMQ_EXPORT int zmq_disconnect (void *s, const char *addr);
+ZMQ_EXPORT int zmq_send (void *s, const void *buf, size_t len, int flags);
+ZMQ_EXPORT int zmq_send_const (void *s, const void *buf, size_t len, int flags);
+ZMQ_EXPORT int zmq_recv (void *s, void *buf, size_t len, int flags);
+ZMQ_EXPORT int zmq_socket_monitor (void *s, const char *addr, int events);
+
+
+/******************************************************************************/
+/*  I/O multiplexing.                                                         */
+/******************************************************************************/
+
+#define ZMQ_POLLIN 1
+#define ZMQ_POLLOUT 2
+#define ZMQ_POLLERR 4
+
+typedef struct zmq_pollitem_t
+{
+    void *socket;
+#if defined _WIN32
+    SOCKET fd;
+#else
+    int fd;
+#endif
+    short events;
+    short revents;
+} zmq_pollitem_t;
+
+#define ZMQ_POLLITEMS_DFLT 16
+
+ZMQ_EXPORT int zmq_poll (zmq_pollitem_t *items, int nitems, long timeout);
+
+/******************************************************************************/
+/*  Message proxying                                                          */
+/******************************************************************************/
+
+ZMQ_EXPORT int zmq_proxy (void *frontend, void *backend, void *capture);
+ZMQ_EXPORT int zmq_proxy_steerable (void *frontend, void *backend, void *capture, void *control);
+
+/******************************************************************************/
+/*  Probe library capabilities                                                */
+/******************************************************************************/
+
+#define ZMQ_HAS_CAPABILITIES 1
+ZMQ_EXPORT int zmq_has (const char *capability);
+
+/*  Deprecated aliases */
+#define ZMQ_STREAMER 1
+#define ZMQ_FORWARDER 2
+#define ZMQ_QUEUE 3
+
+/*  Deprecated methods */
+ZMQ_EXPORT int zmq_device (int type, void *frontend, void *backend);
+ZMQ_EXPORT int zmq_sendmsg (void *s, zmq_msg_t *msg, int flags);
+ZMQ_EXPORT int zmq_recvmsg (void *s, zmq_msg_t *msg, int flags);
+
+
+/******************************************************************************/
+/*  Encryption functions                                                      */
+/******************************************************************************/
+
+/*  Encode data with Z85 encoding. Returns encoded data                       */
+ZMQ_EXPORT char *zmq_z85_encode (char *dest, const uint8_t *data, size_t size);
+
+/*  Decode data with Z85 encoding. Returns decoded data                       */
+ZMQ_EXPORT uint8_t *zmq_z85_decode (uint8_t *dest, const char *string);
+
+/*  Generate z85-encoded public and private keypair with libsodium.           */
+/*  Returns 0 on success.                                                     */
+ZMQ_EXPORT int zmq_curve_keypair (char *z85_public_key, char *z85_secret_key);
+
+
+/******************************************************************************/
+/*  These functions are not documented by man pages -- use at your own risk.  */
+/*  If you need these to be part of the formal ZMQ API, then (a) write a man  */
+/*  page, and (b) write a test case in tests.                                 */
+/******************************************************************************/
+
+struct iovec;
+
+ZMQ_EXPORT int zmq_sendiov (void *s, struct iovec *iov, size_t count, int flags);
+ZMQ_EXPORT int zmq_recviov (void *s, struct iovec *iov, size_t *count, int flags);
+
+/*  Helper functions are used by perf tests so that they don't have to care   */
+/*  about minutiae of time-related functions on different OS platforms.       */
+
+/*  Starts the stopwatch. Returns the handle to the watch.                    */
+ZMQ_EXPORT void *zmq_stopwatch_start (void);
+
+/*  Stops the stopwatch. Returns the number of microseconds elapsed since     */
+/*  the stopwatch was started.                                                */
+ZMQ_EXPORT unsigned long zmq_stopwatch_stop (void *watch_);
+
+/*  Sleeps for specified number of seconds.                                   */
+ZMQ_EXPORT void zmq_sleep (int seconds_);
+
+typedef void (zmq_thread_fn) (void*);
+
+/* Start a thread. Returns a handle to the thread.                            */
+ZMQ_EXPORT void *zmq_threadstart (zmq_thread_fn* func, void* arg);
+
+/* Wait for thread to complete then free up resources.                        */
+ZMQ_EXPORT void zmq_threadclose (void* thread);
+
+
+#undef ZMQ_EXPORT
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
+
diff --git a/ps-lite/deps/include/zmq_utils.h b/ps-lite/deps/include/zmq_utils.h
new file mode 100644
index 00000000..3392a8e0
--- /dev/null
+++ b/ps-lite/deps/include/zmq_utils.h
@@ -0,0 +1,20 @@
+/*
+    Copyright (c) 2007-2015 Contributors as noted in the AUTHORS file
+
+    This file is part of 0MQ.
+
+    0MQ is free software; you can redistribute it and/or modify it under
+    the terms of the GNU Lesser General Public License as published by
+    the Free Software Foundation; either version 3 of the License, or
+    (at your option) any later version.
+
+    0MQ is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU Lesser General Public License for more details.
+
+    You should have received a copy of the GNU Lesser General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+*/
+
+/*  This file is deprecated, and all its functionality provided by zmq.h     */
diff --git a/ps-lite/deps/lib/pkgconfig/libzmq.pc b/ps-lite/deps/lib/pkgconfig/libzmq.pc
new file mode 100644
index 00000000..e47aa331
--- /dev/null
+++ b/ps-lite/deps/lib/pkgconfig/libzmq.pc
@@ -0,0 +1,10 @@
+prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: libzmq
+Description: 0MQ c++ library
+Version: 4.1.4
+Libs: -L${libdir} -lzmq
+Cflags: -I${includedir}
diff --git a/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc b/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
new file mode 100644
index 00000000..588e80d5
--- /dev/null
+++ b/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
@@ -0,0 +1,13 @@
+prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: Protocol Buffers
+Description: Google's Data Interchange Format
+Version: 2.5.0
+Libs: -L${libdir} -lprotobuf-lite -D_THREAD_SAFE  
+Cflags: -I${includedir} -D_THREAD_SAFE 
+# Commented out because it crashes pkg-config *sigh*:
+#   http://bugs.freedesktop.org/show_bug.cgi?id=13265
+# Conflicts: protobuf
diff --git a/ps-lite/deps/lib/pkgconfig/protobuf.pc b/ps-lite/deps/lib/pkgconfig/protobuf.pc
new file mode 100644
index 00000000..3e2f57b2
--- /dev/null
+++ b/ps-lite/deps/lib/pkgconfig/protobuf.pc
@@ -0,0 +1,14 @@
+prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
+exec_prefix=${prefix}
+libdir=${exec_prefix}/lib
+includedir=${prefix}/include
+
+Name: Protocol Buffers
+Description: Google's Data Interchange Format
+Version: 2.5.0
+Libs: -L${libdir} -lprotobuf -D_THREAD_SAFE  
+Libs.private: -lz 
+Cflags: -I${includedir} -D_THREAD_SAFE 
+# Commented out because it crashes pkg-config *sigh*:
+#   http://bugs.freedesktop.org/show_bug.cgi?id=13265
+# Conflicts: protobuf-lite
diff --git a/ps-lite/deps/share/man/man3/zmq_bind.3 b/ps-lite/deps/share/man/man3/zmq_bind.3
new file mode 100644
index 00000000..d9a9df8a
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_bind.3
@@ -0,0 +1,194 @@
+'\" t
+.\"     Title: zmq_bind
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_BIND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_bind \- accept incoming connections on a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_bind (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_bind()\fR function binds the \fIsocket\fR to a local \fIendpoint\fR and then accepts incoming connections on that endpoint\&.
+.sp
+The \fIendpoint\fR is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to bind to\&.
+.sp
+0MQ provides the the following transports:
+.PP
+\fItcp\fR
+.RS 4
+unicast transport using TCP, see
+\fBzmq_tcp\fR(7)
+.RE
+.PP
+\fIipc\fR
+.RS 4
+local inter\-process communication transport, see
+\fBzmq_ipc\fR(7)
+.RE
+.PP
+\fIinproc\fR
+.RS 4
+local in\-process (inter\-thread) communication transport, see
+\fBzmq_inproc\fR(7)
+.RE
+.PP
+\fIpgm\fR, \fIepgm\fR
+.RS 4
+reliable multicast transport using PGM, see
+\fBzmq_pgm\fR(7)
+.RE
+.sp
+Every 0MQ socket type except \fIZMQ_PAIR\fR supports one\-to\-many and many\-to\-one semantics\&. The precise semantics depend on the socket type and are defined in \fBzmq_socket\fR(3)\&.
+.sp
+The \fIipc\fR and \fItcp\fR transports accept wildcard addresses: see \fBzmq_ipc\fR(7) and \fBzmq_tcp\fR(7) for details\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+the address syntax may be different for \fIzmq_bind()\fR and \fIzmq_connect()\fR especially for the \fItcp\fR, \fIpgm\fR and \fIepgm\fR transports\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+following a \fIzmq_bind()\fR, the socket enters a \fImute\fR state unless or until at least one incoming or outgoing connection is made, at which point the socket enters a \fIready\fR state\&. In the mute state, the socket blocks or drops messages according to the socket type, as defined in \fBzmq_socket\fR(3)\&. By contrast, following a libzmq:zmq_connect[3], the socket enters the \fIready\fR state\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_bind()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The endpoint supplied is invalid\&.
+.RE
+.PP
+\fBEPROTONOSUPPORT\fR
+.RS 4
+The requested
+\fItransport\fR
+protocol is not supported\&.
+.RE
+.PP
+\fBENOCOMPATPROTO\fR
+.RS 4
+The requested
+\fItransport\fR
+protocol is not compatible with the socket type\&.
+.RE
+.PP
+\fBEADDRINUSE\fR
+.RS 4
+The requested
+\fIaddress\fR
+is already in use\&.
+.RE
+.PP
+\fBEADDRNOTAVAIL\fR
+.RS 4
+The requested
+\fIaddress\fR
+was not local\&.
+.RE
+.PP
+\fBENODEV\fR
+.RS 4
+The requested
+\fIaddress\fR
+specifies a nonexistent interface\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEMTHREAD\fR
+.RS 4
+No I/O thread is available to accomplish the task\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBBinding a publisher socket to an in-process and a TCP transport\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a ZMQ_PUB socket */
+void *socket = zmq_socket (context, ZMQ_PUB);
+assert (socket);
+/* Bind it to a in\-process transport with the address \*(Aqmy_publisher\*(Aq */
+int rc = zmq_bind (socket, "inproc://my_publisher");
+assert (rc == 0);
+/* Bind it to a TCP transport on port 5555 of the \*(Aqeth0\*(Aq interface */
+rc = zmq_bind (socket, "tcp://eth0:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_close.3 b/ps-lite/deps/share/man/man3/zmq_close.3
new file mode 100644
index 00000000..f84f8ad1
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_close.3
@@ -0,0 +1,70 @@
+'\" t
+.\"     Title: zmq_close
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CLOSE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_close \- close 0MQ socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_close (void \fR\fB\fI*socket\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_close()\fR function shall destroy the socket referenced by the \fIsocket\fR argument\&. Any outstanding messages physically received from the network but not yet received by the application with \fIzmq_recv()\fR shall be discarded\&. The behaviour for discarding messages sent by the application with \fIzmq_send()\fR but not yet physically transferred to the network depends on the value of the \fIZMQ_LINGER\fR socket option for the specified \fIsocket\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The default setting of \fIZMQ_LINGER\fR does not discard unsent messages; this behaviour may cause the application to block when calling \fIzmq_term()\fR\&. For details refer to \fBzmq_setsockopt\fR(3) and \fBzmq_term\fR(3)\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_close()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq_socket\fR(3) \fBzmq_term\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_connect.3 b/ps-lite/deps/share/man/man3/zmq_connect.3
new file mode 100644
index 00000000..df140001
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_connect.3
@@ -0,0 +1,171 @@
+'\" t
+.\"     Title: zmq_connect
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CONNECT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_connect \- create outgoing connection from socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_connect (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_connect()\fR function connects the \fIsocket\fR to an \fIendpoint\fR and then accepts incoming connections on that endpoint\&.
+.sp
+The \fIendpoint\fR is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+0MQ provides the the following transports:
+.PP
+\fItcp\fR
+.RS 4
+unicast transport using TCP, see
+\fBzmq_tcp\fR(7)
+.RE
+.PP
+\fIipc\fR
+.RS 4
+local inter\-process communication transport, see
+\fBzmq_ipc\fR(7)
+.RE
+.PP
+\fIinproc\fR
+.RS 4
+local in\-process (inter\-thread) communication transport, see
+\fBzmq_inproc\fR(7)
+.RE
+.PP
+\fIpgm\fR, \fIepgm\fR
+.RS 4
+reliable multicast transport using PGM, see
+\fBzmq_pgm\fR(7)
+.RE
+.sp
+Every 0MQ socket type except \fIZMQ_PAIR\fR supports one\-to\-many and many\-to\-one semantics\&. The precise semantics depend on the socket type and are defined in \fBzmq_socket\fR(3)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+for most transports and socket types the connection is not performed immediately but as needed by 0MQ\&. Thus a successful call to \fIzmq_connect()\fR does not mean that the connection was or could actually be established\&. Because of this, for most transports and socket types the order in which a \fIserver\fR socket is bound and a \fIclient\fR socket is connected to it does not matter\&. The first exception is when using the inproc:// transport: you must call \fIzmq_bind()\fR before calling \fIzmq_connect()\fR\&. The second exception are \fIZMQ_PAIR\fR sockets, which do not automatically reconnect to endpoints\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+following a \fIzmq_connect()\fR, for socket types except for ZMQ_ROUTER, the socket enters its normal \fIready\fR state\&. By contrast, following a \fIzmq_bind()\fR alone, the socket enters a \fImute\fR state in which the socket blocks or drops messages according to the socket type, as defined in \fBzmq_socket\fR(3)\&. A ZMQ_ROUTER socket enters its normal \fIready\fR state for a specific peer only when handshaking is complete for that peer, which may take an arbitrary time\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_connect()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The endpoint supplied is invalid\&.
+.RE
+.PP
+\fBEPROTONOSUPPORT\fR
+.RS 4
+The requested
+\fItransport\fR
+protocol is not supported\&.
+.RE
+.PP
+\fBENOCOMPATPROTO\fR
+.RS 4
+The requested
+\fItransport\fR
+protocol is not compatible with the socket type\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEMTHREAD\fR
+.RS 4
+No I/O thread is available to accomplish the task\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBConnecting a subscriber socket to an in-process and a TCP transport\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a ZMQ_SUB socket */
+void *socket = zmq_socket (context, ZMQ_SUB);
+assert (socket);
+/* Connect it to an in\-process transport with the address \*(Aqmy_publisher\*(Aq */
+int rc = zmq_connect (socket, "inproc://my_publisher");
+assert (rc == 0);
+/* Connect it to the host server001, port 5555 using a TCP transport */
+rc = zmq_connect (socket, "tcp://server001:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_get.3 b/ps-lite/deps/share/man/man3/zmq_ctx_get.3
new file mode 100644
index 00000000..04e0482b
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_ctx_get.3
@@ -0,0 +1,85 @@
+'\" t
+.\"     Title: zmq_ctx_get
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CTX_GET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ctx_get \- get context options
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_ctx_get (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_ctx_get()\fR function shall return the option specified by the \fIoption_name\fR argument\&.
+.sp
+The \fIzmq_ctx_get()\fR function accepts the following option names:
+.SS "ZMQ_IO_THREADS: Get number of I/O threads"
+.sp
+The \fIZMQ_IO_THREADS\fR argument returns the size of the 0MQ thread pool for this context\&.
+.SS "ZMQ_MAX_SOCKETS: Get maximum number of sockets"
+.sp
+The \fIZMQ_MAX_SOCKETS\fR argument returns the maximum number of sockets allowed for this context\&.
+.SS "ZMQ_SOCKET_LIMIT: Get largest configurable number of sockets"
+.sp
+The \fIZMQ_SOCKET_LIMIT\fR argument returns the largest number of sockets that \fBzmq_ctx_set\fR(3) will accept\&.
+.SS "ZMQ_IPV6: Set IPv6 option"
+.sp
+The \fIZMQ_IPV6\fR argument returns the IPv6 option for the context\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_ctx_get()\fR function returns a value of 0 or greater if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested option
+\fIoption_name\fR
+is unknown\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBSetting a limit on the number of sockets\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void *context = zmq_ctx_new ();
+zmq_ctx_set (context, ZMQ_MAX_SOCKETS, 256);
+int max_sockets = zmq_ctx_get (context, ZMQ_MAX_SOCKETS);
+assert (max_sockets == 256);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_ctx_set\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_new.3 b/ps-lite/deps/share/man/man3/zmq_ctx_new.3
new file mode 100644
index 00000000..82c309b2
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_ctx_new.3
@@ -0,0 +1,55 @@
+'\" t
+.\"     Title: zmq_ctx_new
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CTX_NEW" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ctx_new \- create new 0MQ context
+.SH "SYNOPSIS"
+.sp
+\fBvoid *zmq_ctx_new ();\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_ctx_new()\fR function creates a new 0MQ \fIcontext\fR\&.
+.sp
+This function replaces the deprecated function \fBzmq_init\fR(3)\&.
+.PP
+\fBThread safety\fR. A 0MQ
+\fIcontext\fR
+is thread safe and may be shared among as many application threads as necessary, without any additional locking required on the part of the caller\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_ctx_new()\fR function shall return an opaque handle to the newly created \fIcontext\fR if successful\&. Otherwise it shall return NULL and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.sp
+No error values are defined for this function\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7) \fBzmq_ctx_set\fR(3) \fBzmq_ctx_get\fR(3) \fBzmq_ctx_term\fR(3)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_set.3 b/ps-lite/deps/share/man/man3/zmq_ctx_set.3
new file mode 100644
index 00000000..d6441874
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_ctx_set.3
@@ -0,0 +1,148 @@
+'\" t
+.\"     Title: zmq_ctx_set
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CTX_SET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ctx_set \- set context options
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_ctx_set (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, int \fR\fB\fIoption_value\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_ctx_set()\fR function shall set the option specified by the \fIoption_name\fR argument to the value of the \fIoption_value\fR argument\&.
+.sp
+The \fIzmq_ctx_set()\fR function accepts the following options:
+.SS "ZMQ_IO_THREADS: Set number of I/O threads"
+.sp
+The \fIZMQ_IO_THREADS\fR argument specifies the size of the 0MQ thread pool to handle I/O operations\&. If your application is using only the \fIinproc\fR transport for messaging you may set this to zero, otherwise set it to at least one\&. This option only applies before creating any sockets on the context\&.
+.TS
+tab(:);
+lt lt.
+T{
+.sp
+Default value
+T}:T{
+.sp
+1
+T}
+.TE
+.sp 1
+.SS "ZMQ_THREAD_SCHED_POLICY: Set scheduling policy for I/O threads"
+.sp
+The \fIZMQ_THREAD_SCHED_POLICY\fR argument sets the scheduling policy for internal context\(cqs thread pool\&. This option is not available on windows\&. Supported values for this option can be found in sched\&.h file, or at \m[blue]\fBhttp://man7\&.org/linux/man\-pages/man2/sched_setscheduler\&.2\&.html\fR\m[]\&. This option only applies before creating any sockets on the context\&.
+.TS
+tab(:);
+lt lt.
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1
+T}
+.TE
+.sp 1
+.SS "ZMQ_THREAD_PRIORITY: Set scheduling priority for I/O threads"
+.sp
+The \fIZMQ_THREAD_PRIORITY\fR argument sets scheduling priority for internal context\(cqs thread pool\&. This option is not available on windows\&. Supported values for this option depend on chosen scheduling policy\&. Details can be found in sched\&.h file, or at \m[blue]\fBhttp://man7\&.org/linux/man\-pages/man2/sched_setscheduler\&.2\&.html\fR\m[]\&. This option only applies before creating any sockets on the context\&.
+.TS
+tab(:);
+lt lt.
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1
+T}
+.TE
+.sp 1
+.SS "ZMQ_MAX_SOCKETS: Set maximum number of sockets"
+.sp
+The \fIZMQ_MAX_SOCKETS\fR argument sets the maximum number of sockets allowed on the context\&. You can query the maximal allowed value with \fBzmq_ctx_get\fR(3) using the \fIZMQ_SOCKET_LIMIT\fR option\&.
+.TS
+tab(:);
+lt lt.
+T{
+.sp
+Default value
+T}:T{
+.sp
+1024
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPV6: Set IPv6 option"
+.sp
+The \fIZMQ_IPV6\fR argument sets the IPv6 value for all sockets created in the context from this point onwards\&. A value of 1 means IPv6 is enabled, while 0 means the socket will use only IPv4\&. When IPv6 is enabled, a socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
+.TS
+tab(:);
+lt lt.
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+.TE
+.sp 1
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_ctx_set()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested option
+\fIoption_name\fR
+is unknown\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBSetting a limit on the number of sockets\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void *context = zmq_ctx_new ();
+zmq_ctx_set (context, ZMQ_MAX_SOCKETS, 256);
+int max_sockets = zmq_ctx_get (context, ZMQ_MAX_SOCKETS);
+assert (max_sockets == 256);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_ctx_get\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3 b/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
new file mode 100644
index 00000000..ff9bf008
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
@@ -0,0 +1,58 @@
+'\" t
+.\"     Title: zmq_ctx_shutdown
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CTX_SHUTDOWN" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ctx_shutdown \- shutdown a 0MQ context
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_ctx_shutdown (void \fR\fB\fI*context\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_ctx_shutdown()\fR function shall shutdown the 0MQ context \fIcontext\fR\&.
+.sp
+Context shutdown will cause any blocking operations currently in progress on sockets open within \fIcontext\fR to return immediately with an error code of ETERM\&. With the exception of \fIzmq_close()\fR, any further operations on sockets open within \fIcontext\fR shall fail with an error code of ETERM\&.
+.sp
+This function is optional, client code is still required to call the \fBzmq_ctx_term\fR(3) function to free all resources allocated by zeromq\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_ctx_shutdown()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEFAULT\fR
+.RS 4
+The provided
+\fIcontext\fR
+was invalid\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7) \fBzmq_init\fR(3) \fBzmq_ctx_term\fR(3) \fBzmq_close\fR(3) \fBzmq_setsockopt\fR(3)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_term.3 b/ps-lite/deps/share/man/man3/zmq_ctx_term.3
new file mode 100644
index 00000000..ab0fcbed
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_ctx_term.3
@@ -0,0 +1,129 @@
+'\" t
+.\"     Title: zmq_ctx_term
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CTX_TERM" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ctx_term \- destroy a 0MQ context
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_ctx_term (void \fR\fB\fI*context\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_ctx_term()\fR function shall destroy the 0MQ context \fIcontext\fR\&.
+.sp
+Context termination is performed in the following steps:
+.sp
+.RS 4
+.ie n \{\
+\h'-04' 1.\h'+01'\c
+.\}
+.el \{\
+.sp -1
+.IP "  1." 4.2
+.\}
+Any blocking operations currently in progress on sockets open within
+\fIcontext\fR
+shall return immediately with an error code of ETERM\&. With the exception of
+\fIzmq_close()\fR, any further operations on sockets open within
+\fIcontext\fR
+shall fail with an error code of ETERM\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04' 2.\h'+01'\c
+.\}
+.el \{\
+.sp -1
+.IP "  2." 4.2
+.\}
+After interrupting all blocking calls,
+\fIzmq_ctx_term()\fR
+shall
+\fIblock\fR
+until the following conditions are satisfied:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+All sockets open within
+\fIcontext\fR
+have been closed with
+\fIzmq_close()\fR\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+For each socket within
+\fIcontext\fR, all messages sent by the application with
+\fIzmq_send()\fR
+have either been physically transferred to a network peer, or the socket\(cqs linger period set with the
+\fIZMQ_LINGER\fR
+socket option has expired\&.
+.RE
+.RE
+.sp
+For further details regarding socket linger behavior refer to the \fIZMQ_LINGER\fR option in \fBzmq_setsockopt\fR(3)\&.
+.sp
+This function replaces the deprecated function \fBzmq_term\fR(3)\&.
+.SH "WARNING"
+.sp
+As \fIZMQ_LINGER\fR defaults to "infinite", by default this function will block indefinitely if there are any pending connects or sends\&. We strongly recommend to (a) set \fIZMQ_LINGER\fR to zero on all sockets and (b) close all sockets, before calling this function\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_ctx_term()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEFAULT\fR
+.RS 4
+The provided
+\fIcontext\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+Termination was interrupted by a signal\&. It can be restarted if needed\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7) \fBzmq_init\fR(3) \fBzmq_close\fR(3) \fBzmq_setsockopt\fR(3)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_curve_keypair.3 b/ps-lite/deps/share/man/man3/zmq_curve_keypair.3
new file mode 100644
index 00000000..0920d423
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_curve_keypair.3
@@ -0,0 +1,69 @@
+'\" t
+.\"     Title: zmq_curve_keypair
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CURVE_KEYPAIR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_curve_keypair \- generate a new CURVE keypair
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_curve_keypair (char *z85_public_key, char *z85_secret_key);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_curve_keypair()\fR function shall return a newly generated random keypair consisting of a public key and a secret key\&. The caller provides two buffers, each at least 41 octets large, in which this method will store the keys\&. The keys are encoded using \fBzmq_z85_encode\fR(3)\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_curve_keypair()\fR function shall return 0 if successful, else it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBENOTSUP\fR
+.RS 4
+The libzmq library was not built with cryptographic support (libsodium)\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBGenerating a new CURVE keypair\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+char public_key [41];
+char secret_key [41];
+int rc = zmq_curve_keypair (public_key, secret_key);
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_z85_decode\fR(3) \fBzmq_z85_encode\fR(3) \fBzmq_curve\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_disconnect.3 b/ps-lite/deps/share/man/man3/zmq_disconnect.3
new file mode 100644
index 00000000..8f704e02
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_disconnect.3
@@ -0,0 +1,113 @@
+'\" t
+.\"     Title: zmq_disconnect
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_DISCONNECT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_disconnect \- Disconnect a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_disconnect (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_disconnect()\fR function shall disconnect a socket specified by the \fIsocket\fR argument from the endpoint specified by the \fIendpoint\fR argument\&. Any outstanding messages physically received from the network but not yet received by the application with \fIzmq_recv()\fR shall be discarded\&. The behaviour for discarding messages sent by the application with \fIzmq_send()\fR but not yet physically transferred to the network depends on the value of the \fIZMQ_LINGER\fR socket option for the specified \fIsocket\fR\&.
+.sp
+The \fIendpoint\fR argument is as described in \fBzmq_connect\fR(3)
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The default setting of \fIZMQ_LINGER\fR does not discard unsent messages; this behaviour may cause the application to block when calling \fIzmq_term()\fR\&. For details refer to \fBzmq_setsockopt\fR(3) and \fBzmq_term\fR(3)\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_disconnect()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The endpoint supplied is invalid\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBENOENT\fR
+.RS 4
+The provided endpoint is not connected\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBConnecting a subscriber socket to an in-process and a TCP transport\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a ZMQ_SUB socket */
+void *socket = zmq_socket (context, ZMQ_SUB);
+assert (socket);
+/* Connect it to the host server001, port 5555 using a TCP transport */
+rc = zmq_connect (socket, "tcp://server001:5555");
+assert (rc == 0);
+/* Disconnect from the previously connected endpoint */
+rc = zmq_disconnect (socket, "tcp://server001:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_errno.3 b/ps-lite/deps/share/man/man3/zmq_errno.3
new file mode 100644
index 00000000..e66b435a
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_errno.3
@@ -0,0 +1,67 @@
+'\" t
+.\"     Title: zmq_errno
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_ERRNO" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_errno \- retrieve value of errno for the calling thread
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_errno (void);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_errno()\fR function shall retrieve the value of the \fIerrno\fR variable for the calling thread\&.
+.sp
+The \fIzmq_errno()\fR function is provided to assist users on non\-POSIX systems who are experiencing issues with retrieving the correct value of \fIerrno\fR directly\&. Specifically, users on Win32 systems whose application is using a different C run\-time library from the C run\-time library in use by 0MQ will need to use \fIzmq_errno()\fR for correct operation\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBImportant\fR
+.ps -1
+.br
+.sp
+Users not experiencing issues with retrieving the correct value of \fIerrno\fR should not use this function and should instead access the \fIerrno\fR variable directly\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_errno()\fR function shall return the value of the \fIerrno\fR variable for the calling thread\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_getsockopt.3 b/ps-lite/deps/share/man/man3/zmq_getsockopt.3
new file mode 100644
index 00000000..31646c30
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_getsockopt.3
@@ -0,0 +1,1879 @@
+'\" t
+.\"     Title: zmq_getsockopt
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_GETSOCKOPT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_getsockopt \- get 0MQ socket options
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_getsockopt (void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, void \fR\fB\fI*option_value\fR\fR\fB, size_t \fR\fB\fI*option_len\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_getsockopt()\fR function shall retrieve the value for the option specified by the \fIoption_name\fR argument for the 0MQ socket pointed to by the \fIsocket\fR argument, and store it in the buffer pointed to by the \fIoption_value\fR argument\&. The \fIoption_len\fR argument is the size in bytes of the buffer pointed to by \fIoption_value\fR; upon successful completion \fIzmq_getsockopt()\fR shall modify the \fIoption_len\fR argument to indicate the actual size of the option value stored in the buffer\&.
+.sp
+The following options can be retrieved with the \fIzmq_getsockopt()\fR function:
+.SS "ZMQ_AFFINITY: Retrieve I/O thread affinity"
+.sp
+The \fIZMQ_AFFINITY\fR option shall retrieve the I/O thread affinity for newly created connections on the specified \fIsocket\fR\&.
+.sp
+Affinity determines which threads from the 0MQ I/O thread pool associated with the socket\(cqs \fIcontext\fR shall handle newly created connections\&. A value of zero specifies no affinity, meaning that work shall be distributed fairly among all 0MQ I/O threads in the thread pool\&. For non\-zero values, the lowest bit corresponds to thread 1, second lowest bit to thread 2 and so on\&. For example, a value of 3 specifies that subsequent connections on \fIsocket\fR shall be handled exclusively by I/O threads 1 and 2\&.
+.sp
+See also \fBzmq_init\fR(3) for details on allocating the number of I/O threads for a specific \fIcontext\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+uint64_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A (bitmap)
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+N/A
+T}
+.TE
+.sp 1
+.SS "ZMQ_BACKLOG: Retrieve maximum length of the queue of outstanding connections"
+.sp
+The \fIZMQ_BACKLOG\fR option shall retrieve the maximum length of the queue of outstanding peer connections for the specified \fIsocket\fR; this only applies to connection\-oriented transports\&. For details refer to your operating system documentation for the \fIlisten\fR function\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+connections
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_PUBLICKEY: Retrieve current CURVE public key"
+.sp
+Retrieves the current long term public key for the socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41 byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_SECRETKEY: Retrieve current CURVE secret key"
+.sp
+Retrieves the current long term secret key for the socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41 byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_SERVERKEY: Retrieve current CURVE server key"
+.sp
+Retrieves the current server key for the client socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41\-byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_EVENTS: Retrieve socket event state"
+.sp
+The \fIZMQ_EVENTS\fR option shall retrieve the event state for the specified \fIsocket\fR\&. The returned value is a bit mask constructed by OR\(cqing a combination of the following event flags:
+.PP
+\fBZMQ_POLLIN\fR
+.RS 4
+Indicates that at least one message may be received from the specified socket without blocking\&.
+.RE
+.PP
+\fBZMQ_POLLOUT\fR
+.RS 4
+Indicates that at least one message may be sent to the specified socket without blocking\&.
+.RE
+.sp
+The combination of a file descriptor returned by the \fIZMQ_FD\fR option being ready for reading but no actual events returned by a subsequent retrieval of the \fIZMQ_EVENTS\fR option is valid; applications should simply ignore this case and restart their polling operation/event loop\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A (flags)
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_FD: Retrieve file descriptor associated with the socket"
+.sp
+The \fIZMQ_FD\fR option shall retrieve the file descriptor associated with the specified \fIsocket\fR\&. The returned file descriptor can be used to integrate the socket into an existing event loop; the 0MQ library shall signal any pending events on the socket in an \fIedge\-triggered\fR fashion by making the file descriptor become ready for reading\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The ability to read from the returned file descriptor does not necessarily indicate that messages are available to be read from, or can be written to, the underlying socket; applications must retrieve the actual event state with a subsequent retrieval of the \fIZMQ_EVENTS\fR option\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The returned file descriptor is also used internally by the \fIzmq_send\fR and \fIzmq_recv\fR functions\&. As the descriptor is edge triggered, applications must update the state of \fIZMQ_EVENTS\fR after each invocation of \fIzmq_send\fR or \fIzmq_recv\fR\&.To be more explicit: after calling \fIzmq_send\fR the socket may become readable (and vice versa) without triggering a read event on the file descriptor\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The returned file descriptor is intended for use with a \fIpoll\fR or similar system call only\&. Applications must never attempt to read or write data to it directly, neither should they try to close it\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int on POSIX systems, SOCKET on Windows
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_PLAINTEXT: Retrieve GSSAPI plaintext or encrypted status"
+.sp
+Returns the \fIZMQ_GSSAPI_PLAINTEXT\fR option, if any, previously set on the socket\&. A value of \fI1\fR means that communications will be plaintext\&. A value of \fI0\fR means communications will be encrypted\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_PRINCIPAL: Retrieve the name of the GSSAPI principal"
+.sp
+The \fIZMQ_GSSAPI_PRINCIPAL\fR option shall retrieve the principal name set for the GSSAPI security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+NULL\-terminated character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null string
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_SERVER: Retrieve current GSSAPI server role"
+.sp
+Returns the \fIZMQ_GSSAPI_SERVER\fR option, if any, previously set on the socket\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_SERVICE_PRINCIPAL: Retrieve the name of the GSSAPI service principal"
+.sp
+The \fIZMQ_GSSAPI_SERVICE_PRINCIPAL\fR option shall retrieve the principal name of the GSSAPI server to which a GSSAPI client socket intends to connect\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+NULL\-terminated character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null string
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_HANDSHAKE_IVL: Retrieve maximum handshake interval"
+.sp
+The \fIZMQ_HANDSHAKE_IVL\fR option shall retrieve the maximum handshake interval for the specified \fIsocket\fR\&. Handshaking is the exchange of socket configuration information (socket type, identity, security) that occurs when a connection is first opened, only for connection\-oriented transports\&. If handshaking does not complete within the configured time, the connection shall be closed\&. The value 0 means no handshake time limit\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+30000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all but ZMQ_STREAM, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_IDENTITY: Retrieve socket identity"
+.sp
+The \fIZMQ_IDENTITY\fR option shall retrieve the identity of the specified \fIsocket\fR\&. Socket identity is used only by request/reply pattern\&. Namely, it can be used in tandem with ROUTER socket to route messages to the peer with specific identity\&.
+.sp
+Identity should be at least one byte and at most 255 bytes long\&. Identities starting with binary zero are reserved for use by 0MQ infrastructure\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_REP, ZMQ_REQ, ZMQ_ROUTER, ZMQ_DEALER\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IMMEDIATE: Retrieve attach\-on\-connect value"
+.sp
+Retrieve the state of the attach on connect value\&. If set to 1, will delay the attachment of a pipe on connect until the underlying connection has completed\&. This will cause the socket to block if there are no other connections, but will prevent queues from filling on pipes awaiting connection\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, primarily when using TCP/IPC transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPV4ONLY: Retrieve IPv4\-only socket override status"
+.sp
+Retrieve the IPv4\-only option for the socket\&. This option is deprecated\&. Please use the ZMQ_IPV6 option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1 (true)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPV6: Retrieve IPv6 socket status"
+.sp
+Retrieve the IPv6 option for the socket\&. A value of 1 means IPv6 is enabled on the socket, while 0 means the socket will use only IPv4\&. When IPv6 is enabled the socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_LAST_ENDPOINT: Retrieve the last endpoint set"
+.sp
+The \fIZMQ_LAST_ENDPOINT\fR option shall retrieve the last endpoint bound for TCP and IPC transports\&. The returned value will be a string in the form of a ZMQ DSN\&. Note that if the TCP host is INADDR_ANY, indicated by a *, then the returned address will be 0\&.0\&.0\&.0 (for IPv4)\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+NULL\-terminated character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when binding TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_LINGER: Retrieve linger period for socket shutdown"
+.sp
+The \fIZMQ_LINGER\fR option shall retrieve the linger period for the specified \fIsocket\fR\&. The linger period determines how long pending messages which have yet to be sent to a peer shall linger in memory after a socket is closed with \fBzmq_close\fR(3), and further affects the termination of the socket\(cqs context with \fBzmq_term\fR(3)\&. The following outlines the different behaviours:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The default value of
+\fI\-1\fR
+specifies an infinite linger period\&. Pending messages shall not be discarded after a call to
+\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
+\fIzmq_term()\fR
+shall block until all pending messages have been sent to a peer\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The value of
+\fI0\fR
+specifies no linger period\&. Pending messages shall be discarded immediately when the socket is closed with
+\fIzmq_close()\fR\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+Positive values specify an upper bound for the linger period in milliseconds\&. Pending messages shall not be discarded after a call to
+\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
+\fIzmq_term()\fR
+shall block until either all pending messages have been sent to a peer, or the linger period expires, after which any pending messages shall be discarded\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+Option value type
+T}:T{
+int
+T}
+T{
+Option value unit
+T}:T{
+milliseconds
+T}
+T{
+Default value
+T}:T{
+\-1 (infinite)
+T}
+T{
+Applicable socket types
+T}:T{
+all
+T}
+.TE
+.sp 1
+.RE
+.SS "ZMQ_MAXMSGSIZE: Maximum acceptable inbound message size"
+.sp
+The option shall retrieve limit for the inbound messages\&. If a peer sends a message larger than ZMQ_MAXMSGSIZE it is disconnected\&. Value of \-1 means \fIno limit\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int64_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_MECHANISM: Retrieve current security mechanism"
+.sp
+The \fIZMQ_MECHANISM\fR option shall retrieve the current security mechanism for the socket\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+ZMQ_NULL, ZMQ_PLAIN, ZMQ_CURVE, or ZMQ_GSSAPI
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+ZMQ_NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_MULTICAST_HOPS: Maximum network hops for multicast packets"
+.sp
+The option shall retrieve time\-to\-live used for outbound multicast packets\&. The default of 1 means that the multicast packets don\(cqt leave the local network\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+network hops
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_PASSWORD: Retrieve current password"
+.sp
+The \fIZMQ_PLAIN_PASSWORD\fR option shall retrieve the last password set for the PLAIN security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+NULL\-terminated character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null string
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_SERVER: Retrieve current PLAIN server role"
+.sp
+Returns the \fIZMQ_PLAIN_SERVER\fR option, if any, previously set on the socket\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_USERNAME: Retrieve current PLAIN username"
+.sp
+The \fIZMQ_PLAIN_USERNAME\fR option shall retrieve the last username set for the PLAIN security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+NULL\-terminated character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+null string
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP or IPC transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RATE: Retrieve multicast data rate"
+.sp
+The \fIZMQ_RATE\fR option shall retrieve the maximum send or receive data rate for multicast transports using the specified \fIsocket\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+kilobits per second
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVBUF: Retrieve kernel receive buffer size"
+.sp
+The \fIZMQ_RCVBUF\fR option shall retrieve the underlying kernel receive buffer size for the specified \fIsocket\fR\&. A value of zero means that the OS default is in effect\&. For details refer to your operating system documentation for the \fISO_RCVBUF\fR socket option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVHWM: Retrieve high water mark for inbound messages"
+.sp
+The \fIZMQ_RCVHWM\fR option shall return the high water mark for inbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
+.sp
+If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+messages
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVMORE: More message data parts to follow"
+.sp
+The \fIZMQ_RCVMORE\fR option shall return True (1) if the message part last received from the \fIsocket\fR was a data part with more parts to follow\&. If there are no data parts to follow, this option shall return False (0)\&.
+.sp
+Refer to \fBzmq_send\fR(3) and \fBzmq_recv\fR(3) for a detailed description of multi\-part messages\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVTIMEO: Maximum time before a socket operation returns with EAGAIN"
+.sp
+Retrieve the timeout for recv operation on the socket\&. If the value is 0, \fIzmq_recv(3)\fR will return immediately, with a EAGAIN error if there is no message to receive\&. If the value is \-1, it will block until a message is available\&. For all other values, it will wait for a message for that amount of time before returning with an EAGAIN error\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (infinite)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECONNECT_IVL: Retrieve reconnection interval"
+.sp
+The \fIZMQ_RECONNECT_IVL\fR option shall retrieve the initial reconnection interval for the specified \fIsocket\fR\&. The reconnection interval is the period 0MQ shall wait between attempts to reconnect disconnected peers when using connection\-oriented transports\&. The value \-1 means no reconnection\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The reconnection interval may be randomized by 0MQ to prevent reconnection storms in topologies with a large number of peers per socket\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECONNECT_IVL_MAX: Retrieve maximum reconnection interval"
+.sp
+The \fIZMQ_RECONNECT_IVL_MAX\fR option shall retrieve the maximum reconnection interval for the specified \fIsocket\fR\&. This is the maximum period 0MQ shall wait between attempts to reconnect\&. On each reconnect attempt, the previous interval shall be doubled untill ZMQ_RECONNECT_IVL_MAX is reached\&. This allows for exponential backoff strategy\&. Default value means no exponential backoff is performed and reconnect interval calculations are only based on ZMQ_RECONNECT_IVL\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+Values less than ZMQ_RECONNECT_IVL will be ignored\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (only use ZMQ_RECONNECT_IVL)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECOVERY_IVL: Get multicast recovery interval"
+.sp
+The \fIZMQ_RECOVERY_IVL\fR option shall retrieve the recovery interval for multicast transports using the specified \fIsocket\fR\&. The recovery interval determines the maximum time in milliseconds that a receiver can be absent from a multicast group before unrecoverable data loss will occur\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+10000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDBUF: Retrieve kernel transmit buffer size"
+.sp
+The \fIZMQ_SNDBUF\fR option shall retrieve the underlying kernel transmit buffer size for the specified \fIsocket\fR\&. A value of zero means that the OS default is in effect\&. For details refer to your operating system documentation for the \fISO_SNDBUF\fR socket option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDHWM: Retrieves high water mark for outbound messages"
+.sp
+The \fIZMQ_SNDHWM\fR option shall return the high water mark for outbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
+.sp
+If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+messages
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDTIMEO: Maximum time before a socket operation returns with EAGAIN"
+.sp
+Retrieve the timeout for send operation on the socket\&. If the value is 0, \fIzmq_send(3)\fR will return immediately, with a EAGAIN error if the message cannot be sent\&. If the value is \-1, it will block until the message is sent\&. For all other values, it will try to send the message for that amount of time before returning with an EAGAIN error\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (infinite)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE: Override SO_KEEPALIVE socket option"
+.sp
+Override \fISO_KEEPALIVE\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,0,1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_CNT: Override TCP_KEEPCNT socket option"
+.sp
+Override \fITCP_KEEPCNT\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_IDLE: Override TCP_KEEPCNT(or TCP_KEEPALIVE on some OS)"
+.sp
+Override \fITCP_KEEPCNT\fR(or \fITCP_KEEPALIVE\fR on some OS) socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_INTVL: Override TCP_KEEPINTVL socket option"
+.sp
+Override \fITCP_KEEPINTVL\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TOS: Retrieve the Type\-of\-Service socket override status"
+.sp
+Retrieve the IP_TOS option for the socket\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_TYPE: Retrieve socket type"
+.sp
+The \fIZMQ_TYPE\fR option shall retrieve the socket type for the specified \fIsocket\fR\&. The socket type is specified at socket creation time and cannot be modified afterwards\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_ZAP_DOMAIN: Retrieve RFC 27 authentication domain"
+.sp
+The \fIZMQ_ZAP_DOMAIN\fR option shall retrieve the last ZAP domain set for the socket\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_getsockopt()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested option
+\fIoption_name\fR
+is unknown, or the requested
+\fIoption_len\fR
+or
+\fIoption_value\fR
+is invalid, or the size of the buffer pointed to by
+\fIoption_value\fR, as specified by
+\fIoption_len\fR, is insufficient for storing the option value\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBRetrieving the high water mark for outgoing messages\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Retrieve high water mark into sndhwm */
+int sndhwm;
+size_t sndhwm_size = sizeof (sndhwm);
+rc = zmq_getsockopt (socket, ZMQ_SNDHWM, &sndhwm, &sndhwm_size);
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_setsockopt\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_has.3 b/ps-lite/deps/share/man/man3/zmq_has.3
new file mode 100644
index 00000000..d3f7f1d4
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_has.3
@@ -0,0 +1,113 @@
+'\" t
+.\"     Title: zmq_has
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_HAS" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_has \- check a ZMQ capability
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_has (const char *capability);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_has()\fR function shall report whether a specified capability is available in the library\&. This allows bindings and applications to probe a library directly, for transport and security options\&.
+.sp
+Capabilities shall be lowercase strings\&. The following capabilities are defined:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+ipc \- the library supports the ipc:// protocol
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+pgm \- the library supports the pgm:// protocol
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+tipc \- the library supports the tipc:// protocol
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+norm \- the library supports the norm:// protocol
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+curve \- the library supports the CURVE security mechanism
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+gssapi \- the library supports the GSSAPI security mechanism
+.RE
+.sp
+When this method is provided, the zmq\&.h header file will define ZMQ_HAS_CAPABILITIES\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_has()\fR function shall return 1 if the specified capability is provided\&. Otherwise it shall return 0\&.
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_close.3 b/ps-lite/deps/share/man/man3/zmq_msg_close.3
new file mode 100644
index 00000000..4209a6be
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_close.3
@@ -0,0 +1,70 @@
+'\" t
+.\"     Title: zmq_msg_close
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_CLOSE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_close \- release 0MQ message
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_close (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_close()\fR function shall inform the 0MQ infrastructure that any resources associated with the message object referenced by \fImsg\fR are no longer required and may be released\&. Actual release of resources associated with the message object shall be postponed by 0MQ until all users of the message or underlying data buffer have indicated it is no longer required\&.
+.sp
+Applications should ensure that \fIzmq_msg_close()\fR is called once a message is no longer required, otherwise memory leaks may occur\&. Note that this is NOT necessary after a successful \fIzmq_msg_send()\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_close()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEFAULT\fR
+.RS 4
+Invalid message\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_copy.3 b/ps-lite/deps/share/man/man3/zmq_msg_copy.3
new file mode 100644
index 00000000..5a2496f1
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_copy.3
@@ -0,0 +1,106 @@
+'\" t
+.\"     Title: zmq_msg_copy
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_COPY" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_copy \- copy content of a message to another message
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_copy (zmq_msg_t \fR\fB\fI*dest\fR\fR\fB, zmq_msg_t \fR\fB\fI*src\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_copy()\fR function shall copy the message object referenced by \fIsrc\fR to the message object referenced by \fIdest\fR\&. The original content of \fIdest\fR, if any, shall be released\&. You must initialize \fIdest\fR before copying to it\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The implementation may choose not to physically copy the message content, rather to share the underlying buffer between \fIsrc\fR and \fIdest\fR\&. Avoid modifying message content after a message has been copied with \fIzmq_msg_copy()\fR, doing so can result in undefined behaviour\&. If what you need is an actual hard copy, allocate a new message using \fIzmq_msg_init_size()\fR and copy the message content using \fImemcpy()\fR\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_copy()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEFAULT\fR
+.RS 4
+Invalid message\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBCopying a message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_msg_t msg;
+zmq_msg_init_size (&msg, 255);
+memcpy (zmq_msg_data (&msg, "Hello, World", 12);
+zmq_msg_t copy;
+zmq_msg_init (&copy);
+zmq_msg_copy (&copy, &msg);
+\&.\&.\&.
+zmq_msg_close (&copy);
+zmq_msg_close (&msg);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_move\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_data.3 b/ps-lite/deps/share/man/man3/zmq_msg_data.3
new file mode 100644
index 00000000..61c53495
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_data.3
@@ -0,0 +1,65 @@
+'\" t
+.\"     Title: zmq_msg_data
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_DATA" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_data \- retrieve pointer to message content
+.SH "SYNOPSIS"
+.sp
+\fBvoid *zmq_msg_data (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_data()\fR function shall return a pointer to the message content of the message object referenced by \fImsg\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+Upon successful completion, \fIzmq_msg_data()\fR shall return a pointer to the message content\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_size\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_get.3 b/ps-lite/deps/share/man/man3/zmq_msg_get.3
new file mode 100644
index 00000000..87a8baee
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_get.3
@@ -0,0 +1,104 @@
+'\" t
+.\"     Title: zmq_msg_get
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_GET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_get \- get message property
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_get (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, int \fR\fB\fIproperty\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_get()\fR function shall return the value for the property specified by the \fIproperty\fR argument for the message pointed to by the \fImessage\fR argument\&.
+.sp
+The following properties can be retrieved with the \fIzmq_msg_get()\fR function:
+.PP
+\fBZMQ_MORE\fR
+.RS 4
+Indicates that there are more message frames to follow after the
+\fImessage\fR\&.
+.RE
+.PP
+\fBZMQ_SRCFD\fR
+.RS 4
+Returns the file descriptor of the socket the
+\fImessage\fR
+was read from\&. This allows application to retrieve the remote endpoint via
+\fIgetpeername(2)\fR\&. Be aware that the respective socket might be closed already, reused even\&. Currently only implemented for TCP sockets\&.
+.RE
+.PP
+\fBZMQ_SHARED\fR
+.RS 4
+Indicates that a message MAY share underlying storage with another copy of this message\&.
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_get()\fR function shall return the value for the property if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested
+\fIproperty\fR
+is unknown\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBReceiving a multi-frame message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_msg_t frame;
+while (true) {
+    //  Create an empty 0MQ message to hold the message frame
+    int rc = zmq_msg_init (&frame);
+    assert (rc == 0);
+    //  Block until a message is available to be received from socket
+    rc = zmq_msg_recv (socket, &frame, 0);
+    assert (rc != \-1);
+    if (zmq_msg_get (&frame, ZMQ_MORE))
+        fprintf (stderr, "more\en");
+    else {
+        fprintf (stderr, "end\en");
+        break;
+    }
+    zmq_msg_close (&frame);
+}
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_set\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_gets.3 b/ps-lite/deps/share/man/man3/zmq_msg_gets.3
new file mode 100644
index 00000000..df257e05
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_gets.3
@@ -0,0 +1,93 @@
+'\" t
+.\"     Title: zmq_msg_gets
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_GETS" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_gets \- get message metadata property
+.SH "SYNOPSIS"
+.sp
+\fBconst char *zmq_msg_gets (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, const char *\fR\fB\fIproperty\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_gets()\fR function shall return the string value for the metadata property specified by the \fIproperty\fR argument for the message pointed to by the \fImessage\fR argument\&. Both the \fIproperty\fR argument and the \fIvalue\fR shall be NULL\-terminated UTF8\-encoded strings\&.
+.sp
+Metadata is defined on a per\-connection basis during the ZeroMQ connection handshake as specified in <rfc\&.zeromq\&.org/spec:37>\&.
+.sp
+The following ZMTP properties can be retrieved with the \fIzmq_msg_gets()\fR function:
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+Socket\-Type
+Identity
+Resource
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+Additionally, when available for the underlying transport, the \fBPeer\-Address\fR property will return the IP address of the remote endpoint as returned by getnameinfo(2)\&.
+.sp
+Other properties may be defined based on the underlying security mechanism, see ZAP authenticated connection sample below\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_gets()\fR function shall return the string value for the property if successful\&. Otherwise it shall return NULL and set \fIerrno\fR to one of the values defined below\&. The caller shall not modify or free the returned value, which shall be owned by the message\&. The encoding of the property and value shall be UTF8\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested
+\fIproperty\fR
+is unknown\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBGetting the ZAP authenticated user id for a message:\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_msg_t msg;
+zmq_msg_init (&msg);
+rc = zmq_msg_recv (&msg, dealer, 0);
+assert (rc != \-1);
+const char *user_id = zmq_msg_gets (&msg, "User\-Id");
+zmq_msg_close (&msg);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init.3 b/ps-lite/deps/share/man/man3/zmq_msg_init.3
new file mode 100644
index 00000000..d1f7aa7e
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_init.3
@@ -0,0 +1,99 @@
+'\" t
+.\"     Title: zmq_msg_init
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_INIT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_init \- initialise empty 0MQ message
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_init (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_init()\fR function shall initialise the message object referenced by \fImsg\fR to represent an empty message\&. This function is most useful when called before receiving a message with \fIzmq_recv()\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_init()\fR function always returns zero\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "EXAMPLE"
+.PP
+\fBReceiving a message from a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_msg_t msg;
+rc = zmq_msg_init (&msg);
+assert (rc == 0);
+int nbytes = zmq_recv (socket, &msg, 0);
+assert (nbytes != \-1);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init_data.3 b/ps-lite/deps/share/man/man3/zmq_msg_init_data.3
new file mode 100644
index 00000000..60ed5ce3
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_init_data.3
@@ -0,0 +1,146 @@
+'\" t
+.\"     Title: zmq_msg_init_data
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_INIT_DATA" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_init_data \- initialise 0MQ message from a supplied buffer
+.SH "SYNOPSIS"
+.sp
+\fBtypedef void (zmq_free_fn) (void \fR\fB\fI*data\fR\fR\fB, void \fR\fB\fI*hint\fR\fR\fB);\fR
+.sp
+\fBint zmq_msg_init_data (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*data\fR\fR\fB, size_t \fR\fB\fIsize\fR\fR\fB, zmq_free_fn \fR\fB\fI*ffn\fR\fR\fB, void \fR\fB\fI*hint\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_init_data()\fR function shall initialise the message object referenced by \fImsg\fR to represent the content referenced by the buffer located at address \fIdata\fR, \fIsize\fR bytes long\&. No copy of \fIdata\fR shall be performed and 0MQ shall take ownership of the supplied buffer\&.
+.sp
+If provided, the deallocation function \fIffn\fR shall be called once the data buffer is no longer required by 0MQ, with the \fIdata\fR and \fIhint\fR arguments supplied to \fIzmq_msg_init_data()\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The deallocation function \fIffn\fR needs to be thread\-safe, since it will be called from an arbitrary thread\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+If the deallocation function is not provided, the allocated memory will not be freed, and this may cause a memory leak\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_init_data()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBENOMEM\fR
+.RS 4
+Insufficient storage space is available\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBInitialising a message from a supplied buffer\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void my_free (void *data, void *hint)
+{
+    free (data);
+}
+
+    /*  \&.\&.\&.  */
+
+void *data = malloc (6);
+assert (data);
+memcpy (data, "ABCDEF", 6);
+zmq_msg_t msg;
+rc = zmq_msg_init_data (&msg, data, 6, my_free, NULL);
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_init_size\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init_size.3 b/ps-lite/deps/share/man/man3/zmq_msg_init_size.3
new file mode 100644
index 00000000..b374f52c
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_init_size.3
@@ -0,0 +1,86 @@
+'\" t
+.\"     Title: zmq_msg_init_size
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_INIT_SIZE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_init_size \- initialise 0MQ message of a specified size
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_init_size (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, size_t \fR\fB\fIsize\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_init_size()\fR function shall allocate any resources required to store a message \fIsize\fR bytes long and initialise the message object referenced by \fImsg\fR to represent the newly allocated message\&.
+.sp
+The implementation shall choose whether to store message content on the stack (small messages) or on the heap (large messages)\&. For performance reasons \fIzmq_msg_init_size()\fR shall not clear the message data\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_init_size()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBENOMEM\fR
+.RS 4
+Insufficient storage space is available\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_init_data\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_more.3 b/ps-lite/deps/share/man/man3/zmq_msg_more.3
new file mode 100644
index 00000000..ee44c3f4
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_more.3
@@ -0,0 +1,75 @@
+'\" t
+.\"     Title: zmq_msg_more
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_MORE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_more \- indicate if there are more message parts to receive
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_more (zmq_msg_t \fR\fB\fI*message\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_more()\fR function indicates whether this is part of a multi\-part message, and there are further parts to receive\&. This method can safely be called after \fIzmq_msg_close()\fR\&. This method is identical to \fIzmq_msg_get()\fR with an argument of ZMQ_MORE\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_more()\fR function shall return zero if this is the final part of a multi\-part message, or the only part of a single\-part message\&. It shall return 1 if there are further parts to receive\&.
+.SH "EXAMPLE"
+.PP
+\fBReceiving a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_msg_t part;
+while (true) {
+    //  Create an empty 0MQ message to hold the message part
+    int rc = zmq_msg_init (&part);
+    assert (rc == 0);
+    //  Block until a message is available to be received from socket
+    rc = zmq_msg_recv (socket, &part, 0);
+    assert (rc != \-1);
+    if (zmq_msg_more (&part))
+        fprintf (stderr, "more\en");
+    else {
+        fprintf (stderr, "end\en");
+        break;
+    }
+    zmq_msg_close (&part);
+}
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_get\fR(3) \fBzmq_msg_set\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_move.3 b/ps-lite/deps/share/man/man3/zmq_msg_move.3
new file mode 100644
index 00000000..2807f0cb
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_move.3
@@ -0,0 +1,68 @@
+'\" t
+.\"     Title: zmq_msg_move
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_MOVE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_move \- move content of a message to another message
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_move (zmq_msg_t \fR\fB\fI*dest\fR\fR\fB, zmq_msg_t \fR\fB\fI*src\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_move()\fR function shall move the content of the message object referenced by \fIsrc\fR to the message object referenced by \fIdest\fR\&. No actual copying of message content is performed, \fIdest\fR is simply updated to reference the new content\&. \fIsrc\fR becomes an empty message after calling \fIzmq_msg_move()\fR\&. The original content of \fIdest\fR, if any, shall be released\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_move()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEFAULT\fR
+.RS 4
+Invalid message\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_copy\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_recv.3 b/ps-lite/deps/share/man/man3/zmq_msg_recv.3
new file mode 100644
index 00000000..ec7beae8
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_recv.3
@@ -0,0 +1,161 @@
+'\" t
+.\"     Title: zmq_msg_recv
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_RECV" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_recv \- receive a message part from a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_recv (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_recv()\fR function is identical to \fBzmq_recvmsg\fR(3), which shall be deprecated in future versions\&. \fIzmq_msg_recv()\fR is more consistent with other message manipulation functions\&.
+.sp
+The \fIzmq_msg_recv()\fR function shall receive a message part from the socket referenced by the \fIsocket\fR argument and store it in the message referenced by the \fImsg\fR argument\&. Any content previously stored in \fImsg\fR shall be properly deallocated\&. If there are no message parts available on the specified \fIsocket\fR the \fIzmq_msg_recv()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
+\fIsocket\fR, the
+\fIzmq_msg_recv()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_msg_recv()\fR to determine if there are further parts to receive\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_recv()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and no messages are available at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_msg_recv()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_msg_recv()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before a message was available\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+The message passed to the function was invalid\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBReceiving a message from a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create an empty 0MQ message */
+zmq_msg_t msg;
+int rc = zmq_msg_init (&msg);
+assert (rc == 0);
+/* Block until a message is available to be received from socket */
+rc = zmq_msg_recv (&msg, socket, 0);
+assert (rc != \-1);
+/* Release message */
+zmq_msg_close (&msg);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBReceiving a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+int more;
+size_t more_size = sizeof (more);
+do {
+    /* Create an empty 0MQ message to hold the message part */
+    zmq_msg_t part;
+    int rc = zmq_msg_init (&part);
+    assert (rc == 0);
+    /* Block until a message is available to be received from socket */
+    rc = zmq_msg_recv (&part, socket, 0);
+    assert (rc != \-1);
+    /* Determine if more message parts are to follow */
+    rc = zmq_getsockopt (socket, ZMQ_RCVMORE, &more, &more_size);
+    assert (rc == 0);
+    zmq_msg_close (&part);
+} while (more);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_msg_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_send.3 b/ps-lite/deps/share/man/man3/zmq_msg_send.3
new file mode 100644
index 00000000..6ec16029
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_send.3
@@ -0,0 +1,179 @@
+'\" t
+.\"     Title: zmq_msg_send
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_SEND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_send \- send a message part on a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_send (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_send()\fR function is identical to \fBzmq_sendmsg\fR(3), which shall be deprecated in future versions\&. \fIzmq_msg_send()\fR is more consistent with other message manipulation functions\&.
+.sp
+The \fIzmq_msg_send()\fR function shall queue the message referenced by the \fImsg\fR argument to be sent to the socket referenced by the \fIsocket\fR argument\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
+\fIsocket\fR, the
+\fIzmq_msg_send()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.PP
+\fBZMQ_SNDMORE\fR
+.RS 4
+Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
+.RE
+.sp
+The \fIzmq_msg_t\fR structure passed to \fIzmq_msg_send()\fR is nullified during the call\&. If you want to send the same message to multiple sockets you have to copy it using (e\&.g\&. using \fIzmq_msg_copy()\fR)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+A successful invocation of \fIzmq_msg_send()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&. You do not need to call \fIzmq_msg_close()\fR after a successful \fIzmq_msg_send()\fR\&.
+.sp .5v
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_send()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and the message cannot be sent at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_msg_send()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_msg_send()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before the message was sent\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+Invalid message\&.
+.RE
+.PP
+\fBEHOSTUNREACH\fR
+.RS 4
+The message cannot be routed\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBFilling in a message and sending it to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a new message, allocating 6 bytes for message content */
+zmq_msg_t msg;
+int rc = zmq_msg_init_size (&msg, 6);
+assert (rc == 0);
+/* Fill in message content with \*(AqAAAAAA\*(Aq */
+memset (zmq_msg_data (&msg), \*(AqA\*(Aq, 6);
+/* Send the message to the socket */
+rc = zmq_msg_send (&msg, socket, 0);
+assert (rc == 6);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBSending a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Send a multi\-part message consisting of three parts to socket */
+rc = zmq_msg_send (&part1, socket, ZMQ_SNDMORE);
+rc = zmq_msg_send (&part2, socket, ZMQ_SNDMORE);
+/* Final part; no more parts to follow */
+rc = zmq_msg_send (&part3, socket, 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_msg_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_set.3 b/ps-lite/deps/share/man/man3/zmq_msg_set.3
new file mode 100644
index 00000000..c775065a
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_set.3
@@ -0,0 +1,56 @@
+'\" t
+.\"     Title: zmq_msg_set
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_SET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_set \- set message property
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_msg_set (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, int \fR\fB\fIproperty\fR\fR\fB, int \fR\fB\fIvalue\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_set()\fR function shall set the property specified by the \fIproperty\fR argument to the value of the \fIvalue\fR argument for the 0MQ message fragment pointed to by the \fImessage\fR argument\&.
+.sp
+Currently the \fIzmq_msg_set()\fR function does not support any property names\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_msg_set()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested property
+\fIproperty\fR
+is unknown\&.
+.RE
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_get\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_size.3 b/ps-lite/deps/share/man/man3/zmq_msg_size.3
new file mode 100644
index 00000000..bfb1e79a
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_msg_size.3
@@ -0,0 +1,65 @@
+'\" t
+.\"     Title: zmq_msg_size
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_MSG_SIZE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_msg_size \- retrieve message content size in bytes
+.SH "SYNOPSIS"
+.sp
+\fBsize_t zmq_msg_size (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_msg_size()\fR function shall return the size in bytes of the content of the message object referenced by \fImsg\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+Upon successful completion, \fIzmq_msg_size()\fR shall return the size of the message content in bytes\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq_msg_data\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_poll.3 b/ps-lite/deps/share/man/man3/zmq_poll.3
new file mode 100644
index 00000000..a09e5f85
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_poll.3
@@ -0,0 +1,177 @@
+'\" t
+.\"     Title: zmq_poll
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_POLL" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_poll \- input/output multiplexing
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_poll (zmq_pollitem_t \fR\fB\fI*items\fR\fR\fB, int \fR\fB\fInitems\fR\fR\fB, long \fR\fB\fItimeout\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_poll()\fR function provides a mechanism for applications to multiplex input/output events in a level\-triggered fashion over a set of sockets\&. Each member of the array pointed to by the \fIitems\fR argument is a \fBzmq_pollitem_t\fR structure\&. The \fInitems\fR argument specifies the number of items in the \fIitems\fR array\&. The \fBzmq_pollitem_t\fR structure is defined as follows:
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+typedef struct
+{
+    void \fI*socket\fR;
+    int \fIfd\fR;
+    short \fIevents\fR;
+    short \fIrevents\fR;
+} zmq_pollitem_t;
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+For each \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall examine either the 0MQ socket referenced by \fIsocket\fR \fBor\fR the standard socket specified by the file descriptor \fIfd\fR, for the event(s) specified in \fIevents\fR\&. If both \fIsocket\fR and \fIfd\fR are set in a single \fBzmq_pollitem_t\fR, the 0MQ socket referenced by \fIsocket\fR shall take precedence and the value of \fIfd\fR shall be ignored\&.
+.sp
+For each \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall first clear the \fIrevents\fR member, and then indicate any requested events that have occurred by setting the bit corresponding to the event condition in the \fIrevents\fR member\&.
+.sp
+If none of the requested events have occurred on any \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall wait \fItimeout\fR milliseconds for an event to occur on any of the requested items\&. If the value of \fItimeout\fR is 0, \fIzmq_poll()\fR shall return immediately\&. If the value of \fItimeout\fR is \-1, \fIzmq_poll()\fR shall block indefinitely until a requested event has occurred on at least one \fBzmq_pollitem_t\fR\&.
+.sp
+The \fIevents\fR and \fIrevents\fR members of \fBzmq_pollitem_t\fR are bit masks constructed by OR\(cqing a combination of the following event flags:
+.PP
+\fBZMQ_POLLIN\fR
+.RS 4
+For 0MQ sockets, at least one message may be received from the
+\fIsocket\fR
+without blocking\&. For standard sockets this is equivalent to the
+\fIPOLLIN\fR
+flag of the
+\fIpoll()\fR
+system call and generally means that at least one byte of data may be read from
+\fIfd\fR
+without blocking\&.
+.RE
+.PP
+\fBZMQ_POLLOUT\fR
+.RS 4
+For 0MQ sockets, at least one message may be sent to the
+\fIsocket\fR
+without blocking\&. For standard sockets this is equivalent to the
+\fIPOLLOUT\fR
+flag of the
+\fIpoll()\fR
+system call and generally means that at least one byte of data may be written to
+\fIfd\fR
+without blocking\&.
+.RE
+.PP
+\fBZMQ_POLLERR\fR
+.RS 4
+For standard sockets, this flag is passed through
+\fIzmq_poll()\fR
+to the underlying
+\fIpoll()\fR
+system call and generally means that some sort of error condition is present on the socket specified by
+\fIfd\fR\&. For 0MQ sockets this flag has no effect if set in
+\fIevents\fR, and shall never be returned in
+\fIrevents\fR
+by
+\fIzmq_poll()\fR\&.
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The \fIzmq_poll()\fR function may be implemented or emulated using operating system interfaces other than \fIpoll()\fR, and as such may be subject to the limits of those interfaces in ways not defined in this documentation\&.
+.sp .5v
+.RE
+.SH "RETURN VALUE"
+.sp
+Upon successful completion, the \fIzmq_poll()\fR function shall return the number of \fBzmq_pollitem_t\fR structures with events signaled in \fIrevents\fR or 0 if no events have been signaled\&. Upon failure, \fIzmq_poll()\fR shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBETERM\fR
+.RS 4
+At least one of the members of the
+\fIitems\fR
+array refers to a
+\fIsocket\fR
+whose associated 0MQ
+\fIcontext\fR
+was terminated\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+The provided
+\fIitems\fR
+was not valid (NULL)\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before any events were available\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBPolling indefinitely for input events on both a 0MQ socket and a standard socket.\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+zmq_pollitem_t items [2];
+/* First item refers to 0MQ socket \*(Aqsocket\*(Aq */
+items[0]\&.socket = socket;
+items[0]\&.events = ZMQ_POLLIN;
+/* Second item refers to standard socket \*(Aqfd\*(Aq */
+items[1]\&.socket = NULL;
+items[1]\&.fd = fd;
+items[1]\&.events = ZMQ_POLLIN;
+/* Poll for events indefinitely */
+int rc = zmq_poll (items, 2, \-1);
+assert (rc >= 0);
+/* Returned events will be stored in items[]\&.revents */
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_socket\fR(3) \fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq\fR(7)
+.sp
+Your operating system documentation for the \fIpoll()\fR system call\&.
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_proxy.3 b/ps-lite/deps/share/man/man3/zmq_proxy.3
new file mode 100644
index 00000000..ada64c92
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_proxy.3
@@ -0,0 +1,89 @@
+'\" t
+.\"     Title: zmq_proxy
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_PROXY" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_proxy \- start built\-in 0MQ proxy
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_proxy (const void \fR\fB\fI*frontend\fR\fR\fB, const void \fR\fB\fI*backend\fR\fR\fB, const void \fR\fB\fI*capture\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_proxy()\fR function starts the built\-in 0MQ proxy in the current application thread\&.
+.sp
+The proxy connects a frontend socket to a backend socket\&. Conceptually, data flows from frontend to backend\&. Depending on the socket types, replies may flow in the opposite direction\&. The direction is conceptual only; the proxy is fully symmetric and there is no technical difference between frontend and backend\&.
+.sp
+Before calling \fIzmq_proxy()\fR you must set any socket options, and connect or bind both frontend and backend sockets\&. The two conventional proxy models are:
+.sp
+\fIzmq_proxy()\fR runs in the current thread and returns only if/when the current context is closed\&.
+.sp
+If the capture socket is not NULL, the proxy shall send all messages, received on both frontend and backend, to the capture socket\&. The capture socket should be a \fIZMQ_PUB\fR, \fIZMQ_DEALER\fR, \fIZMQ_PUSH\fR, or \fIZMQ_PAIR\fR socket\&.
+.sp
+Refer to \fBzmq_socket\fR(3) for a description of the available socket types\&.
+.SH "EXAMPLE USAGE"
+.SS "Shared Queue"
+.sp
+When the frontend is a ZMQ_ROUTER socket, and the backend is a ZMQ_DEALER socket, the proxy shall act as a shared queue that collects requests from a set of clients, and distributes these fairly among a set of services\&. Requests shall be fair\-queued from frontend connections and distributed evenly across backend connections\&. Replies shall automatically return to the client that made the original request\&.
+.SS "Forwarder"
+.sp
+When the frontend is a ZMQ_XSUB socket, and the backend is a ZMQ_XPUB socket, the proxy shall act as a message forwarder that collects messages from a set of publishers and forwards these to a set of subscribers\&. This may be used to bridge networks transports, e\&.g\&. read on tcp:// and forward on pgm://\&.
+.SS "Streamer"
+.sp
+When the frontend is a ZMQ_PULL socket, and the backend is a ZMQ_PUSH socket, the proxy shall collect tasks from a set of clients and forwards these to a set of workers using the pipeline pattern\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_proxy()\fR function always returns \-1 and \fIerrno\fR set to \fBETERM\fR (the 0MQ \fIcontext\fR associated with either of the specified sockets was terminated)\&.
+.SH "EXAMPLE"
+.PP
+\fBCreating a shared queue proxy\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Create frontend and backend sockets
+void *frontend = zmq_socket (context, ZMQ_ROUTER);
+assert (backend);
+void *backend = zmq_socket (context, ZMQ_DEALER);
+assert (frontend);
+//  Bind both sockets to TCP ports
+assert (zmq_bind (frontend, "tcp://*:5555") == 0);
+assert (zmq_bind (backend, "tcp://*:5556") == 0);
+//  Start the queue proxy, which runs until ETERM
+zmq_proxy (frontend, backend, NULL);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3 b/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
new file mode 100644
index 00000000..4835a93f
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
@@ -0,0 +1,112 @@
+'\" t
+.\"     Title: zmq_proxy_steerable
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_PROXY_STEERABLE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_proxy_steerable \- built\-in 0MQ proxy with control flow
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_proxy_steerable (const void \fR\fB\fI*frontend\fR\fR\fB, const void \fR\fB\fI*backend\fR\fR\fB, const void \fR\fB\fI*capture\fR\fR\fB, const void \fR\fB\fI*control\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_proxy_steerable()\fR function starts the built\-in 0MQ proxy in the current application thread, as \fIzmq_proxy()\fR do\&. Please, refer to this function for the general description and usage\&. We describe here only the additional control flow provided by the socket passed as the fourth argument "control"\&.
+.sp
+If the control socket is not NULL, the proxy supports control flow\&. If \fIPAUSE\fR is received on this socket, the proxy suspends its activities\&. If \fIRESUME\fR is received, it goes on\&. If \fITERMINATE\fR is received, it terminates smoothly\&. At start, the proxy runs normally as if zmq_proxy was used\&.
+.sp
+If the control socket is NULL, the function behave exactly as if zmq_proxy had been called\&.
+.sp
+Refer to \fBzmq_socket\fR(3) for a description of the available socket types\&. Refer to \fBzmq_proxy\fR(3) for a description of the zmq_proxy\&.
+.SH "EXAMPLE USAGE"
+.sp
+cf zmq_proxy
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_proxy_steerable()\fR function returns 0 if TERMINATE is sent to its control socket\&. Otherwise, it returns \-1 and \fIerrno\fR set to \fBETERM\fR (the 0MQ \fIcontext\fR associated with either of the specified sockets was terminated)\&.
+.SH "EXAMPLE"
+.PP
+\fBCreating a shared queue proxy\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Create frontend, backend and control sockets
+void *frontend = zmq_socket (context, ZMQ_ROUTER);
+assert (backend);
+void *backend = zmq_socket (context, ZMQ_DEALER);
+assert (frontend);
+void *control = zmq_socket (context, ZMQ_SUB);
+assert (control);
+
+//  Bind sockets to TCP ports
+assert (zmq_bind (frontend, "tcp://*:5555") == 0);
+assert (zmq_bind (backend, "tcp://*:5556") == 0);
+assert (zmq_connect (control, "tcp://*:5557") == 0);
+
+// Subscribe to the control socket since we have chosen SUB here
+assert (zmq_setsockopt (control, ZMQ_SUBSCRIBE, "", 0));
+
+//  Start the queue proxy, which runs until ETERM or "TERMINATE"
+//  received on the control socket
+zmq_proxy_steerable (frontend, backend, NULL, control);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBSet up a controller in another node, process or whatever\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void *control = zmq_socket (context, ZMQ_PUB);
+assert (control);
+assert (zmq_bind (control, "tcp://*:5557") == 0);
+
+// pause the proxy
+assert (zmq_send (control, "PAUSE", 5, 0) == 0);
+
+// resume the proxy
+assert (zmq_send (control, "RESUME", 6, 0) == 0);
+
+// terminate the proxy
+assert (zmq_send (control, "TERMINATE", 9, 0) == 0);
+\-\-\-
+
+
+SEE ALSO
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+\fBzmq_proxy\fR(3) \fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_recv.3 b/ps-lite/deps/share/man/man3/zmq_recv.3
new file mode 100644
index 00000000..5d1b69a9
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_recv.3
@@ -0,0 +1,122 @@
+'\" t
+.\"     Title: zmq_recv
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_RECV" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_recv \- receive a message part from a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_recv (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_recv()\fR function shall receive a message from the socket referenced by the \fIsocket\fR argument and store it in the buffer referenced by the \fIbuf\fR argument\&. Any bytes exceeding the length specified by the \fIlen\fR argument shall be truncated\&. If there are no messages available on the specified \fIsocket\fR the \fIzmq_recv()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
+\fIsocket\fR, the
+\fIzmq_recv()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_recv()\fR to determine if there are further parts to receive\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_recv()\fR function shall return number of bytes in the message if successful\&. Note that the value can exceed the value of the \fIlen\fR parameter in case the message was truncated\&. If not successful the function shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and no messages are available at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_recv()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_recv()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before a message was available\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBReceiving a message from a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+char buf [256];
+nbytes = zmq_recv (socket, buf, 256, 0);
+assert (nbytes != \-1);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_recvmsg.3 b/ps-lite/deps/share/man/man3/zmq_recvmsg.3
new file mode 100644
index 00000000..daaff648
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_recvmsg.3
@@ -0,0 +1,175 @@
+'\" t
+.\"     Title: zmq_recvmsg
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_RECVMSG" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_recvmsg \- receive a message part from a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_recvmsg (void \fR\fB\fI*socket\fR\fR\fB, zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_recvmsg()\fR function shall receive a message part from the socket referenced by the \fIsocket\fR argument and store it in the message referenced by the \fImsg\fR argument\&. Any content previously stored in \fImsg\fR shall be properly deallocated\&. If there are no message parts available on the specified \fIsocket\fR the \fIzmq_recvmsg()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
+\fIsocket\fR, the
+\fIzmq_recvmsg()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+this API method is deprecated in favor of zmq_msg_recv(3)\&.
+.sp .5v
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_recvmsg()\fR to determine if there are further parts to receive\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_recvmsg()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and no messages are available at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_recvmsg()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_recvmsg()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before a message was available\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+The message passed to the function was invalid\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBReceiving a message from a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create an empty 0MQ message */
+zmq_msg_t msg;
+int rc = zmq_msg_init (&msg);
+assert (rc == 0);
+/* Block until a message is available to be received from socket */
+rc = zmq_recvmsg (socket, &msg, 0);
+assert (rc != \-1);
+/* Release message */
+zmq_msg_close (&msg);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBReceiving a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+int more;
+size_t more_size = sizeof (more);
+do {
+    /* Create an empty 0MQ message to hold the message part */
+    zmq_msg_t part;
+    int rc = zmq_msg_init (&part);
+    assert (rc == 0);
+    /* Block until a message is available to be received from socket */
+    rc = zmq_recvmsg (socket, &part, 0);
+    assert (rc != \-1);
+    /* Determine if more message parts are to follow */
+    rc = zmq_getsockopt (socket, ZMQ_RCVMORE, &more, &more_size);
+    assert (rc == 0);
+    zmq_msg_close (&part);
+} while (more);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_send.3 b/ps-lite/deps/share/man/man3/zmq_send.3
new file mode 100644
index 00000000..87e52bfc
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_send.3
@@ -0,0 +1,153 @@
+'\" t
+.\"     Title: zmq_send
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SEND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_send \- send a message part on a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_send (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_send()\fR function shall queue a message created from the buffer referenced by the \fIbuf\fR and \fIlen\fR arguments\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
+\fIsocket\fR, the
+\fIzmq_send()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.PP
+\fBZMQ_SNDMORE\fR
+.RS 4
+Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+A successful invocation of \fIzmq_send()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
+.sp .5v
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_send()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and the message cannot be sent at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_send()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_send()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before the message was sent\&.
+.RE
+.PP
+\fBEHOSTUNREACH\fR
+.RS 4
+The message cannot be routed\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBSending a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Send a multi\-part message consisting of three parts to socket */
+rc = zmq_send (socket, "ABC", 3, ZMQ_SNDMORE);
+assert (rc == 3);
+rc = zmq_send (socket, "DEFGH", 5, ZMQ_SNDMORE);
+assert (rc == 5);
+/* Final part; no more parts to follow */
+rc = zmq_send (socket, "JK", 2, 0);
+assert (rc == 2);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_send_const\fR(3) \fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_send_const.3 b/ps-lite/deps/share/man/man3/zmq_send_const.3
new file mode 100644
index 00000000..d512fed3
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_send_const.3
@@ -0,0 +1,153 @@
+'\" t
+.\"     Title: zmq_send_const
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SEND_CONST" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_send_const \- send a constant\-memory message part on a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_send_const (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_send_const()\fR function shall queue a message created from the buffer referenced by the \fIbuf\fR and \fIlen\fR arguments\&. The message buffer is assumed to be constant\-memory and will therefore not be copied or deallocated in any way\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
+\fIsocket\fR, the
+\fIzmq_send_const()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.PP
+\fBZMQ_SNDMORE\fR
+.RS 4
+Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+A successful invocation of \fIzmq_send_const()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
+.sp .5v
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_send_const()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and the message cannot be sent at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_send_const()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_send_const()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before the message was sent\&.
+.RE
+.PP
+\fBEHOSTUNREACH\fR
+.RS 4
+The message cannot be routed\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBSending a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Send a multi\-part message consisting of three parts to socket */
+rc = zmq_send_const (socket, "ABC", 3, ZMQ_SNDMORE);
+assert (rc == 3);
+rc = zmq_send_const (socket, "DEFGH", 5, ZMQ_SNDMORE);
+assert (rc == 5);
+/* Final part; no more parts to follow */
+rc = zmq_send_const (socket, "JK", 2, 0);
+assert (rc == 2);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_sendmsg.3 b/ps-lite/deps/share/man/man3/zmq_sendmsg.3
new file mode 100644
index 00000000..d3a5c469
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_sendmsg.3
@@ -0,0 +1,193 @@
+'\" t
+.\"     Title: zmq_sendmsg
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SENDMSG" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_sendmsg \- send a message part on a socket
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_sendmsg (void \fR\fB\fI*socket\fR\fR\fB, zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_sendmsg()\fR function shall queue the message referenced by the \fImsg\fR argument to be sent to the socket referenced by the \fIsocket\fR argument\&. The \fIflags\fR argument is a combination of the flags defined below:
+.PP
+\fBZMQ_DONTWAIT\fR
+.RS 4
+For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
+\fIsocket\fR, the
+\fIzmq_sendmsg()\fR
+function shall fail with
+\fIerrno\fR
+set to EAGAIN\&.
+.RE
+.PP
+\fBZMQ_SNDMORE\fR
+.RS 4
+Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
+.RE
+.sp
+The \fIzmq_msg_t\fR structure passed to \fIzmq_sendmsg()\fR is nullified during the call\&. If you want to send the same message to multiple sockets you have to copy it using (e\&.g\&. using \fIzmq_msg_copy()\fR)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+A successful invocation of \fIzmq_sendmsg()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+this API method is deprecated in favor of zmq_msg_send(3)\&.
+.sp .5v
+.RE
+.SS "Multi\-part messages"
+.sp
+A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
+.sp
+An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_sendmsg()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEAGAIN\fR
+.RS 4
+Non\-blocking mode was requested and the message cannot be sent at the moment\&.
+.RE
+.PP
+\fBENOTSUP\fR
+.RS 4
+The
+\fIzmq_sendmsg()\fR
+operation is not supported by this socket type\&.
+.RE
+.PP
+\fBEFSM\fR
+.RS 4
+The
+\fIzmq_sendmsg()\fR
+operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
+\fImessaging patterns\fR
+section of
+\fBzmq_socket\fR(3)
+for more information\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal before the message was sent\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+Invalid message\&.
+.RE
+.PP
+\fBEHOSTUNREACH\fR
+.RS 4
+The message cannot be routed\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBFilling in a message and sending it to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a new message, allocating 6 bytes for message content */
+zmq_msg_t msg;
+int rc = zmq_msg_init_size (&msg, 6);
+assert (rc == 0);
+/* Fill in message content with \*(AqAAAAAA\*(Aq */
+memset (zmq_msg_data (&msg), \*(AqA\*(Aq, 6);
+/* Send the message to the socket */
+rc = zmq_sendmsg (socket, &msg, 0);
+assert (rc == 6);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBSending a multi-part message\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Send a multi\-part message consisting of three parts to socket */
+rc = zmq_sendmsg (socket, &part1, ZMQ_SNDMORE);
+rc = zmq_sendmsg (socket, &part2, ZMQ_SNDMORE);
+/* Final part; no more parts to follow */
+rc = zmq_sendmsg (socket, &part3, 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_setsockopt.3 b/ps-lite/deps/share/man/man3/zmq_setsockopt.3
new file mode 100644
index 00000000..f1d5d6d1
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_setsockopt.3
@@ -0,0 +1,2473 @@
+'\" t
+.\"     Title: zmq_setsockopt
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SETSOCKOPT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_setsockopt \- set 0MQ socket options
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_setsockopt (void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, const void \fR\fB\fI*option_value\fR\fR\fB, size_t \fR\fB\fIoption_len\fR\fR\fB);\fR
+.sp
+Caution: All options, with the exception of ZMQ_SUBSCRIBE, ZMQ_UNSUBSCRIBE, ZMQ_LINGER, ZMQ_ROUTER_HANDOVER, ZMQ_ROUTER_MANDATORY, ZMQ_PROBE_ROUTER, ZMQ_XPUB_VERBOSE, ZMQ_REQ_CORRELATE, and ZMQ_REQ_RELAXED, only take effect for subsequent socket bind/connects\&.
+.sp
+Specifically, security options take effect for subsequent bind/connect calls, and can be changed at any time to affect subsequent binds and/or connects\&.
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_setsockopt()\fR function shall set the option specified by the \fIoption_name\fR argument to the value pointed to by the \fIoption_value\fR argument for the 0MQ socket pointed to by the \fIsocket\fR argument\&. The \fIoption_len\fR argument is the size of the option value in bytes\&.
+.sp
+The following socket options can be set with the \fIzmq_setsockopt()\fR function:
+.SS "ZMQ_AFFINITY: Set I/O thread affinity"
+.sp
+The \fIZMQ_AFFINITY\fR option shall set the I/O thread affinity for newly created connections on the specified \fIsocket\fR\&.
+.sp
+Affinity determines which threads from the 0MQ I/O thread pool associated with the socket\(cqs \fIcontext\fR shall handle newly created connections\&. A value of zero specifies no affinity, meaning that work shall be distributed fairly among all 0MQ I/O threads in the thread pool\&. For non\-zero values, the lowest bit corresponds to thread 1, second lowest bit to thread 2 and so on\&. For example, a value of 3 specifies that subsequent connections on \fIsocket\fR shall be handled exclusively by I/O threads 1 and 2\&.
+.sp
+See also \fBzmq_init\fR(3) for details on allocating the number of I/O threads for a specific \fIcontext\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+uint64_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A (bitmap)
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+N/A
+T}
+.TE
+.sp 1
+.SS "ZMQ_BACKLOG: Set maximum length of the queue of outstanding connections"
+.sp
+The \fIZMQ_BACKLOG\fR option shall set the maximum length of the queue of outstanding peer connections for the specified \fIsocket\fR; this only applies to connection\-oriented transports\&. For details refer to your operating system documentation for the \fIlisten\fR function\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+connections
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_CONNECT_RID: Assign the next outbound connection id"
+.sp
+The \fIZMQ_CONNECT_RID\fR option sets the peer id of the next host connected via the zmq_connect() call, and immediately readies that connection for data transfer with the named id\&. This option applies only to the first subsequent call to zmq_connect(), calls thereafter use default connection behavior\&.
+.sp
+Typical use is to set this socket option ahead of each zmq_connect() attempt to a new host\&. Each connection MUST be assigned a unique name\&. Assigning a name that is already in use is not allowed\&.
+.sp
+Useful when connecting ROUTER to ROUTER, or STREAM to STREAM, as it allows for immediate sending to peers\&. Outbound id framing requirements for ROUTER and STREAM sockets apply\&.
+.sp
+The peer id should be from 1 to 255 bytes long and MAY NOT start with binary zero\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_ROUTER, ZMQ_STREAM
+T}
+.TE
+.sp 1
+.SS "ZMQ_CONFLATE: Keep only last message"
+.sp
+If set, a socket shall keep only one message in its inbound/outbound queue, this message being the last message received/the last message to be sent\&. Ignores \fIZMQ_RCVHWM\fR and \fIZMQ_SNDHWM\fR options\&. Does not support multi\-part messages, in particular, only one part of it is kept in the socket internal queue\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_PULL, ZMQ_PUSH, ZMQ_SUB, ZMQ_PUB, ZMQ_DEALER
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_PUBLICKEY: Set CURVE public key"
+.sp
+Sets the socket\(cqs long term public key\&. You must set this on CURVE client sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. The public key must always be used with the matching secret key\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_SECRETKEY: Set CURVE secret key"
+.sp
+Sets the socket\(cqs long term secret key\&. You must set this on both CURVE client and server sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_SERVER: Set CURVE server role"
+.sp
+Defines whether the socket will act as server for CURVE security, see \fBzmq_curve\fR(7)\&. A value of \fI1\fR means the socket will act as CURVE server\&. A value of \fI0\fR means the socket will not act as CURVE server, and its security role then depends on other option settings\&. Setting this to \fI0\fR shall reset the socket security to NULL\&. When you set this you must also set the server\(cqs secret key using the ZMQ_CURVE_SECRETKEY option\&. A server socket does not need to know its own public key\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_CURVE_SERVERKEY: Set CURVE server key"
+.sp
+Sets the socket\(cqs long term server key\&. You must set this on CURVE client sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. This key must have been generated together with the server\(cqs secret key\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data or Z85 text string
+T}
+T{
+.sp
+Option value size
+T}:T{
+.sp
+32 or 41
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_PLAINTEXT: Disable GSSAPI encryption"
+.sp
+Defines whether communications on the socket will encrypted, see \fBzmq_gssapi\fR(7)\&. A value of \fI1\fR means that communications will be plaintext\&. A value of \fI0\fR means communications will be encrypted\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_PRINCIPAL: Set name of GSSAPI principal"
+.sp
+Sets the name of the pricipal for whom GSSAPI credentials should be acquired\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_SERVER: Set GSSAPI server role"
+.sp
+Defines whether the socket will act as server for GSSAPI security, see \fBzmq_gssapi\fR(7)\&. A value of \fI1\fR means the socket will act as GSSAPI server\&. A value of \fI0\fR means the socket will act as GSSAPI client\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_GSSAPI_SERVICE_PRINCIPAL: Set name of GSSAPI service principal"
+.sp
+Sets the name of the pricipal of the GSSAPI server to which a GSSAPI client intends to connect\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_HANDSHAKE_IVL: Set maximum handshake interval"
+.sp
+The \fIZMQ_HANDSHAKE_IVL\fR option shall set the maximum handshake interval for the specified \fIsocket\fR\&. Handshaking is the exchange of socket configuration information (socket type, identity, security) that occurs when a connection is first opened, only for connection\-oriented transports\&. If handshaking does not complete within the configured time, the connection shall be closed\&. The value 0 means no handshake time limit\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+30000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all but ZMQ_STREAM, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_IDENTITY: Set socket identity"
+.sp
+The \fIZMQ_IDENTITY\fR option shall set the identity of the specified \fIsocket\fR when connecting to a ROUTER socket\&. The identity should be from 1 to 255 bytes long and may contain any values\&.
+.sp
+If two clients use the same identity when connecting to a ROUTER, the results shall depend on the ZMQ_ROUTER_HANDOVER option setting\&. If that is not set (or set to the default of zero), the ROUTER socket shall reject clients trying to connect with an already\-used identity\&. If that option is set to 1, the ROUTER socket shall hand\-over the connection to the new client and disconnect the existing one\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+NULL
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_REQ, ZMQ_REP, ZMQ_ROUTER, ZMQ_DEALER\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IMMEDIATE: Queue messages only to completed connections"
+.sp
+By default queues will fill on outgoing connections even if the connection has not completed\&. This can lead to "lost" messages on sockets with round\-robin routing (REQ, PUSH, DEALER)\&. If this option is set to 1, messages shall be queued only to completed connections\&. This will cause the socket to block if there are no other connections, but will prevent queues from filling on pipes awaiting connection\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPV6: Enable IPv6 on socket"
+.sp
+Set the IPv6 option for the socket\&. A value of 1 means IPv6 is enabled on the socket, while 0 means the socket will use only IPv4\&. When IPv6 is enabled the socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (false)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_LINGER: Set linger period for socket shutdown"
+.sp
+The \fIZMQ_LINGER\fR option shall set the linger period for the specified \fIsocket\fR\&. The linger period determines how long pending messages which have yet to be sent to a peer shall linger in memory after a socket is disconnected with \fBzmq_disconnect\fR(3) or closed with \fBzmq_close\fR(3), and further affects the termination of the socket\(cqs context with \fBzmq_term\fR(3)\&. The following outlines the different behaviours:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The default value of
+\fI\-1\fR
+specifies an infinite linger period\&. Pending messages shall not be discarded after a call to
+\fIzmq_disconnect()\fR
+or
+\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
+\fIzmq_term()\fR
+shall block until all pending messages have been sent to a peer\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The value of
+\fI0\fR
+specifies no linger period\&. Pending messages shall be discarded immediately after a call to
+\fIzmq_disconnect()\fR
+or
+\fIzmq_close()\fR\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+Positive values specify an upper bound for the linger period in milliseconds\&. Pending messages shall not be discarded after a call to
+\fIzmq_disconnect()\fR
+or
+\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
+\fIzmq_term()\fR
+shall block until either all pending messages have been sent to a peer, or the linger period expires, after which any pending messages shall be discarded\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+Option value type
+T}:T{
+int
+T}
+T{
+Option value unit
+T}:T{
+milliseconds
+T}
+T{
+Default value
+T}:T{
+\-1 (infinite)
+T}
+T{
+Applicable socket types
+T}:T{
+all
+T}
+.TE
+.sp 1
+.RE
+.SS "ZMQ_MAXMSGSIZE: Maximum acceptable inbound message size"
+.sp
+Limits the size of the inbound message\&. If a peer sends a message larger than ZMQ_MAXMSGSIZE it is disconnected\&. Value of \-1 means \fIno limit\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int64_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_MULTICAST_HOPS: Maximum network hops for multicast packets"
+.sp
+Sets the time\-to\-live field in every multicast packet sent from this socket\&. The default is 1 which means that the multicast packets don\(cqt leave the local network\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+network hops
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_PASSWORD: Set PLAIN security password"
+.sp
+Sets the password for outgoing connections over TCP or IPC\&. If you set this to a non\-null value, the security mechanism used for connections shall be PLAIN, see \fBzmq_plain\fR(7)\&. If you set this to a null value, the security mechanism used for connections shall be NULL, see \fBzmq_null\fR(3)\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_SERVER: Set PLAIN server role"
+.sp
+Defines whether the socket will act as server for PLAIN security, see \fBzmq_plain\fR(7)\&. A value of \fI1\fR means the socket will act as PLAIN server\&. A value of \fI0\fR means the socket will not act as PLAIN server, and its security role then depends on other option settings\&. Setting this to \fI0\fR shall reset the socket security to NULL\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_PLAIN_USERNAME: Set PLAIN security username"
+.sp
+Sets the username for outgoing connections over TCP or IPC\&. If you set this to a non\-null value, the security mechanism used for connections shall be PLAIN, see \fBzmq_plain\fR(7)\&. If you set this to a null value, the security mechanism used for connections shall be NULL, see \fBzmq_null\fR(3)\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_PROBE_ROUTER: bootstrap connections to ROUTER sockets"
+.sp
+When set to 1, the socket will automatically send an empty message when a new connection is made or accepted\&. You may set this on REQ, DEALER, or ROUTER sockets connected to a ROUTER socket\&. The application must filter such empty messages\&. The ZMQ_PROBE_ROUTER option in effect provides the ROUTER application with an event signaling the arrival of a new peer\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+do not set this option on a socket that talks to any other socket types: the results are undefined\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_ROUTER, ZMQ_DEALER, ZMQ_REQ
+T}
+.TE
+.sp 1
+.SS "ZMQ_RATE: Set multicast data rate"
+.sp
+The \fIZMQ_RATE\fR option shall set the maximum send or receive data rate for multicast transports such as \fBzmq_pgm\fR(7) using the specified \fIsocket\fR\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+kilobits per second
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVBUF: Set kernel receive buffer size"
+.sp
+The \fIZMQ_RCVBUF\fR option shall set the underlying kernel receive buffer size for the \fIsocket\fR to the specified size in bytes\&. A value of zero means leave the OS default unchanged\&. For details refer to your operating system documentation for the \fISO_RCVBUF\fR socket option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVHWM: Set high water mark for inbound messages"
+.sp
+The \fIZMQ_RCVHWM\fR option shall set the high water mark for inbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
+.sp
+If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+messages
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RCVTIMEO: Maximum time before a recv operation returns with EAGAIN"
+.sp
+Sets the timeout for receive operation on the socket\&. If the value is 0, \fIzmq_recv(3)\fR will return immediately, with a EAGAIN error if there is no message to receive\&. If the value is \-1, it will block until a message is available\&. For all other values, it will wait for a message for that amount of time before returning with an EAGAIN error\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (infinite)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECONNECT_IVL: Set reconnection interval"
+.sp
+The \fIZMQ_RECONNECT_IVL\fR option shall set the initial reconnection interval for the specified \fIsocket\fR\&. The reconnection interval is the period 0MQ shall wait between attempts to reconnect disconnected peers when using connection\-oriented transports\&. The value \-1 means no reconnection\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The reconnection interval may be randomized by 0MQ to prevent reconnection storms in topologies with a large number of peers per socket\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+100
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECONNECT_IVL_MAX: Set maximum reconnection interval"
+.sp
+The \fIZMQ_RECONNECT_IVL_MAX\fR option shall set the maximum reconnection interval for the specified \fIsocket\fR\&. This is the maximum period 0MQ shall wait between attempts to reconnect\&. On each reconnect attempt, the previous interval shall be doubled untill ZMQ_RECONNECT_IVL_MAX is reached\&. This allows for exponential backoff strategy\&. Default value means no exponential backoff is performed and reconnect interval calculations are only based on ZMQ_RECONNECT_IVL\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+Values less than ZMQ_RECONNECT_IVL will be ignored\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0 (only use ZMQ_RECONNECT_IVL)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_RECOVERY_IVL: Set multicast recovery interval"
+.sp
+The \fIZMQ_RECOVERY_IVL\fR option shall set the recovery interval for multicast transports using the specified \fIsocket\fR\&. The recovery interval determines the maximum time in milliseconds that a receiver can be absent from a multicast group before unrecoverable data loss will occur\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+Exercise care when setting large recovery intervals as the data needed for recovery will be held in memory\&. For example, a 1 minute recovery interval at a data rate of 1Gbps requires a 7GB in\-memory buffer\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+10000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using multicast transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_REQ_CORRELATE: match replies with requests"
+.sp
+The default behavior of REQ sockets is to rely on the ordering of messages to match requests and responses and that is usually sufficient\&. When this option is set to 1, the REQ socket will prefix outgoing messages with an extra frame containing a request id\&. That means the full message is (request id, identity, 0, user frames\&...)\&. The REQ socket will discard all incoming messages that don\(cqt begin with these two frames\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_REQ
+T}
+.TE
+.sp 1
+.SS "ZMQ_REQ_RELAXED: relax strict alternation between request and reply"
+.sp
+By default, a REQ socket does not allow initiating a new request with \fIzmq_send(3)\fR until the reply to the previous one has been received\&. When set to 1, sending another message is allowed and has the effect of disconnecting the underlying connection to the peer from which the reply was expected, triggering a reconnection attempt on transports that support it\&. The request\-reply state machine is reset and a new request is sent to the next available peer\&.
+.sp
+If set to 1, also enable ZMQ_REQ_CORRELATE to ensure correct matching of requests and replies\&. Otherwise a late reply to an aborted request can be reported as the reply to the superseding request\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_REQ
+T}
+.TE
+.sp 1
+.SS "ZMQ_ROUTER_HANDOVER: handle duplicate client identities on ROUTER sockets"
+.sp
+If two clients use the same identity when connecting to a ROUTER, the results shall depend on the ZMQ_ROUTER_HANDOVER option setting\&. If that is not set (or set to the default of zero), the ROUTER socket shall reject clients trying to connect with an already\-used identity\&. If that option is set to 1, the ROUTER socket shall hand\-over the connection to the new client and disconnect the existing one\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_ROUTER
+T}
+.TE
+.sp 1
+.SS "ZMQ_ROUTER_MANDATORY: accept only routable messages on ROUTER sockets"
+.sp
+Sets the ROUTER socket behavior when an unroutable message is encountered\&. A value of 0 is the default and discards the message silently when it cannot be routed or the peers SNDHWM is reached\&. A value of 1 returns an \fIEHOSTUNREACH\fR error code if the message cannot be routed or \fIEAGAIN\fR error code if the SNDHWM is reached and ZMQ_DONTWAIT was used\&. Without ZMQ_DONTWAIT it will block until the SNDTIMEO is reached or a spot in the send queue opens up\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_ROUTER
+T}
+.TE
+.sp 1
+.SS "ZMQ_ROUTER_RAW: switch ROUTER socket to raw mode"
+.sp
+Sets the raw mode on the ROUTER, when set to 1\&. When the ROUTER socket is in raw mode, and when using the tcp:// transport, it will read and write TCP data without 0MQ framing\&. This lets 0MQ applications talk to non\-0MQ applications\&. When using raw mode, you cannot set explicit identities, and the ZMQ_SNDMORE flag is ignored when sending data messages\&. In raw mode you can close a specific connection by sending it a zero\-length message (following the identity frame)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+This option is deprecated, please use ZMQ_STREAM sockets instead\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_ROUTER
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDBUF: Set kernel transmit buffer size"
+.sp
+The \fIZMQ_SNDBUF\fR option shall set the underlying kernel transmit buffer size for the \fIsocket\fR to the specified size in bytes\&. A value of zero means leave the OS default unchanged\&. For details please refer to your operating system documentation for the \fISO_SNDBUF\fR socket option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+bytes
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDHWM: Set high water mark for outbound messages"
+.sp
+The \fIZMQ_SNDHWM\fR option shall set the high water mark for outbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
+.sp
+If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+0MQ does not guarantee that the socket will accept as many as ZMQ_SNDHWM messages, and the actual limit may be as much as 60\-70% lower depending on the flow of messages on the socket\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+messages
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1000
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_SNDTIMEO: Maximum time before a send operation returns with EAGAIN"
+.sp
+Sets the timeout for send operation on the socket\&. If the value is 0, \fIzmq_send(3)\fR will return immediately, with a EAGAIN error if the message cannot be sent\&. If the value is \-1, it will block until the message is sent\&. For all other values, it will try to send the message for that amount of time before returning with an EAGAIN error\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+milliseconds
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (infinite)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all
+T}
+.TE
+.sp 1
+.SS "ZMQ_SUBSCRIBE: Establish message filter"
+.sp
+The \fIZMQ_SUBSCRIBE\fR option shall establish a new message filter on a \fIZMQ_SUB\fR socket\&. Newly created \fIZMQ_SUB\fR sockets shall filter out all incoming messages, therefore you should call this option to establish an initial message filter\&.
+.sp
+An empty \fIoption_value\fR of length zero shall subscribe to all incoming messages\&. A non\-empty \fIoption_value\fR shall subscribe to all messages beginning with the specified prefix\&. Multiple filters may be attached to a single \fIZMQ_SUB\fR socket, in which case a message shall be accepted if it matches at least one filter\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_SUB
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE: Override SO_KEEPALIVE socket option"
+.sp
+Override \fISO_KEEPALIVE\fR socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,0,1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_CNT: Override TCP_KEEPCNT socket option"
+.sp
+Override \fITCP_KEEPCNT\fR socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_IDLE: Override TCP_KEEPCNT (or TCP_KEEPALIVE on some OS)"
+.sp
+Override \fITCP_KEEPCNT\fR (or \fITCP_KEEPALIVE\fR on some OS) socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_KEEPALIVE_INTVL: Override TCP_KEEPINTVL socket option"
+.sp
+Override \fITCP_KEEPINTVL\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+\-1,>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+\-1 (leave to OS default)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_TOS: Set the Type\-of\-Service on socket"
+.sp
+Sets the ToS fields (Differentiated services (DS) and Explicit Congestion Notification (ECN) field of the IP header\&. The ToS field is typically used to specify a packets priority\&. The availability of this option is dependent on intermediate network equipment that inspect the ToS field andprovide a path for low\-delay, high\-throughput, highly\-reliable service, etc\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+>0
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, only for connection\-oriented transports
+T}
+.TE
+.sp 1
+.SS "ZMQ_UNSUBSCRIBE: Remove message filter"
+.sp
+The \fIZMQ_UNSUBSCRIBE\fR option shall remove an existing message filter on a \fIZMQ_SUB\fR socket\&. The filter specified must match an existing filter previously established with the \fIZMQ_SUBSCRIBE\fR option\&. If the socket has several instances of the same filter attached the \fIZMQ_UNSUBSCRIBE\fR option shall remove only one instance, leaving the rest in place and functional\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_SUB
+T}
+.TE
+.sp 1
+.SS "ZMQ_XPUB_VERBOSE: provide all subscription messages on XPUB sockets"
+.sp
+Sets the \fIXPUB\fR socket behavior on new subscriptions and unsubscriptions\&. A value of \fI0\fR is the default and passes only new subscription messages to upstream\&. A value of \fI1\fR passes all subscription messages upstream\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+0, 1
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+0
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+ZMQ_XPUB
+T}
+.TE
+.sp 1
+.SS "ZMQ_ZAP_DOMAIN: Set RFC 27 authentication domain"
+.sp
+Sets the domain for ZAP (ZMQ RFC 27) authentication\&. For NULL security (the default on all tcp:// connections), ZAP authentication only happens if you set a non\-empty domain\&. For PLAIN and CURVE security, ZAP requests are always made, if there is a ZAP handler present\&. See \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:27\fR\m[] for more details\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+character string
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+not set
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transport
+T}
+.TE
+.sp 1
+.SS "ZMQ_TCP_ACCEPT_FILTER: Assign filters to allow new TCP connections"
+.sp
+Assign an arbitrary number of filters that will be applied for each new TCP transport connection on a listening socket\&. If no filters are applied, then the TCP transport allows connections from any IP address\&. If at least one filter is applied then new connection source ip should be matched\&. To clear all filters call zmq_setsockopt(socket, ZMQ_TCP_ACCEPT_FILTER, NULL, 0)\&. Filter is a null\-terminated string with ipv6 or ipv4 CIDR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+This option is deprecated, please use authentication via the ZAP API and IP address whitelisting / blacklisting\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+binary data
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+no filters (allow from all)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all listening sockets, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPC_FILTER_GID: Assign group ID filters to allow new IPC connections"
+.sp
+Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all GID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_GID, NULL, 0)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+GID filters are only available on platforms supporting SO_PEERCRED or LOCAL_PEERCRED socket options (currently only Linux and later versions of OS X)\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+gid_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+no filters (allow from all)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all listening sockets, when using IPC transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPC_FILTER_PID: Assign process ID filters to allow new IPC connections"
+.sp
+Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all PID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_PID, NULL, 0)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+PID filters are only available on platforms supporting the SO_PEERCRED socket option (currently only Linux)\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+pid_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+no filters (allow from all)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all listening sockets, when using IPC transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPC_FILTER_UID: Assign user ID filters to allow new IPC connections"
+.sp
+Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all UID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_UID, NULL, 0)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+UID filters are only available on platforms supporting SO_PEERCRED or LOCAL_PEERCRED socket options (currently only Linux and later versions of OS X)\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
+.sp .5v
+.RE
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+uid_t
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+no filters (allow from all)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all listening sockets, when using IPC transports\&.
+T}
+.TE
+.sp 1
+.SS "ZMQ_IPV4ONLY: Use IPv4\-only on socket"
+.sp
+Set the IPv4\-only option for the socket\&. This option is deprecated\&. Please use the ZMQ_IPV6 option\&.
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Option value type
+T}:T{
+.sp
+int
+T}
+T{
+.sp
+Option value unit
+T}:T{
+.sp
+boolean
+T}
+T{
+.sp
+Default value
+T}:T{
+.sp
+1 (true)
+T}
+T{
+.sp
+Applicable socket types
+T}:T{
+.sp
+all, when using TCP transports\&.
+T}
+.TE
+.sp 1
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_setsockopt()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested option
+\fIoption_name\fR
+is unknown, or the requested
+\fIoption_len\fR
+or
+\fIoption_value\fR
+is invalid\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.PP
+\fBEINTR\fR
+.RS 4
+The operation was interrupted by delivery of a signal\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBSubscribing to messages on a ZMQ_SUB socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Subscribe to all messages */
+rc = zmq_setsockopt (socket, ZMQ_SUBSCRIBE, "", 0);
+assert (rc == 0);
+/* Subscribe to messages prefixed with "ANIMALS\&.CATS" */
+rc = zmq_setsockopt (socket, ZMQ_SUBSCRIBE, "ANIMALS\&.CATS", 12);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBSetting I/O thread affinity\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+int64_t affinity;
+/* Incoming connections on TCP port 5555 shall be handled by I/O thread 1 */
+affinity = 1;
+rc = zmq_setsockopt (socket, ZMQ_AFFINITY, &affinity, sizeof (affinity));
+assert (rc);
+rc = zmq_bind (socket, "tcp://lo:5555");
+assert (rc);
+/* Incoming connections on TCP port 5556 shall be handled by I/O thread 2 */
+affinity = 2;
+rc = zmq_setsockopt (socket, ZMQ_AFFINITY, &affinity, sizeof (affinity));
+assert (rc);
+rc = zmq_bind (socket, "tcp://lo:5556");
+assert (rc);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(3) \fBzmq_plain\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_socket.3 b/ps-lite/deps/share/man/man3/zmq_socket.3
new file mode 100644
index 00000000..59f0f46a
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_socket.3
@@ -0,0 +1,1025 @@
+'\" t
+.\"     Title: zmq_socket
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SOCKET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_socket \- create 0MQ socket
+.SH "SYNOPSIS"
+.sp
+\fBvoid *zmq_socket (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fItype\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_socket()\fR function shall create a 0MQ socket within the specified \fIcontext\fR and return an opaque handle to the newly created socket\&. The \fItype\fR argument specifies the socket type, which determines the semantics of communication over the socket\&.
+.sp
+The newly created socket is initially unbound, and not associated with any endpoints\&. In order to establish a message flow a socket must first be connected to at least one endpoint with \fBzmq_connect\fR(3), or at least one endpoint must be created for accepting incoming connections with \fBzmq_bind\fR(3)\&.
+.PP
+\fBKey differences to conventional sockets\fR. Generally speaking, conventional sockets present a
+\fIsynchronous\fR
+interface to either connection\-oriented reliable byte streams (SOCK_STREAM), or connection\-less unreliable datagrams (SOCK_DGRAM)\&. In comparison, 0MQ sockets present an abstraction of an asynchronous
+\fImessage queue\fR, with the exact queueing semantics depending on the socket type in use\&. Where conventional sockets transfer streams of bytes or discrete datagrams, 0MQ sockets transfer discrete
+\fImessages\fR\&.
+.sp
+0MQ sockets being \fIasynchronous\fR means that the timings of the physical connection setup and tear down, reconnect and effective delivery are transparent to the user and organized by 0MQ itself\&. Further, messages may be \fIqueued\fR in the event that a peer is unavailable to receive them\&.
+.sp
+Conventional sockets allow only strict one\-to\-one (two peers), many\-to\-one (many clients, one server), or in some cases one\-to\-many (multicast) relationships\&. With the exception of \fIZMQ_PAIR\fR, 0MQ sockets may be connected \fBto multiple endpoints\fR using \fIzmq_connect()\fR, while simultaneously accepting incoming connections \fBfrom multiple endpoints\fR bound to the socket using \fIzmq_bind()\fR, thus allowing many\-to\-many relationships\&.
+.PP
+\fBThread safety\fR. 0MQ
+\fIsockets\fR
+are
+\fInot\fR
+thread safe\&. Applications MUST NOT use a socket from multiple threads except after migrating a socket from one thread to another with a "full fence" memory barrier\&.
+.PP
+\fBSocket types\fR. The following sections present the socket types defined by 0MQ, grouped by the general
+\fImessaging pattern\fR
+which is built from related socket types\&.
+.SS "Request\-reply pattern"
+.sp
+The request\-reply pattern is used for sending requests from a ZMQ_REQ \fIclient\fR to one or more ZMQ_REP \fIservices\fR, and receiving subsequent replies to each request sent\&.
+.sp
+The request\-reply pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:28\fR\m[]\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_REQ\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_REQ\fR is used by a \fIclient\fR to send requests to and receive replies from a \fIservice\fR\&. This socket type allows only an alternating sequence of \fIzmq_send(request)\fR and subsequent \fIzmq_recv(reply)\fR calls\&. Each request sent is round\-robined among all \fIservices\fR, and each reply received is matched with the last issued request\&.
+.sp
+If no services are available, then any send operation on the socket shall block until at least one \fIservice\fR becomes available\&. The REQ socket shall not discard messages\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&1.\ \&Summary of ZMQ_REQ characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_REP\fR, \fIZMQ_ROUTER\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Send, Receive, Send, Receive, \&...
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Round\-robin
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Last peer
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Block
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_REP\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_REP\fR is used by a \fIservice\fR to receive requests from and send replies to a \fIclient\fR\&. This socket type allows only an alternating sequence of \fIzmq_recv(request)\fR and subsequent \fIzmq_send(reply)\fR calls\&. Each request received is fair\-queued from among all \fIclients\fR, and each reply sent is routed to the \fIclient\fR that issued the last request\&. If the original requester does not exist any more the reply is silently discarded\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&2.\ \&Summary of ZMQ_REP characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_REQ\fR, \fIZMQ_DEALER\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Receive, Send, Receive, Send, \&...
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Last peer
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_DEALER\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_DEALER\fR is an advanced pattern used for extending request/reply sockets\&. Each message sent is round\-robined among all connected peers, and each message received is fair\-queued from all connected peers\&.
+.sp
+When a \fIZMQ_DEALER\fR socket enters the \fImute\fR state due to having reached the high water mark for all peers, or if there are no peers at all, then any \fBzmq_send\fR(3) operations on the socket shall block until the mute state ends or at least one peer becomes available for sending; messages are not discarded\&.
+.sp
+When a \fIZMQ_DEALER\fR socket is connected to a \fIZMQ_REP\fR socket each message sent must consist of an empty message part, the \fIdelimiter\fR, followed by one or more \fIbody parts\fR\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&3.\ \&Summary of ZMQ_DEALER characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_ROUTER\fR, \fIZMQ_REP\fR, \fIZMQ_DEALER\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Unrestricted
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Round\-robin
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Block
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_ROUTER\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_ROUTER\fR is an advanced socket type used for extending request/reply sockets\&. When receiving messages a \fIZMQ_ROUTER\fR socket shall prepend a message part containing the \fIidentity\fR of the originating peer to the message before passing it to the application\&. Messages received are fair\-queued from among all connected peers\&. When sending messages a \fIZMQ_ROUTER\fR socket shall remove the first part of the message and use it to determine the \fIidentity\fR of the peer the message shall be routed to\&. If the peer does not exist anymore the message shall be silently discarded by default, unless \fIZMQ_ROUTER_MANDATORY\fR socket option is set to \fI1\fR\&.
+.sp
+When a \fIZMQ_ROUTER\fR socket enters the \fImute\fR state due to having reached the high water mark for all peers, then any messages sent to the socket shall be dropped until the mute state ends\&. Likewise, any messages routed to a peer for which the individual high water mark has been reached shall also be dropped\&.
+.sp
+When a \fIZMQ_REQ\fR socket is connected to a \fIZMQ_ROUTER\fR socket, in addition to the \fIidentity\fR of the originating peer each message received shall contain an empty \fIdelimiter\fR message part\&. Hence, the entire structure of each received message as seen by the application becomes: one or more \fIidentity\fR parts, \fIdelimiter\fR part, one or more \fIbody parts\fR\&. When sending replies to a \fIZMQ_REQ\fR socket the application must include the \fIdelimiter\fR part\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&4.\ \&Summary of ZMQ_ROUTER characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_DEALER\fR, \fIZMQ_REQ\fR, \fIZMQ_ROUTER\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Unrestricted
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+See text
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Drop
+T}
+.TE
+.sp 1
+.RE
+.SS "Publish\-subscribe pattern"
+.sp
+The publish\-subscribe pattern is used for one\-to\-many distribution of data from a single \fIpublisher\fR to multiple \fIsubscribers\fR in a fan out fashion\&.
+.sp
+The publish\-subscribe pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:29\fR\m[]\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_PUB\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_PUB\fR is used by a \fIpublisher\fR to distribute data\&. Messages sent are distributed in a fan out fashion to all connected peers\&. The \fBzmq_recv\fR(3) function is not implemented for this socket type\&.
+.sp
+When a \fIZMQ_PUB\fR socket enters the \fImute\fR state due to having reached the high water mark for a \fIsubscriber\fR, then any messages that would be sent to the \fIsubscriber\fR in question shall instead be dropped until the mute state ends\&. The \fIzmq_send()\fR function shall never block for this socket type\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&5.\ \&Summary of ZMQ_PUB characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_SUB\fR, \fIZMQ_XSUB\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Send only
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Fan out
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Drop
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_SUB\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_SUB\fR is used by a \fIsubscriber\fR to subscribe to data distributed by a \fIpublisher\fR\&. Initially a \fIZMQ_SUB\fR socket is not subscribed to any messages, use the \fIZMQ_SUBSCRIBE\fR option of \fBzmq_setsockopt\fR(3) to specify which messages to subscribe to\&. The \fIzmq_send()\fR function is not implemented for this socket type\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&6.\ \&Summary of ZMQ_SUB characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_PUB\fR, \fIZMQ_XPUB\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Receive only
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+N/A
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_XPUB\fR
+.RS 4
+.sp
+Same as ZMQ_PUB except that you can receive subscriptions from the peers in form of incoming messages\&. Subscription message is a byte 1 (for subscriptions) or byte 0 (for unsubscriptions) followed by the subscription body\&. Messages without a sub/unsub prefix are also received, but have no effect on subscription status\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&7.\ \&Summary of ZMQ_XPUB characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_SUB\fR, \fIZMQ_XSUB\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Send messages, receive subscriptions
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Fan out
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Drop
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_XSUB\fR
+.RS 4
+.sp
+Same as ZMQ_SUB except that you subscribe by sending subscription messages to the socket\&. Subscription message is a byte 1 (for subscriptions) or byte 0 (for unsubscriptions) followed by the subscription body\&. Messages without a sub/unsub prefix may also be sent, but have no effect on subscription status\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&8.\ \&Summary of ZMQ_XSUB characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_PUB\fR, \fIZMQ_XPUB\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Receive messages, send subscriptions
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Drop
+T}
+.TE
+.sp 1
+.RE
+.SS "Pipeline pattern"
+.sp
+The pipeline pattern is used for distributing data to \fInodes\fR arranged in a pipeline\&. Data always flows down the pipeline, and each stage of the pipeline is connected to at least one \fInode\fR\&. When a pipeline stage is connected to multiple \fInodes\fR data is round\-robined among all connected \fInodes\fR\&.
+.sp
+The pipeline pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:30\fR\m[]\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_PUSH\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_PUSH\fR is used by a pipeline \fInode\fR to send messages to downstream pipeline \fInodes\fR\&. Messages are round\-robined to all connected downstream \fInodes\fR\&. The \fIzmq_recv()\fR function is not implemented for this socket type\&.
+.sp
+When a \fIZMQ_PUSH\fR socket enters the \fImute\fR state due to having reached the high water mark for all downstream \fInodes\fR, or if there are no downstream \fInodes\fR at all, then any \fBzmq_send\fR(3) operations on the socket shall block until the mute state ends or at least one downstream \fInode\fR becomes available for sending; messages are not discarded\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&9.\ \&Summary of ZMQ_PUSH characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_PULL\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Send only
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+Round\-robin
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Block
+T}
+.TE
+.sp 1
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_PULL\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_PULL\fR is used by a pipeline \fInode\fR to receive messages from upstream pipeline \fInodes\fR\&. Messages are fair\-queued from among all connected upstream \fInodes\fR\&. The \fIzmq_send()\fR function is not implemented for this socket type\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&10.\ \&Summary of ZMQ_PULL characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_PUSH\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Unidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Receive only
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Block
+T}
+.TE
+.sp 1
+.RE
+.SS "Exclusive pair pattern"
+.sp
+The exclusive pair pattern is used to connect a peer to precisely one other peer\&. This pattern is used for inter\-thread communication across the inproc transport\&.
+.sp
+The exclusive pair pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:31\fR\m[]\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_PAIR\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_PAIR\fR can only be connected to a single peer at any one time\&. No message routing or filtering is performed on messages sent over a \fIZMQ_PAIR\fR socket\&.
+.sp
+When a \fIZMQ_PAIR\fR socket enters the \fImute\fR state due to having reached the high water mark for the connected peer, or if no peer is connected, then any \fBzmq_send\fR(3) operations on the socket shall block until the peer becomes available for sending; messages are not discarded\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+\fIZMQ_PAIR\fR sockets are designed for inter\-thread communication across the \fBzmq_inproc\fR(7) transport and do not implement functionality such as auto\-reconnection\&. \fIZMQ_PAIR\fR sockets are considered experimental and may have other missing or broken aspects\&.
+.sp .5v
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&11.\ \&Summary of ZMQ_PAIR characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+\fIZMQ_PAIR\fR
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Unrestricted
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+N/A
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+Block
+T}
+.TE
+.sp 1
+.RE
+.SS "Native Pattern"
+.sp
+The native pattern is used for communicating with TCP peers and allows asynchronous requests and replies in either direction\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBZMQ_STREAM\fR
+.RS 4
+.sp
+A socket of type \fIZMQ_STREAM\fR is used to send and receive TCP data from a non\-0MQ peer, when using the tcp:// transport\&. A \fIZMQ_STREAM\fR socket can act as client and/or server, sending and/or receiving TCP data asynchronously\&.
+.sp
+When receiving TCP data, a \fIZMQ_STREAM\fR socket shall prepend a message part containing the \fIidentity\fR of the originating peer to the message before passing it to the application\&. Messages received are fair\-queued from among all connected peers\&.
+.sp
+When sending TCP data, a \fIZMQ_STREAM\fR socket shall remove the first part of the message and use it to determine the \fIidentity\fR of the peer the message shall be routed to, and unroutable messages shall cause an EHOSTUNREACH or EAGAIN error\&.
+.sp
+To open a connection to a server, use the zmq_connect call, and then fetch the socket identity using the ZMQ_IDENTITY zmq_getsockopt call\&.
+.sp
+To close a specific connection, send the identity frame followed by a zero\-length message (see EXAMPLE section)\&.
+.sp
+When a connection is made, a zero\-length message will be received by the application\&. Similarly, when the peer disconnects (or the connection is lost), a zero\-length message will be received by the application\&.
+.sp
+The ZMQ_SNDMORE flag is ignored on data frames\&. You must send one identity frame followed by one data frame\&.
+.sp
+Also, please note that omitting the ZMQ_SNDMORE flag will prevent sending further data (from any client) on the same socket\&.
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.B Table\ \&12.\ \&Summary of ZMQ_STREAM characteristics
+.TS
+tab(:);
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt
+lt lt.
+T{
+.sp
+Compatible peer sockets
+T}:T{
+.sp
+none\&.
+T}
+T{
+.sp
+Direction
+T}:T{
+.sp
+Bidirectional
+T}
+T{
+.sp
+Send/receive pattern
+T}:T{
+.sp
+Unrestricted
+T}
+T{
+.sp
+Outgoing routing strategy
+T}:T{
+.sp
+See text
+T}
+T{
+.sp
+Incoming routing strategy
+T}:T{
+.sp
+Fair\-queued
+T}
+T{
+.sp
+Action in mute state
+T}:T{
+.sp
+EAGAIN
+T}
+.TE
+.sp 1
+.RE
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_socket()\fR function shall return an opaque handle to the newly created socket if successful\&. Otherwise, it shall return NULL and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The requested socket
+\fItype\fR
+is invalid\&.
+.RE
+.PP
+\fBEFAULT\fR
+.RS 4
+The provided
+\fIcontext\fR
+is invalid\&.
+.RE
+.PP
+\fBEMFILE\fR
+.RS 4
+The limit on the total number of open 0MQ sockets has been reached\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The context specified was terminated\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBCreating a simple HTTP server using ZMQ_STREAM\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void *ctx = zmq_ctx_new ();
+assert (ctx);
+/* Create ZMQ_STREAM socket */
+void *socket = zmq_socket (ctx, ZMQ_STREAM);
+assert (socket);
+int rc = zmq_bind (socket, "tcp://*:8080");
+assert (rc == 0);
+/* Data structure to hold the ZMQ_STREAM ID */
+uint8_t id [256];
+size_t id_size = 256;
+/* Data structure to hold the ZMQ_STREAM received data */
+uint8_t raw [256];
+size_t raw_size = 256;
+while (1) {
+        /*  Get HTTP request; ID frame and then request */
+        id_size = zmq_recv (socket, id, 256, 0);
+        assert (id_size > 0);
+        do {
+                raw_size = zmq_recv (socket, raw, 256, 0);
+                assert (raw_size >= 0);
+        } while (raw_size == 256);
+        /* Prepares the response */
+        char http_response [] =
+                "HTTP/1\&.0 200 OK\er\en"
+                "Content\-Type: text/plain\er\en"
+                "\er\en"
+                "Hello, World!";
+        /* Sends the ID frame followed by the response */
+        zmq_send (socket, id, id_size, ZMQ_SNDMORE);
+        zmq_send (socket, http_response, strlen (http_response), ZMQ_SNDMORE);
+        /* Closes the connection by sending the ID frame followed by a zero response */
+        zmq_send (socket, id, id_size, ZMQ_SNDMORE);
+        zmq_send (socket, 0, 0, ZMQ_SNDMORE);
+        /* NOTE: If we don\*(Aqt use ZMQ_SNDMORE, then we won\*(Aqt be able to send more */
+        /* message to any client */
+}
+zmq_close (socket);
+zmq_ctx_destroy (ctx);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_init\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_socket_monitor.3 b/ps-lite/deps/share/man/man3/zmq_socket_monitor.3
new file mode 100644
index 00000000..29fcd82f
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_socket_monitor.3
@@ -0,0 +1,235 @@
+'\" t
+.\"     Title: zmq_socket_monitor
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_SOCKET_MONITOR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_socket_monitor \- monitor socket events
+.SH "SYNOPSIS"
+.sp
+\fBint zmq_socket_monitor (void \fR\fB\fI*socket\fR\fR\fB, char \fR\fB\fI*endpoint\fR\fR\fB, int \fR\fB\fIevents\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_socket_monitor()\fR method lets an application thread track socket events (like connects) on a ZeroMQ socket\&. Each call to this method creates a \fIZMQ_PAIR\fR socket and binds that to the specified inproc:// \fIendpoint\fR\&. To collect the socket events, you must create your own \fIZMQ_PAIR\fR socket, and connect that to the endpoint\&.
+.sp
+The \fIevents\fR argument is a bitmask of the socket events you wish to monitor, see \fISupported events\fR below\&. To monitor all events, use the event value ZMQ_EVENT_ALL\&.
+.sp
+Each event is sent as two frames\&. The first frame contains an event number (16 bits), and an event value (32 bits) that provides additional data according to the event number\&. The second frame contains a string that specifies the affected TCP or IPC endpoint\&.
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+The _zmq_socket_monitor()_ method supports only connection\-oriented
+transports, that is, TCP, IPC, and TIPC\&.
+.fi
+.if n \{\
+.RE
+.\}
+.SH "SUPPORTED EVENTS"
+.SS "ZMQ_EVENT_CONNECTED"
+.sp
+The socket has successfully connected to a remote peer\&. The event value is the file descriptor (FD) of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
+.SS "ZMQ_EVENT_CONNECT_DELAYED"
+.sp
+A connect request on the socket is pending\&. The event value is unspecified\&.
+.SS "ZMQ_EVENT_CONNECT_RETRIED"
+.sp
+A connect request failed, and is now being retried\&. The event value is the reconnect interval in milliseconds\&. Note that the reconnect interval is recalculated at each retry\&.
+.SS "ZMQ_EVENT_LISTENING"
+.sp
+The socket was successfully bound to a network interface\&. The event value is the FD of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
+.SS "ZMQ_EVENT_BIND_FAILED"
+.sp
+The socket could not bind to a given interface\&. The event value is the errno generated by the system bind call\&.
+.SS "ZMQ_EVENT_ACCEPTED"
+.sp
+The socket has accepted a connection from a remote peer\&. The event value is the FD of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
+.SS "ZMQ_EVENT_ACCEPT_FAILED"
+.sp
+The socket has rejected a connection from a remote peer\&. The event value is the errno generated by the accept call\&.
+.SS "ZMQ_EVENT_CLOSED"
+.sp
+The socket was closed\&. The event value is the FD of the (now closed) network socket\&.
+.SS "ZMQ_EVENT_CLOSE_FAILED"
+.sp
+The socket close failed\&. The event value is the errno returned by the system call\&. Note that this event occurs only on IPC transports\&.
+.SS "ZMQ_EVENT_DISCONNECTED"
+.sp
+The socket was disconnected unexpectedly\&. The event value is the FD of the underlying network socket\&. Warning: this socket will be closed\&.
+.SS "ZMQ_EVENT_MONITOR_STOPPED"
+.sp
+Monitoring on this socket ended\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_socket_monitor()\fR function returns a value of 0 or greater if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBEPROTONOSUPPORT\fR
+.RS 4
+The requested
+\fItransport\fR
+protocol is not supported\&. Monitor sockets are required to use the inproc:// transport\&.
+.RE
+.PP
+\fBEINVAL\fR
+.RS 4
+The endpoint supplied is invalid\&.
+.RE
+.SH "EXAMPLE"
+.PP
+\fBMonitoring client and server sockets\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Read one event off the monitor socket; return value and address
+//  by reference, if not null, and event number by value\&. Returns \-1
+//  in case of error\&.
+
+static int
+get_monitor_event (void *monitor, int *value, char **address)
+{
+    //  First frame in message contains event number and value
+    zmq_msg_t msg;
+    zmq_msg_init (&msg);
+    if (zmq_msg_recv (&msg, monitor, 0) == \-1)
+        return \-1;              //  Interruped, presumably
+    assert (zmq_msg_more (&msg));
+
+    uint8_t *data = (uint8_t *) zmq_msg_data (&msg);
+    uint16_t event = *(uint16_t *) (data);
+    if (value)
+        *value = *(uint32_t *) (data + 2);
+
+    //  Second frame in message contains event address
+    zmq_msg_init (&msg);
+    if (zmq_msg_recv (&msg, monitor, 0) == \-1)
+        return \-1;              //  Interruped, presumably
+    assert (!zmq_msg_more (&msg));
+
+    if (address) {
+        uint8_t *data = (uint8_t *) zmq_msg_data (&msg);
+        size_t size = zmq_msg_size (&msg);
+        *address = (char *) malloc (size + 1);
+        memcpy (*address, data, size);
+        *address [size] = 0;
+    }
+    return event;
+}
+
+int main (void)
+{
+    void *ctx = zmq_ctx_new ();
+    assert (ctx);
+
+    //  We\*(Aqll monitor these two sockets
+    void *client = zmq_socket (ctx, ZMQ_DEALER);
+    assert (client);
+    void *server = zmq_socket (ctx, ZMQ_DEALER);
+    assert (server);
+
+    //  Socket monitoring only works over inproc://
+    int rc = zmq_socket_monitor (client, "tcp://127\&.0\&.0\&.1:9999", 0);
+    assert (rc == \-1);
+    assert (zmq_errno () == EPROTONOSUPPORT);
+
+    //  Monitor all events on client and server sockets
+    rc = zmq_socket_monitor (client, "inproc://monitor\-client", ZMQ_EVENT_ALL);
+    assert (rc == 0);
+    rc = zmq_socket_monitor (server, "inproc://monitor\-server", ZMQ_EVENT_ALL);
+    assert (rc == 0);
+
+    //  Create two sockets for collecting monitor events
+    void *client_mon = zmq_socket (ctx, ZMQ_PAIR);
+    assert (client_mon);
+    void *server_mon = zmq_socket (ctx, ZMQ_PAIR);
+    assert (server_mon);
+
+    //  Connect these to the inproc endpoints so they\*(Aqll get events
+    rc = zmq_connect (client_mon, "inproc://monitor\-client");
+    assert (rc == 0);
+    rc = zmq_connect (server_mon, "inproc://monitor\-server");
+    assert (rc == 0);
+
+    //  Now do a basic ping test
+    rc = zmq_bind (server, "tcp://127\&.0\&.0\&.1:9998");
+    assert (rc == 0);
+    rc = zmq_connect (client, "tcp://127\&.0\&.0\&.1:9998");
+    assert (rc == 0);
+    bounce (client, server);
+
+    //  Close client and server
+    close_zero_linger (client);
+    close_zero_linger (server);
+
+    //  Now collect and check events from both sockets
+    int event = get_monitor_event (client_mon, NULL, NULL);
+    if (event == ZMQ_EVENT_CONNECT_DELAYED)
+        event = get_monitor_event (client_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_CONNECTED);
+    event = get_monitor_event (client_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_MONITOR_STOPPED);
+
+    //  This is the flow of server events
+    event = get_monitor_event (server_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_LISTENING);
+    event = get_monitor_event (server_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_ACCEPTED);
+    event = get_monitor_event (server_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_CLOSED);
+    event = get_monitor_event (server_mon, NULL, NULL);
+    assert (event == ZMQ_EVENT_MONITOR_STOPPED);
+
+    //  Close down the sockets
+    close_zero_linger (client_mon);
+    close_zero_linger (server_mon);
+    zmq_ctx_term (ctx);
+
+    return 0 ;
+}
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_strerror.3 b/ps-lite/deps/share/man/man3/zmq_strerror.3
new file mode 100644
index 00000000..c3065acf
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_strerror.3
@@ -0,0 +1,67 @@
+'\" t
+.\"     Title: zmq_strerror
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_STRERROR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_strerror \- get 0MQ error message string
+.SH "SYNOPSIS"
+.sp
+\fBconst char *zmq_strerror (int \fR\fB\fIerrnum\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_strerror()\fR function shall return a pointer to an error message string corresponding to the error number specified by the \fIerrnum\fR argument\&. As 0MQ defines additional error numbers over and above those defined by the operating system, applications should use \fIzmq_strerror()\fR in preference to the standard \fIstrerror()\fR function\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_strerror()\fR function shall return a pointer to an error message string\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "EXAMPLE"
+.PP
+\fBDisplaying an error message when a 0MQ context cannot be initialised\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+void *ctx = zmq_init (1, 1, 0);
+if (!ctx) {
+    printf ("Error occurred during zmq_init(): %s\en", zmq_strerror (errno));
+    abort ();
+}
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_unbind.3 b/ps-lite/deps/share/man/man3/zmq_unbind.3
new file mode 100644
index 00000000..f6c866d1
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_unbind.3
@@ -0,0 +1,120 @@
+'\" t
+.\"     Title: zmq_unbind
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_UNBIND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_unbind \- Stop accepting connections on a socket
+.SH "SYNOPSIS"
+.sp
+int zmq_unbind (void \fI*socket\fR, const char \fI*endpoint\fR);
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_unbind()\fR function shall unbind a socket specified by the \fIsocket\fR argument from the endpoint specified by the \fIendpoint\fR argument\&.
+.sp
+The \fIendpoint\fR argument is as described in \fBzmq_bind\fR(3)
+.SS "Unbinding wild\-card addres from a socket"
+.sp
+When wild\-card * \fIendpoint\fR (described in \fBzmq_tcp\fR(7) and \fBzmq_ipc\fR(7)) was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_unbind()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
+.SH "ERRORS"
+.PP
+\fBEINVAL\fR
+.RS 4
+The endpoint supplied is invalid\&.
+.RE
+.PP
+\fBETERM\fR
+.RS 4
+The 0MQ
+\fIcontext\fR
+associated with the specified
+\fIsocket\fR
+was terminated\&.
+.RE
+.PP
+\fBENOTSOCK\fR
+.RS 4
+The provided
+\fIsocket\fR
+was invalid\&.
+.RE
+.SH "EXAMPLES"
+.PP
+\fBUnbind a subscriber socket from a TCP transport\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a ZMQ_SUB socket */
+void *socket = zmq_socket (context, ZMQ_SUB);
+assert (socket);
+/* Connect it to the host server001, port 5555 using a TCP transport */
+rc = zmq_bind (socket, "tcp://127\&.0\&.0\&.1:5555");
+assert (rc == 0);
+/* Disconnect from the previously connected endpoint */
+rc = zmq_unbind (socket, "tcp://127\&.0\&.0\&.1:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBUnbind wild-card * binded socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+/* Create a ZMQ_SUB socket */
+void *socket = zmq_socket (context, ZMQ_SUB);
+assert (socket);
+/* Bind it to the system\-assigned ephemeral port using a TCP transport */
+rc = zmq_bind (socket, "tcp://127\&.0\&.0\&.1:*");
+assert (rc == 0);
+/* Obtain real endpoint */
+const size_t buf_size = 32;
+char buf[buf_size];
+rc = zmq_getsockopt (socket, ZMQ_LAST_ENDPOINT, buf, (size_t *)&buf_size);
+assert (rc == 0);
+/* Unbind socket by real endpoint */
+rc = zmq_unbind (socket, buf);
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_version.3 b/ps-lite/deps/share/man/man3/zmq_version.3
new file mode 100644
index 00000000..3a1ad9dc
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_version.3
@@ -0,0 +1,67 @@
+'\" t
+.\"     Title: zmq_version
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_VERSION" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_version \- report 0MQ library version
+.SH "SYNOPSIS"
+.sp
+\fBvoid zmq_version (int \fR\fB\fI*major\fR\fR\fB, int \fR\fB\fI*minor\fR\fR\fB, int \fR\fB\fI*patch\fR\fR\fB);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_version()\fR function shall fill in the integer variables pointed to by the \fImajor\fR, \fIminor\fR and \fIpatch\fR arguments with the major, minor and patch level components of the 0MQ library version\&.
+.sp
+This functionality is intended for applications or language bindings dynamically linking to the 0MQ library that wish to determine the actual version of the 0MQ library they are using\&.
+.SH "RETURN VALUE"
+.sp
+There is no return value\&.
+.SH "ERRORS"
+.sp
+No errors are defined\&.
+.SH "EXAMPLE"
+.PP
+\fBPrinting out the version of the 0MQ library\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+int major, minor, patch;
+zmq_version (&major, &minor, &patch);
+printf ("Current 0MQ version is %d\&.%d\&.%d\en", major, minor, patch);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_z85_decode.3 b/ps-lite/deps/share/man/man3/zmq_z85_decode.3
new file mode 100644
index 00000000..a891ca21
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_z85_decode.3
@@ -0,0 +1,64 @@
+'\" t
+.\"     Title: zmq_z85_decode
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_Z85_DECODE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_z85_decode \- decode a binary key from Z85 printable text
+.SH "SYNOPSIS"
+.sp
+\fBuint8_t *zmq_z85_decode (uint8_t *dest, const char *string);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_z85_decode()\fR function shall decode \fIstring\fR into \fIdest\fR\&. The length of \fIstring\fR shall be divisible by 5\&. \fIdest\fR must be large enough for the decoded value (0\&.8 x strlen (string))\&.
+.sp
+The encoding shall follow the ZMQ RFC 32 specification\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_z85_decode()\fR function shall return \fIdest\fR if successful, else it shall return NULL\&.
+.SH "EXAMPLE"
+.PP
+\fBDecoding a CURVE key\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+const char decoded [] = "rq:rM>}U?@Lns47E1%kR\&.o@n%FcmmsL/@{H8]yf7";
+uint8_t public_key [32];
+zmq_z85_decode (public_key, decoded);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_z85_decode\fR(3) \fBzmq_curve_keypair\fR(3) \fBzmq_curve\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_z85_encode.3 b/ps-lite/deps/share/man/man3/zmq_z85_encode.3
new file mode 100644
index 00000000..2e0cac6b
--- /dev/null
+++ b/ps-lite/deps/share/man/man3/zmq_z85_encode.3
@@ -0,0 +1,69 @@
+'\" t
+.\"     Title: zmq_z85_encode
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_Z85_ENCODE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_z85_encode \- encode a binary key as Z85 printable text
+.SH "SYNOPSIS"
+.sp
+\fBchar *zmq_z85_encode (char *dest, const uint8_t *data, size_t size);\fR
+.SH "DESCRIPTION"
+.sp
+The \fIzmq_z85_encode()\fR function shall encode the binary block specified by \fIdata\fR and \fIsize\fR into a string in \fIdest\fR\&. The size of the binary block must be divisible by 4\&. The \fIdest\fR must have sufficient space for size * 1\&.25 plus 1 for a null terminator\&. A 32\-byte CURVE key is encoded as 40 ASCII characters plus a null terminator\&.
+.sp
+The encoding shall follow the ZMQ RFC 32 specification\&.
+.SH "RETURN VALUE"
+.sp
+The \fIzmq_z85_encode()\fR function shall return \fIdest\fR if successful, else it shall return NULL\&.
+.SH "EXAMPLE"
+.PP
+\fBEncoding a CURVE key\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+#include <sodium\&.h>
+uint8_t public_key [32];
+uint8_t secret_key [32];
+int rc = crypto_box_keypair (public_key, secret_key);
+assert (rc == 0);
+char encoded [41];
+zmq_z85_encode (encoded, public_key, 32);
+puts (encoded);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_z85_decode\fR(3) \fBzmq_curve_keypair\fR(3) \fBzmq_curve\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq.7 b/ps-lite/deps/share/man/man7/zmq.7
new file mode 100644
index 00000000..5d9a5c89
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq.7
@@ -0,0 +1,246 @@
+'\" t
+.\"     Title: zmq
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq \- 0MQ lightweight messaging kernel
+.SH "SYNOPSIS"
+.sp
+\fB#include <zmq\&.h>\fR
+.sp
+\fBcc\fR [\fIflags\fR] \fIfiles\fR \fB\-lzmq\fR [\fIlibraries\fR]
+.SH "DESCRIPTION"
+.sp
+The 0MQ lightweight messaging kernel is a library which extends the standard socket interfaces with features traditionally provided by specialised \fImessaging middleware\fR products\&. 0MQ sockets provide an abstraction of asynchronous \fImessage queues\fR, multiple \fImessaging patterns\fR, message filtering (\fIsubscriptions\fR), seamless access to multiple \fItransport protocols\fR and more\&.
+.sp
+This documentation presents an overview of 0MQ concepts, describes how 0MQ abstracts standard sockets and provides a reference manual for the functions provided by the 0MQ library\&.
+.SS "Context"
+.sp
+Before using any 0MQ library functions you must create a 0MQ \fIcontext\fR\&. When you exit your application you must destroy the \fIcontext\fR\&. These functions let you work with \fIcontexts\fR:
+.PP
+Create a new 0MQ context
+.RS 4
+\fBzmq_ctx_new\fR(3)
+.RE
+.PP
+Work with context properties
+.RS 4
+\fBzmq_ctx_set\fR(3)\fBzmq_ctx_get\fR(3)
+.RE
+.PP
+Destroy a 0MQ context
+.RS 4
+\fBzmq_ctx_shutdown\fR(3)\fBzmq_ctx_term\fR(3)
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBThread safety\fR
+.RS 4
+.sp
+A 0MQ \fIcontext\fR is thread safe and may be shared among as many application threads as necessary, without any additional locking required on the part of the caller\&.
+.sp
+Individual 0MQ \fIsockets\fR are \fInot\fR thread safe except in the case where full memory barriers are issued when migrating a socket from one thread to another\&. In practice this means applications can create a socket in one thread with \fIzmq_socket()\fR and then pass it to a \fInewly created\fR thread as part of thread initialization, for example via a structure passed as an argument to \fIpthread_create()\fR\&.
+.RE
+.sp
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBMultiple contexts\fR
+.RS 4
+.sp
+Multiple \fIcontexts\fR may coexist within a single application\&. Thus, an application can use 0MQ directly and at the same time make use of any number of additional libraries or components which themselves make use of 0MQ as long as the above guidelines regarding thread safety are adhered to\&.
+.RE
+.SS "Messages"
+.sp
+A 0MQ message is a discrete unit of data passed between applications or components of the same application\&. 0MQ messages have no internal structure and from the point of view of 0MQ itself they are considered to be opaque binary data\&.
+.sp
+The following functions are provided to work with messages:
+.PP
+Initialise a message
+.RS 4
+\fBzmq_msg_init\fR(3)\fBzmq_msg_init_size\fR(3)\fBzmq_msg_init_data\fR(3)
+.RE
+.PP
+Sending and receiving a message
+.RS 4
+\fBzmq_msg_send\fR(3)\fBzmq_msg_recv\fR(3)
+.RE
+.PP
+Release a message
+.RS 4
+\fBzmq_msg_close\fR(3)
+.RE
+.PP
+Access message content
+.RS 4
+\fBzmq_msg_data\fR(3)\fBzmq_msg_size\fR(3)\fBzmq_msg_more\fR(3)
+.RE
+.PP
+Work with message properties
+.RS 4
+\fBzmq_msg_gets\fR(3)\fBzmq_msg_get\fR(3)\fBzmq_msg_set\fR(3)
+.RE
+.PP
+Message manipulation
+.RS 4
+\fBzmq_msg_copy\fR(3)\fBzmq_msg_move\fR(3)
+.RE
+.SS "Sockets"
+.sp
+0MQ sockets present an abstraction of a asynchronous \fImessage queue\fR, with the exact queueing semantics depending on the socket type in use\&. See \fBzmq_socket\fR(3) for the socket types provided\&.
+.sp
+The following functions are provided to work with sockets:
+.PP
+Creating a socket
+.RS 4
+\fBzmq_socket\fR(3)
+.RE
+.PP
+Closing a socket
+.RS 4
+\fBzmq_close\fR(3)
+.RE
+.PP
+Manipulating socket options
+.RS 4
+\fBzmq_getsockopt\fR(3)\fBzmq_setsockopt\fR(3)
+.RE
+.PP
+Establishing a message flow
+.RS 4
+\fBzmq_bind\fR(3)\fBzmq_connect\fR(3)
+.RE
+.PP
+Sending and receiving messages
+.RS 4
+\fBzmq_msg_send\fR(3)\fBzmq_msg_recv\fR(3)\fBzmq_send\fR(3)\fBzmq_recv\fR(3)\fBzmq_send_const\fR(3)
+.RE
+.sp
+Monitoring socket events: \fBzmq_socket_monitor\fR(3)
+.PP
+\fBInput/output multiplexing\fR. 0MQ provides a mechanism for applications to multiplex input/output events over a set containing both 0MQ sockets and standard sockets\&. This mechanism mirrors the standard
+\fIpoll()\fR
+system call, and is described in detail in
+\fBzmq_poll\fR(3)\&.
+.SS "Transports"
+.sp
+A 0MQ socket can use multiple different underlying transport mechanisms\&. Each transport mechanism is suited to a particular purpose and has its own advantages and drawbacks\&.
+.sp
+The following transport mechanisms are provided:
+.PP
+Unicast transport using TCP
+.RS 4
+\fBzmq_tcp\fR(7)
+.RE
+.PP
+Reliable multicast transport using PGM
+.RS 4
+\fBzmq_pgm\fR(7)
+.RE
+.PP
+Local inter\-process communication transport
+.RS 4
+\fBzmq_ipc\fR(7)
+.RE
+.PP
+Local in\-process (inter\-thread) communication transport
+.RS 4
+\fBzmq_inproc\fR(7)
+.RE
+.SS "Proxies"
+.sp
+0MQ provides \fIproxies\fR to create fanout and fan\-in topologies\&. A proxy connects a \fIfrontend\fR socket to a \fIbackend\fR socket and switches all messages between the two sockets, opaquely\&. A proxy may optionally capture all traffic to a third socket\&. To start a proxy in an application thread, use \fBzmq_proxy\fR(3)\&.
+.SS "Security"
+.sp
+A 0MQ socket can select a security mechanism\&. Both peers must use the same security mechanism\&.
+.sp
+The following security mechanisms are provided for IPC and TCP connections:
+.PP
+Null security
+.RS 4
+\fBzmq_null\fR(7)
+.RE
+.PP
+Plain\-text authentication using username and password
+.RS 4
+\fBzmq_plain\fR(7)
+.RE
+.PP
+Elliptic curve authentication and encryption
+.RS 4
+\fBzmq_curve\fR(7)
+.RE
+.sp
+Generate a CURVE keypair in armored text format: \fBzmq_curve_keypair\fR(3)
+.sp
+Convert an armored key into a 32\-byte binary key: \fBzmq_z85_decode\fR(3)
+.sp
+Convert a 32\-byte binary CURVE key to an armored text string: \fBzmq_z85_encode\fR(3)
+.SH "ERROR HANDLING"
+.sp
+The 0MQ library functions handle errors using the standard conventions found on POSIX systems\&. Generally, this means that upon failure a 0MQ library function shall return either a NULL value (if returning a pointer) or a negative value (if returning an integer), and the actual error code shall be stored in the \fIerrno\fR variable\&.
+.sp
+On non\-POSIX systems some users may experience issues with retrieving the correct value of the \fIerrno\fR variable\&. The \fIzmq_errno()\fR function is provided to assist in these cases; for details refer to \fBzmq_errno\fR(3)\&.
+.sp
+The \fIzmq_strerror()\fR function is provided to translate 0MQ\-specific error codes into error message strings; for details refer to \fBzmq_strerror\fR(3)\&.
+.SH "MISCELLANEOUS"
+.sp
+The following miscellaneous functions are provided:
+.PP
+Report 0MQ library version
+.RS 4
+\fBzmq_version\fR(3)
+.RE
+.SH "LANGUAGE BINDINGS"
+.sp
+The 0MQ library provides interfaces suitable for calling from programs in any language; this documentation documents those interfaces as they would be used by C programmers\&. The intent is that programmers using 0MQ from other languages shall refer to this documentation alongside any documentation provided by the vendor of their language binding\&.
+.sp
+Language bindings (C++, Python, PHP, Ruby, Java and more) are provided by members of the 0MQ community and pointers can be found on the 0MQ website\&.
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
+.SH "RESOURCES"
+.sp
+Main web site: \m[blue]\fBhttp://www\&.zeromq\&.org/\fR\m[]
+.sp
+Report bugs to the 0MQ development mailing list: <\m[blue]\fBzeromq\-dev@lists\&.zeromq\&.org\fR\m[]\&\s-2\u[1]\d\s+2>
+.SH "COPYING"
+.sp
+Free use of this software is granted under the terms of the GNU Lesser General Public License (LGPL)\&. For details see the files COPYING and COPYING\&.LESSER included with the 0MQ distribution\&.
+.SH "NOTES"
+.IP " 1." 4
+zeromq-dev@lists.zeromq.org
+.RS 4
+\%mailto:zeromq-dev@lists.zeromq.org
+.RE
diff --git a/ps-lite/deps/share/man/man7/zmq_curve.7 b/ps-lite/deps/share/man/man7/zmq_curve.7
new file mode 100644
index 00000000..86af9fc1
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_curve.7
@@ -0,0 +1,93 @@
+'\" t
+.\"     Title: zmq_curve
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_CURVE" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_curve \- secure authentication and confidentiality
+.SH "SYNOPSIS"
+.sp
+The CURVE mechanism defines a mechanism for secure authentication and confidentiality for communications between a client and a server\&. CURVE is intended for use on public networks\&. The CURVE mechanism is defined by this document: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:25\fR\m[]\&.
+.SH "CLIENT AND SERVER ROLES"
+.sp
+A socket using CURVE can be either client or server, at any moment, but not both\&. The role is independent of bind/connect direction\&.
+.sp
+A socket can change roles at any point by setting new options\&. The role affects all zmq_connect and zmq_bind calls that follow it\&.
+.sp
+To become a CURVE server, the application sets the ZMQ_CURVE_SERVER option on the socket, and then sets the ZMQ_CURVE_SECRETKEY option to provide the socket with its long\-term secret key\&. The application does not provide the socket with its long\-term public key, which is used only by clients\&.
+.sp
+To become a CURVE client, the application sets the ZMQ_CURVE_SERVERKEY option with the long\-term public key of the server it intends to connect to, or accept connections from, next\&. The application then sets the ZMQ_CURVE_PUBLICKEY and ZMQ_CURVE_SECRETKEY options with its client long\-term key pair\&.
+.sp
+If the server does authentication it will be based on the client\(cqs long term public key\&.
+.SH "KEY ENCODING"
+.sp
+The standard representation for keys in source code is either 32 bytes of base 256 (binary) data, or 40 characters of base 85 data encoded using the Z85 algorithm defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:32\fR\m[]\&.
+.sp
+The Z85 algorithm is designed to produce printable key strings for use in configuration files, the command line, and code\&. There is a reference implementation in C at \m[blue]\fBhttps://github\&.com/zeromq/rfc/tree/master/src\fR\m[]\&.
+.SH "TEST KEY VALUES"
+.sp
+For test cases, the client shall use this long\-term key pair (specified as hexadecimal and in Z85):
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+public:
+    BB88471D65E2659B30C55A5321CEBB5AAB2B70A398645C26DCA2B2FCB43FC518
+    Yne@$w\-vo<fVvi]a<NY6T1ed:M$fCG*[IaLV{hID
+
+secret:
+    7BB864B489AFA3671FBE69101F94B38972F24816DFB01B51656B3FEC8DFD0888
+    D:)Q[IlAW!ahhC2ac:9*A}h:p?([4%wOTJ%JR%cs
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+And the server shall use this long\-term key pair (specified as hexadecimal and in Z85):
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+public:
+    54FCBA24E93249969316FB617C872BB0C1D1FF14800427C594CBFACF1BC2D652
+    rq:rM>}U?@Lns47E1%kR\&.o@n%FcmmsL/@{H8]yf7
+
+secret:
+    8E0BDD697628B91D8F245587EE95C5B04D48963F79259877B49CD9063AEAD3B7
+    JTKVSB%%)wK0E\&.X)V>+}o?pNmC{O&4W4b!Ni{Lh6
+.fi
+.if n \{\
+.RE
+.\}
+.SH "SEE ALSO"
+.sp
+\fBzmq_z85_encode\fR(3) \fBzmq_z85_decode\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_null\fR(7) \fBzmq_plain\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_inproc.7 b/ps-lite/deps/share/man/man7/zmq_inproc.7
new file mode 100644
index 00000000..19035e01
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_inproc.7
@@ -0,0 +1,103 @@
+'\" t
+.\"     Title: zmq_inproc
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_INPROC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_inproc \- 0MQ local in\-process (inter\-thread) communication transport
+.SH "SYNOPSIS"
+.sp
+The in\-process transport passes messages via memory directly between threads sharing a single 0MQ \fIcontext\fR\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+No I/O threads are involved in passing messages using the \fIinproc\fR transport\&. Therefore, if you are using a 0MQ \fIcontext\fR for in\-process messaging only you can initialise the \fIcontext\fR with zero I/O threads\&. See \fBzmq_init\fR(3) for details\&.
+.sp .5v
+.RE
+.SH "ADDRESSING"
+.sp
+A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+For the in\-process transport, the transport is inproc, and the meaning of the \fIaddress\fR part is defined below\&.
+.SS "Assigning a local address to a socket"
+.sp
+When assigning a local address to a \fIsocket\fR using \fIzmq_bind()\fR with the \fIinproc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIname\fR to create\&. The \fIname\fR must be unique within the 0MQ \fIcontext\fR associated with the \fIsocket\fR and may be up to 256 characters in length\&. No other restrictions are placed on the format of the \fIname\fR\&.
+.SS "Connecting a socket"
+.sp
+When connecting a \fIsocket\fR to a peer address using \fIzmq_connect()\fR with the \fIinproc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIname\fR to connect to\&. The \fIname\fR must have been previously created by assigning it to at least one \fIsocket\fR within the same 0MQ \fIcontext\fR as the \fIsocket\fR being connected\&.
+.SH "EXAMPLES"
+.PP
+\fBAssigning a local address to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Assign the in\-process name "#1"
+rc = zmq_bind(socket, "inproc://#1");
+assert (rc == 0);
+//  Assign the in\-process name "my\-endpoint"
+rc = zmq_bind(socket, "inproc://my\-endpoint");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBConnecting a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Connect to the in\-process name "#1"
+rc = zmq_connect(socket, "inproc://#1");
+assert (rc == 0);
+//  Connect to the in\-process name "my\-endpoint"
+rc = zmq_connect(socket, "inproc://my\-endpoint");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_ipc\fR(7) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_ipc.7 b/ps-lite/deps/share/man/man7/zmq_ipc.7
new file mode 100644
index 00000000..9cbc2aee
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_ipc.7
@@ -0,0 +1,166 @@
+'\" t
+.\"     Title: zmq_ipc
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_IPC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_ipc \- 0MQ local inter\-process communication transport
+.SH "SYNOPSIS"
+.sp
+The inter\-process transport passes messages between local processes using a system\-dependent IPC mechanism\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+The inter\-process transport is currently only implemented on operating systems that provide UNIX domain sockets\&.
+.sp .5v
+.RE
+.SH "ADDRESSING"
+.sp
+A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+For the inter\-process transport, the transport is ipc, and the meaning of the \fIaddress\fR part is defined below\&.
+.SS "Binding a socket"
+.sp
+When binding a \fIsocket\fR to a local address using \fIzmq_bind()\fR with the \fIipc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIpathname\fR to create\&. The \fIpathname\fR must be unique within the operating system namespace used by the \fIipc\fR implementation, and must fulfill any restrictions placed by the operating system on the format and length of a \fIpathname\fR\&.
+.sp
+When the address is *, \fIzmq_bind()\fR shall generate a unique temporary pathname\&. The caller should retrieve this pathname using the ZMQ_LAST_ENDPOINT socket option\&. See \fBzmq_getsockopt\fR(3) for details\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+any existing binding to the same endpoint shall be overridden\&. That is, if a second process binds to an endpoint already bound by a process, this will succeed and the first process will lose its binding\&. In this behavior, the \fIipc\fR transport is not consistent with the \fItcp\fR or \fIinproc\fR transports\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+the endpoint pathname must be writable by the process\&. When the endpoint starts with \fI/\fR, e\&.g\&., ipc:///pathname, this will be an \fIabsolute\fR pathname\&. If the endpoint specifies a directory that does not exist, the bind shall fail\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+on Linux only, when the endpoint pathname starts with @, the abstract namespace shall be used\&. The abstract namespace is independent of the filesystem and if a process attempts to bind an endpoint already bound by a process, it will fail\&. See unix(7) for details\&.
+.sp .5v
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+IPC pathnames have a maximum size that depends on the operating system\&. On Linux, the maximum is 113 characters including the "ipc://" prefix (107 characters for the real path name)\&.
+.sp .5v
+.RE
+.SS "Unbinding wild\-card address from a socket"
+.sp
+When wild\-card * \fIendpoint\fR was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket using \fIzmq_unbind()\fR\&.
+.SS "Connecting a socket"
+.sp
+When connecting a \fIsocket\fR to a peer address using \fIzmq_connect()\fR with the \fIipc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIpathname\fR to connect to\&. The \fIpathname\fR must have been previously created within the operating system namespace by assigning it to a \fIsocket\fR with \fIzmq_bind()\fR\&.
+.SH "EXAMPLES"
+.PP
+\fBAssigning a local address to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Assign the pathname "/tmp/feeds/0"
+rc = zmq_bind(socket, "ipc:///tmp/feeds/0");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBConnecting a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Connect to the pathname "/tmp/feeds/0"
+rc = zmq_connect(socket, "ipc:///tmp/feeds/0");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_inproc\fR(7) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq_getsockopt\fR(3) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_null.7 b/ps-lite/deps/share/man/man7/zmq_null.7
new file mode 100644
index 00000000..b69b6372
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_null.7
@@ -0,0 +1,40 @@
+'\" t
+.\"     Title: zmq_null
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_NULL" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_null \- no security or confidentiality
+.SH "SYNOPSIS"
+.sp
+The NULL mechanism is defined by the ZMTP 3\&.0 specification: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:23\fR\m[]\&. This is the default security mechanism for ZeroMQ sockets\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq_plain\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_pgm.7 b/ps-lite/deps/share/man/man7/zmq_pgm.7
new file mode 100644
index 00000000..40e6d523
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_pgm.7
@@ -0,0 +1,200 @@
+'\" t
+.\"     Title: zmq_pgm
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_PGM" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_pgm \- 0MQ reliable multicast transport using PGM
+.SH "SYNOPSIS"
+.sp
+PGM (Pragmatic General Multicast) is a protocol for reliable multicast transport of data over IP networks\&.
+.SH "DESCRIPTION"
+.sp
+0MQ implements two variants of PGM, the standard protocol where PGM datagrams are layered directly on top of IP datagrams as defined by RFC 3208 (the \fIpgm\fR transport) and "Encapsulated PGM" or EPGM where PGM datagrams are encapsulated inside UDP datagrams (the \fIepgm\fR transport)\&.
+.sp
+The \fIpgm\fR and \fIepgm\fR transports can only be used with the \fIZMQ_PUB\fR and \fIZMQ_SUB\fR socket types\&.
+.sp
+Further, PGM sockets are rate limited by default\&. For details, refer to the \fIZMQ_RATE\fR, and \fIZMQ_RECOVERY_IVL\fR options documented in \fBzmq_setsockopt\fR(3)\&.
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBCaution\fR
+.ps -1
+.br
+.sp
+The \fIpgm\fR transport implementation requires access to raw IP sockets\&. Additional privileges may be required on some operating systems for this operation\&. Applications not requiring direct interoperability with other PGM implementations are encouraged to use the \fIepgm\fR transport instead which does not require any special privileges\&.
+.sp .5v
+.RE
+.SH "ADDRESSING"
+.sp
+A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+For the PGM transport, the transport is pgm, and for the EPGM protocol the transport is epgm\&. The meaning of the \fIaddress\fR part is defined below\&.
+.SS "Connecting a socket"
+.sp
+When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fIpgm\fR or \fIepgm\fR transport, the \fIendpoint\fR shall be interpreted as an \fIinterface\fR followed by a semicolon, followed by a \fImulticast address\fR, followed by a colon and a port number\&.
+.sp
+An \fIinterface\fR may be specified by either of the following:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The interface name as defined by the operating system\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The primary IPv4 address assigned to the interface, in its numeric representation\&.
+.RE
+.if n \{\
+.sp
+.\}
+.RS 4
+.it 1 an-trap
+.nr an-no-space-flag 1
+.nr an-break-flag 1
+.br
+.ps +1
+\fBNote\fR
+.ps -1
+.br
+.sp
+Interface names are not standardised in any way and should be assumed to be arbitrary and platform dependent\&. On Win32 platforms no short interface names exist, thus only the primary IPv4 address may be used to specify an \fIinterface\fR\&. The \fIinterface\fR part can be omitted, in that case the default one will be selected\&.
+.sp .5v
+.RE
+.sp
+A \fImulticast address\fR is specified by an IPv4 multicast address in its numeric representation\&.
+.SH "WIRE FORMAT"
+.sp
+Consecutive PGM datagrams are interpreted by 0MQ as a single continuous stream of data where 0MQ messages are not necessarily aligned with PGM datagram boundaries and a single 0MQ message may span several PGM datagrams\&. This stream of data consists of 0MQ messages encapsulated in \fIframes\fR as described in \fBzmq_tcp\fR(7)\&.
+.SS "PGM datagram payload"
+.sp
+The following ABNF grammar represents the payload of a single PGM datagram as used by 0MQ:
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+datagram               = (offset data)
+offset                 = 2OCTET
+data                   = *OCTET
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+In order for late joining consumers to be able to identify message boundaries, each PGM datagram payload starts with a 16\-bit unsigned integer in network byte order specifying either the offset of the first message \fIframe\fR in the datagram or containing the value 0xFFFF if the datagram contains solely an intermediate part of a larger message\&.
+.sp
+Note that offset specifies where the first message begins rather than the first message part\&. Thus, if there are trailing message parts at the beginning of the packet the offset ignores them and points to first initial message part in the packet\&.
+.sp
+The following diagram illustrates the layout of a single PGM datagram payload:
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+| offset (16 bits) |         data         |
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+The following diagram further illustrates how three example 0MQ frames are laid out in consecutive PGM datagram payloads:
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+First datagram payload
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+| Frame offset |   Frame 1   |   Frame 2, part 1   |
+|    0x0000    | (Message 1) | (Message 2, part 1) |
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+
+Second datagram payload
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+| Frame offset |   Frame 2, part 2   |
+| 0xFFFF       | (Message 2, part 2) |
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
+
+Third datagram payload
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+
+| Frame offset |   Frame 2, final 8 bytes   |   Frame 3   |
+| 0x0008       | (Message 2, final 8 bytes) | (Message 3) |
++\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+
+.fi
+.if n \{\
+.RE
+.\}
+.SH "EXAMPLE"
+.PP
+\fBConnecting a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Connecting to the multicast address 239\&.192\&.1\&.1, port 5555,
+//  using the first Ethernet network interface on Linux
+//  and the Encapsulated PGM protocol
+rc = zmq_connect(socket, "epgm://eth0;239\&.192\&.1\&.1:5555");
+assert (rc == 0);
+//  Connecting to the multicast address 239\&.192\&.1\&.1, port 5555,
+//  using the network interface with the address 192\&.168\&.1\&.1
+//  and the standard PGM protocol
+rc = zmq_connect(socket, "pgm://192\&.168\&.1\&.1;239\&.192\&.1\&.1:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_connect\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_tcp\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_plain.7 b/ps-lite/deps/share/man/man7/zmq_plain.7
new file mode 100644
index 00000000..e5bfa7b4
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_plain.7
@@ -0,0 +1,43 @@
+'\" t
+.\"     Title: zmq_plain
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_PLAIN" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_plain \- clear\-text authentication
+.SH "SYNOPSIS"
+.sp
+The PLAIN mechanism defines a simple username/password mechanism that lets a server authenticate a client\&. PLAIN makes no attempt at security or confidentiality\&. It is intended for use on internal networks where security requirements are low\&. The PLAIN mechanism is defined by this document: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:24\fR\m[]\&.
+.SH "USAGE"
+.sp
+To use PLAIN, the server shall set the ZMQ_PLAIN_SERVER option, and the client shall set the ZMQ_PLAIN_USERNAME and ZMQ_PLAIN_PASSWORD socket options\&. Which peer binds, and which connects, is not relevant\&.
+.SH "SEE ALSO"
+.sp
+\fBzmq_setsockopt\fR(3) \fBzmq_null\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_tcp.7 b/ps-lite/deps/share/man/man7/zmq_tcp.7
new file mode 100644
index 00000000..df256cde
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_tcp.7
@@ -0,0 +1,188 @@
+'\" t
+.\"     Title: zmq_tcp
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_TCP" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_tcp \- 0MQ unicast transport using TCP
+.SH "SYNOPSIS"
+.sp
+TCP is an ubiquitous, reliable, unicast transport\&. When connecting distributed applications over a network with 0MQ, using the TCP transport will likely be your first choice\&.
+.SH "ADDRESSING"
+.sp
+A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+For the TCP transport, the transport is tcp, and the meaning of the \fIaddress\fR part is defined below\&.
+.SS "Assigning a local address to a socket"
+.sp
+When assigning a local address to a socket using \fIzmq_bind()\fR with the \fItcp\fR transport, the \fIendpoint\fR shall be interpreted as an \fIinterface\fR followed by a colon and the TCP port number to use\&.
+.sp
+An \fIinterface\fR may be specified by either of the following:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The wild\-card
+*, meaning all available interfaces\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The primary IPv4 or IPv6 address assigned to the interface, in its numeric representation\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The non\-portable interface name as defined by the operating system\&.
+.RE
+.sp
+The TCP port number may be specified by:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+A numeric value, usually above 1024 on POSIX systems\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The wild\-card
+*, meaning a system\-assigned ephemeral port\&.
+.RE
+.sp
+When using ephemeral ports, the caller should retrieve the actual assigned port using the ZMQ_LAST_ENDPOINT socket option\&. See \fBzmq_getsockopt\fR(3) for details\&.
+.SS "Unbinding wild\-card addres from a socket"
+.sp
+When wild\-card * \fIendpoint\fR was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket using \fIzmq_unbind()\fR\&.
+.SS "Connecting a socket"
+.sp
+When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fItcp\fR transport, the \fIendpoint\fR shall be interpreted as a \fIpeer address\fR followed by a colon and the TCP port number to use\&. You can optionally specify a \fIsource_endpoint\fR which will be used as the source address for your connection; tcp://\fIsource_endpoint\fR;\*(Aqendpoint\*(Aq, see the \fIinterface\fR description above for details\&.
+.sp
+A \fIpeer address\fR may be specified by either of the following:
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The DNS name of the peer\&.
+.RE
+.sp
+.RS 4
+.ie n \{\
+\h'-04'\(bu\h'+03'\c
+.\}
+.el \{\
+.sp -1
+.IP \(bu 2.3
+.\}
+The IPv4 or IPv6 address of the peer, in its numeric representation\&.
+.RE
+.sp
+Note: A description of the ZeroMQ Message Transport Protocol (ZMTP) which is used by the TCP transport can be found at \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:15\fR\m[]
+.SH "EXAMPLES"
+.PP
+\fBAssigning a local address to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  TCP port 5555 on all available interfaces
+rc = zmq_bind(socket, "tcp://*:5555");
+assert (rc == 0);
+//  TCP port 5555 on the local loop\-back interface on all platforms
+rc = zmq_bind(socket, "tcp://127\&.0\&.0\&.1:5555");
+assert (rc == 0);
+//  TCP port 5555 on the first Ethernet network interface on Linux
+rc = zmq_bind(socket, "tcp://eth0:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBConnecting a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Connecting using an IP address
+rc = zmq_connect(socket, "tcp://192\&.168\&.1\&.1:5555");
+assert (rc == 0);
+//  Connecting using a DNS name
+rc = zmq_connect(socket, "tcp://server1:5555");
+assert (rc == 0);
+//  Connecting using a DNS name and bind to eth1
+rc = zmq_connect(socket, "tcp://eth1:0;server1:5555");
+assert (rc == 0);
+//  Connecting using a IP address and bind to an IP address
+rc = zmq_connect(socket, "tcp://192\&.168\&.1\&.17:5555;192\&.168\&.1\&.1:5555");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_pgm\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_tipc.7 b/ps-lite/deps/share/man/man7/zmq_tipc.7
new file mode 100644
index 00000000..44f6c5c5
--- /dev/null
+++ b/ps-lite/deps/share/man/man7/zmq_tipc.7
@@ -0,0 +1,106 @@
+'\" t
+.\"     Title: zmq_tipc
+.\"    Author: [see the "AUTHORS" section]
+.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
+.\"      Date: 12/18/2015
+.\"    Manual: 0MQ Manual
+.\"    Source: 0MQ 4.1.4
+.\"  Language: English
+.\"
+.TH "ZMQ_TIPC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
+.\" -----------------------------------------------------------------
+.\" * Define some portability stuff
+.\" -----------------------------------------------------------------
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.\" http://bugs.debian.org/507673
+.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
+.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
+.ie \n(.g .ds Aq \(aq
+.el       .ds Aq '
+.\" -----------------------------------------------------------------
+.\" * set default formatting
+.\" -----------------------------------------------------------------
+.\" disable hyphenation
+.nh
+.\" disable justification (adjust text to left margin only)
+.ad l
+.\" -----------------------------------------------------------------
+.\" * MAIN CONTENT STARTS HERE *
+.\" -----------------------------------------------------------------
+.SH "NAME"
+zmq_tipc \- 0MQ unicast transport using TIPC
+.SH "SYNOPSIS"
+.sp
+TIPC is a cluster IPC protocol with a location transparent addressing scheme\&.
+.SH "ADDRESSING"
+.sp
+A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
+.sp
+For the TIPC transport, the transport is tipc, and the meaning of the \fIaddress\fR part is defined below\&.
+.sp
+Assigning a port name to a socket
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+When assigning a port name to a socket using _zmq_bind()_ with the \*(Aqtipc\*(Aq
+transport, the \*(Aqendpoint\*(Aq is defined in the form:
+{type, lower, upper}
+
+* Type is the numerical (u32) ID of your service\&.
+* Lower and Upper specify a range for your service\&.
+
+Publishing the same service with overlapping lower/upper ID\*(Aqs will
+cause connection requests to be distributed over these in a round\-robin
+manner\&.
+
+
+Connecting a socket
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fItipc\fR transport, the \fIendpoint\fR shall be interpreted as a service ID, followed by a comma and the instance ID\&.
+.sp
+The instance ID must be within the lower/upper range of a published port name for the endpoint to be valid\&.
+.SH "EXAMPLES"
+.PP
+\fBAssigning a local address to a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Publish TIPC service ID 5555
+rc = zmq_bind(socket, "tipc://{5555,0,0}");
+assert (rc == 0);
+//  Publish TIPC service ID 5555 with a service range of 0\-100
+rc = zmq_bind(socket, "tipc://{5555,0,100}");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.PP
+\fBConnecting a socket\fR. 
+.sp
+.if n \{\
+.RS 4
+.\}
+.nf
+//  Connect to service 5555 instance id 50
+rc = zmq_connect(socket, "tipc://{5555,50}");
+assert (rc == 0);
+.fi
+.if n \{\
+.RE
+.\}
+.sp
+.SH "SEE ALSO"
+.sp
+\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
+.SH "AUTHORS"
+.sp
+This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/docs/Doxyfile b/ps-lite/docs/Doxyfile
new file mode 100644
index 00000000..c150c7f1
--- /dev/null
+++ b/ps-lite/docs/Doxyfile
@@ -0,0 +1,2310 @@
+# Doxyfile 1.8.7
+
+# This file describes the settings to be used by the documentation system
+# doxygen (www.doxygen.org) for a project.
+#
+# All text after a double hash (##) is considered a comment and is placed in
+# front of the TAG it is preceding.
+#
+# All text after a single hash (#) is considered a comment and will be ignored.
+# The format is:
+# TAG = value [value, ...]
+# For lists, items can also be appended using:
+# TAG += value [value, ...]
+# Values that contain spaces should be placed between quotes (\" \").
+
+#---------------------------------------------------------------------------
+# Project related configuration options
+#---------------------------------------------------------------------------
+
+# This tag specifies the encoding used for all characters in the config file
+# that follow. The default is UTF-8 which is also the encoding used for all text
+# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
+# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
+# for the list of possible encodings.
+# The default value is: UTF-8.
+
+DOXYFILE_ENCODING      = UTF-8
+
+# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
+# double-quotes, unless you are using Doxywizard) that should identify the
+# project for which the documentation is generated. This name is used in the
+# title of most generated pages and in a few other places.
+# The default value is: My Project.
+
+PROJECT_NAME           = ps-lite
+
+# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
+# could be handy for archiving the generated documentation or if some version
+# control system is used.
+
+PROJECT_NUMBER         =
+
+# Using the PROJECT_BRIEF tag one can provide an optional one line description
+# for a project that appears at the top of each page and should give viewer a
+# quick idea about the purpose of the project. Keep the description short.
+
+PROJECT_BRIEF          = "Lightweight Pparameter Server"
+
+# With the PROJECT_LOGO tag one can specify an logo or icon that is included in
+# the documentation. The maximum height of the logo should not exceed 55 pixels
+# and the maximum width should not exceed 200 pixels. Doxygen will copy the logo
+# to the output directory.
+
+PROJECT_LOGO           =
+
+# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
+# into which the generated documentation will be written. If a relative path is
+# entered, it will be relative to the location where doxygen was started. If
+# left blank the current directory will be used.
+
+OUTPUT_DIRECTORY       =
+
+# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create 4096 sub-
+# directories (in 2 levels) under the output directory of each output format and
+# will distribute the generated files over these directories. Enabling this
+# option can be useful when feeding doxygen a huge amount of source files, where
+# putting all generated files in the same directory would otherwise causes
+# performance problems for the file system.
+# The default value is: NO.
+
+CREATE_SUBDIRS         = NO
+
+# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
+# characters to appear in the names of generated files. If set to NO, non-ASCII
+# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
+# U+3044.
+# The default value is: NO.
+
+ALLOW_UNICODE_NAMES    = NO
+
+# The OUTPUT_LANGUAGE tag is used to specify the language in which all
+# documentation generated by doxygen is written. Doxygen will use this
+# information to generate all constant output in the proper language.
+# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
+# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
+# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
+# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
+# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
+# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
+# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
+# Ukrainian and Vietnamese.
+# The default value is: English.
+
+OUTPUT_LANGUAGE        = English
+
+# If the BRIEF_MEMBER_DESC tag is set to YES doxygen will include brief member
+# descriptions after the members that are listed in the file and class
+# documentation (similar to Javadoc). Set to NO to disable this.
+# The default value is: YES.
+
+BRIEF_MEMBER_DESC      = YES
+
+# If the REPEAT_BRIEF tag is set to YES doxygen will prepend the brief
+# description of a member or function before the detailed description
+#
+# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
+# brief descriptions will be completely suppressed.
+# The default value is: YES.
+
+REPEAT_BRIEF           = YES
+
+# This tag implements a quasi-intelligent brief description abbreviator that is
+# used to form the text in various listings. Each string in this list, if found
+# as the leading text of the brief description, will be stripped from the text
+# and the result, after processing the whole list, is used as the annotated
+# text. Otherwise, the brief description is used as-is. If left blank, the
+# following values are used ($name is automatically replaced with the name of
+# the entity):The $name class, The $name widget, The $name file, is, provides,
+# specifies, contains, represents, a, an and the.
+
+ABBREVIATE_BRIEF       =
+
+# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
+# doxygen will generate a detailed section even if there is only a brief
+# description.
+# The default value is: NO.
+
+ALWAYS_DETAILED_SEC    = NO
+
+# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
+# inherited members of a class in the documentation of that class as if those
+# members were ordinary class members. Constructors, destructors and assignment
+# operators of the base classes will not be shown.
+# The default value is: NO.
+
+INLINE_INHERITED_MEMB  = NO
+
+# If the FULL_PATH_NAMES tag is set to YES doxygen will prepend the full path
+# before files name in the file list and in the header files. If set to NO the
+# shortest path that makes the file name unique will be used
+# The default value is: YES.
+
+FULL_PATH_NAMES        = YES
+
+# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
+# Stripping is only done if one of the specified strings matches the left-hand
+# part of the path. The tag can be used to show relative paths in the file list.
+# If left blank the directory from which doxygen is run is used as the path to
+# strip.
+#
+# Note that you can specify absolute paths here, but also relative paths, which
+# will be relative from the directory where doxygen is started.
+# This tag requires that the tag FULL_PATH_NAMES is set to YES.
+
+STRIP_FROM_PATH        =
+
+# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
+# path mentioned in the documentation of a class, which tells the reader which
+# header file to include in order to use a class. If left blank only the name of
+# the header file containing the class definition is used. Otherwise one should
+# specify the list of include paths that are normally passed to the compiler
+# using the -I flag.
+
+STRIP_FROM_INC_PATH    =
+
+# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
+# less readable) file names. This can be useful is your file systems doesn't
+# support long names like on DOS, Mac, or CD-ROM.
+# The default value is: NO.
+
+SHORT_NAMES            = NO
+
+# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
+# first line (until the first dot) of a Javadoc-style comment as the brief
+# description. If set to NO, the Javadoc-style will behave just like regular Qt-
+# style comments (thus requiring an explicit @brief command for a brief
+# description.)
+# The default value is: NO.
+
+JAVADOC_AUTOBRIEF      = NO
+
+# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
+# line (until the first dot) of a Qt-style comment as the brief description. If
+# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
+# requiring an explicit \brief command for a brief description.)
+# The default value is: NO.
+
+QT_AUTOBRIEF           = NO
+
+# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
+# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
+# a brief description. This used to be the default behavior. The new default is
+# to treat a multi-line C++ comment block as a detailed description. Set this
+# tag to YES if you prefer the old behavior instead.
+#
+# Note that setting this tag to YES also means that rational rose comments are
+# not recognized any more.
+# The default value is: NO.
+
+MULTILINE_CPP_IS_BRIEF = NO
+
+# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
+# documentation from any documented member that it re-implements.
+# The default value is: YES.
+
+INHERIT_DOCS           = YES
+
+# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce a
+# new page for each member. If set to NO, the documentation of a member will be
+# part of the file/class/namespace that contains it.
+# The default value is: NO.
+
+SEPARATE_MEMBER_PAGES  = NO
+
+# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
+# uses this value to replace tabs by spaces in code fragments.
+# Minimum value: 1, maximum value: 16, default value: 4.
+
+TAB_SIZE               = 4
+
+# This tag can be used to specify a number of aliases that act as commands in
+# the documentation. An alias has the form:
+# name=value
+# For example adding
+# "sideeffect=@par Side Effects:\n"
+# will allow you to put the command \sideeffect (or @sideeffect) in the
+# documentation, which will result in a user-defined paragraph with heading
+# "Side Effects:". You can put \n's in the value part of an alias to insert
+# newlines.
+
+ALIASES                =
+
+# This tag can be used to specify a number of word-keyword mappings (TCL only).
+# A mapping has the form "name=value". For example adding "class=itcl::class"
+# will allow you to use the command class in the itcl::class meaning.
+
+TCL_SUBST              =
+
+# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
+# only. Doxygen will then generate output that is more tailored for C. For
+# instance, some of the names that are used will be different. The list of all
+# members will be omitted, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_FOR_C  = NO
+
+# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
+# Python sources only. Doxygen will then generate output that is more tailored
+# for that language. For instance, namespaces will be presented as packages,
+# qualified scopes will look different, etc.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_JAVA   = NO
+
+# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
+# sources. Doxygen will then generate output that is tailored for Fortran.
+# The default value is: NO.
+
+OPTIMIZE_FOR_FORTRAN   = NO
+
+# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
+# sources. Doxygen will then generate output that is tailored for VHDL.
+# The default value is: NO.
+
+OPTIMIZE_OUTPUT_VHDL   = NO
+
+# Doxygen selects the parser to use depending on the extension of the files it
+# parses. With this tag you can assign which parser to use for a given
+# extension. Doxygen has a built-in mapping, but you can override or extend it
+# using this tag. The format is ext=language, where ext is a file extension, and
+# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
+# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
+# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
+# Fortran. In the later case the parser tries to guess whether the code is fixed
+# or free formatted code, this is the default for Fortran type files), VHDL. For
+# instance to make doxygen treat .inc files as Fortran files (default is PHP),
+# and .f files as C (default is Fortran), use: inc=Fortran f=C.
+#
+# Note For files without extension you can use no_extension as a placeholder.
+#
+# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
+# the files are not read by doxygen.
+
+EXTENSION_MAPPING      =
+
+# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
+# according to the Markdown format, which allows for more readable
+# documentation. See http://daringfireball.net/projects/markdown/ for details.
+# The output of markdown processing is further processed by doxygen, so you can
+# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
+# case of backward compatibilities issues.
+# The default value is: YES.
+
+MARKDOWN_SUPPORT       = YES
+
+# When enabled doxygen tries to link words that correspond to documented
+# classes, or namespaces to their corresponding documentation. Such a link can
+# be prevented in individual cases by by putting a % sign in front of the word
+# or globally by setting AUTOLINK_SUPPORT to NO.
+# The default value is: YES.
+
+AUTOLINK_SUPPORT       = YES
+
+# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
+# to include (a tag file for) the STL sources as input, then you should set this
+# tag to YES in order to let doxygen match functions declarations and
+# definitions whose arguments contain STL classes (e.g. func(std::string);
+# versus func(std::string) {}). This also make the inheritance and collaboration
+# diagrams that involve STL classes more complete and accurate.
+# The default value is: NO.
+
+BUILTIN_STL_SUPPORT    = NO
+
+# If you use Microsoft's C++/CLI language, you should set this option to YES to
+# enable parsing support.
+# The default value is: NO.
+
+CPP_CLI_SUPPORT        = NO
+
+# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
+# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
+# will parse them like normal C++ but will assume all classes use public instead
+# of private inheritance when no explicit protection keyword is present.
+# The default value is: NO.
+
+SIP_SUPPORT            = NO
+
+# For Microsoft's IDL there are propget and propput attributes to indicate
+# getter and setter methods for a property. Setting this option to YES will make
+# doxygen to replace the get and set methods by a property in the documentation.
+# This will only work if the methods are indeed getting or setting a simple
+# type. If this is not the case, or you want to show the methods anyway, you
+# should set this option to NO.
+# The default value is: YES.
+
+IDL_PROPERTY_SUPPORT   = YES
+
+# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
+# tag is set to YES, then doxygen will reuse the documentation of the first
+# member in the group (if any) for the other members of the group. By default
+# all members of a group must be documented explicitly.
+# The default value is: NO.
+
+DISTRIBUTE_GROUP_DOC   = NO
+
+# Set the SUBGROUPING tag to YES to allow class member groups of the same type
+# (for instance a group of public functions) to be put as a subgroup of that
+# type (e.g. under the Public Functions section). Set it to NO to prevent
+# subgrouping. Alternatively, this can be done per class using the
+# \nosubgrouping command.
+# The default value is: YES.
+
+SUBGROUPING            = YES
+
+# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
+# are shown inside the group in which they are included (e.g. using \ingroup)
+# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
+# and RTF).
+#
+# Note that this feature does not work in combination with
+# SEPARATE_MEMBER_PAGES.
+# The default value is: NO.
+
+INLINE_GROUPED_CLASSES = NO
+
+# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
+# with only public data fields or simple typedef fields will be shown inline in
+# the documentation of the scope in which they are defined (i.e. file,
+# namespace, or group documentation), provided this scope is documented. If set
+# to NO, structs, classes, and unions are shown on a separate page (for HTML and
+# Man pages) or section (for LaTeX and RTF).
+# The default value is: NO.
+
+INLINE_SIMPLE_STRUCTS  = NO
+
+# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
+# enum is documented as struct, union, or enum with the name of the typedef. So
+# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
+# with name TypeT. When disabled the typedef will appear as a member of a file,
+# namespace, or class. And the struct will be named TypeS. This can typically be
+# useful for C code in case the coding convention dictates that all compound
+# types are typedef'ed and only the typedef is referenced, never the tag name.
+# The default value is: NO.
+
+TYPEDEF_HIDES_STRUCT   = NO
+
+# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
+# cache is used to resolve symbols given their name and scope. Since this can be
+# an expensive process and often the same symbol appears multiple times in the
+# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
+# doxygen will become slower. If the cache is too large, memory is wasted. The
+# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
+# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
+# symbols. At the end of a run doxygen will report the cache usage and suggest
+# the optimal cache size from a speed point of view.
+# Minimum value: 0, maximum value: 9, default value: 0.
+
+LOOKUP_CACHE_SIZE      = 0
+
+#---------------------------------------------------------------------------
+# Build related configuration options
+#---------------------------------------------------------------------------
+
+# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
+# documentation are documented, even if no documentation was available. Private
+# class members and static file members will be hidden unless the
+# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
+# Note: This will also disable the warnings about undocumented members that are
+# normally produced when WARNINGS is set to YES.
+# The default value is: NO.
+
+EXTRACT_ALL            = NO
+
+# If the EXTRACT_PRIVATE tag is set to YES all private members of a class will
+# be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PRIVATE        = NO
+
+# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal
+# scope will be included in the documentation.
+# The default value is: NO.
+
+EXTRACT_PACKAGE        = NO
+
+# If the EXTRACT_STATIC tag is set to YES all static members of a file will be
+# included in the documentation.
+# The default value is: NO.
+
+EXTRACT_STATIC         = NO
+
+# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) defined
+# locally in source files will be included in the documentation. If set to NO
+# only classes defined in header files are included. Does not have any effect
+# for Java sources.
+# The default value is: YES.
+
+EXTRACT_LOCAL_CLASSES  = YES
+
+# This flag is only useful for Objective-C code. When set to YES local methods,
+# which are defined in the implementation section but not in the interface are
+# included in the documentation. If set to NO only methods in the interface are
+# included.
+# The default value is: NO.
+
+EXTRACT_LOCAL_METHODS  = NO
+
+# If this flag is set to YES, the members of anonymous namespaces will be
+# extracted and appear in the documentation as a namespace called
+# 'anonymous_namespace{file}', where file will be replaced with the base name of
+# the file that contains the anonymous namespace. By default anonymous namespace
+# are hidden.
+# The default value is: NO.
+
+EXTRACT_ANON_NSPACES   = NO
+
+# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
+# undocumented members inside documented classes or files. If set to NO these
+# members will be included in the various overviews, but no documentation
+# section is generated. This option has no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_MEMBERS     = NO
+
+# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
+# undocumented classes that are normally visible in the class hierarchy. If set
+# to NO these classes will be included in the various overviews. This option has
+# no effect if EXTRACT_ALL is enabled.
+# The default value is: NO.
+
+HIDE_UNDOC_CLASSES     = NO
+
+# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
+# (class|struct|union) declarations. If set to NO these declarations will be
+# included in the documentation.
+# The default value is: NO.
+
+HIDE_FRIEND_COMPOUNDS  = NO
+
+# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
+# documentation blocks found inside the body of a function. If set to NO these
+# blocks will be appended to the function's detailed documentation block.
+# The default value is: NO.
+
+HIDE_IN_BODY_DOCS      = NO
+
+# The INTERNAL_DOCS tag determines if documentation that is typed after a
+# \internal command is included. If the tag is set to NO then the documentation
+# will be excluded. Set it to YES to include the internal documentation.
+# The default value is: NO.
+
+INTERNAL_DOCS          = NO
+
+# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
+# names in lower-case letters. If set to YES upper-case letters are also
+# allowed. This is useful if you have classes or files whose names only differ
+# in case and if your file system supports case sensitive file names. Windows
+# and Mac users are advised to set this option to NO.
+# The default value is: system dependent.
+
+CASE_SENSE_NAMES       = NO
+
+# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
+# their full class and namespace scopes in the documentation. If set to YES the
+# scope will be hidden.
+# The default value is: NO.
+
+HIDE_SCOPE_NAMES       = NO
+
+# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
+# the files that are included by a file in the documentation of that file.
+# The default value is: YES.
+
+SHOW_INCLUDE_FILES     = YES
+
+# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
+# grouped member an include statement to the documentation, telling the reader
+# which file to include in order to use the member.
+# The default value is: NO.
+
+SHOW_GROUPED_MEMB_INC  = NO
+
+# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
+# files with double quotes in the documentation rather than with sharp brackets.
+# The default value is: NO.
+
+FORCE_LOCAL_INCLUDES   = NO
+
+# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
+# documentation for inline members.
+# The default value is: YES.
+
+INLINE_INFO            = YES
+
+# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
+# (detailed) documentation of file and class members alphabetically by member
+# name. If set to NO the members will appear in declaration order.
+# The default value is: YES.
+
+SORT_MEMBER_DOCS       = YES
+
+# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
+# descriptions of file, namespace and class members alphabetically by member
+# name. If set to NO the members will appear in declaration order. Note that
+# this will also influence the order of the classes in the class list.
+# The default value is: NO.
+
+SORT_BRIEF_DOCS        = NO
+
+# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
+# (brief and detailed) documentation of class members so that constructors and
+# destructors are listed first. If set to NO the constructors will appear in the
+# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
+# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
+# member documentation.
+# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
+# detailed member documentation.
+# The default value is: NO.
+
+SORT_MEMBERS_CTORS_1ST = NO
+
+# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
+# of group names into alphabetical order. If set to NO the group names will
+# appear in their defined order.
+# The default value is: NO.
+
+SORT_GROUP_NAMES       = NO
+
+# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
+# fully-qualified names, including namespaces. If set to NO, the class list will
+# be sorted only by class name, not including the namespace part.
+# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
+# Note: This option applies only to the class list, not to the alphabetical
+# list.
+# The default value is: NO.
+
+SORT_BY_SCOPE_NAME     = NO
+
+# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
+# type resolution of all parameters of a function it will reject a match between
+# the prototype and the implementation of a member function even if there is
+# only one candidate or it is obvious which candidate to choose by doing a
+# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
+# accept a match between prototype and implementation in such cases.
+# The default value is: NO.
+
+STRICT_PROTO_MATCHING  = NO
+
+# The GENERATE_TODOLIST tag can be used to enable ( YES) or disable ( NO) the
+# todo list. This list is created by putting \todo commands in the
+# documentation.
+# The default value is: YES.
+
+GENERATE_TODOLIST      = YES
+
+# The GENERATE_TESTLIST tag can be used to enable ( YES) or disable ( NO) the
+# test list. This list is created by putting \test commands in the
+# documentation.
+# The default value is: YES.
+
+GENERATE_TESTLIST      = YES
+
+# The GENERATE_BUGLIST tag can be used to enable ( YES) or disable ( NO) the bug
+# list. This list is created by putting \bug commands in the documentation.
+# The default value is: YES.
+
+GENERATE_BUGLIST       = YES
+
+# The GENERATE_DEPRECATEDLIST tag can be used to enable ( YES) or disable ( NO)
+# the deprecated list. This list is created by putting \deprecated commands in
+# the documentation.
+# The default value is: YES.
+
+GENERATE_DEPRECATEDLIST= YES
+
+# The ENABLED_SECTIONS tag can be used to enable conditional documentation
+# sections, marked by \if <section_label> ... \endif and \cond <section_label>
+# ... \endcond blocks.
+
+ENABLED_SECTIONS       =
+
+# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
+# initial value of a variable or macro / define can have for it to appear in the
+# documentation. If the initializer consists of more lines than specified here
+# it will be hidden. Use a value of 0 to hide initializers completely. The
+# appearance of the value of individual variables and macros / defines can be
+# controlled using \showinitializer or \hideinitializer command in the
+# documentation regardless of this setting.
+# Minimum value: 0, maximum value: 10000, default value: 30.
+
+MAX_INITIALIZER_LINES  = 30
+
+# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
+# the bottom of the documentation of classes and structs. If set to YES the list
+# will mention the files that were used to generate the documentation.
+# The default value is: YES.
+
+SHOW_USED_FILES        = YES
+
+# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
+# will remove the Files entry from the Quick Index and from the Folder Tree View
+# (if specified).
+# The default value is: YES.
+
+SHOW_FILES             = YES
+
+# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
+# page. This will remove the Namespaces entry from the Quick Index and from the
+# Folder Tree View (if specified).
+# The default value is: YES.
+
+SHOW_NAMESPACES        = YES
+
+# The FILE_VERSION_FILTER tag can be used to specify a program or script that
+# doxygen should invoke to get the current version for each file (typically from
+# the version control system). Doxygen will invoke the program by executing (via
+# popen()) the command command input-file, where command is the value of the
+# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
+# by doxygen. Whatever the program writes to standard output is used as the file
+# version. For an example see the documentation.
+
+FILE_VERSION_FILTER    =
+
+# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
+# by doxygen. The layout file controls the global structure of the generated
+# output files in an output format independent way. To create the layout file
+# that represents doxygen's defaults, run doxygen with the -l option. You can
+# optionally specify a file name after the option, if omitted DoxygenLayout.xml
+# will be used as the name of the layout file.
+#
+# Note that if you run doxygen from a directory containing a file called
+# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
+# tag is left empty.
+
+LAYOUT_FILE            =
+
+# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
+# the reference definitions. This must be a list of .bib files. The .bib
+# extension is automatically appended if omitted. This requires the bibtex tool
+# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
+# For LaTeX the style of the bibliography can be controlled using
+# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
+# search path. Do not use file names with spaces, bibtex cannot handle them. See
+# also \cite for info how to create references.
+
+CITE_BIB_FILES         =
+
+#---------------------------------------------------------------------------
+# Configuration options related to warning and progress messages
+#---------------------------------------------------------------------------
+
+# The QUIET tag can be used to turn on/off the messages that are generated to
+# standard output by doxygen. If QUIET is set to YES this implies that the
+# messages are off.
+# The default value is: NO.
+
+QUIET                  = NO
+
+# The WARNINGS tag can be used to turn on/off the warning messages that are
+# generated to standard error ( stderr) by doxygen. If WARNINGS is set to YES
+# this implies that the warnings are on.
+#
+# Tip: Turn warnings on while writing the documentation.
+# The default value is: YES.
+
+WARNINGS               = YES
+
+# If the WARN_IF_UNDOCUMENTED tag is set to YES, then doxygen will generate
+# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
+# will automatically be disabled.
+# The default value is: YES.
+
+WARN_IF_UNDOCUMENTED   = YES
+
+# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
+# potential errors in the documentation, such as not documenting some parameters
+# in a documented function, or documenting parameters that don't exist or using
+# markup commands wrongly.
+# The default value is: YES.
+
+WARN_IF_DOC_ERROR      = YES
+
+# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
+# are documented, but have no documentation for their parameters or return
+# value. If set to NO doxygen will only warn about wrong or incomplete parameter
+# documentation, but not about the absence of documentation.
+# The default value is: NO.
+
+WARN_NO_PARAMDOC       = NO
+
+# The WARN_FORMAT tag determines the format of the warning messages that doxygen
+# can produce. The string should contain the $file, $line, and $text tags, which
+# will be replaced by the file and line number from which the warning originated
+# and the warning text. Optionally the format may contain $version, which will
+# be replaced by the version of the file (if it could be obtained via
+# FILE_VERSION_FILTER)
+# The default value is: $file:$line: $text.
+
+WARN_FORMAT            = "$file:$line: $text"
+
+# The WARN_LOGFILE tag can be used to specify a file to which warning and error
+# messages should be written. If left blank the output is written to standard
+# error (stderr).
+
+WARN_LOGFILE           =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the input files
+#---------------------------------------------------------------------------
+
+# The INPUT tag is used to specify the files and/or directories that contain
+# documented source files. You may enter file names like myfile.cpp or
+# directories like /usr/src/myproject. Separate the files or directories with
+# spaces.
+# Note: If this tag is empty the current directory is searched.
+
+INPUT                  = ../include/ps ../include/ps/internal
+
+# This tag can be used to specify the character encoding of the source files
+# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
+# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
+# documentation (see: http://www.gnu.org/software/libiconv) for the list of
+# possible encodings.
+# The default value is: UTF-8.
+
+INPUT_ENCODING         = UTF-8
+
+# If the value of the INPUT tag contains directories, you can use the
+# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank the
+# following patterns are tested:*.c, *.cc, *.cxx, *.cpp, *.c++, *.java, *.ii,
+# *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp,
+# *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown,
+# *.md, *.mm, *.dox, *.py, *.f90, *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf,
+# *.qsf, *.as and *.js.
+
+FILE_PATTERNS          = *.h *.md
+
+# The RECURSIVE tag can be used to specify whether or not subdirectories should
+# be searched for input files as well.
+# The default value is: NO.
+
+RECURSIVE              = NO
+
+# The EXCLUDE tag can be used to specify files and/or directories that should be
+# excluded from the INPUT source files. This way you can easily exclude a
+# subdirectory from a directory tree whose root is specified with the INPUT tag.
+#
+# Note that relative paths are relative to the directory from which doxygen is
+# run.
+
+EXCLUDE                =
+
+# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
+# directories that are symbolic links (a Unix file system feature) are excluded
+# from the input.
+# The default value is: NO.
+
+EXCLUDE_SYMLINKS       = NO
+
+# If the value of the INPUT tag contains directories, you can use the
+# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
+# certain files from those directories.
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories for example use the pattern */test/*
+
+EXCLUDE_PATTERNS       =
+
+# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
+# (namespaces, classes, functions, etc.) that should be excluded from the
+# output. The symbol name can be a fully qualified name, a word, or if the
+# wildcard * is used, a substring. Examples: ANamespace, AClass,
+# AClass::ANamespace, ANamespace::*Test
+#
+# Note that the wildcards are matched against the file with absolute path, so to
+# exclude all test directories use the pattern */test/*
+
+EXCLUDE_SYMBOLS        =
+
+# The EXAMPLE_PATH tag can be used to specify one or more files or directories
+# that contain example code fragments that are included (see the \include
+# command).
+
+EXAMPLE_PATH           =
+
+# If the value of the EXAMPLE_PATH tag contains directories, you can use the
+# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
+# *.h) to filter out the source-files in the directories. If left blank all
+# files are included.
+
+EXAMPLE_PATTERNS       =
+
+# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
+# searched for input files to be used with the \include or \dontinclude commands
+# irrespective of the value of the RECURSIVE tag.
+# The default value is: NO.
+
+EXAMPLE_RECURSIVE      = NO
+
+# The IMAGE_PATH tag can be used to specify one or more files or directories
+# that contain images that are to be included in the documentation (see the
+# \image command).
+
+IMAGE_PATH             =
+
+# The INPUT_FILTER tag can be used to specify a program that doxygen should
+# invoke to filter for each input file. Doxygen will invoke the filter program
+# by executing (via popen()) the command:
+#
+# <filter> <input-file>
+#
+# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
+# name of an input file. Doxygen will then use the output that the filter
+# program writes to standard output. If FILTER_PATTERNS is specified, this tag
+# will be ignored.
+#
+# Note that the filter must not add or remove lines; it is applied before the
+# code is scanned, but not when the output code is generated. If lines are added
+# or removed, the anchors will not be placed correctly.
+
+INPUT_FILTER           =
+
+# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
+# basis. Doxygen will compare the file name with each pattern and apply the
+# filter if there is a match. The filters are a list of the form: pattern=filter
+# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
+# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
+# patterns match the file name, INPUT_FILTER is applied.
+
+FILTER_PATTERNS        =
+
+# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
+# INPUT_FILTER ) will also be used to filter the input files that are used for
+# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
+# The default value is: NO.
+
+FILTER_SOURCE_FILES    = NO
+
+# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
+# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
+# it is also possible to disable source filtering for a specific pattern using
+# *.ext= (so without naming a filter).
+# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
+
+FILTER_SOURCE_PATTERNS =
+
+# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
+# is part of the input, its contents will be placed on the main page
+# (index.html). This can be useful if you have a project on for instance GitHub
+# and want to reuse the introduction page also for the doxygen output.
+
+USE_MDFILE_AS_MAINPAGE =
+
+#---------------------------------------------------------------------------
+# Configuration options related to source browsing
+#---------------------------------------------------------------------------
+
+# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
+# generated. Documented entities will be cross-referenced with these sources.
+#
+# Note: To get rid of all source code in the generated output, make sure that
+# also VERBATIM_HEADERS is set to NO.
+# The default value is: NO.
+
+SOURCE_BROWSER         = YES
+
+# Setting the INLINE_SOURCES tag to YES will include the body of functions,
+# classes and enums directly into the documentation.
+# The default value is: NO.
+
+INLINE_SOURCES         = NO
+
+# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
+# special comment blocks from generated source code fragments. Normal C, C++ and
+# Fortran comments will always remain visible.
+# The default value is: YES.
+
+STRIP_CODE_COMMENTS    = YES
+
+# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
+# function all documented functions referencing it will be listed.
+# The default value is: NO.
+
+REFERENCED_BY_RELATION = NO
+
+# If the REFERENCES_RELATION tag is set to YES then for each documented function
+# all documented entities called/used by that function will be listed.
+# The default value is: NO.
+
+REFERENCES_RELATION    = NO
+
+# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
+# to YES, then the hyperlinks from functions in REFERENCES_RELATION and
+# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
+# link to the documentation.
+# The default value is: YES.
+
+REFERENCES_LINK_SOURCE = YES
+
+# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
+# source code will show a tooltip with additional information such as prototype,
+# brief description and links to the definition and documentation. Since this
+# will make the HTML file larger and loading of large files a bit slower, you
+# can opt to disable this feature.
+# The default value is: YES.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+SOURCE_TOOLTIPS        = YES
+
+# If the USE_HTAGS tag is set to YES then the references to source code will
+# point to the HTML generated by the htags(1) tool instead of doxygen built-in
+# source browser. The htags tool is part of GNU's global source tagging system
+# (see http://www.gnu.org/software/global/global.html). You will need version
+# 4.8.6 or higher.
+#
+# To use it do the following:
+# - Install the latest version of global
+# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
+# - Make sure the INPUT points to the root of the source tree
+# - Run doxygen as normal
+#
+# Doxygen will invoke htags (and that will in turn invoke gtags), so these
+# tools must be available from the command line (i.e. in the search path).
+#
+# The result: instead of the source browser generated by doxygen, the links to
+# source code will now point to the output of htags.
+# The default value is: NO.
+# This tag requires that the tag SOURCE_BROWSER is set to YES.
+
+USE_HTAGS              = NO
+
+# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
+# verbatim copy of the header file for each class for which an include is
+# specified. Set to NO to disable this.
+# See also: Section \class.
+# The default value is: YES.
+
+VERBATIM_HEADERS       = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the alphabetical class index
+#---------------------------------------------------------------------------
+
+# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
+# compounds will be generated. Enable this if the project contains a lot of
+# classes, structs, unions or interfaces.
+# The default value is: YES.
+
+ALPHABETICAL_INDEX     = YES
+
+# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
+# which the alphabetical index list will be split.
+# Minimum value: 1, maximum value: 20, default value: 5.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+COLS_IN_ALPHA_INDEX    = 5
+
+# In case all classes in a project start with a common prefix, all classes will
+# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
+# can be used to specify a prefix (or a list of prefixes) that should be ignored
+# while generating the index headers.
+# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
+
+IGNORE_PREFIX          =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the HTML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_HTML tag is set to YES doxygen will generate HTML output
+# The default value is: YES.
+
+GENERATE_HTML          = NO
+
+# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_OUTPUT            = html
+
+# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
+# generated HTML page (for example: .htm, .php, .asp).
+# The default value is: .html.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FILE_EXTENSION    = .html
+
+# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
+# each generated HTML page. If the tag is left blank doxygen will generate a
+# standard header.
+#
+# To get valid HTML the header file that includes any scripts and style sheets
+# that doxygen needs, which is dependent on the configuration options used (e.g.
+# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
+# default header using
+# doxygen -w html new_header.html new_footer.html new_stylesheet.css
+# YourConfigFile
+# and then modify the file new_header.html. See also section "Doxygen usage"
+# for information on how to generate the default header that doxygen normally
+# uses.
+# Note: The header is subject to change so you typically have to regenerate the
+# default header when upgrading to a newer version of doxygen. For a description
+# of the possible markers and block names see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_HEADER            =
+
+# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
+# generated HTML page. If the tag is left blank doxygen will generate a standard
+# footer. See HTML_HEADER for more information on how to generate a default
+# footer and what special commands can be used inside the footer. See also
+# section "Doxygen usage" for information on how to generate the default footer
+# that doxygen normally uses.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_FOOTER            =
+
+# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
+# sheet that is used by each HTML page. It can be used to fine-tune the look of
+# the HTML output. If left blank doxygen will generate a default style sheet.
+# See also section "Doxygen usage" for information on how to generate the style
+# sheet that doxygen normally uses.
+# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
+# it is more robust and this tag (HTML_STYLESHEET) will in the future become
+# obsolete.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_STYLESHEET        =
+
+# The HTML_EXTRA_STYLESHEET tag can be used to specify an additional user-
+# defined cascading style sheet that is included after the standard style sheets
+# created by doxygen. Using this option one can overrule certain style aspects.
+# This is preferred over using HTML_STYLESHEET since it does not replace the
+# standard style sheet and is therefor more robust against future updates.
+# Doxygen will copy the style sheet file to the output directory. For an example
+# see the documentation.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_STYLESHEET  =
+
+# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the HTML output directory. Note
+# that these files will be copied to the base HTML output directory. Use the
+# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
+# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
+# files will be copied as-is; there are no commands or markers available.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_EXTRA_FILES       =
+
+# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
+# will adjust the colors in the stylesheet and background images according to
+# this color. Hue is specified as an angle on a colorwheel, see
+# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
+# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
+# purple, and 360 is red again.
+# Minimum value: 0, maximum value: 359, default value: 220.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_HUE    = 220
+
+# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
+# in the HTML output. For a value of 0 the output will use grayscales only. A
+# value of 255 will produce the most vivid colors.
+# Minimum value: 0, maximum value: 255, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_SAT    = 100
+
+# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
+# luminance component of the colors in the HTML output. Values below 100
+# gradually make the output lighter, whereas values above 100 make the output
+# darker. The value divided by 100 is the actual gamma applied, so 80 represents
+# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
+# change the gamma.
+# Minimum value: 40, maximum value: 240, default value: 80.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_COLORSTYLE_GAMMA  = 80
+
+# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
+# page will contain the date and time when the page was generated. Setting this
+# to NO can help when comparing the output of multiple runs.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_TIMESTAMP         = YES
+
+# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
+# documentation will contain sections that can be hidden and shown after the
+# page has loaded.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_DYNAMIC_SECTIONS  = NO
+
+# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
+# shown in the various tree structured indices initially; the user can expand
+# and collapse entries dynamically later on. Doxygen will expand the tree to
+# such a level that at most the specified number of entries are visible (unless
+# a fully collapsed tree already exceeds this amount). So setting the number of
+# entries 1 will produce a full collapsed tree by default. 0 is a special value
+# representing an infinite number of entries and will result in a full expanded
+# tree by default.
+# Minimum value: 0, maximum value: 9999, default value: 100.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+HTML_INDEX_NUM_ENTRIES = 100
+
+# If the GENERATE_DOCSET tag is set to YES, additional index files will be
+# generated that can be used as input for Apple's Xcode 3 integrated development
+# environment (see: http://developer.apple.com/tools/xcode/), introduced with
+# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
+# Makefile in the HTML output directory. Running make will produce the docset in
+# that directory and running make install will install the docset in
+# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
+# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
+# for more information.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_DOCSET        = NO
+
+# This tag determines the name of the docset feed. A documentation feed provides
+# an umbrella under which multiple documentation sets from a single provider
+# (such as a company or product suite) can be grouped.
+# The default value is: Doxygen generated docs.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_FEEDNAME        = "Doxygen generated docs"
+
+# This tag specifies a string that should uniquely identify the documentation
+# set bundle. This should be a reverse domain-name style string, e.g.
+# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_BUNDLE_ID       = org.doxygen.Project
+
+# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
+# the documentation publisher. This should be a reverse domain-name style
+# string, e.g. com.mycompany.MyDocSet.documentation.
+# The default value is: org.doxygen.Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
+
+# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
+# The default value is: Publisher.
+# This tag requires that the tag GENERATE_DOCSET is set to YES.
+
+DOCSET_PUBLISHER_NAME  = Publisher
+
+# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
+# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
+# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
+# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
+# Windows.
+#
+# The HTML Help Workshop contains a compiler that can convert all HTML output
+# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
+# files are now used as the Windows 98 help format, and will replace the old
+# Windows help format (.hlp) on all Windows platforms in the future. Compressed
+# HTML files also contain an index, a table of contents, and you can search for
+# words in the documentation. The HTML workshop also contains a viewer for
+# compressed HTML files.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_HTMLHELP      = NO
+
+# The CHM_FILE tag can be used to specify the file name of the resulting .chm
+# file. You can add a path in front of the file if the result should not be
+# written to the html output directory.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_FILE               =
+
+# The HHC_LOCATION tag can be used to specify the location (absolute path
+# including file name) of the HTML help compiler ( hhc.exe). If non-empty
+# doxygen will try to run the HTML help compiler on the generated index.hhp.
+# The file has to be specified with full path.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+HHC_LOCATION           =
+
+# The GENERATE_CHI flag controls if a separate .chi index file is generated (
+# YES) or that it should be included in the master .chm file ( NO).
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+GENERATE_CHI           = NO
+
+# The CHM_INDEX_ENCODING is used to encode HtmlHelp index ( hhk), content ( hhc)
+# and project file content.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+CHM_INDEX_ENCODING     =
+
+# The BINARY_TOC flag controls whether a binary table of contents is generated (
+# YES) or a normal table of contents ( NO) in the .chm file. Furthermore it
+# enables the Previous and Next buttons.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+BINARY_TOC             = NO
+
+# The TOC_EXPAND flag can be set to YES to add extra items for group members to
+# the table of contents of the HTML help documentation and to the tree view.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
+
+TOC_EXPAND             = NO
+
+# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
+# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
+# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
+# (.qch) of the generated HTML documentation.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_QHP           = NO
+
+# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
+# the file name of the resulting .qch file. The path specified is relative to
+# the HTML output folder.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QCH_FILE               =
+
+# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
+# Project output. For more information please see Qt Help Project / Namespace
+# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_NAMESPACE          = org.doxygen.Project
+
+# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
+# Help Project output. For more information please see Qt Help Project / Virtual
+# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
+# folders).
+# The default value is: doc.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_VIRTUAL_FOLDER     = doc
+
+# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
+# filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_NAME   =
+
+# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
+# custom filter to add. For more information please see Qt Help Project / Custom
+# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
+# filters).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_CUST_FILTER_ATTRS  =
+
+# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
+# project's filter section matches. Qt Help Project / Filter Attributes (see:
+# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHP_SECT_FILTER_ATTRS  =
+
+# The QHG_LOCATION tag can be used to specify the location of Qt's
+# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
+# generated .qhp file.
+# This tag requires that the tag GENERATE_QHP is set to YES.
+
+QHG_LOCATION           =
+
+# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
+# generated, together with the HTML files, they form an Eclipse help plugin. To
+# install this plugin and make it available under the help contents menu in
+# Eclipse, the contents of the directory containing the HTML and XML files needs
+# to be copied into the plugins directory of eclipse. The name of the directory
+# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
+# After copying Eclipse needs to be restarted before the help appears.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_ECLIPSEHELP   = NO
+
+# A unique identifier for the Eclipse help plugin. When installing the plugin
+# the directory name containing the HTML and XML files should also have this
+# name. Each documentation set should have its own identifier.
+# The default value is: org.doxygen.Project.
+# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
+
+ECLIPSE_DOC_ID         = org.doxygen.Project
+
+# If you want full control over the layout of the generated HTML pages it might
+# be necessary to disable the index and replace it with your own. The
+# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
+# of each HTML page. A value of NO enables the index and the value YES disables
+# it. Since the tabs in the index contain the same information as the navigation
+# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+DISABLE_INDEX          = NO
+
+# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
+# structure should be generated to display hierarchical information. If the tag
+# value is set to YES, a side panel will be generated containing a tree-like
+# index structure (just like the one that is generated for HTML Help). For this
+# to work a browser that supports JavaScript, DHTML, CSS and frames is required
+# (i.e. any modern browser). Windows users are probably better off using the
+# HTML help feature. Via custom stylesheets (see HTML_EXTRA_STYLESHEET) one can
+# further fine-tune the look of the index. As an example, the default style
+# sheet generated by doxygen has an example that shows how to put an image at
+# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
+# the same information as the tab index, you could consider setting
+# DISABLE_INDEX to YES when enabling this option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+GENERATE_TREEVIEW      = NO
+
+# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
+# doxygen will group on one line in the generated HTML documentation.
+#
+# Note that a value of 0 will completely suppress the enum values from appearing
+# in the overview section.
+# Minimum value: 0, maximum value: 20, default value: 4.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+ENUM_VALUES_PER_LINE   = 4
+
+# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
+# to set the initial width (in pixels) of the frame in which the tree is shown.
+# Minimum value: 0, maximum value: 1500, default value: 250.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+TREEVIEW_WIDTH         = 250
+
+# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open links to
+# external symbols imported via tag files in a separate window.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+EXT_LINKS_IN_WINDOW    = NO
+
+# Use this tag to change the font size of LaTeX formulas included as images in
+# the HTML documentation. When you change the font size after a successful
+# doxygen run you need to manually remove any form_*.png images from the HTML
+# output directory to force them to be regenerated.
+# Minimum value: 8, maximum value: 50, default value: 10.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_FONTSIZE       = 10
+
+# Use the FORMULA_TRANPARENT tag to determine whether or not the images
+# generated for formulas are transparent PNGs. Transparent PNGs are not
+# supported properly for IE 6.0, but are supported on all modern browsers.
+#
+# Note that when changing this option you need to delete any form_*.png files in
+# the HTML output directory before the changes have effect.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+FORMULA_TRANSPARENT    = YES
+
+# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
+# http://www.mathjax.org) which uses client side Javascript for the rendering
+# instead of using prerendered bitmaps. Use this if you do not have LaTeX
+# installed or if you want to formulas look prettier in the HTML output. When
+# enabled you may also need to install MathJax separately and configure the path
+# to it using the MATHJAX_RELPATH option.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+USE_MATHJAX            = NO
+
+# When MathJax is enabled you can set the default output format to be used for
+# the MathJax output. See the MathJax site (see:
+# http://docs.mathjax.org/en/latest/output.html) for more details.
+# Possible values are: HTML-CSS (which is slower, but has the best
+# compatibility), NativeMML (i.e. MathML) and SVG.
+# The default value is: HTML-CSS.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_FORMAT         = HTML-CSS
+
+# When MathJax is enabled you need to specify the location relative to the HTML
+# output directory using the MATHJAX_RELPATH option. The destination directory
+# should contain the MathJax.js script. For instance, if the mathjax directory
+# is located at the same level as the HTML output directory, then
+# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
+# Content Delivery Network so you can quickly see the result without installing
+# MathJax. However, it is strongly recommended to install a local copy of
+# MathJax from http://www.mathjax.org before deployment.
+# The default value is: http://cdn.mathjax.org/mathjax/latest.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
+
+# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
+# extension names that should be enabled during MathJax rendering. For example
+# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_EXTENSIONS     =
+
+# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
+# of code that will be used on startup of the MathJax code. See the MathJax site
+# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
+# example see the documentation.
+# This tag requires that the tag USE_MATHJAX is set to YES.
+
+MATHJAX_CODEFILE       =
+
+# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
+# the HTML output. The underlying search engine uses javascript and DHTML and
+# should work on any modern browser. Note that when using HTML help
+# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
+# there is already a search function so this one should typically be disabled.
+# For large projects the javascript based search engine can be slow, then
+# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
+# search using the keyboard; to jump to the search box use <access key> + S
+# (what the <access key> is depends on the OS and browser, but it is typically
+# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
+# key> to jump into the search results window, the results can be navigated
+# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
+# the search. The filter options can be selected when the cursor is inside the
+# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
+# to select a filter and <Enter> or <escape> to activate or cancel the filter
+# option.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_HTML is set to YES.
+
+SEARCHENGINE           = YES
+
+# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
+# implemented using a web server instead of a web client using Javascript. There
+# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
+# setting. When disabled, doxygen will generate a PHP script for searching and
+# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
+# and searching needs to be provided by external tools. See the section
+# "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SERVER_BASED_SEARCH    = NO
+
+# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
+# script for searching. Instead the search results are written to an XML file
+# which needs to be processed by an external indexer. Doxygen will invoke an
+# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
+# search results.
+#
+# Doxygen ships with an example indexer ( doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/).
+#
+# See the section "External Indexing and Searching" for details.
+# The default value is: NO.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH        = NO
+
+# The SEARCHENGINE_URL should point to a search engine hosted by a web server
+# which will return the search results when EXTERNAL_SEARCH is enabled.
+#
+# Doxygen ships with an example indexer ( doxyindexer) and search engine
+# (doxysearch.cgi) which are based on the open source search engine library
+# Xapian (see: http://xapian.org/). See the section "External Indexing and
+# Searching" for details.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHENGINE_URL       =
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
+# search data is written to a file for indexing by an external tool. With the
+# SEARCHDATA_FILE tag the name of this file can be specified.
+# The default file is: searchdata.xml.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+SEARCHDATA_FILE        = searchdata.xml
+
+# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
+# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
+# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
+# projects and redirect the results back to the right project.
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTERNAL_SEARCH_ID     =
+
+# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
+# projects other than the one defined by this configuration file, but that are
+# all added to the same external search index. Each project needs to have a
+# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
+# to a relative location where the documentation can be found. The format is:
+# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
+# This tag requires that the tag SEARCHENGINE is set to YES.
+
+EXTRA_SEARCH_MAPPINGS  =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the LaTeX output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_LATEX tag is set to YES doxygen will generate LaTeX output.
+# The default value is: YES.
+
+GENERATE_LATEX         = NO
+
+# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_OUTPUT           = latex
+
+# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
+# invoked.
+#
+# Note that when enabling USE_PDFLATEX this option is only used for generating
+# bitmaps for formulas in the HTML output, but not in the Makefile that is
+# written to the output directory.
+# The default file is: latex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_CMD_NAME         = latex
+
+# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
+# index for LaTeX.
+# The default file is: makeindex.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+MAKEINDEX_CMD_NAME     = makeindex
+
+# If the COMPACT_LATEX tag is set to YES doxygen generates more compact LaTeX
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+COMPACT_LATEX          = NO
+
+# The PAPER_TYPE tag can be used to set the paper type that is used by the
+# printer.
+# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
+# 14 inches) and executive (7.25 x 10.5 inches).
+# The default value is: a4.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PAPER_TYPE             = a4
+
+# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
+# that should be included in the LaTeX output. To get the times font for
+# instance you can specify
+# EXTRA_PACKAGES=times
+# If left blank no extra packages will be included.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+EXTRA_PACKAGES         =
+
+# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
+# generated LaTeX document. The header should contain everything until the first
+# chapter. If it is left blank doxygen will generate a standard header. See
+# section "Doxygen usage" for information on how to let doxygen write the
+# default header to a separate file.
+#
+# Note: Only use a user-defined header if you know what you are doing! The
+# following commands have a special meaning inside the header: $title,
+# $datetime, $date, $doxygenversion, $projectname, $projectnumber. Doxygen will
+# replace them by respectively the title of the page, the current date and time,
+# only the current date, the version number of doxygen, the project name (see
+# PROJECT_NAME), or the project number (see PROJECT_NUMBER).
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HEADER           =
+
+# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
+# generated LaTeX document. The footer should contain everything after the last
+# chapter. If it is left blank doxygen will generate a standard footer.
+#
+# Note: Only use a user-defined footer if you know what you are doing!
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_FOOTER           =
+
+# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
+# other source files which should be copied to the LATEX_OUTPUT output
+# directory. Note that the files will be copied as-is; there are no commands or
+# markers available.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_EXTRA_FILES      =
+
+# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
+# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
+# contain links (just like the HTML output) instead of page references. This
+# makes the output suitable for online browsing using a PDF viewer.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+PDF_HYPERLINKS         = YES
+
+# If the LATEX_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
+# the PDF file directly from the LaTeX files. Set this option to YES to get a
+# higher quality PDF documentation.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+USE_PDFLATEX           = YES
+
+# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
+# command to the generated LaTeX files. This will instruct LaTeX to keep running
+# if errors occur, instead of asking the user for help. This option is also used
+# when generating formulas in HTML.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BATCHMODE        = NO
+
+# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
+# index chapters (such as File Index, Compound Index, etc.) in the output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_HIDE_INDICES     = NO
+
+# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
+# code with syntax highlighting in the LaTeX output.
+#
+# Note that which sources are shown also depends on other settings such as
+# SOURCE_BROWSER.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_SOURCE_CODE      = NO
+
+# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
+# bibliography, e.g. plainnat, or ieeetr. See
+# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
+# The default value is: plain.
+# This tag requires that the tag GENERATE_LATEX is set to YES.
+
+LATEX_BIB_STYLE        = plain
+
+#---------------------------------------------------------------------------
+# Configuration options related to the RTF output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_RTF tag is set to YES doxygen will generate RTF output. The
+# RTF output is optimized for Word 97 and may not look too pretty with other RTF
+# readers/editors.
+# The default value is: NO.
+
+GENERATE_RTF           = NO
+
+# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: rtf.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_OUTPUT             = rtf
+
+# If the COMPACT_RTF tag is set to YES doxygen generates more compact RTF
+# documents. This may be useful for small projects and may help to save some
+# trees in general.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+COMPACT_RTF            = NO
+
+# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
+# contain hyperlink fields. The RTF file will contain links (just like the HTML
+# output) instead of page references. This makes the output suitable for online
+# browsing using Word or some other Word compatible readers that support those
+# fields.
+#
+# Note: WordPad (write) and others do not support links.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_HYPERLINKS         = NO
+
+# Load stylesheet definitions from file. Syntax is similar to doxygen's config
+# file, i.e. a series of assignments. You only have to provide replacements,
+# missing definitions are set to their default value.
+#
+# See also section "Doxygen usage" for information on how to generate the
+# default style sheet that doxygen normally uses.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_STYLESHEET_FILE    =
+
+# Set optional variables used in the generation of an RTF document. Syntax is
+# similar to doxygen's config file. A template extensions file can be generated
+# using doxygen -e rtf extensionFile.
+# This tag requires that the tag GENERATE_RTF is set to YES.
+
+RTF_EXTENSIONS_FILE    =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the man page output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_MAN tag is set to YES doxygen will generate man pages for
+# classes and files.
+# The default value is: NO.
+
+GENERATE_MAN           = NO
+
+# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it. A directory man3 will be created inside the directory specified by
+# MAN_OUTPUT.
+# The default directory is: man.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_OUTPUT             = man
+
+# The MAN_EXTENSION tag determines the extension that is added to the generated
+# man pages. In case the manual section does not start with a number, the number
+# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
+# optional.
+# The default value is: .3.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_EXTENSION          = .3
+
+# The MAN_SUBDIR tag determines the name of the directory created within
+# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
+# MAN_EXTENSION with the initial . removed.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_SUBDIR             =
+
+# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
+# will generate one additional man file for each entity documented in the real
+# man page(s). These additional files only source the real man page, but without
+# them the man command would be unable to find the correct page.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_MAN is set to YES.
+
+MAN_LINKS              = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the XML output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_XML tag is set to YES doxygen will generate an XML file that
+# captures the structure of the code including all documentation.
+# The default value is: NO.
+
+GENERATE_XML           = YES
+
+# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
+# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
+# it.
+# The default directory is: xml.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_OUTPUT             = xml
+
+# If the XML_PROGRAMLISTING tag is set to YES doxygen will dump the program
+# listings (including syntax highlighting and cross-referencing information) to
+# the XML output. Note that enabling this will significantly increase the size
+# of the XML output.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_XML is set to YES.
+
+XML_PROGRAMLISTING     = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to the DOCBOOK output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_DOCBOOK tag is set to YES doxygen will generate Docbook files
+# that can be used to generate PDF.
+# The default value is: NO.
+
+GENERATE_DOCBOOK       = NO
+
+# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
+# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
+# front of it.
+# The default directory is: docbook.
+# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
+
+DOCBOOK_OUTPUT         = docbook
+
+#---------------------------------------------------------------------------
+# Configuration options for the AutoGen Definitions output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_AUTOGEN_DEF tag is set to YES doxygen will generate an AutoGen
+# Definitions (see http://autogen.sf.net) file that captures the structure of
+# the code including all documentation. Note that this feature is still
+# experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_AUTOGEN_DEF   = NO
+
+#---------------------------------------------------------------------------
+# Configuration options related to the Perl module output
+#---------------------------------------------------------------------------
+
+# If the GENERATE_PERLMOD tag is set to YES doxygen will generate a Perl module
+# file that captures the structure of the code including all documentation.
+#
+# Note that this feature is still experimental and incomplete at the moment.
+# The default value is: NO.
+
+GENERATE_PERLMOD       = NO
+
+# If the PERLMOD_LATEX tag is set to YES doxygen will generate the necessary
+# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
+# output from the Perl module output.
+# The default value is: NO.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_LATEX          = NO
+
+# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be nicely
+# formatted so it can be parsed by a human reader. This is useful if you want to
+# understand what is going on. On the other hand, if this tag is set to NO the
+# size of the Perl module output will be much smaller and Perl will parse it
+# just the same.
+# The default value is: YES.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_PRETTY         = YES
+
+# The names of the make variables in the generated doxyrules.make file are
+# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
+# so different doxyrules.make files included by the same Makefile don't
+# overwrite each other's variables.
+# This tag requires that the tag GENERATE_PERLMOD is set to YES.
+
+PERLMOD_MAKEVAR_PREFIX =
+
+#---------------------------------------------------------------------------
+# Configuration options related to the preprocessor
+#---------------------------------------------------------------------------
+
+# If the ENABLE_PREPROCESSING tag is set to YES doxygen will evaluate all
+# C-preprocessor directives found in the sources and include files.
+# The default value is: YES.
+
+ENABLE_PREPROCESSING   = YES
+
+# If the MACRO_EXPANSION tag is set to YES doxygen will expand all macro names
+# in the source code. If set to NO only conditional compilation will be
+# performed. Macro expansion can be done in a controlled way by setting
+# EXPAND_ONLY_PREDEF to YES.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+MACRO_EXPANSION        = NO
+
+# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
+# the macro expansion is limited to the macros specified with the PREDEFINED and
+# EXPAND_AS_DEFINED tags.
+# The default value is: NO.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_ONLY_PREDEF     = NO
+
+# If the SEARCH_INCLUDES tag is set to YES the includes files in the
+# INCLUDE_PATH will be searched if a #include is found.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SEARCH_INCLUDES        = YES
+
+# The INCLUDE_PATH tag can be used to specify one or more directories that
+# contain include files that are not input files but should be processed by the
+# preprocessor.
+# This tag requires that the tag SEARCH_INCLUDES is set to YES.
+
+INCLUDE_PATH           =
+
+# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
+# patterns (like *.h and *.hpp) to filter out the header-files in the
+# directories. If left blank, the patterns specified with FILE_PATTERNS will be
+# used.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+INCLUDE_FILE_PATTERNS  =
+
+# The PREDEFINED tag can be used to specify one or more macro names that are
+# defined before the preprocessor is started (similar to the -D option of e.g.
+# gcc). The argument of the tag is a list of macros of the form: name or
+# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
+# is assumed. To prevent a macro definition from being undefined via #undef or
+# recursively expanded use the := operator instead of the = operator.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+PREDEFINED             =
+
+# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
+# tag can be used to specify a list of macro names that should be expanded. The
+# macro definition that is found in the sources will be used. Use the PREDEFINED
+# tag if you want to use a different macro definition that overrules the
+# definition found in the source code.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+EXPAND_AS_DEFINED      =
+
+# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
+# remove all references to function-like macros that are alone on a line, have
+# an all uppercase name, and do not end with a semicolon. Such function macros
+# are typically used for boiler-plate code, and will confuse the parser if not
+# removed.
+# The default value is: YES.
+# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
+
+SKIP_FUNCTION_MACROS   = YES
+
+#---------------------------------------------------------------------------
+# Configuration options related to external references
+#---------------------------------------------------------------------------
+
+# The TAGFILES tag can be used to specify one or more tag files. For each tag
+# file the location of the external documentation should be added. The format of
+# a tag file without this location is as follows:
+# TAGFILES = file1 file2 ...
+# Adding location for the tag files is done as follows:
+# TAGFILES = file1=loc1 "file2 = loc2" ...
+# where loc1 and loc2 can be relative or absolute paths or URLs. See the
+# section "Linking to external documentation" for more information about the use
+# of tag files.
+# Note: Each tag file must have a unique name (where the name does NOT include
+# the path). If a tag file is not located in the directory in which doxygen is
+# run, you must also specify the path to the tagfile here.
+
+TAGFILES               =
+
+# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
+# tag file that is based on the input files it reads. See section "Linking to
+# external documentation" for more information about the usage of tag files.
+
+GENERATE_TAGFILE       =
+
+# If the ALLEXTERNALS tag is set to YES all external class will be listed in the
+# class index. If set to NO only the inherited external classes will be listed.
+# The default value is: NO.
+
+ALLEXTERNALS           = NO
+
+# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed in
+# the modules index. If set to NO, only the current project's groups will be
+# listed.
+# The default value is: YES.
+
+EXTERNAL_GROUPS        = YES
+
+# If the EXTERNAL_PAGES tag is set to YES all external pages will be listed in
+# the related pages index. If set to NO, only the current project's pages will
+# be listed.
+# The default value is: YES.
+
+EXTERNAL_PAGES         = YES
+
+# The PERL_PATH should be the absolute path and name of the perl script
+# interpreter (i.e. the result of 'which perl').
+# The default file (with absolute path) is: /usr/bin/perl.
+
+PERL_PATH              = /usr/bin/perl
+
+#---------------------------------------------------------------------------
+# Configuration options related to the dot tool
+#---------------------------------------------------------------------------
+
+# If the CLASS_DIAGRAMS tag is set to YES doxygen will generate a class diagram
+# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
+# NO turns the diagrams off. Note that this option also works with HAVE_DOT
+# disabled, but it is recommended to install and use dot, since it yields more
+# powerful graphs.
+# The default value is: YES.
+
+CLASS_DIAGRAMS         = YES
+
+# You can define message sequence charts within doxygen comments using the \msc
+# command. Doxygen will then run the mscgen tool (see:
+# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
+# documentation. The MSCGEN_PATH tag allows you to specify the directory where
+# the mscgen tool resides. If left empty the tool is assumed to be found in the
+# default search path.
+
+MSCGEN_PATH            =
+
+# You can include diagrams made with dia in doxygen documentation. Doxygen will
+# then run dia to produce the diagram and insert it in the documentation. The
+# DIA_PATH tag allows you to specify the directory where the dia binary resides.
+# If left empty dia is assumed to be found in the default search path.
+
+DIA_PATH               =
+
+# If set to YES, the inheritance and collaboration graphs will hide inheritance
+# and usage relations if the target is undocumented or is not a class.
+# The default value is: YES.
+
+HIDE_UNDOC_RELATIONS   = YES
+
+# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
+# available from the path. This tool is part of Graphviz (see:
+# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
+# Bell Labs. The other options in this section have no effect if this option is
+# set to NO
+# The default value is: NO.
+
+HAVE_DOT               = NO
+
+# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
+# to run in parallel. When set to 0 doxygen will base this on the number of
+# processors available in the system. You can set it explicitly to a value
+# larger than 0 to get control over the balance between CPU load and processing
+# speed.
+# Minimum value: 0, maximum value: 32, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_NUM_THREADS        = 0
+
+# When you want a differently looking font n the dot files that doxygen
+# generates you can specify the font name using DOT_FONTNAME. You need to make
+# sure dot is able to find the font, which can be done by putting it in a
+# standard location or by setting the DOTFONTPATH environment variable or by
+# setting DOT_FONTPATH to the directory containing the font.
+# The default value is: Helvetica.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTNAME           = Helvetica
+
+# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
+# dot graphs.
+# Minimum value: 4, maximum value: 24, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTSIZE           = 10
+
+# By default doxygen will tell dot to use the default font as specified with
+# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
+# the path where dot can find it using this tag.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_FONTPATH           =
+
+# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
+# each documented class showing the direct and indirect inheritance relations.
+# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CLASS_GRAPH            = YES
+
+# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
+# graph for each documented class showing the direct and indirect implementation
+# dependencies (inheritance, containment, and class references variables) of the
+# class with other documented classes.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+COLLABORATION_GRAPH    = YES
+
+# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
+# groups, showing the direct groups dependencies.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GROUP_GRAPHS           = YES
+
+# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
+# collaboration diagrams in a style similar to the OMG's Unified Modeling
+# Language.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LOOK               = NO
+
+# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
+# class node. If there are many fields or methods and many nodes the graph may
+# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
+# number of items for each type to make the size more manageable. Set this to 0
+# for no limit. Note that the threshold may be exceeded by 50% before the limit
+# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
+# but if the number exceeds 15, the total amount of fields shown is limited to
+# 10.
+# Minimum value: 0, maximum value: 100, default value: 10.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+UML_LIMIT_NUM_FIELDS   = 10
+
+# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
+# collaboration graphs will show the relations between templates and their
+# instances.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+TEMPLATE_RELATIONS     = NO
+
+# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
+# YES then doxygen will generate a graph for each documented file showing the
+# direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDE_GRAPH          = YES
+
+# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
+# set to YES then doxygen will generate a graph for each documented file showing
+# the direct and indirect include dependencies of the file with other documented
+# files.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INCLUDED_BY_GRAPH      = YES
+
+# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable call graphs for selected
+# functions only using the \callgraph command.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALL_GRAPH             = NO
+
+# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
+# dependency graph for every global function or class method.
+#
+# Note that enabling this option will significantly increase the time of a run.
+# So in most cases it will be better to enable caller graphs for selected
+# functions only using the \callergraph command.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+CALLER_GRAPH           = NO
+
+# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
+# hierarchy of all classes instead of a textual one.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GRAPHICAL_HIERARCHY    = YES
+
+# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
+# dependencies a directory has on other directories in a graphical way. The
+# dependency relations are determined by the #include relations between the
+# files in the directories.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DIRECTORY_GRAPH        = YES
+
+# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
+# generated by dot.
+# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
+# to make the SVG files visible in IE 9+ (other browsers do not have this
+# requirement).
+# Possible values are: png, jpg, gif and svg.
+# The default value is: png.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_IMAGE_FORMAT       = png
+
+# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
+# enable generation of interactive SVG images that allow zooming and panning.
+#
+# Note that this requires a modern browser other than Internet Explorer. Tested
+# and working are Firefox, Chrome, Safari, and Opera.
+# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
+# the SVG files visible. Older versions of IE do not have SVG support.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+INTERACTIVE_SVG        = NO
+
+# The DOT_PATH tag can be used to specify the path where the dot tool can be
+# found. If left blank, it is assumed the dot tool can be found in the path.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_PATH               =
+
+# The DOTFILE_DIRS tag can be used to specify one or more directories that
+# contain dot files that are included in the documentation (see the \dotfile
+# command).
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOTFILE_DIRS           =
+
+# The MSCFILE_DIRS tag can be used to specify one or more directories that
+# contain msc files that are included in the documentation (see the \mscfile
+# command).
+
+MSCFILE_DIRS           =
+
+# The DIAFILE_DIRS tag can be used to specify one or more directories that
+# contain dia files that are included in the documentation (see the \diafile
+# command).
+
+DIAFILE_DIRS           =
+
+# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
+# that will be shown in the graph. If the number of nodes in a graph becomes
+# larger than this value, doxygen will truncate the graph, which is visualized
+# by representing a node as a red box. Note that doxygen if the number of direct
+# children of the root node in a graph is already larger than
+# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
+# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
+# Minimum value: 0, maximum value: 10000, default value: 50.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_GRAPH_MAX_NODES    = 50
+
+# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
+# generated by dot. A depth value of 3 means that only nodes reachable from the
+# root by following a path via at most 3 edges will be shown. Nodes that lay
+# further from the root node will be omitted. Note that setting this option to 1
+# or 2 may greatly reduce the computation time needed for large code bases. Also
+# note that the size of a graph can be further restricted by
+# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
+# Minimum value: 0, maximum value: 1000, default value: 0.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+MAX_DOT_GRAPH_DEPTH    = 0
+
+# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
+# background. This is disabled by default, because dot on Windows does not seem
+# to support this out of the box.
+#
+# Warning: Depending on the platform used, enabling this option may lead to
+# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
+# read).
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_TRANSPARENT        = NO
+
+# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
+# files in one run (i.e. multiple -o and -T options on the command line). This
+# makes dot run faster, but since only newer versions of dot (>1.8.10) support
+# this, this feature is disabled by default.
+# The default value is: NO.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_MULTI_TARGETS      = NO
+
+# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
+# explaining the meaning of the various boxes and arrows in the dot generated
+# graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+GENERATE_LEGEND        = YES
+
+# If the DOT_CLEANUP tag is set to YES doxygen will remove the intermediate dot
+# files that are used to generate the various graphs.
+# The default value is: YES.
+# This tag requires that the tag HAVE_DOT is set to YES.
+
+DOT_CLEANUP            = YES
diff --git a/ps-lite/docs/Makefile b/ps-lite/docs/Makefile
new file mode 100644
index 00000000..ee2cff1e
--- /dev/null
+++ b/ps-lite/docs/Makefile
@@ -0,0 +1,216 @@
+# Makefile for Sphinx documentation
+#
+
+# You can set these variables from the command line.
+SPHINXOPTS    =
+SPHINXBUILD   = sphinx-build
+PAPER         =
+BUILDDIR      = _build
+
+# User-friendly check for sphinx-build
+ifeq ($(shell which $(SPHINXBUILD) >/dev/null 2>&1; echo $$?), 1)
+$(error The '$(SPHINXBUILD)' command was not found. Make sure you have Sphinx installed, then set the SPHINXBUILD environment variable to point to the full path of the '$(SPHINXBUILD)' executable. Alternatively you can add the directory with the executable to your PATH. If you don't have Sphinx installed, grab it from http://sphinx-doc.org/)
+endif
+
+# Internal variables.
+PAPEROPT_a4     = -D latex_paper_size=a4
+PAPEROPT_letter = -D latex_paper_size=letter
+ALLSPHINXOPTS   = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .
+# the i18n builder cannot share the environment and doctrees with the others
+I18NSPHINXOPTS  = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .
+
+.PHONY: help
+help:
+	@echo "Please use \`make <target>' where <target> is one of"
+	@echo "  html       to make standalone HTML files"
+	@echo "  dirhtml    to make HTML files named index.html in directories"
+	@echo "  singlehtml to make a single large HTML file"
+	@echo "  pickle     to make pickle files"
+	@echo "  json       to make JSON files"
+	@echo "  htmlhelp   to make HTML files and a HTML help project"
+	@echo "  qthelp     to make HTML files and a qthelp project"
+	@echo "  applehelp  to make an Apple Help Book"
+	@echo "  devhelp    to make HTML files and a Devhelp project"
+	@echo "  epub       to make an epub"
+	@echo "  latex      to make LaTeX files, you can set PAPER=a4 or PAPER=letter"
+	@echo "  latexpdf   to make LaTeX files and run them through pdflatex"
+	@echo "  latexpdfja to make LaTeX files and run them through platex/dvipdfmx"
+	@echo "  text       to make text files"
+	@echo "  man        to make manual pages"
+	@echo "  texinfo    to make Texinfo files"
+	@echo "  info       to make Texinfo files and run them through makeinfo"
+	@echo "  gettext    to make PO message catalogs"
+	@echo "  changes    to make an overview of all changed/added/deprecated items"
+	@echo "  xml        to make Docutils-native XML files"
+	@echo "  pseudoxml  to make pseudoxml-XML files for display purposes"
+	@echo "  linkcheck  to check all external links for integrity"
+	@echo "  doctest    to run all doctests embedded in the documentation (if enabled)"
+	@echo "  coverage   to run coverage check of the documentation (if enabled)"
+
+.PHONY: clean
+clean:
+	rm -rf $(BUILDDIR)/*
+
+.PHONY: html
+html:
+	$(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html
+	@echo
+	@echo "Build finished. The HTML pages are in $(BUILDDIR)/html."
+
+.PHONY: dirhtml
+dirhtml:
+	$(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml
+	@echo
+	@echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml."
+
+.PHONY: singlehtml
+singlehtml:
+	$(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml
+	@echo
+	@echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml."
+
+.PHONY: pickle
+pickle:
+	$(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle
+	@echo
+	@echo "Build finished; now you can process the pickle files."
+
+.PHONY: json
+json:
+	$(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json
+	@echo
+	@echo "Build finished; now you can process the JSON files."
+
+.PHONY: htmlhelp
+htmlhelp:
+	$(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp
+	@echo
+	@echo "Build finished; now you can run HTML Help Workshop with the" \
+	      ".hhp project file in $(BUILDDIR)/htmlhelp."
+
+.PHONY: qthelp
+qthelp:
+	$(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp
+	@echo
+	@echo "Build finished; now you can run "qcollectiongenerator" with the" \
+	      ".qhcp project file in $(BUILDDIR)/qthelp, like this:"
+	@echo "# qcollectiongenerator $(BUILDDIR)/qthelp/ps-lite.qhcp"
+	@echo "To view the help file:"
+	@echo "# assistant -collectionFile $(BUILDDIR)/qthelp/ps-lite.qhc"
+
+.PHONY: applehelp
+applehelp:
+	$(SPHINXBUILD) -b applehelp $(ALLSPHINXOPTS) $(BUILDDIR)/applehelp
+	@echo
+	@echo "Build finished. The help book is in $(BUILDDIR)/applehelp."
+	@echo "N.B. You won't be able to view it unless you put it in" \
+	      "~/Library/Documentation/Help or install it in your application" \
+	      "bundle."
+
+.PHONY: devhelp
+devhelp:
+	$(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp
+	@echo
+	@echo "Build finished."
+	@echo "To view the help file:"
+	@echo "# mkdir -p $$HOME/.local/share/devhelp/ps-lite"
+	@echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/ps-lite"
+	@echo "# devhelp"
+
+.PHONY: epub
+epub:
+	$(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub
+	@echo
+	@echo "Build finished. The epub file is in $(BUILDDIR)/epub."
+
+.PHONY: latex
+latex:
+	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
+	@echo
+	@echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex."
+	@echo "Run \`make' in that directory to run these through (pdf)latex" \
+	      "(use \`make latexpdf' here to do that automatically)."
+
+.PHONY: latexpdf
+latexpdf:
+	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
+	@echo "Running LaTeX files through pdflatex..."
+	$(MAKE) -C $(BUILDDIR)/latex all-pdf
+	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
+
+.PHONY: latexpdfja
+latexpdfja:
+	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
+	@echo "Running LaTeX files through platex and dvipdfmx..."
+	$(MAKE) -C $(BUILDDIR)/latex all-pdf-ja
+	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
+
+.PHONY: text
+text:
+	$(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text
+	@echo
+	@echo "Build finished. The text files are in $(BUILDDIR)/text."
+
+.PHONY: man
+man:
+	$(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man
+	@echo
+	@echo "Build finished. The manual pages are in $(BUILDDIR)/man."
+
+.PHONY: texinfo
+texinfo:
+	$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo
+	@echo
+	@echo "Build finished. The Texinfo files are in $(BUILDDIR)/texinfo."
+	@echo "Run \`make' in that directory to run these through makeinfo" \
+	      "(use \`make info' here to do that automatically)."
+
+.PHONY: info
+info:
+	$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo
+	@echo "Running Texinfo files through makeinfo..."
+	make -C $(BUILDDIR)/texinfo info
+	@echo "makeinfo finished; the Info files are in $(BUILDDIR)/texinfo."
+
+.PHONY: gettext
+gettext:
+	$(SPHINXBUILD) -b gettext $(I18NSPHINXOPTS) $(BUILDDIR)/locale
+	@echo
+	@echo "Build finished. The message catalogs are in $(BUILDDIR)/locale."
+
+.PHONY: changes
+changes:
+	$(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes
+	@echo
+	@echo "The overview file is in $(BUILDDIR)/changes."
+
+.PHONY: linkcheck
+linkcheck:
+	$(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck
+	@echo
+	@echo "Link check complete; look for any errors in the above output " \
+	      "or in $(BUILDDIR)/linkcheck/output.txt."
+
+.PHONY: doctest
+doctest:
+	$(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest
+	@echo "Testing of doctests in the sources finished, look at the " \
+	      "results in $(BUILDDIR)/doctest/output.txt."
+
+.PHONY: coverage
+coverage:
+	$(SPHINXBUILD) -b coverage $(ALLSPHINXOPTS) $(BUILDDIR)/coverage
+	@echo "Testing of coverage in the sources finished, look at the " \
+	      "results in $(BUILDDIR)/coverage/python.txt."
+
+.PHONY: xml
+xml:
+	$(SPHINXBUILD) -b xml $(ALLSPHINXOPTS) $(BUILDDIR)/xml
+	@echo
+	@echo "Build finished. The XML files are in $(BUILDDIR)/xml."
+
+.PHONY: pseudoxml
+pseudoxml:
+	$(SPHINXBUILD) -b pseudoxml $(ALLSPHINXOPTS) $(BUILDDIR)/pseudoxml
+	@echo
+	@echo "Build finished. The pseudo-XML files are in $(BUILDDIR)/pseudoxml."
diff --git a/ps-lite/docs/api.md b/ps-lite/docs/api.md
new file mode 100644
index 00000000..3744989e
--- /dev/null
+++ b/ps-lite/docs/api.md
@@ -0,0 +1,40 @@
+# APIs
+
+
+The data communicated are presented as key-value
+  pairs, where the key might be the `uint64_t` (defined by `ps::Key`) feature
+  index and the value might be the according `float` gradient.
+  1. Basic synchronization functions: \ref ps::KVWorker::Push, \ref
+  ps::KVWorker::Pull, and \ref ps::KVWorker::Wait
+  2. Dynamic length value push and pull: \ref ps::KVWorker::VPush and \ref
+     ps::KVWorker::VPull
+  3. Zero-copy versions: \ref ps::KVWorker::ZPush, \ref
+     ps::KVWorker::ZPull, \ref ps::KVWorker::ZVPush and \ref
+     ps::KVWorker::ZVPull
+
+
+often server *i* handles the keys (feature indices) within the i-th
+  segment of <em>[0, uint64_max]</em>. The server node allows user-defined handles to
+  process the `push` and `pull` requests from the workers.
+  1. Online key-value store \ref ps::OnlineServer
+  2. Example user-defined value: \ref ps::IVal
+  3. Example user-defined handle: \ref ps::IOnlineHandle
+
+
+
+  also We can
+  also implement
+
+, which is often used to monitor and control the
+  progress of the machine learning application. It also can be used to deal with node
+  failures. See an example in [asynchronous SGD](https://github.com/dmlc/wormhole/blob/master/learn/solver/async_sgd.h#L27).
+
+```eval_rst
+.. automodule:: ps::KVWorker
+    :members:
+```
+
+```eval_rst
+.. doxygenstruct:: ps::KVPairs
+   :members:
+```
diff --git a/ps-lite/docs/conf.py b/ps-lite/docs/conf.py
new file mode 100644
index 00000000..20c93f67
--- /dev/null
+++ b/ps-lite/docs/conf.py
@@ -0,0 +1,315 @@
+# -*- coding: utf-8 -*-
+#
+# ps-lite documentation build configuration file, created by
+# sphinx-quickstart on Sun Mar 20 20:12:23 2016.
+#
+# Mu: additional changes
+#   - add breathe into extensions
+#   - change html theme into sphinx_rtd_theme
+#   - add sphnix_util.py
+#   - add .md into source_suffix
+#   - add setup() at the end
+#
+# This file is execfile()d with the current directory set to its
+# containing dir.
+#
+# Note that not all possible configuration values are present in this
+# autogenerated file.
+#
+# All configuration values have a default; values that are commented out
+# serve to show the default.
+
+
+import sys
+import os
+
+# If extensions (or modules to document with autodoc) are in another directory,
+# add these directories to sys.path here. If the directory is relative to the
+# documentation root, use os.path.abspath to make it absolute, like shown here.
+#sys.path.insert(0, os.path.abspath('.'))
+
+# -- General configuration ------------------------------------------------
+
+# If your documentation needs a minimal Sphinx version, state it here.
+#needs_sphinx = '1.0'
+
+# Add any Sphinx extension module names here, as strings. They can be
+# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
+# ones.
+extensions = [
+    'sphinx.ext.mathjax',
+    'breathe',
+]
+
+# Add any paths that contain templates here, relative to this directory.
+templates_path = ['_templates']
+
+# The suffix(es) of source filenames.
+# You can specify multiple suffix as a list of string:
+source_suffix = ['.md']
+# source_suffix = '.rst'
+
+# The encoding of source files.
+#source_encoding = 'utf-8-sig'
+
+# The master toctree document.
+master_doc = 'index'
+
+# General information about the project.
+project = u'ps-lite'
+copyright = u'2016, ps-lite developers'
+author = u'ps-lite developers'
+
+# The version info for the project you're documenting, acts as replacement for
+# |version| and |release|, also used in various other places throughout the
+# built documents.
+#
+# The short X.Y version.
+version = u'1.0'
+# The full version, including alpha/beta/rc tags.
+release = u'1.0'
+
+# The language for content autogenerated by Sphinx. Refer to documentation
+# for a list of supported languages.
+#
+# This is also used if you do content translation via gettext catalogs.
+# Usually you set "language" from the command line for these cases.
+language = None
+
+# There are two options for replacing |today|: either, you set today to some
+# non-false value, then it is used:
+#today = ''
+# Else, today_fmt is used as the format for a strftime call.
+#today_fmt = '%B %d, %Y'
+
+# List of patterns, relative to source directory, that match files and
+# directories to ignore when looking for source files.
+exclude_patterns = ['_build']
+
+# The reST default role (used for this markup: `text`) to use for all
+# documents.
+#default_role = None
+
+# If true, '()' will be appended to :func: etc. cross-reference text.
+#add_function_parentheses = True
+
+# If true, the current module name will be prepended to all description
+# unit titles (such as .. function::).
+#add_module_names = True
+
+# If true, sectionauthor and moduleauthor directives will be shown in the
+# output. They are ignored by default.
+#show_authors = False
+
+# The name of the Pygments (syntax highlighting) style to use.
+pygments_style = 'sphinx'
+
+# A list of ignored prefixes for module index sorting.
+#modindex_common_prefix = []
+
+# If true, keep warnings as "system message" paragraphs in the built documents.
+#keep_warnings = False
+
+# If true, `todo` and `todoList` produce output, else they produce nothing.
+todo_include_todos = False
+
+
+# -- Options for HTML output ----------------------------------------------
+
+# The theme to use for HTML and HTML Help pages.  See the documentation for
+# a list of builtin themes.
+html_theme = 'sphinx_rtd_theme'
+
+# Theme options are theme-specific and customize the look and feel of a theme
+# further.  For a list of options available for each theme, see the
+# documentation.
+#html_theme_options = {}
+
+# Add any paths that contain custom themes here, relative to this directory.
+#html_theme_path = []
+
+# The name for this set of Sphinx documents.  If None, it defaults to
+# "<project> v<release> documentation".
+#html_title = None
+
+# A shorter title for the navigation bar.  Default is the same as html_title.
+#html_short_title = None
+
+# The name of an image file (relative to this directory) to place at the top
+# of the sidebar.
+#html_logo = None
+
+# The name of an image file (relative to this directory) to use as a favicon of
+# the docs.  This file should be a Windows icon file (.ico) being 16x16 or 32x32
+# pixels large.
+#html_favicon = None
+
+# Add any paths that contain custom static files (such as style sheets) here,
+# relative to this directory. They are copied after the builtin static files,
+# so a file named "default.css" will overwrite the builtin "default.css".
+html_static_path = ['_static']
+
+# Add any extra paths that contain custom files (such as robots.txt or
+# .htaccess) here, relative to this directory. These files are copied
+# directly to the root of the documentation.
+#html_extra_path = []
+
+# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
+# using the given strftime format.
+#html_last_updated_fmt = '%b %d, %Y'
+
+# If true, SmartyPants will be used to convert quotes and dashes to
+# typographically correct entities.
+#html_use_smartypants = True
+
+# Custom sidebar templates, maps document names to template names.
+#html_sidebars = {}
+
+# Additional templates that should be rendered to pages, maps page names to
+# template names.
+#html_additional_pages = {}
+
+# If false, no module index is generated.
+#html_domain_indices = True
+
+# If false, no index is generated.
+#html_use_index = True
+
+# If true, the index is split into individual pages for each letter.
+#html_split_index = False
+
+# If true, links to the reST sources are added to the pages.
+#html_show_sourcelink = True
+
+# If true, "Created using Sphinx" is shown in the HTML footer. Default is True.
+#html_show_sphinx = True
+
+# If true, "(C) Copyright ..." is shown in the HTML footer. Default is True.
+#html_show_copyright = True
+
+# If true, an OpenSearch description file will be output, and all pages will
+# contain a <link> tag referring to it.  The value of this option must be the
+# base URL from which the finished HTML is served.
+#html_use_opensearch = ''
+
+# This is the file name suffix for HTML files (e.g. ".xhtml").
+#html_file_suffix = None
+
+# Language to be used for generating the HTML full-text search index.
+# Sphinx supports the following languages:
+#   'da', 'de', 'en', 'es', 'fi', 'fr', 'hu', 'it', 'ja'
+#   'nl', 'no', 'pt', 'ro', 'ru', 'sv', 'tr'
+#html_search_language = 'en'
+
+# A dictionary with options for the search language support, empty by default.
+# Now only 'ja' uses this config value
+#html_search_options = {'type': 'default'}
+
+# The name of a javascript file (relative to the configuration directory) that
+# implements a search results scorer. If empty, the default will be used.
+#html_search_scorer = 'scorer.js'
+
+# Output file base name for HTML help builder.
+htmlhelp_basename = 'ps-litedoc'
+
+# -- Options for LaTeX output ---------------------------------------------
+
+latex_elements = {
+# The paper size ('letterpaper' or 'a4paper').
+#'papersize': 'letterpaper',
+
+# The font size ('10pt', '11pt' or '12pt').
+#'pointsize': '10pt',
+
+# Additional stuff for the LaTeX preamble.
+#'preamble': '',
+
+# Latex figure (float) alignment
+#'figure_align': 'htbp',
+}
+
+# Grouping the document tree into LaTeX files. List of tuples
+# (source start file, target name, title,
+#  author, documentclass [howto, manual, or own class]).
+latex_documents = [
+    (master_doc, 'ps-lite.tex', u'ps-lite Documentation',
+     u'ps-lite developers', 'manual'),
+]
+
+# The name of an image file (relative to this directory) to place at the top of
+# the title page.
+#latex_logo = None
+
+# For "manual" documents, if this is true, then toplevel headings are parts,
+# not chapters.
+#latex_use_parts = False
+
+# If true, show page references after internal links.
+#latex_show_pagerefs = False
+
+# If true, show URL addresses after external links.
+#latex_show_urls = False
+
+# Documents to append as an appendix to all manuals.
+#latex_appendices = []
+
+# If false, no module index is generated.
+#latex_domain_indices = True
+
+
+# -- Options for manual page output ---------------------------------------
+
+# One entry per manual page. List of tuples
+# (source start file, name, description, authors, manual section).
+man_pages = [
+    (master_doc, 'ps-lite', u'ps-lite Documentation',
+     [author], 1)
+]
+
+# If true, show URL addresses after external links.
+#man_show_urls = False
+
+
+# -- Options for Texinfo output -------------------------------------------
+
+# Grouping the document tree into Texinfo files. List of tuples
+# (source start file, target name, title, author,
+#  dir menu entry, description, category)
+texinfo_documents = [
+    (master_doc, 'ps-lite', u'ps-lite Documentation',
+     author, 'ps-lite', 'One line description of project.',
+     'Miscellaneous'),
+]
+
+# Documents to append as an appendix to all manuals.
+#texinfo_appendices = []
+
+# If false, no module index is generated.
+#texinfo_domain_indices = True
+
+# How to display URL addresses: 'footnote', 'no', or 'inline'.
+#texinfo_show_urls = 'footnote'
+
+# If true, do not generate a @detailmenu in the "Top" node's menu.
+#texinfo_no_detailmenu = False
+
+curr_path = os.path.dirname(os.path.abspath(os.path.expanduser(__file__)))
+sys.path.insert(0, curr_path)
+from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml
+
+MarkdownParser.github_doc_root = 'https://github.com/dmlc/ps-lite/tree/master/'
+source_parsers = {
+    '.md': MarkdownParser,
+    '.Rmd': MarkdownParser,
+}
+
+breathe_projects = {'ps-lite' : 'xml/'}
+breathe_default_project = 'ps-lite'
+
+doc_root = 'http://dmlc.ml'
+def setup(app):
+    app.connect("builder-inited", generate_doxygen_xml)
+    app.add_config_value('recommonmark_config', {
+            'url_resolver': lambda url: doc_root + url,
+            }, True)
+    app.add_transform(AutoStructify)
diff --git a/ps-lite/docs/env.md b/ps-lite/docs/env.md
new file mode 100644
index 00000000..758c77b6
--- /dev/null
+++ b/ps-lite/docs/env.md
@@ -0,0 +1,15 @@
+# environment variables
+
+The variables must be set for starting
+
+- `DMLC_NUM_WORKER` : the number of workers
+- `DMLC_NUM_SERVER` : the number of servers
+- `DMLC_ROLE` : the role of the current node, can be `worker`, `server`, or `scheduler`
+- `DMLC_PS_ROOT_URI` : the ip or hostname of the scheduler node
+- `DMLC_PS_ROOT_PORT` : the port that the scheduler node is listening
+
+additional variables:
+
+- `DMLC_INTERFACE` : the network interface a node should use. in default choose
+  automatically
+- `DMLC_LOCAL` : runs in local machines, no network is needed
diff --git a/ps-lite/docs/get_started.md b/ps-lite/docs/get_started.md
new file mode 100644
index 00000000..7e0bdcaa
--- /dev/null
+++ b/ps-lite/docs/get_started.md
@@ -0,0 +1 @@
+# Get Started
diff --git a/ps-lite/docs/how_to.md b/ps-lite/docs/how_to.md
new file mode 100644
index 00000000..f5f7e435
--- /dev/null
+++ b/ps-lite/docs/how_to.md
@@ -0,0 +1,74 @@
+# How To
+
+## Debug PS-Lite
+
+One way to debug is loggining all communications. We can do it by specifying
+the environment variable `PS_VERBOSE`:
+- `PS_VERBOSE=1`: logging connection information
+- `PS_VERBOSE=2`: logging all data communication information
+
+For example, first run `make test; cd tests` in the root directory. Then
+```bash
+export PS_VERBOSE=1; ./local.sh 1 1 ./test_connection
+```
+Possible outputs are
+```bash
+[19:57:18] src/van.cc:72: Node Info: role=schedulerid=1, ip=127.0.0.1, port=8000
+[19:57:18] src/van.cc:72: Node Info: role=worker, ip=128.2.211.110, port=58442
+[19:57:18] src/van.cc:72: Node Info: role=server, ip=128.2.211.110, port=40112
+[19:57:18] src/van.cc:336: assign rank=8 to node role=server, ip=128.2.211.110, port=40112
+[19:57:18] src/van.cc:336: assign rank=9 to node role=worker, ip=128.2.211.110, port=58442
+[19:57:18] src/van.cc:347: the scheduler is connected to 1 workers and 1 servers
+[19:57:18] src/van.cc:354: S[8] is connected to others
+[19:57:18] src/van.cc:354: W[9] is connected to others
+[19:57:18] src/van.cc:296: H[1] is stopped
+[19:57:18] src/van.cc:296: S[8] is stopped
+[19:57:18] src/van.cc:296: W[9] is stopped
+```
+where `H`, `S` and `W` stand for scheduler, server, and worker respectively.
+
+## Use a Particular Network Interface
+
+In default PS-Lite automatically chooses an available network interface. But for
+machines have multiple interfaces, we can specify the network interface to use
+by the environment variable `DMLC_INTERFACE`. For example, to use the
+infinite-band interface `ib0`, we can
+```bash
+export DMLC_INTERFACE=ib0; commands_to_run
+```
+
+If all PS-Lite nodes run in the same machine, we can set `DMLC_LOCAL` to use
+memory copy rather than the local network interface, which may improve the
+performance:
+```bash
+export DMLC_LOCAL=1; commands_to_run
+```
+
+## Environment Variables to Start PS-Lite
+
+This section is useful if we want to port PS-Lite to other cluster resource
+managers besides the provided ones such as `ssh`, `mpirun`, `yarn` and `sge`.
+
+To start a PS-Lite node, we need to give proper values to the following
+environment variables.
+- `DMLC_NUM_WORKER` : the number of workers
+- `DMLC_NUM_SERVER` : the number of servers
+- `DMLC_ROLE` : the role of the current node, can be `worker`, `server`, or `scheduler`
+- `DMLC_PS_ROOT_URI` : the ip or hostname of the scheduler node
+- `DMLC_PS_ROOT_PORT` : the port that the scheduler node is listening
+
+## Retransmission for Unreliable Network
+
+It's not uncommon that a message disappear when sending from one node to another
+node. The program hangs when a critical message is not delivered
+successfully. In that case, we can let PS-Lite send an additional ACK for each
+message, and resend that message if the ACK is not received within a given
+time. To enable this feature, we can set the environment variables
+
+- `PS_RESEND` : if or not enable retransmission. Default is 0.
+- `PS_RESEND_TIMEOUT` : timeout in millisecond if an ACK message if not
+  received. PS-Lite then will resend that message. Default is 1000.
+
+We can set `PS_DROP_MSG`, the percent of probability to drop a received
+message, for testing. For example, `PS_DROP_MSG=10` will let a node drop a
+received message with 10% probability.
diff --git a/ps-lite/docs/index.md b/ps-lite/docs/index.md
new file mode 100644
index 00000000..d0ac46ed
--- /dev/null
+++ b/ps-lite/docs/index.md
@@ -0,0 +1,16 @@
+# PS-Lite Documents
+
+PS-Lite is a lightweight implementation of the parameter server.  It provides
+asynchronous and zero-copy key-value pair communications between machines.
+
+
+```eval_rst
+.. toctree::
+   :numbered:
+
+   overview
+   get_started
+   tutorials
+   how_to
+   api
+```
diff --git a/ps-lite/docs/overview.md b/ps-lite/docs/overview.md
new file mode 100644
index 00000000..28b79e37
--- /dev/null
+++ b/ps-lite/docs/overview.md
@@ -0,0 +1,184 @@
+# Overview
+
+The parameter server aims for high-performance distributed machine learning
+applications. In this framework, multiple nodes runs over multiple machines to
+solve machine learning problems.
+There are often a single schedule node, and several worker and servers nodes.
+
+![ps arch](https://raw.githubusercontent.com/dmlc/dmlc.github.io/master/img/ps-arch.png)
+
+- **Worker**. A worker node performs the main computations such as reading the data and
+  computing the gradient. It communicates with the server nodes via `push` and
+  `pull`. For example, it pushes the computed gradient to the servers, or pulls
+  the recent model from them.
+
+- **Server.** A server node maintains and updates the model weights. Each node maintains only a part
+  of the model.
+
+- **Scheduler.** The scheduler node monitors the aliveness of other nodes. It can
+  be also used to send control signals to other nodes and collect their
+  progress.
+
+
+## Distributed Optimization
+
+Assume we are going to solve the following
+```eval_rst
+.. math::
+  \min_w \sum_{i=1}^n f(x_i, y_i, w)
+```
+where *(y<sub>i</sub>, x<sub>i</sub>)* are example pairs and *w* is the weight.
+
+We consider solve the above problem by minibatch stochastic gradient descent
+(SGD) with batch size *b*. At time *t*, this algorithm first randomly picks up
+*b* examples, and then updates the weight *w* by
+```eval_rst
+.. math::
+  w = w - \eta_t \sum_{i=1}^b \nabla f(x_{k_i}, y_{k_i}, w)
+```
+
+We give two examples to illusrate the basic idea of how to implement a
+distributed optimization algorithm in ps-lite.
+
+### Asynchronous SGD
+
+In the first example, we extend SGD into asynchronous SGD.  We let the servers
+maintain *w*, where server *k* gets the *k*-th segment of *w*, denoted by
+*w<sub>k<\sub>*. Once received gradient from a worker, the server *k* will
+update the weight it maintained:
+
+```c++
+t = 0;
+while (Received(&grad)) {
+  w_k -= eta(t) * grad;
+  t++;
+}
+```
+where the function `received` returns if received gradient from any worker
+node, and `eta` returns the learning rate at time *t*.
+
+While for a worker, each time it dose four things
+
+```c++
+Read(&X, &Y);  // read a minibatch X and Y
+Pull(&w);      // pull the recent weight from the servers
+ComputeGrad(X, Y, w, &grad);  // compute the gradient
+Push(grad);    // push the gradients to the servers
+```
+where ps-lite will provide function `push` and `pull` which will communicate
+with servers with the right part of data.
+
+Note that asynchronous SGD is semantically different the single machine
+version. Since there is no communication between workers, so it is possible that
+the weight is updated while one worker is calculating the gradients. In other
+words, each worker may used the **delayed** weights. The following figure
+shows the communication with 2 server nodes and 3 worker nodes.
+
+<img src="https://raw.githubusercontent.com/dmlc/web-data/master/ps-lite/async_sgd.png"  width=500 />
+
+
+### Synchronized SGD
+
+Different to the asynchronous version, now we consider a synchronized version,
+which is semantically identical to the single machine algorithm. We use the
+scheduler to manage the data synchronization
+
+```c++
+for (t = 0, t < num_iteration; ++t) {
+  for (i = 0; i < num_worker; ++i) {
+     IssueComputeGrad(i, t);
+  }
+  for (i = 0; i < num_server; ++i) {
+     IssueUpdateWeight(i, t);
+  }
+  WaitAllFinished();
+}
+```
+
+where `IssueComputeGrad` and `IssueUpdateWeight` issue commands to worker and
+servers, while `WaitAllFinished` wait until all issued commands are finished.
+
+When worker received a command, it executes the following function,
+```c++
+ExecComputeGrad(i, t) {
+   Read(&X, &Y);  // read minibatch with b / num_workers examples
+   Pull(&w);      // pull the recent weight from the servers
+   ComputeGrad(X, Y, w, &grad);  // compute the gradient
+   Push(grad);    // push the gradients to the servers
+}
+```
+which is almost identical to asynchronous SGD but only *b/num_workers* examples
+are processed each time.
+
+While for a server node, it has an additional aggregation step comparing to
+asynchronous SGD
+
+```c++
+ExecUpdateWeight(i, t) {
+   for (j = 0; j < num_workers; ++j) {
+      Receive(&grad);
+      aggregated_grad += grad;
+   }
+   w_i -= eta(t) * aggregated_grad;
+}
+```
+
+### Which one to use?
+
+Comparing to a single machine algorithm, the distributed algorithms have two
+additional costs, one is the data communication cost, namely sending data over
+the network; the other one is synchronization cost due to the imperfect load
+balance and performance variance cross machines. These two costs may dominate
+the performance for large scale applications with hundreds of machines and
+terabytes of data.
+
+Assume denotations:
+```eval_rst
+======================== ===
+:math:`{f}`              convex function
+:math:`{n}`              number of examples
+:math:`{m}`              number of workers
+:math:`{b}`              minibatch size
+:math:`{\tau}`           maximal delay
+:math:`T_{\text{comm}}`  data communication overhead of one minibatch
+:math:`T_{\text{sync}}`  synchronization overhead
+======================== ===
+```
+
+The trade-offs are summarized by
+```eval_rst
+============ ========================= ===================
+SGD          slowdown of convergence   additional overhead
+============ ========================= ===================
+synchronized  :math:`\sqrt{b}`         :math:`\frac {n}b (T_{\text{comm}} + T_{\textrm{sync}})`
+asynchronous  :math:`\sqrt{b\tau}`     :math:`\frac n{mb} T_{\textrm{comm}}`
+============ ========================= ===================
+```
+
+What we can see are
+- the minibatch size trade-offs the convergence and communication cost
+- the maximal allowed delay trade-offs the convergence and synchronization
+  cost. In synchronized SGD, we have *τ=0* and therefore it suffers a large
+  synchronization cost. While asynchronous SGD uses an infinite *τ* to eliminate
+  this cost. In practice, an infinite *τ* is unlikely happens. But we also place
+  a upper bound of *τ* to guarantee the convergence with some synchronization
+  costs.
+
+## Further Reads
+
+Distributed optimization algorithm is an active research topic these years. To
+name some of them
+
+- [Dean, NIPS'13](), [Li, OSDI'14]() The parameter server architecture
+- [Langford, NIPS'09](https://papers.nips.cc/paper/3888-slow-learners-are-fast.pdf),
+  [Agarwal, NIPS'11](http://arxiv.org/pdf/1104.5525.pdf) theoretical convergence
+  of asynchronous SGD
+- [Li, NIPS'14](http://www.cs.cmu.edu/~muli/file/parameter_server_nips14.pdf)
+  trade-offs with bounded maximal delays *τ*
+- [Li, KDD'14](http://www.cs.cmu.edu/~muli/file/minibatch_sgd.pdf) improves the
+  convergence rate with large minibatch size *b*
+- [Sra, AISTATS'16](http://arxiv.org/abs/1508.05003) asynchronous SGD adaptive
+  to the actually delay rather than the worst maximal delay
+- [Li, WSDM'16](http://www.cs.cmu.edu/~yuxiangw/docs/fm.pdf) practical
+  considerations for asynchronous SGD with the parameter server
+- [Chen, LearningSys'16]() synchronized SGD for deep learning.
diff --git a/ps-lite/docs/requirements.txt b/ps-lite/docs/requirements.txt
new file mode 100644
index 00000000..cd6467ed
--- /dev/null
+++ b/ps-lite/docs/requirements.txt
@@ -0,0 +1 @@
+breathe
diff --git a/ps-lite/docs/sphinx_util.py b/ps-lite/docs/sphinx_util.py
new file mode 100644
index 00000000..414dc594
--- /dev/null
+++ b/ps-lite/docs/sphinx_util.py
@@ -0,0 +1,19 @@
+import sys, os, subprocess
+
+
+if not os.path.exists('../recommonmark'):
+    subprocess.call('cd ..; git clone https://github.com/tqchen/recommonmark', shell = True)
+else:
+    subprocess.call('cd ../recommonmark; git pull', shell=True)
+
+sys.path.insert(0, os.path.abspath('../recommonmark/'))
+
+from recommonmark import parser, transform
+MarkdownParser = parser.CommonMarkParser
+AutoStructify = transform.AutoStructify
+
+# MarkdownParser.github_doc_root = github_doc_root
+
+def generate_doxygen_xml(app):
+    """Run the doxygen make commands"""
+    subprocess.call('doxygen')
diff --git a/ps-lite/docs/tutorials.md b/ps-lite/docs/tutorials.md
new file mode 100644
index 00000000..81c8590f
--- /dev/null
+++ b/ps-lite/docs/tutorials.md
@@ -0,0 +1 @@
+# Tutorials
diff --git a/ps-lite/include/dmlc/base.h b/ps-lite/include/dmlc/base.h
new file mode 100644
index 00000000..f3ae0fe8
--- /dev/null
+++ b/ps-lite/include/dmlc/base.h
@@ -0,0 +1,178 @@
+/*!
+ *  Copyright (c) 2015 by Contributors
+ * \file base.h
+ * \brief defines configuration macros
+ */
+#ifndef DMLC_BASE_H_
+#define DMLC_BASE_H_
+
+/*! \brief whether use glog for logging */
+#ifndef DMLC_USE_GLOG
+#define DMLC_USE_GLOG 0
+#endif
+
+/*!
+ * \brief whether throw dmlc::Error instead of
+ *  directly calling abort when FATAL error occured
+ *  NOTE: this may still not be perfect.
+ *  do not use FATAL and CHECK in destructors
+ */
+#ifndef DMLC_LOG_FATAL_THROW
+#define DMLC_LOG_FATAL_THROW 1
+#endif
+
+/*! \brief whether compile with hdfs support */
+#ifndef DMLC_USE_HDFS
+#define DMLC_USE_HDFS 0
+#endif
+
+/*! \brief whether compile with s3 support */
+#ifndef DMLC_USE_S3
+#define DMLC_USE_S3 0
+#endif
+
+/*! \brief whether or not use parameter server */
+#ifndef DMLC_USE_PS
+#define DMLC_USE_PS 0
+#endif
+
+/*! \brief whether or not use c++11 support */
+#ifndef DMLC_USE_CXX11
+#define DMLC_USE_CXX11 (defined(__GXX_EXPERIMENTAL_CXX0X__) ||\
+                        __cplusplus >= 201103L || defined(_MSC_VER))
+#endif
+
+/// check if g++ is before 4.6
+#if DMLC_USE_CXX11 && defined(__GNUC__) && !defined(__clang_version__)
+#if __GNUC__ == 4 && __GNUC_MINOR__ < 6
+#pragma message("Will need g++-4.6 or higher to compile all"           \
+                "the features in dmlc-core, "                           \
+                "compile without c++0x, some features may be disabled")
+#undef DMLC_USE_CXX11
+#define DMLC_USE_CXX11 0
+#endif
+#endif
+
+/*!
+ * \brief Disable copy constructor and assignment operator.
+ *
+ * If C++11 is supported, both copy and move constructors and
+ * assignment operators are deleted explicitly. Otherwise, they are
+ * only declared but not implemented. Place this macro in private
+ * section if C++11 is not available.
+ */
+#ifndef DISALLOW_COPY_AND_ASSIGN
+#  if DMLC_USE_CXX11
+#    define DISALLOW_COPY_AND_ASSIGN(T) \
+       T(T const&) = delete; \
+       T(T&&) = delete; \
+       T& operator=(T const&) = delete; \
+       T& operator=(T&&) = delete
+#  else
+#    define DISALLOW_COPY_AND_ASSIGN(T) \
+       T(T const&); \
+       T& operator=(T const&)
+#  endif
+#endif
+
+///
+/// code block to handle optionally loading
+///
+#if !defined(__GNUC__)
+#define fopen64 std::fopen
+#endif
+#ifdef _MSC_VER
+#if _MSC_VER < 1900
+// NOTE: sprintf_s is not equivalent to snprintf,
+// they are equivalent when success, which is sufficient for our case
+#define snprintf sprintf_s
+#define vsnprintf vsprintf_s
+#endif
+#else
+#ifdef _FILE_OFFSET_BITS
+#if _FILE_OFFSET_BITS == 32
+#pragma message("Warning: FILE OFFSET BITS defined to be 32 bit")
+#endif
+#endif
+
+#ifdef __APPLE__
+#define off64_t off_t
+#define fopen64 std::fopen
+#endif
+
+extern "C" {
+#include <sys/types.h>
+}
+#endif
+
+#ifdef _MSC_VER
+//! \cond Doxygen_Suppress
+typedef signed char int8_t;
+typedef __int16 int16_t;
+typedef __int32 int32_t;
+typedef __int64 int64_t;
+typedef unsigned char uint8_t;
+typedef unsigned __int16 uint16_t;
+typedef unsigned __int32 uint32_t;
+typedef unsigned __int64 uint64_t;
+//! \endcond
+#else
+#include <inttypes.h>
+#endif
+#include <string>
+#include <vector>
+
+/*! \brief namespace for dmlc */
+namespace dmlc {
+/*!
+ * \brief safely get the beginning address of a vector
+ * \param vec input vector
+ * \return beginning address of a vector
+ */
+template<typename T>
+inline T *BeginPtr(std::vector<T> &vec) {  // NOLINT(*)
+  if (vec.size() == 0) {
+    return NULL;
+  } else {
+    return &vec[0];
+  }
+}
+/*!
+ * \brief get the beginning address of a vector
+ * \param vec input vector
+ * \return beginning address of a vector
+ */
+template<typename T>
+inline const T *BeginPtr(const std::vector<T> &vec) {
+  if (vec.size() == 0) {
+    return NULL;
+  } else {
+    return &vec[0];
+  }
+}
+/*!
+ * \brief get the beginning address of a vector
+ * \param str input string
+ * \return beginning address of a string
+ */
+inline char* BeginPtr(std::string &str) {  // NOLINT(*)
+  if (str.length() == 0) return NULL;
+  return &str[0];
+}
+/*!
+ * \brief get the beginning address of a vector
+ * \param str input string
+ * \return beginning address of a string
+ */
+inline const char* BeginPtr(const std::string &str) {
+  if (str.length() == 0) return NULL;
+  return &str[0];
+}
+}  // namespace dmlc
+
+#if defined(_MSC_VER) && _MSC_VER < 1900
+#define constexpr const
+#define alignof __alignof
+#endif
+
+#endif  // DMLC_BASE_H_
diff --git a/ps-lite/include/dmlc/logging.h b/ps-lite/include/dmlc/logging.h
new file mode 100644
index 00000000..2ad530ff
--- /dev/null
+++ b/ps-lite/include/dmlc/logging.h
@@ -0,0 +1,234 @@
+/*!
+ *  Copyright (c) 2015 by Contributors
+ * \file logging.h
+ * \brief defines logging macros of dmlc
+ *  allows use of GLOG, fall back to internal
+ *  implementation when disabled
+ */
+#ifndef DMLC_LOGGING_H_
+#define DMLC_LOGGING_H_
+#include <cstdio>
+#include <cstdlib>
+#include <string>
+#include <vector>
+#include <stdexcept>
+#include "./base.h"
+
+namespace dmlc {
+/*!
+ * \brief exception class that will be thrown by
+ *  default logger if DMLC_LOG_FATAL_THROW == 1
+ */
+struct Error : public std::runtime_error {
+  /*!
+   * \brief constructor
+   * \param s the error message
+   */
+  explicit Error(const std::string &s) : std::runtime_error(s) {}
+};
+}  // namespace dmlc
+
+#if defined(_MSC_VER) && _MSC_VER < 1900
+#define noexcept(a)
+#endif
+
+#if DMLC_USE_CXX11
+#define DMLC_THROW_EXCEPTION noexcept(false)
+#else
+#define DMLC_THROW_EXCEPTION
+#endif
+
+#if DMLC_USE_GLOG
+#include <glog/logging.h>
+
+namespace dmlc {
+inline void InitLogging(const char* argv0) {
+  google::InitGoogleLogging(argv0);
+}
+}  // namespace dmlc
+
+#else
+// use a light version of glog
+#include <assert.h>
+#include <iostream>
+#include <sstream>
+#include <ctime>
+
+#if defined(_MSC_VER)
+#pragma warning(disable : 4722)
+#endif
+
+namespace dmlc {
+inline void InitLogging(const char* argv0) {
+  // DO NOTHING
+}
+
+// Always-on checking
+#define CHECK(x)                                           \
+  if (!(x))                                                \
+    dmlc::LogMessageFatal(__FILE__, __LINE__).stream() << "Check "  \
+      "failed: " #x << ' '
+#define CHECK_LT(x, y) CHECK((x) < (y))
+#define CHECK_GT(x, y) CHECK((x) > (y))
+#define CHECK_LE(x, y) CHECK((x) <= (y))
+#define CHECK_GE(x, y) CHECK((x) >= (y))
+#define CHECK_EQ(x, y) CHECK((x) == (y))
+#define CHECK_NE(x, y) CHECK((x) != (y))
+#define CHECK_NOTNULL(x) \
+  ((x) == NULL ? dmlc::LogMessageFatal(__FILE__, __LINE__).stream() << "Check  notnull: "  #x << ' ', (x) : (x)) // NOLINT(*)
+// Debug-only checking.
+#ifdef NDEBUG
+#define DCHECK(x) \
+  while (false) CHECK(x)
+#define DCHECK_LT(x, y) \
+  while (false) CHECK((x) < (y))
+#define DCHECK_GT(x, y) \
+  while (false) CHECK((x) > (y))
+#define DCHECK_LE(x, y) \
+  while (false) CHECK((x) <= (y))
+#define DCHECK_GE(x, y) \
+  while (false) CHECK((x) >= (y))
+#define DCHECK_EQ(x, y) \
+  while (false) CHECK((x) == (y))
+#define DCHECK_NE(x, y) \
+  while (false) CHECK((x) != (y))
+#else
+#define DCHECK(x) CHECK(x)
+#define DCHECK_LT(x, y) CHECK((x) < (y))
+#define DCHECK_GT(x, y) CHECK((x) > (y))
+#define DCHECK_LE(x, y) CHECK((x) <= (y))
+#define DCHECK_GE(x, y) CHECK((x) >= (y))
+#define DCHECK_EQ(x, y) CHECK((x) == (y))
+#define DCHECK_NE(x, y) CHECK((x) != (y))
+#endif  // NDEBUG
+
+#define LOG_INFO dmlc::LogMessage(__FILE__, __LINE__)
+#define LOG_ERROR LOG_INFO
+#define LOG_WARNING LOG_INFO
+#define LOG_FATAL dmlc::LogMessageFatal(__FILE__, __LINE__)
+#define LOG_QFATAL LOG_FATAL
+
+// Poor man version of VLOG
+#define VLOG(x) LOG_INFO.stream()
+
+#define LOG(severity) LOG_##severity.stream()
+#define LG LOG_INFO.stream()
+#define LOG_IF(severity, condition) \
+  !(condition) ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
+
+#ifdef NDEBUG
+#define LOG_DFATAL LOG_ERROR
+#define DFATAL ERROR
+#define DLOG(severity) true ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
+#define DLOG_IF(severity, condition) \
+  (true || !(condition)) ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
+#else
+#define LOG_DFATAL LOG_FATAL
+#define DFATAL FATAL
+#define DLOG(severity) LOG(severity)
+#define DLOG_IF(severity, condition) LOG_IF(severity, condition)
+#endif
+
+// Poor man version of LOG_EVERY_N
+#define LOG_EVERY_N(severity, n) LOG(severity)
+
+class DateLogger {
+ public:
+  DateLogger() {
+#if defined(_MSC_VER)
+    _tzset();
+#endif
+  }
+  const char* HumanDate() {
+#if defined(_MSC_VER)
+    _strtime_s(buffer_, sizeof(buffer_));
+#else
+    time_t time_value = time(NULL);
+    struct tm now;
+    localtime_r(&time_value, &now);
+    snprintf(buffer_, sizeof(buffer_), "%02d:%02d:%02d", now.tm_hour,
+             now.tm_min, now.tm_sec);
+#endif
+    return buffer_;
+  }
+ private:
+  char buffer_[9];
+};
+
+class LogMessage {
+ public:
+  LogMessage(const char* file, int line)
+      :
+#ifdef __ANDROID__
+        log_stream_(std::cout)
+#else
+        log_stream_(std::cerr)
+#endif
+  {
+    log_stream_ << "[" << pretty_date_.HumanDate() << "] " << file << ":"
+                << line << ": ";
+  }
+  ~LogMessage() { log_stream_ << "\n"; }
+  std::ostream& stream() { return log_stream_; }
+
+ protected:
+  std::ostream& log_stream_;
+
+ private:
+  DateLogger pretty_date_;
+  LogMessage(const LogMessage&);
+  void operator=(const LogMessage&);
+};
+
+#if DMLC_LOG_FATAL_THROW == 0
+class LogMessageFatal : public LogMessage {
+ public:
+  LogMessageFatal(const char* file, int line) : LogMessage(file, line) {}
+  ~LogMessageFatal() {
+    log_stream_ << "\n";
+    abort();
+  }
+
+ private:
+  LogMessageFatal(const LogMessageFatal&);
+  void operator=(const LogMessageFatal&);
+};
+#else
+class LogMessageFatal {
+ public:
+  LogMessageFatal(const char* file, int line) {
+    log_stream_ << "[" << pretty_date_.HumanDate() << "] " << file << ":"
+                << line << ": ";
+  }
+  std::ostringstream &stream() { return log_stream_; }
+  ~LogMessageFatal() DMLC_THROW_EXCEPTION {
+    // throwing out of destructor is evil
+    // hopefully we can do it here
+    // also log the message before throw
+    LOG(ERROR) << log_stream_.str();
+    throw Error(log_stream_.str());
+  }
+
+ private:
+  std::ostringstream log_stream_;
+  DateLogger pretty_date_;
+  LogMessageFatal(const LogMessageFatal&);
+  void operator=(const LogMessageFatal&);
+};
+#endif
+
+// This class is used to explicitly ignore values in the conditional
+// logging macros.  This avoids compiler warnings like "value computed
+// is not used" and "statement has no effect".
+class LogMessageVoidify {
+ public:
+  LogMessageVoidify() {}
+  // This has to be an operator with a precedence lower than << but
+  // higher than "?:". See its usage.
+  void operator&(std::ostream&) {}
+};
+
+}  // namespace dmlc
+
+#endif
+#endif  // DMLC_LOGGING_H_
diff --git a/ps-lite/include/ps/base.h b/ps-lite/include/ps/base.h
new file mode 100644
index 00000000..a18b62ce
--- /dev/null
+++ b/ps-lite/include/ps/base.h
@@ -0,0 +1,33 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_BASE_H_
+#define PS_BASE_H_
+#include <limits>
+#include "ps/internal/utils.h"
+namespace ps {
+
+#if USE_KEY32
+/*! \brief Use unsigned 32-bit int as the key type */
+using Key = uint32_t;
+#else
+/*! \brief Use unsigned 64-bit int as the key type */
+using Key = uint64_t;
+#endif
+/*! \brief The maximal allowed key value */
+static const Key kMaxKey = std::numeric_limits<Key>::max();
+/** \brief node ID for the scheduler */
+static const int kScheduler = 1;
+/**
+ * \brief the server node group ID
+ *
+ * group id can be combined:
+ * - kServerGroup + kScheduler means all server nodes and the scheuduler
+ * - kServerGroup + kWorkerGroup means all server and worker nodes
+ */
+static const int kServerGroup = 2;
+/** \brief the worker node group ID */
+static const int kWorkerGroup = 4;
+
+}  // namespace ps
+#endif  // PS_BASE_H_
diff --git a/ps-lite/include/ps/internal/assign_op.h b/ps-lite/include/ps/internal/assign_op.h
new file mode 100644
index 00000000..834f523e
--- /dev/null
+++ b/ps-lite/include/ps/internal/assign_op.h
@@ -0,0 +1,72 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ * \file   assign_op.h
+ * \brief  assignment operator
+ * http://en.cppreference.com/w/cpp/language/operator_assignment
+ */
+#ifndef PS_INTERNAL_ASSIGN_OP_H_
+#define PS_INTERNAL_ASSIGN_OP_H_
+#include "ps/internal/utils.h"
+namespace ps {
+
+enum AssignOp {
+  ASSIGN,  // a = b
+  PLUS,    // a += b
+  MINUS,   // a -= b
+  TIMES,   // a *= b
+  DIVIDE,  // a -= b
+  AND,     // a &= b
+  OR,      // a |= b
+  XOR      // a ^= b
+};
+
+/**
+ * \brief return an assignment function: right op= left
+ */
+template<typename T>
+inline void AssignFunc(const T& lhs, AssignOp op, T* rhs) {
+  switch (op) {
+    case ASSIGN:
+      *right = left; break;
+    case PLUS:
+      *right += left; break;
+    case MINUS:
+      *right -= left; break;
+    case TIMES:
+      *right *= left; break;
+    case DIVIDE:
+      *right /= left; break;
+    default:
+      LOG(FATAL) << "use AssignOpInt..";
+  }
+}
+
+/**
+ * \brief return an assignment function including bit operations, only
+ * works for integers
+ */
+template<typename T>
+inline void AssignFuncInt(const T& lhs, AssignOp op, T* rhs) {
+  switch (op) {
+    case ASSIGN:
+      *right = left; break;
+    case PLUS:
+      *right += left; break;
+    case MINUS:
+      *right -= left; break;
+    case TIMES:
+      *right *= left; break;
+    case DIVIDE:
+      *right /= left; break;
+    case AND:
+      *right &= left; break;
+    case OR:
+      *right |= left; break;
+    case XOR:
+      *right ^= left; break;
+  }
+}
+
+
+}  // namespace ps
+#endif  // PS_INTERNAL_ASSIGN_OP_H_
diff --git a/ps-lite/include/ps/internal/customer.h b/ps-lite/include/ps/internal/customer.h
new file mode 100644
index 00000000..c87c288a
--- /dev/null
+++ b/ps-lite/include/ps/internal/customer.h
@@ -0,0 +1,102 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_CUSTOMER_H_
+#define PS_INTERNAL_CUSTOMER_H_
+#include <mutex>
+#include <vector>
+#include <utility>
+#include <atomic>
+#include <condition_variable>
+#include <functional>
+#include <thread>
+#include <memory>
+#include "ps/internal/message.h"
+#include "ps/internal/threadsafe_queue.h"
+namespace ps {
+
+/**
+ * \brief The object for communication.
+ *
+ * As a sender, a customer tracks the responses for each request sent.
+ *
+ * It has its own receiving thread which is able to process any message received
+ * from a remote node with `msg.meta.customer_id` equal to this customer's id
+ */
+class Customer {
+ public:
+  /**
+   * \brief the handle for a received message
+   * \param recved the received message
+   */
+  using RecvHandle = std::function<void(const Message& recved)>;
+
+  /**
+   * \brief constructor
+   * \param id the unique id, any received message with
+   * \param recv_handle the functino for processing a received message
+   */
+  Customer(int id, const RecvHandle& recv_handle);
+
+  /**
+   * \brief desconstructor
+   */
+  ~Customer();
+
+  /**
+   * \brief return the unique id
+   */
+  int id() { return id_; }
+
+  /**
+   * \brief get a timestamp for a new request. threadsafe
+   * \param recver the receive node id of this request
+   * \return the timestamp of this request
+   */
+  int NewRequest(int recver);
+
+
+  /**
+   * \brief wait until the request is finished. threadsafe
+   * \param timestamp the timestamp of the request
+   */
+  void WaitRequest(int timestamp);
+
+  /**
+   * \brief return the number of responses received for the request. threadsafe
+   * \param timestamp the timestamp of the request
+   */
+  int NumResponse(int timestamp);
+
+  /**
+   * \brief add a number of responses to timestamp
+   */
+  void AddResponse(int timestamp, int num = 1);
+
+  /**
+   * \brief accept a received message from \ref Van. threadsafe
+   * \param recved the received the message
+   */
+  void Accept(const Message& recved) { recv_queue_.Push(recved); }
+
+ private:
+  /**
+   * \brief the thread function
+   */
+  void Receiving();
+
+  int id_;
+
+  RecvHandle recv_handle_;
+  ThreadsafeQueue<Message> recv_queue_;
+  std::unique_ptr<std::thread> recv_thread_;
+
+  std::mutex tracker_mu_;
+  std::condition_variable tracker_cond_;
+  std::vector<std::pair<int, int>> tracker_;
+
+  DISALLOW_COPY_AND_ASSIGN(Customer);
+};
+
+}  // namespace ps
+#endif  // PS_INTERNAL_CUSTOMER_H_
diff --git a/ps-lite/include/ps/internal/env.h b/ps-lite/include/ps/internal/env.h
new file mode 100644
index 00000000..ea7952d4
--- /dev/null
+++ b/ps-lite/include/ps/internal/env.h
@@ -0,0 +1,63 @@
+/**
+ * Copyright (c) 2016 by Contributors
+ */
+#ifndef PS_INTERNAL_ENV_H_
+#define PS_INTERNAL_ENV_H_
+#include <cstdlib>
+#include <unordered_map>
+#include <memory>
+#include <string>
+namespace ps {
+
+/**
+ * \brief Environment configurations
+ */
+class Environment {
+ public:
+  /**
+   * \brief return the singleton instance
+   */
+  static inline Environment* Get() {
+    return _GetSharedRef(nullptr).get();
+  }
+  /**
+   * \brief return a shared ptr of the singleton instance
+   */
+  static inline std::shared_ptr<Environment> _GetSharedRef() {
+    return _GetSharedRef(nullptr);
+  }
+  /**
+   * \brief initialize the environment
+   * \param envs key-value environment variables
+   * \return the initialized singleton instance
+   */
+  static inline Environment* Init(const std::unordered_map<std::string, std::string>& envs) {
+    return _GetSharedRef(&envs).get();
+  }
+  /**
+   * \brief find the env value.
+   *  User-defined env vars first. If not found, check system's environment
+   * \param k the environment key
+   * \return the related environment value, nullptr when not found
+   */
+  const char* find(const char* k) {
+    std::string key(k);
+    return kvs.find(key) == kvs.end() ? getenv(k) : kvs[key].c_str();
+  }
+
+ private:
+  explicit Environment(const std::unordered_map<std::string, std::string>* envs) {
+    if (envs) kvs = *envs;
+  }
+
+  static std::shared_ptr<Environment> _GetSharedRef(
+      const std::unordered_map<std::string, std::string>* envs) {
+    static std::shared_ptr<Environment> inst_ptr(new Environment(envs));
+    return inst_ptr;
+  }
+
+  std::unordered_map<std::string, std::string> kvs;
+};
+
+}  // namespace ps
+#endif  // PS_INTERNAL_ENV_H_
diff --git a/ps-lite/include/ps/internal/message.h b/ps-lite/include/ps/internal/message.h
new file mode 100644
index 00000000..d14c47fd
--- /dev/null
+++ b/ps-lite/include/ps/internal/message.h
@@ -0,0 +1,218 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_MESSAGE_H_
+#define PS_INTERNAL_MESSAGE_H_
+#include <vector>
+#include <limits>
+#include <string>
+#include <sstream>
+#include "ps/sarray.h"
+namespace ps {
+/** \brief data type */
+enum DataType {
+  CHAR, INT8, INT16, INT32, INT64,
+  UINT8, UINT16, UINT32, UINT64,
+  FLOAT, DOUBLE, OTHER
+};
+/** \brief data type name */
+static const char* DataTypeName[] = {
+  "CHAR", "INT8", "INT16", "INT32", "INT64",
+  "UINT8", "UINT16", "UINT32", "UINT64",
+  "FLOAT", "DOUBLE", "OTHER"
+};
+/**
+ * \brief compare if V and W are the same type
+ */
+template<typename V, typename W>
+inline bool SameType() {
+  return std::is_same<typename std::remove_cv<V>::type, W>::value;
+}
+/**
+ * \brief return the DataType of V
+ */
+template<typename V>
+DataType GetDataType() {
+  if (SameType<V, int8_t>()) {
+    return INT8;
+  } else if (SameType<V, int16_t>()) {
+    return INT16;
+  } else if (SameType<V, int32_t>()) {
+    return INT32;
+  } else if (SameType<V, int64_t>()) {
+    return INT64;
+  } else if (SameType<V, uint8_t>()) {
+    return UINT8;
+  } else if (SameType<V, uint16_t>()) {
+    return UINT16;
+  } else if (SameType<V, uint32_t>()) {
+    return UINT32;
+  } else if (SameType<V, uint64_t>()) {
+    return UINT64;
+  } else if (SameType<V, float>()) {
+    return FLOAT;
+  } else if (SameType<V, double>()) {
+    return DOUBLE;
+  } else {
+    return OTHER;
+  }
+}
+/**
+ * \brief information about a node
+ */
+struct Node {
+  /** \brief the empty value */
+  static const int kEmpty;
+  /** \brief default constructor */
+  Node() : id(kEmpty), port(kEmpty), is_recovery(false) {}
+  /** \brief node roles */
+  enum Role { SERVER, WORKER, SCHEDULER };
+  /** \brief get debug string */
+  std::string DebugString() const {
+    std::stringstream ss;
+    ss << "role=" << (role == SERVER ? "server" : (role == WORKER ? "worker" : "scheduler"))
+       << (id != kEmpty ? ", id=" + std::to_string(id) : "")
+       << ", ip=" << hostname << ", port=" << port << ", is_recovery=" << is_recovery;
+
+    return ss.str();
+  }
+  /** \brief get short debug string */
+  std::string ShortDebugString() const {
+    std::string str = role == SERVER ? "S" : (role == WORKER ? "W" : "H");
+    if (id != kEmpty) str += "[" + std::to_string(id) + "]";
+    return str;
+  }
+  /** \brief the role of this node */
+  Role role;
+  /** \brief node id */
+  int id;
+  /** \brief hostname or ip */
+  std::string hostname;
+  /** \brief the port this node is binding */
+  int port;
+  /** \brief whether this node is created by failover */
+  bool is_recovery;
+};
+/**
+ * \brief meta info of a system control message
+ */
+struct Control {
+  /** \brief empty constructor */
+  Control() : cmd(EMPTY) { }
+  /** \brief return true is empty */
+  inline bool empty() const { return cmd == EMPTY; }
+  /** \brief get debug string */
+  std::string DebugString() const {
+    if (empty()) return "";
+    std::vector<std::string> cmds = {
+      "EMPTY", "TERMINATE", "ADD_NODE", "BARRIER", "ACK", "HEARTBEAT"};
+    std::stringstream ss;
+    ss << "cmd=" << cmds[cmd];
+    if (node.size()) {
+      ss << ", node={";
+      for (const Node& n : node) ss << " " << n.DebugString();
+      ss << " }";
+    }
+    if (cmd == BARRIER) ss << ", barrier_group=" << barrier_group;
+    if (cmd == ACK) ss << ", msg_sig=" << msg_sig;
+    return ss.str();
+  }
+  /** \brief all commands */
+  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };
+  /** \brief the command */
+  Command cmd;
+  /** \brief node infos */
+  std::vector<Node> node;
+  /** \brief the node group for a barrier, such as kWorkerGroup */
+  int barrier_group;
+  /** message signature */
+  uint64_t msg_sig;
+};
+/**
+ * \brief meta info of a message
+ */
+struct Meta {
+  /** \brief the empty value */
+  static const int kEmpty;
+  /** \brief default constructor */
+  Meta() : head(kEmpty), customer_id(kEmpty), timestamp(kEmpty),
+           sender(kEmpty), recver(kEmpty),
+           request(false), push(false), simple_app(false) {}
+  std::string DebugString() const {
+    std::stringstream ss;
+    if (sender == Node::kEmpty) {
+      ss << "?";
+    } else {
+      ss << sender;
+    }
+    ss <<  " => " << recver;
+    ss << ". Meta: request=" << request;
+    if (timestamp != kEmpty) ss << ", timestamp=" << timestamp;
+    if (!control.empty()) {
+      ss << ", control={ " << control.DebugString() << " }";
+    } else {
+      ss << ", customer_id=" << customer_id
+         << ", simple_app=" << simple_app
+         << ", push=" << push;
+    }
+    if (head != kEmpty) ss << ", head=" << head;
+    if (body.size()) ss << ", body=" << body;
+    if (data_type.size()) {
+      ss << ", data_type={";
+      for (auto d : data_type) ss << " " << DataTypeName[static_cast<int>(d)];
+      ss << " }";
+    }
+    return ss.str();
+  }
+  /** \brief an int head */
+  int head;
+  /** \brief the unique id of the customer is messsage is for*/
+  int customer_id;
+  /** \brief the timestamp of this message */
+  int timestamp;
+  /** \brief the node id of the sender of this message */
+  int sender;
+  /** \brief the node id of the receiver of this message */
+  int recver;
+  /** \brief whether or not this is a request message*/
+  bool request;
+  /** \brief whether or not a push message */
+  bool push;
+  /** \brief whether or not it's for SimpleApp */
+  bool simple_app;
+  /** \brief an string body */
+  std::string body;
+  /** \brief data type of message.data[i] */
+  std::vector<DataType> data_type;
+  /** \brief system control message */
+  Control control;
+};
+/**
+ * \brief messages that communicated amaong nodes.
+ */
+struct Message {
+  /** \brief the meta info of this message */
+  Meta meta;
+  /** \brief the large chunk of data of this message */
+  std::vector<SArray<char> > data;
+  /**
+   * \brief push array into data, and add the data type
+   */
+  template <typename V>
+  void AddData(const SArray<V>& val) {
+    CHECK_EQ(data.size(), meta.data_type.size());
+    meta.data_type.push_back(GetDataType<V>());
+    data.push_back(SArray<char>(val));
+  }
+  std::string DebugString() const {
+    std::stringstream ss;
+    ss << meta.DebugString();
+    if (data.size()) {
+      ss << " Body:";
+      for (const auto& d : data) ss << " data_size=" << d.size();
+    }
+    return ss.str();
+  }
+};
+}  // namespace ps
+#endif  // PS_INTERNAL_MESSAGE_H_
diff --git a/ps-lite/include/ps/internal/parallel_kv_match.h b/ps-lite/include/ps/internal/parallel_kv_match.h
new file mode 100644
index 00000000..bf5ab0b7
--- /dev/null
+++ b/ps-lite/include/ps/internal/parallel_kv_match.h
@@ -0,0 +1,123 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ * \file   parallel_kv_match.h
+ * \brief  paralle key-value pairs matching
+ */
+#ifndef PS_INTERNAL_PARALLEL_KV_MATCH_H_
+#define PS_INTERNAL_PARALLEL_KV_MATCH_H_
+#include <thread>
+#include <algorithm>
+#include "ps/sarray.h"
+#include "ps/internal/assign_op.h"
+
+namespace ps {
+namespace  {
+/**
+ * \brief thread function, internal use
+ *
+ * \param src_key start of source key
+ * \param src_key_end end of source key
+ * \param src_val start of source val
+ * \param dst_key start of destination key
+ * \param dst_key_end end of denstination key
+ * \param dst_val start of destination val
+ * \param k length of a single value
+ * \param op assignment operator
+ * \param grainsize thread grainsize size
+ * \param n number of matched kv pairs
+ */
+template <typename K, typename V>
+void ParallelOrderedMatch(
+    const K* src_key, const K* src_key_end, const V* src_val,
+    const K* dst_key, const K* dst_key_end, V* dst_val,
+    int k, AsOp op, size_t grainsize, size_t* n) {
+  size_t src_len = std::distance(src_key, src_key_end);
+  size_t dst_len = std::distance(dst_key, dst_key_end);
+  if (dst_len == 0 || src_len == 0) return;
+
+  // drop the unmatched tail of src
+  src_key = std::lower_bound(src_key, src_key_end, *dst_key);
+  src_val += (src_key - (src_key_end - src_len)) * k;
+
+  if (dst_len <= grainsize) {
+    while (dst_key != dst_key_end && src_key != src_key_end) {
+      if (*src_key < *dst_key) {
+        ++src_key; src_val += k;
+      } else {
+        if (!(*dst_key < *src_key)) {
+          for (int i = 0; i < k; ++i) {
+            AssignOp(dst_val[i], src_val[i], op);
+          }
+          ++src_key; src_val += k;
+          *n += k;
+        }
+        ++dst_key; dst_val += k;
+      }
+    }
+  } else {
+    std::thread thr(
+        ParallelOrderedMatch<K, V>, src_key, src_key_end, src_val,
+        dst_key, dst_key + dst_len / 2, dst_val,
+        k, op, grainsize, n);
+    size_t m = 0;
+    ParallelOrderedMatch<K, V>(
+        src_key, src_key_end, src_val,
+        dst_key + dst_len / 2, dst_key_end, dst_val + (dst_len / 2) * k,
+        k, op, grainsize, &m);
+    thr.join();
+    *n += m;
+  }
+}
+}  // namespace
+
+
+/**
+ * \brief Merge \a src_val into \a dst_val by matching keys. Keys must be unique
+ * and sorted.
+ *
+ * \code
+ * if (dst_key[i] == src_key[j]) {
+ *    dst_val[i] op= src_val[j]
+ * }
+ * \endcode
+ *
+ * When finished, \a dst_val will have length `k * dst_key.size()` and filled
+ * with matched value. Umatched value will be untouched if exists or filled with 0.
+ *
+ * \tparam K type of key
+ * \tparam V type of value
+ * \tparam C type of the container such as \ref SArray or \ref std::vector
+ * \param src_key the source keys
+ * \param src_val the source values
+ * \param dst_key the destination keys
+ * \param dst_val the destination values.
+ * \param k the length of a single value (default is 1)
+ * \param op the assignment operator (default is ASSIGN)
+ * \param num_threads number of thread (default is 1)
+ * \return the number of matched kv pairs
+ */
+template <typename K, typename V, typename C>
+size_t ParallelOrderedMatch(
+    const SArray<K>& src_key, const SArray<V>& src_val,
+    const SArray<K>& dst_key, C* dst_val,
+    int k = 1, AssignOp op = ASSIGN, int num_threads = 1) {
+  // do check
+  CHECK_GT(num_threads, 0);
+  CHECK_EQ(src_key.size() * k, src_val.size());
+  CHECK_NOTNULL(dst_val->resize(dst_key.size() * k));
+  if (dst_key.empty()) return 0;
+
+  // shorten the matching range
+  Range range = FindRange(dst_key, src_key.begin(), src_key.end());
+  size_t grainsize = std::max(range.size() * k / num_threads + 5,
+                              static_cast<size_t>(1024*1024));
+  size_t n = 0;
+  ParallelOrderedMatch<K, V>(
+      src_key.begin(), src_key.end(), src_val.begin(),
+      dst_key.begin() + range.begin(), dst_key.begin() + range.end(),
+      dst_val->begin() + range.begin()*k, k, op, grainsize, &n);
+  return n;
+}
+
+}  // namespace ps
+#endif  // PS_INTERNAL_PARALLEL_KV_MATCH_H_
diff --git a/ps-lite/include/ps/internal/parallel_sort.h b/ps-lite/include/ps/internal/parallel_sort.h
new file mode 100644
index 00000000..e3920e76
--- /dev/null
+++ b/ps-lite/include/ps/internal/parallel_sort.h
@@ -0,0 +1,58 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ * @file   parallel_sort.h
+ * @brief  Parallel sort
+ */
+#ifndef PS_INTERNAL_PARALLEL_SORT_H_
+#define PS_INTERNAL_PARALLEL_SORT_H_
+#include <functional>
+#include <thread>
+#include <algorithm>
+#include "ps/sarray.h"
+namespace ps {
+
+namespace  {
+/**
+ * \brief the thread function
+ *
+ * \param data start pointer of data
+ * \param len  length of data
+ * \param grainsize max data length of one thread
+ * \param cmp comparison function
+ */
+template<typename T, class Fn>
+void ParallelSort(T* data, size_t len, size_t grainsize, const Fn& cmp) {
+  if (len <= grainsize) {
+    std::sort(data, data + len, cmp);
+  } else {
+    std::thread thr(ParallelSort<T, Fn>, data, len/2, grainsize, cmp);
+    ParallelSort(data + len/2, len - len/2, grainsize, cmp);
+    thr.join();
+
+    std::inplace_merge(data, data + len/2, data + len, cmp);
+  }
+}
+}  // namespace
+
+/**
+ * \brief Parallel Sort
+ *
+ * \param arr the array for sorting
+ * \param num_threads number of thread
+ * \param cmp the comparision function such as
+ * [](const T& a, const T& b) {* return a < b; }
+ * or an even simplier version:
+ * std::less<T>()
+ */
+template<typename T, class Fn>
+void ParallelSort(SArray<T>* arr,
+                  int num_threads = 2,
+                  const Fn& cmp = std::less<T>()) {
+  CHECK_GT(num_threads, 0);
+  CHECK(cmp);
+  size_t grainsize = std::max(arr->size() / num_threads + 5, (size_t)1024*16);
+  ParallelSort(arr->data(), arr->size(), grainsize, cmp);
+}
+
+}  // namespace ps
+#endif  // PS_INTERNAL_PARALLEL_SORT_H_
diff --git a/ps-lite/include/ps/internal/postoffice.h b/ps-lite/include/ps/internal/postoffice.h
new file mode 100644
index 00000000..4745f335
--- /dev/null
+++ b/ps-lite/include/ps/internal/postoffice.h
@@ -0,0 +1,189 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_POSTOFFICE_H_
+#define PS_INTERNAL_POSTOFFICE_H_
+#include <mutex>
+#include <algorithm>
+#include <vector>
+#include "ps/range.h"
+#include "ps/internal/env.h"
+#include "ps/internal/customer.h"
+#include "ps/internal/van.h"
+namespace ps {
+/**
+ * \brief the center of the system
+ */
+class Postoffice {
+ public:
+  /**
+   * \brief return the singleton object
+   */
+  static Postoffice* Get() {
+    static Postoffice e; return &e;
+  }
+  /** \brief get the van */
+  Van* van() { return van_; }
+  /**
+   * \brief start the system
+   *
+   * This function will block until every nodes are started.
+   * \param argv0 the program name, used for logging.
+   * \param do_barrier whether to block until every nodes are started.
+   */
+  void Start(const char* argv0, const bool do_barrier);
+  /**
+   * \brief terminate the system
+   *
+   * All nodes should call this function before existing. 
+   * \param do_barrier whether to do block until every node is finalized, default true.
+   */
+  void Finalize(const bool do_barrier = true);
+  /**
+   * \brief add an customer to the system. threadsafe
+   */
+  void AddCustomer(Customer* customer);
+  /**
+   * \brief remove a customer by given it's id. threasafe
+   */
+  void RemoveCustomer(Customer* customer);
+  /**
+   * \brief get the customer by id, threadsafe
+   * \param id the customer id
+   * \param timeout timeout in sec
+   * \return return nullptr if doesn't exist and timeout
+   */
+  Customer* GetCustomer(int id, int timeout = 0) const;
+  /**
+   * \brief get the id of a node (group), threadsafe
+   *
+   * if it is a  node group, return the list of node ids in this
+   * group. otherwise, return {node_id}
+   */
+  const std::vector<int>& GetNodeIDs(int node_id) const {
+    const auto it = node_ids_.find(node_id);
+    CHECK(it != node_ids_.cend()) << "node " << node_id << " doesn't exist";
+    return it->second;
+  }
+  /**
+   * \brief return the key ranges of all server nodes
+   */
+  const std::vector<Range>& GetServerKeyRanges();
+  /**
+   * \brief the template of a callback
+   */
+  using Callback = std::function<void()>;
+  /**
+   * \brief Register a callback to the system which is called after Finalize()
+   *
+   * The following codes are equal
+   * \code {cpp}
+   * RegisterExitCallback(cb);
+   * Finalize();
+   * \endcode
+   *
+   * \code {cpp}
+   * Finalize();
+   * cb();
+   * \endcode
+   * \param cb the callback function
+   */
+  void RegisterExitCallback(const Callback& cb) {
+    exit_callback_ = cb;
+  }
+  /**
+   * \brief convert from a worker rank into a node id
+   * \param rank the worker rank
+   */
+  static inline int WorkerRankToID(int rank) {
+    return rank * 2 + 9;
+  }
+  /**
+   * \brief convert from a server rank into a node id
+   * \param rank the server rank
+   */
+  static inline int ServerRankToID(int rank) {
+    return rank * 2 + 8;
+  }
+  /**
+   * \brief convert from a node id into a server or worker rank
+   * \param id the node id
+   */
+  static inline int IDtoRank(int id) {
+#ifdef _MSC_VER
+#undef max
+#endif
+    return std::max((id - 8) / 2, 0);
+  }
+  /** \brief Returns the number of worker nodes */
+  int num_workers() const { return num_workers_; }
+  /** \brief Returns the number of server nodes */
+  int num_servers() const { return num_servers_; }
+  /** \brief Returns the rank of this node in its group
+   *
+   * Each worker will have a unique rank within [0, NumWorkers()). So are
+   * servers. This function is available only after \ref Start has been called.
+   */
+  int my_rank() const { return IDtoRank(van_->my_node().id); }
+  /** \brief Returns true if this node is a worker node */
+  int is_worker() const { return is_worker_; }
+  /** \brief Returns true if this node is a server node. */
+  int is_server() const { return is_server_; }
+  /** \brief Returns true if this node is a scheduler node. */
+  int is_scheduler() const { return is_scheduler_; }
+  /** \brief Returns the verbose level. */
+  int verbose() const { return verbose_; }
+  /** \brief Return whether this node is a recovery node */
+  bool is_recovery() const { return van_->my_node().is_recovery; }
+  /**
+   * \brief barrier
+   * \param node_id the barrier group id
+   */
+  void Barrier(int node_id);
+  /**
+   * \brief process a control message, called by van
+   * \param the received message
+   */
+  void Manage(const Message& recv);
+  /**
+   * \brief update the heartbeat record map
+   * \param node_id the \ref Node id
+   * \param t the last received heartbeat time
+   */
+  void UpdateHeartbeat(int node_id, time_t t) {
+    std::lock_guard<std::mutex> lk(heartbeat_mu_);
+    heartbeats_[node_id] = t;
+  }
+  /**
+   * \brief get node ids that haven't reported heartbeats for over t seconds
+   * \param t timeout in sec
+   */
+  std::vector<int> GetDeadNodes(int t = 60);
+
+ private:
+  Postoffice();
+  ~Postoffice() { delete van_; }
+  Van* van_;
+  mutable std::mutex mu_;
+  std::unordered_map<int, Customer*> customers_;
+  std::unordered_map<int, std::vector<int>> node_ids_;
+  std::vector<Range> server_key_ranges_;
+  bool is_worker_, is_server_, is_scheduler_;
+  int num_servers_, num_workers_;
+  bool barrier_done_;
+  int verbose_;
+  std::mutex barrier_mu_;
+  std::condition_variable barrier_cond_;
+  std::mutex heartbeat_mu_;
+  std::unordered_map<int, time_t> heartbeats_;
+  Callback exit_callback_;
+  /** \brief Holding a shared_ptr to prevent it from being destructed too early */
+  std::shared_ptr<Environment> env_ref_;
+  time_t start_time_;
+  DISALLOW_COPY_AND_ASSIGN(Postoffice);
+};
+
+/** \brief verbose log */
+#define PS_VLOG(x) LOG_IF(INFO, x <= Postoffice::Get()->verbose())
+}  // namespace ps
+#endif  // PS_INTERNAL_POSTOFFICE_H_
diff --git a/ps-lite/include/ps/internal/threadsafe_queue.h b/ps-lite/include/ps/internal/threadsafe_queue.h
new file mode 100644
index 00000000..93169dcd
--- /dev/null
+++ b/ps-lite/include/ps/internal/threadsafe_queue.h
@@ -0,0 +1,59 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_THREADSAFE_QUEUE_H_
+#define PS_INTERNAL_THREADSAFE_QUEUE_H_
+#include <queue>
+#include <mutex>
+#include <condition_variable>
+#include <memory>
+#include "ps/base.h"
+namespace ps {
+
+/**
+ * \brief thread-safe queue allowing push and waited pop
+ */
+template<typename T> class ThreadsafeQueue {
+ public:
+  ThreadsafeQueue() { }
+  ~ThreadsafeQueue() { }
+
+  /**
+   * \brief push an value into the end. threadsafe.
+   * \param new_value the value
+   */
+  void Push(T new_value) {
+    mu_.lock();
+    queue_.push(std::move(new_value));
+    mu_.unlock();
+    cond_.notify_all();
+  }
+
+  /**
+   * \brief wait until pop an element from the beginning, threadsafe
+   * \param value the poped value
+   */
+  void WaitAndPop(T* value) {
+    std::unique_lock<std::mutex> lk(mu_);
+    cond_.wait(lk, [this]{return !queue_.empty();});
+    *value = std::move(queue_.front());
+    queue_.pop();
+  }
+
+ private:
+  mutable std::mutex mu_;
+  std::queue<T> queue_;
+  std::condition_variable cond_;
+};
+
+}  // namespace ps
+
+// bool TryPop(T& value) {
+//   std::lock_guard<std::mutex> lk(mut);
+//   if(data_queue.empty())
+//     return false;
+//   value=std::move(data_queue.front());
+//   data_queue.pop();
+//   return true;
+// }
+#endif  // PS_INTERNAL_THREADSAFE_QUEUE_H_
diff --git a/ps-lite/include/ps/internal/utils.h b/ps-lite/include/ps/internal/utils.h
new file mode 100644
index 00000000..4f4c7c31
--- /dev/null
+++ b/ps-lite/include/ps/internal/utils.h
@@ -0,0 +1,48 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_UTILS_H_
+#define PS_INTERNAL_UTILS_H_
+#include "dmlc/logging.h"
+#include "ps/internal/env.h"
+namespace ps {
+
+#ifdef _MSC_VER
+typedef signed char      int8_t;
+typedef __int16          int16_t;
+typedef __int32          int32_t;
+typedef __int64          int64_t;
+typedef unsigned char    uint8_t;
+typedef unsigned __int16 uint16_t;
+typedef unsigned __int32 uint32_t;
+typedef unsigned __int64 uint64_t;
+#else
+#include <inttypes.h>
+#endif
+
+/*!
+ * \brief Get environment variable as int with default.
+ * \param key the name of environment variable.
+ * \param default_val the default value of environment vriable.
+ * \return The value received
+ */
+template<typename V>
+inline V GetEnv(const char *key, V default_val) {
+  const char *val = Environment::Get()->find(key);
+  if (val == nullptr) {
+    return default_val;
+  } else {
+    return atoi(val);
+  }
+}
+
+#ifndef DISALLOW_COPY_AND_ASSIGN
+#define DISALLOW_COPY_AND_ASSIGN(TypeName) \
+  TypeName(const TypeName&);               \
+  void operator=(const TypeName&)
+#endif
+
+#define LL LOG(ERROR)
+
+}  // namespace ps
+#endif  // PS_INTERNAL_UTILS_H_
diff --git a/ps-lite/include/ps/internal/van.h b/ps-lite/include/ps/internal/van.h
new file mode 100644
index 00000000..8c5518cd
--- /dev/null
+++ b/ps-lite/include/ps/internal/van.h
@@ -0,0 +1,130 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_INTERNAL_VAN_H_
+#define PS_INTERNAL_VAN_H_
+#include <unordered_map>
+#include <mutex>
+#include <string>
+#include <vector>
+#include <thread>
+#include <memory>
+#include <atomic>
+#include <ctime>
+#include "ps/base.h"
+#include "ps/internal/message.h"
+namespace ps {
+class Resender;
+/**
+ * \brief Van sends messages to remote nodes
+ *
+ * If environment variable PS_RESEND is set to be 1, then van will resend a
+ * message if it no ACK messsage is received within PS_RESEND_TIMEOUT millisecond
+ */
+class Van {
+ public:
+  /**
+   * \brief create Van
+   * \param type zmq, socket, ...
+   */
+  static Van* Create(const std::string& type);
+  /** \brief constructer, do nothing. use \ref Start for real start */
+  Van() { }
+  /**\brief deconstructer, do nothing. use \ref Stop for real stop */
+  virtual ~Van() { }
+  /**
+   * \brief start van
+   *
+   * must call it before calling Send
+   *
+   * it initalizes all connections to other nodes.  start the receiving
+   * threads, which keeps receiving messages. if it is a system
+   * control message, give it to postoffice::manager, otherwise, give it to the
+   * accoding app.
+   */
+  virtual void Start();
+  /**
+   * \brief send a message, It is thread-safe
+   * \return the number of bytes sent. -1 if failed
+   */
+  int Send(const Message& msg);
+  /**
+   * \brief return my node
+   */
+  const Node& my_node() const {
+    CHECK(ready_) << "call Start() first";
+    return my_node_;
+  }
+  /**
+   * \brief stop van
+   * stop receiving threads
+   */
+  virtual void Stop();
+  /**
+   * \brief get next available timestamp. thread safe
+   */
+  int GetTimestamp() { return timestamp_++; }
+  /**
+   * \brief whether it is ready for sending. thread safe
+   */
+  bool IsReady() { return ready_; }
+
+ protected:
+  /**
+   * \brief connect to a node
+   */
+  virtual void Connect(const Node& node) = 0;
+  /**
+   * \brief bind to my node
+   * do multiple retries on binding the port. since it's possible that
+   * different nodes on the same machine picked the same port
+   * \return return the port binded, -1 if failed.
+   */
+  virtual int Bind(const Node& node, int max_retry) = 0;
+  /**
+   * \brief block until received a message
+   * \return the number of bytes received. -1 if failed or timeout
+   */
+  virtual int RecvMsg(Message* msg) = 0;
+  /**
+   * \brief send a mesage
+   * \return the number of bytes sent
+   */
+  virtual int SendMsg(const Message& msg) = 0;
+  /**
+   * \brief pack meta into a string
+   */
+  void PackMeta(const Meta& meta, char** meta_buf, int* buf_size);
+  /**
+   * \brief unpack meta from a string
+   */
+  void UnpackMeta(const char* meta_buf, int buf_size, Meta* meta);
+
+  Node scheduler_;
+  Node my_node_;
+  bool is_scheduler_;
+
+ private:
+  /** thread function for receving */
+  void Receiving();
+  /** thread function for heartbeat */
+  void Heartbeat();
+  /** whether it is ready for sending */
+  std::atomic<bool> ready_{false};
+  std::atomic<size_t> send_bytes_{0};
+  size_t recv_bytes_ = 0;
+  int num_servers_ = 0;
+  int num_workers_ = 0;
+  /** the thread for receiving messages */
+  std::unique_ptr<std::thread> receiver_thread_;
+  /** the thread for sending heartbeat */
+  std::unique_ptr<std::thread> heartbeat_thread_;
+  std::vector<int> barrier_count_;
+  /** msg resender */
+  Resender* resender_ = nullptr;
+  int drop_rate_ = 0;
+  std::atomic<int> timestamp_{0};
+  DISALLOW_COPY_AND_ASSIGN(Van);
+};
+}  // namespace ps
+#endif  // PS_INTERNAL_VAN_H_
diff --git a/ps-lite/include/ps/kv_app.h b/ps-lite/include/ps/kv_app.h
new file mode 100644
index 00000000..830f24db
--- /dev/null
+++ b/ps-lite/include/ps/kv_app.h
@@ -0,0 +1,607 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_KV_APP_H_
+#define PS_KV_APP_H_
+#include <algorithm>
+#include <utility>
+#include <vector>
+#include "ps/base.h"
+#include "ps/simple_app.h"
+namespace ps {
+
+/**
+ * \brief the structure for a list of key-value pairs
+ *
+ * The keys must be unique and sorted in an increasing order.  The length of a
+ * value can be more than one. If \a lens is empty, then the length
+ * of a value is determined by `k=vals.size()/keys.size()`.  The \a i-th KV pair
+ * is then
+ *
+ * \verbatim {keys[i], (vals[i*k], ..., vals[(i+1)*k-1])} \endverbatim
+ *
+ * If \a lens is given, then `lens[i]` is the length of the \a i-th
+ * value. Let
+ *
+ * \verbatim n = lens[0] + .. + lens[i-1]  \endverbatim
+ *
+ * then the \a i-th KV pair is presented as
+ *
+ * \verbatim {keys[i], (vals[n], ..., vals[lens[i]+n-1])} \endverbatim
+ */
+template <typename Val>
+struct KVPairs {
+  // /** \brief empty constructor */
+  // KVPairs() {}
+  /** \brief the list of keys */
+  SArray<Key> keys;
+  /** \brief the according values */
+  SArray<Val> vals;
+  /** \brief the according value lengths (could be empty) */
+  SArray<int> lens;
+};
+
+/**
+ * \brief A worker node that can \ref Push (\ref Pull) key-value pairs to (from) server
+ * nodes
+ *
+ * \tparam Val the type of value, which should be primitive types such as
+ * int32_t and float
+ */
+template<typename Val>
+class KVWorker : public SimpleApp {
+ public:
+  /** avoid too many this-> */
+  using SimpleApp::obj_;
+  /**
+   * \brief callback function for \ref Push and \ref Pull
+   *
+   * It is called by the data receiving thread of this instance when the push or
+   * pull is actually finished. Namely the kv pairs have already written into
+   * servers' data structure or the kv pairs have already pulled back.
+   */
+  using Callback = std::function<void()>;
+
+  /**
+   * \brief constructor
+   *
+   * \param app_id the app id, should match with \ref KVServer's id
+   */
+  explicit KVWorker(int app_id) : SimpleApp() {
+    using namespace std::placeholders;
+    slicer_ = std::bind(&KVWorker<Val>::DefaultSlicer, this, _1, _2, _3);
+    obj_ = new Customer(app_id, std::bind(&KVWorker<Val>::Process, this, _1));
+  }
+
+  /** \brief deconstructor */
+  virtual ~KVWorker() { delete obj_; obj_ = nullptr; }
+
+  /**
+   * \brief Pushes a list of key-value pairs to all server nodes.
+   *
+   * This function pushes a KV list specified by \a keys and \a vals to all
+   * server nodes.
+   *
+   * Sample usage: the following codes push two KV pairs `{1, (1.1, 1.2)}` and `{3,
+   * (3.1,3.2)}` to server nodes, where the value is a length-2 float vector
+   * \code
+   *   KVWorker<float> w;
+   *   std::vector<Key> keys = {1, 3};
+   *   std::vector<float> vals = {1.1, 1.2, 3.1, 3.2};
+   *   w.Push(keys, vals);
+   * \endcode
+   *
+   * If \a lens is given, then the value can be various length. See
+   * \ref KVPairs for more information.
+   *
+   * The KV list is partitioned and sent based on the key range each server
+   * maintaining. This function returns without waiting the data are sent
+   * actually. Instead, use either \ref Wait or the callback to know when
+   * finished. This function is thread-safe.
+   *
+   * @param keys a list of keys, must be unique and sorted in increasing order
+   * @param vals the according values
+   * @param lens optional, lens[i] stores the value length of the \a
+   * i-th KV pair
+   * @param cmd an optional command sent to the servers
+   * @param cb the callback which is called when the push is finished.
+   * @return the timestamp of this request
+   */
+  int Push(const std::vector<Key>& keys,
+           const std::vector<Val>& vals,
+           const std::vector<int>& lens = {},
+           int cmd = 0,
+           const Callback& cb = nullptr) {
+    return ZPush(
+        SArray<Key>(keys), SArray<Val>(vals), SArray<int>(lens), cmd, cb);
+  }
+
+  /**
+   * \brief Pulls the values associated with the keys from the server nodes
+   *
+   * This function pulls the values of the keys specified in \a keys from the
+   * server nodes. The format is same to \ref KVPairs
+   *
+   * Sample usage: the following codes pull the values of keys \a 1 and \a 3
+   * from the server nodes.
+   * \code
+   *   KVWorker<float> w;
+   *   std::vector<Key> keys = {1, 3};
+   *   std::vector<float> vals;
+   *   ps.Pull(keys, &vals);
+   * \endcode
+   *
+   * It's a non-blocking call. The actual pulling is finished,
+   * namely \a vals (and \a lens) is filled with pulled values, only
+   * if \ref Wait returns or the callback is called.
+   *
+   * @param keys a list of keys, must be unique and sorted in increasing order
+   * @param vals the buffer for the pulled values. It can be 0 size.
+   * @param lens optional buffer for the value length. If set, it can be 0 size.
+   * @param cmd an optional command sent to the servers
+   * @param cb the callback which is called when the pull is finished.
+   * @return the timestamp of this request
+   */
+  int Pull(const std::vector<Key>& keys,
+           std::vector<Val>* vals,
+           std::vector<int>* lens = nullptr,
+           int cmd = 0,
+           const Callback& cb = nullptr) {
+    return Pull_(SArray<Key>(keys), vals, lens, cmd, cb);
+  }
+
+  /**
+   * \brief Waits until a push or pull has been finished
+   *
+   * Sample usage:
+   * \code
+   *   int ts = w.Pull(keys, &vals);
+   *   Wait(ts);
+   *   // now vals is ready for use
+   * \endcode
+   *
+   * \param timestamp the timestamp returned by the push or pull
+   */
+  void Wait(int timestamp) { obj_->WaitRequest(timestamp); }
+
+  /**
+   * \brief zero-copy Push
+   *
+   * This function is similar to \ref Push except that all data
+   * will not be copied into system for better performance. It is the caller's
+   * responsibility to keep the content to be not changed before actually
+   * finished.
+   */
+  int ZPush(const SArray<Key>& keys,
+            const SArray<Val>& vals,
+            const SArray<int>& lens = {},
+            int cmd = 0,
+            const Callback& cb = nullptr) {
+    int ts = obj_->NewRequest(kServerGroup);
+    AddCallback(ts, cb);
+    KVPairs<Val> kvs;
+    kvs.keys = keys;
+    kvs.vals = vals;
+    kvs.lens = lens;
+    Send(ts, true, cmd, kvs);
+    return ts;
+  }
+
+  /**
+   * \brief zero-copy Pull
+   *
+   * This function is similar to \ref Pull except that all data
+   * will not be copied into system for better performance. It is the caller's
+   * responsibility to keep the content to be not changed before actually
+   * finished.
+   */
+  int ZPull(const SArray<Key>& keys,
+            SArray<Val>* vals,
+            SArray<int>* lens = nullptr,
+            int cmd = 0,
+            const Callback& cb = nullptr) {
+    return Pull_(keys, vals, lens, cmd, cb);
+  }
+  using SlicedKVs = std::vector<std::pair<bool, KVPairs<Val>>>;
+  /**
+   * \brief a slicer partitions a key-value list according to the key ranges
+   * \param send the kv list for partitioning
+   * \param ranges the key ranges, ranges[i] is the key range of server i
+   * \param sliced the sliced lists. slices[i] should only contains keys in
+   * ranges[i] and the according values
+   */
+  using Slicer = std::function<void(
+      const KVPairs<Val>& send, const std::vector<Range>& ranges,
+      SlicedKVs* sliced)>;
+
+  /**
+   * \brief set a user-defined slicer
+   */
+  void set_slicer(const Slicer& slicer) {
+    CHECK(slicer); slicer_ = slicer;
+  }
+
+ private:
+  /**
+   * \brief internal pull, C/D can be either SArray or std::vector
+   */
+  template <typename C, typename D>
+  int Pull_(const SArray<Key>& keys, C* vals, D* lens,
+            int cmd, const Callback& cb);
+  /**
+   * \brief add a callback for a request. threadsafe.
+   * @param cb callback
+   * @param timestamp the timestamp of the request
+   */
+  void AddCallback(int timestamp, const Callback& cb) {
+    if (!cb) return;
+    std::lock_guard<std::mutex> lk(mu_);
+    callbacks_[timestamp] = cb;
+  }
+
+  /**
+   * \brief run and delete the callback
+   * \param timestamp the timestamp of the callback
+   */
+  void RunCallback(int timestamp);
+  /**
+   * \brief send the kv list to all servers
+   * @param timestamp the timestamp of the request
+   * @param push whether or not it is a push request
+   * @param cmd command
+   */
+  void Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs);
+  /** \brief internal receive handle */
+  void Process(const Message& msg);
+  /** \brief default kv slicer */
+  void DefaultSlicer(const KVPairs<Val>& send,
+                     const std::vector<Range>& ranges,
+                     SlicedKVs* sliced);
+
+  /** \brief data buffer for received kvs for each timestamp */
+  std::unordered_map<int, std::vector<KVPairs<Val>>> recv_kvs_;
+  /** \brief callbacks for each timestamp */
+  std::unordered_map<int, Callback> callbacks_;
+  /** \brief lock */
+  std::mutex mu_;
+  /** \brief kv list slicer */
+  Slicer slicer_;
+};
+
+/** \brief meta information about a kv request */
+struct KVMeta {
+  /** \brief the int cmd */
+  int cmd;
+  /** \brief whether or not this is a push request */
+  bool push;
+  /** \brief sender's node id */
+  int sender;
+  /** \brief the associated timestamp */
+  int timestamp;
+};
+
+/**
+ * \brief A server node for maintaining key-value pairs
+ */
+template <typename Val>
+class KVServer : public SimpleApp {
+ public:
+  /**
+   * \brief constructor
+   * \param app_id the app id, should match with \ref KVWorker's id
+   */
+  explicit KVServer(int app_id) : SimpleApp() {
+    using namespace std::placeholders;
+    obj_ = new Customer(app_id, std::bind(&KVServer<Val>::Process, this, _1));
+  }
+
+  /** \brief deconstructor */
+  virtual ~KVServer() { delete obj_; obj_ = nullptr; }
+
+  /**
+   * \brief the handle to process a push/pull request from a worker
+   * \param req_meta meta-info of this request
+   * \param req_data kv pairs of this request
+   * \param server this pointer
+   */
+  using ReqHandle = std::function<void(const KVMeta& req_meta,
+                                       const KVPairs<Val>& req_data,
+                                       KVServer* server)>;
+  void set_request_handle(const ReqHandle& request_handle) {
+    CHECK(request_handle) << "invalid request handle";
+    request_handle_ = request_handle;
+  }
+
+  /**
+   * \brief response to the push/pull request
+   * \param req the meta-info of the request
+   * \param res the kv pairs that will send back to the worker
+   */
+  void Response(const KVMeta& req, const KVPairs<Val>& res = KVPairs<Val>());
+
+ private:
+  /** \brief internal receive handle */
+  void Process(const Message& msg);
+  /** \brief request handle */
+  ReqHandle request_handle_;
+};
+
+
+/**
+ * \brief an example handle adding pushed kv into store
+ */
+template <typename Val>
+struct KVServerDefaultHandle {
+  void operator()(
+      const KVMeta& req_meta, const KVPairs<Val>& req_data, KVServer<Val>* server) {
+    size_t n = req_data.keys.size();
+    KVPairs<Val> res;
+    if (req_meta.push) {
+      CHECK_EQ(n, req_data.vals.size());
+    } else {
+      res.keys = req_data.keys; res.vals.resize(n);
+    }
+    for (size_t i = 0; i < n; ++i) {
+      Key key = req_data.keys[i];
+      if (req_meta.push) {
+        store[key] += req_data.vals[i];
+      } else {
+        res.vals[i] = store[key];
+      }
+    }
+    server->Response(req_meta, res);
+  }
+  std::unordered_map<Key, Val> store;
+};
+
+
+///////////////////////////////////////////////////////////////////////////////
+
+template <typename Val>
+void KVServer<Val>::Process(const Message& msg) {
+  if (msg.meta.simple_app) {
+    SimpleApp::Process(msg); return;
+  }
+  KVMeta meta;
+  meta.cmd       = msg.meta.head;
+  meta.push      = msg.meta.push;
+  meta.sender    = msg.meta.sender;
+  meta.timestamp = msg.meta.timestamp;
+  KVPairs<Val> data;
+  int n = msg.data.size();
+  if (n) {
+    CHECK_GE(n, 2);
+    data.keys = msg.data[0];
+    data.vals = msg.data[1];
+    if (n > 2) {
+      CHECK_EQ(n, 3);
+      data.lens = msg.data[2];
+      CHECK_EQ(data.lens.size(), data.keys.size());
+    }
+  }
+  CHECK(request_handle_);
+  request_handle_(meta, data, this);
+}
+
+template <typename Val>
+void KVServer<Val>::Response(const KVMeta& req, const KVPairs<Val>& res) {
+  Message msg;
+  msg.meta.customer_id = obj_->id();
+  msg.meta.request     = false;
+  msg.meta.push        = req.push;
+  msg.meta.head        = req.cmd;
+  msg.meta.timestamp   = req.timestamp;
+  msg.meta.recver      = req.sender;
+  if (res.keys.size()) {
+    msg.AddData(res.keys);
+    msg.AddData(res.vals);
+    if (res.lens.size()) {
+      msg.AddData(res.lens);
+    }
+  }
+  Postoffice::Get()->van()->Send(msg);
+}
+
+template <typename Val>
+void KVWorker<Val>::DefaultSlicer(
+    const KVPairs<Val>& send, const std::vector<Range>& ranges,
+    typename KVWorker<Val>::SlicedKVs* sliced) {
+  sliced->resize(ranges.size());
+
+  // find the positions in msg.key
+  size_t n = ranges.size();
+  std::vector<size_t> pos(n+1);
+  const Key* begin = send.keys.begin();
+  const Key* end = send.keys.end();
+  for (size_t i = 0; i < n; ++i) {
+    if (i == 0) {
+      pos[0] = std::lower_bound(begin, end, ranges[0].begin()) - begin;
+      begin += pos[0];
+    } else {
+      CHECK_EQ(ranges[i-1].end(), ranges[i].begin());
+    }
+    size_t len = std::lower_bound(begin, end, ranges[i].end()) - begin;
+    begin += len;
+    pos[i+1] = pos[i] + len;
+
+    // don't send it to severs for empty kv
+    sliced->at(i).first = (len != 0);
+  }
+  CHECK_EQ(pos[n], send.keys.size());
+  if (send.keys.empty()) return;
+
+  // the length of value
+  size_t k = 0, val_begin = 0, val_end = 0;
+  if (send.lens.empty()) {
+    k = send.vals.size() / send.keys.size();
+    CHECK_EQ(k * send.keys.size(), send.vals.size());
+  } else {
+    CHECK_EQ(send.keys.size(), send.lens.size());
+  }
+
+  // slice
+  for (size_t i = 0; i < n; ++i) {
+    if (pos[i+1] == pos[i]) {
+      sliced->at(i).first = false;
+      continue;
+    }
+    sliced->at(i).first = true;
+    auto& kv = sliced->at(i).second;
+    kv.keys = send.keys.segment(pos[i], pos[i+1]);
+    if (send.lens.size()) {
+      kv.lens = send.lens.segment(pos[i], pos[i+1]);
+      for (int l : kv.lens) val_end += l;
+      kv.vals = send.vals.segment(val_begin, val_end);
+      val_begin = val_end;
+    } else {
+      kv.vals = send.vals.segment(pos[i]*k, pos[i+1]*k);
+    }
+  }
+}
+
+template <typename Val>
+void KVWorker<Val>::Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs) {
+  // slice the message
+  SlicedKVs sliced;
+  slicer_(kvs, Postoffice::Get()->GetServerKeyRanges(), &sliced);
+
+  // need to add response first, since it will not always trigger the callback
+  int skipped = 0;
+  for (size_t i = 0; i < sliced.size(); ++i) {
+    if (!sliced[i].first) ++skipped;
+  }
+  obj_->AddResponse(timestamp, skipped);
+  if ((size_t)skipped == sliced.size()) {
+    RunCallback(timestamp);
+  }
+
+  for (size_t i = 0; i < sliced.size(); ++i) {
+    const auto& s = sliced[i];
+    if (!s.first) continue;
+    Message msg;
+    msg.meta.customer_id = obj_->id();
+    msg.meta.request     = true;
+    msg.meta.push        = push;
+    msg.meta.head        = cmd;
+    msg.meta.timestamp   = timestamp;
+    msg.meta.recver      = Postoffice::Get()->ServerRankToID(i);
+    const auto& kvs = s.second;
+    if (kvs.keys.size()) {
+      msg.AddData(kvs.keys);
+      msg.AddData(kvs.vals);
+      if (kvs.lens.size()) {
+        msg.AddData(kvs.lens);
+      }
+    }
+    Postoffice::Get()->van()->Send(msg);
+  }
+}
+
+
+template <typename Val>
+void KVWorker<Val>::Process(const Message& msg) {
+  if (msg.meta.simple_app) {
+    SimpleApp::Process(msg); return;
+  }
+
+  // store the data for pulling
+  int ts = msg.meta.timestamp;
+  if (!msg.meta.push && msg.data.size()) {
+    CHECK_GE(msg.data.size(), (size_t)2);
+    KVPairs<Val> kvs;
+    kvs.keys = msg.data[0];
+    kvs.vals = msg.data[1];
+    if (msg.data.size() > (size_t)2) {
+      kvs.lens = msg.data[2];
+    }
+    mu_.lock();
+    recv_kvs_[ts].push_back(kvs);
+    mu_.unlock();
+  }
+
+  // finished, run callbacks
+  if (obj_->NumResponse(ts) == Postoffice::Get()->num_servers() - 1)  {
+    RunCallback(ts);
+  }
+}
+template <typename Val>
+void KVWorker<Val>::RunCallback(int timestamp) {
+  mu_.lock();
+  auto it = callbacks_.find(timestamp);
+  if (it != callbacks_.end()) {
+    mu_.unlock();
+
+    CHECK(it->second);
+    it->second();
+
+    mu_.lock();
+    callbacks_.erase(it);
+  }
+  mu_.unlock();
+}
+
+template <typename Val>
+template <typename C, typename D>
+int KVWorker<Val>::Pull_(
+    const SArray<Key>& keys, C* vals, D* lens, int cmd, const Callback& cb) {
+  int ts = obj_->NewRequest(kServerGroup);
+  AddCallback(ts, [this, ts, keys, vals, lens, cb]() mutable {
+      mu_.lock();
+      auto& kvs = recv_kvs_[ts];
+      mu_.unlock();
+
+      // do check
+      size_t total_key = 0, total_val = 0;
+      for (const auto& s : kvs) {
+        Range range = FindRange(keys, s.keys.front(), s.keys.back()+1);
+        CHECK_EQ(range.size(), s.keys.size())
+            << "unmatched keys size from one server";
+        if (lens) CHECK_EQ(s.lens.size(), s.keys.size());
+        total_key += s.keys.size();
+        total_val += s.vals.size();
+      }
+      CHECK_EQ(total_key, keys.size()) << "lost some servers?";
+
+      // fill vals and lens
+      std::sort(kvs.begin(), kvs.end(), [](
+          const KVPairs<Val>& a, const KVPairs<Val>& b) {
+                  return a.keys.front() < b.keys.front();
+        });
+      CHECK_NOTNULL(vals);
+      if (vals->empty()) {
+        vals->resize(total_val);
+      } else {
+        CHECK_EQ(vals->size(), total_val);
+      }
+      Val* p_vals = vals->data();
+      int *p_lens = nullptr;
+      if (lens) {
+        if (lens->empty()) {
+          lens->resize(keys.size());
+        } else {
+          CHECK_EQ(lens->size(), keys.size());
+        }
+        p_lens = lens->data();
+      }
+      for (const auto& s : kvs) {
+        memcpy(p_vals, s.vals.data(), s.vals.size() * sizeof(Val));
+        p_vals += s.vals.size();
+        if (p_lens) {
+          memcpy(p_lens, s.lens.data(), s.lens.size() * sizeof(int));
+          p_lens += s.lens.size();
+        }
+      }
+
+      mu_.lock();
+      recv_kvs_.erase(ts);
+      mu_.unlock();
+      if (cb) cb();
+    });
+
+  KVPairs<Val> kvs; kvs.keys = keys;
+  Send(ts, false, cmd, kvs);
+  return ts;
+}
+
+}  // namespace ps
+#endif  // PS_KV_APP_H_
diff --git a/ps-lite/include/ps/ps.h b/ps-lite/include/ps/ps.h
new file mode 100644
index 00000000..7c76bfcc
--- /dev/null
+++ b/ps-lite/include/ps/ps.h
@@ -0,0 +1,78 @@
+/*!
+ *  Copyright (c) 2015 by Contributors
+ * @file   ps.h
+ * \brief  The parameter server interface
+ */
+#ifndef PS_PS_H_
+#define PS_PS_H_
+/** \brief basic setups in ps */
+#include "ps/base.h"
+/** \brief communicating with a pair of (int, string). */
+#include "ps/simple_app.h"
+/** \brief communcating with a list of key-value paris. */
+#include "ps/kv_app.h"
+namespace ps {
+/** \brief Returns the number of worker nodes */
+inline int NumWorkers() { return Postoffice::Get()->num_workers(); }
+/** \brief Returns the number of server nodes */
+inline int NumServers() { return Postoffice::Get()->num_servers(); }
+/** \brief Returns true if this node is a worker node */
+inline bool IsWorker() { return Postoffice::Get()->is_worker(); }
+/** \brief Returns true if this node is a server node. */
+inline bool IsServer() { return Postoffice::Get()->is_server(); }
+/** \brief Returns true if this node is a scheduler node. */
+inline bool IsScheduler() { return Postoffice::Get()->is_scheduler(); }
+/** \brief Returns the rank of this node in its group
+ *
+ * Each worker will have a unique rank within [0, NumWorkers()). So are
+ * servers. This function is available only after \ref Start has been called.
+ */
+inline int MyRank() { return Postoffice::Get()->my_rank(); }
+/**
+ * \brief start the system
+ *
+ * This function will block until every nodes are started.
+ * \param argv0 the program name, used for logging
+ */
+inline void Start(const char* argv0 = nullptr) {
+  Postoffice::Get()->Start(argv0, true);
+}
+/**
+ * \brief start the system
+ *
+ * This function will NOT block.
+ * \param argv0 the program name, used for logging
+ */
+inline void StartAsync(const char* argv0 = nullptr) {
+  Postoffice::Get()->Start(argv0, false);
+}
+/**
+ * \brief terminate the system
+ *
+ * All nodes should call this function before existing. 
+ * \param do_barrier whether to block until every node is finalized, default true.
+ */
+inline void Finalize(const bool do_barrier = true) {
+  Postoffice::Get()->Finalize(do_barrier);
+}
+/**
+ * \brief Register a callback to the system which is called after Finalize()
+ *
+ * The following codes are equal
+ * \code {cpp}
+ * RegisterExitCallback(cb);
+ * Finalize();
+ * \endcode
+ *
+ * \code {cpp}
+ * Finalize();
+ * cb();
+ * \endcode
+ * \param cb the callback function
+ */
+inline void RegisterExitCallback(const std::function<void()>& cb) {
+  Postoffice::Get()->RegisterExitCallback(cb);
+}
+
+}  // namespace ps
+#endif  // PS_PS_H_
diff --git a/ps-lite/include/ps/range.h b/ps-lite/include/ps/range.h
new file mode 100644
index 00000000..7e5cc34a
--- /dev/null
+++ b/ps-lite/include/ps/range.h
@@ -0,0 +1,26 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_RANGE_H_
+#define PS_RANGE_H_
+#include "ps/internal/utils.h"
+namespace ps {
+
+/**
+ * \brief a range [begin, end)
+ */
+class Range {
+ public:
+  Range() : Range(0, 0) {}
+  Range(uint64_t begin, uint64_t end) : begin_(begin), end_(end) { }
+
+  uint64_t begin() const { return begin_; }
+  uint64_t end() const { return end_; }
+  uint64_t size() const { return end_ - begin_; }
+ private:
+  uint64_t begin_;
+  uint64_t end_;
+};
+
+}  // namespace ps
+#endif  // PS_RANGE_H_
diff --git a/ps-lite/include/ps/sarray.h b/ps-lite/include/ps/sarray.h
new file mode 100644
index 00000000..4ad17dd9
--- /dev/null
+++ b/ps-lite/include/ps/sarray.h
@@ -0,0 +1,315 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_SARRAY_H_
+#define PS_SARRAY_H_
+#include <string.h>
+#include <string>
+#include <vector>
+#include <memory>
+#include <sstream>
+#include "ps/internal/utils.h"
+#include "ps/range.h"
+namespace ps {
+
+/**
+ * \brief Shared array
+ *
+ * A smart array that retains shared ownership. It provides similar
+ * functionalities comparing to std::vector, including data(), size(),
+ * operator[], resize(), clear(). SArray can be easily constructed from
+ * std::vector, such as
+ *
+ * \code
+ * std::vector<int> a(10); SArray<int> b(a);  // copying
+ * std::shared_ptr<std::vector<int>> c(new std::vector<int>(10));
+ * SArray<int> d(c);  // only pointer copying
+ * \endcode
+ *
+ * SArray is also like a C pointer when copying and assigning, namely
+ * both copy are assign are passing by pointers. The memory will be release only
+ * if there is no copy exists. It is also can be cast without memory copy, such as
+ *
+ * \code
+ * SArray<int> a(10);
+ * SArray<char> b(a);  // now b.size() = 10 * sizeof(int);
+ * \endcode
+ *
+ * \tparam V the value type
+ */
+template<typename V>
+class SArray {
+ public:
+  /** \brief empty constructor */
+  SArray() { }
+
+  /** \brief empty deconstrcutor */
+  ~SArray() { }
+
+  /**
+   * \brief Create an array with length n with initialized value
+   * \param size the length
+   * \param val the initial length (0 in default)
+   */
+  explicit SArray(size_t size, V val = 0) { resize(size, val); }
+
+
+  /**
+   * \brief construct from another SArray.
+   *
+   * Zero-copy constructor, namely just copy the pointer
+   *
+   * \tparam W the value type of the source array
+   * \param arr the source array
+   */
+  template <typename W>
+  explicit SArray(const SArray<W>& arr) { *this = arr; }
+
+  /**
+   * \brief construct from another SArray.
+   *
+   * Zero-copy constructor, namely just copy the pointer
+   *
+   * \tparam W the value type of the source array
+   * \param arr the source array
+   */
+  template <typename W> void operator=(const SArray<W>& arr) {
+    size_ = arr.size() * sizeof(W) / sizeof(V);
+    CHECK_EQ(size_ * sizeof(V), arr.size() * sizeof(W)) << "cannot be divided";
+    capacity_ = arr.capacity() * sizeof(W) / sizeof(V);
+    ptr_ = std::shared_ptr<V>(arr.ptr(), reinterpret_cast<V*>(arr.data()));
+  }
+
+  /**
+   * \brief construct from a c-array
+   *
+   * Zero-copy constructor, namely just copy the pointer
+   *
+   * \param data the source data
+   * \param size the length
+   * \param deletable whether or not can call `delete [] data` when the reference
+   * count goes 0
+   */
+
+  SArray(V* data, size_t size, bool deletable = false) {
+    if (deletable) {
+      reset(data, size, [](V* data){ delete [] data; });
+    } else {
+      reset(data, size, [](V* data) { });
+    }
+  }
+
+  /**
+   * \brief copy from a c-array
+   *
+   * \param data the source data
+   * \param size the length
+   */
+  void CopyFrom(const V* data, size_t size) {
+    resize(size);
+    memcpy(this->data(), data, size*sizeof(V));
+  }
+
+  /**
+   * \brief copy from another SArray
+   *
+   * \param other the source data
+   */
+  void CopyFrom(const SArray<V>& other) {
+    if (this == &other) return;
+    CopyFrom(other.data(), other.size());
+  }
+
+  /**
+   * \brief copy from an iterator
+   */
+  template <typename ForwardIt>
+  void CopyFrom(const ForwardIt& first, const ForwardIt& last) {
+    int size = static_cast<int>(std::distance(first, last));
+    V* data = new V[size];
+    reset(data, size, [](V* data){ delete [] data; });
+    auto it = first;
+    while (size-- > 0) { *data = *it; ++data; ++it; }
+  }
+
+  /**
+   * \brief construct from a std::vector, copy the data
+   */
+  explicit SArray(const std::vector<V>& vec) { CopyFrom(vec.data(), vec.size()); }
+
+  /**
+   * \brief construct from a shared std::vector pinter, no data copy
+   */
+  explicit SArray(const std::shared_ptr<std::vector<V>>& vec) {
+    ptr_ = std::shared_ptr<V>(vec, vec->data());
+    size_ = vec->size();
+    capacity_ = size_;
+  }
+
+  /** @brief Copy from a initializer_list */
+  template <typename W> SArray(const std::initializer_list<W>& list) {
+    CopyFrom(list.begin(), list.end());
+  }
+
+  /** @brief Copy from a initializer_list */
+  template <typename W> void operator=(const std::initializer_list<W>& list) {
+    CopyFrom(list.begin(), list.end());
+  }
+
+  /**
+   * @brief Reset the current data pointer with a deleter
+   */
+  template <typename Deleter>
+  void reset(V* data, size_t size, Deleter del) {
+    size_ = size; capacity_ = size; ptr_.reset(data, del);
+  }
+
+  /**
+   * @brief Resizes the array to size elements
+   *
+   * If size <= capacity_, then only change the size. otherwise, append size -
+   * current_size entries, and then set new value to val
+   */
+  void resize(size_t size, V val = 0) {
+    size_t cur_n = size_;
+    if (capacity_ >= size) {
+      size_ = size;
+    } else {
+      V* new_data = new V[size+5];
+      memcpy(new_data, data(), size_*sizeof(V));
+      reset(new_data, size, [](V* data){ delete [] data; });
+    }
+    if (size <= cur_n) return;
+    V* p = data() + cur_n;
+    if (val == 0) {
+      memset(p, 0, (size - cur_n)*sizeof(V));
+    } else {
+      for (size_t i = 0; i < size - cur_n; ++i) { *p = val; ++p; }
+    }
+  }
+
+  /**
+   * @brief Requests that the capacity be at least enough to contain n elements.
+   */
+  void reserve(size_t size) {
+    if (capacity_ >= size) { return; }
+    size_t old_size = size_;
+    resize(size);
+    size_ = old_size;
+  }
+
+  /** @brief release the memory */
+  void clear() { reset(nullptr, 0, [](V* data) {}); }
+
+
+  inline bool empty() const { return size() == 0; }
+  inline size_t size() const { return size_; }
+  inline size_t capacity() const { return capacity_; }
+
+  inline V* begin() { return data(); }
+  inline const V* begin() const { return data(); }
+  inline V* end() { return data() + size(); }
+  inline const V* end() const { return data() + size(); }
+
+  inline V* data() const { return ptr_.get(); }
+
+  /** \brief get the shared pointer */
+  inline std::shared_ptr<V>& ptr() { return ptr_; }
+  /** \brief get the const shared pointer */
+  inline const std::shared_ptr<V>& ptr() const { return ptr_; }
+
+  inline V back() const { CHECK(!empty()); return data()[size_-1]; }
+  inline V front() const { CHECK(!empty()); return data()[0]; }
+  inline V& operator[] (int i) { return data()[i]; }
+  inline const V& operator[] (int i) const { return data()[i]; }
+
+  inline void push_back(const V& val) {
+    if (size_ == capacity_) reserve(size_*2+5);
+    data()[size_++] = val;
+  }
+
+  void pop_back() { if (size_) --size_; }
+
+  void append(const SArray<V>& arr) {
+    if (arr.empty()) return;
+    auto orig_size = size_;
+    resize(size_ + arr.size());
+    memcpy(data()+orig_size, arr.data(), arr.size()*sizeof(V));
+  }
+
+
+  /**
+   * @brief Slice a segment, zero-copy
+   *
+   * @param begin the start index segment
+   * @param end the end index segment
+   * @return the segment [begin, end)
+   */
+  SArray<V> segment(size_t begin, size_t end) const {
+    CHECK_GE(end, begin); CHECK_LE(end, size());
+    SArray<V> ret;
+    ret.ptr_ = std::shared_ptr<V>(ptr_, data() + begin);
+    ret.size_ = end - begin;
+    ret.capacity_ = end - begin;
+    return ret;
+  }
+
+ private:
+  size_t size_ = 0;
+  size_t capacity_ = 0;
+  std::shared_ptr<V> ptr_;
+};
+
+
+/**
+ * \brief Find the index range of a segment of a sorted array such that the
+ * entries in this segment is within [lower, upper). Assume
+ * array values are ordered.
+ *
+ * An example
+ * \code{cpp}
+ * SArray<int> a{1 3 5 7 9};
+ * CHECK_EQ(Range(1,3), FindRange(a, 2, 7);
+ * \endcode
+ *
+ * \param arr the source array
+ * \param lower the lower bound
+ * \param upper the upper bound
+ *
+ * \return the index range
+ */
+template<typename V>
+Range FindRange(const SArray<V>& arr, V lower, V upper) {
+  if (upper <= lower) return Range(0, 0);
+  auto lb = std::lower_bound(arr.begin(), arr.end(), lower);
+  auto ub = std::lower_bound(arr.begin(), arr.end(), upper);
+  return Range(lb - arr.begin(), ub - arr.begin());
+}
+
+
+/*! \brief returns a short debug string */
+template <typename V>
+inline std::string DebugStr(const V* data, int n, int m = 5) {
+  std::stringstream ss;
+  ss << "[" << n << "]: ";
+  if (n < 2 * m) {
+    for (int i = 0; i < n; ++i) ss << data[i] << " ";
+  } else {
+    for (int i = 0; i < m; ++i) ss << data[i] << " ";
+    ss << "... ";
+    for (int i = n-m; i < n; ++i) ss << data[i] << " ";
+  }
+  return ss.str();
+}
+
+/**
+ * \brief print a debug string
+ */
+template <typename V>
+std::ostream& operator<<(std::ostream& os, const SArray<V>& obj) {
+  os << DebugStr(obj.data(), obj.size());
+  return os;
+}
+
+}  // namespace ps
+#endif  // PS_SARRAY_H_
diff --git a/ps-lite/include/ps/simple_app.h b/ps-lite/include/ps/simple_app.h
new file mode 100644
index 00000000..70ce51bf
--- /dev/null
+++ b/ps-lite/include/ps/simple_app.h
@@ -0,0 +1,179 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_SIMPLE_APP_H_
+#define PS_SIMPLE_APP_H_
+#include <string>
+#include "ps/internal/message.h"
+#include "ps/internal/postoffice.h"
+namespace ps {
+
+/**
+ * \brief the format for a received request or reponse for \ref SimpleApp
+ */
+struct SimpleData {
+  /** \brief the int head */
+  int head;
+  /** \brief the string body */
+  std::string body;
+  /** \brief sender's node id */
+  int sender;
+  /** \brief the associated timestamp */
+  int timestamp;
+};
+
+/**
+ * \brief a simple app
+ *
+ * It provides basic communcation with a pair of int (head) and string (body)
+ */
+class SimpleApp {
+ public:
+  /**
+   * \brief constructor
+   * @param app_id the app id, should match with the remote node app with which this app
+   * is communicated
+   */
+  explicit SimpleApp(int app_id);
+
+  /** \brief deconstructor */
+  virtual ~SimpleApp() { delete obj_; obj_ = nullptr; }
+
+  /**
+   * \brief send a request to a remote node
+   *
+   * \param req_head request head
+   * \param req_body request body
+   * \param recv_id remote node id
+   *
+   * @return the timestamp of this request
+   */
+  virtual inline int Request(int req_head, const std::string& req_body, int recv_id);
+
+  /**
+   * \brief wait until a request is finished
+   *
+   * \param timestamp
+   */
+  virtual inline void Wait(int timestamp) { obj_->WaitRequest(timestamp); }
+
+
+  /**
+   * \brief send back a response for a request
+   * \param recv_req the received request
+   * \param the response body
+   */
+  virtual inline void Response(const SimpleData& recv_req, const std::string& res_body = "");
+
+  /**
+   * \brief the handle to proces a received request/respoonse
+   *
+   * \param recved the received request or response
+   * \param app this pointer
+   */
+  using Handle = std::function<void(const SimpleData& recved, SimpleApp* app)>;
+
+  /**
+   * \brief set the request handle
+   * \param request_handle the request handle
+   */
+  virtual inline void set_request_handle(const Handle& request_handle) {
+    CHECK(request_handle) << "invalid request handle";
+    request_handle_ = request_handle;
+  }
+
+  /**
+   * \brief set the response handle
+   * \param response_handle the response handle
+   */
+  virtual inline void set_response_handle(const Handle& response_handle) {
+    CHECK(response_handle) << "invalid response handle";
+    response_handle_ = response_handle;
+  }
+
+  /**
+   * \brief returns the customer
+   */
+  virtual inline Customer* get_customer() { return obj_; }
+
+ protected:
+  /** \brief empty construct */
+  inline SimpleApp() : obj_(nullptr) {
+    request_handle_ = [](const SimpleData& recved, SimpleApp* app) {
+      app->Response(recved);
+    };
+    response_handle_ = [](const SimpleData& recved, SimpleApp* app) { };
+  }
+
+  /** \brief process a received message */
+  virtual inline void Process(const Message& msg);
+
+  /** \brief ps internal object */
+  Customer* obj_;
+
+ private:
+  /** \brief request handle */
+  Handle request_handle_;
+  /** \brief request handle */
+  Handle response_handle_;
+};
+
+////////////////////////////////////////////////////////////////////////////////
+
+inline SimpleApp::SimpleApp(int app_id) : SimpleApp() {
+  using namespace std::placeholders;
+  obj_ = new Customer(app_id, std::bind(&SimpleApp::Process, this, _1));
+}
+
+inline int SimpleApp::Request(int req_head, const std::string& req_body, int recv_id) {
+  // setup message
+  Message msg;
+  msg.meta.head = req_head;
+  if (req_body.size()) msg.meta.body = req_body;
+  int ts = obj_->NewRequest(recv_id);
+  msg.meta.timestamp = ts;
+  msg.meta.request = true;
+  msg.meta.simple_app = true;
+  msg.meta.customer_id = obj_->id();
+
+  // send
+  for (int r : Postoffice::Get()->GetNodeIDs(recv_id)) {
+    msg.meta.recver = r;
+    Postoffice::Get()->van()->Send(msg);
+  }
+  return ts;
+}
+
+inline void SimpleApp::Response(const SimpleData& req, const std::string& res_body) {
+  // setup message
+  Message msg;
+  msg.meta.head = req.head;
+  if (res_body.size()) msg.meta.body = res_body;
+  msg.meta.timestamp = req.timestamp;
+  msg.meta.request = false;
+  msg.meta.simple_app = true;
+  msg.meta.customer_id = obj_->id();
+  msg.meta.recver = req.sender;
+
+  // send
+  Postoffice::Get()->van()->Send(msg);
+}
+
+
+inline void SimpleApp::Process(const Message& msg) {
+  SimpleData recv;
+  recv.sender    = msg.meta.sender;
+  recv.head      = msg.meta.head;
+  recv.body      = msg.meta.body;
+  recv.timestamp = msg.meta.timestamp;
+  if (msg.meta.request) {
+    CHECK(request_handle_);
+    request_handle_(recv, this);
+  } else {
+    CHECK(response_handle_);
+    response_handle_(recv, this);
+  }
+}
+
+}  // namespace ps
+#endif  // PS_SIMPLE_APP_H_
diff --git a/ps-lite/make/deps.mk b/ps-lite/make/deps.mk
new file mode 100644
index 00000000..a76e18c1
--- /dev/null
+++ b/ps-lite/make/deps.mk
@@ -0,0 +1,68 @@
+# Install dependencies
+
+URL=https://raw.githubusercontent.com/mli/deps/master/build
+ifndef WGET
+WGET = wget
+endif
+
+# protobuf
+PROTOBUF = ${DEPS_PATH}/include/google/protobuf/message.h
+${PROTOBUF}:
+	$(eval FILE=protobuf-2.5.0.tar.gz)
+	$(eval DIR=protobuf-2.5.0)
+	rm -rf $(FILE) $(DIR)
+	$(WGET) $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
+	cd $(DIR) && export CFLAGS=-fPIC && export CXXFLAGS=-fPIC && ./configure -prefix=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
+	rm -rf $(FILE) $(DIR)
+
+# zmq
+ZMQ = ${DEPS_PATH}/include/zmq.h
+
+${ZMQ}:
+	$(eval FILE=zeromq-4.1.4.tar.gz)
+	$(eval DIR=zeromq-4.1.4)
+	rm -rf $(FILE) $(DIR)
+	$(WGET) $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
+	cd $(DIR) && export CFLAGS=-fPIC && export CXXFLAGS=-fPIC && ./configure -prefix=$(DEPS_PATH) --with-libsodium=no --with-libgssapi_krb5=no && $(MAKE) && $(MAKE) install
+	rm -rf $(FILE) $(DIR)
+
+# lz4
+LZ4 = ${DEPS_PATH}/include/lz4.h
+${LZ4}:
+	$(eval FILE=lz4-r129.tar.gz)
+	$(eval DIR=lz4-r129)
+	rm -rf $(FILE) $(DIR)
+	wget $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
+	cd $(DIR) && $(MAKE) && PREFIX=$(DEPS_PATH) $(MAKE) install
+	rm -rf $(FILE) $(DIR)
+
+# cityhash
+CITYHASH = ${DEPS_PATH}/include/city.h
+${CITYHASH}:
+	$(eval FILE=cityhash-1.1.1.tar.gz)
+	$(eval DIR=cityhash-1.1.1)
+	rm -rf $(FILE) $(DIR)
+	wget $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
+	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) --enable-sse4.2 && $(MAKE) CXXFLAGS="-g -O3 -msse4.2" && $(MAKE) install
+	rm -rf $(FILE) $(DIR)
+
+
+# # gflags
+# ${DEPS_PATH}/include/google/gflags.h:
+# 	$(eval FILE=gflags-2.0-no-svn-files.tar.gz)
+# 	$(eval DIR=gflags-2.0)
+# 	rm -rf $(FILE) $(DIR)
+# 	wget $(URL)/$(FILE) && tar -zxf $(FILE)
+# 	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
+# 	rm -rf $(FILE) $(DIR)
+# gflags: | ${DEPS_PATH}/include/google/gflags.h
+
+# # glog
+# ${DEPS_PATH}/include/glog/logging.h: | ${DEPS_PATH}/include/google/gflags.h
+# 	$(eval FILE=v0.3.4.tar.gz)
+# 	$(eval DIR=glog-0.3.4)
+# 	rm -rf $(FILE) $(DIR)
+# 	wget https://github.com/google/glog/archive/$(FILE) && tar -zxf $(FILE)
+# 	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) --with-gflags=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
+# 	rm -rf $(FILE) $(DIR)
+# glog: | ${DEPS_PATH}/include/glog/logging.h
diff --git a/ps-lite/make/ps.mk b/ps-lite/make/ps.mk
new file mode 100644
index 00000000..0b0f678d
--- /dev/null
+++ b/ps-lite/make/ps.mk
@@ -0,0 +1,13 @@
+#---------------------------------------------------------------------------------------
+#  parameter server configuration script
+#
+#  include ps.mk after the variables are set
+#
+#----------------------------------------------------------------------------------------
+
+ifeq ($(USE_KEY32), 1)
+ADD_CFLAGS += -DUSE_KEY32=1
+endif
+
+PS_LDFLAGS_SO = -L$(DEPS_PATH)/lib -lprotobuf-lite -lzmq
+PS_LDFLAGS_A = $(addprefix $(DEPS_PATH)/lib/, libprotobuf-lite.a libzmq.a)
diff --git a/ps-lite/src/customer.cc b/ps-lite/src/customer.cc
new file mode 100644
index 00000000..e88e8ab2
--- /dev/null
+++ b/ps-lite/src/customer.cc
@@ -0,0 +1,66 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#include "ps/internal/customer.h"
+#include "ps/internal/postoffice.h"
+namespace ps {
+
+const int Node::kEmpty = std::numeric_limits<int>::max();
+const int Meta::kEmpty = std::numeric_limits<int>::max();
+
+Customer::Customer(int id, const Customer::RecvHandle& recv_handle)
+    : id_(id), recv_handle_(recv_handle) {
+  Postoffice::Get()->AddCustomer(this);
+  recv_thread_ = std::unique_ptr<std::thread>(new std::thread(&Customer::Receiving, this));
+}
+
+Customer::~Customer() {
+  Postoffice::Get()->RemoveCustomer(this);
+  Message msg;
+  msg.meta.control.cmd = Control::TERMINATE;
+  recv_queue_.Push(msg);
+  recv_thread_->join();
+}
+
+int Customer::NewRequest(int recver) {
+  std::lock_guard<std::mutex> lk(tracker_mu_);
+  int num = Postoffice::Get()->GetNodeIDs(recver).size();
+  tracker_.push_back(std::make_pair(num, 0));
+  return tracker_.size() - 1;
+}
+
+void Customer::WaitRequest(int timestamp) {
+  std::unique_lock<std::mutex> lk(tracker_mu_);
+  tracker_cond_.wait(lk, [this, timestamp]{
+      return tracker_[timestamp].first == tracker_[timestamp].second;
+    });
+}
+
+int Customer::NumResponse(int timestamp) {
+  std::lock_guard<std::mutex> lk(tracker_mu_);
+  return tracker_[timestamp].second;
+}
+
+void Customer::AddResponse(int timestamp, int num) {
+  std::lock_guard<std::mutex> lk(tracker_mu_);
+  tracker_[timestamp].second += num;
+}
+
+void Customer::Receiving() {
+  while (true) {
+    Message recv;
+    recv_queue_.WaitAndPop(&recv);
+    if (!recv.meta.control.empty() &&
+        recv.meta.control.cmd == Control::TERMINATE) {
+      break;
+    }
+    recv_handle_(recv);
+    if (!recv.meta.request) {
+      std::lock_guard<std::mutex> lk(tracker_mu_);
+      tracker_[recv.meta.timestamp].second++;
+      tracker_cond_.notify_all();
+    }
+  }
+}
+
+}  // namespace ps
diff --git a/ps-lite/src/meta.proto b/ps-lite/src/meta.proto
new file mode 100644
index 00000000..c23dd8c3
--- /dev/null
+++ b/ps-lite/src/meta.proto
@@ -0,0 +1,49 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+package ps;
+option optimize_for = LITE_RUNTIME;
+
+message PBNode {
+  // the node role
+  required int32 role = 1;
+  // node id
+  optional int32 id = 2;
+  // hostname or ip
+  optional string hostname = 3;
+  // the port this node is binding
+  optional int32 port = 4;
+  // whether this node is created by failover
+  optional bool is_recovery = 5;
+}
+
+// system control info
+message PBControl {
+  required int32 cmd = 1;
+  repeated PBNode node = 2;
+  optional int32 barrier_group = 3;
+  optional uint64 msg_sig = 4;
+}
+
+// mete information about a message
+message PBMeta {
+  // message.head
+  optional int32 head = 1;
+  // message.body
+  optional bytes body = 2;
+  // if set, then it is system control task. otherwise, it is for app
+  optional PBControl control = 3;
+  // true: a request task
+  // false: the response task to the request task with the same *time*
+  optional bool request = 4 [default = false];
+  // the unique id of an customer
+  optional int32 customer_id = 7;
+  // the timestamp of this message
+  optional int32 timestamp = 8;
+  // data type of message.data[i]
+  repeated int32 data_type = 9 [packed=true];
+  // whether or not a push message
+  optional bool push = 5;
+  // whether or not it's for SimpleApp
+  optional bool simple_app = 6 [default = false];
+}
diff --git a/ps-lite/src/network_utils.h b/ps-lite/src/network_utils.h
new file mode 100644
index 00000000..534616c9
--- /dev/null
+++ b/ps-lite/src/network_utils.h
@@ -0,0 +1,258 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ * @file   network_utils.h
+ * @brief  network utilities
+ */
+#ifndef PS_NETWORK_UTILS_H_
+#define PS_NETWORK_UTILS_H_
+#include <unistd.h>
+#ifdef _MSC_VER
+#include <tchar.h>
+#include <winsock2.h>
+#include <windows.h>
+#include <iphlpapi.h>
+#undef interface
+#else
+#include <net/if.h>
+#include <arpa/inet.h>
+#include <ifaddrs.h>
+#include <netinet/in.h>
+#endif
+#include <string>
+
+namespace ps {
+
+/**
+ * \brief return the IP address for given interface eth0, eth1, ...
+ */
+void GetIP(const std::string& interface, std::string* ip) {
+#ifdef _MSC_VER
+  typedef std::basic_string<TCHAR> tstring;
+  // Try to get the Adapters-info table, so we can given useful names to the IP
+  // addresses we are returning.  Gotta call GetAdaptersInfo() up to 5 times to handle
+  // the potential race condition between the size-query call and the get-data call.
+  // I love a well-designed API :^P
+  IP_ADAPTER_INFO * pAdapterInfo = NULL;
+  {
+    ULONG bufLen = 0;
+    for (int i = 0; i < 5; i++) {
+      DWORD apRet = GetAdaptersInfo(pAdapterInfo, &bufLen);
+      if (apRet == ERROR_BUFFER_OVERFLOW) {
+        free(pAdapterInfo);  // in case we had previously allocated it
+        pAdapterInfo = static_cast<IP_ADAPTER_INFO*>(malloc(bufLen));
+      } else if (apRet == ERROR_SUCCESS) {
+        break;
+      } else {
+        free(pAdapterInfo);
+        pAdapterInfo = NULL;
+        break;
+      }
+    }
+  }
+  if (pAdapterInfo) {
+    tstring keybase = _T(
+        "SYSTEM\\CurrentControlSet\\Control\\Network\\{4D36E972-E325-11CE-BFC1-08002BE10318}\\");
+    tstring connection = _T("\\Connection");
+
+    IP_ADAPTER_INFO *curpAdapterInfo = pAdapterInfo;
+    while (curpAdapterInfo) {
+      HKEY hKEY;
+      std::string AdapterName = curpAdapterInfo->AdapterName;
+      // GUID only ascii
+      tstring key_set = keybase + tstring(AdapterName.begin(), AdapterName.end()) + connection;
+      LPCTSTR data_Set = key_set.c_str();
+      LPCTSTR dwValue = NULL;
+      if (ERROR_SUCCESS ==
+          ::RegOpenKeyEx(HKEY_LOCAL_MACHINE, data_Set, 0, KEY_READ, &hKEY)) {
+        DWORD dwSize = 0;
+        DWORD dwType = REG_SZ;
+        if (ERROR_SUCCESS ==
+            ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
+          dwValue = new TCHAR[dwSize];
+          if (ERROR_SUCCESS ==
+              ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
+            // interface name must only ascii
+            tstring tstr = dwValue;
+            std::string s(tstr.begin(), tstr.end());
+            if (s == interface) {
+              *ip = curpAdapterInfo->IpAddressList.IpAddress.String;
+              break;
+            }
+          }
+        }
+        ::RegCloseKey(hKEY);
+      }
+      curpAdapterInfo = curpAdapterInfo->Next;
+    }
+    free(pAdapterInfo);
+  }
+#else
+  struct ifaddrs * ifAddrStruct = NULL;
+  struct ifaddrs * ifa = NULL;
+  void * tmpAddrPtr = NULL;
+
+  getifaddrs(&ifAddrStruct);
+  for (ifa = ifAddrStruct; ifa != NULL; ifa = ifa->ifa_next) {
+    if (ifa->ifa_addr == NULL) continue;
+    if (ifa->ifa_addr->sa_family == AF_INET) {
+      // is a valid IP4 Address
+      tmpAddrPtr = &(reinterpret_cast<struct sockaddr_in*>(ifa->ifa_addr))->sin_addr;
+      char addressBuffer[INET_ADDRSTRLEN];
+      inet_ntop(AF_INET, tmpAddrPtr, addressBuffer, INET_ADDRSTRLEN);
+      if (strncmp(ifa->ifa_name,
+                  interface.c_str(),
+                  interface.size()) == 0) {
+        *ip = addressBuffer;
+        break;
+      }
+    }
+  }
+  if (ifAddrStruct != NULL) freeifaddrs(ifAddrStruct);
+#endif
+}
+
+
+/**
+ * \brief return the IP address and Interface the first interface which is not
+ * loopback
+ *
+ * only support IPv4
+ */
+void GetAvailableInterfaceAndIP(
+    std::string* interface, std::string* ip) {
+#ifdef _MSC_VER
+  typedef std::basic_string<TCHAR> tstring;
+  IP_ADAPTER_INFO * pAdapterInfo = NULL;
+  {
+    ULONG bufLen = 0;
+    for (int i = 0; i < 5; i++) {
+      DWORD apRet = GetAdaptersInfo(pAdapterInfo, &bufLen);
+      if (apRet == ERROR_BUFFER_OVERFLOW) {
+        free(pAdapterInfo);  // in case we had previously allocated it
+        pAdapterInfo = static_cast<IP_ADAPTER_INFO*>(malloc(bufLen));
+      } else if (apRet == ERROR_SUCCESS) {
+        break;
+      } else {
+        free(pAdapterInfo);
+        pAdapterInfo = NULL;
+        break;
+      }
+    }
+  }
+  if (pAdapterInfo) {
+    tstring keybase = _T(
+        "SYSTEM\\CurrentControlSet\\Control\\Network\\{4D36E972-E325-11CE-BFC1-08002BE10318}\\");
+    tstring connection = _T("\\Connection");
+
+    IP_ADAPTER_INFO *curpAdapterInfo = pAdapterInfo;
+    HKEY hKEY = NULL;
+    while (curpAdapterInfo) {
+      std::string curip(curpAdapterInfo->IpAddressList.IpAddress.String);
+      if (curip == "127.0.0.1") {
+        curpAdapterInfo = curpAdapterInfo->Next;
+        continue;
+      }
+      if (curip == "0.0.0.0") {
+        curpAdapterInfo = curpAdapterInfo->Next;
+        continue;
+      }
+
+      std::string AdapterName = curpAdapterInfo->AdapterName;
+      // GUID only ascii
+      tstring key_set = keybase + tstring(AdapterName.begin(), AdapterName.end()) + connection;
+      LPCTSTR data_Set = key_set.c_str();
+      LPCTSTR dwValue = NULL;
+      if (ERROR_SUCCESS ==
+          ::RegOpenKeyEx(HKEY_LOCAL_MACHINE, data_Set, 0, KEY_READ, &hKEY)) {
+        DWORD dwSize = 0;
+        DWORD dwType = REG_SZ;
+        if (ERROR_SUCCESS ==
+            ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
+          dwValue = new TCHAR[dwSize];
+          if (ERROR_SUCCESS ==
+              ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
+            // interface name must only ascii
+            tstring tstr = dwValue;
+            std::string s(tstr.begin(), tstr.end());
+
+            *interface = s;
+            *ip = curip;
+            break;
+          }
+        }
+        ::RegCloseKey(hKEY);
+        hKEY = NULL;
+      }
+      curpAdapterInfo = curpAdapterInfo->Next;
+    }
+    if (hKEY != NULL) {
+      ::RegCloseKey(hKEY);
+    }
+    free(pAdapterInfo);
+  }
+#else
+  struct ifaddrs * ifAddrStruct = nullptr;
+  struct ifaddrs * ifa = nullptr;
+
+  interface->clear();
+  ip->clear();
+  getifaddrs(&ifAddrStruct);
+  for (ifa = ifAddrStruct; ifa != nullptr; ifa = ifa->ifa_next) {
+    if (nullptr == ifa->ifa_addr) continue;
+
+    if (AF_INET == ifa->ifa_addr->sa_family &&
+        0 == (ifa->ifa_flags & IFF_LOOPBACK)) {
+      char address_buffer[INET_ADDRSTRLEN];
+      void* sin_addr_ptr = &(reinterpret_cast<struct sockaddr_in*>(ifa->ifa_addr))->sin_addr;
+      inet_ntop(AF_INET, sin_addr_ptr, address_buffer, INET_ADDRSTRLEN);
+
+      *ip = address_buffer;
+      *interface = ifa->ifa_name;
+
+      break;
+    }
+  }
+  if (nullptr != ifAddrStruct) freeifaddrs(ifAddrStruct);
+  return;
+#endif
+}
+
+/**
+ * \brief return an available port on local machine
+ *
+ * only support IPv4
+ * \return 0 on failure
+ */
+int GetAvailablePort() {
+  struct sockaddr_in addr;
+  addr.sin_port = htons(0);  // have system pick up a random port available for me
+  addr.sin_family = AF_INET;  // IPV4
+  addr.sin_addr.s_addr = htonl(INADDR_ANY);  // set our addr to any interface
+
+  int sock = socket(AF_INET, SOCK_STREAM, 0);
+  if (0 != bind(sock, (struct sockaddr*)&addr, sizeof(struct sockaddr_in))) {
+    perror("bind():");
+    return 0;
+  }
+#ifdef _MSC_VER
+  int addr_len = sizeof(struct sockaddr_in);
+#else
+  socklen_t addr_len = sizeof(struct sockaddr_in);
+#endif
+
+  if (0 != getsockname(sock, (struct sockaddr*)&addr, &addr_len)) {
+    perror("getsockname():");
+    return 0;
+  }
+
+  int ret_port = ntohs(addr.sin_port);
+#ifdef  _MSC_VER
+  closesocket(sock);
+#else
+  close(sock);
+#endif
+  return ret_port;
+}
+
+}  // namespace ps
+#endif  // PS_NETWORK_UTILS_H_
diff --git a/ps-lite/src/postoffice.cc b/ps-lite/src/postoffice.cc
new file mode 100644
index 00000000..ddc25110
--- /dev/null
+++ b/ps-lite/src/postoffice.cc
@@ -0,0 +1,176 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#include <unistd.h>
+#include <thread>
+#include <chrono>
+#include "ps/internal/postoffice.h"
+#include "ps/internal/message.h"
+#include "ps/base.h"
+
+namespace ps {
+Postoffice::Postoffice() {
+  van_ = Van::Create("zmq");
+  env_ref_ = Environment::_GetSharedRef();
+  const char* val = NULL;
+  val = CHECK_NOTNULL(Environment::Get()->find("DMLC_NUM_WORKER"));
+  num_workers_ = atoi(val);
+  val =  CHECK_NOTNULL(Environment::Get()->find("DMLC_NUM_SERVER"));
+  num_servers_ = atoi(val);
+  val = CHECK_NOTNULL(Environment::Get()->find("DMLC_ROLE"));
+  std::string role(val);
+  is_worker_ = role == "worker";
+  is_server_ = role == "server";
+  is_scheduler_ = role == "scheduler";
+  verbose_ = GetEnv("PS_VERBOSE", 0);
+}
+
+void Postoffice::Start(const char* argv0, const bool do_barrier) {
+  // init glog
+  if (argv0) {
+    dmlc::InitLogging(argv0);
+  } else {
+    dmlc::InitLogging("ps-lite\0");
+  }
+
+  // init node info.
+  for (int i = 0; i < num_workers_; ++i) {
+    int id = WorkerRankToID(i);
+    for (int g : {id, kWorkerGroup, kWorkerGroup + kServerGroup,
+            kWorkerGroup + kScheduler,
+            kWorkerGroup + kServerGroup + kScheduler}) {
+      node_ids_[g].push_back(id);
+    }
+  }
+
+  for (int i = 0; i < num_servers_; ++i) {
+    int id = ServerRankToID(i);
+    for (int g : {id, kServerGroup, kWorkerGroup + kServerGroup,
+            kServerGroup + kScheduler,
+            kWorkerGroup + kServerGroup + kScheduler}) {
+      node_ids_[g].push_back(id);
+    }
+  }
+
+  for (int g : {kScheduler, kScheduler + kServerGroup + kWorkerGroup,
+          kScheduler + kWorkerGroup, kScheduler + kServerGroup}) {
+    node_ids_[g].push_back(kScheduler);
+  }
+
+  // start van
+  van_->Start();
+
+  // record start time
+  start_time_ = time(NULL);
+
+  // do a barrier here
+  if (do_barrier) Barrier(kWorkerGroup + kServerGroup + kScheduler);
+}
+
+void Postoffice::Finalize(const bool do_barrier) {
+  if (do_barrier) Barrier(kWorkerGroup + kServerGroup + kScheduler);
+  van_->Stop();
+  if (exit_callback_) exit_callback_();
+}
+
+
+void Postoffice::AddCustomer(Customer* customer) {
+  std::lock_guard<std::mutex> lk(mu_);
+  int id = CHECK_NOTNULL(customer)->id();
+  CHECK_EQ(customers_.count(id), (size_t)0) << "id " << id << " already exists";
+  customers_[id] = customer;
+}
+
+
+void Postoffice::RemoveCustomer(Customer* customer) {
+  std::lock_guard<std::mutex> lk(mu_);
+  int id = CHECK_NOTNULL(customer)->id();
+  customers_.erase(id);
+}
+
+
+Customer* Postoffice::GetCustomer(int id, int timeout) const {
+  Customer* obj = nullptr;
+  for (int i = 0; i < timeout*1000+1; ++i) {
+    {
+      std::lock_guard<std::mutex> lk(mu_);
+      const auto it = customers_.find(id);
+      if (it != customers_.end()) {
+        obj = it->second;
+        break;
+      }
+    }
+    std::this_thread::sleep_for(std::chrono::milliseconds(1));
+  }
+  return obj;
+}
+
+void Postoffice::Barrier(int node_group) {
+  if (GetNodeIDs(node_group).size() <= 1) return;
+  auto role = van_->my_node().role;
+  if (role == Node::SCHEDULER) {
+    CHECK(node_group & kScheduler);
+  } else if (role == Node::WORKER) {
+    CHECK(node_group & kWorkerGroup);
+  } else if (role == Node::SERVER) {
+    CHECK(node_group & kServerGroup);
+  }
+
+  std::unique_lock<std::mutex> ulk(barrier_mu_);
+  barrier_done_ = false;
+  Message req;
+  req.meta.recver = kScheduler;
+  req.meta.request = true;
+  req.meta.control.cmd = Control::BARRIER;
+  req.meta.control.barrier_group = node_group;
+  req.meta.timestamp = van_->GetTimestamp();
+  CHECK_GT(van_->Send(req), 0);
+
+  barrier_cond_.wait(ulk, [this] {
+      return barrier_done_;
+    });
+}
+
+const std::vector<Range>& Postoffice::GetServerKeyRanges() {
+  if (server_key_ranges_.empty()) {
+    for (int i = 0; i < num_servers_; ++i) {
+      server_key_ranges_.push_back(Range(
+          kMaxKey / num_servers_ * i,
+          kMaxKey / num_servers_ * (i+1)));
+    }
+  }
+  return server_key_ranges_;
+}
+
+void Postoffice::Manage(const Message& recv) {
+  CHECK(!recv.meta.control.empty());
+  const auto& ctrl = recv.meta.control;
+  if (ctrl.cmd == Control::BARRIER && !recv.meta.request) {
+    barrier_mu_.lock();
+    barrier_done_ = true;
+    barrier_mu_.unlock();
+    barrier_cond_.notify_all();
+  }
+}
+
+std::vector<int> Postoffice::GetDeadNodes(int t) {
+  std::vector<int> dead_nodes;
+  if (!van_->IsReady() || t == 0) return dead_nodes;
+
+  time_t curr_time = time(NULL);
+  const auto& nodes = is_scheduler_
+    ? GetNodeIDs(kWorkerGroup + kServerGroup)
+    : GetNodeIDs(kScheduler);
+  {
+    std::lock_guard<std::mutex> lk(heartbeat_mu_);
+    for (int r : nodes) {
+      auto it = heartbeats_.find(r);
+      if ((it == heartbeats_.end() || it->second + t < curr_time)
+            && start_time_ + t < curr_time) {
+        dead_nodes.push_back(r);
+      }
+    }
+  }
+  return dead_nodes;
+}
+}  // namespace ps
diff --git a/ps-lite/src/resender.h b/ps-lite/src/resender.h
new file mode 100644
index 00000000..72bb827a
--- /dev/null
+++ b/ps-lite/src/resender.h
@@ -0,0 +1,141 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_RESENDER_H_
+#define PS_RESENDER_H_
+#include <chrono>
+#include <vector>
+#include <unordered_set>
+#include <unordered_map>
+namespace ps {
+
+/**
+ * \brief resend a messsage if no ack is received within a given time
+ */
+class Resender {
+ public:
+  /**
+   * \param timeout timeout in millisecond
+   */
+  Resender(int timeout, int max_num_retry, Van* van) {
+    timeout_ = timeout;
+    max_num_retry_ = max_num_retry;
+    van_ = van;
+    monitor_ = new std::thread(&Resender::Monitoring, this);
+  }
+  ~Resender() {
+    exit_ = true;
+    monitor_->join();
+    delete monitor_;
+  }
+
+  /**
+   * \brief add an outgoining message
+   *
+   */
+  void AddOutgoing(const Message& msg) {
+    if (msg.meta.control.cmd == Control::ACK) return;
+    CHECK_NE(msg.meta.timestamp, Meta::kEmpty) << msg.DebugString();
+    auto key = GetKey(msg);
+    std::lock_guard<std::mutex> lk(mu_);
+    // already buffered, which often due to call Send by the monitor thread
+    if (send_buff_.find(key) != send_buff_.end()) return;
+
+    auto& ent = send_buff_[key];
+    ent.msg = msg;
+    ent.send = Now();
+    ent.num_retry = 0;
+  }
+
+  /**
+   * \brief add an incomming message
+   * \brief return true if msg has been added before or a ACK message
+   */
+  bool AddIncomming(const Message& msg) {
+    // a message can be received by multiple times
+    if (msg.meta.control.cmd == Control::TERMINATE) {
+      return false;
+    } else if (msg.meta.control.cmd == Control::ACK) {
+      mu_.lock();
+      auto key = msg.meta.control.msg_sig;
+      auto it = send_buff_.find(key);
+      if (it != send_buff_.end()) send_buff_.erase(it);
+      mu_.unlock();
+      return true;
+    } else {
+      mu_.lock();
+      auto key = GetKey(msg);
+      auto it = acked_.find(key);
+      bool duplicated = it != acked_.end();
+      if (!duplicated) acked_.insert(key);
+      mu_.unlock();
+      // send back ack message (even if it is duplicated)
+      Message ack;
+      ack.meta.recver = msg.meta.sender;
+      ack.meta.sender = msg.meta.recver;
+      ack.meta.control.cmd = Control::ACK;
+      ack.meta.control.msg_sig = key;
+      van_->Send(ack);
+      // warning
+      if (duplicated) LOG(WARNING) << "Duplicated message: " << msg.DebugString();
+      return duplicated;
+    }
+  }
+
+ private:
+  using Time = std::chrono::milliseconds;
+  // the buffer entry
+  struct Entry {
+    Message msg;
+    Time send;
+    int num_retry = 0;
+  };
+  std::unordered_map<uint64_t, Entry> send_buff_;
+
+  uint64_t GetKey(const Message& msg) {
+    CHECK_NE(msg.meta.timestamp, Meta::kEmpty) << msg.DebugString();
+    uint16_t id = msg.meta.customer_id;
+    uint8_t sender = msg.meta.sender == Node::kEmpty ?
+                     van_->my_node().id : msg.meta.sender;
+    uint8_t recver = msg.meta.recver;
+    return (static_cast<uint64_t>(id) << 48) |
+        (static_cast<uint64_t>(sender) << 40) |
+        (static_cast<uint64_t>(recver) << 32) |
+        (msg.meta.timestamp << 1) | msg.meta.request;
+  }
+  Time Now() {
+    return std::chrono::duration_cast<Time>(
+        std::chrono::high_resolution_clock::now().time_since_epoch());
+  }
+
+  void Monitoring() {
+    while (!exit_) {
+      std::this_thread::sleep_for(Time(timeout_));
+      std::vector<Message> resend;
+      Time now = Now();
+      mu_.lock();
+      for (auto& it : send_buff_) {
+        if (it.second.send + Time(timeout_) * (1+it.second.num_retry) < now) {
+          resend.push_back(it.second.msg);
+          ++it.second.num_retry;
+          LOG(WARNING) << van_->my_node().ShortDebugString()
+                       << ": Timeout to get the ACK message. Resend (retry="
+                       << it.second.num_retry << ") " << it.second.msg.DebugString();
+          CHECK_LT(it.second.num_retry, max_num_retry_);
+        }
+      }
+      mu_.unlock();
+
+      for (const auto& msg : resend) van_->Send(msg);
+    }
+  }
+  std::thread* monitor_;
+  std::unordered_set<uint64_t> acked_;
+  std::atomic<bool> exit_{false};
+  std::mutex mu_;
+  int timeout_;
+  int max_num_retry_;
+  Van* van_;
+};
+}  // namespace ps
+#endif  // PS_RESENDER_H_
diff --git a/ps-lite/src/van.cc b/ps-lite/src/van.cc
new file mode 100644
index 00000000..9b4e93a6
--- /dev/null
+++ b/ps-lite/src/van.cc
@@ -0,0 +1,422 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#include "ps/internal/van.h"
+#include <thread>
+#include <chrono>
+#include "ps/base.h"
+#include "ps/sarray.h"
+#include "ps/internal/postoffice.h"
+#include "ps/internal/customer.h"
+#include "./network_utils.h"
+#include "./meta.pb.h"
+#include "./zmq_van.h"
+#include "./resender.h"
+namespace ps {
+
+// interval in second between to heartbeast signals. 0 means no heartbeat.
+// don't send heartbeast in default. because if the scheduler received a
+// heartbeart signal from a node before connected to that node, then it could be
+// problem.
+static const int kDefaultHeartbeatInterval = 0;
+
+Van* Van::Create(const std::string& type) {
+  if (type == "zmq") {
+    return new ZMQVan();
+  } else {
+    LOG(FATAL) << "unsupported van type: " << type;
+    return nullptr;
+  }
+}
+
+void Van::Start() {
+  // get scheduler info
+  scheduler_.hostname = std::string(CHECK_NOTNULL(Environment::Get()->find("DMLC_PS_ROOT_URI")));
+  scheduler_.port     = atoi(CHECK_NOTNULL(Environment::Get()->find("DMLC_PS_ROOT_PORT")));
+  scheduler_.role     = Node::SCHEDULER;
+  scheduler_.id       = kScheduler;
+  is_scheduler_       = Postoffice::Get()->is_scheduler();
+
+  // get my node info
+  if (is_scheduler_) {
+    my_node_ = scheduler_;
+  } else {
+    auto role = is_scheduler_ ? Node::SCHEDULER :
+                (Postoffice::Get()->is_worker() ? Node::WORKER : Node::SERVER);
+    const char* nhost = Environment::Get()->find("DMLC_NODE_HOST");
+    std::string ip;
+    if (nhost) ip = std::string(nhost);
+    if (ip.empty()) {
+      const char*  itf = Environment::Get()->find("DMLC_INTERFACE");
+      std::string interface;
+      if (itf) interface = std::string(itf);
+      if (interface.size()) {
+        GetIP(interface, &ip);
+      } else {
+        GetAvailableInterfaceAndIP(&interface, &ip);
+      }
+      CHECK(!interface.empty()) << "failed to get the interface";
+    }
+    int port = GetAvailablePort();
+    const char* pstr = Environment::Get()->find("PORT");
+    if (pstr) port = atoi(pstr);
+    CHECK(!ip.empty()) << "failed to get ip";
+    CHECK(port) << "failed to get a port";
+    my_node_.hostname = ip;
+    my_node_.role     = role;
+    my_node_.port     = port;
+    // cannot determine my id now, the scheduler will assign it later
+    // set it explicitly to make re-register within a same process possible
+    my_node_.id = Node::kEmpty;
+  }
+
+  // bind.
+  my_node_.port = Bind(my_node_, is_scheduler_ ? 0 : 40);
+  PS_VLOG(1) << "Bind to " << my_node_.DebugString();
+  CHECK_NE(my_node_.port, -1) << "bind failed";
+
+  // connect to the scheduler
+  Connect(scheduler_);
+
+  // for debug use
+  if (Environment::Get()->find("PS_DROP_MSG")) {
+    drop_rate_ = atoi(Environment::Get()->find("PS_DROP_MSG"));
+  }
+  // start receiver
+  receiver_thread_ = std::unique_ptr<std::thread>(
+      new std::thread(&Van::Receiving, this));
+
+  if (!is_scheduler_) {
+    // let the scheduler know myself
+    Message msg;
+    msg.meta.recver = kScheduler;
+    msg.meta.control.cmd = Control::ADD_NODE;
+    msg.meta.control.node.push_back(my_node_);
+    msg.meta.timestamp = timestamp_++;
+    Send(msg);
+  }
+  // wait until ready
+  while (!ready_) {
+    std::this_thread::sleep_for(std::chrono::milliseconds(1));
+  }
+
+  // resender
+  if (Environment::Get()->find("PS_RESEND") && atoi(Environment::Get()->find("PS_RESEND")) != 0) {
+    int timeout = 1000;
+    if (Environment::Get()->find("PS_RESEND_TIMEOUT")) {
+      timeout = atoi(Environment::Get()->find("PS_RESEND_TIMEOUT"));
+    }
+    resender_ = new Resender(timeout, 10, this);
+  }
+
+  if (!is_scheduler_) {
+    // start heartbeat thread
+    heartbeat_thread_ = std::unique_ptr<std::thread>(
+      new std::thread(&Van::Heartbeat, this));
+  }
+}
+
+void Van::Stop() {
+  // stop threads
+  Message exit;
+  exit.meta.control.cmd = Control::TERMINATE;
+  exit.meta.recver = my_node_.id;
+  SendMsg(exit);
+  receiver_thread_->join();
+  if (!is_scheduler_) heartbeat_thread_->join();
+  if (resender_) delete resender_;
+}
+
+int Van::Send(const Message& msg) {
+  int send_bytes = SendMsg(msg);
+  CHECK_NE(send_bytes, -1);
+  send_bytes_ += send_bytes;
+  if (resender_) resender_->AddOutgoing(msg);
+  if (Postoffice::Get()->verbose() >= 2) {
+    PS_VLOG(2) << msg.DebugString();
+  }
+  return send_bytes;
+}
+
+void Van::Receiving() {
+  const char* heartbeat_timeout_val = Environment::Get()->find("PS_HEARTBEAT_TIMEOUT");
+  const int heartbeat_timeout
+      = heartbeat_timeout_val ? atoi(heartbeat_timeout_val) : kDefaultHeartbeatInterval;
+  Meta nodes;  // for scheduler usage
+  while (true) {
+    Message msg;
+    int recv_bytes = RecvMsg(&msg);
+
+    // For debug, drop received message
+    if (ready_ && drop_rate_ > 0) {
+      unsigned seed = time(NULL) + my_node_.id;
+      if (rand_r(&seed) % 100 < drop_rate_) {
+        LOG(WARNING) << "Drop message " << msg.DebugString();
+        continue;
+      }
+    }
+
+    CHECK_NE(recv_bytes, -1);
+    recv_bytes_ += recv_bytes;
+    if (Postoffice::Get()->verbose() >= 2) {
+      PS_VLOG(2) << msg.DebugString();
+    }
+    // duplicated message
+    if (resender_ && resender_->AddIncomming(msg)) continue;
+
+    if (!msg.meta.control.empty()) {
+      // do some management
+      auto& ctrl = msg.meta.control;
+      if (ctrl.cmd == Control::TERMINATE) {
+        PS_VLOG(1) << my_node_.ShortDebugString() << " is stopped";
+        ready_ = false;
+        break;
+      } else if (ctrl.cmd == Control::ADD_NODE) {
+        size_t num_nodes = Postoffice::Get()->num_servers() +
+                           Postoffice::Get()->num_workers();
+        auto dead_nodes = Postoffice::Get()->GetDeadNodes(heartbeat_timeout);
+        std::unordered_set<int> dead_set(dead_nodes.begin(), dead_nodes.end());
+        Meta recovery_nodes;  // store recovery nodes
+        recovery_nodes.control.cmd = Control::ADD_NODE;
+        // assign an id
+        if (msg.meta.sender == Meta::kEmpty) {
+          CHECK(is_scheduler_);
+          CHECK_EQ(ctrl.node.size(), 1);
+          if (nodes.control.node.size() < num_nodes) {
+            nodes.control.node.push_back(ctrl.node[0]);
+          } else {
+            // some node dies and restarts
+            CHECK(ready_);
+            for (size_t i = 0; i < nodes.control.node.size() - 1; ++i) {
+              const auto& node = nodes.control.node[i];
+              if (dead_set.find(node.id) != dead_set.end() && node.role == ctrl.node[0].role) {
+                auto& recovery_node = ctrl.node[0];
+                // assign previous node id
+                recovery_node.id = node.id;
+                recovery_node.is_recovery = true;
+                PS_VLOG(1) << "replace dead node " << node.DebugString()
+                           << " by node " << recovery_node.DebugString();
+                nodes.control.node[i] = recovery_node;
+                recovery_nodes.control.node.push_back(recovery_node);
+                break;
+              }
+            }
+          }
+        }
+
+        // update my id
+        for (size_t i = 0; i < ctrl.node.size(); ++i) {
+          const auto& node = ctrl.node[i];
+          if (my_node_.hostname == node.hostname &&
+              my_node_.port == node.port) {
+            my_node_ = node;
+            std::string rank = std::to_string(Postoffice::IDtoRank(node.id));
+#ifdef _MSC_VER
+            _putenv_s("DMLC_RANK", rank.c_str());
+#else
+            setenv("DMLC_RANK", rank.c_str(), true);
+#endif
+          }
+        }
+
+        if (is_scheduler_) {
+          time_t t = time(NULL);
+          if (nodes.control.node.size() == num_nodes) {
+            // sort the nodes according their ip and port,
+            std::sort(nodes.control.node.begin(), nodes.control.node.end(),
+                      [](const Node& a, const Node& b) {
+                        return (a.hostname.compare(b.hostname) | (a.port < b.port)) > 0;
+                      });
+            // assign node rank
+            for (auto& node : nodes.control.node) {
+              CHECK_EQ(node.id, Node::kEmpty);
+              int id = node.role == Node::SERVER ?
+                       Postoffice::ServerRankToID(num_servers_) :
+                       Postoffice::WorkerRankToID(num_workers_);
+              PS_VLOG(1) << "assign rank=" << id << " to node " << node.DebugString();
+              node.id = id;
+              Connect(node);
+              if (node.role == Node::SERVER) ++num_servers_;
+              if (node.role == Node::WORKER) ++num_workers_;
+              Postoffice::Get()->UpdateHeartbeat(node.id, t);
+            }
+            nodes.control.node.push_back(my_node_);
+            nodes.control.cmd = Control::ADD_NODE;
+            Message back; back.meta = nodes;
+            for (int r : Postoffice::Get()->GetNodeIDs(
+                     kWorkerGroup + kServerGroup)) {
+              back.meta.recver = r;
+              back.meta.timestamp = timestamp_++;
+              Send(back);
+            }
+            PS_VLOG(1) << "the scheduler is connected to "
+                    << num_workers_ << " workers and " << num_servers_ << " servers";
+            ready_ = true;
+          } else if (recovery_nodes.control.node.size() > 0) {
+            // send back the recovery node
+            CHECK_EQ(recovery_nodes.control.node.size(), 1);
+            Connect(recovery_nodes.control.node[0]);
+            Postoffice::Get()->UpdateHeartbeat(recovery_nodes.control.node[0].id, t);
+            Message back;
+            for (int r : Postoffice::Get()->GetNodeIDs(
+                     kWorkerGroup + kServerGroup)) {
+              if (r != recovery_nodes.control.node[0].id
+                    && dead_set.find(r) != dead_set.end()) {
+                // do not try to send anything to dead node
+                continue;
+              }
+              // only send recovery_node to nodes already exist
+              // but send all nodes to the recovery_node
+              back.meta = (r == recovery_nodes.control.node[0].id) ? nodes : recovery_nodes;
+              back.meta.recver = r;
+              back.meta.timestamp = timestamp_++;
+              Send(back);
+            }
+          }
+        } else {
+          for (const auto& node : ctrl.node) {
+            Connect(node);
+            if (!node.is_recovery && node.role == Node::SERVER) ++num_servers_;
+            if (!node.is_recovery && node.role == Node::WORKER) ++num_workers_;
+          }
+          PS_VLOG(1) << my_node_.ShortDebugString() << " is connected to others";
+          ready_ = true;
+        }
+      } else if (ctrl.cmd == Control::BARRIER) {
+        if (msg.meta.request) {
+          if (barrier_count_.empty()) {
+            barrier_count_.resize(8, 0);
+          }
+          int group = ctrl.barrier_group;
+          ++barrier_count_[group];
+          PS_VLOG(1) << "Barrier count for " << group << " : " << barrier_count_[group];
+          if (barrier_count_[group] ==
+              static_cast<int>(Postoffice::Get()->GetNodeIDs(group).size())) {
+            barrier_count_[group] = 0;
+            Message res;
+            res.meta.request = false;
+            res.meta.control.cmd = Control::BARRIER;
+            for (int r : Postoffice::Get()->GetNodeIDs(group)) {
+              res.meta.recver = r;
+              res.meta.timestamp = timestamp_++;
+              CHECK_GT(Send(res), 0);
+            }
+          }
+        } else {
+          Postoffice::Get()->Manage(msg);
+        }
+      } else if (ctrl.cmd == Control::HEARTBEAT) {
+        time_t t = time(NULL);
+        for (auto &node : ctrl.node) {
+          Postoffice::Get()->UpdateHeartbeat(node.id, t);
+          if (is_scheduler_) {
+            Message heartbeat_ack;
+            heartbeat_ack.meta.recver = node.id;
+            heartbeat_ack.meta.control.cmd = Control::HEARTBEAT;
+            heartbeat_ack.meta.control.node.push_back(my_node_);
+            heartbeat_ack.meta.timestamp = timestamp_++;
+            // send back heartbeat
+            Send(heartbeat_ack);
+          }
+        }
+      }
+    } else {
+      CHECK_NE(msg.meta.sender, Meta::kEmpty);
+      CHECK_NE(msg.meta.recver, Meta::kEmpty);
+      CHECK_NE(msg.meta.customer_id, Meta::kEmpty);
+      int id = msg.meta.customer_id;
+      auto* obj = Postoffice::Get()->GetCustomer(id, 5);
+      CHECK(obj) << "timeout (5 sec) to wait App " << id << " ready";
+      obj->Accept(msg);
+    }
+  }
+}
+
+void Van::PackMeta(const Meta& meta, char** meta_buf, int* buf_size) {
+  // convert into protobuf
+  PBMeta pb;
+  pb.set_head(meta.head);
+  if (meta.customer_id != Meta::kEmpty) pb.set_customer_id(meta.customer_id);
+  if (meta.timestamp != Meta::kEmpty) pb.set_timestamp(meta.timestamp);
+  if (meta.body.size()) pb.set_body(meta.body);
+  pb.set_push(meta.push);
+  pb.set_request(meta.request);
+  pb.set_simple_app(meta.simple_app);
+  for (auto d : meta.data_type) pb.add_data_type(d);
+  if (!meta.control.empty()) {
+    auto ctrl = pb.mutable_control();
+    ctrl->set_cmd(meta.control.cmd);
+    if (meta.control.cmd == Control::BARRIER) {
+      ctrl->set_barrier_group(meta.control.barrier_group);
+    } else if (meta.control.cmd == Control::ACK) {
+      ctrl->set_msg_sig(meta.control.msg_sig);
+    }
+    for (const auto& n : meta.control.node) {
+      auto p = ctrl->add_node();
+      p->set_id(n.id);
+      p->set_role(n.role);
+      p->set_port(n.port);
+      p->set_hostname(n.hostname);
+      p->set_is_recovery(n.is_recovery);
+    }
+  }
+
+  // to string
+  *buf_size = pb.ByteSize();
+  *meta_buf = new char[*buf_size+1];
+  CHECK(pb.SerializeToArray(*meta_buf, *buf_size))
+      << "failed to serialize protbuf";
+}
+
+void Van::UnpackMeta(const char* meta_buf, int buf_size, Meta* meta) {
+  // to protobuf
+  PBMeta pb;
+  CHECK(pb.ParseFromArray(meta_buf, buf_size))
+      << "failed to parse string into protobuf";
+
+  // to meta
+  meta->head = pb.head();
+  meta->customer_id = pb.has_customer_id() ? pb.customer_id() : Meta::kEmpty;
+  meta->timestamp = pb.has_timestamp() ? pb.timestamp() : Meta::kEmpty;
+  meta->request = pb.request();
+  meta->push = pb.push();
+  meta->simple_app = pb.simple_app();
+  meta->body = pb.body();
+  meta->data_type.resize(pb.data_type_size());
+  for (int i = 0; i < pb.data_type_size(); ++i) {
+    meta->data_type[i] = static_cast<DataType>(pb.data_type(i));
+  }
+  if (pb.has_control()) {
+    const auto& ctrl = pb.control();
+    meta->control.cmd = static_cast<Control::Command>(ctrl.cmd());
+    meta->control.barrier_group = ctrl.barrier_group();
+    meta->control.msg_sig = ctrl.msg_sig();
+    for (int i = 0; i < ctrl.node_size(); ++i) {
+      const auto& p = ctrl.node(i);
+      Node n;
+      n.role = static_cast<Node::Role>(p.role());
+      n.port = p.port();
+      n.hostname = p.hostname();
+      n.id = p.has_id() ? p.id() : Node::kEmpty;
+      n.is_recovery = p.is_recovery();
+      meta->control.node.push_back(n);
+    }
+  } else {
+    meta->control.cmd = Control::EMPTY;
+  }
+}
+
+void Van::Heartbeat() {
+  const char* val = Environment::Get()->find("PS_HEARTBEAT_INTERVAL");
+  const int interval = val ? atoi(val) : kDefaultHeartbeatInterval;
+  while (interval > 0 && ready_) {
+    std::this_thread::sleep_for(std::chrono::seconds(interval));
+    Message msg;
+    msg.meta.recver = kScheduler;
+    msg.meta.control.cmd = Control::HEARTBEAT;
+    msg.meta.control.node.push_back(my_node_);
+    msg.meta.timestamp = timestamp_++;
+    Send(msg);
+  }
+}
+}  // namespace ps
diff --git a/ps-lite/src/windows/unistd.h b/ps-lite/src/windows/unistd.h
new file mode 100644
index 00000000..469b67d2
--- /dev/null
+++ b/ps-lite/src/windows/unistd.h
@@ -0,0 +1,48 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ * @file   unistd.h
+ * @brief  This file intended to serve as a drop-in replacement for
+ * unistd.h on Windows Please add functionality as neeeded
+ */
+#ifndef PS_WINDOWS_UNISTD_H_
+#define PS_WINDOWS_UNISTD_H_
+#include <stdlib.h>
+#include <io.h>
+// #include "getopt.h" /* getopt at: https://gist.github.com/ashelly/7776712 */
+#include <process.h> /* for getpid() and the exec..() family */
+#include <direct.h> /* for _getcwd() and _chdir() */
+
+#define srandom srand
+#define random rand
+
+/* Values for the second argument to access.
+   These may be OR'd together.  */
+#define R_OK    4       /* Test for read permission.  */
+#define W_OK    2       /* Test for write permission.  */
+// #define   X_OK    1       /* execute permission - unsupported in windows*/
+#define F_OK    0       /* Test for existence.  */
+
+#define access _access
+#define dup2 _dup2
+#define execve _execve
+#define ftruncate _chsize
+#define unlink _unlink
+#define fileno _fileno
+#define getcwd _getcwd
+#define chdir _chdir
+#define isatty _isatty
+#define lseek _lseek
+
+// read, write, and close are NOT being #defined here, because while there are
+// file handle specific versions for Windows, they probably don't work for
+// sockets. You need to look at your app and consider whether to call
+// e.g. closesocket().
+
+#define ssize_t int
+
+#define STDIN_FILENO 0
+#define STDOUT_FILENO 1
+#define STDERR_FILENO 2
+/* should be in some equivalent to <sys/types.h> */
+
+#endif  // PS_WINDOWS_UNISTD_H_
diff --git a/ps-lite/src/zmq_van.h b/ps-lite/src/zmq_van.h
new file mode 100644
index 00000000..f6a14cc4
--- /dev/null
+++ b/ps-lite/src/zmq_van.h
@@ -0,0 +1,287 @@
+/**
+ *  Copyright (c) 2015 by Contributors
+ */
+#ifndef PS_ZMQ_VAN_H_
+#define PS_ZMQ_VAN_H_
+#include <zmq.h>
+#include <stdlib.h>
+#include <thread>
+#include <string>
+#include "ps/internal/van.h"
+#if _MSC_VER
+#define rand_r(x) rand()
+#endif
+
+namespace ps {
+/**
+ * \brief be smart on freeing recved data
+ */
+inline void FreeData(void *data, void *hint) {
+  if (hint == NULL) {
+    delete [] static_cast<char*>(data);
+  } else {
+    delete static_cast<SArray<char>*>(hint);
+  }
+}
+
+/**
+ * \brief ZMQ based implementation
+ */
+class ZMQVan : public Van {
+ public:
+  ZMQVan() { }
+  virtual ~ZMQVan() { }
+
+ protected:
+  void Start() override {
+    // start zmq
+    context_ = zmq_ctx_new();
+    CHECK(context_ != NULL) << "create 0mq context failed";
+    zmq_ctx_set(context_, ZMQ_MAX_SOCKETS, 65536);
+    // zmq_ctx_set(context_, ZMQ_IO_THREADS, 4);
+    Van::Start();
+  }
+
+  void Stop() override {
+    PS_VLOG(1) << my_node_.ShortDebugString() << " is stopping";
+    Van::Stop();
+    // close sockets
+    int linger = 0;
+    int rc = zmq_setsockopt(receiver_, ZMQ_LINGER, &linger, sizeof(linger));
+    CHECK(rc == 0 || errno == ETERM);
+    CHECK_EQ(zmq_close(receiver_), 0);
+    for (auto& it : senders_) {
+      int rc = zmq_setsockopt(it.second, ZMQ_LINGER, &linger, sizeof(linger));
+      CHECK(rc == 0 || errno == ETERM);
+      CHECK_EQ(zmq_close(it.second), 0);
+    }
+    zmq_ctx_destroy(context_);
+  }
+
+  int Bind(const Node& node, int max_retry) override {
+    receiver_ = zmq_socket(context_, ZMQ_ROUTER);
+    CHECK(receiver_ != NULL)
+        << "create receiver socket failed: " << zmq_strerror(errno);
+    int local = GetEnv("DMLC_LOCAL", 0);
+    std::string hostname = node.hostname.empty() ? "*" : node.hostname;
+    std::string addr = local ? "ipc:///tmp/" : "tcp://" + hostname + ":";
+    int port = node.port;
+    unsigned seed = static_cast<unsigned>(time(NULL)+port);
+    for (int i = 0; i < max_retry+1; ++i) {
+      auto address = addr + std::to_string(port);
+      if (zmq_bind(receiver_, address.c_str()) == 0) break;
+      if (i == max_retry) {
+        port = -1;
+      } else {
+        port = 10000 + rand_r(&seed) % 40000;
+      }
+    }
+    return port;
+  }
+
+  void Connect(const Node& node) override {
+    CHECK_NE(node.id, node.kEmpty);
+    CHECK_NE(node.port, node.kEmpty);
+    CHECK(node.hostname.size());
+    int id = node.id;
+    auto it = senders_.find(id);
+    if (it != senders_.end()) {
+      zmq_close(it->second);
+    }
+    // worker doesn't need to connect to the other workers. same for server
+    if ((node.role == my_node_.role) &&
+        (node.id != my_node_.id)) {
+      return;
+    }
+    void *sender = zmq_socket(context_, ZMQ_DEALER);
+    CHECK(sender != NULL)
+        << zmq_strerror(errno)
+        << ". it often can be solved by \"sudo ulimit -n 65536\""
+        << " or edit /etc/security/limits.conf";
+    if (my_node_.id != Node::kEmpty) {
+      std::string my_id = "ps" + std::to_string(my_node_.id);
+      zmq_setsockopt(sender, ZMQ_IDENTITY, my_id.data(), my_id.size());
+    }
+    // connect
+    std::string addr = "tcp://" + node.hostname + ":" + std::to_string(node.port);
+    if (GetEnv("DMLC_LOCAL", 0)) {
+      addr = "ipc:///tmp/" + std::to_string(node.port);
+    }
+    if (zmq_connect(sender, addr.c_str()) != 0) {
+      LOG(FATAL) <<  "connect to " + addr + " failed: " + zmq_strerror(errno);
+    }
+    senders_[id] = sender;
+  }
+
+  int SendMsg(const Message& msg) override {
+    std::lock_guard<std::mutex> lk(mu_);
+    // find the socket
+    int id = msg.meta.recver;
+    CHECK_NE(id, Meta::kEmpty);
+    auto it = senders_.find(id);
+    if (it == senders_.end()) {
+      LOG(WARNING) << "there is no socket to node " << id;
+      return -1;
+    }
+    void *socket = it->second;
+
+    // send meta
+    int meta_size; char* meta_buf;
+    PackMeta(msg.meta, &meta_buf, &meta_size);
+    int tag = ZMQ_SNDMORE;
+    int n = msg.data.size();
+    if (n == 0) tag = 0;
+    zmq_msg_t meta_msg;
+    zmq_msg_init_data(&meta_msg, meta_buf, meta_size, FreeData, NULL);
+    while (true) {
+      if (zmq_msg_send(&meta_msg, socket, tag) == meta_size) break;
+      if (errno == EINTR) continue;
+      LOG(WARNING) << "failed to send message to node [" << id
+                   << "] errno: " << errno << " " << zmq_strerror(errno);
+      return -1;
+    }
+    zmq_msg_close(&meta_msg);
+    int send_bytes = meta_size;
+
+    // send data
+    for (int i = 0; i < n; ++i) {
+      zmq_msg_t data_msg;
+      SArray<char>* data = new SArray<char>(msg.data[i]);
+      int data_size = data->size();
+      zmq_msg_init_data(&data_msg, data->data(), data->size(), FreeData, data);
+      if (i == n - 1) tag = 0;
+      while (true) {
+        if (zmq_msg_send(&data_msg, socket, tag) == data_size) break;
+        if (errno == EINTR) continue;
+        LOG(WARNING) << "failed to send message to node [" << id
+                     << "] errno: " << errno << " " << zmq_strerror(errno)
+                     << ". " << i << "/" << n;
+        return -1;
+      }
+      zmq_msg_close(&data_msg);
+      send_bytes += data_size;
+    }
+    return send_bytes;
+  }
+
+  int RecvMsg(Message* msg) override {
+    msg->data.clear();
+    size_t recv_bytes = 0;
+    for (int i = 0; ; ++i) {
+      zmq_msg_t* zmsg = new zmq_msg_t;
+      CHECK(zmq_msg_init(zmsg) == 0) << zmq_strerror(errno);
+      while (true) {
+        if (zmq_msg_recv(zmsg, receiver_, 0) != -1) break;
+        if (errno == EINTR) continue;
+        LOG(WARNING) << "failed to receive message. errno: "
+                     << errno << " " << zmq_strerror(errno);
+        return -1;
+      }
+      char* buf = CHECK_NOTNULL((char *)zmq_msg_data(zmsg));
+      size_t size = zmq_msg_size(zmsg);
+      recv_bytes += size;
+
+      if (i == 0) {
+        // identify
+        msg->meta.sender = GetNodeID(buf, size);
+        msg->meta.recver = my_node_.id;
+        CHECK(zmq_msg_more(zmsg));
+        zmq_msg_close(zmsg);
+        delete zmsg;
+      } else if (i == 1) {
+        // task
+        UnpackMeta(buf, size, &(msg->meta));
+        zmq_msg_close(zmsg);
+        bool more = zmq_msg_more(zmsg);
+        delete zmsg;
+        if (!more) break;
+      } else {
+        // zero-copy
+        SArray<char> data;
+        data.reset(buf, size, [zmsg, size](char* buf) {
+            zmq_msg_close(zmsg);
+            delete zmsg;
+          });
+        msg->data.push_back(data);
+        if (!zmq_msg_more(zmsg)) { break; }
+      }
+    }
+    return recv_bytes;
+  }
+
+ private:
+  /**
+   * return the node id given the received identity
+   * \return -1 if not find
+   */
+  int GetNodeID(const char* buf, size_t size) {
+    if (size > 2 && buf[0] == 'p' && buf[1] == 's') {
+      int id = 0;
+      size_t i = 2;
+      for (; i < size; ++i) {
+        if (buf[i] >= '0' && buf[i] <= '9') {
+          id = id * 10 + buf[i] - '0';
+        } else {
+          break;
+        }
+      }
+      if (i == size) return id;
+    }
+    return Meta::kEmpty;
+  }
+
+  void *context_ = nullptr;
+  /**
+   * \brief node_id to the socket for sending data to this node
+   */
+  std::unordered_map<int, void*> senders_;
+  std::mutex mu_;
+  void *receiver_ = nullptr;
+};
+}  // namespace ps
+
+#endif  // PS_ZMQ_VAN_H_
+
+
+
+
+
+// monitors the liveness other nodes if this is
+// a schedule node, or monitors the liveness of the scheduler otherwise
+// aliveness monitor
+// CHECK(!zmq_socket_monitor(
+//     senders_[kScheduler], "inproc://monitor", ZMQ_EVENT_ALL));
+// monitor_thread_ = std::unique_ptr<std::thread>(
+//     new std::thread(&Van::Monitoring, this));
+// monitor_thread_->detach();
+
+// void Van::Monitoring() {
+//   void *s = CHECK_NOTNULL(zmq_socket(context_, ZMQ_PAIR));
+//   CHECK(!zmq_connect(s, "inproc://monitor"));
+//   while (true) {
+//     //  First frame in message contains event number and value
+//     zmq_msg_t msg;
+//     zmq_msg_init(&msg);
+//     if (zmq_msg_recv(&msg, s, 0) == -1) {
+//       if (errno == EINTR) continue;
+//       break;
+//     }
+//     uint8_t *data = static_cast<uint8_t*>(zmq_msg_data(&msg));
+//     int event = *reinterpret_cast<uint16_t*>(data);
+//     // int value = *(uint32_t *)(data + 2);
+
+//     // Second frame in message contains event address. it's just the router's
+//     // address. no help
+
+//     if (event == ZMQ_EVENT_DISCONNECTED) {
+//       if (!is_scheduler_) {
+//         PS_VLOG(1) << my_node_.ShortDebugString() << ": scheduler is dead. exit.";
+//         exit(-1);
+//       }
+//     }
+//     if (event == ZMQ_EVENT_MONITOR_STOPPED) {
+//       break;
+//     }
+//   }
+//   zmq_close(s);
+// }
diff --git a/ps-lite/tags b/ps-lite/tags
new file mode 100644
index 00000000..9e2e4503
--- /dev/null
+++ b/ps-lite/tags
@@ -0,0 +1,4116 @@
+!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/
+!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted, 2=foldcase/
+!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/dhiebert@users.sourceforge.net/
+!_TAG_PROGRAM_NAME	Exuberant Ctags	//
+!_TAG_PROGRAM_URL	http://ctags.sourceforge.net	/official site/
+!_TAG_PROGRAM_VERSION	5.8	//
+ACK	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+ADD_NODE	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+ALLSPHINXOPTS	docs/Makefile	/^ALLSPHINXOPTS   = -d $(BUILDDIR)\/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .$/;"	m
+AND	include/ps/internal/assign_op.h	/^  AND,     \/\/ a &= b$/;"	e	enum:ps::AssignOp
+ASSIGN	include/ps/internal/assign_op.h	/^  ASSIGN,  \/\/ a = b$/;"	e	enum:ps::AssignOp
+ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#define ATOMICOPS_COMPILER_BARRIER(/;"	d
+ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#undef ATOMICOPS_COMPILER_BARRIER$/;"	d
+ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#define ATOMICOPS_COMPILER_BARRIER(/;"	d
+ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#undef ATOMICOPS_COMPILER_BARRIER$/;"	d
+AUTO	deps/include/google/protobuf/io/gzip_stream.h	/^    AUTO = 0,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
+Accept	include/ps/internal/customer.h	/^  void Accept(const Message& recved) { recv_queue_.Push(recved); }$/;"	f	class:ps::Customer
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Acquire_Load(volatile const AtomicWord* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void Acquire_Store(volatile AtomicWord* ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Add	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
+Add	deps/include/google/protobuf/extension_set.h	/^  static inline string* Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
+Add	deps/include/google/protobuf/extension_set.h	/^  static inline void Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
+Add	deps/include/google/protobuf/extension_set.h	/^  static inline void Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
+Add	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::Add() {$/;"	f	class:google::protobuf::RepeatedField
+Add	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::Add() {$/;"	f	class:google::protobuf::RepeatedPtrField
+Add	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::Add() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Add	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Add(const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
+AddAllocated	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::AddAllocated(Element* value) {$/;"	f	class:google::protobuf::RepeatedPtrField
+AddAllocated	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::AddAllocated($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+AddAlreadyReserved	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::AddAlreadyReserved() {$/;"	f	class:google::protobuf::RepeatedField
+AddAlreadyReserved	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::AddAlreadyReserved(const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
+AddCallback	include/ps/kv_app.h	/^  void AddCallback(int timestamp, const Callback& cb) {$/;"	f	class:ps::KVWorker
+AddCleared	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::AddCleared(Element* value) {$/;"	f	class:google::protobuf::RepeatedPtrField
+AddCleared	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::AddCleared($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+AddCustomer	src/postoffice.cc	/^void Postoffice::AddCustomer(Customer* customer) {$/;"	f	class:ps::Postoffice
+AddData	include/ps/internal/message.h	/^  void AddData(const SArray<V>& val) {$/;"	f	struct:ps::Message
+AddError	deps/include/google/protobuf/io/tokenizer.h	/^  void AddError(const string& message) {$/;"	f	class:google::protobuf::io::Tokenizer
+AddFromCleared	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::AddFromCleared() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+AddIncomming	src/resender.h	/^  bool AddIncomming(const Message& msg) {$/;"	f	class:ps::Resender
+AddLengthDelimited	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::AddLengthDelimited($/;"	f	class:google::protobuf::UnknownFieldSet
+AddOutgoing	src/resender.h	/^  void AddOutgoing(const Message& msg) {$/;"	f	class:ps::Resender
+AddResponse	src/customer.cc	/^void Customer::AddResponse(int timestamp, int num) {$/;"	f	class:ps::Customer
+AddString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::AddString(int number, FieldType type,$/;"	f	class:google::protobuf::internal::ExtensionSet
+AddWarning	deps/include/google/protobuf/io/tokenizer.h	/^  virtual void AddWarning(int line, int column, const string& message) { }$/;"	f	class:google::protobuf::io::ErrorCollector
+Advance	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::Advance(int amount) {$/;"	f	class:google::protobuf::io::CodedInputStream
+Advance	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::Advance(int amount) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+AllocatedRepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit AllocatedRepeatedPtrFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+AllocatedRepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class AllocatedRepeatedPtrFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
+AllocatedRepeatedPtrFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^AllocatedRepeatedPtrFieldBackInserter($/;"	f	namespace:google::protobuf
+AllowPartialMessage	deps/include/google/protobuf/text_format.h	/^    void AllowPartialMessage(bool allow) {$/;"	f	class:google::protobuf::TextFormat::Parser
+AllowUnknownDependencies	deps/include/google/protobuf/descriptor.h	/^  void AllowUnknownDependencies() { allow_unknown_ = true; }$/;"	f	class:google::protobuf::DescriptorPool
+ArrayInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT ArrayInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+ArrayOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT ArrayOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+AssignFunc	include/ps/internal/assign_op.h	/^inline void AssignFunc(const T& lhs, AssignOp op, T* rhs) {$/;"	f	namespace:ps
+AssignFuncInt	include/ps/internal/assign_op.h	/^inline void AssignFuncInt(const T& lhs, AssignOp op, T* rhs) {$/;"	f	namespace:ps
+AssignOp	include/ps/internal/assign_op.h	/^enum AssignOp {$/;"	g	namespace:ps
+Atomic32	deps/include/google/protobuf/stubs/atomicops.h	/^typedef int32 Atomic32;$/;"	t	namespace:google::protobuf::internal
+Atomic64	deps/include/google/protobuf/stubs/atomicops.h	/^typedef int64 Atomic64;$/;"	t	namespace:google::protobuf::internal
+Atomic64	deps/include/google/protobuf/stubs/atomicops.h	/^typedef intptr_t Atomic64;$/;"	t	namespace:google::protobuf::internal
+AtomicOps_x86CPUFeatureStruct	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^struct AtomicOps_x86CPUFeatureStruct {$/;"	s	namespace:google::protobuf::internal
+AtomicWord	deps/include/google/protobuf/stubs/atomicops.h	/^typedef intptr_t AtomicWord;$/;"	t	namespace:google::protobuf::internal
+AutoStructify	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
+AutoStructify	docs/sphinx_util.py	/^AutoStructify = transform.AutoStructify$/;"	v
+BARRIER	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+BLOCK_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    BLOCK_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
+BUILDDIR	docs/Makefile	/^BUILDDIR      = _build$/;"	m
+Barrier	src/postoffice.cc	/^void Postoffice::Barrier(int node_group) {$/;"	f	class:ps::Postoffice
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+BeginPtr	include/dmlc/base.h	/^inline T *BeginPtr(std::vector<T> &vec) {  \/\/ NOLINT(*)$/;"	f	namespace:dmlc
+BeginPtr	include/dmlc/base.h	/^inline char* BeginPtr(std::string &str) {  \/\/ NOLINT(*)$/;"	f	namespace:dmlc
+BeginPtr	include/dmlc/base.h	/^inline const T *BeginPtr(const std::vector<T> &vec) {$/;"	f	namespace:dmlc
+BeginPtr	include/dmlc/base.h	/^inline const char* BeginPtr(const std::string &str) {$/;"	f	namespace:dmlc
+BufferSize	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedInputStream::BufferSize() const {$/;"	f	class:google::protobuf::io::CodedInputStream
+ByteCount	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::ByteCount() const {$/;"	f	class:google::protobuf::io::CodedOutputStream
+ByteSize	src/meta.pb.cc	/^int PBControl::ByteSize() const {$/;"	f	class:ps::PBControl
+ByteSize	src/meta.pb.cc	/^int PBMeta::ByteSize() const {$/;"	f	class:ps::PBMeta
+ByteSize	src/meta.pb.cc	/^int PBNode::ByteSize() const {$/;"	f	class:ps::PBNode
+BytesSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::BytesSize(const string& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+CANNOT_OPEN	deps/include/google/protobuf/compiler/importer.h	/^    CANNOT_OPEN,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
+CFLAGS	Makefile	/^CFLAGS = -std=c++11 -msse2 -fPIC -O3 -ggdb -Wall -finline-functions $(INCPATH) $(ADD_CFLAGS)$/;"	m
+CHAR	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
+CITYHASH	make/deps.mk	/^CITYHASH = ${DEPS_PATH}\/include\/city.h$/;"	m
+CODE_SIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode CODE_SIZE = FileOptions_OptimizeMode_CODE_SIZE;$/;"	m	class:google::protobuf::FileOptions
+CORD	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CORD = FieldOptions_CType_CORD;$/;"	m	class:google::protobuf::FieldOptions
+CPPTYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_BOOL        = 7,     \/\/ TYPE_BOOL$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_BOOL	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_BOOL        = 7,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_DOUBLE	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_DOUBLE      = 5,     \/\/ TYPE_DOUBLE$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_DOUBLE	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_DOUBLE      = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_ENUM	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_ENUM        = 8,     \/\/ TYPE_ENUM$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_ENUM	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_ENUM        = 8,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_FLOAT	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_FLOAT       = 6,     \/\/ TYPE_FLOAT$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_FLOAT	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_FLOAT       = 6,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_INT32	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_INT32       = 1,     \/\/ TYPE_INT32, TYPE_SINT32, TYPE_SFIXED32$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_INT32	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_INT32       = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_INT64	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_INT64       = 2,     \/\/ TYPE_INT64, TYPE_SINT64, TYPE_SFIXED64$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_INT64	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_INT64       = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_MESSAGE	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_MESSAGE     = 10,    \/\/ TYPE_MESSAGE, TYPE_GROUP$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_MESSAGE	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_MESSAGE     = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_STRING	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_STRING      = 9,     \/\/ TYPE_STRING, TYPE_BYTES$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_STRING	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_STRING      = 9,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_UINT32	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_UINT32      = 3,     \/\/ TYPE_UINT32, TYPE_FIXED32$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_UINT32	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_UINT32      = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPPTYPE_UINT64	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_UINT64      = 4,     \/\/ TYPE_UINT64, TYPE_FIXED64$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+CPPTYPE_UINT64	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_UINT64      = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+CPP_COMMENT_STYLE	deps/include/google/protobuf/io/tokenizer.h	/^    CPP_COMMENT_STYLE,$/;"	e	enum:google::protobuf::io::Tokenizer::CommentStyle
+CType	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldOptions_CType CType;$/;"	t	class:google::protobuf::FieldOptions
+CType_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int CType_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldOptions
+CType_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool CType_IsValid(int value) {$/;"	f	class:google::protobuf::FieldOptions
+CType_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CType_MAX =$/;"	m	class:google::protobuf::FieldOptions
+CType_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CType_MIN =$/;"	m	class:google::protobuf::FieldOptions
+CType_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& CType_Name(CType value) {$/;"	f	class:google::protobuf::FieldOptions
+CType_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool CType_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldOptions
+CType_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  CType_descriptor() {$/;"	f	class:google::protobuf::FieldOptions
+CXX	Makefile	/^CXX = g++$/;"	m
+CXX_SUFFIX	tests/lint.py	/^CXX_SUFFIX = set(['cc', 'c', 'cpp', 'h', 'cu', 'hpp'])$/;"	v
+Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::Capacity() const {$/;"	f	class:google::protobuf::RepeatedField
+Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::Capacity() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::Capacity() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+ChannelOwnership	deps/include/google/protobuf/service.h	/^  enum ChannelOwnership {$/;"	g	class:google::protobuf::Service
+CheckNotNull	deps/include/google/protobuf/stubs/common.h	/^T* CheckNotNull(const char *file, int line, const char *name, T* val) {$/;"	f	namespace:google::protobuf::internal
+CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBControl::CheckTypeAndMergeFrom($/;"	f	class:ps::PBControl
+CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBMeta::CheckTypeAndMergeFrom($/;"	f	class:ps::PBMeta
+CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBNode::CheckTypeAndMergeFrom($/;"	f	class:ps::PBNode
+Clear	deps/include/google/protobuf/repeated_field.h	/^  static void Clear(GenericType* value) { value->Clear(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+Clear	deps/include/google/protobuf/repeated_field.h	/^  static void Clear(string* value) { value->clear(); }$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
+Clear	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Clear() {$/;"	f	class:google::protobuf::RepeatedField
+Clear	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::Clear() {$/;"	f	class:google::protobuf::RepeatedPtrField
+Clear	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::Clear() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Clear	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::Clear() {$/;"	f	class:google::protobuf::UnknownFieldSet
+Clear	src/meta.pb.cc	/^void PBControl::Clear() {$/;"	f	class:ps::PBControl
+Clear	src/meta.pb.cc	/^void PBMeta::Clear() {$/;"	f	class:ps::PBMeta
+Clear	src/meta.pb.cc	/^void PBNode::Clear() {$/;"	f	class:ps::PBNode
+ClearedCount	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::ClearedCount() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+ClearedCount	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::ClearedCount() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+CloseGap	deps/include/google/protobuf/repeated_field.h	/^  void CloseGap(int start, int num) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Closure	deps/include/google/protobuf/stubs/common.h	/^  Closure() {}$/;"	f	class:google::protobuf::Closure
+Closure	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT Closure {$/;"	c	namespace:google::protobuf
+CodeGenerator	deps/include/google/protobuf/compiler/code_generator.h	/^  inline CodeGenerator() {}$/;"	f	class:google::protobuf::compiler::CodeGenerator
+CodeGenerator	deps/include/google/protobuf/compiler/code_generator.h	/^class LIBPROTOC_EXPORT CodeGenerator {$/;"	c	namespace:google::protobuf::compiler
+CodeGeneratorRequest	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorRequest : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
+CodeGeneratorResponse	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorResponse : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
+CodeGeneratorResponse_File	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorResponse_File : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
+CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^class LIBPROTOBUF_EXPORT CodedInputStream {$/;"	c	namespace:google::protobuf::io
+CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^inline CodedInputStream::CodedInputStream(ZeroCopyInputStream* input)$/;"	f	class:google::protobuf::io::CodedInputStream
+CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^inline CodedInputStream::CodedInputStream(const uint8* buffer, int size)$/;"	f	class:google::protobuf::io::CodedInputStream
+CodedOutputStream	deps/include/google/protobuf/io/coded_stream.h	/^class LIBPROTOBUF_EXPORT CodedOutputStream {$/;"	c	namespace:google::protobuf::io
+Command	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	g	struct:ps::Control
+CommandLineInterface	deps/include/google/protobuf/compiler/command_line_interface.h	/^class LIBPROTOC_EXPORT CommandLineInterface {$/;"	c	namespace:google::protobuf::compiler
+CommentStyle	deps/include/google/protobuf/io/tokenizer.h	/^  enum CommentStyle {$/;"	g	class:google::protobuf::io::Tokenizer
+CompileAssert	deps/include/google/protobuf/stubs/common.h	/^struct CompileAssert {$/;"	s	namespace:google::protobuf::internal
+ConcatenatingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT ConcatenatingInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::EnumTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::PrimitiveTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::RepeatedEnumTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::RepeatedPrimitiveTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const Type& ConstType;$/;"	t	class:google::protobuf::internal::MessageTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const Type& ConstType;$/;"	t	class:google::protobuf::internal::RepeatedMessageTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const string& ConstType;$/;"	t	class:google::protobuf::internal::RepeatedStringTypeTraits
+ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const string& ConstType;$/;"	t	class:google::protobuf::internal::StringTypeTraits
+ConsumedEntireMessage	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ConsumedEntireMessage() {$/;"	f	class:google::protobuf::io::CodedInputStream
+Control	include/ps/internal/message.h	/^  Control() : cmd(EMPTY) { }$/;"	f	struct:ps::Control
+Control	include/ps/internal/message.h	/^struct Control {$/;"	s	namespace:ps
+ConvertHelper	deps/include/google/protobuf/stubs/type_traits.h	/^struct ConvertHelper {$/;"	s	namespace:google::protobuf::internal::internal
+CopyArray	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::CopyArray($/;"	f	class:google::protobuf::RepeatedField
+CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::CopyFrom(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
+CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::CopyFrom($/;"	f	class:google::protobuf::RepeatedPtrField
+CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::CopyFrom(const RepeatedPtrFieldBase& other) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const ForwardIt& first, const ForwardIt& last) {$/;"	f	class:ps::SArray
+CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const SArray<V>& other) {$/;"	f	class:ps::SArray
+CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const V* data, size_t size) {$/;"	f	class:ps::SArray
+CopyFrom	src/meta.pb.cc	/^void PBControl::CopyFrom(const PBControl& from) {$/;"	f	class:ps::PBControl
+CopyFrom	src/meta.pb.cc	/^void PBMeta::CopyFrom(const PBMeta& from) {$/;"	f	class:ps::PBMeta
+CopyFrom	src/meta.pb.cc	/^void PBNode::CopyFrom(const PBNode& from) {$/;"	f	class:ps::PBNode
+CopyingFileInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingFileInputStream : public CopyingInputStream {$/;"	c	class:google::protobuf::io::FileInputStream
+CopyingFileOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingFileOutputStream : public CopyingOutputStream {$/;"	c	class:google::protobuf::io::FileOutputStream
+CopyingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingInputStream {$/;"	c	namespace:google::protobuf::io
+CopyingInputStreamAdaptor	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingInputStreamAdaptor : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+CopyingIstreamInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingIstreamInputStream : public CopyingInputStream {$/;"	c	class:google::protobuf::io::IstreamInputStream
+CopyingOstreamOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingOstreamOutputStream : public CopyingOutputStream {$/;"	c	class:google::protobuf::io::OstreamOutputStream
+CopyingOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingOutputStream {$/;"	c	namespace:google::protobuf::io
+CopyingOutputStreamAdaptor	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingOutputStreamAdaptor : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+CppGenerator	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^class LIBPROTOC_EXPORT CppGenerator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::cpp
+CppType	deps/include/google/protobuf/descriptor.h	/^  enum CppType {$/;"	g	class:google::protobuf::FieldDescriptor
+CppType	deps/include/google/protobuf/wire_format_lite.h	/^  enum CppType {$/;"	g	class:google::protobuf::internal::WireFormatLite
+Create	src/van.cc	/^Van* Van::Create(const std::string& type) {$/;"	f	class:ps::Van
+CreateNested	deps/include/google/protobuf/text_format.h	/^inline TextFormat::ParseInfoTree* TextFormat::CreateNested($/;"	f	class:google::protobuf::TextFormat
+CurrentPosition	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedInputStream::CurrentPosition() const {$/;"	f	class:google::protobuf::io::CodedInputStream
+Customer	include/ps/internal/customer.h	/^class Customer {$/;"	c	namespace:ps
+Customer	src/customer.cc	/^Customer::Customer(int id, const Customer::RecvHandle& recv_handle)$/;"	f	class:ps::Customer
+DECLARE_GET_REPEATED_FIELD	deps/include/google/protobuf/message.h	/^#define DECLARE_GET_REPEATED_FIELD(/;"	d
+DECLARE_GET_REPEATED_FIELD	deps/include/google/protobuf/message.h	/^#undef DECLARE_GET_REPEATED_FIELD$/;"	d
+DEFAULT_VALUE	deps/include/google/protobuf/descriptor.h	/^      DEFAULT_VALUE,     \/\/ field default value$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+DEPRECATED_PROTOBUF_FIELD	deps/include/google/protobuf/generated_message_util.h	/^#undef DEPRECATED_PROTOBUF_FIELD$/;"	d
+DEPS_PATH	Makefile	/^DEPS_PATH = $(shell pwd)\/deps$/;"	m
+DISALLOW_COPY_AND_ASSIGN	include/dmlc/base.h	/^#    define DISALLOW_COPY_AND_ASSIGN(/;"	d
+DISALLOW_COPY_AND_ASSIGN	include/ps/internal/utils.h	/^#define DISALLOW_COPY_AND_ASSIGN(/;"	d
+DIVIDE	include/ps/internal/assign_op.h	/^  DIVIDE,  \/\/ a -= b$/;"	e	enum:ps::AssignOp
+DMLC_BASE_H_	include/dmlc/base.h	/^#define DMLC_BASE_H_$/;"	d
+DMLC_LOGGING_H_	include/dmlc/logging.h	/^#define DMLC_LOGGING_H_$/;"	d
+DMLC_LOG_FATAL_THROW	include/dmlc/base.h	/^#define DMLC_LOG_FATAL_THROW /;"	d
+DMLC_THROW_EXCEPTION	include/dmlc/logging.h	/^#define DMLC_THROW_EXCEPTION /;"	d
+DMLC_USE_CXX11	include/dmlc/base.h	/^#define DMLC_USE_CXX11 /;"	d
+DMLC_USE_CXX11	include/dmlc/base.h	/^#undef DMLC_USE_CXX11$/;"	d
+DMLC_USE_GLOG	include/dmlc/base.h	/^#define DMLC_USE_GLOG /;"	d
+DMLC_USE_HDFS	include/dmlc/base.h	/^#define DMLC_USE_HDFS /;"	d
+DMLC_USE_PS	include/dmlc/base.h	/^#define DMLC_USE_PS /;"	d
+DMLC_USE_S3	include/dmlc/base.h	/^#define DMLC_USE_S3 /;"	d
+DOUBLE	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
+DO_	src/meta.pb.cc	/^#define DO_(/;"	d	file:
+DO_	src/meta.pb.cc	/^#undef DO_$/;"	d	file:
+DataType	include/ps/internal/message.h	/^enum DataType {$/;"	g	namespace:ps
+DataTypeName	include/ps/internal/message.h	/^static const char* DataTypeName[] = {$/;"	m	namespace:ps
+DebugStr	include/ps/sarray.h	/^inline std::string DebugStr(const V* data, int n, int m = 5) {$/;"	f	namespace:ps
+DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Control
+DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Message
+DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Meta
+DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Node
+DecodeDouble	deps/include/google/protobuf/wire_format_lite.h	/^inline double WireFormatLite::DecodeDouble(uint64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+DecodeFloat	deps/include/google/protobuf/wire_format_lite.h	/^inline float WireFormatLite::DecodeFloat(uint32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+DecrementRecursionDepth	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::DecrementRecursionDepth() {$/;"	f	class:google::protobuf::io::CodedInputStream
+DefaultSlicer	include/ps/kv_app.h	/^void KVWorker<Val>::DefaultSlicer($/;"	f	class:ps::KVWorker
+Delete	deps/include/google/protobuf/repeated_field.h	/^  static void Delete(GenericType* value) { delete value; }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+DeleteSubrange	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::DeleteSubrange(int start, int num) {$/;"	f	class:google::protobuf::RepeatedPtrField
+Descriptor	deps/include/google/protobuf/descriptor.h	/^  Descriptor() {}$/;"	f	class:google::protobuf::Descriptor
+Descriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT Descriptor {$/;"	c	namespace:google::protobuf
+DescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^  inline DescriptorDatabase() {}$/;"	f	class:google::protobuf::DescriptorDatabase
+DescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT DescriptorDatabase {$/;"	c	namespace:google::protobuf
+DescriptorIndex	deps/include/google/protobuf/descriptor_database.h	/^  class DescriptorIndex {$/;"	c	class:google::protobuf::SimpleDescriptorDatabase
+DescriptorPool	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT DescriptorPool {$/;"	c	namespace:google::protobuf
+DescriptorPoolDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT DescriptorPoolDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
+DescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT DescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+DescriptorProto_ExtensionRange	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT DescriptorProto_ExtensionRange : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+Destroy	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::Destroy() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+DiskFileToVirtualFileResult	deps/include/google/protobuf/compiler/importer.h	/^  enum DiskFileToVirtualFileResult {$/;"	g	class:google::protobuf::compiler::DiskSourceTree
+DiskSourceTree	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT DiskSourceTree : public SourceTree {$/;"	c	namespace:google::protobuf::compiler
+DynamicMessageFactory	deps/include/google/protobuf/dynamic_message.h	/^class LIBPROTOBUF_EXPORT DynamicMessageFactory : public MessageFactory {$/;"	c	namespace:google::protobuf
+EADDRINUSE	deps/include/zmq.h	/^#define EADDRINUSE /;"	d
+EADDRNOTAVAIL	deps/include/zmq.h	/^#define EADDRNOTAVAIL /;"	d
+EAFNOSUPPORT	deps/include/zmq.h	/^#define EAFNOSUPPORT /;"	d
+ECONNABORTED	deps/include/zmq.h	/^#define ECONNABORTED /;"	d
+ECONNREFUSED	deps/include/zmq.h	/^#define ECONNREFUSED /;"	d
+ECONNRESET	deps/include/zmq.h	/^#define ECONNRESET /;"	d
+EFSM	deps/include/zmq.h	/^#define EFSM /;"	d
+EHOSTUNREACH	deps/include/zmq.h	/^#define EHOSTUNREACH /;"	d
+EINPROGRESS	deps/include/zmq.h	/^#define EINPROGRESS /;"	d
+EMPTY	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+EMSGSIZE	deps/include/zmq.h	/^#define EMSGSIZE /;"	d
+EMTHREAD	deps/include/zmq.h	/^#define EMTHREAD /;"	d
+ENETDOWN	deps/include/zmq.h	/^#define ENETDOWN /;"	d
+ENETRESET	deps/include/zmq.h	/^#define ENETRESET /;"	d
+ENETUNREACH	deps/include/zmq.h	/^#define ENETUNREACH /;"	d
+ENOBUFS	deps/include/zmq.h	/^#define ENOBUFS /;"	d
+ENOCOMPATPROTO	deps/include/zmq.h	/^#define ENOCOMPATPROTO /;"	d
+ENOTCONN	deps/include/zmq.h	/^#define ENOTCONN /;"	d
+ENOTSOCK	deps/include/zmq.h	/^#define ENOTSOCK /;"	d
+ENOTSUP	deps/include/zmq.h	/^#define ENOTSUP /;"	d
+EPROTONOSUPPORT	deps/include/zmq.h	/^#define EPROTONOSUPPORT /;"	d
+ERROR_FORMAT_GCC	deps/include/google/protobuf/compiler/command_line_interface.h	/^    ERROR_FORMAT_GCC,   \/\/ GCC error output format (default).$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ErrorFormat
+ERROR_FORMAT_MSVS	deps/include/google/protobuf/compiler/command_line_interface.h	/^    ERROR_FORMAT_MSVS   \/\/ Visual Studio output (--error_format=msvs).$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ErrorFormat
+ETERM	deps/include/zmq.h	/^#define ETERM /;"	d
+ETIMEDOUT	deps/include/zmq.h	/^#define ETIMEDOUT /;"	d
+EXTENDEE	deps/include/google/protobuf/descriptor.h	/^      EXTENDEE,          \/\/ field extendee$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+ElementCopier	deps/include/google/protobuf/repeated_field.h	/^struct ElementCopier {$/;"	s	namespace:google::protobuf::internal
+ElementCopier	deps/include/google/protobuf/repeated_field.h	/^struct ElementCopier<Element, true> {$/;"	s	namespace:google::protobuf::internal
+EncodeDouble	deps/include/google/protobuf/wire_format_lite.h	/^inline uint64 WireFormatLite::EncodeDouble(double value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+EncodeFloat	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::EncodeFloat(float value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+EncodedDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT EncodedDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
+Entry	src/resender.h	/^  struct Entry {$/;"	s	class:ps::Resender
+EnumDescriptor	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor() {}$/;"	f	class:google::protobuf::EnumDescriptor
+EnumDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT EnumDescriptor {$/;"	c	namespace:google::protobuf
+EnumDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+EnumOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+EnumSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::EnumSize(int value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+EnumTypeTraits	deps/include/google/protobuf/extension_set.h	/^class EnumTypeTraits {$/;"	c	namespace:google::protobuf::internal
+EnumValidityCheck	deps/include/google/protobuf/extension_set.h	/^  struct EnumValidityCheck {$/;"	s	struct:google::protobuf::internal::ExtensionInfo
+EnumValidityFunc	deps/include/google/protobuf/extension_set.h	/^typedef bool EnumValidityFunc(int number);$/;"	t	namespace:google::protobuf::internal
+EnumValidityFuncWithArg	deps/include/google/protobuf/extension_set.h	/^typedef bool EnumValidityFuncWithArg(const void* arg, int number);$/;"	t	namespace:google::protobuf::internal
+EnumValueDescriptor	deps/include/google/protobuf/descriptor.h	/^  EnumValueDescriptor() {}$/;"	f	class:google::protobuf::EnumValueDescriptor
+EnumValueDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT EnumValueDescriptor {$/;"	c	namespace:google::protobuf
+EnumValueDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumValueDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+EnumValueOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumValueOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+Environment	include/ps/internal/env.h	/^  explicit Environment(const std::unordered_map<std::string, std::string>* envs) {$/;"	f	class:ps::Environment
+Environment	include/ps/internal/env.h	/^class Environment {$/;"	c	namespace:ps
+Error	include/dmlc/logging.h	/^  explicit Error(const std::string &s) : std::runtime_error(s) {}$/;"	f	struct:dmlc::Error
+Error	include/dmlc/logging.h	/^struct Error : public std::runtime_error {$/;"	s	namespace:dmlc
+ErrorCollector	deps/include/google/protobuf/descriptor.h	/^    inline ErrorCollector() {}$/;"	f	class:google::protobuf::DescriptorPool::ErrorCollector
+ErrorCollector	deps/include/google/protobuf/descriptor.h	/^  class LIBPROTOBUF_EXPORT ErrorCollector {$/;"	c	class:google::protobuf::DescriptorPool
+ErrorCollector	deps/include/google/protobuf/io/tokenizer.h	/^  inline ErrorCollector() {}$/;"	f	class:google::protobuf::io::ErrorCollector
+ErrorCollector	deps/include/google/protobuf/io/tokenizer.h	/^class LIBPROTOBUF_EXPORT ErrorCollector {$/;"	c	namespace:google::protobuf::io
+ErrorFormat	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum ErrorFormat {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
+ErrorLocation	deps/include/google/protobuf/descriptor.h	/^    enum ErrorLocation {$/;"	g	class:google::protobuf::DescriptorPool::ErrorCollector
+ExSocket	tracker/tracker.py	/^class ExSocket:$/;"	c
+ExpectAtEnd	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ExpectAtEnd() {$/;"	f	class:google::protobuf::io::CodedInputStream
+ExpectTag	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ExpectTag(uint32 expected) {$/;"	f	class:google::protobuf::io::CodedInputStream
+ExpectTagFromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ExpectTagFromArray($/;"	f	class:google::protobuf::io::CodedInputStream
+Extendee	deps/include/google/protobuf/extension_set.h	/^  typedef ExtendeeType Extendee;$/;"	t	class:google::protobuf::internal::ExtensionIdentifier
+Extension	deps/include/google/protobuf/extension_set.h	/^  struct Extension {$/;"	s	class:google::protobuf::internal::ExtensionSet
+ExtensionFinder	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT ExtensionFinder {$/;"	c	namespace:google::protobuf::internal
+ExtensionIdentifier	deps/include/google/protobuf/extension_set.h	/^  ExtensionIdentifier(int number, typename TypeTraits::ConstType default_value)$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
+ExtensionIdentifier	deps/include/google/protobuf/extension_set.h	/^class ExtensionIdentifier {$/;"	c	namespace:google::protobuf::internal
+ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^  inline ExtensionInfo() {}$/;"	f	struct:google::protobuf::internal::ExtensionInfo
+ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^  inline ExtensionInfo(FieldType type_param, bool isrepeated, bool ispacked)$/;"	f	struct:google::protobuf::internal::ExtensionInfo
+ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^struct ExtensionInfo {$/;"	s	namespace:google::protobuf::internal
+ExtensionRange	deps/include/google/protobuf/descriptor.h	/^  struct ExtensionRange {$/;"	s	class:google::protobuf::Descriptor
+ExtensionRange	deps/include/google/protobuf/descriptor.pb.h	/^  typedef DescriptorProto_ExtensionRange ExtensionRange;$/;"	t	class:google::protobuf::DescriptorProto
+ExtensionSet	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT ExtensionSet {$/;"	c	namespace:google::protobuf::internal
+ExtractSubrange	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::ExtractSubrange($/;"	f	class:google::protobuf::RepeatedPtrField
+ExtractSubrange	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::ExtractSubrange($/;"	f	class:google::protobuf::RepeatedField
+FLOAT	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
+F_OK	src/windows/unistd.h	/^#define F_OK /;"	d
+FatalException	deps/include/google/protobuf/stubs/common.h	/^  FatalException(const char* filename, int line, const std::string& message)$/;"	f	class:google::protobuf::FatalException
+FatalException	deps/include/google/protobuf/stubs/common.h	/^class FatalException : public std::exception {$/;"	c	namespace:google::protobuf
+FieldDescriptor	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor() {}$/;"	f	class:google::protobuf::FieldDescriptor
+FieldDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT FieldDescriptor {$/;"	c	namespace:google::protobuf
+FieldDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FieldDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+FieldDescriptorProto_Label	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldDescriptorProto_Label {$/;"	g	namespace:google::protobuf
+FieldDescriptorProto_Label_LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_OPTIONAL = 1,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
+FieldDescriptorProto_Label_LABEL_REPEATED	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_REPEATED = 3$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
+FieldDescriptorProto_Label_LABEL_REQUIRED	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_REQUIRED = 2,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
+FieldDescriptorProto_Label_Label_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldDescriptorProto_Label_Label_ARRAYSIZE = FieldDescriptorProto_Label_Label_MAX + 1;$/;"	m	namespace:google::protobuf
+FieldDescriptorProto_Label_Label_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MAX = FieldDescriptorProto_Label_LABEL_REPEATED;$/;"	m	namespace:google::protobuf
+FieldDescriptorProto_Label_Label_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MIN = FieldDescriptorProto_Label_LABEL_OPTIONAL;$/;"	m	namespace:google::protobuf
+FieldDescriptorProto_Label_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto_Label_Name(FieldDescriptorProto_Label value) {$/;"	f	namespace:google::protobuf
+FieldDescriptorProto_Label_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto_Label_Parse($/;"	f	namespace:google::protobuf
+FieldDescriptorProto_Type	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldDescriptorProto_Type {$/;"	g	namespace:google::protobuf
+FieldDescriptorProto_Type_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto_Type_Name(FieldDescriptorProto_Type value) {$/;"	f	namespace:google::protobuf
+FieldDescriptorProto_Type_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto_Type_Parse($/;"	f	namespace:google::protobuf
+FieldDescriptorProto_Type_TYPE_BOOL	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_BOOL = 8,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_BYTES	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_BYTES = 12,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_DOUBLE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_DOUBLE = 1,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_ENUM	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_ENUM = 14,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_FIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FIXED32 = 7,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_FIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FIXED64 = 6,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_FLOAT	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FLOAT = 2,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_GROUP	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_GROUP = 10,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_INT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_INT32 = 5,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_INT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_INT64 = 3,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_MESSAGE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_MESSAGE = 11,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_SFIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SFIXED32 = 15,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_SFIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SFIXED64 = 16,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_SINT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SINT32 = 17,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_SINT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SINT64 = 18$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_STRING = 9,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_UINT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_UINT32 = 13,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_TYPE_UINT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_UINT64 = 4,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
+FieldDescriptorProto_Type_Type_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldDescriptorProto_Type_Type_ARRAYSIZE = FieldDescriptorProto_Type_Type_MAX + 1;$/;"	m	namespace:google::protobuf
+FieldDescriptorProto_Type_Type_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MAX = FieldDescriptorProto_Type_TYPE_SINT64;$/;"	m	namespace:google::protobuf
+FieldDescriptorProto_Type_Type_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MIN = FieldDescriptorProto_Type_TYPE_DOUBLE;$/;"	m	namespace:google::protobuf
+FieldOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FieldOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+FieldOptions_CType	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldOptions_CType {$/;"	g	namespace:google::protobuf
+FieldOptions_CType_CORD	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_CORD = 1,$/;"	e	enum:google::protobuf::FieldOptions_CType
+FieldOptions_CType_CType_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldOptions_CType_CType_ARRAYSIZE = FieldOptions_CType_CType_MAX + 1;$/;"	m	namespace:google::protobuf
+FieldOptions_CType_CType_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldOptions_CType FieldOptions_CType_CType_MAX = FieldOptions_CType_STRING_PIECE;$/;"	m	namespace:google::protobuf
+FieldOptions_CType_CType_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldOptions_CType FieldOptions_CType_CType_MIN = FieldOptions_CType_STRING;$/;"	m	namespace:google::protobuf
+FieldOptions_CType_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldOptions_CType_Name(FieldOptions_CType value) {$/;"	f	namespace:google::protobuf
+FieldOptions_CType_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions_CType_Parse($/;"	f	namespace:google::protobuf
+FieldOptions_CType_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_STRING = 0,$/;"	e	enum:google::protobuf::FieldOptions_CType
+FieldOptions_CType_STRING_PIECE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_STRING_PIECE = 2$/;"	e	enum:google::protobuf::FieldOptions_CType
+FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^  FieldSkipper() {}$/;"	f	class:google::protobuf::internal::FieldSkipper
+FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^class LIBPROTOBUF_EXPORT FieldSkipper {$/;"	c	namespace:google::protobuf::internal
+FieldType	deps/include/google/protobuf/extension_set.h	/^typedef uint8 FieldType;$/;"	t	namespace:google::protobuf::internal
+FieldType	deps/include/google/protobuf/wire_format_lite.h	/^  enum FieldType {$/;"	g	class:google::protobuf::internal::WireFormatLite
+FieldTypeToCppType	deps/include/google/protobuf/wire_format_lite.h	/^WireFormatLite::FieldTypeToCppType(FieldType type) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+File	deps/include/google/protobuf/compiler/plugin.pb.h	/^  typedef CodeGeneratorResponse_File File;$/;"	t	class:google::protobuf::compiler::CodeGeneratorResponse
+FileDescriptor	deps/include/google/protobuf/descriptor.h	/^  FileDescriptor() {}$/;"	f	class:google::protobuf::FileDescriptor
+FileDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT FileDescriptor {$/;"	c	namespace:google::protobuf
+FileDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+FileDescriptorSet	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileDescriptorSet : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+FileInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT FileInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+FileOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+FileOptions_OptimizeMode	deps/include/google/protobuf/descriptor.pb.h	/^enum FileOptions_OptimizeMode {$/;"	g	namespace:google::protobuf
+FileOptions_OptimizeMode_CODE_SIZE	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_CODE_SIZE = 2,$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
+FileOptions_OptimizeMode_LITE_RUNTIME	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_LITE_RUNTIME = 3$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
+FileOptions_OptimizeMode_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions_OptimizeMode_Name(FileOptions_OptimizeMode value) {$/;"	f	namespace:google::protobuf
+FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE = FileOptions_OptimizeMode_OptimizeMode_MAX + 1;$/;"	m	namespace:google::protobuf
+FileOptions_OptimizeMode_OptimizeMode_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MAX = FileOptions_OptimizeMode_LITE_RUNTIME;$/;"	m	namespace:google::protobuf
+FileOptions_OptimizeMode_OptimizeMode_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MIN = FileOptions_OptimizeMode_SPEED;$/;"	m	namespace:google::protobuf
+FileOptions_OptimizeMode_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions_OptimizeMode_Parse($/;"	f	namespace:google::protobuf
+FileOptions_OptimizeMode_SPEED	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_SPEED = 1,$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
+FileOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT FileOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+Finalize	include/ps/ps.h	/^inline void Finalize(const bool do_barrier = true) {$/;"	f	namespace:ps
+Finalize	src/postoffice.cc	/^void Postoffice::Finalize(const bool do_barrier) {$/;"	f	class:ps::Postoffice
+FindAllExtensionNumbers	deps/include/google/protobuf/descriptor_database.h	/^  virtual bool FindAllExtensionNumbers(const string& extendee_type,$/;"	f	class:google::protobuf::DescriptorDatabase
+FindRange	include/ps/sarray.h	/^Range FindRange(const SArray<V>& arr, V lower, V upper) {$/;"	f	namespace:ps
+Finder	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Finder {$/;"	c	class:google::protobuf::TextFormat
+Format	deps/include/google/protobuf/io/gzip_stream.h	/^  enum Format {$/;"	g	class:google::protobuf::io::GzipInputStream
+Format	deps/include/google/protobuf/io/gzip_stream.h	/^  enum Format {$/;"	g	class:google::protobuf::io::GzipOutputStream
+FreeData	src/zmq_van.h	/^inline void FreeData(void *data, void *hint) {$/;"	f	namespace:ps
+FunctionClosure0	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure0(FunctionType function, bool self_deleting)$/;"	f	class:google::protobuf::internal::FunctionClosure0
+FunctionClosure0	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT FunctionClosure0 : public Closure {$/;"	c	namespace:google::protobuf::internal
+FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure1(FunctionType function, bool self_deleting,$/;"	f	class:google::protobuf::internal::FunctionClosure1
+FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^class FunctionClosure1 : public Closure {$/;"	c	namespace:google::protobuf::internal
+FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure2(FunctionType function, bool self_deleting,$/;"	f	class:google::protobuf::internal::FunctionClosure2
+FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^class FunctionClosure2 : public Closure {$/;"	c	namespace:google::protobuf::internal
+FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)();$/;"	t	class:google::protobuf::internal::FunctionClosure0
+FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)(Arg1 arg1);$/;"	t	class:google::protobuf::internal::FunctionClosure1
+FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)(Arg1 arg1, Arg2 arg2);$/;"	t	class:google::protobuf::internal::FunctionClosure2
+GOOGLE_ARRAYSIZE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ARRAYSIZE(/;"	d
+GOOGLE_ARRAYSIZE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_ARRAYSIZE$/;"	d
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^                                           int* size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^                                       int size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedOutputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint64 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedOutputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^  bool ExpectTag(uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^  uint32 ReadTag() GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE /;"	d
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE$/;"	d
+GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/wire_format_lite.h	/^      RepeatedField<CType>* value) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::internal::WireFormatLite
+GOOGLE_ATTRIBUTE_DEPRECATED	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_DEPRECATED /;"	d
+GOOGLE_ATTRIBUTE_DEPRECATED	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_DEPRECATED$/;"	d
+GOOGLE_CHECK	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK(/;"	d
+GOOGLE_CHECK	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK$/;"	d
+GOOGLE_CHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_EQ(/;"	d
+GOOGLE_CHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_EQ$/;"	d
+GOOGLE_CHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_GE(/;"	d
+GOOGLE_CHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_GE$/;"	d
+GOOGLE_CHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_GT(/;"	d
+GOOGLE_CHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_GT$/;"	d
+GOOGLE_CHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_LE(/;"	d
+GOOGLE_CHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_LE$/;"	d
+GOOGLE_CHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_LT(/;"	d
+GOOGLE_CHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_LT$/;"	d
+GOOGLE_CHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_NE(/;"	d
+GOOGLE_CHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_NE$/;"	d
+GOOGLE_CHECK_NOTNULL	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_NOTNULL(/;"	d
+GOOGLE_CHECK_NOTNULL	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_NOTNULL$/;"	d
+GOOGLE_COMPILE_ASSERT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_COMPILE_ASSERT(/;"	d
+GOOGLE_COMPILE_ASSERT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_COMPILE_ASSERT$/;"	d
+GOOGLE_DCHECK	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK(/;"	d
+GOOGLE_DCHECK	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK$/;"	d
+GOOGLE_DCHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_EQ(/;"	d
+GOOGLE_DCHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_EQ$/;"	d
+GOOGLE_DCHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_GE(/;"	d
+GOOGLE_DCHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_GE$/;"	d
+GOOGLE_DCHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_GT(/;"	d
+GOOGLE_DCHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_GT$/;"	d
+GOOGLE_DCHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_LE(/;"	d
+GOOGLE_DCHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_LE$/;"	d
+GOOGLE_DCHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_LT(/;"	d
+GOOGLE_DCHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_LT$/;"	d
+GOOGLE_DCHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_NE(/;"	d
+GOOGLE_DCHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_NE$/;"	d
+GOOGLE_DISALLOW_EVIL_CONSTRUCTORS	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(/;"	d
+GOOGLE_DISALLOW_EVIL_CONSTRUCTORS	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DISALLOW_EVIL_CONSTRUCTORS$/;"	d
+GOOGLE_DLOG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DLOG /;"	d
+GOOGLE_DLOG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DLOG$/;"	d
+GOOGLE_LL_FORMAT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LL_FORMAT /;"	d
+GOOGLE_LL_FORMAT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LL_FORMAT$/;"	d
+GOOGLE_LOG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LOG(/;"	d
+GOOGLE_LOG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LOG$/;"	d
+GOOGLE_LOG_IF	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LOG_IF(/;"	d
+GOOGLE_LOG_IF	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LOG_IF$/;"	d
+GOOGLE_LONGLONG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LONGLONG(/;"	d
+GOOGLE_LONGLONG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LONGLONG$/;"	d
+GOOGLE_PREDICT_TRUE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PREDICT_TRUE$/;"	d
+GOOGLE_PREDICT_TRUE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PREDICT_TRUE(/;"	d
+GOOGLE_PROTOBUF_ARCH_32_BIT	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_32_BIT /;"	d
+GOOGLE_PROTOBUF_ARCH_64_BIT	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_64_BIT /;"	d
+GOOGLE_PROTOBUF_ARCH_ARM	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_ARM /;"	d
+GOOGLE_PROTOBUF_ARCH_ARM_QNX	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_ARM_QNX /;"	d
+GOOGLE_PROTOBUF_ARCH_IA32	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_IA32 /;"	d
+GOOGLE_PROTOBUF_ARCH_MIPS	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_MIPS /;"	d
+GOOGLE_PROTOBUF_ARCH_PPC	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_PPC /;"	d
+GOOGLE_PROTOBUF_ARCH_X64	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_X64 /;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_ERROR	deps/include/google/protobuf/stubs/atomicops.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_ERROR /;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_ERROR	deps/include/google/protobuf/stubs/atomicops.h	/^#undef GOOGLE_PROTOBUF_ATOMICOPS_ERROR$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_H_	deps/include/google/protobuf/stubs/atomicops.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_$/;"	d
+GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_$/;"	d
+GOOGLE_PROTOBUF_COMMON_H__	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_COMMON_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__	deps/include/google/protobuf/compiler/code_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__	deps/include/google/protobuf/compiler/command_line_interface.h	/^#define GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__	deps/include/google/protobuf/compiler/importer.h	/^#define GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__	deps/include/google/protobuf/compiler/java/java_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_PARSER_H__	deps/include/google/protobuf/compiler/parser.h	/^#define GOOGLE_PROTOBUF_COMPILER_PARSER_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__	deps/include/google/protobuf/compiler/plugin.h	/^#define GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__$/;"	d
+GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__	deps/include/google/protobuf/compiler/python/python_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__$/;"	d
+GOOGLE_PROTOBUF_DECLARE_ONCE	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_DECLARE_ONCE(/;"	d
+GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__	deps/include/google/protobuf/descriptor_database.h	/^#define GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__$/;"	d
+GOOGLE_PROTOBUF_DESCRIPTOR_H__	deps/include/google/protobuf/descriptor.h	/^#define GOOGLE_PROTOBUF_DESCRIPTOR_H__$/;"	d
+GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__	deps/include/google/protobuf/dynamic_message.h	/^#define GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__$/;"	d
+GOOGLE_PROTOBUF_EXTENSION_ACCESSORS	deps/include/google/protobuf/extension_set.h	/^#define GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(/;"	d
+GOOGLE_PROTOBUF_EXTENSION_SET_H__	deps/include/google/protobuf/extension_set.h	/^#define GOOGLE_PROTOBUF_EXTENSION_SET_H__$/;"	d
+GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__	deps/include/google/protobuf/generated_enum_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__$/;"	d
+GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET	deps/include/google/protobuf/generated_message_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(/;"	d
+GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__	deps/include/google/protobuf/generated_message_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__$/;"	d
+GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__	deps/include/google/protobuf/generated_message_util.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__$/;"	d
+GOOGLE_PROTOBUF_IO_CODED_STREAM_H__	deps/include/google/protobuf/io/coded_stream.h	/^#define GOOGLE_PROTOBUF_IO_CODED_STREAM_H__$/;"	d
+GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__	deps/include/google/protobuf/io/gzip_stream.h	/^#define GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__$/;"	d
+GOOGLE_PROTOBUF_IO_PRINTER_H__	deps/include/google/protobuf/io/printer.h	/^#define GOOGLE_PROTOBUF_IO_PRINTER_H__$/;"	d
+GOOGLE_PROTOBUF_IO_TOKENIZER_H__	deps/include/google/protobuf/io/tokenizer.h	/^#define GOOGLE_PROTOBUF_IO_TOKENIZER_H__$/;"	d
+GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__	deps/include/google/protobuf/io/zero_copy_stream.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__$/;"	d
+GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__$/;"	d
+GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__$/;"	d
+GOOGLE_PROTOBUF_MESSAGE_H__	deps/include/google/protobuf/message.h	/^#define GOOGLE_PROTOBUF_MESSAGE_H__$/;"	d
+GOOGLE_PROTOBUF_MESSAGE_LITE_H__	deps/include/google/protobuf/message_lite.h	/^#define GOOGLE_PROTOBUF_MESSAGE_LITE_H__$/;"	d
+GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION /;"	d
+GOOGLE_PROTOBUF_MIN_PROTOC_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_MIN_PROTOC_VERSION /;"	d
+GOOGLE_PROTOBUF_ONCE_INIT	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_ONCE_INIT /;"	d
+GOOGLE_PROTOBUF_OS_APPLE	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_OS_APPLE$/;"	d
+GOOGLE_PROTOBUF_OS_NACL	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_OS_NACL$/;"	d
+GOOGLE_PROTOBUF_PLATFORM_MACROS_H_	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_PLATFORM_MACROS_H_$/;"	d
+GOOGLE_PROTOBUF_REFLECTION_OPS_H__	deps/include/google/protobuf/reflection_ops.h	/^#define GOOGLE_PROTOBUF_REFLECTION_OPS_H__$/;"	d
+GOOGLE_PROTOBUF_REPEATED_FIELD_H__	deps/include/google/protobuf/repeated_field.h	/^#define GOOGLE_PROTOBUF_REPEATED_FIELD_H__$/;"	d
+GOOGLE_PROTOBUF_SERVICE_H__	deps/include/google/protobuf/service.h	/^#define GOOGLE_PROTOBUF_SERVICE_H__$/;"	d
+GOOGLE_PROTOBUF_STUBS_ONCE_H__	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_STUBS_ONCE_H__$/;"	d
+GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_	deps/include/google/protobuf/stubs/template_util.h	/^#define GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_$/;"	d
+GOOGLE_PROTOBUF_TEXT_FORMAT_H__	deps/include/google/protobuf/text_format.h	/^#define GOOGLE_PROTOBUF_TEXT_FORMAT_H__$/;"	d
+GOOGLE_PROTOBUF_TYPE_TRAITS_H_	deps/include/google/protobuf/stubs/type_traits.h	/^#define GOOGLE_PROTOBUF_TYPE_TRAITS_H_$/;"	d
+GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__	deps/include/google/protobuf/unknown_field_set.h	/^#define GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__$/;"	d
+GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED	deps/include/google/protobuf/wire_format.h	/^#define GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED$/;"	d
+GOOGLE_PROTOBUF_VERIFY_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_VERIFY_VERSION /;"	d
+GOOGLE_PROTOBUF_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_VERSION /;"	d
+GOOGLE_PROTOBUF_WIRE_FORMAT_H__	deps/include/google/protobuf/wire_format.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_H__$/;"	d
+GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__	deps/include/google/protobuf/wire_format_lite.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__$/;"	d
+GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__	deps/include/google/protobuf/wire_format_lite_inl.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__$/;"	d
+GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG	deps/include/google/protobuf/wire_format_lite.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(/;"	d
+GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN(/;"	d
+GOOGLE_SAFE_CONCURRENT_WRITES_END	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_SAFE_CONCURRENT_WRITES_END(/;"	d
+GOOGLE_ULONGLONG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ULONGLONG(/;"	d
+GOOGLE_ULONGLONG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_ULONGLONG$/;"	d
+GZIP	deps/include/google/protobuf/io/gzip_stream.h	/^    GZIP = 1,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
+GZIP	deps/include/google/protobuf/io/gzip_stream.h	/^    GZIP = 1,$/;"	e	enum:google::protobuf::io::GzipOutputStream::Format
+GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^  GeneratedExtensionFinder(const MessageLite* containing_type)$/;"	f	class:google::protobuf::internal::GeneratedExtensionFinder
+GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT GeneratedExtensionFinder : public ExtensionFinder {$/;"	c	namespace:google::protobuf::internal
+GeneratedMessageReflection	deps/include/google/protobuf/generated_message_reflection.h	/^class LIBPROTOBUF_EXPORT GeneratedMessageReflection : public Reflection {$/;"	c	namespace:google::protobuf::internal
+Generator	deps/include/google/protobuf/compiler/python/python_generator.h	/^class LIBPROTOC_EXPORT Generator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::python
+GeneratorContext	deps/include/google/protobuf/compiler/code_generator.h	/^  inline GeneratorContext() {}$/;"	f	class:google::protobuf::compiler::GeneratorContext
+GeneratorContext	deps/include/google/protobuf/compiler/code_generator.h	/^class LIBPROTOC_EXPORT GeneratorContext {$/;"	c	namespace:google::protobuf::compiler
+GeneratorInfo	deps/include/google/protobuf/compiler/command_line_interface.h	/^  struct GeneratorInfo {$/;"	s	class:google::protobuf::compiler::CommandLineInterface
+GeneratorMap	deps/include/google/protobuf/compiler/command_line_interface.h	/^  typedef map<string, GeneratorInfo> GeneratorMap;$/;"	t	class:google::protobuf::compiler::CommandLineInterface
+GenericTypeHandler	deps/include/google/protobuf/repeated_field.h	/^class GenericTypeHandler {$/;"	c	namespace:google::protobuf::internal
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set, int index) {$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set, int index) {$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::EnumTypeTraits
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline const string& Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
+Get	deps/include/google/protobuf/extension_set.h	/^  static inline const string& Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::StringTypeTraits
+Get	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::Get(int index) const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Get	deps/include/google/protobuf/repeated_field.h	/^inline const Element& RepeatedField<Element>::Get(int index) const {$/;"	f	class:google::protobuf::RepeatedField
+Get	deps/include/google/protobuf/repeated_field.h	/^inline const Element& RepeatedPtrField<Element>::Get(int index) const {$/;"	f	class:google::protobuf::RepeatedPtrField
+Get	include/ps/internal/env.h	/^  static inline Environment* Get() {$/;"	f	class:ps::Environment
+Get	include/ps/internal/postoffice.h	/^  static Postoffice* Get() {$/;"	f	class:ps::Postoffice
+GetAvailableInterfaceAndIP	src/network_utils.h	/^void GetAvailableInterfaceAndIP($/;"	f	namespace:ps
+GetAvailablePort	src/network_utils.h	/^int GetAvailablePort() {$/;"	f	namespace:ps
+GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::DescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumValueOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FieldDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FieldOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileDescriptorSet
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MessageOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MethodDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MethodOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::ServiceDescriptorProto
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::ServiceOptions
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::SourceCodeInfo
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::UninterpretedOption
+GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+GetCustomer	src/postoffice.cc	/^Customer* Postoffice::GetCustomer(int id, int timeout) const {$/;"	f	class:ps::Postoffice
+GetDataType	include/ps/internal/message.h	/^DataType GetDataType() {$/;"	f	namespace:ps
+GetDeadNodes	src/postoffice.cc	/^std::vector<int> Postoffice::GetDeadNodes(int t) {$/;"	f	class:ps::Postoffice
+GetDescriptor	deps/include/google/protobuf/message.h	/^  const Descriptor* GetDescriptor() const { return GetMetadata().descriptor; }$/;"	f	class:google::protobuf::Message
+GetDirectBufferForNBytesAndAdvance	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::GetDirectBufferForNBytesAndAdvance(int size) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+GetDirectBufferPointerInline	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::GetDirectBufferPointerInline(const void** data,$/;"	f	class:google::protobuf::io::CodedInputStream
+GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Label>() {$/;"	f	namespace:google::protobuf
+GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Type>() {$/;"	f	namespace:google::protobuf
+GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldOptions_CType>() {$/;"	f	namespace:google::protobuf
+GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FileOptions_OptimizeMode>() {$/;"	f	namespace:google::protobuf
+GetEnv	include/ps/internal/utils.h	/^inline V GetEnv(const char *key, V default_val) {$/;"	f	namespace:ps
+GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int GetErrno() { return errno_; }$/;"	f	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int GetErrno() { return errno_; }$/;"	f	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int GetErrno() { return copying_input_.GetErrno(); }$/;"	f	class:google::protobuf::io::FileInputStream
+GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int GetErrno() { return copying_output_.GetErrno(); }$/;"	f	class:google::protobuf::io::FileOutputStream
+GetExtensionFactory	deps/include/google/protobuf/io/coded_stream.h	/^inline MessageFactory* CodedInputStream::GetExtensionFactory() {$/;"	f	class:google::protobuf::io::CodedInputStream
+GetExtensionPool	deps/include/google/protobuf/io/coded_stream.h	/^inline const DescriptorPool* CodedInputStream::GetExtensionPool() {$/;"	f	class:google::protobuf::io::CodedInputStream
+GetIP	src/network_utils.h	/^void GetIP(const std::string& interface, std::string* ip) {$/;"	f	namespace:ps
+GetKey	src/resender.h	/^  uint64_t GetKey(const Message& msg) {$/;"	f	class:ps::Resender
+GetLengthDelimitedSize	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownField::GetLengthDelimitedSize() const {$/;"	f	class:google::protobuf::UnknownField
+GetMessage	deps/include/google/protobuf/stubs/common.h	/^#undef GetMessage$/;"	d
+GetMessage	deps/include/google/protobuf/stubs/common.h	/^inline BOOL GetMessage($/;"	f
+GetMessage_Win32	deps/include/google/protobuf/stubs/common.h	/^inline BOOL GetMessage_Win32($/;"	f
+GetNodeID	src/zmq_van.h	/^  int GetNodeID(const char* buf, size_t size) {$/;"	f	class:ps::ZMQVan
+GetNodeIDs	include/ps/internal/postoffice.h	/^  const std::vector<int>& GetNodeIDs(int node_id) const {$/;"	f	class:ps::Postoffice
+GetReflection	deps/include/google/protobuf/message.h	/^  virtual const Reflection* GetReflection() const {$/;"	f	class:google::protobuf::Message
+GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<Message>& Reflection::GetRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
+GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<PB>& Reflection::GetRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
+GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<string>& Reflection::GetRepeatedPtrField<string>($/;"	f	class:google::protobuf::Reflection
+GetServerKeyRanges	src/postoffice.cc	/^const std::vector<Range>& Postoffice::GetServerKeyRanges() {$/;"	f	class:ps::Postoffice
+GetSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  const string& GetSyntaxIdentifier() { return syntax_identifier_; }$/;"	f	class:google::protobuf::compiler::Parser
+GetTagFieldNumber	deps/include/google/protobuf/wire_format_lite.h	/^inline int WireFormatLite::GetTagFieldNumber(uint32 tag) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+GetTagWireType	deps/include/google/protobuf/wire_format_lite.h	/^inline WireFormatLite::WireType WireFormatLite::GetTagWireType(uint32 tag) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+GetTimestamp	include/ps/internal/van.h	/^  int GetTimestamp() { return timestamp_++; }$/;"	f	class:ps::Van
+GetTypeName	src/meta.pb.cc	/^::std::string PBControl::GetTypeName() const {$/;"	f	class:ps::PBControl
+GetTypeName	src/meta.pb.cc	/^::std::string PBMeta::GetTypeName() const {$/;"	f	class:ps::PBMeta
+GetTypeName	src/meta.pb.cc	/^::std::string PBNode::GetTypeName() const {$/;"	f	class:ps::PBNode
+GetValidationErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  DescriptorPool::ErrorCollector* GetValidationErrorCollector() {$/;"	f	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+GoogleOnceInit	deps/include/google/protobuf/stubs/once.h	/^inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {$/;"	f	namespace:google::protobuf
+GoogleOnceInit	deps/include/google/protobuf/stubs/once.h	/^inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg),$/;"	f	namespace:google::protobuf
+GroupSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::GroupSize(const MessageLite& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+GroupSizeNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::GroupSizeNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+GzipInputStream	deps/include/google/protobuf/io/gzip_stream.h	/^class LIBPROTOBUF_EXPORT GzipInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+GzipOutputStream	deps/include/google/protobuf/io/gzip_stream.h	/^class LIBPROTOBUF_EXPORT GzipOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+HEARTBEAT	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+HadError	deps/include/google/protobuf/io/coded_stream.h	/^  bool HadError() const { return had_error_; }$/;"	f	class:google::protobuf::io::CodedOutputStream
+Heartbeat	src/van.cc	/^void Van::Heartbeat() {$/;"	f	class:ps::Van
+I18NSPHINXOPTS	docs/Makefile	/^I18NSPHINXOPTS  = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .$/;"	m
+IDtoRank	include/ps/internal/postoffice.h	/^  static inline int IDtoRank(int id) {$/;"	f	class:ps::Postoffice
+INCPATH	Makefile	/^INCPATH = -I.\/src -I.\/include -I$(DEPS_PATH)\/include$/;"	m
+INL	deps/include/google/protobuf/wire_format_lite.h	/^                                                    CType* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^                                           RepeatedField<CType>* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^                                         RepeatedField<CType>* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^      field_number, const MessageLite& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, const MessageType& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, const string& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline bool ReadPrimitive(input, CType* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteBoolNoTagToArray    (bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteDoubleNoTagToArray  (double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteEnumNoTagToArray    (int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFixed32NoTagToArray (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFixed64NoTagToArray (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFloatNoTagToArray   (float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteInt32NoTagToArray   (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteInt64NoTagToArray   (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSFixed32NoTagToArray(int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSFixed64NoTagToArray(int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSInt32NoTagToArray  (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSInt64NoTagToArray  (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteTagToArray(field_number, WireType type, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteUInt32NoTagToArray  (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteUInt64NoTagToArray  (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteBoolNoTag    (bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteDoubleNoTag  (double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteEnumNoTag    (int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFixed32NoTag (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFixed64NoTag (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFloatNoTag   (float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteInt32NoTag   (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteInt64NoTag   (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSFixed32NoTag(int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSFixed64NoTag(int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSInt32NoTag  (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSInt64NoTag  (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteTag(field_number, WireType type, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteUInt32NoTag  (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteUInt64NoTag  (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
+INL	deps/include/google/protobuf/wire_format_lite.h	/^#define INL /;"	d
+INL	deps/include/google/protobuf/wire_format_lite.h	/^#undef INL$/;"	d
+INPUT_TYPE	deps/include/google/protobuf/descriptor.h	/^      INPUT_TYPE,        \/\/ method input type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+INT16	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
+INT32	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
+INT64	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
+INT8	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
+INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION	src/meta.pb.cc	/^#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION$/;"	d	file:
+Importer	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT Importer {$/;"	c	namespace:google::protobuf::compiler
+IncrementRecursionDepth	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::IncrementRecursionDepth() {$/;"	f	class:google::protobuf::io::CodedInputStream
+Init	include/ps/internal/env.h	/^  static inline Environment* Init(const std::unordered_map<std::string, std::string>& envs) {$/;"	f	class:ps::Environment
+InitAsDefaultInstance	src/meta.pb.cc	/^void PBControl::InitAsDefaultInstance() {$/;"	f	class:ps::PBControl
+InitAsDefaultInstance	src/meta.pb.cc	/^void PBMeta::InitAsDefaultInstance() {$/;"	f	class:ps::PBMeta
+InitAsDefaultInstance	src/meta.pb.cc	/^void PBNode::InitAsDefaultInstance() {$/;"	f	class:ps::PBNode
+InitLogging	include/dmlc/logging.h	/^inline void InitLogging(const char* argv0) {$/;"	f	namespace:dmlc
+Int32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::Int32Size(int32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+Int64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::Int64Size(int64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+IsFlat	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::IsFlat() const {$/;"	f	class:google::protobuf::io::CodedInputStream
+IsInitialized	src/meta.pb.cc	/^bool PBControl::IsInitialized() const {$/;"	f	class:ps::PBControl
+IsInitialized	src/meta.pb.cc	/^bool PBMeta::IsInitialized() const {$/;"	f	class:ps::PBMeta
+IsInitialized	src/meta.pb.cc	/^bool PBNode::IsInitialized() const {$/;"	f	class:ps::PBNode
+IsReady	include/ps/internal/van.h	/^  bool IsReady() { return ready_; }$/;"	f	class:ps::Van
+IsScheduler	include/ps/ps.h	/^inline bool IsScheduler() { return Postoffice::Get()->is_scheduler(); }$/;"	f	namespace:ps
+IsServer	include/ps/ps.h	/^inline bool IsServer() { return Postoffice::Get()->is_server(); }$/;"	f	namespace:ps
+IsTypePackable	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::IsTypePackable(Type field_type) {$/;"	f	class:google::protobuf::FieldDescriptor
+IsWorker	include/ps/ps.h	/^inline bool IsWorker() { return Postoffice::Get()->is_worker(); }$/;"	f	namespace:ps
+IstreamInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT IstreamInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+JavaGenerator	deps/include/google/protobuf/compiler/java/java_generator.h	/^class LIBPROTOC_EXPORT JavaGenerator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::java
+KVMeta	include/ps/kv_app.h	/^struct KVMeta {$/;"	s	namespace:ps
+KVPairs	include/ps/kv_app.h	/^struct KVPairs {$/;"	s	namespace:ps
+KVServer	include/ps/kv_app.h	/^  explicit KVServer(int app_id) : SimpleApp() {$/;"	f	class:ps::KVServer
+KVServer	include/ps/kv_app.h	/^class KVServer : public SimpleApp {$/;"	c	namespace:ps
+KVServerDefaultHandle	include/ps/kv_app.h	/^struct KVServerDefaultHandle {$/;"	s	namespace:ps
+KVWorker	include/ps/kv_app.h	/^  explicit KVWorker(int app_id) : SimpleApp() {$/;"	f	class:ps::KVWorker
+KVWorker	include/ps/kv_app.h	/^class KVWorker : public SimpleApp {$/;"	c	namespace:ps
+LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.h	/^    LABEL_OPTIONAL      = 1,    \/\/ optional$/;"	e	enum:google::protobuf::FieldDescriptor::Label
+LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_OPTIONAL = FieldDescriptorProto_Label_LABEL_OPTIONAL;$/;"	m	class:google::protobuf::FieldDescriptorProto
+LABEL_REPEATED	deps/include/google/protobuf/descriptor.h	/^    LABEL_REPEATED      = 3,    \/\/ repeated$/;"	e	enum:google::protobuf::FieldDescriptor::Label
+LABEL_REPEATED	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_REPEATED = FieldDescriptorProto_Label_LABEL_REPEATED;$/;"	m	class:google::protobuf::FieldDescriptorProto
+LABEL_REQUIRED	deps/include/google/protobuf/descriptor.h	/^    LABEL_REQUIRED      = 2,    \/\/ required$/;"	e	enum:google::protobuf::FieldDescriptor::Label
+LABEL_REQUIRED	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_REQUIRED = FieldDescriptorProto_Label_LABEL_REQUIRED;$/;"	m	class:google::protobuf::FieldDescriptorProto
+LDFLAGS	tests/test.mk	/^LDFLAGS = -Wl,-rpath,$(DEPS_PATH)\/lib $(PS_LDFLAGS_SO) -pthread$/;"	m
+LIBPROTOBUF_EXPORT	deps/include/google/protobuf/stubs/common.h	/^    #define LIBPROTOBUF_EXPORT /;"	d
+LIBPROTOC_EXPORT	deps/include/google/protobuf/stubs/common.h	/^    #define LIBPROTOC_EXPORT /;"	d
+LINE_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    LINE_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
+LITE_RUNTIME	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode LITE_RUNTIME = FileOptions_OptimizeMode_LITE_RUNTIME;$/;"	m	class:google::protobuf::FileOptions
+LL	include/ps/internal/utils.h	/^#define LL /;"	d
+LOGLEVEL_DFATAL	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_DFATAL = LOGLEVEL_ERROR$/;"	e	enum:google::protobuf::LogLevel
+LOGLEVEL_ERROR	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_ERROR,    \/\/ An error occurred which should never happen during$/;"	e	enum:google::protobuf::LogLevel
+LOGLEVEL_FATAL	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_FATAL,    \/\/ An error occurred from which the library cannot$/;"	e	enum:google::protobuf::LogLevel
+LOGLEVEL_INFO	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_INFO,     \/\/ Informational.  This is never actually used by$/;"	e	enum:google::protobuf::LogLevel
+LOGLEVEL_WARNING	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_WARNING,  \/\/ Warns about issues that, although not technically a$/;"	e	enum:google::protobuf::LogLevel
+LZ4	make/deps.mk	/^LZ4 = ${DEPS_PATH}\/include\/lz4.h$/;"	m
+Label	deps/include/google/protobuf/descriptor.h	/^  enum Label {$/;"	g	class:google::protobuf::FieldDescriptor
+Label	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldDescriptorProto_Label Label;$/;"	t	class:google::protobuf::FieldDescriptorProto
+Label_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int Label_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Label_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Label_IsValid(int value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+Label_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label Label_MAX =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Label_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label Label_MIN =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Label_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& Label_Name(Label value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+Label_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Label_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldDescriptorProto
+Label_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  Label_descriptor() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+LastTagWas	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::LastTagWas(uint32 expected) {$/;"	f	class:google::protobuf::io::CodedInputStream
+LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^    LazyMessageExtension() {}$/;"	f	class:google::protobuf::internal::ExtensionSet::LazyMessageExtension
+LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^  class LIBPROTOBUF_EXPORT LazyMessageExtension {$/;"	c	class:google::protobuf::internal::ExtensionSet
+LengthDelimitedSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::LengthDelimitedSize(int length) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+Limit	deps/include/google/protobuf/io/coded_stream.h	/^  typedef int Limit;$/;"	t	class:google::protobuf::io::CodedInputStream
+LimitingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT LimitingInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+LintHelper	tests/lint.py	/^class LintHelper(object):$/;"	c
+LinuxKernelCmpxchgFunc	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^typedef Atomic32 (*LinuxKernelCmpxchgFunc)(Atomic32 old_value,$/;"	t	namespace:google::protobuf::internal
+LinuxKernelMemoryBarrierFunc	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^typedef void (*LinuxKernelMemoryBarrierFunc)(void);$/;"	t	namespace:google::protobuf::internal
+LocalLauncher	tracker/dmlc_local.py	/^class LocalLauncher(object):$/;"	c
+Location	deps/include/google/protobuf/descriptor.pb.h	/^  typedef SourceCodeInfo_Location Location;$/;"	t	class:google::protobuf::SourceCodeInfo
+LocationMap	deps/include/google/protobuf/compiler/parser.h	/^    pair<int, int> > LocationMap;$/;"	t	class:google::protobuf::compiler::SourceLocationTable
+LocationMap	deps/include/google/protobuf/text_format.h	/^    typedef map<const FieldDescriptor*, vector<ParseLocation> > LocationMap;$/;"	t	class:google::protobuf::TextFormat::ParseInfoTree
+LocationRecorder	deps/include/google/protobuf/compiler/parser.h	/^  class LIBPROTOBUF_EXPORT LocationRecorder {$/;"	c	class:google::protobuf::compiler::Parser
+LogFinisher	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogFinisher {$/;"	c	namespace:google::protobuf::internal
+LogHandler	deps/include/google/protobuf/stubs/common.h	/^typedef void LogHandler(LogLevel level, const char* filename, int line,$/;"	t	namespace:google::protobuf
+LogLevel	deps/include/google/protobuf/stubs/common.h	/^enum LogLevel {$/;"	g	namespace:google::protobuf
+LogMessage	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogMessage {$/;"	c	namespace:google::protobuf::internal
+LogSilencer	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogSilencer {$/;"	c	namespace:google::protobuf
+MAX_CPPTYPE	deps/include/google/protobuf/descriptor.h	/^    MAX_CPPTYPE         = 10,    \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
+MAX_CPPTYPE	deps/include/google/protobuf/wire_format_lite.h	/^    MAX_CPPTYPE         = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
+MAX_FIELD_TYPE	deps/include/google/protobuf/wire_format_lite.h	/^    MAX_FIELD_TYPE      = 18,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+MAX_LABEL	deps/include/google/protobuf/descriptor.h	/^    MAX_LABEL           = 3,    \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::Label
+MAX_TYPE	deps/include/google/protobuf/descriptor.h	/^    MAX_TYPE            = 18,  \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+MINUS	include/ps/internal/assign_op.h	/^  MINUS,   \/\/ a -= b$/;"	e	enum:ps::AssignOp
+MODE_COMPILE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_COMPILE,  \/\/ Normal mode:  parse .proto files and compile them.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
+MODE_DECODE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_DECODE    \/\/ --decode:  read binary from stdin, write text to stdout.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
+MODE_ENCODE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_ENCODE,   \/\/ --encode:  read text from stdin, write binary to stdout.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
+MakeTag	deps/include/google/protobuf/wire_format.h	/^inline uint32 WireFormat::MakeTag(const FieldDescriptor* field) {$/;"	f	class:google::protobuf::internal::WireFormat
+MakeTag	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::MakeTag(int field_number, WireType type) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+Manage	src/postoffice.cc	/^void Postoffice::Manage(const Message& recv) {$/;"	f	class:ps::Postoffice
+Mapping	deps/include/google/protobuf/compiler/importer.h	/^    inline Mapping(const string& virtual_path_param,$/;"	f	struct:google::protobuf::compiler::DiskSourceTree::Mapping
+Mapping	deps/include/google/protobuf/compiler/importer.h	/^  struct Mapping {$/;"	s	class:google::protobuf::compiler::DiskSourceTree
+MarkdownParser	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
+MarkdownParser	docs/sphinx_util.py	/^MarkdownParser = parser.CommonMarkParser$/;"	v
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
+Merge	deps/include/google/protobuf/repeated_field.h	/^  static void Merge(const GenericType& from, GenericType* to) {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+Merge	deps/include/google/protobuf/repeated_field.h	/^  static void Merge(const string& from, string* to) { *to = from; }$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
+Merge	deps/include/google/protobuf/repeated_field.h	/^inline void GenericTypeHandler<MessageLite>::Merge($/;"	f	class:google::protobuf::internal::GenericTypeHandler
+MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::MergeFrom(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
+MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::MergeFrom($/;"	f	class:google::protobuf::RepeatedPtrField
+MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::MergeFrom(const RepeatedPtrFieldBase& other) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+MergeFrom	src/meta.pb.cc	/^void PBControl::MergeFrom(const PBControl& from) {$/;"	f	class:ps::PBControl
+MergeFrom	src/meta.pb.cc	/^void PBMeta::MergeFrom(const PBMeta& from) {$/;"	f	class:ps::PBMeta
+MergeFrom	src/meta.pb.cc	/^void PBNode::MergeFrom(const PBNode& from) {$/;"	f	class:ps::PBNode
+MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBControl::MergePartialFromCodedStream($/;"	f	class:ps::PBControl
+MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBMeta::MergePartialFromCodedStream($/;"	f	class:ps::PBMeta
+MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBNode::MergePartialFromCodedStream($/;"	f	class:ps::PBNode
+MergedDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT MergedDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
+Message	deps/include/google/protobuf/message.h	/^  inline Message() {}$/;"	f	class:google::protobuf::Message
+Message	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT Message : public MessageLite {$/;"	c	namespace:google::protobuf
+Message	include/ps/internal/message.h	/^struct Message {$/;"	s	namespace:ps
+MessageFactory	deps/include/google/protobuf/message.h	/^  inline MessageFactory() {}$/;"	f	class:google::protobuf::MessageFactory
+MessageFactory	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT MessageFactory {$/;"	c	namespace:google::protobuf
+MessageLite	deps/include/google/protobuf/message_lite.h	/^  inline MessageLite() {}$/;"	f	class:google::protobuf::MessageLite
+MessageLite	deps/include/google/protobuf/message_lite.h	/^class LIBPROTOBUF_EXPORT MessageLite {$/;"	c	namespace:google::protobuf
+MessageOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MessageOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+MessageSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::MessageSize(const MessageLite& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+MessageSizeNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::MessageSizeNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+MessageTypeTraits	deps/include/google/protobuf/extension_set.h	/^class MessageTypeTraits {$/;"	c	namespace:google::protobuf::internal
+Meta	include/ps/internal/message.h	/^  Meta() : head(kEmpty), customer_id(kEmpty), timestamp(kEmpty),$/;"	f	struct:ps::Meta
+Meta	include/ps/internal/message.h	/^struct Meta {$/;"	s	namespace:ps
+Metadata	deps/include/google/protobuf/message.h	/^struct Metadata {$/;"	s	namespace:google::protobuf
+MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure0(Class* object, MethodType method, bool self_deleting)$/;"	f	class:google::protobuf::internal::MethodClosure0
+MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure0 : public Closure {$/;"	c	namespace:google::protobuf::internal
+MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure1(Class* object, MethodType method, bool self_deleting,$/;"	f	class:google::protobuf::internal::MethodClosure1
+MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure1 : public Closure {$/;"	c	namespace:google::protobuf::internal
+MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure2(Class* object, MethodType method, bool self_deleting,$/;"	f	class:google::protobuf::internal::MethodClosure2
+MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure2 : public Closure {$/;"	c	namespace:google::protobuf::internal
+MethodDescriptor	deps/include/google/protobuf/descriptor.h	/^  MethodDescriptor() {}$/;"	f	class:google::protobuf::MethodDescriptor
+MethodDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT MethodDescriptor {$/;"	c	namespace:google::protobuf
+MethodDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MethodDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+MethodOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MethodOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)();$/;"	t	class:google::protobuf::internal::MethodClosure0
+MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)(Arg1 arg1);$/;"	t	class:google::protobuf::internal::MethodClosure1
+MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)(Arg1 arg1, Arg2 arg2);$/;"	t	class:google::protobuf::internal::MethodClosure2
+Mode	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum Mode {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
+Monitoring	src/resender.h	/^  void Monitoring() {$/;"	f	class:ps::Resender
+MoveArray	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::MoveArray($/;"	f	class:google::protobuf::RepeatedField
+MultiFileErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  inline MultiFileErrorCollector() {}$/;"	f	class:google::protobuf::compiler::MultiFileErrorCollector
+MultiFileErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT MultiFileErrorCollector {$/;"	c	namespace:google::protobuf::compiler
+Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Mutable(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
+Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Mutable(int number, int index, ExtensionSet* set) {$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
+Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline string* Mutable(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::StringTypeTraits
+Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline string* Mutable(int number, int index, ExtensionSet* set) {$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
+Mutable	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::Mutable(int index) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Mutable	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::Mutable(int index) {$/;"	f	class:google::protobuf::RepeatedField
+Mutable	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::Mutable(int index) {$/;"	f	class:google::protobuf::RepeatedPtrField
+MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<Message>* Reflection::MutableRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
+MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<PB>* Reflection::MutableRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
+MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<string>* Reflection::MutableRepeatedPtrField<string>($/;"	f	class:google::protobuf::Reflection
+MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef Type* MutableType;$/;"	t	class:google::protobuf::internal::MessageTypeTraits
+MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef Type* MutableType;$/;"	t	class:google::protobuf::internal::RepeatedMessageTypeTraits
+MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef string* MutableType;$/;"	t	class:google::protobuf::internal::RepeatedStringTypeTraits
+MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef string* MutableType;$/;"	t	class:google::protobuf::internal::StringTypeTraits
+Mutex	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT Mutex {$/;"	c	namespace:google::protobuf::internal
+MutexLock	deps/include/google/protobuf/stubs/common.h	/^  explicit MutexLock(Mutex *mu) : mu_(mu) { this->mu_->Lock(); }$/;"	f	class:google::protobuf::internal::MutexLock
+MutexLock	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT MutexLock {$/;"	c	namespace:google::protobuf::internal
+MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^  explicit MutexLockMaybe(Mutex *mu) :$/;"	f	class:google::protobuf::internal::MutexLockMaybe
+MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT MutexLockMaybe {$/;"	c	namespace:google::protobuf::internal
+MyRank	include/ps/ps.h	/^inline int MyRank() { return Postoffice::Get()->my_rank(); }$/;"	f	namespace:ps
+NAME	deps/include/google/protobuf/descriptor.h	/^      NAME,              \/\/ the symbol name, or the package name for files$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+NO_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    NO_COMMENT$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
+NO_MAPPING	deps/include/google/protobuf/compiler/importer.h	/^    NO_MAPPING$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
+NUMBER	deps/include/google/protobuf/descriptor.h	/^      NUMBER,            \/\/ field or extension range number$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+NamePart	deps/include/google/protobuf/descriptor.pb.h	/^  typedef UninterpretedOption_NamePart NamePart;$/;"	t	class:google::protobuf::UninterpretedOption
+NestedMap	deps/include/google/protobuf/text_format.h	/^    typedef map<const FieldDescriptor*, vector<ParseInfoTree*> > NestedMap;$/;"	t	class:google::protobuf::TextFormat::ParseInfoTree
+New	deps/include/google/protobuf/repeated_field.h	/^  static GenericType* New() { return new GenericType; }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+New	src/meta.pb.cc	/^PBControl* PBControl::New() const {$/;"	f	class:ps::PBControl
+New	src/meta.pb.cc	/^PBMeta* PBMeta::New() const {$/;"	f	class:ps::PBMeta
+New	src/meta.pb.cc	/^PBNode* PBNode::New() const {$/;"	f	class:ps::PBNode
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)()) {$/;"	f	namespace:google::protobuf
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1),$/;"	f	namespace:google::protobuf
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)()) {$/;"	f	namespace:google::protobuf
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)(Arg1),$/;"	f	namespace:google::protobuf
+NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback($/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(Class* object, void (Class::*method)()) {$/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(Class* object, void (Class::*method)(Arg1),$/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)()) {$/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)(Arg1),$/;"	f	namespace:google::protobuf
+NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
+NewRequest	src/customer.cc	/^int Customer::NewRequest(int recver) {$/;"	f	class:ps::Customer
+NextCommentStatus	deps/include/google/protobuf/io/tokenizer.h	/^  enum NextCommentStatus {$/;"	g	class:google::protobuf::io::Tokenizer
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_Load(volatile const AtomicWord *ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void NoBarrier_Store(volatile AtomicWord *ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Node	include/ps/internal/message.h	/^  Node() : id(kEmpty), port(kEmpty), is_recovery(false) {}$/;"	f	struct:ps::Node
+Node	include/ps/internal/message.h	/^struct Node {$/;"	s	namespace:ps
+Now	src/resender.h	/^  Time Now() {$/;"	f	class:ps::Resender
+NumResponse	src/customer.cc	/^int Customer::NumResponse(int timestamp) {$/;"	f	class:ps::Customer
+NumServers	include/ps/ps.h	/^inline int NumServers() { return Postoffice::Get()->num_servers(); }$/;"	f	namespace:ps
+NumWorkers	include/ps/ps.h	/^inline int NumWorkers() { return Postoffice::Get()->num_workers(); }$/;"	f	namespace:ps
+OBJS	Makefile	/^OBJS = $(addprefix build\/, customer.o postoffice.o van.o meta.pb.o)$/;"	m
+OPTION_ASSIGNMENT	deps/include/google/protobuf/compiler/parser.h	/^    OPTION_ASSIGNMENT,  \/\/ just "name = value"$/;"	e	enum:google::protobuf::compiler::Parser::OptionStyle
+OPTION_NAME	deps/include/google/protobuf/descriptor.h	/^      OPTION_NAME,       \/\/ name in assignment$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+OPTION_STATEMENT	deps/include/google/protobuf/compiler/parser.h	/^    OPTION_STATEMENT    \/\/ "option name = value;"$/;"	e	enum:google::protobuf::compiler::Parser::OptionStyle
+OPTION_VALUE	deps/include/google/protobuf/descriptor.h	/^      OPTION_VALUE,      \/\/ value in option assignment$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+OR	include/ps/internal/assign_op.h	/^  OR,      \/\/ a |= b$/;"	e	enum:ps::AssignOp
+OTHER	deps/include/google/protobuf/descriptor.h	/^      OTHER              \/\/ some other problem$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+OTHER	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
+OUTPUT_TYPE	deps/include/google/protobuf/descriptor.h	/^      OUTPUT_TYPE,       \/\/ method output type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+Operation	deps/include/google/protobuf/wire_format.h	/^  enum Operation {$/;"	g	class:google::protobuf::internal::WireFormat
+OptimizeMode	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FileOptions_OptimizeMode OptimizeMode;$/;"	t	class:google::protobuf::FileOptions
+OptimizeMode_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int OptimizeMode_ARRAYSIZE =$/;"	m	class:google::protobuf::FileOptions
+OptimizeMode_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool OptimizeMode_IsValid(int value) {$/;"	f	class:google::protobuf::FileOptions
+OptimizeMode_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode OptimizeMode_MAX =$/;"	m	class:google::protobuf::FileOptions
+OptimizeMode_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode OptimizeMode_MIN =$/;"	m	class:google::protobuf::FileOptions
+OptimizeMode_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& OptimizeMode_Name(OptimizeMode value) {$/;"	f	class:google::protobuf::FileOptions
+OptimizeMode_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool OptimizeMode_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FileOptions
+OptimizeMode_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  OptimizeMode_descriptor() {$/;"	f	class:google::protobuf::FileOptions
+OptionStyle	deps/include/google/protobuf/compiler/parser.h	/^  enum OptionStyle {$/;"	g	class:google::protobuf::compiler::Parser
+Options	deps/include/google/protobuf/io/gzip_stream.h	/^  struct LIBPROTOBUF_EXPORT Options {$/;"	s	class:google::protobuf::io::GzipOutputStream
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef EnumOptions OptionsType;$/;"	t	class:google::protobuf::EnumDescriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef EnumValueOptions OptionsType;$/;"	t	class:google::protobuf::EnumValueDescriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef FieldOptions OptionsType;$/;"	t	class:google::protobuf::FieldDescriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef FileOptions OptionsType;$/;"	t	class:google::protobuf::FileDescriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef MessageOptions OptionsType;$/;"	t	class:google::protobuf::Descriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef MethodOptions OptionsType;$/;"	t	class:google::protobuf::MethodDescriptor
+OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef ServiceOptions OptionsType;$/;"	t	class:google::protobuf::ServiceDescriptor
+OstreamOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT OstreamOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+OutputDirective	deps/include/google/protobuf/compiler/command_line_interface.h	/^  struct OutputDirective {$/;"	s	class:google::protobuf::compiler::CommandLineInterface
+OutputDirectory	deps/include/google/protobuf/compiler/code_generator.h	/^typedef GeneratorContext OutputDirectory;$/;"	t	namespace:google::protobuf::compiler
+PAPER	docs/Makefile	/^PAPER         =$/;"	m
+PAPEROPT_a4	docs/Makefile	/^PAPEROPT_a4     = -D latex_paper_size=a4$/;"	m
+PAPEROPT_letter	docs/Makefile	/^PAPEROPT_letter = -D latex_paper_size=letter$/;"	m
+PARSE	deps/include/google/protobuf/wire_format.h	/^    PARSE,$/;"	e	enum:google::protobuf::internal::WireFormat::Operation
+PARSE_ARGUMENT_DONE_AND_CONTINUE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_DONE_AND_CONTINUE,$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
+PARSE_ARGUMENT_DONE_AND_EXIT	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_DONE_AND_EXIT,$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
+PARSE_ARGUMENT_FAIL	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_FAIL$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
+PBControl	src/meta.pb.cc	/^PBControl::PBControl()$/;"	f	class:ps::PBControl
+PBControl	src/meta.pb.cc	/^PBControl::PBControl(const PBControl& from)$/;"	f	class:ps::PBControl
+PBMeta	src/meta.pb.cc	/^PBMeta::PBMeta()$/;"	f	class:ps::PBMeta
+PBMeta	src/meta.pb.cc	/^PBMeta::PBMeta(const PBMeta& from)$/;"	f	class:ps::PBMeta
+PBNode	src/meta.pb.cc	/^PBNode::PBNode()$/;"	f	class:ps::PBNode
+PBNode	src/meta.pb.cc	/^PBNode::PBNode(const PBNode& from)$/;"	f	class:ps::PBNode
+PLUS	include/ps/internal/assign_op.h	/^  PLUS,    \/\/ a += b$/;"	e	enum:ps::AssignOp
+PROTOBUF	make/deps.mk	/^PROTOBUF = ${DEPS_PATH}\/include\/google\/protobuf\/message.h$/;"	m
+PROTOBUF_DEFINE_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_ACCESSOR(/;"	d
+PROTOBUF_DEFINE_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_ACCESSOR$/;"	d
+PROTOBUF_DEFINE_ARRAY_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_ARRAY_ACCESSOR(/;"	d
+PROTOBUF_DEFINE_ARRAY_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_ARRAY_ACCESSOR$/;"	d
+PROTOBUF_DEFINE_OPTIONS_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_OPTIONS_ACCESSOR(/;"	d
+PROTOBUF_DEFINE_PRIMITIVE_TYPE	deps/include/google/protobuf/extension_set.h	/^#define PROTOBUF_DEFINE_PRIMITIVE_TYPE(/;"	d
+PROTOBUF_DEFINE_PRIMITIVE_TYPE	deps/include/google/protobuf/extension_set.h	/^#undef PROTOBUF_DEFINE_PRIMITIVE_TYPE$/;"	d
+PROTOBUF_DEFINE_STRING_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_STRING_ACCESSOR(/;"	d
+PROTOBUF_DEFINE_STRING_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_STRING_ACCESSOR$/;"	d
+PROTOBUF_DEPRECATED	deps/include/google/protobuf/generated_message_util.h	/^#define PROTOBUF_DEPRECATED$/;"	d
+PROTOBUF_LITTLE_ENDIAN	deps/include/google/protobuf/io/coded_stream.h	/^    #define PROTOBUF_LITTLE_ENDIAN /;"	d
+PROTOBUF_USE_EXCEPTIONS	deps/include/google/protobuf/stubs/common.h	/^  #define PROTOBUF_USE_EXCEPTIONS /;"	d
+PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED	deps/include/google/protobuf/compiler/plugin.pb.h	/^#define PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED$/;"	d
+PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED	deps/include/google/protobuf/descriptor.pb.h	/^#define PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED$/;"	d
+PROTOC	Makefile	/^PROTOC = ${DEPS_PATH}\/bin\/protoc$/;"	m
+PSTracker	tracker/tracker.py	/^class PSTracker:$/;"	c
+PS_BASE_H_	include/ps/base.h	/^#define PS_BASE_H_$/;"	d
+PS_INTERNAL_ASSIGN_OP_H_	include/ps/internal/assign_op.h	/^#define PS_INTERNAL_ASSIGN_OP_H_$/;"	d
+PS_INTERNAL_CUSTOMER_H_	include/ps/internal/customer.h	/^#define PS_INTERNAL_CUSTOMER_H_$/;"	d
+PS_INTERNAL_ENV_H_	include/ps/internal/env.h	/^#define PS_INTERNAL_ENV_H_$/;"	d
+PS_INTERNAL_MESSAGE_H_	include/ps/internal/message.h	/^#define PS_INTERNAL_MESSAGE_H_$/;"	d
+PS_INTERNAL_PARALLEL_KV_MATCH_H_	include/ps/internal/parallel_kv_match.h	/^#define PS_INTERNAL_PARALLEL_KV_MATCH_H_$/;"	d
+PS_INTERNAL_PARALLEL_SORT_H_	include/ps/internal/parallel_sort.h	/^#define PS_INTERNAL_PARALLEL_SORT_H_$/;"	d
+PS_INTERNAL_POSTOFFICE_H_	include/ps/internal/postoffice.h	/^#define PS_INTERNAL_POSTOFFICE_H_$/;"	d
+PS_INTERNAL_THREADSAFE_QUEUE_H_	include/ps/internal/threadsafe_queue.h	/^#define PS_INTERNAL_THREADSAFE_QUEUE_H_$/;"	d
+PS_INTERNAL_UTILS_H_	include/ps/internal/utils.h	/^#define PS_INTERNAL_UTILS_H_$/;"	d
+PS_INTERNAL_VAN_H_	include/ps/internal/van.h	/^#define PS_INTERNAL_VAN_H_$/;"	d
+PS_KV_APP_H_	include/ps/kv_app.h	/^#define PS_KV_APP_H_$/;"	d
+PS_LDFLAGS_A	make/ps.mk	/^PS_LDFLAGS_A = $(addprefix $(DEPS_PATH)\/lib\/, libprotobuf-lite.a libzmq.a)$/;"	m
+PS_LDFLAGS_SO	make/ps.mk	/^PS_LDFLAGS_SO = -L$(DEPS_PATH)\/lib -lprotobuf-lite -lzmq$/;"	m
+PS_NETWORK_UTILS_H_	src/network_utils.h	/^#define PS_NETWORK_UTILS_H_$/;"	d
+PS_PS_H_	include/ps/ps.h	/^#define PS_PS_H_$/;"	d
+PS_RANGE_H_	include/ps/range.h	/^#define PS_RANGE_H_$/;"	d
+PS_RESENDER_H_	src/resender.h	/^#define PS_RESENDER_H_$/;"	d
+PS_SARRAY_H_	include/ps/sarray.h	/^#define PS_SARRAY_H_$/;"	d
+PS_SIMPLE_APP_H_	include/ps/simple_app.h	/^#define PS_SIMPLE_APP_H_$/;"	d
+PS_VLOG	include/ps/internal/postoffice.h	/^#define PS_VLOG(/;"	d
+PS_WINDOWS_UNISTD_H_	src/windows/unistd.h	/^#define PS_WINDOWS_UNISTD_H_$/;"	d
+PS_ZMQ_VAN_H_	src/zmq_van.h	/^#define PS_ZMQ_VAN_H_$/;"	d
+PYTHON_SUFFIX	tests/lint.py	/^PYTHON_SUFFIX = set(['py'])$/;"	v
+PackMeta	src/van.cc	/^void Van::PackMeta(const Meta& meta, char** meta_buf, int* buf_size) {$/;"	f	class:ps::Van
+ParallelOrderedMatch	include/ps/internal/parallel_kv_match.h	/^size_t ParallelOrderedMatch($/;"	f	namespace:ps
+ParallelOrderedMatch	include/ps/internal/parallel_kv_match.h	/^void ParallelOrderedMatch($/;"	f	namespace:ps::__anon6
+ParallelSort	include/ps/internal/parallel_sort.h	/^void ParallelSort(SArray<T>* arr,$/;"	f	namespace:ps
+ParallelSort	include/ps/internal/parallel_sort.h	/^void ParallelSort(T* data, size_t len, size_t grainsize, const Fn& cmp) {$/;"	f	namespace:ps::__anon7
+ParseArgumentStatus	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum ParseArgumentStatus {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
+ParseFromString	deps/include/google/protobuf/unknown_field_set.h	/^  inline bool ParseFromString(const string& data) {$/;"	f	class:google::protobuf::UnknownFieldSet
+ParseInfoTree	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT ParseInfoTree {$/;"	c	class:google::protobuf::TextFormat
+ParseLocation	deps/include/google/protobuf/text_format.h	/^    ParseLocation() : line(-1), column(-1) {}$/;"	f	struct:google::protobuf::TextFormat::ParseLocation
+ParseLocation	deps/include/google/protobuf/text_format.h	/^    ParseLocation(int line_param, int column_param)$/;"	f	struct:google::protobuf::TextFormat::ParseLocation
+ParseLocation	deps/include/google/protobuf/text_format.h	/^  struct ParseLocation {$/;"	s	class:google::protobuf::TextFormat
+ParseNamedEnum	deps/include/google/protobuf/generated_enum_reflection.h	/^bool ParseNamedEnum(const EnumDescriptor* descriptor,$/;"	f	namespace:google::protobuf::internal
+ParseString	deps/include/google/protobuf/io/tokenizer.h	/^inline void Tokenizer::ParseString(const string& text, string* output) {$/;"	f	class:google::protobuf::io::Tokenizer
+Parser	deps/include/google/protobuf/compiler/parser.h	/^class LIBPROTOBUF_EXPORT Parser {$/;"	c	namespace:google::protobuf::compiler
+Parser	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Parser {$/;"	c	class:google::protobuf::TextFormat
+Postoffice	include/ps/internal/postoffice.h	/^class Postoffice {$/;"	c	namespace:ps
+Postoffice	src/postoffice.cc	/^Postoffice::Postoffice() {$/;"	f	class:ps::Postoffice
+PrimitiveTypeTraits	deps/include/google/protobuf/extension_set.h	/^class PrimitiveTypeTraits {$/;"	c	namespace:google::protobuf::internal
+Printer	deps/include/google/protobuf/io/printer.h	/^class LIBPROTOBUF_EXPORT Printer {$/;"	c	namespace:google::protobuf::io
+Printer	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Printer {$/;"	c	class:google::protobuf::TextFormat
+Process	include/ps/kv_app.h	/^void KVServer<Val>::Process(const Message& msg) {$/;"	f	class:ps::KVServer
+Process	include/ps/kv_app.h	/^void KVWorker<Val>::Process(const Message& msg) {$/;"	f	class:ps::KVWorker
+Process	include/ps/simple_app.h	/^inline void SimpleApp::Process(const Message& msg) {$/;"	f	class:ps::SimpleApp
+ProtobufOnceType	deps/include/google/protobuf/stubs/once.h	/^typedef bool ProtobufOnceType;$/;"	t	namespace:google::protobuf
+Pull	include/ps/kv_app.h	/^  int Pull(const std::vector<Key>& keys,$/;"	f	class:ps::KVWorker
+Pull_	include/ps/kv_app.h	/^int KVWorker<Val>::Pull_($/;"	f	class:ps::KVWorker
+Push	include/ps/internal/threadsafe_queue.h	/^  void Push(T new_value) {$/;"	f	class:ps::ThreadsafeQueue
+Push	include/ps/kv_app.h	/^  int Push(const std::vector<Key>& keys,$/;"	f	class:ps::KVWorker
+QNXCmpxchg	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 QNXCmpxchg(Atomic32 old_value,$/;"	f	namespace:google::protobuf::internal
+READ_REPEATED_FIXED_SIZE_PRIMITIVE	deps/include/google/protobuf/wire_format_lite_inl.h	/^#define READ_REPEATED_FIXED_SIZE_PRIMITIVE(/;"	d
+READ_REPEATED_FIXED_SIZE_PRIMITIVE	deps/include/google/protobuf/wire_format_lite_inl.h	/^#undef READ_REPEATED_FIXED_SIZE_PRIMITIVE$/;"	d
+R_OK	src/windows/unistd.h	/^#define R_OK /;"	d
+RabitTracker	tracker/tracker.py	/^class RabitTracker:$/;"	c
+Range	include/ps/range.h	/^  Range() : Range(0, 0) {}$/;"	f	class:ps::Range
+Range	include/ps/range.h	/^  Range(uint64_t begin, uint64_t end) : begin_(begin), end_(end) { }$/;"	f	class:ps::Range
+Range	include/ps/range.h	/^class Range {$/;"	c	namespace:ps
+ReadGroup	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadGroup(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadGroupNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadGroupNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadLittleEndian32	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadLittleEndian32(uint32* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
+ReadLittleEndian32FromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ReadLittleEndian32FromArray($/;"	f	class:google::protobuf::io::CodedInputStream
+ReadLittleEndian64	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadLittleEndian64(uint64* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
+ReadLittleEndian64FromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ReadLittleEndian64FromArray($/;"	f	class:google::protobuf::io::CodedInputStream
+ReadMessage	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadMessage(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadMessageNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadMessageNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPackedPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPackedPrimitive(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPackedPrimitiveNoInline	deps/include/google/protobuf/wire_format_lite_inl.h	/^bool WireFormatLite::ReadPackedPrimitiveNoInline(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<bool, WireFormatLite::TYPE_BOOL>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<double, WireFormatLite::TYPE_DOUBLE>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<float, WireFormatLite::TYPE_FLOAT>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int, WireFormatLite::TYPE_ENUM>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_INT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SFIXED32>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SINT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_INT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SFIXED64>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SINT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_FIXED32>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_UINT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_FIXED64>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_UINT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadPrimitiveFromArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline const uint8* WireFormatLite::ReadPrimitiveFromArray<$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadRepeatedFixedSizePrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadRepeatedFixedSizePrimitive($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadRepeatedPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadRepeatedPrimitive(int, \/\/ tag_size, unused.$/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadRepeatedPrimitiveNoInline	deps/include/google/protobuf/wire_format_lite_inl.h	/^bool WireFormatLite::ReadRepeatedPrimitiveNoInline($/;"	f	class:google::protobuf::internal::WireFormatLite
+ReadTag	deps/include/google/protobuf/io/coded_stream.h	/^inline uint32 CodedInputStream::ReadTag() {$/;"	f	class:google::protobuf::io::CodedInputStream
+ReadVarint32	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadVarint32(uint32* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
+ReadVarint64	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadVarint64(uint64* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
+ReaderMutexLock	deps/include/google/protobuf/stubs/common.h	/^typedef MutexLock ReaderMutexLock;$/;"	t	namespace:google::protobuf::internal
+Receiving	src/customer.cc	/^void Customer::Receiving() {$/;"	f	class:ps::Customer
+Receiving	src/van.cc	/^void Van::Receiving() {$/;"	f	class:ps::Van
+RecordErrorsTo	deps/include/google/protobuf/compiler/importer.h	/^  void RecordErrorsTo(MultiFileErrorCollector* error_collector) {$/;"	f	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+RecordErrorsTo	deps/include/google/protobuf/compiler/parser.h	/^  void RecordErrorsTo(io::ErrorCollector* error_collector) {$/;"	f	class:google::protobuf::compiler::Parser
+RecordErrorsTo	deps/include/google/protobuf/text_format.h	/^    void RecordErrorsTo(io::ErrorCollector* error_collector) {$/;"	f	class:google::protobuf::TextFormat::Parser
+RecordLocation	deps/include/google/protobuf/text_format.h	/^inline void TextFormat::RecordLocation(ParseInfoTree* info_tree,$/;"	f	class:google::protobuf::TextFormat
+RecordSourceLocationsTo	deps/include/google/protobuf/compiler/parser.h	/^  void RecordSourceLocationsTo(SourceLocationTable* location_table) {$/;"	f	class:google::protobuf::compiler::Parser
+Reflection	deps/include/google/protobuf/message.h	/^  inline Reflection() {}$/;"	f	class:google::protobuf::Reflection
+Reflection	deps/include/google/protobuf/message.h	/^  typedef google::protobuf::Reflection Reflection;$/;"	t	class:google::protobuf::Message
+Reflection	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT Reflection {$/;"	c	namespace:google::protobuf
+ReflectionOps	deps/include/google/protobuf/reflection_ops.h	/^class LIBPROTOBUF_EXPORT ReflectionOps {$/;"	c	namespace:google::protobuf::internal
+RegisterExitCallback	include/ps/internal/postoffice.h	/^  void RegisterExitCallback(const Callback& cb) {$/;"	f	class:ps::Postoffice
+RegisterExitCallback	include/ps/ps.h	/^inline void RegisterExitCallback(const std::function<void()>& cb) {$/;"	f	namespace:ps
+Release	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Release(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
+ReleaseCleared	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::ReleaseCleared() {$/;"	f	class:google::protobuf::RepeatedPtrField
+ReleaseCleared	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseCleared() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+ReleaseLast	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::ReleaseLast() {$/;"	f	class:google::protobuf::RepeatedPtrField
+ReleaseLast	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseLast() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Release_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Release_Load(volatile const AtomicWord* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void Release_Store(volatile AtomicWord* ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
+Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
+RemoveCustomer	src/postoffice.cc	/^void Postoffice::RemoveCustomer(Customer* customer) {$/;"	f	class:ps::Postoffice
+RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::RemoveLast() {$/;"	f	class:google::protobuf::RepeatedField
+RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::RemoveLast() {$/;"	f	class:google::protobuf::RepeatedPtrField
+RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::RemoveLast() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+RepeatedEnumTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedEnumTypeTraits {$/;"	c	namespace:google::protobuf::internal
+RepeatedField	deps/include/google/protobuf/repeated_field.h	/^class RepeatedField {$/;"	c	namespace:google::protobuf
+RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField()$/;"	f	class:google::protobuf::RepeatedField
+RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField(Iter begin, const Iter& end)$/;"	f	class:google::protobuf::RepeatedField
+RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField(const RepeatedField& other)$/;"	f	class:google::protobuf::RepeatedField
+RepeatedFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+RepeatedFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class RepeatedFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
+RepeatedFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedFieldBackInserter(RepeatedField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
+RepeatedFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
+RepeatedMessageTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedMessageTypeTraits {$/;"	c	namespace:google::protobuf::internal
+RepeatedPrimitiveTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedPrimitiveTypeTraits {$/;"	c	namespace:google::protobuf::internal
+RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField : public internal::RepeatedPtrFieldBase {$/;"	c	namespace:google::protobuf
+RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>::RepeatedPtrField($/;"	f	class:google::protobuf::RepeatedPtrField
+RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>::RepeatedPtrField() {}$/;"	f	class:google::protobuf::RepeatedPtrField
+RepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+RepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class RepeatedPtrFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
+RepeatedPtrFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
+RepeatedPtrFieldBase	deps/include/google/protobuf/repeated_field.h	/^class LIBPROTOBUF_EXPORT RepeatedPtrFieldBase {$/;"	c	namespace:google::protobuf::internal
+RepeatedPtrFieldBase	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrFieldBase::RepeatedPtrFieldBase()$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrIterator() : it_(NULL) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrIterator(const RepeatedPtrIterator<OtherElement>& other)$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrIterator$/;"	c	namespace:google::protobuf::internal
+RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrOverPtrsIterator() : it_(NULL) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedPtrOverPtrsIterator(VoidPtr* it) : it_(it) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrOverPtrsIterator$/;"	c	namespace:google::protobuf::internal
+RepeatedStringTypeTraits	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT RepeatedStringTypeTraits {$/;"	c	namespace:google::protobuf::internal
+ReqHandle	tests/test_simple_app.cc	/^void ReqHandle(const SimpleData& req, SimpleApp* app) {$/;"	f
+Request	include/ps/simple_app.h	/^inline int SimpleApp::Request(int req_head, const std::string& req_body, int recv_id) {$/;"	f	class:ps::SimpleApp
+Resender	src/resender.h	/^  Resender(int timeout, int max_num_retry, Van* van) {$/;"	f	class:ps::Resender
+Resender	src/resender.h	/^class Resender {$/;"	c	namespace:ps
+Reserve	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::Reserve(int new_size) {$/;"	f	class:google::protobuf::RepeatedPtrField
+Reserve	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::Reserve(int new_size) {$/;"	f	class:google::protobuf::RepeatedField
+Response	include/ps/kv_app.h	/^void KVServer<Val>::Response(const KVMeta& req, const KVPairs<Val>& res) {$/;"	f	class:ps::KVServer
+Response	include/ps/simple_app.h	/^inline void SimpleApp::Response(const SimpleData& req, const std::string& res_body) {$/;"	f	class:ps::SimpleApp
+Role	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	g	struct:ps::Node
+RpcChannel	deps/include/google/protobuf/service.h	/^  inline RpcChannel() {}$/;"	f	class:google::protobuf::RpcChannel
+RpcChannel	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT RpcChannel {$/;"	c	namespace:google::protobuf
+RpcController	deps/include/google/protobuf/service.h	/^  inline RpcController() {}$/;"	f	class:google::protobuf::RpcController
+RpcController	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT RpcController {$/;"	c	namespace:google::protobuf
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure0
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure1
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure2
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure0
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure1
+Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure2
+RunCallback	include/ps/kv_app.h	/^void KVWorker<Val>::RunCallback(int timestamp) {$/;"	f	class:ps::KVWorker
+RunWorker	tests/test_kv_app.cc	/^void RunWorker() {$/;"	f
+SArray	include/ps/sarray.h	/^  SArray() { }$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  SArray(V* data, size_t size, bool deletable = false) {$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  explicit SArray(const SArray<W>& arr) { *this = arr; }$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  explicit SArray(const std::shared_ptr<std::vector<V>>& vec) {$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  explicit SArray(const std::vector<V>& vec) { CopyFrom(vec.data(), vec.size()); }$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  explicit SArray(size_t size, V val = 0) { resize(size, val); }$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^  template <typename W> SArray(const std::initializer_list<W>& list) {$/;"	f	class:ps::SArray
+SArray	include/ps/sarray.h	/^class SArray {$/;"	c	namespace:ps
+SCHEDULER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
+SERIALIZE	deps/include/google/protobuf/wire_format.h	/^    SERIALIZE,$/;"	e	enum:google::protobuf::internal::WireFormat::Operation
+SERVER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
+SHADOWED	deps/include/google/protobuf/compiler/importer.h	/^    SHADOWED,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
+SH_COMMENT_STYLE	deps/include/google/protobuf/io/tokenizer.h	/^    SH_COMMENT_STYLE$/;"	e	enum:google::protobuf::io::Tokenizer::CommentStyle
+SInt32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::SInt32Size(int32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+SInt64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::SInt64Size(int64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+SLASH_NOT_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    SLASH_NOT_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
+SPEED	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode SPEED = FileOptions_OptimizeMode_SPEED;$/;"	m	class:google::protobuf::FileOptions
+SPHINXBUILD	docs/Makefile	/^SPHINXBUILD   = sphinx-build$/;"	m
+SPHINXOPTS	docs/Makefile	/^SPHINXOPTS    =$/;"	m
+SSHLauncher	tracker/dmlc_ssh.py	/^class SSHLauncher(object):$/;"	c
+STDERR_FILENO	src/windows/unistd.h	/^#define STDERR_FILENO /;"	d
+STDIN_FILENO	src/windows/unistd.h	/^#define STDIN_FILENO /;"	d
+STDOUT_FILENO	src/windows/unistd.h	/^#define STDOUT_FILENO /;"	d
+STRING	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType STRING = FieldOptions_CType_STRING;$/;"	m	class:google::protobuf::FieldOptions
+STRING_PIECE	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType STRING_PIECE = FieldOptions_CType_STRING_PIECE;$/;"	m	class:google::protobuf::FieldOptions
+STUB_DOESNT_OWN_CHANNEL	deps/include/google/protobuf/service.h	/^    STUB_DOESNT_OWN_CHANNEL$/;"	e	enum:google::protobuf::Service::ChannelOwnership
+STUB_OWNS_CHANNEL	deps/include/google/protobuf/service.h	/^    STUB_OWNS_CHANNEL,$/;"	e	enum:google::protobuf::Service::ChannelOwnership
+SUCCESS	deps/include/google/protobuf/compiler/importer.h	/^    SUCCESS,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
+SameType	include/ps/internal/message.h	/^inline bool SameType() {$/;"	f	namespace:ps
+Send	include/ps/kv_app.h	/^void KVWorker<Val>::Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs) {$/;"	f	class:ps::KVWorker
+Send	src/van.cc	/^int Van::Send(const Message& msg) {$/;"	f	class:ps::Van
+SerializeWithCachedSizes	src/meta.pb.cc	/^void PBControl::SerializeWithCachedSizes($/;"	f	class:ps::PBControl
+SerializeWithCachedSizes	src/meta.pb.cc	/^void PBMeta::SerializeWithCachedSizes($/;"	f	class:ps::PBMeta
+SerializeWithCachedSizes	src/meta.pb.cc	/^void PBNode::SerializeWithCachedSizes($/;"	f	class:ps::PBNode
+ServerRankToID	include/ps/internal/postoffice.h	/^  static inline int ServerRankToID(int rank) {$/;"	f	class:ps::Postoffice
+Service	deps/include/google/protobuf/service.h	/^  inline Service() {}$/;"	f	class:google::protobuf::Service
+Service	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT Service {$/;"	c	namespace:google::protobuf
+ServiceDescriptor	deps/include/google/protobuf/descriptor.h	/^  ServiceDescriptor() {}$/;"	f	class:google::protobuf::ServiceDescriptor
+ServiceDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT ServiceDescriptor {$/;"	c	namespace:google::protobuf
+ServiceDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT ServiceDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+ServiceOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT ServiceOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::EnumTypeTraits
+Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::StringTypeTraits
+Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, int index,$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
+Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, int index,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
+Set	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Set(int index, const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
+SetAllocated	deps/include/google/protobuf/extension_set.h	/^  static inline void SetAllocated(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
+SetCachedSize	src/meta.pb.cc	/^void PBControl::SetCachedSize(int size) const {$/;"	f	class:ps::PBControl
+SetCachedSize	src/meta.pb.cc	/^void PBMeta::SetCachedSize(int size) const {$/;"	f	class:ps::PBMeta
+SetCachedSize	src/meta.pb.cc	/^void PBNode::SetCachedSize(int size) const {$/;"	f	class:ps::PBNode
+SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }$/;"	f	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }$/;"	f	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  void SetCloseOnDelete(bool value) { copying_input_.SetCloseOnDelete(value); }$/;"	f	class:google::protobuf::io::FileInputStream
+SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  void SetCloseOnDelete(bool value) { copying_output_.SetCloseOnDelete(value); }$/;"	f	class:google::protobuf::io::FileOutputStream
+SetDelegateToGeneratedFactory	deps/include/google/protobuf/dynamic_message.h	/^  void SetDelegateToGeneratedFactory(bool enable) {$/;"	f	class:google::protobuf::DynamicMessageFactory
+SetExtensionRegistry	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::SetExtensionRegistry(const DescriptorPool* pool,$/;"	f	class:google::protobuf::io::CodedInputStream
+SetFinder	deps/include/google/protobuf/text_format.h	/^    void SetFinder(Finder* finder) {$/;"	f	class:google::protobuf::TextFormat::Parser
+SetInitialIndentLevel	deps/include/google/protobuf/text_format.h	/^    void SetInitialIndentLevel(int indent_level) {$/;"	f	class:google::protobuf::TextFormat::Printer
+SetInputsAreProtoPathRelative	deps/include/google/protobuf/compiler/command_line_interface.h	/^  void SetInputsAreProtoPathRelative(bool enable) {$/;"	f	class:google::protobuf::compiler::CommandLineInterface
+SetOwnsCopyingStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }$/;"	f	class:google::protobuf::io::CopyingInputStreamAdaptor
+SetOwnsCopyingStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }$/;"	f	class:google::protobuf::io::CopyingOutputStreamAdaptor
+SetRecursionLimit	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::SetRecursionLimit(int limit) {$/;"	f	class:google::protobuf::io::CodedInputStream
+SetRepeatedString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::SetRepeatedString(int number, int index,$/;"	f	class:google::protobuf::internal::ExtensionSet
+SetRequireSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  void SetRequireSyntaxIdentifier(bool value) {$/;"	f	class:google::protobuf::compiler::Parser
+SetSingleLineMode	deps/include/google/protobuf/text_format.h	/^    void SetSingleLineMode(bool single_line_mode) {$/;"	f	class:google::protobuf::TextFormat::Printer
+SetStopAfterSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  void SetStopAfterSyntaxIdentifier(bool value) {$/;"	f	class:google::protobuf::compiler::Parser
+SetString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::SetString(int number, FieldType type,$/;"	f	class:google::protobuf::internal::ExtensionSet
+SetUseShortRepeatedPrimitives	deps/include/google/protobuf/text_format.h	/^    void SetUseShortRepeatedPrimitives(bool use_short_repeated_primitives) {$/;"	f	class:google::protobuf::TextFormat::Printer
+SetUseUtf8StringEscaping	deps/include/google/protobuf/text_format.h	/^    void SetUseUtf8StringEscaping(bool as_utf8) {$/;"	f	class:google::protobuf::TextFormat::Printer
+SetVersionInfo	deps/include/google/protobuf/compiler/command_line_interface.h	/^  void SetVersionInfo(const string& text) {$/;"	f	class:google::protobuf::compiler::CommandLineInterface
+SharedCtor	src/meta.pb.cc	/^void PBControl::SharedCtor() {$/;"	f	class:ps::PBControl
+SharedCtor	src/meta.pb.cc	/^void PBMeta::SharedCtor() {$/;"	f	class:ps::PBMeta
+SharedCtor	src/meta.pb.cc	/^void PBNode::SharedCtor() {$/;"	f	class:ps::PBNode
+SharedDtor	src/meta.pb.cc	/^void PBControl::SharedDtor() {$/;"	f	class:ps::PBControl
+SharedDtor	src/meta.pb.cc	/^void PBMeta::SharedDtor() {$/;"	f	class:ps::PBMeta
+SharedDtor	src/meta.pb.cc	/^void PBNode::SharedDtor() {$/;"	f	class:ps::PBNode
+ShortDebugString	include/ps/internal/message.h	/^  std::string ShortDebugString() const {$/;"	f	struct:ps::Node
+SimpleApp	include/ps/simple_app.h	/^  inline SimpleApp() : obj_(nullptr) {$/;"	f	class:ps::SimpleApp
+SimpleApp	include/ps/simple_app.h	/^class SimpleApp {$/;"	c	namespace:ps
+SimpleApp	include/ps/simple_app.h	/^inline SimpleApp::SimpleApp(int app_id) : SimpleApp() {$/;"	f	class:ps::SimpleApp
+SimpleData	include/ps/simple_app.h	/^struct SimpleData {$/;"	s	namespace:ps
+SimpleDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT SimpleDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
+SlaveEntry	tracker/tracker.py	/^class SlaveEntry:$/;"	c
+SourceCodeInfo	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT SourceCodeInfo : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+SourceCodeInfo_Location	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT SourceCodeInfo_Location : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+SourceLocation	deps/include/google/protobuf/descriptor.h	/^struct SourceLocation {$/;"	s	namespace:google::protobuf
+SourceLocationTable	deps/include/google/protobuf/compiler/parser.h	/^class LIBPROTOBUF_EXPORT SourceLocationTable {$/;"	c	namespace:google::protobuf::compiler
+SourceTree	deps/include/google/protobuf/compiler/importer.h	/^  inline SourceTree() {}$/;"	f	class:google::protobuf::compiler::SourceTree
+SourceTree	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT SourceTree {$/;"	c	namespace:google::protobuf::compiler
+SourceTreeDescriptorDatabase	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT SourceTreeDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf::compiler
+SpaceUsed	deps/include/google/protobuf/repeated_field.h	/^  static int SpaceUsed(const GenericType& value) { return value.SpaceUsed(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+SpaceUsed	deps/include/google/protobuf/repeated_field.h	/^  static int SpaceUsed(const string& value)  {$/;"	f	class:google::protobuf::internal::StringTypeHandler
+SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::RepeatedField
+SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+Start	include/ps/ps.h	/^inline void Start(const char* argv0 = nullptr) {$/;"	f	namespace:ps
+Start	src/postoffice.cc	/^void Postoffice::Start(const char* argv0, const bool do_barrier) {$/;"	f	class:ps::Postoffice
+Start	src/van.cc	/^void Van::Start() {$/;"	f	class:ps::Van
+StartAsync	include/ps/ps.h	/^inline void StartAsync(const char* argv0 = nullptr) {$/;"	f	namespace:ps
+StartServer	tests/test_kv_app.cc	/^void StartServer() {$/;"	f
+StaticDescriptorInitializer_meta_2eproto	src/meta.pb.cc	/^  StaticDescriptorInitializer_meta_2eproto() {$/;"	f	struct:ps::StaticDescriptorInitializer_meta_2eproto
+StaticDescriptorInitializer_meta_2eproto	src/meta.pb.cc	/^struct StaticDescriptorInitializer_meta_2eproto {$/;"	s	namespace:ps	file:
+StaticVarintSize32	deps/include/google/protobuf/io/coded_stream.h	/^  struct StaticVarintSize32 {$/;"	s	class:google::protobuf::io::CodedOutputStream
+Stop	src/van.cc	/^void Van::Stop() {$/;"	f	class:ps::Van
+StringOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT StringOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+StringSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::StringSize(const string& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+StringTypeHandler	deps/include/google/protobuf/repeated_field.h	/^class StringTypeHandler : public StringTypeHandlerBase {$/;"	c	namespace:google::protobuf::internal
+StringTypeHandlerBase	deps/include/google/protobuf/repeated_field.h	/^class LIBPROTOBUF_EXPORT StringTypeHandlerBase {$/;"	c	namespace:google::protobuf::internal
+StringTypeTraits	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT StringTypeTraits {$/;"	c	namespace:google::protobuf::internal
+Swap	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::Swap(RepeatedField* other) {$/;"	f	class:google::protobuf::RepeatedField
+Swap	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrField<Element>::Swap(RepeatedPtrField* other) {$/;"	f	class:google::protobuf::RepeatedPtrField
+Swap	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::Swap(UnknownFieldSet* x) {$/;"	f	class:google::protobuf::UnknownFieldSet
+Swap	src/meta.pb.cc	/^void PBControl::Swap(PBControl* other) {$/;"	f	class:ps::PBControl
+Swap	src/meta.pb.cc	/^void PBMeta::Swap(PBMeta* other) {$/;"	f	class:ps::PBMeta
+Swap	src/meta.pb.cc	/^void PBNode::Swap(PBNode* other) {$/;"	f	class:ps::PBNode
+SwapElements	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+SwapElements	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::RepeatedField
+SwapElements	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrField<Element>::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::RepeatedPtrField
+TERMINATE	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
+TEST	tests/test.mk	/^TEST = $(patsubst tests\/test_%.cc, tests\/test_%, $(TEST_SRC))$/;"	m
+TEST_SRC	tests/test.mk	/^TEST_SRC = $(wildcard tests\/test_*.cc)$/;"	m
+TIMES	include/ps/internal/assign_op.h	/^  TIMES,   \/\/ a *= b$/;"	e	enum:ps::AssignOp
+TYPE	deps/include/google/protobuf/descriptor.h	/^      TYPE,              \/\/ field type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
+TYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^    TYPE_BOOL           = 8,   \/\/ bool, varint on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^#undef TYPE_BOOL$/;"	d
+TYPE_BOOL	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_BOOL = FieldDescriptorProto_Type_TYPE_BOOL;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_BOOL	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_BOOL           = 8,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_BYTES	deps/include/google/protobuf/descriptor.h	/^    TYPE_BYTES          = 12,  \/\/ Arbitrary byte array.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_BYTES	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_BYTES = FieldDescriptorProto_Type_TYPE_BYTES;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_BYTES	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_BYTES          = 12,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_DOUBLE	deps/include/google/protobuf/descriptor.h	/^    TYPE_DOUBLE         = 1,   \/\/ double, exactly eight bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_DOUBLE	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_DOUBLE = FieldDescriptorProto_Type_TYPE_DOUBLE;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_DOUBLE	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_DOUBLE         = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_END	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_END,         \/\/ End of input reached.  "text" is empty.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_ENUM	deps/include/google/protobuf/descriptor.h	/^    TYPE_ENUM           = 14,  \/\/ Enum, varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_ENUM	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_ENUM = FieldDescriptorProto_Type_TYPE_ENUM;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_ENUM	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_ENUM           = 14,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_FIXED32	deps/include/google/protobuf/descriptor.h	/^    TYPE_FIXED32        = 7,   \/\/ uint32, exactly four bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_FIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FIXED32 = FieldDescriptorProto_Type_TYPE_FIXED32;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_FIXED32	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_FIXED32,$/;"	e	enum:google::protobuf::UnknownField::Type
+TYPE_FIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FIXED32        = 7,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_FIXED64	deps/include/google/protobuf/descriptor.h	/^    TYPE_FIXED64        = 6,   \/\/ uint64, exactly eight bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_FIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FIXED64 = FieldDescriptorProto_Type_TYPE_FIXED64;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_FIXED64	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_FIXED64,$/;"	e	enum:google::protobuf::UnknownField::Type
+TYPE_FIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FIXED64        = 6,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_FLOAT	deps/include/google/protobuf/descriptor.h	/^    TYPE_FLOAT          = 2,   \/\/ float, exactly four bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_FLOAT	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FLOAT = FieldDescriptorProto_Type_TYPE_FLOAT;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_FLOAT	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_FLOAT,       \/\/ A floating point literal, with a fractional part and\/or$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_FLOAT	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FLOAT          = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_GROUP	deps/include/google/protobuf/descriptor.h	/^    TYPE_GROUP          = 10,  \/\/ Tag-delimited message.  Deprecated.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_GROUP	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_GROUP = FieldDescriptorProto_Type_TYPE_GROUP;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_GROUP	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_GROUP$/;"	e	enum:google::protobuf::UnknownField::Type
+TYPE_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_GROUP          = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_IDENTIFIER	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_IDENTIFIER,  \/\/ A sequence of letters, digits, and underscores, not$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_INT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_INT32          = 5,   \/\/ int32, varint on the wire.  Negative numbers$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_INT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_INT32 = FieldDescriptorProto_Type_TYPE_INT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_INT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_INT32          = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_INT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_INT64          = 3,   \/\/ int64, varint on the wire.  Negative numbers$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_INT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_INT64 = FieldDescriptorProto_Type_TYPE_INT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_INT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_INT64          = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_INTEGER	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_INTEGER,     \/\/ A sequence of digits representing an integer.  Normally$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_LENGTH_DELIMITED	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_LENGTH_DELIMITED,$/;"	e	enum:google::protobuf::UnknownField::Type
+TYPE_MESSAGE	deps/include/google/protobuf/descriptor.h	/^    TYPE_MESSAGE        = 11,  \/\/ Length-delimited message.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_MESSAGE	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_MESSAGE = FieldDescriptorProto_Type_TYPE_MESSAGE;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_MESSAGE	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_MESSAGE        = 11,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_SFIXED32	deps/include/google/protobuf/descriptor.h	/^    TYPE_SFIXED32       = 15,  \/\/ int32, exactly four bytes on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_SFIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SFIXED32 = FieldDescriptorProto_Type_TYPE_SFIXED32;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_SFIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SFIXED32       = 15,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_SFIXED64	deps/include/google/protobuf/descriptor.h	/^    TYPE_SFIXED64       = 16,  \/\/ int64, exactly eight bytes on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_SFIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SFIXED64 = FieldDescriptorProto_Type_TYPE_SFIXED64;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_SFIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SFIXED64       = 16,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_SINT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_SINT32         = 17,  \/\/ int32, ZigZag-encoded varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_SINT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SINT32 = FieldDescriptorProto_Type_TYPE_SINT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_SINT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SINT32         = 17,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_SINT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_SINT64         = 18,  \/\/ int64, ZigZag-encoded varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_SINT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SINT64 = FieldDescriptorProto_Type_TYPE_SINT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_SINT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SINT64         = 18,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_START	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_START,       \/\/ Next() has not yet been called.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_STRING	deps/include/google/protobuf/descriptor.h	/^    TYPE_STRING         = 9,   \/\/ UTF-8 text.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_STRING = FieldDescriptorProto_Type_TYPE_STRING;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_STRING	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_STRING,      \/\/ A quoted sequence of escaped characters.  Either single$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_STRING	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_STRING         = 9,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_SYMBOL	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_SYMBOL,      \/\/ Any other printable character, like '!' or '+'.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
+TYPE_UINT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_UINT32         = 13,  \/\/ uint32, varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_UINT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_UINT32 = FieldDescriptorProto_Type_TYPE_UINT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_UINT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_UINT32         = 13,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_UINT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_UINT64         = 4,   \/\/ uint64, varint on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
+TYPE_UINT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_UINT64 = FieldDescriptorProto_Type_TYPE_UINT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
+TYPE_UINT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_UINT64         = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
+TYPE_VARINT	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_VARINT,$/;"	e	enum:google::protobuf::UnknownField::Type
+TagSize	deps/include/google/protobuf/wire_format.h	/^inline int WireFormat::TagSize(int field_number, FieldDescriptor::Type type) {$/;"	f	class:google::protobuf::internal::WireFormat
+TagSize	deps/include/google/protobuf/wire_format_lite.h	/^inline int WireFormatLite::TagSize(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+TextFormat	deps/include/google/protobuf/text_format.h	/^class LIBPROTOBUF_EXPORT TextFormat {$/;"	c	namespace:google::protobuf
+Thread	tracker/dmlc_local.py	/^from threading import Thread$/;"	i
+Thread	tracker/dmlc_mpi.py	/^from threading import Thread$/;"	i
+Thread	tracker/dmlc_ssh.py	/^from threading import Thread$/;"	i
+Thread	tracker/tracker.py	/^from threading import Thread$/;"	i
+ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^  ThreadsafeQueue() { }$/;"	f	class:ps::ThreadsafeQueue
+ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^template<typename T> class ThreadsafeQueue {$/;"	c	namespace:ps
+Token	deps/include/google/protobuf/io/tokenizer.h	/^  struct Token {$/;"	s	class:google::protobuf::io::Tokenizer
+TokenType	deps/include/google/protobuf/io/tokenizer.h	/^  enum TokenType {$/;"	g	class:google::protobuf::io::Tokenizer
+Tokenizer	deps/include/google/protobuf/io/tokenizer.h	/^class LIBPROTOBUF_EXPORT Tokenizer {$/;"	c	namespace:google::protobuf::io
+Truncate	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Truncate(int new_size) {$/;"	f	class:google::protobuf::RepeatedField
+Type	deps/include/google/protobuf/descriptor.h	/^  enum Type {$/;"	g	class:google::protobuf::FieldDescriptor
+Type	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldDescriptorProto_Type Type;$/;"	t	class:google::protobuf::FieldDescriptorProto
+Type	deps/include/google/protobuf/repeated_field.h	/^  typedef GenericType Type;$/;"	t	class:google::protobuf::internal::GenericTypeHandler
+Type	deps/include/google/protobuf/repeated_field.h	/^  typedef string Type;$/;"	t	class:google::protobuf::internal::StringTypeHandlerBase
+Type	deps/include/google/protobuf/unknown_field_set.h	/^  enum Type {$/;"	g	class:google::protobuf::UnknownField
+TypeHandler	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField<Element>::TypeHandler$/;"	c	class:google::protobuf::RepeatedPtrField
+TypeHandler	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField<string>::TypeHandler$/;"	c	class:google::protobuf::RepeatedPtrField
+TypeToCppType	deps/include/google/protobuf/descriptor.h	/^inline FieldDescriptor::CppType FieldDescriptor::TypeToCppType(Type type) {$/;"	f	class:google::protobuf::FieldDescriptor
+TypeTraits	deps/include/google/protobuf/extension_set.h	/^  typedef TypeTraitsType TypeTraits;$/;"	t	class:google::protobuf::internal::ExtensionIdentifier
+Type_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int Type_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Type_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Type_IsValid(int value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+Type_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type Type_MAX =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Type_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type Type_MIN =$/;"	m	class:google::protobuf::FieldDescriptorProto
+Type_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& Type_Name(Type value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+Type_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Type_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldDescriptorProto
+Type_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  Type_descriptor() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+UINT16	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
+UINT32	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
+UINT64	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
+UINT8	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
+UInt32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::UInt32Size(uint32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+UInt64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::UInt64Size(uint64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+URL	make/deps.mk	/^URL=https:\/\/raw.githubusercontent.com\/mli\/deps\/master\/build$/;"	m
+UninterpretedOption	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT UninterpretedOption : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+UninterpretedOption_NamePart	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT UninterpretedOption_NamePart : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
+UnknownField	deps/include/google/protobuf/unknown_field_set.h	/^class LIBPROTOBUF_EXPORT UnknownField {$/;"	c	namespace:google::protobuf
+UnknownFieldSet	deps/include/google/protobuf/unknown_field_set.h	/^class LIBPROTOBUF_EXPORT UnknownFieldSet {$/;"	c	namespace:google::protobuf
+UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^  UnknownFieldSetFieldSkipper(UnknownFieldSet* unknown_fields)$/;"	f	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
+UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^class LIBPROTOBUF_EXPORT UnknownFieldSetFieldSkipper : public FieldSkipper {$/;"	c	namespace:google::protobuf::internal
+UnpackMeta	src/van.cc	/^void Van::UnpackMeta(const char* meta_buf, int buf_size, Meta* meta) {$/;"	f	class:ps::Van
+UpdateHeartbeat	include/ps/internal/postoffice.h	/^  void UpdateHeartbeat(int node_id, time_t t) {$/;"	f	class:ps::Postoffice
+ValidationErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  class LIBPROTOBUF_EXPORT ValidationErrorCollector : public DescriptorPool::ErrorCollector {$/;"	c	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+Van	include/ps/internal/van.h	/^  Van() { }$/;"	f	class:ps::Van
+Van	include/ps/internal/van.h	/^class Van {$/;"	c	namespace:ps
+VarintSize32	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::VarintSize32(uint32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+VarintSize32SignExtended	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::VarintSize32SignExtended(int32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+VerifyUTF8String	deps/include/google/protobuf/wire_format.h	/^inline void WireFormat::VerifyUTF8String(const char* data, int size,$/;"	f	class:google::protobuf::internal::WireFormat
+WGET	make/deps.mk	/^WGET = wget$/;"	m
+WIRETYPE_END_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_END_GROUP        = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WIRETYPE_FIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_FIXED32          = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WIRETYPE_FIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_FIXED64          = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WIRETYPE_LENGTH_DELIMITED	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_LENGTH_DELIMITED = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WIRETYPE_START_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_START_GROUP      = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WIRETYPE_VARINT	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_VARINT           = 0,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
+WORKER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
+W_OK	src/windows/unistd.h	/^#define W_OK /;"	d
+Wait	include/ps/kv_app.h	/^  void Wait(int timestamp) { obj_->WaitRequest(timestamp); }$/;"	f	class:ps::KVWorker
+Wait	include/ps/simple_app.h	/^  virtual inline void Wait(int timestamp) { obj_->WaitRequest(timestamp); }$/;"	f	class:ps::SimpleApp
+WaitAndPop	include/ps/internal/threadsafe_queue.h	/^  void WaitAndPop(T* value) {$/;"	f	class:ps::ThreadsafeQueue
+WaitRequest	src/customer.cc	/^void Customer::WaitRequest(int timestamp) {$/;"	f	class:ps::Customer
+WireFormat	deps/include/google/protobuf/wire_format.h	/^class LIBPROTOBUF_EXPORT WireFormat {$/;"	c	namespace:google::protobuf::internal
+WireFormatLite	deps/include/google/protobuf/wire_format_lite.h	/^class LIBPROTOBUF_EXPORT WireFormatLite {$/;"	c	namespace:google::protobuf::internal
+WireType	deps/include/google/protobuf/wire_format_lite.h	/^  enum WireType {$/;"	g	class:google::protobuf::internal::WireFormatLite
+WireTypeForField	deps/include/google/protobuf/wire_format.h	/^inline WireFormatLite::WireType WireFormat::WireTypeForField($/;"	f	class:google::protobuf::internal::WireFormat
+WireTypeForFieldType	deps/include/google/protobuf/wire_format.h	/^inline WireFormatLite::WireType WireFormat::WireTypeForFieldType($/;"	f	class:google::protobuf::internal::WireFormat
+WireTypeForFieldType	deps/include/google/protobuf/wire_format_lite.h	/^  static inline WireFormatLite::WireType WireTypeForFieldType($/;"	f	class:google::protobuf::internal::WireFormatLite
+WorkerRankToID	include/ps/internal/postoffice.h	/^  static inline int WorkerRankToID(int rank) {$/;"	f	class:ps::Postoffice
+WriteBoolNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteBoolNoTag(bool value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteBoolNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBoolNoTagToArray(bool value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteBoolToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBoolToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteBytesToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBytesToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteDoubleNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteDoubleNoTag(double value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteDoubleNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteDoubleNoTagToArray(double value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteDoubleToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteDoubleToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteEnumNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteEnumNoTag(int value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteEnumNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteEnumNoTagToArray(int value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteEnumToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteEnumToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFixed32NoTag(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed32NoTagToArray(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFixed64NoTag(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed64NoTagToArray(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFixed64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFloatNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFloatNoTag(float value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFloatNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFloatNoTagToArray(float value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteFloatToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFloatToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteGroupNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteGroupNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteGroupNoVirtualToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteGroupNoVirtualToArray($/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteGroupToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteGroupToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteInt32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteInt64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteLittleEndian32ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteLittleEndian32ToArray(uint32 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteLittleEndian64ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteLittleEndian64ToArray(uint64 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteLocationsTo	deps/include/google/protobuf/text_format.h	/^    void WriteLocationsTo(ParseInfoTree* tree) {$/;"	f	class:google::protobuf::TextFormat::Parser
+WriteMessageNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteMessageNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteMessageNoVirtualToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteMessageNoVirtualToArray($/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteMessageToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteMessageToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSFixed32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSFixed64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSFixed64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSInt32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSInt64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteSInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteString	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteString(const string& str) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteStringToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteStringToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteStringToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteStringToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteTag	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteTag(uint32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteTag(int field_number, WireType type,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteTagToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteTagToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteTagToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteUInt32NoTag(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt32NoTagToArray(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteUInt64NoTag(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt64NoTagToArray(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteUInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
+WriteVarint32SignExtended	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteVarint32SignExtended(int32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteVarint32SignExtendedToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteVarint32SignExtendedToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
+WriteVarint32ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteVarint32ToArray(uint32 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
+WriterMutexLock	deps/include/google/protobuf/stubs/common.h	/^typedef MutexLock WriterMutexLock;$/;"	t	namespace:google::protobuf::internal
+XOR	include/ps/internal/assign_op.h	/^  XOR      \/\/ a ^= b$/;"	e	enum:ps::AssignOp
+ZLIB	deps/include/google/protobuf/io/gzip_stream.h	/^    ZLIB = 2,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
+ZLIB	deps/include/google/protobuf/io/gzip_stream.h	/^    ZLIB = 2,$/;"	e	enum:google::protobuf::io::GzipOutputStream::Format
+ZMQ	make/deps.mk	/^ZMQ = ${DEPS_PATH}\/include\/zmq.h$/;"	m
+ZMQVan	src/zmq_van.h	/^  ZMQVan() { }$/;"	f	class:ps::ZMQVan
+ZMQVan	src/zmq_van.h	/^class ZMQVan : public Van {$/;"	c	namespace:ps
+ZMQ_AFFINITY	deps/include/zmq.h	/^#define ZMQ_AFFINITY /;"	d
+ZMQ_BACKLOG	deps/include/zmq.h	/^#define ZMQ_BACKLOG /;"	d
+ZMQ_CONFLATE	deps/include/zmq.h	/^#define ZMQ_CONFLATE /;"	d
+ZMQ_CONNECT_RID	deps/include/zmq.h	/^#define ZMQ_CONNECT_RID /;"	d
+ZMQ_CURVE	deps/include/zmq.h	/^#define ZMQ_CURVE /;"	d
+ZMQ_CURVE_PUBLICKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_PUBLICKEY /;"	d
+ZMQ_CURVE_SECRETKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_SECRETKEY /;"	d
+ZMQ_CURVE_SERVER	deps/include/zmq.h	/^#define ZMQ_CURVE_SERVER /;"	d
+ZMQ_CURVE_SERVERKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_SERVERKEY /;"	d
+ZMQ_DEALER	deps/include/zmq.h	/^#define ZMQ_DEALER /;"	d
+ZMQ_DEFINED_STDINT	deps/include/zmq.h	/^#define ZMQ_DEFINED_STDINT /;"	d
+ZMQ_DELAY_ATTACH_ON_CONNECT	deps/include/zmq.h	/^#define ZMQ_DELAY_ATTACH_ON_CONNECT /;"	d
+ZMQ_DONTWAIT	deps/include/zmq.h	/^#define ZMQ_DONTWAIT /;"	d
+ZMQ_EVENTS	deps/include/zmq.h	/^#define ZMQ_EVENTS /;"	d
+ZMQ_EVENT_ACCEPTED	deps/include/zmq.h	/^#define ZMQ_EVENT_ACCEPTED /;"	d
+ZMQ_EVENT_ACCEPT_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_ACCEPT_FAILED /;"	d
+ZMQ_EVENT_ALL	deps/include/zmq.h	/^#define ZMQ_EVENT_ALL /;"	d
+ZMQ_EVENT_BIND_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_BIND_FAILED /;"	d
+ZMQ_EVENT_CLOSED	deps/include/zmq.h	/^#define ZMQ_EVENT_CLOSED /;"	d
+ZMQ_EVENT_CLOSE_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_CLOSE_FAILED /;"	d
+ZMQ_EVENT_CONNECTED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECTED /;"	d
+ZMQ_EVENT_CONNECT_DELAYED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECT_DELAYED /;"	d
+ZMQ_EVENT_CONNECT_RETRIED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECT_RETRIED /;"	d
+ZMQ_EVENT_DISCONNECTED	deps/include/zmq.h	/^#define ZMQ_EVENT_DISCONNECTED /;"	d
+ZMQ_EVENT_LISTENING	deps/include/zmq.h	/^#define ZMQ_EVENT_LISTENING /;"	d
+ZMQ_EVENT_MONITOR_STOPPED	deps/include/zmq.h	/^#define ZMQ_EVENT_MONITOR_STOPPED /;"	d
+ZMQ_EXPORT	deps/include/zmq.h	/^#       define ZMQ_EXPORT /;"	d
+ZMQ_EXPORT	deps/include/zmq.h	/^#       define ZMQ_EXPORT$/;"	d
+ZMQ_EXPORT	deps/include/zmq.h	/^#undef ZMQ_EXPORT$/;"	d
+ZMQ_FAIL_UNROUTABLE	deps/include/zmq.h	/^#define ZMQ_FAIL_UNROUTABLE /;"	d
+ZMQ_FD	deps/include/zmq.h	/^#define ZMQ_FD /;"	d
+ZMQ_FORWARDER	deps/include/zmq.h	/^#define ZMQ_FORWARDER /;"	d
+ZMQ_GSSAPI	deps/include/zmq.h	/^#define ZMQ_GSSAPI /;"	d
+ZMQ_GSSAPI_PLAINTEXT	deps/include/zmq.h	/^#define ZMQ_GSSAPI_PLAINTEXT /;"	d
+ZMQ_GSSAPI_PRINCIPAL	deps/include/zmq.h	/^#define ZMQ_GSSAPI_PRINCIPAL /;"	d
+ZMQ_GSSAPI_SERVER	deps/include/zmq.h	/^#define ZMQ_GSSAPI_SERVER /;"	d
+ZMQ_GSSAPI_SERVICE_PRINCIPAL	deps/include/zmq.h	/^#define ZMQ_GSSAPI_SERVICE_PRINCIPAL /;"	d
+ZMQ_HANDSHAKE_IVL	deps/include/zmq.h	/^#define ZMQ_HANDSHAKE_IVL /;"	d
+ZMQ_HAS_CAPABILITIES	deps/include/zmq.h	/^#define ZMQ_HAS_CAPABILITIES /;"	d
+ZMQ_HAUSNUMERO	deps/include/zmq.h	/^#define ZMQ_HAUSNUMERO /;"	d
+ZMQ_IDENTITY	deps/include/zmq.h	/^#define ZMQ_IDENTITY /;"	d
+ZMQ_IMMEDIATE	deps/include/zmq.h	/^#define ZMQ_IMMEDIATE /;"	d
+ZMQ_IO_THREADS	deps/include/zmq.h	/^#define ZMQ_IO_THREADS /;"	d
+ZMQ_IO_THREADS_DFLT	deps/include/zmq.h	/^#define ZMQ_IO_THREADS_DFLT /;"	d
+ZMQ_IPC_FILTER_GID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_GID /;"	d
+ZMQ_IPC_FILTER_PID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_PID /;"	d
+ZMQ_IPC_FILTER_UID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_UID /;"	d
+ZMQ_IPV4ONLY	deps/include/zmq.h	/^#define ZMQ_IPV4ONLY /;"	d
+ZMQ_IPV6	deps/include/zmq.h	/^#define ZMQ_IPV6 /;"	d
+ZMQ_LAST_ENDPOINT	deps/include/zmq.h	/^#define ZMQ_LAST_ENDPOINT /;"	d
+ZMQ_LINGER	deps/include/zmq.h	/^#define ZMQ_LINGER /;"	d
+ZMQ_MAKE_VERSION	deps/include/zmq.h	/^#define ZMQ_MAKE_VERSION(/;"	d
+ZMQ_MAXMSGSIZE	deps/include/zmq.h	/^#define ZMQ_MAXMSGSIZE /;"	d
+ZMQ_MAX_SOCKETS	deps/include/zmq.h	/^#define ZMQ_MAX_SOCKETS /;"	d
+ZMQ_MAX_SOCKETS_DFLT	deps/include/zmq.h	/^#define ZMQ_MAX_SOCKETS_DFLT /;"	d
+ZMQ_MECHANISM	deps/include/zmq.h	/^#define ZMQ_MECHANISM /;"	d
+ZMQ_MORE	deps/include/zmq.h	/^#define ZMQ_MORE /;"	d
+ZMQ_MULTICAST_HOPS	deps/include/zmq.h	/^#define ZMQ_MULTICAST_HOPS /;"	d
+ZMQ_NOBLOCK	deps/include/zmq.h	/^#define ZMQ_NOBLOCK /;"	d
+ZMQ_NULL	deps/include/zmq.h	/^#define ZMQ_NULL /;"	d
+ZMQ_PAIR	deps/include/zmq.h	/^#define ZMQ_PAIR /;"	d
+ZMQ_PLAIN	deps/include/zmq.h	/^#define ZMQ_PLAIN /;"	d
+ZMQ_PLAIN_PASSWORD	deps/include/zmq.h	/^#define ZMQ_PLAIN_PASSWORD /;"	d
+ZMQ_PLAIN_SERVER	deps/include/zmq.h	/^#define ZMQ_PLAIN_SERVER /;"	d
+ZMQ_PLAIN_USERNAME	deps/include/zmq.h	/^#define ZMQ_PLAIN_USERNAME /;"	d
+ZMQ_POLLERR	deps/include/zmq.h	/^#define ZMQ_POLLERR /;"	d
+ZMQ_POLLIN	deps/include/zmq.h	/^#define ZMQ_POLLIN /;"	d
+ZMQ_POLLITEMS_DFLT	deps/include/zmq.h	/^#define ZMQ_POLLITEMS_DFLT /;"	d
+ZMQ_POLLOUT	deps/include/zmq.h	/^#define ZMQ_POLLOUT /;"	d
+ZMQ_PROBE_ROUTER	deps/include/zmq.h	/^#define ZMQ_PROBE_ROUTER /;"	d
+ZMQ_PUB	deps/include/zmq.h	/^#define ZMQ_PUB /;"	d
+ZMQ_PULL	deps/include/zmq.h	/^#define ZMQ_PULL /;"	d
+ZMQ_PUSH	deps/include/zmq.h	/^#define ZMQ_PUSH /;"	d
+ZMQ_QUEUE	deps/include/zmq.h	/^#define ZMQ_QUEUE /;"	d
+ZMQ_RATE	deps/include/zmq.h	/^#define ZMQ_RATE /;"	d
+ZMQ_RCVBUF	deps/include/zmq.h	/^#define ZMQ_RCVBUF /;"	d
+ZMQ_RCVHWM	deps/include/zmq.h	/^#define ZMQ_RCVHWM /;"	d
+ZMQ_RCVMORE	deps/include/zmq.h	/^#define ZMQ_RCVMORE /;"	d
+ZMQ_RCVTIMEO	deps/include/zmq.h	/^#define ZMQ_RCVTIMEO /;"	d
+ZMQ_RECONNECT_IVL	deps/include/zmq.h	/^#define ZMQ_RECONNECT_IVL /;"	d
+ZMQ_RECONNECT_IVL_MAX	deps/include/zmq.h	/^#define ZMQ_RECONNECT_IVL_MAX /;"	d
+ZMQ_RECOVERY_IVL	deps/include/zmq.h	/^#define ZMQ_RECOVERY_IVL /;"	d
+ZMQ_REP	deps/include/zmq.h	/^#define ZMQ_REP /;"	d
+ZMQ_REQ	deps/include/zmq.h	/^#define ZMQ_REQ /;"	d
+ZMQ_REQ_CORRELATE	deps/include/zmq.h	/^#define ZMQ_REQ_CORRELATE /;"	d
+ZMQ_REQ_RELAXED	deps/include/zmq.h	/^#define ZMQ_REQ_RELAXED /;"	d
+ZMQ_ROUTER	deps/include/zmq.h	/^#define ZMQ_ROUTER /;"	d
+ZMQ_ROUTER_BEHAVIOR	deps/include/zmq.h	/^#define ZMQ_ROUTER_BEHAVIOR /;"	d
+ZMQ_ROUTER_HANDOVER	deps/include/zmq.h	/^#define ZMQ_ROUTER_HANDOVER /;"	d
+ZMQ_ROUTER_MANDATORY	deps/include/zmq.h	/^#define ZMQ_ROUTER_MANDATORY /;"	d
+ZMQ_ROUTER_RAW	deps/include/zmq.h	/^#define ZMQ_ROUTER_RAW /;"	d
+ZMQ_SHARED	deps/include/zmq.h	/^#define ZMQ_SHARED /;"	d
+ZMQ_SNDBUF	deps/include/zmq.h	/^#define ZMQ_SNDBUF /;"	d
+ZMQ_SNDHWM	deps/include/zmq.h	/^#define ZMQ_SNDHWM /;"	d
+ZMQ_SNDMORE	deps/include/zmq.h	/^#define ZMQ_SNDMORE /;"	d
+ZMQ_SNDTIMEO	deps/include/zmq.h	/^#define ZMQ_SNDTIMEO /;"	d
+ZMQ_SOCKET_LIMIT	deps/include/zmq.h	/^#define ZMQ_SOCKET_LIMIT /;"	d
+ZMQ_SOCKS_PROXY	deps/include/zmq.h	/^#define ZMQ_SOCKS_PROXY /;"	d
+ZMQ_SRCFD	deps/include/zmq.h	/^#define ZMQ_SRCFD /;"	d
+ZMQ_STREAM	deps/include/zmq.h	/^#define ZMQ_STREAM /;"	d
+ZMQ_STREAMER	deps/include/zmq.h	/^#define ZMQ_STREAMER /;"	d
+ZMQ_SUB	deps/include/zmq.h	/^#define ZMQ_SUB /;"	d
+ZMQ_SUBSCRIBE	deps/include/zmq.h	/^#define ZMQ_SUBSCRIBE /;"	d
+ZMQ_TCP_ACCEPT_FILTER	deps/include/zmq.h	/^#define ZMQ_TCP_ACCEPT_FILTER /;"	d
+ZMQ_TCP_KEEPALIVE	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE /;"	d
+ZMQ_TCP_KEEPALIVE_CNT	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_CNT /;"	d
+ZMQ_TCP_KEEPALIVE_IDLE	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_IDLE /;"	d
+ZMQ_TCP_KEEPALIVE_INTVL	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_INTVL /;"	d
+ZMQ_THREAD_PRIORITY	deps/include/zmq.h	/^#define ZMQ_THREAD_PRIORITY /;"	d
+ZMQ_THREAD_PRIORITY_DFLT	deps/include/zmq.h	/^#define ZMQ_THREAD_PRIORITY_DFLT /;"	d
+ZMQ_THREAD_SCHED_POLICY	deps/include/zmq.h	/^#define ZMQ_THREAD_SCHED_POLICY /;"	d
+ZMQ_THREAD_SCHED_POLICY_DFLT	deps/include/zmq.h	/^#define ZMQ_THREAD_SCHED_POLICY_DFLT /;"	d
+ZMQ_TOS	deps/include/zmq.h	/^#define ZMQ_TOS /;"	d
+ZMQ_TYPE	deps/include/zmq.h	/^#define ZMQ_TYPE /;"	d
+ZMQ_UNSUBSCRIBE	deps/include/zmq.h	/^#define ZMQ_UNSUBSCRIBE /;"	d
+ZMQ_VERSION	deps/include/zmq.h	/^#define ZMQ_VERSION /;"	d
+ZMQ_VERSION_MAJOR	deps/include/zmq.h	/^#define ZMQ_VERSION_MAJOR /;"	d
+ZMQ_VERSION_MINOR	deps/include/zmq.h	/^#define ZMQ_VERSION_MINOR /;"	d
+ZMQ_VERSION_PATCH	deps/include/zmq.h	/^#define ZMQ_VERSION_PATCH /;"	d
+ZMQ_XPUB	deps/include/zmq.h	/^#define ZMQ_XPUB /;"	d
+ZMQ_XPUB_NODROP	deps/include/zmq.h	/^#define ZMQ_XPUB_NODROP /;"	d
+ZMQ_XPUB_VERBOSE	deps/include/zmq.h	/^#define ZMQ_XPUB_VERBOSE /;"	d
+ZMQ_XREP	deps/include/zmq.h	/^#define ZMQ_XREP /;"	d
+ZMQ_XREQ	deps/include/zmq.h	/^#define ZMQ_XREQ /;"	d
+ZMQ_XSUB	deps/include/zmq.h	/^#define ZMQ_XSUB /;"	d
+ZMQ_ZAP_DOMAIN	deps/include/zmq.h	/^#define ZMQ_ZAP_DOMAIN /;"	d
+ZPull	include/ps/kv_app.h	/^  int ZPull(const SArray<Key>& keys,$/;"	f	class:ps::KVWorker
+ZPush	include/ps/kv_app.h	/^  int ZPush(const SArray<Key>& keys,$/;"	f	class:ps::KVWorker
+ZeroCopyInputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^  inline ZeroCopyInputStream() {}$/;"	f	class:google::protobuf::io::ZeroCopyInputStream
+ZeroCopyInputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^class LIBPROTOBUF_EXPORT ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
+ZeroCopyOutputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^  inline ZeroCopyOutputStream() {}$/;"	f	class:google::protobuf::io::ZeroCopyOutputStream
+ZeroCopyOutputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^class LIBPROTOBUF_EXPORT ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
+ZigZagDecode32	deps/include/google/protobuf/wire_format_lite.h	/^inline int32 WireFormatLite::ZigZagDecode32(uint32 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+ZigZagDecode64	deps/include/google/protobuf/wire_format_lite.h	/^inline int64 WireFormatLite::ZigZagDecode64(uint64 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+ZigZagEncode32	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::ZigZagEncode32(int32 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+ZigZagEncode64	deps/include/google/protobuf/wire_format_lite.h	/^inline uint64 WireFormatLite::ZigZagEncode64(int64 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
+ZlibErrorCode	deps/include/google/protobuf/io/gzip_stream.h	/^  inline int ZlibErrorCode() const {$/;"	f	class:google::protobuf::io::GzipInputStream
+ZlibErrorCode	deps/include/google/protobuf/io/gzip_stream.h	/^  inline int ZlibErrorCode() const {$/;"	f	class:google::protobuf::io::GzipOutputStream
+ZlibErrorMessage	deps/include/google/protobuf/io/gzip_stream.h	/^  inline const char* ZlibErrorMessage() const {$/;"	f	class:google::protobuf::io::GzipInputStream
+ZlibErrorMessage	deps/include/google/protobuf/io/gzip_stream.h	/^  inline const char* ZlibErrorMessage() const {$/;"	f	class:google::protobuf::io::GzipOutputStream
+_	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	m	struct:zmq_msg_t
+_GetSharedRef	include/ps/internal/env.h	/^  static inline std::shared_ptr<Environment> _GetSharedRef() {$/;"	f	class:ps::Environment
+_GetSharedRef	include/ps/internal/env.h	/^  static std::shared_ptr<Environment> _GetSharedRef($/;"	f	class:ps::Environment
+_HELPER	tests/lint.py	/^_HELPER = LintHelper()$/;"	v
+__ZMQ_H_INCLUDED__	deps/include/zmq.h	/^#define __ZMQ_H_INCLUDED__$/;"	d
+__del__	tracker/tracker.py	/^    def __del__(self):$/;"	m	class:RabitTracker	file:
+__init__	tests/lint.py	/^    def __init__(self):$/;"	m	class:LintHelper
+__init__	tracker/dmlc_local.py	/^    def __init__(self, args, unknown):$/;"	m	class:LocalLauncher
+__init__	tracker/dmlc_ssh.py	/^    def __init__(self, args, unknown):$/;"	m	class:SSHLauncher
+__init__	tracker/tracker.py	/^    def __init__(self, hostIP, cmd, port = 9091, port_end = 9999, envs = {}):$/;"	m	class:PSTracker
+__init__	tracker/tracker.py	/^    def __init__(self, hostIP, nslave, port = 9091, port_end = 9999):$/;"	m	class:RabitTracker
+__init__	tracker/tracker.py	/^    def __init__(self, sock):$/;"	m	class:ExSocket
+__init__	tracker/tracker.py	/^    def __init__(self, sock, s_addr):$/;"	m	class:SlaveEntry
+_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::DescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumValueOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FieldOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileDescriptorSet
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MessageOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MethodOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::ServiceOptions
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::SourceCodeInfo
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::UninterpretedOption
+_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+_cpplint_state	tests/lint.py	/^from cpplint import _cpplint_state$/;"	i
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::EnumOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::EnumValueOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::FieldOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::FileOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::MessageOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::MethodOptions
+_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::ServiceOptions
+_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumValueOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::FileDescriptorSet
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::MethodOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::ServiceOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::SourceCodeInfo
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(10 + 31) \/ 32];$/;"	m	class:google::protobuf::FileOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(11 + 31) \/ 32];$/;"	m	class:google::protobuf::FileDescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumDescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::MessageOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::ServiceDescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(4 + 31) \/ 32];$/;"	m	class:google::protobuf::MethodDescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(4 + 31) \/ 32];$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::DescriptorProto
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::FieldOptions
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::UninterpretedOption
+_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(8 + 31) \/ 32];$/;"	m	class:google::protobuf::FieldDescriptorProto
+_path_cached_byte_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _path_cached_byte_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+_print_summary_map	tests/lint.py	/^    def _print_summary_map(strm, result_map, ftype):$/;"	m	class:LintHelper
+_span_cached_byte_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _span_cached_byte_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::DescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumValueOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FieldOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileDescriptorSet
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MessageOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MethodOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::ServiceOptions
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::SourceCodeInfo
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::UninterpretedOption
+_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+accept_slaves	tracker/tracker.py	/^    def accept_slaves(self, nslave):$/;"	m	class:RabitTracker
+access	src/windows/unistd.h	/^#define access /;"	d
+acked_	src/resender.h	/^  std::unordered_set<uint64_t> acked_;$/;"	m	class:ps::Resender
+add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::add_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::add_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
+add_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::add_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_extension() {$/;"	f	class:google::protobuf::DescriptorProto
+add_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::add_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::add_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
+add_field	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_field() {$/;"	f	class:google::protobuf::DescriptorProto
+add_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::add_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+add_file	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::add_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
+add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::add_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+add_location	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::add_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
+add_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* FileDescriptorProto::add_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_method	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::add_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+add_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::add_name() {$/;"	f	class:google::protobuf::UninterpretedOption
+add_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* DescriptorProto::add_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
+add_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::add_path(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+add_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::add_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+add_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_public_dependency(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference { typedef T& type; };$/;"	s	namespace:google::protobuf::internal
+add_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference<T&> { typedef T& type; };$/;"	s	namespace:google::protobuf::internal
+add_service	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::add_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
+add_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::add_span(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumValueOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FieldOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FileOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MessageOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MethodOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
+add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* ServiceOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
+add_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::add_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+add_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_weak_dependency(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::aggregate_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+aggregate_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* aggregate_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+aliasing_enabled_	deps/include/google/protobuf/io/coded_stream.h	/^  bool aliasing_enabled_;$/;"	m	class:google::protobuf::io::CodedInputStream
+alignof	include/dmlc/base.h	/^#define alignof /;"	d
+allocated_size_	deps/include/google/protobuf/repeated_field.h	/^  int    allocated_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
+allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumOptions::allow_alias() const {$/;"	f	class:google::protobuf::EnumOptions
+allow_alias_	deps/include/google/protobuf/descriptor.pb.h	/^  bool allow_alias_;$/;"	m	class:google::protobuf::EnumOptions
+allow_f_after_float_	deps/include/google/protobuf/io/tokenizer.h	/^  bool allow_f_after_float_;$/;"	m	class:google::protobuf::io::Tokenizer
+allow_partial_	deps/include/google/protobuf/text_format.h	/^    bool allow_partial_;$/;"	m	class:google::protobuf::TextFormat::Parser
+allow_unknown_	deps/include/google/protobuf/descriptor.h	/^  bool allow_unknown_;$/;"	m	class:google::protobuf::DescriptorPool
+allow_unknown_field_	deps/include/google/protobuf/text_format.h	/^    bool allow_unknown_field_;$/;"	m	class:google::protobuf::TextFormat::Parser
+and_	deps/include/google/protobuf/stubs/template_util.h	/^struct and_ : public integral_constant<bool, (A::value && B::value)> {$/;"	s	namespace:google::protobuf::internal
+append	include/ps/sarray.h	/^  void append(const SArray<V>& arr) {$/;"	f	class:ps::SArray
+arg	deps/include/google/protobuf/extension_set.h	/^    const void* arg;$/;"	m	struct:google::protobuf::internal::ExtensionInfo::EnumValidityCheck
+arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
+arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
+arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::MethodClosure1
+arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::MethodClosure2
+arg2_	deps/include/google/protobuf/stubs/common.h	/^  Arg2 arg2_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
+arg2_	deps/include/google/protobuf/stubs/common.h	/^  Arg2 arg2_;$/;"	m	class:google::protobuf::internal::MethodClosure2
+argparse	tracker/dmlc_local.py	/^import argparse$/;"	i
+argparse	tracker/dmlc_mpi.py	/^import argparse$/;"	i
+argparse	tracker/dmlc_ssh.py	/^import argparse$/;"	i
+array_	deps/include/google/protobuf/stubs/common.h	/^  C* array_;$/;"	m	class:google::protobuf::internal::scoped_array
+assign_rank	tracker/tracker.py	/^    def assign_rank(self, rank, wait_conn, tree_map, parent_map, ring_map):$/;"	m	class:SlaveEntry
+at_start_of_line_	deps/include/google/protobuf/io/printer.h	/^  bool at_start_of_line_;$/;"	m	class:google::protobuf::io::Printer
+author	docs/conf.py	/^author = u'ps-lite developers'$/;"	v
+back	include/ps/sarray.h	/^  inline V back() const { CHECK(!empty()); return data()[size_-1]; }$/;"	f	class:ps::SArray
+backup_bytes_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int backup_bytes_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+barrier_cond_	include/ps/internal/postoffice.h	/^  std::condition_variable barrier_cond_;$/;"	m	class:ps::Postoffice
+barrier_count_	include/ps/internal/van.h	/^  std::vector<int> barrier_count_;$/;"	m	class:ps::Van
+barrier_done_	include/ps/internal/postoffice.h	/^  bool barrier_done_;$/;"	m	class:ps::Postoffice
+barrier_group	include/ps/internal/message.h	/^  int barrier_group;$/;"	m	struct:ps::Control
+barrier_mu_	include/ps/internal/postoffice.h	/^  std::mutex barrier_mu_;$/;"	m	class:ps::Postoffice
+begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::begin() const {$/;"	f	class:google::protobuf::RepeatedField
+begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::begin() {$/;"	f	class:google::protobuf::RepeatedField
+begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::begin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::begin() {$/;"	f	class:google::protobuf::RepeatedPtrField
+begin	include/ps/range.h	/^  uint64_t begin() const { return begin_; }$/;"	f	class:ps::Range
+begin	include/ps/sarray.h	/^  inline V* begin() { return data(); }$/;"	f	class:ps::SArray
+begin	include/ps/sarray.h	/^  inline const V* begin() const { return data(); }$/;"	f	class:ps::SArray
+begin_	include/ps/range.h	/^  uint64_t begin_;$/;"	m	class:ps::Range
+big_	deps/include/google/protobuf/stubs/template_util.h	/^struct big_ {$/;"	s	namespace:google::protobuf::internal
+block_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int block_size_;     \/\/ How many bytes to return at a time.$/;"	m	class:google::protobuf::io::ArrayInputStream
+block_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int block_size_;     \/\/ How many bytes to return at a time.$/;"	m	class:google::protobuf::io::ArrayOutputStream
+body	include/ps/internal/message.h	/^  std::string body;$/;"	m	struct:ps::Meta
+body	include/ps/simple_app.h	/^  std::string body;$/;"	m	struct:ps::SimpleData
+bool_value	deps/include/google/protobuf/extension_set.h	/^      bool                  bool_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+breathe_default_project	docs/conf.py	/^breathe_default_project = 'ps-lite'$/;"	v
+breathe_projects	docs/conf.py	/^breathe_projects = {'ps-lite' : 'xml\/'}$/;"	v
+buffer_	deps/include/google/protobuf/io/coded_stream.h	/^  const uint8* buffer_;$/;"	m	class:google::protobuf::io::CodedInputStream
+buffer_	deps/include/google/protobuf/io/coded_stream.h	/^  uint8* buffer_;$/;"	m	class:google::protobuf::io::CodedOutputStream
+buffer_	deps/include/google/protobuf/io/printer.h	/^  char* buffer_;$/;"	m	class:google::protobuf::io::Printer
+buffer_	deps/include/google/protobuf/io/tokenizer.h	/^  const char* buffer_;      \/\/ Current buffer returned from input_.$/;"	m	class:google::protobuf::io::Tokenizer
+buffer_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  scoped_array<uint8> buffer_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+buffer_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  scoped_array<uint8> buffer_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+buffer_end_	deps/include/google/protobuf/io/coded_stream.h	/^  const uint8* buffer_end_;     \/\/ pointer to the end of the buffer.$/;"	m	class:google::protobuf::io::CodedInputStream
+buffer_pos_	deps/include/google/protobuf/io/tokenizer.h	/^  int buffer_pos_;          \/\/ Current position within the buffer.$/;"	m	class:google::protobuf::io::Tokenizer
+buffer_size	deps/include/google/protobuf/io/gzip_stream.h	/^    int buffer_size;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
+buffer_size_	deps/include/google/protobuf/io/coded_stream.h	/^  int buffer_size_;$/;"	m	class:google::protobuf::io::CodedOutputStream
+buffer_size_	deps/include/google/protobuf/io/printer.h	/^  int buffer_size_;$/;"	m	class:google::protobuf::io::Printer
+buffer_size_	deps/include/google/protobuf/io/tokenizer.h	/^  int buffer_size_;         \/\/ Size of buffer_.$/;"	m	class:google::protobuf::io::Tokenizer
+buffer_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int buffer_size_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+buffer_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int buffer_size_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+buffer_size_after_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int buffer_size_after_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
+buffer_used_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int buffer_used_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+buffer_used_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int buffer_used_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+by_extension_	deps/include/google/protobuf/descriptor_database.h	/^    map<pair<string, int>, Value> by_extension_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
+by_name_	deps/include/google/protobuf/descriptor_database.h	/^    map<string, Value> by_name_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
+by_symbol_	deps/include/google/protobuf/descriptor_database.h	/^    map<string, Value> by_symbol_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
+bytes_retired_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int64 bytes_retired_;  \/\/ Bytes read from previous streams.$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
+cached_size	deps/include/google/protobuf/extension_set.h	/^    mutable int cached_size;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+callbacks_	include/ps/kv_app.h	/^  std::unordered_map<int, Callback> callbacks_;$/;"	m	class:ps::KVWorker
+camelcase_name_	deps/include/google/protobuf/descriptor.h	/^  const string* camelcase_name_;$/;"	m	class:google::protobuf::FieldDescriptor
+capacity	include/ps/sarray.h	/^  inline size_t capacity() const { return capacity_; }$/;"	f	class:ps::SArray
+capacity_	include/ps/sarray.h	/^  size_t capacity_ = 0;$/;"	m	class:ps::SArray
+cast	deps/include/google/protobuf/repeated_field.h	/^  static inline const typename TypeHandler::Type* cast(const void* element) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+cast	deps/include/google/protobuf/repeated_field.h	/^  static inline typename TypeHandler::Type* cast(void* element) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::cc_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+cc_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool cc_generic_services_;$/;"	m	class:google::protobuf::FileOptions
+chdir	src/windows/unistd.h	/^#define chdir /;"	d
+choices	tracker/dmlc_mpi.py	/^                    choices=['INFO', 'DEBUG'],$/;"	v
+clear	include/ps/sarray.h	/^  void clear() { reset(nullptr, 0, [](V* data) {}); }$/;"	f	class:ps::SArray
+clear_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
+clear_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_ctype() {$/;"	f	class:google::protobuf::FieldOptions
+clear_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
+clear_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+clear_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+clear_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
+clear_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_extension() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_field	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_field() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+clear_file	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorSet::clear_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
+clear_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+clear_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_go_package() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_has_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
+clear_has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_ctype() {$/;"	f	class:google::protobuf::FieldOptions
+clear_has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
+clear_has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_has_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+clear_has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_has_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+clear_has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
+clear_has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_go_package() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_has_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+clear_has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_package() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_lazy() {$/;"	f	class:google::protobuf::FieldOptions
+clear_has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_has_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_has_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
+clear_has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+clear_has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_has_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+clear_has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_has_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
+clear_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+clear_has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_packed() {$/;"	f	class:google::protobuf::FieldOptions
+clear_has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_has_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+clear_has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_has_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+clear_has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_has_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_weak() {$/;"	f	class:google::protobuf::FieldOptions
+clear_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+clear_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
+clear_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
+clear_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
+clear_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_package() {$/;"	f	class:google::protobuf::FileOptions
+clear_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_lazy() {$/;"	f	class:google::protobuf::FieldOptions
+clear_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_location	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo::clear_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
+clear_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
+clear_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_method	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+clear_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_name() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_name() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+clear_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
+clear_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_options() {$/;"	f	class:google::protobuf::DescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+clear_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+clear_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_packed() {$/;"	f	class:google::protobuf::FieldOptions
+clear_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+clear_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_path() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+clear_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_public_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+clear_service	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
+clear_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_span() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+clear_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+clear_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+clear_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
+clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
+clear_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+clear_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_weak() {$/;"	f	class:google::protobuf::FieldOptions
+clear_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_weak_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+close_on_delete_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool close_on_delete_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+close_on_delete_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool close_on_delete_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+cmd	include/ps/internal/message.h	/^  Command cmd;$/;"	m	struct:ps::Control
+cmd	include/ps/kv_app.h	/^  int cmd;$/;"	m	struct:ps::KVMeta
+codec_type_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string codec_type_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+codecs	tests/lint.py	/^import codecs$/;"	i
+column	deps/include/google/protobuf/io/tokenizer.h	/^    int column;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
+column	deps/include/google/protobuf/text_format.h	/^    int column;$/;"	m	struct:google::protobuf::TextFormat::ParseLocation
+column_	deps/include/google/protobuf/io/tokenizer.h	/^  int column_;$/;"	m	class:google::protobuf::io::Tokenizer
+comment_style_	deps/include/google/protobuf/io/tokenizer.h	/^  CommentStyle comment_style_;$/;"	m	class:google::protobuf::io::Tokenizer
+compiler	deps/include/google/protobuf/compiler/code_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/importer.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/parser.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/plugin.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compiler	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
+compression_level	deps/include/google/protobuf/io/gzip_stream.h	/^    int compression_level;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
+compression_strategy	deps/include/google/protobuf/io/gzip_stream.h	/^    int compression_strategy;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
+cond_	include/ps/internal/threadsafe_queue.h	/^  std::condition_variable cond_;$/;"	m	class:ps::ThreadsafeQueue
+config_logger	tracker/tracker.py	/^def config_logger(args):$/;"	f
+const_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef const Element* const_iterator;$/;"	t	class:google::protobuf::RepeatedField
+const_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef internal::RepeatedPtrIterator<const Element> const_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+const_pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type* const_pointer;$/;"	t	class:google::protobuf::RepeatedField
+const_pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type* const_pointer;$/;"	t	class:google::protobuf::RepeatedPtrField
+const_pointer_iterator	deps/include/google/protobuf/repeated_field.h	/^  const_pointer_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+const_reference	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type& const_reference;$/;"	t	class:google::protobuf::RepeatedField
+const_reference	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type& const_reference;$/;"	t	class:google::protobuf::RepeatedPtrField
+const_reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;$/;"	t	class:google::protobuf::RepeatedField
+const_reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+constexpr	include/dmlc/base.h	/^#define constexpr /;"	d
+containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::Descriptor
+containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::EnumDescriptor
+containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::FieldDescriptor
+containing_type_	deps/include/google/protobuf/extension_set.h	/^  const MessageLite* containing_type_;$/;"	m	class:google::protobuf::internal::GeneratedExtensionFinder
+content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::content() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+content_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* content_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+context_	src/zmq_van.h	/^  void *context_ = nullptr;$/;"	m	class:ps::ZMQVan
+control	include/ps/internal/message.h	/^  Control control;$/;"	m	struct:ps::Meta
+copying_input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingFileInputStream copying_input_;$/;"	m	class:google::protobuf::io::FileInputStream
+copying_input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingIstreamInputStream copying_input_;$/;"	m	class:google::protobuf::io::IstreamInputStream
+copying_output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingFileOutputStream copying_output_;$/;"	m	class:google::protobuf::io::FileOutputStream
+copying_output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOstreamOutputStream copying_output_;$/;"	m	class:google::protobuf::io::OstreamOutputStream
+copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  CopyingInputStream* copying_stream_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  CopyingOutputStream* copying_stream_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+copyright	docs/conf.py	/^copyright = u'2016, ps-lite developers'$/;"	v
+cpp	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace cpp {$/;"	n	namespace:google::protobuf::compiler
+cpp_type	deps/include/google/protobuf/descriptor.h	/^inline FieldDescriptor::CppType FieldDescriptor::cpp_type() const {$/;"	f	class:google::protobuf::FieldDescriptor
+cpp_type_name	deps/include/google/protobuf/descriptor.h	/^inline const char* FieldDescriptor::cpp_type_name() const {$/;"	f	class:google::protobuf::FieldDescriptor
+cpplint	tests/lint.py	/^import cpplint$/;"	i
+ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions_CType FieldOptions::ctype() const {$/;"	f	class:google::protobuf::FieldOptions
+ctype_	deps/include/google/protobuf/descriptor.pb.h	/^  int ctype_;$/;"	m	class:google::protobuf::FieldOptions
+curr_path	docs/conf.py	/^curr_path = os.path.dirname(os.path.abspath(os.path.expanduser(__file__)))$/;"	v
+current	deps/include/google/protobuf/io/tokenizer.h	/^inline const Tokenizer::Token& Tokenizer::current() {$/;"	f	class:google::protobuf::io::Tokenizer
+current_	deps/include/google/protobuf/io/tokenizer.h	/^  Token current_;           \/\/ Returned by current().$/;"	m	class:google::protobuf::io::Tokenizer
+current_char_	deps/include/google/protobuf/io/tokenizer.h	/^  char current_char_;       \/\/ == buffer_[buffer_pos_], updated by NextChar().$/;"	m	class:google::protobuf::io::Tokenizer
+current_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  Limit current_limit_;   \/\/ if position = -1, no limit is applied$/;"	m	class:google::protobuf::io::CodedInputStream
+current_size_	deps/include/google/protobuf/repeated_field.h	/^  int      current_size_;$/;"	m	class:google::protobuf::RepeatedField
+current_size_	deps/include/google/protobuf/repeated_field.h	/^  int    current_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
+customer_id	include/ps/internal/message.h	/^  int customer_id;$/;"	m	struct:ps::Meta
+customers_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, Customer*> customers_;$/;"	m	class:ps::Postoffice
+data	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::data() const {$/;"	f	class:google::protobuf::internal::TypeHandler::RepeatedPtrFieldBase
+data	deps/include/google/protobuf/repeated_field.h	/^inline const Element* RepeatedField<Element>::data() const {$/;"	f	class:google::protobuf::RepeatedField
+data	deps/include/google/protobuf/repeated_field.h	/^inline const Element* const* RepeatedPtrField<Element>::data() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+data	include/ps/internal/message.h	/^  std::vector<SArray<char> > data;$/;"	m	struct:ps::Message
+data	include/ps/sarray.h	/^  inline V* data() const { return ptr_.get(); }$/;"	f	class:ps::SArray
+data_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const uint8* const data_;  \/\/ The byte array.$/;"	m	class:google::protobuf::io::ArrayInputStream
+data_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  uint8* const data_;        \/\/ The byte array.$/;"	m	class:google::protobuf::io::ArrayOutputStream
+data_type	include/ps/internal/message.h	/^  std::vector<DataType> data_type;$/;"	m	struct:ps::Meta
+database_	deps/include/google/protobuf/compiler/importer.h	/^  SourceTreeDescriptorDatabase database_;$/;"	m	class:google::protobuf::compiler::Importer
+decide_rank	tracker/tracker.py	/^    def decide_rank(self, job_map):$/;"	m	class:SlaveEntry
+default_error_collector_	deps/include/google/protobuf/descriptor.h	/^  ErrorCollector* default_error_collector_;$/;"	m	class:google::protobuf::DescriptorPool
+default_instance	deps/include/google/protobuf/repeated_field.h	/^  static const Type& default_instance() { return Type::default_instance(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+default_instance	deps/include/google/protobuf/repeated_field.h	/^  static const Type& default_instance() {$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
+default_instance	deps/include/google/protobuf/repeated_field.h	/^inline const Message& GenericTypeHandler<Message>::default_instance() {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+default_instance	deps/include/google/protobuf/repeated_field.h	/^inline const MessageLite& GenericTypeHandler<MessageLite>::default_instance() {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
+default_instance	src/meta.pb.cc	/^const PBControl& PBControl::default_instance() {$/;"	f	class:ps::PBControl
+default_instance	src/meta.pb.cc	/^const PBMeta& PBMeta::default_instance() {$/;"	f	class:ps::PBMeta
+default_instance	src/meta.pb.cc	/^const PBNode& PBNode::default_instance() {$/;"	f	class:ps::PBNode
+default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorRequest* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorResponse* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorResponse_File* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static DescriptorProto* default_instance_;$/;"	m	class:google::protobuf::DescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static DescriptorProto_ExtensionRange* default_instance_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumOptions* default_instance_;$/;"	m	class:google::protobuf::EnumOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumValueDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumValueOptions* default_instance_;$/;"	m	class:google::protobuf::EnumValueOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FieldDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FieldOptions* default_instance_;$/;"	m	class:google::protobuf::FieldOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::FileDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileDescriptorSet* default_instance_;$/;"	m	class:google::protobuf::FileDescriptorSet
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileOptions* default_instance_;$/;"	m	class:google::protobuf::FileOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MessageOptions* default_instance_;$/;"	m	class:google::protobuf::MessageOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MethodDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MethodOptions* default_instance_;$/;"	m	class:google::protobuf::MethodOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static ServiceDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static ServiceOptions* default_instance_;$/;"	m	class:google::protobuf::ServiceOptions
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static SourceCodeInfo* default_instance_;$/;"	m	class:google::protobuf::SourceCodeInfo
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static SourceCodeInfo_Location* default_instance_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static UninterpretedOption* default_instance_;$/;"	m	class:google::protobuf::UninterpretedOption
+default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static UninterpretedOption_NamePart* default_instance_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+default_instance_	deps/include/google/protobuf/generated_message_reflection.h	/^  const Message* default_instance_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+default_instance_	src/meta.pb.cc	/^PBControl* PBControl::default_instance_ = NULL;$/;"	m	class:ps::PBControl	file:
+default_instance_	src/meta.pb.cc	/^PBMeta* PBMeta::default_instance_ = NULL;$/;"	m	class:ps::PBMeta	file:
+default_instance_	src/meta.pb.cc	/^PBNode* PBNode::default_instance_ = NULL;$/;"	m	class:ps::PBNode	file:
+default_recursion_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  static int default_recursion_limit_;  \/\/ 100 by default.$/;"	m	class:google::protobuf::io::CodedInputStream
+default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::default_value() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+default_value	deps/include/google/protobuf/extension_set.h	/^  typename TypeTraits::ConstType default_value() const {$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
+default_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* default_value_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+default_value_	deps/include/google/protobuf/extension_set.h	/^  typename TypeTraits::ConstType default_value_;$/;"	m	class:google::protobuf::internal::ExtensionIdentifier
+default_value_bool_	deps/include/google/protobuf/descriptor.h	/^    bool   default_value_bool_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_double_	deps/include/google/protobuf/descriptor.h	/^    double default_value_double_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_enum_	deps/include/google/protobuf/descriptor.h	/^    const EnumValueDescriptor* default_value_enum_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_float_	deps/include/google/protobuf/descriptor.h	/^    float  default_value_float_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_int32_	deps/include/google/protobuf/descriptor.h	/^    int32  default_value_int32_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_int64_	deps/include/google/protobuf/descriptor.h	/^    int64  default_value_int64_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_string_	deps/include/google/protobuf/descriptor.h	/^    const string* default_value_string_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_uint32_	deps/include/google/protobuf/descriptor.h	/^    uint32 default_value_uint32_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+default_value_uint64_	deps/include/google/protobuf/descriptor.h	/^    uint64 default_value_uint64_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
+delegate_to_generated_factory_	deps/include/google/protobuf/dynamic_message.h	/^  bool delegate_to_generated_factory_;$/;"	m	class:google::protobuf::DynamicMessageFactory
+dependencies_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor** dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
+dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptor
+dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::std::string> dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
+dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
+dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::deprecated() const {$/;"	f	class:google::protobuf::FieldOptions
+deprecated_	deps/include/google/protobuf/descriptor.pb.h	/^  bool deprecated_;$/;"	m	class:google::protobuf::FieldOptions
+desc	deps/include/google/protobuf/extension_set.h	/^#define desc /;"	d
+desc	deps/include/google/protobuf/extension_set.h	/^#undef desc$/;"	d
+descriptor	deps/include/google/protobuf/extension_set.h	/^    const FieldDescriptor* descriptor;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+descriptor	deps/include/google/protobuf/extension_set.h	/^  const FieldDescriptor* descriptor;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
+descriptor	deps/include/google/protobuf/message.h	/^  const Descriptor* descriptor;$/;"	m	struct:google::protobuf::Metadata
+descriptor_	deps/include/google/protobuf/generated_message_reflection.h	/^  const Descriptor* descriptor_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+descriptor_pool_	deps/include/google/protobuf/generated_message_reflection.h	/^  const DescriptorPool* descriptor_pool_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+descriptor_set_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string descriptor_set_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef ptrdiff_t difference_type;$/;"	t	class:google::protobuf::RepeatedField
+difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef ptrdiff_t difference_type;$/;"	t	class:google::protobuf::RepeatedPtrField
+difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::difference_type difference_type;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
+difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::difference_type difference_type;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+disallow_services_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool disallow_services_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+disk_path	deps/include/google/protobuf/compiler/importer.h	/^    string disk_path;$/;"	m	struct:google::protobuf::compiler::DiskSourceTree::Mapping
+dmlc	include/dmlc/base.h	/^namespace dmlc {$/;"	n
+dmlc	include/dmlc/logging.h	/^namespace dmlc {$/;"	n
+doc_root	docs/conf.py	/^doc_root = 'http:\/\/dmlc.ml'$/;"	v
+double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline double UninterpretedOption::double_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+double_value	deps/include/google/protobuf/extension_set.h	/^      double                double_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+double_value_	deps/include/google/protobuf/descriptor.pb.h	/^  double double_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+down_cast	deps/include/google/protobuf/stubs/common.h	/^inline To down_cast(From* f) {                   \/\/ so we only accept pointers$/;"	f	namespace:google::protobuf::internal
+drop_rate_	include/ps/internal/van.h	/^  int drop_rate_ = 0;$/;"	m	class:ps::Van
+dummy	deps/include/google/protobuf/stubs/template_util.h	/^  char dummy[2];$/;"	m	struct:google::protobuf::internal::big_
+dup2	src/windows/unistd.h	/^#define dup2 /;"	d
+dynamic_cast_if_available	deps/include/google/protobuf/generated_message_reflection.h	/^inline To dynamic_cast_if_available(From from) {$/;"	f	namespace:google::protobuf::internal
+element_type	deps/include/google/protobuf/stubs/common.h	/^  typedef C element_type;$/;"	t	class:google::protobuf::internal::scoped_array
+element_type	deps/include/google/protobuf/stubs/common.h	/^  typedef C element_type;$/;"	t	class:google::protobuf::internal::scoped_ptr
+elements_	deps/include/google/protobuf/repeated_field.h	/^  Element* elements_;$/;"	m	class:google::protobuf::RepeatedField
+elements_	deps/include/google/protobuf/repeated_field.h	/^  void** elements_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
+empty	deps/include/google/protobuf/unknown_field_set.h	/^inline bool UnknownFieldSet::empty() const {$/;"	f	class:google::protobuf::UnknownFieldSet
+empty	include/ps/internal/message.h	/^  inline bool empty() const { return cmd == EMPTY; }$/;"	f	struct:ps::Control
+empty	include/ps/sarray.h	/^  inline bool empty() const { return size() == 0; }$/;"	f	class:ps::SArray
+end	deps/include/google/protobuf/descriptor.h	/^    int end;    \/\/ exclusive$/;"	m	struct:google::protobuf::Descriptor::ExtensionRange
+end	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::end() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+end	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::end() const {$/;"	f	class:google::protobuf::RepeatedField
+end	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::end() {$/;"	f	class:google::protobuf::RepeatedField
+end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::end() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::end() {$/;"	f	class:google::protobuf::RepeatedPtrField
+end	include/ps/range.h	/^  uint64_t end() const { return end_; }$/;"	f	class:ps::Range
+end	include/ps/sarray.h	/^  inline V* end() { return data() + size(); }$/;"	f	class:ps::SArray
+end	include/ps/sarray.h	/^  inline const V* end() const { return data() + size(); }$/;"	f	class:ps::SArray
+end_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 end_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+end_	include/ps/range.h	/^  uint64_t end_;$/;"	m	class:ps::Range
+end_column	deps/include/google/protobuf/descriptor.h	/^  int end_column;$/;"	m	struct:google::protobuf::SourceLocation
+end_column	deps/include/google/protobuf/io/tokenizer.h	/^    int end_column;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
+end_line	deps/include/google/protobuf/descriptor.h	/^  int end_line;$/;"	m	struct:google::protobuf::SourceLocation
+enforce_dependencies_	deps/include/google/protobuf/descriptor.h	/^  bool enforce_dependencies_;$/;"	m	class:google::protobuf::DescriptorPool
+enum_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::enum_type() const {$/;"	f	class:google::protobuf::DescriptorProto
+enum_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::enum_type() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumDescriptorProto& DescriptorProto::enum_type(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
+enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumDescriptorProto& FileDescriptorProto::enum_type(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+enum_type_	deps/include/google/protobuf/descriptor.h	/^  const EnumDescriptor* enum_type_;$/;"	m	class:google::protobuf::FieldDescriptor
+enum_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;$/;"	m	class:google::protobuf::DescriptorProto
+enum_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;$/;"	m	class:google::protobuf::FileDescriptorProto
+enum_type_count_	deps/include/google/protobuf/descriptor.h	/^  int enum_type_count_;$/;"	m	class:google::protobuf::Descriptor
+enum_type_count_	deps/include/google/protobuf/descriptor.h	/^  int enum_type_count_;$/;"	m	class:google::protobuf::FileDescriptor
+enum_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::enum_type_size() const {$/;"	f	class:google::protobuf::DescriptorProto
+enum_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::enum_type_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+enum_types_	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor* enum_types_;$/;"	m	class:google::protobuf::Descriptor
+enum_types_	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor* enum_types_;$/;"	m	class:google::protobuf::FileDescriptor
+enum_validity_check	deps/include/google/protobuf/extension_set.h	/^    EnumValidityCheck enum_validity_check;$/;"	m	union:google::protobuf::internal::ExtensionInfo::__anon2
+enum_value	deps/include/google/protobuf/extension_set.h	/^      int                   enum_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+env_ref_	include/ps/internal/postoffice.h	/^  std::shared_ptr<Environment> env_ref_;$/;"	m	class:ps::Postoffice
+epylint	tests/lint.py	/^from pylint import epylint$/;"	i
+errno_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int errno_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+errno_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int errno_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse::error() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+error_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* error_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  MultiFileErrorCollector* error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+error_collector_	deps/include/google/protobuf/compiler/parser.h	/^  io::ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::compiler::Parser
+error_collector_	deps/include/google/protobuf/io/tokenizer.h	/^  ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::io::Tokenizer
+error_collector_	deps/include/google/protobuf/text_format.h	/^    io::ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::TextFormat::Parser
+error_format_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  ErrorFormat error_format_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+events	deps/include/zmq.h	/^    short events;$/;"	m	struct:zmq_pollitem_t
+exclude_patterns	docs/conf.py	/^exclude_patterns = ['_build']$/;"	v
+exec_cmd	tracker/dmlc_local.py	/^    def exec_cmd(self, cmd, role, pass_env):$/;"	m	class:LocalLauncher
+executable_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string executable_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+execve	src/windows/unistd.h	/^#define execve /;"	d
+exit_callback_	include/ps/internal/postoffice.h	/^  Callback exit_callback_;$/;"	m	class:ps::Postoffice
+experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldOptions::experimental_map_key() const {$/;"	f	class:google::protobuf::FieldOptions
+experimental_map_key_	deps/include/google/protobuf/descriptor.h	/^  const FieldDescriptor* experimental_map_key_;$/;"	m	class:google::protobuf::FieldDescriptor
+experimental_map_key_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* experimental_map_key_;$/;"	m	class:google::protobuf::FieldOptions
+extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::extendee() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+extendee_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* extendee_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+extension	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::extension() const {$/;"	f	class:google::protobuf::DescriptorProto
+extension	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::extension() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+extension	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::extension(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
+extension	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& FileDescriptorProto::extension(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+extension_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;$/;"	m	class:google::protobuf::DescriptorProto
+extension_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;$/;"	m	class:google::protobuf::FileDescriptorProto
+extension_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_count_;$/;"	m	class:google::protobuf::Descriptor
+extension_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_count_;$/;"	m	class:google::protobuf::FileDescriptor
+extension_factory_	deps/include/google/protobuf/io/coded_stream.h	/^  MessageFactory* extension_factory_;$/;"	m	class:google::protobuf::io::CodedInputStream
+extension_pool_	deps/include/google/protobuf/io/coded_stream.h	/^  const DescriptorPool* extension_pool_;$/;"	m	class:google::protobuf::io::CodedInputStream
+extension_range	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::extension_range() const {$/;"	f	class:google::protobuf::DescriptorProto
+extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto_ExtensionRange& DescriptorProto::extension_range(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
+extension_range_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange > extension_range_;$/;"	m	class:google::protobuf::DescriptorProto
+extension_range_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_range_count_;$/;"	m	class:google::protobuf::Descriptor
+extension_range_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::extension_range_size() const {$/;"	f	class:google::protobuf::DescriptorProto
+extension_ranges_	deps/include/google/protobuf/descriptor.h	/^  ExtensionRange* extension_ranges_;$/;"	m	class:google::protobuf::Descriptor
+extension_scope_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* extension_scope_;$/;"	m	class:google::protobuf::FieldDescriptor
+extension_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::extension_size() const {$/;"	f	class:google::protobuf::DescriptorProto
+extension_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::extension_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+extensions	docs/conf.py	/^extensions = [$/;"	v
+extensions_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* extensions_;$/;"	m	class:google::protobuf::Descriptor
+extensions_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* extensions_;$/;"	m	class:google::protobuf::FileDescriptor
+extensions_	deps/include/google/protobuf/extension_set.h	/^  std::map<int, Extension> extensions_;$/;"	m	class:google::protobuf::internal::ExtensionSet
+extensions_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int extensions_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+failed	deps/include/google/protobuf/io/printer.h	/^  bool failed() const { return failed_; }$/;"	f	class:google::protobuf::io::Printer
+failed_	deps/include/google/protobuf/io/printer.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::Printer
+failed_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+failed_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+fallback_database_	deps/include/google/protobuf/descriptor.h	/^  DescriptorDatabase* fallback_database_;$/;"	m	class:google::protobuf::DescriptorPool
+false_	deps/include/google/protobuf/stubs/template_util.h	/^typedef false_type false_;$/;"	t	namespace:google::protobuf::internal
+false_type	deps/include/google/protobuf/stubs/template_util.h	/^typedef integral_constant<bool, false> false_type;$/;"	t	namespace:google::protobuf::internal
+fd	deps/include/zmq.h	/^    SOCKET fd;$/;"	m	struct:zmq_pollitem_t
+fd	deps/include/zmq.h	/^    int fd;$/;"	m	struct:zmq_pollitem_t
+field	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::field() const {$/;"	f	class:google::protobuf::DescriptorProto
+field	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::field(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
+field	deps/include/google/protobuf/unknown_field_set.h	/^inline const UnknownField& UnknownFieldSet::field(int index) const {$/;"	f	class:google::protobuf::UnknownFieldSet
+field_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > field_;$/;"	m	class:google::protobuf::DescriptorProto
+field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedField<T>* field_;$/;"	m	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrField<T>* field_;$/;"	m	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrField<T>* field_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+field_count	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownFieldSet::field_count() const {$/;"	f	class:google::protobuf::UnknownFieldSet
+field_count_	deps/include/google/protobuf/descriptor.h	/^  int field_count_;$/;"	m	class:google::protobuf::Descriptor
+field_number	deps/include/google/protobuf/wire_format_lite.h	/^#define field_number /;"	d
+field_number	deps/include/google/protobuf/wire_format_lite.h	/^#undef field_number$/;"	d
+field_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::field_size() const {$/;"	f	class:google::protobuf::DescriptorProto
+fields_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* fields_;$/;"	m	class:google::protobuf::Descriptor
+fields_	deps/include/google/protobuf/unknown_field_set.h	/^  vector<UnknownField>* fields_;$/;"	m	class:google::protobuf::UnknownFieldSet
+file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorResponse::file() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& CodeGeneratorResponse::file(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+file	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorSet::file() const {$/;"	f	class:google::protobuf::FileDescriptorSet
+file	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FileDescriptorProto& FileDescriptorSet::file(int index) const {$/;"	f	class:google::protobuf::FileDescriptorSet
+file_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File > file_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+file_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable const FileDescriptor* file_;  \/\/ Set in Generate().  Under mutex_.$/;"	m	class:google::protobuf::compiler::python::Generator
+file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::Descriptor
+file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::EnumDescriptor
+file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::FieldDescriptor
+file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::ServiceDescriptor
+file_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > file_;$/;"	m	class:google::protobuf::FileDescriptorSet
+file_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    const int file_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+file_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    const int file_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+file_descriptor_serialized_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable string file_descriptor_serialized_;$/;"	m	class:google::protobuf::compiler::python::Generator
+file_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorResponse::file_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+file_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorSet::file_size() const {$/;"	f	class:google::protobuf::FileDescriptorSet
+file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::file_to_generate() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorRequest::file_to_generate(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+file_to_generate_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::std::string> file_to_generate_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+file_to_generate_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorRequest::file_to_generate_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+filename	deps/include/google/protobuf/stubs/common.h	/^  const char* filename() const { return filename_; }$/;"	f	class:google::protobuf::FatalException
+filename_	deps/include/google/protobuf/stubs/common.h	/^  const char* filename_;$/;"	m	class:google::protobuf::FatalException
+filename_	deps/include/google/protobuf/stubs/common.h	/^  const char* filename_;$/;"	m	class:google::protobuf::internal::LogMessage
+fileno	src/windows/unistd.h	/^#define fileno /;"	d
+files_to_delete_	deps/include/google/protobuf/descriptor_database.h	/^  vector<const FileDescriptorProto*> files_to_delete_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase
+files_to_delete_	deps/include/google/protobuf/descriptor_database.h	/^  vector<void*> files_to_delete_;$/;"	m	class:google::protobuf::EncodedDescriptorDatabase
+find	include/ps/internal/env.h	/^  const char* find(const char* k) {$/;"	f	class:ps::Environment
+find_share_ring	tracker/tracker.py	/^    def find_share_ring(self, tree_map, parent_map, r):$/;"	m	class:RabitTracker
+finder_	deps/include/google/protobuf/text_format.h	/^    Finder* finder_;$/;"	m	class:google::protobuf::TextFormat::Parser
+fixed32	deps/include/google/protobuf/unknown_field_set.h	/^inline uint32 UnknownField::fixed32() const {$/;"	f	class:google::protobuf::UnknownField
+fixed32_	deps/include/google/protobuf/unknown_field_set.h	/^    uint32 fixed32_;$/;"	m	union:google::protobuf::UnknownField::__anon4
+fixed64	deps/include/google/protobuf/unknown_field_set.h	/^inline uint64 UnknownField::fixed64() const {$/;"	f	class:google::protobuf::UnknownField
+fixed64_	deps/include/google/protobuf/unknown_field_set.h	/^    uint64 fixed64_;$/;"	m	union:google::protobuf::UnknownField::__anon4
+flag_name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string flag_name;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
+float_value	deps/include/google/protobuf/extension_set.h	/^      float                 float_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+fopen64	include/dmlc/base.h	/^#define fopen64 /;"	d
+format	deps/include/google/protobuf/io/gzip_stream.h	/^    Format format;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
+format_	deps/include/google/protobuf/io/gzip_stream.h	/^  Format format_;$/;"	m	class:google::protobuf::io::GzipInputStream
+front	include/ps/sarray.h	/^  inline V front() const { CHECK(!empty()); return data()[0]; }$/;"	f	class:ps::SArray
+ftruncate	src/windows/unistd.h	/^#define ftruncate /;"	d
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::Descriptor
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::EnumDescriptor
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::EnumValueDescriptor
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::FieldDescriptor
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::MethodDescriptor
+full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::ServiceDescriptor
+func	deps/include/google/protobuf/extension_set.h	/^    EnumValidityFuncWithArg* func;$/;"	m	struct:google::protobuf::internal::ExtensionInfo::EnumValidityCheck
+function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure0
+function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
+function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
+gaierror	tracker/tracker.py	/^        from socket import gaierror$/;"	i
+generate_doxygen_xml	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
+generate_doxygen_xml	docs/sphinx_util.py	/^def generate_doxygen_xml(app):$/;"	f
+generator	deps/include/google/protobuf/compiler/command_line_interface.h	/^    CodeGenerator* generator;   \/\/ NULL for plugins$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
+generator	deps/include/google/protobuf/compiler/command_line_interface.h	/^    CodeGenerator* generator;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
+generator_parameters_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  map<string, string> generator_parameters_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+generators_by_flag_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  GeneratorMap generators_by_flag_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+generators_by_option_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  GeneratorMap generators_by_option_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+get	deps/include/google/protobuf/stubs/common.h	/^  C* get() const { return ptr_; }$/;"	f	class:google::protobuf::internal::scoped_ptr
+get	deps/include/google/protobuf/stubs/common.h	/^  C* get() const {$/;"	f	class:google::protobuf::internal::scoped_array
+get_customer	include/ps/simple_app.h	/^  virtual inline Customer* get_customer() { return obj_; }$/;"	f	class:ps::SimpleApp
+get_env	tracker/dmlc_ssh.py	/^    def get_env(self, pass_envs):$/;"	m	class:SSHLauncher
+get_header_guard_dmlc	tests/lint.py	/^def get_header_guard_dmlc(filename):$/;"	f
+get_link_map	tracker/tracker.py	/^    def get_link_map(self, nslave):$/;"	m	class:RabitTracker
+get_mpi_env	tracker/dmlc_mpi.py	/^def get_mpi_env(envs):$/;"	f
+get_neighbor	tracker/tracker.py	/^    def get_neighbor(self, rank, nslave):$/;"	m	class:RabitTracker
+get_ring	tracker/tracker.py	/^    def get_ring(self, tree_map, parent_map):$/;"	m	class:RabitTracker
+get_tree	tracker/tracker.py	/^    def get_tree(self, nslave):$/;"	m	class:RabitTracker
+getcwd	src/windows/unistd.h	/^#define getcwd /;"	d
+go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::go_package() const {$/;"	f	class:google::protobuf::FileOptions
+go_package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* go_package_;$/;"	m	class:google::protobuf::FileOptions
+google	deps/include/google/protobuf/compiler/code_generator.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/importer.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/parser.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/plugin.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/descriptor.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/descriptor.pb.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/descriptor_database.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/dynamic_message.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/extension_set.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/generated_message_reflection.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/generated_message_util.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/coded_stream.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/gzip_stream.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/printer.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/tokenizer.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/message.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/message_lite.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/reflection_ops.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/repeated_field.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/service.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/common.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/once.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/template_util.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/stubs/type_traits.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/text_format.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/unknown_field_set.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/wire_format.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/wire_format_lite.h	/^namespace google {$/;"	n
+google	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace google {$/;"	n
+google_opensource	deps/include/google/protobuf/generated_message_reflection.h	/^namespace google_opensource {$/;"	n	namespace:google::upb
+google_opensource	deps/include/google/protobuf/repeated_field.h	/^namespace google_opensource {$/;"	n	namespace:google::upb
+group	deps/include/google/protobuf/unknown_field_set.h	/^inline const UnknownFieldSet& UnknownField::group() const {$/;"	f	class:google::protobuf::UnknownField
+group_	deps/include/google/protobuf/unknown_field_set.h	/^    UnknownFieldSet* group_;$/;"	m	union:google::protobuf::UnknownField::__anon4
+had_error_	deps/include/google/protobuf/io/coded_stream.h	/^  bool had_error_;   \/\/ Whether an error occurred during output.$/;"	m	class:google::protobuf::io::CodedOutputStream
+had_errors_	deps/include/google/protobuf/compiler/parser.h	/^  bool had_errors_;$/;"	m	class:google::protobuf::compiler::Parser
+handle_print	tracker/tracker.py	/^    def handle_print(self,slave, msg):$/;"	m	class:RabitTracker
+has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_aggregate_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumOptions::has_allow_alias() const {$/;"	f	class:google::protobuf::EnumOptions
+has_amd_lock_mb_bug	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^  bool has_amd_lock_mb_bug;  \/\/ Processor has AMD memory-barrier bug; do lfence$/;"	m	struct:google::protobuf::internal::AtomicOps_x86CPUFeatureStruct
+has_bits_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int has_bits_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_cc_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_content() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_ctype() const {$/;"	f	class:google::protobuf::FieldOptions
+has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_default_value() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_default_value_	deps/include/google/protobuf/descriptor.h	/^  bool has_default_value_;$/;"	m	class:google::protobuf::FieldDescriptor
+has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_deprecated() const {$/;"	f	class:google::protobuf::FieldOptions
+has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_double_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto_ExtensionRange::has_end() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse::has_error() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_experimental_map_key() const {$/;"	f	class:google::protobuf::FieldOptions
+has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_extendee() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_go_package() const {$/;"	f	class:google::protobuf::FileOptions
+has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_identifier_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_input_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_insertion_point() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::has_is_extension() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_generate_equals_and_hash() const {$/;"	f	class:google::protobuf::FileOptions
+has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_multiple_files() const {$/;"	f	class:google::protobuf::FileOptions
+has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_outer_classname() const {$/;"	f	class:google::protobuf::FileOptions
+has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_package() const {$/;"	f	class:google::protobuf::FileOptions
+has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_label() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_lazy() const {$/;"	f	class:google::protobuf::FieldOptions
+has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline bool SourceCodeInfo_Location::has_leading_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::has_message_set_wire_format() const {$/;"	f	class:google::protobuf::MessageOptions
+has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_name() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto::has_name() const {$/;"	f	class:google::protobuf::DescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool ServiceDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::has_name_part() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_negative_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::has_no_standard_descriptor_accessor() const {$/;"	f	class:google::protobuf::MessageOptions
+has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_number() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_number() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_optimize_for() const {$/;"	f	class:google::protobuf::FileOptions
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto::has_options() const {$/;"	f	class:google::protobuf::DescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool ServiceDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_output_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_package() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_packed() const {$/;"	f	class:google::protobuf::FieldOptions
+has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorRequest::has_parameter() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_positive_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_py_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_source_code_info() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+has_sse2	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^  bool has_sse2;             \/\/ Processor has SSE2.$/;"	m	struct:google::protobuf::internal::AtomicOps_x86CPUFeatureStruct
+has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto_ExtensionRange::has_start() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_string_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline bool SourceCodeInfo_Location::has_trailing_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_assign<A[N]>$/;"	s	namespace:google::protobuf::internal
+has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_assign<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
+has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_assign : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_constructor<A[N]>$/;"	s	namespace:google::protobuf::internal
+has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_constructor<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
+has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_constructor : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_constructor<const T>$/;"	s	namespace:google::protobuf::internal
+has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_copy<A[N]>$/;"	s	namespace:google::protobuf::internal
+has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_copy<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
+has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_copy : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_copy<const T> : has_trivial_copy<T> { };$/;"	s	namespace:google::protobuf::internal
+has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_destructor<A[N]>$/;"	s	namespace:google::protobuf::internal
+has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_destructor<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
+has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_destructor : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_destructor<const T>$/;"	s	namespace:google::protobuf::internal
+has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_type() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_type_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_weak() const {$/;"	f	class:google::protobuf::FieldOptions
+head	include/ps/internal/message.h	/^  int head;$/;"	m	struct:ps::Meta
+head	include/ps/simple_app.h	/^  int head;$/;"	m	struct:ps::SimpleData
+heartbeat_mu_	include/ps/internal/postoffice.h	/^  std::mutex heartbeat_mu_;$/;"	m	class:ps::Postoffice
+heartbeat_thread_	include/ps/internal/van.h	/^  std::unique_ptr<std::thread> heartbeat_thread_;$/;"	m	class:ps::Van
+heartbeats_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, time_t> heartbeats_;$/;"	m	class:ps::Postoffice
+help	tracker/dmlc_mpi.py	/^                    help = 'command for dmlc program')$/;"	v
+help	tracker/dmlc_mpi.py	/^                    help = 'logging level')$/;"	v
+help	tracker/dmlc_mpi.py	/^                    help = 'number of server nodes to be launched')$/;"	v
+help	tracker/dmlc_mpi.py	/^                    help = 'number of worker proccess to be launched')$/;"	v
+help	tracker/dmlc_mpi.py	/^                    help = 'output log to the specific log file')$/;"	v
+help	tracker/dmlc_mpi.py	/^                    help = 'the hostfile of mpi server')$/;"	v
+help_text	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string help_text;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
+hostname	include/ps/internal/message.h	/^  std::string hostname;$/;"	m	struct:ps::Node
+html_static_path	docs/conf.py	/^html_static_path = ['_static']$/;"	v
+html_theme	docs/conf.py	/^html_theme = 'sphinx_rtd_theme'$/;"	v
+htmlhelp_basename	docs/conf.py	/^htmlhelp_basename = 'ps-litedoc'$/;"	v
+id	include/ps/internal/customer.h	/^  int id() { return id_; }$/;"	f	class:ps::Customer
+id	include/ps/internal/message.h	/^  int id;$/;"	m	struct:ps::Node
+id_	include/ps/internal/customer.h	/^  int id_;$/;"	m	class:ps::Customer
+identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::identifier_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+identifier_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* identifier_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+identity_	deps/include/google/protobuf/stubs/template_util.h	/^struct identity_ {$/;"	s	namespace:google::protobuf::internal
+if_	deps/include/google/protobuf/stubs/template_util.h	/^struct if_<false, A, B> {$/;"	s	namespace:google::protobuf::internal
+if_	deps/include/google/protobuf/stubs/template_util.h	/^struct if_{$/;"	s	namespace:google::protobuf::internal
+impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingInputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::FileInputStream
+impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingInputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::IstreamInputStream
+impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOutputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::FileOutputStream
+impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOutputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::OstreamOutputStream
+implicit_cast	deps/include/google/protobuf/stubs/common.h	/^inline To implicit_cast(From const &f) {$/;"	f	namespace:google::protobuf::internal
+imports_in_descriptor_set_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool imports_in_descriptor_set_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+indent_	deps/include/google/protobuf/io/printer.h	/^  string indent_;$/;"	m	class:google::protobuf::io::Printer
+index	deps/include/google/protobuf/descriptor.h	/^inline int Descriptor::index() const {$/;"	f	class:google::protobuf::Descriptor
+index	deps/include/google/protobuf/descriptor.h	/^inline int EnumDescriptor::index() const {$/;"	f	class:google::protobuf::EnumDescriptor
+index	deps/include/google/protobuf/descriptor.h	/^inline int EnumValueDescriptor::index() const {$/;"	f	class:google::protobuf::EnumValueDescriptor
+index	deps/include/google/protobuf/descriptor.h	/^inline int FieldDescriptor::index() const {$/;"	f	class:google::protobuf::FieldDescriptor
+index	deps/include/google/protobuf/descriptor.h	/^inline int MethodDescriptor::index() const {$/;"	f	class:google::protobuf::MethodDescriptor
+index	deps/include/google/protobuf/descriptor.h	/^inline int ServiceDescriptor::index() const {$/;"	f	class:google::protobuf::ServiceDescriptor
+index_	deps/include/google/protobuf/descriptor_database.h	/^  DescriptorIndex<const FileDescriptorProto*> index_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase
+index_	deps/include/google/protobuf/descriptor_database.h	/^  SimpleDescriptorDatabase::DescriptorIndex<pair<const void*, int> > index_;$/;"	m	class:google::protobuf::EncodedDescriptorDatabase
+initial_indent_level_	deps/include/google/protobuf/text_format.h	/^    int initial_indent_level_;$/;"	m	class:google::protobuf::TextFormat::Printer
+input	deps/include/google/protobuf/wire_format_lite.h	/^#define input /;"	d
+input	deps/include/google/protobuf/wire_format_lite.h	/^#undef input$/;"	d
+input_	deps/include/google/protobuf/compiler/parser.h	/^  io::Tokenizer* input_;$/;"	m	class:google::protobuf::compiler::Parser
+input_	deps/include/google/protobuf/io/coded_stream.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::CodedInputStream
+input_	deps/include/google/protobuf/io/tokenizer.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::Tokenizer
+input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    istream* input_;$/;"	m	class:google::protobuf::io::IstreamInputStream::CopyingIstreamInputStream
+input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::LimitingInputStream
+input_buffer_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* input_buffer_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+input_buffer_length_	deps/include/google/protobuf/io/gzip_stream.h	/^  size_t input_buffer_length_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+input_files_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<string> input_files_;                \/\/ Names of the input proto files.$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::input_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+input_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* input_type_;$/;"	m	class:google::protobuf::MethodDescriptor
+input_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* input_type_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+inputs_are_proto_path_relative_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool inputs_are_proto_path_relative_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::insertion_point() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+insertion_point_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* insertion_point_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+int16	deps/include/google/protobuf/stubs/common.h	/^typedef __int16 int16;$/;"	t	namespace:google::protobuf
+int16	deps/include/google/protobuf/stubs/common.h	/^typedef int16_t int16;$/;"	t	namespace:google::protobuf
+int16_t	include/dmlc/base.h	/^typedef __int16 int16_t;$/;"	t
+int16_t	include/ps/internal/utils.h	/^typedef __int16          int16_t;$/;"	t	namespace:ps
+int32	deps/include/google/protobuf/stubs/common.h	/^typedef __int32 int32;$/;"	t	namespace:google::protobuf
+int32	deps/include/google/protobuf/stubs/common.h	/^typedef int32_t int32;$/;"	t	namespace:google::protobuf
+int32_t	include/dmlc/base.h	/^typedef __int32 int32_t;$/;"	t
+int32_t	include/ps/internal/utils.h	/^typedef __int32          int32_t;$/;"	t	namespace:ps
+int32_value	deps/include/google/protobuf/extension_set.h	/^      int32                 int32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+int64	deps/include/google/protobuf/stubs/common.h	/^typedef __int64 int64;$/;"	t	namespace:google::protobuf
+int64	deps/include/google/protobuf/stubs/common.h	/^typedef int64_t int64;$/;"	t	namespace:google::protobuf
+int64_t	include/dmlc/base.h	/^typedef __int64 int64_t;$/;"	t
+int64_t	include/ps/internal/utils.h	/^typedef __int64          int64_t;$/;"	t	namespace:ps
+int64_value	deps/include/google/protobuf/extension_set.h	/^      int64                 int64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+int8	deps/include/google/protobuf/stubs/common.h	/^typedef __int8  int8;$/;"	t	namespace:google::protobuf
+int8	deps/include/google/protobuf/stubs/common.h	/^typedef int8_t  int8;$/;"	t	namespace:google::protobuf
+int8_t	include/dmlc/base.h	/^typedef signed char int8_t;$/;"	t
+int8_t	include/ps/internal/utils.h	/^typedef signed char      int8_t;$/;"	t	namespace:ps
+integral_constant	deps/include/google/protobuf/stubs/template_util.h	/^struct integral_constant {$/;"	s	namespace:google::protobuf::internal
+interface	src/network_utils.h	/^#undef interface$/;"	d
+internal	deps/include/google/protobuf/extension_set.h	/^  namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/extension_set.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/generated_message_reflection.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/generated_message_util.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/reflection_ops.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/repeated_field.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/common.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/template_util.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/type_traits.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/stubs/type_traits.h	/^namespace internal {$/;"	n	namespace:google::protobuf::internal
+internal	deps/include/google/protobuf/unknown_field_set.h	/^  namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/wire_format.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/wire_format_lite.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace internal {$/;"	n	namespace:google::protobuf
+internal_set_underlay	deps/include/google/protobuf/descriptor.h	/^  void internal_set_underlay(const DescriptorPool* underlay) {$/;"	f	class:google::protobuf::DescriptorPool
+io	deps/include/google/protobuf/compiler/code_generator.h	/^namespace io { class ZeroCopyOutputStream; }$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/compiler/importer.h	/^namespace io { class ZeroCopyInputStream; }$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace io { class Printer; }$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/extension_set.h	/^  namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/coded_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/gzip_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/printer.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/tokenizer.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/message.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/message_lite.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/text_format.h	/^namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/unknown_field_set.h	/^  namespace io {$/;"	n	namespace:google::protobuf
+io	deps/include/google/protobuf/wire_format.h	/^  namespace io {$/;"	n	namespace:google::protobuf
+is_class_or_union	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_class_or_union {$/;"	s	namespace:google::protobuf::internal::internal
+is_cleared	deps/include/google/protobuf/extension_set.h	/^    bool is_cleared : 4;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+is_closed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool is_closed_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+is_closed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool is_closed_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
+is_convertible	deps/include/google/protobuf/stubs/type_traits.h	/^struct is_convertible$/;"	s	namespace:google::protobuf::internal
+is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum$/;"	s	namespace:google::protobuf::internal
+is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<const T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
+is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<const volatile T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
+is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<volatile T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
+is_enum_impl	deps/include/google/protobuf/stubs/type_traits.h	/^template <bool NotUnum, class T> struct is_enum_impl$/;"	s	namespace:google::protobuf::internal::internal
+is_enum_impl	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum_impl<true, T> : false_type { };$/;"	s	namespace:google::protobuf::internal::internal
+is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::is_extension() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+is_extension_	deps/include/google/protobuf/descriptor.h	/^  bool is_extension_;$/;"	m	class:google::protobuf::FieldDescriptor
+is_extension_	deps/include/google/protobuf/descriptor.pb.h	/^  bool is_extension_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point : false_type { };$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<const T>$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<const volatile T>$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<volatile T>$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<double> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<float> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<long double> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral : false_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<const T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<const volatile T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<volatile T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<__wchar_t> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<bool> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<char> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<int> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<long long> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<long> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<short> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<signed char> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned char> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned int> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned long long> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned long> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned short> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<wchar_t> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_lazy	deps/include/google/protobuf/extension_set.h	/^    bool is_lazy : 4;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+is_optional	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_optional() const {$/;"	f	class:google::protobuf::FieldDescriptor
+is_packable	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_packable() const {$/;"	f	class:google::protobuf::FieldDescriptor
+is_packed	deps/include/google/protobuf/extension_set.h	/^    bool is_packed;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+is_packed	deps/include/google/protobuf/extension_set.h	/^  bool is_packed;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
+is_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_placeholder_;$/;"	m	class:google::protobuf::Descriptor
+is_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_placeholder_;$/;"	m	class:google::protobuf::EnumDescriptor
+is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod$/;"	s	namespace:google::protobuf::internal
+is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<const T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<const volatile T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<volatile T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
+is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer : false_type { };$/;"	s	namespace:google::protobuf::internal
+is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<T*> : true_type { };$/;"	s	namespace:google::protobuf::internal
+is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<const T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
+is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<const volatile T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
+is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<volatile T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
+is_recovery	include/ps/internal/message.h	/^  bool is_recovery;$/;"	m	struct:ps::Node
+is_recovery	include/ps/internal/postoffice.h	/^  bool is_recovery() const { return van_->my_node().is_recovery; }$/;"	f	class:ps::Postoffice
+is_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_reference : false_type {};$/;"	s	namespace:google::protobuf::internal
+is_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_reference<T&> : true_type {};$/;"	s	namespace:google::protobuf::internal
+is_repeated	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_repeated() const {$/;"	f	class:google::protobuf::FieldDescriptor
+is_repeated	deps/include/google/protobuf/extension_set.h	/^    bool is_repeated;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+is_repeated	deps/include/google/protobuf/extension_set.h	/^  bool is_repeated;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
+is_required	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_required() const {$/;"	f	class:google::protobuf::FieldDescriptor
+is_same	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T, typename U> struct is_same : public false_type { };$/;"	s	namespace:google::protobuf::internal
+is_same	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_same<T, T> : public true_type { };$/;"	s	namespace:google::protobuf::internal
+is_scheduler	include/ps/internal/postoffice.h	/^  int is_scheduler() const { return is_scheduler_; }$/;"	f	class:ps::Postoffice
+is_scheduler_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
+is_scheduler_	include/ps/internal/van.h	/^  bool is_scheduler_;$/;"	m	class:ps::Van
+is_server	include/ps/internal/postoffice.h	/^  int is_server() const { return is_server_; }$/;"	f	class:ps::Postoffice
+is_server_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
+is_unqualified_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_unqualified_placeholder_;$/;"	m	class:google::protobuf::Descriptor
+is_unqualified_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_unqualified_placeholder_;$/;"	m	class:google::protobuf::EnumDescriptor
+is_worker	include/ps/internal/postoffice.h	/^  int is_worker() const { return is_worker_; }$/;"	f	class:ps::Postoffice
+is_worker_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
+isatty	src/windows/unistd.h	/^#define isatty /;"	d
+it_	deps/include/google/protobuf/repeated_field.h	/^  VoidPtr* it_;$/;"	m	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+it_	deps/include/google/protobuf/repeated_field.h	/^  void* const* it_;$/;"	m	class:google::protobuf::internal::RepeatedPtrIterator
+iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef Element* iterator;$/;"	t	class:google::protobuf::RepeatedField
+iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef RepeatedPtrIterator<Element> iterator;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
+iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef internal::RepeatedPtrIterator<Element> iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+java	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace java {$/;"	n	namespace:google::protobuf::compiler
+java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_generate_equals_and_hash() const {$/;"	f	class:google::protobuf::FileOptions
+java_generate_equals_and_hash_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_generate_equals_and_hash_;$/;"	m	class:google::protobuf::FileOptions
+java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+java_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_generic_services_;$/;"	m	class:google::protobuf::FileOptions
+java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_multiple_files() const {$/;"	f	class:google::protobuf::FileOptions
+java_multiple_files_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_multiple_files_;$/;"	m	class:google::protobuf::FileOptions
+java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::java_outer_classname() const {$/;"	f	class:google::protobuf::FileOptions
+java_outer_classname_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* java_outer_classname_;$/;"	m	class:google::protobuf::FileOptions
+java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::java_package() const {$/;"	f	class:google::protobuf::FileOptions
+java_package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* java_package_;$/;"	m	class:google::protobuf::FileOptions
+join	tracker/tracker.py	/^    def join(self):$/;"	m	class:PSTracker
+join	tracker/tracker.py	/^    def join(self):$/;"	m	class:RabitTracker
+kAggregateValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kAggregateValueFieldNumber = 8;$/;"	m	class:google::protobuf::UninterpretedOption
+kAllowAliasFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kAllowAliasFieldNumber = 2;$/;"	m	class:google::protobuf::EnumOptions
+kBarrierGroupFieldNumber	src/meta.pb.cc	/^const int PBControl::kBarrierGroupFieldNumber;$/;"	m	class:ps::PBControl	file:
+kBodyFieldNumber	src/meta.pb.cc	/^const int PBMeta::kBodyFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kBoolSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kBoolSize     = 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kCcGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kCcGenericServicesFieldNumber = 16;$/;"	m	class:google::protobuf::FileOptions
+kCmdFieldNumber	src/meta.pb.cc	/^const int PBControl::kCmdFieldNumber;$/;"	m	class:ps::PBControl	file:
+kContentFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kContentFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+kControlFieldNumber	src/meta.pb.cc	/^const int PBMeta::kControlFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kCppTypeToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kCppTypeToName[MAX_CPPTYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
+kCtypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kCtypeFieldNumber = 1;$/;"	m	class:google::protobuf::FieldOptions
+kCustomerIdFieldNumber	src/meta.pb.cc	/^const int PBMeta::kCustomerIdFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kDataTypeFieldNumber	src/meta.pb.cc	/^const int PBMeta::kDataTypeFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kDefaultHeartbeatInterval	src/van.cc	/^static const int kDefaultHeartbeatInterval = 0;$/;"	m	namespace:ps	file:
+kDefaultTotalBytesLimit	deps/include/google/protobuf/io/coded_stream.h	/^  static const int kDefaultTotalBytesLimit = 64 << 20;  \/\/ 64MB$/;"	m	class:google::protobuf::io::CodedInputStream
+kDefaultTotalBytesWarningThreshold	deps/include/google/protobuf/io/coded_stream.h	/^  static const int kDefaultTotalBytesWarningThreshold = 32 << 20;  \/\/ 32MB$/;"	m	class:google::protobuf::io::CodedInputStream
+kDefaultValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDefaultValueFieldNumber = 7;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDependencyFieldNumber = 3;$/;"	m	class:google::protobuf::FileDescriptorProto
+kDeprecatedFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDeprecatedFieldNumber = 3;$/;"	m	class:google::protobuf::FieldOptions
+kDoubleSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kDoubleSize   = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kDoubleValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDoubleValueFieldNumber = 6;$/;"	m	class:google::protobuf::UninterpretedOption
+kEmpty	include/ps/internal/message.h	/^  static const int kEmpty;$/;"	m	struct:ps::Meta
+kEmpty	include/ps/internal/message.h	/^  static const int kEmpty;$/;"	m	struct:ps::Node
+kEmpty	src/customer.cc	/^const int Meta::kEmpty = std::numeric_limits<int>::max();$/;"	m	class:ps::Meta	file:
+kEmpty	src/customer.cc	/^const int Node::kEmpty = std::numeric_limits<int>::max();$/;"	m	class:ps::Node	file:
+kEndFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEndFieldNumber = 2;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+kEnumTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEnumTypeFieldNumber = 4;$/;"	m	class:google::protobuf::DescriptorProto
+kEnumTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEnumTypeFieldNumber = 5;$/;"	m	class:google::protobuf::FileDescriptorProto
+kErrorFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kErrorFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+kExperimentalMapKeyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExperimentalMapKeyFieldNumber = 9;$/;"	m	class:google::protobuf::FieldOptions
+kExtendeeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtendeeFieldNumber = 2;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionFieldNumber = 6;$/;"	m	class:google::protobuf::DescriptorProto
+kExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionFieldNumber = 7;$/;"	m	class:google::protobuf::FileDescriptorProto
+kExtensionRangeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionRangeFieldNumber = 5;$/;"	m	class:google::protobuf::DescriptorProto
+kFieldFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kFieldFieldNumber = 2;$/;"	m	class:google::protobuf::DescriptorProto
+kFieldTypeToCppTypeMap	deps/include/google/protobuf/wire_format_lite.h	/^  static const CppType kFieldTypeToCppTypeMap[];$/;"	m	class:google::protobuf::internal::WireFormatLite
+kFileFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kFileFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
+kFileFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kFileFieldNumber = 1;$/;"	m	class:google::protobuf::FileDescriptorSet
+kFileToGenerateFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kFileToGenerateFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+kFirstReservedNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kFirstReservedNumber = 19000;$/;"	m	class:google::protobuf::FieldDescriptor
+kFixed32Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFixed32Size  = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kFixed64Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFixed64Size  = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kFloatSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFloatSize    = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kGoPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kGoPackageFieldNumber = 11;$/;"	m	class:google::protobuf::FileOptions
+kHeadFieldNumber	src/meta.pb.cc	/^const int PBMeta::kHeadFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kHostnameFieldNumber	src/meta.pb.cc	/^const int PBNode::kHostnameFieldNumber;$/;"	m	class:ps::PBNode	file:
+kIdFieldNumber	src/meta.pb.cc	/^const int PBNode::kIdFieldNumber;$/;"	m	class:ps::PBNode	file:
+kIdentifierValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kIdentifierValueFieldNumber = 3;$/;"	m	class:google::protobuf::UninterpretedOption
+kInitialSize	deps/include/google/protobuf/repeated_field.h	/^  static const int kInitialSize = 0;$/;"	m	class:google::protobuf::RepeatedField
+kInitialSize	deps/include/google/protobuf/repeated_field.h	/^  static const int kInitialSize = 0;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
+kInputTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kInputTypeFieldNumber = 2;$/;"	m	class:google::protobuf::MethodDescriptorProto
+kInsertionPointFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kInsertionPointFieldNumber = 2;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+kIsExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kIsExtensionFieldNumber = 2;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+kIsRecoveryFieldNumber	src/meta.pb.cc	/^const int PBNode::kIsRecoveryFieldNumber;$/;"	m	class:ps::PBNode	file:
+kJavaGenerateEqualsAndHashFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaGenerateEqualsAndHashFieldNumber = 20;$/;"	m	class:google::protobuf::FileOptions
+kJavaGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaGenericServicesFieldNumber = 17;$/;"	m	class:google::protobuf::FileOptions
+kJavaMultipleFilesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaMultipleFilesFieldNumber = 10;$/;"	m	class:google::protobuf::FileOptions
+kJavaOuterClassnameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaOuterClassnameFieldNumber = 8;$/;"	m	class:google::protobuf::FileOptions
+kJavaPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaPackageFieldNumber = 1;$/;"	m	class:google::protobuf::FileOptions
+kLabelFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLabelFieldNumber = 4;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kLabelToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kLabelToName[MAX_LABEL + 1];$/;"	m	class:google::protobuf::FieldDescriptor
+kLastReservedNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kLastReservedNumber  = 19999;$/;"	m	class:google::protobuf::FieldDescriptor
+kLazyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLazyFieldNumber = 5;$/;"	m	class:google::protobuf::FieldOptions
+kLeadingCommentsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLeadingCommentsFieldNumber = 3;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+kLocationFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLocationFieldNumber = 1;$/;"	m	class:google::protobuf::SourceCodeInfo
+kMagic	tracker/tracker.py	/^kMagic = 0xff99$/;"	v
+kMaxKey	include/ps/base.h	/^static const Key kMaxKey = std::numeric_limits<Key>::max();$/;"	m	namespace:ps
+kMaxNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kMaxNumber = (1 << 29) - 1;$/;"	m	class:google::protobuf::FieldDescriptor
+kMessageSetItemEndTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemEndTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetItemNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemNumber = 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetItemStartTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemStartTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetItemTagsSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemTagsSize;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetMessageNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetMessageNumber = 3;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetMessageTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetMessageTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetTypeIdNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetTypeIdNumber = 2;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetTypeIdTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetTypeIdTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
+kMessageSetWireFormatFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMessageSetWireFormatFieldNumber = 1;$/;"	m	class:google::protobuf::MessageOptions
+kMessageTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMessageTypeFieldNumber = 4;$/;"	m	class:google::protobuf::FileDescriptorProto
+kMethodFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMethodFieldNumber = 2;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+kMinHeaderVersionForLibrary	deps/include/google/protobuf/stubs/common.h	/^static const int kMinHeaderVersionForLibrary = 2005000;$/;"	m	namespace:google::protobuf::internal
+kMinHeaderVersionForProtoc	deps/include/google/protobuf/stubs/common.h	/^static const int kMinHeaderVersionForProtoc = 2005000;$/;"	m	namespace:google::protobuf::internal
+kMinRepeatedFieldAllocationSize	deps/include/google/protobuf/repeated_field.h	/^static const int kMinRepeatedFieldAllocationSize = 4;$/;"	m	namespace:google::protobuf::internal
+kMinimumSize	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  static const int kMinimumSize = 16;$/;"	m	class:google::protobuf::io::StringOutputStream
+kMsgSigFieldNumber	src/meta.pb.cc	/^const int PBControl::kMsgSigFieldNumber;$/;"	m	class:ps::PBControl	file:
+kNameFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::DescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::EnumDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::FileDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::MethodDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 2;$/;"	m	class:google::protobuf::UninterpretedOption
+kNamePartFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNamePartFieldNumber = 1;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+kNegativeIntValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNegativeIntValueFieldNumber = 5;$/;"	m	class:google::protobuf::UninterpretedOption
+kNestedTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNestedTypeFieldNumber = 3;$/;"	m	class:google::protobuf::DescriptorProto
+kNoStandardDescriptorAccessorFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNoStandardDescriptorAccessorFieldNumber = 2;$/;"	m	class:google::protobuf::MessageOptions
+kNodeFieldNumber	src/meta.pb.cc	/^const int PBControl::kNodeFieldNumber;$/;"	m	class:ps::PBControl	file:
+kNumberFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNumberFieldNumber = 2;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+kNumberFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNumberFieldNumber = 3;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kOptimizeForFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptimizeForFieldNumber = 9;$/;"	m	class:google::protobuf::FileOptions
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::EnumDescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 4;$/;"	m	class:google::protobuf::MethodDescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 7;$/;"	m	class:google::protobuf::DescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 8;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 8;$/;"	m	class:google::protobuf::FileDescriptorProto
+kOutputTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOutputTypeFieldNumber = 3;$/;"	m	class:google::protobuf::MethodDescriptorProto
+kPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPackageFieldNumber = 2;$/;"	m	class:google::protobuf::FileDescriptorProto
+kPackedFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPackedFieldNumber = 2;$/;"	m	class:google::protobuf::FieldOptions
+kParameterFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kParameterFieldNumber = 2;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+kPathFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPathFieldNumber = 1;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+kPortFieldNumber	src/meta.pb.cc	/^const int PBNode::kPortFieldNumber;$/;"	m	class:ps::PBNode	file:
+kPositiveIntValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPositiveIntValueFieldNumber = 4;$/;"	m	class:google::protobuf::UninterpretedOption
+kProtoFileFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kProtoFileFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+kPublicDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPublicDependencyFieldNumber = 10;$/;"	m	class:google::protobuf::FileDescriptorProto
+kPushFieldNumber	src/meta.pb.cc	/^const int PBMeta::kPushFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kPyGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPyGenericServicesFieldNumber = 18;$/;"	m	class:google::protobuf::FileOptions
+kRequestFieldNumber	src/meta.pb.cc	/^const int PBMeta::kRequestFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kRoleFieldNumber	src/meta.pb.cc	/^const int PBNode::kRoleFieldNumber;$/;"	m	class:ps::PBNode	file:
+kSFixed32Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kSFixed32Size = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kSFixed64Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kSFixed64Size = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kScheduler	include/ps/base.h	/^static const int kScheduler = 1;$/;"	m	namespace:ps
+kServerGroup	include/ps/base.h	/^static const int kServerGroup = 2;$/;"	m	namespace:ps
+kServiceFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kServiceFieldNumber = 6;$/;"	m	class:google::protobuf::FileDescriptorProto
+kSimpleAppFieldNumber	src/meta.pb.cc	/^const int PBMeta::kSimpleAppFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kSourceCodeInfoFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kSourceCodeInfoFieldNumber = 9;$/;"	m	class:google::protobuf::FileDescriptorProto
+kSpanFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kSpanFieldNumber = 2;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+kStartFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kStartFieldNumber = 1;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+kStringValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kStringValueFieldNumber = 7;$/;"	m	class:google::protobuf::UninterpretedOption
+kTabWidth	deps/include/google/protobuf/io/tokenizer.h	/^  static const int kTabWidth = 8;$/;"	m	class:google::protobuf::io::Tokenizer
+kTagTypeBits	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kTagTypeBits = 3;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kTagTypeMask	deps/include/google/protobuf/wire_format_lite.h	/^  static const uint32 kTagTypeMask = (1 << kTagTypeBits) - 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
+kTimestampFieldNumber	src/meta.pb.cc	/^const int PBMeta::kTimestampFieldNumber;$/;"	m	class:ps::PBMeta	file:
+kTrailingCommentsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTrailingCommentsFieldNumber = 4;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+kTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTypeFieldNumber = 5;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kTypeNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTypeNameFieldNumber = 6;$/;"	m	class:google::protobuf::FieldDescriptorProto
+kTypeToCppTypeMap	deps/include/google/protobuf/descriptor.h	/^  static const CppType kTypeToCppTypeMap[MAX_TYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
+kTypeToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kTypeToName[MAX_TYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::EnumOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::EnumValueOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::FieldOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::FileOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::MessageOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::MethodOptions
+kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::ServiceOptions
+kValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kValueFieldNumber = 2;$/;"	m	class:google::protobuf::EnumDescriptorProto
+kWeakDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kWeakDependencyFieldNumber = 11;$/;"	m	class:google::protobuf::FileDescriptorProto
+kWeakFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kWeakFieldNumber = 10;$/;"	m	class:google::protobuf::FieldOptions
+kWireTypeForFieldType	deps/include/google/protobuf/wire_format_lite.h	/^  static const WireFormatLite::WireType kWireTypeForFieldType[];$/;"	m	class:google::protobuf::internal::WireFormatLite
+kWorkerGroup	include/ps/base.h	/^static const int kWorkerGroup = 4;$/;"	m	namespace:ps
+keys	include/ps/kv_app.h	/^  SArray<Key> keys;$/;"	m	struct:ps::KVPairs
+kint32max	deps/include/google/protobuf/stubs/common.h	/^static const int32 kint32max = 0x7FFFFFFF;$/;"	m	namespace:google::protobuf
+kint32min	deps/include/google/protobuf/stubs/common.h	/^static const int32 kint32min = -kint32max - 1;$/;"	m	namespace:google::protobuf
+kint64max	deps/include/google/protobuf/stubs/common.h	/^static const int64 kint64max = GOOGLE_LONGLONG(0x7FFFFFFFFFFFFFFF);$/;"	m	namespace:google::protobuf
+kint64min	deps/include/google/protobuf/stubs/common.h	/^static const int64 kint64min = -kint64max - 1;$/;"	m	namespace:google::protobuf
+kuint32max	deps/include/google/protobuf/stubs/common.h	/^static const uint32 kuint32max = 0xFFFFFFFFu;$/;"	m	namespace:google::protobuf
+kuint64max	deps/include/google/protobuf/stubs/common.h	/^static const uint64 kuint64max = GOOGLE_ULONGLONG(0xFFFFFFFFFFFFFFFF);$/;"	m	namespace:google::protobuf
+kvs	include/ps/internal/env.h	/^  std::unordered_map<std::string, std::string> kvs;$/;"	m	class:ps::Environment
+label	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto_Label FieldDescriptorProto::label() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+label_	deps/include/google/protobuf/descriptor.h	/^  Label label_;$/;"	m	class:google::protobuf::FieldDescriptor
+label_	deps/include/google/protobuf/descriptor.pb.h	/^  int label_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+language	docs/conf.py	/^language = None$/;"	v
+last_returned_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int last_returned_size_;   \/\/ How many bytes we returned last time Next()$/;"	m	class:google::protobuf::io::ArrayInputStream
+last_returned_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int last_returned_size_;   \/\/ How many bytes we returned last time Next()$/;"	m	class:google::protobuf::io::ArrayOutputStream
+last_tag_	deps/include/google/protobuf/io/coded_stream.h	/^  uint32 last_tag_;         \/\/ result of last ReadTag().$/;"	m	class:google::protobuf::io::CodedInputStream
+latex_documents	docs/conf.py	/^latex_documents = [$/;"	v
+latex_elements	docs/conf.py	/^latex_elements = {$/;"	v
+lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::lazy() const {$/;"	f	class:google::protobuf::FieldOptions
+lazy_	deps/include/google/protobuf/descriptor.pb.h	/^  bool lazy_;$/;"	m	class:google::protobuf::FieldOptions
+lazymessage_value	deps/include/google/protobuf/extension_set.h	/^      LazyMessageExtension* lazymessage_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+leading_comments	deps/include/google/protobuf/descriptor.h	/^  string leading_comments;$/;"	m	struct:google::protobuf::SourceLocation
+leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& SourceCodeInfo_Location::leading_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+leading_comments_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* leading_comments_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+legitimate_message_end_	deps/include/google/protobuf/io/coded_stream.h	/^  bool legitimate_message_end_;$/;"	m	class:google::protobuf::io::CodedInputStream
+length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline const string& UnknownField::length_delimited() const {$/;"	f	class:google::protobuf::UnknownField
+length_delimited_	deps/include/google/protobuf/unknown_field_set.h	/^    } length_delimited_;$/;"	m	union:google::protobuf::UnknownField::__anon4	typeref:union:google::protobuf::UnknownField::__anon4::__anon5
+lens	include/ps/kv_app.h	/^  SArray<int> lens;$/;"	m	struct:ps::KVPairs
+level_	deps/include/google/protobuf/stubs/common.h	/^  LogLevel level_;$/;"	m	class:google::protobuf::internal::LogMessage
+limit_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int64 limit_;  \/\/ Decreases as we go, becomes negative if we overshoot.$/;"	m	class:google::protobuf::io::LimitingInputStream
+line	deps/include/google/protobuf/io/tokenizer.h	/^    int line;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
+line	deps/include/google/protobuf/stubs/common.h	/^  int line() const { return line_; }$/;"	f	class:google::protobuf::FatalException
+line	deps/include/google/protobuf/text_format.h	/^    int line;$/;"	m	struct:google::protobuf::TextFormat::ParseLocation
+line_	deps/include/google/protobuf/io/tokenizer.h	/^  int line_;$/;"	m	class:google::protobuf::io::Tokenizer
+line_	deps/include/google/protobuf/stubs/common.h	/^  const int line_;$/;"	m	class:google::protobuf::FatalException
+line_	deps/include/google/protobuf/stubs/common.h	/^  int line_;$/;"	m	class:google::protobuf::internal::LogMessage
+location	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo::location() const {$/;"	f	class:google::protobuf::SourceCodeInfo
+location	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::SourceCodeInfo_Location& SourceCodeInfo::location(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo
+location_	deps/include/google/protobuf/compiler/parser.h	/^    SourceCodeInfo::Location* location_;$/;"	m	class:google::protobuf::compiler::Parser::LocationRecorder
+location_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location > location_;$/;"	m	class:google::protobuf::SourceCodeInfo
+location_map_	deps/include/google/protobuf/compiler/parser.h	/^  LocationMap location_map_;$/;"	m	class:google::protobuf::compiler::SourceLocationTable
+location_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo::location_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo
+locations_	deps/include/google/protobuf/text_format.h	/^    LocationMap locations_;$/;"	m	class:google::protobuf::TextFormat::ParseInfoTree
+logging	tracker/dmlc_local.py	/^import logging$/;"	i
+logging	tracker/dmlc_ssh.py	/^import logging$/;"	i
+logging	tracker/tracker.py	/^import logging$/;"	i
+lowercase_name_	deps/include/google/protobuf/descriptor.h	/^  const string* lowercase_name_;$/;"	m	class:google::protobuf::FieldDescriptor
+lseek	src/windows/unistd.h	/^#define lseek /;"	d
+mInternal	deps/include/google/protobuf/stubs/common.h	/^  Internal* mInternal;$/;"	m	class:google::protobuf::internal::Mutex
+main	tests/lint.py	/^def main():$/;"	f
+main	tests/test_connection.cc	/^int main(int argc, char *argv[]) {$/;"	f
+main	tests/test_kv_app.cc	/^int main(int argc, char *argv[]) {$/;"	f
+main	tests/test_simple_app.cc	/^int main(int argc, char *argv[]) {$/;"	f
+main	tracker/dmlc_local.py	/^def main():$/;"	f
+main	tracker/dmlc_ssh.py	/^def main():$/;"	f
+man_pages	docs/conf.py	/^man_pages = [$/;"	v
+mappings_	deps/include/google/protobuf/compiler/importer.h	/^  vector<Mapping> mappings_;$/;"	m	class:google::protobuf::compiler::DiskSourceTree
+master_doc	docs/conf.py	/^master_doc = 'index'$/;"	v
+max	include/ps/internal/postoffice.h	/^#undef max$/;"	d
+max_num_retry_	src/resender.h	/^  int max_num_retry_;$/;"	m	class:ps::Resender
+message	deps/include/google/protobuf/stubs/common.h	/^  const std::string& message() const { return message_; }$/;"	f	class:google::protobuf::FatalException
+message_	deps/include/google/protobuf/stubs/common.h	/^  const std::string message_;$/;"	m	class:google::protobuf::FatalException
+message_	deps/include/google/protobuf/stubs/common.h	/^  std::string message_;$/;"	m	class:google::protobuf::internal::LogMessage
+message_factory_	deps/include/google/protobuf/generated_message_reflection.h	/^  MessageFactory* message_factory_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+message_prototype	deps/include/google/protobuf/extension_set.h	/^    const MessageLite* message_prototype;$/;"	m	union:google::protobuf::internal::ExtensionInfo::__anon2
+message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::message_set_wire_format() const {$/;"	f	class:google::protobuf::MessageOptions
+message_set_wire_format_	deps/include/google/protobuf/descriptor.pb.h	/^  bool message_set_wire_format_;$/;"	m	class:google::protobuf::MessageOptions
+message_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::message_type() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto& FileDescriptorProto::message_type(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+message_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* message_type_;$/;"	m	class:google::protobuf::FieldDescriptor
+message_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > message_type_;$/;"	m	class:google::protobuf::FileDescriptorProto
+message_type_count_	deps/include/google/protobuf/descriptor.h	/^  int message_type_count_;$/;"	m	class:google::protobuf::FileDescriptor
+message_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::message_type_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+message_types_	deps/include/google/protobuf/descriptor.h	/^  Descriptor* message_types_;$/;"	m	class:google::protobuf::FileDescriptor
+message_value	deps/include/google/protobuf/extension_set.h	/^      MessageLite*          message_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+meta	include/ps/internal/message.h	/^  Meta meta;$/;"	m	struct:ps::Message
+method	deps/include/google/protobuf/descriptor.pb.h	/^ServiceDescriptorProto::method() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+method	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MethodDescriptorProto& ServiceDescriptorProto::method(int index) const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+method_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto > method_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure0
+method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure1
+method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure2
+method_count_	deps/include/google/protobuf/descriptor.h	/^  int method_count_;$/;"	m	class:google::protobuf::ServiceDescriptor
+method_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int ServiceDescriptorProto::method_size() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+methods_	deps/include/google/protobuf/descriptor.h	/^  MethodDescriptor* methods_;$/;"	m	class:google::protobuf::ServiceDescriptor
+mode_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  Mode mode_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+monitor_	src/resender.h	/^  std::thread* monitor_;$/;"	m	class:ps::Resender
+mpi_submit	tracker/dmlc_mpi.py	/^def mpi_submit(nworker, nserver, pass_envs):$/;"	f
+msg	src/resender.h	/^    Message msg;$/;"	m	struct:ps::Resender::Entry
+msg_sig	include/ps/internal/message.h	/^  uint64_t msg_sig;$/;"	m	struct:ps::Control
+mthread_submit	tracker/dmlc_local.py	/^        def mthread_submit(nworker, nserver, envs):$/;"	f	function:LocalLauncher.submit
+mu_	deps/include/google/protobuf/stubs/common.h	/^  Mutex *const mu_;$/;"	m	class:google::protobuf::internal::MutexLock
+mu_	deps/include/google/protobuf/stubs/common.h	/^  Mutex *const mu_;$/;"	m	class:google::protobuf::internal::MutexLockMaybe
+mu_	include/ps/internal/postoffice.h	/^  mutable std::mutex mu_;$/;"	m	class:ps::Postoffice
+mu_	include/ps/internal/threadsafe_queue.h	/^  mutable std::mutex mu_;$/;"	m	class:ps::ThreadsafeQueue
+mu_	include/ps/kv_app.h	/^  std::mutex mu_;$/;"	m	class:ps::KVWorker
+mu_	src/resender.h	/^  std::mutex mu_;$/;"	m	class:ps::Resender
+mu_	src/zmq_van.h	/^  std::mutex mu_;$/;"	m	class:ps::ZMQVan
+mutable_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::mutable_data() {$/;"	f	class:google::protobuf::RepeatedField
+mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline Element** RepeatedPtrField<Element>::mutable_data() {$/;"	f	class:google::protobuf::RepeatedPtrField
+mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type** RepeatedPtrFieldBase::mutable_data() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+mutable_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_dependency(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::mutable_enum_type(int index) {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::mutable_enum_type(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse::mutable_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+mutable_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldOptions::mutable_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
+mutable_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_extension() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_extension(int index) {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::mutable_extension(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::mutable_extension_range(int index) {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_field	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_field() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_field	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_field(int index) {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_field	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownField* UnknownFieldSet::mutable_field(int index) {$/;"	f	class:google::protobuf::UnknownFieldSet
+mutable_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorResponse::mutable_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+mutable_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::mutable_file(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+mutable_file	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorSet::mutable_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
+mutable_file	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::mutable_file(int index) {$/;"	f	class:google::protobuf::FileDescriptorSet
+mutable_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::mutable_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::mutable_file_to_generate(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_go_package() {$/;"	f	class:google::protobuf::FileOptions
+mutable_group	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownFieldSet* UnknownField::mutable_group() {$/;"	f	class:google::protobuf::UnknownField
+mutable_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+mutable_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+mutable_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
+mutable_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_java_package() {$/;"	f	class:google::protobuf::FileOptions
+mutable_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::mutable_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+mutable_length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline string* UnknownField::mutable_length_delimited() {$/;"	f	class:google::protobuf::UnknownField
+mutable_location	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo::mutable_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
+mutable_location	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::mutable_location(int index) {$/;"	f	class:google::protobuf::SourceCodeInfo
+mutable_message_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* FileDescriptorProto::mutable_message_type(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_method	deps/include/google/protobuf/descriptor.pb.h	/^ServiceDescriptorProto::mutable_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+mutable_method	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::mutable_method(int index) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+mutable_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^UninterpretedOption::mutable_name() {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::mutable_name(int index) {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* DescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumValueDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* ServiceDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+mutable_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption_NamePart::mutable_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+mutable_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* DescriptorProto::mutable_nested_type(int index) {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumOptions* EnumDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions* FieldDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions* FileDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MessageOptions* DescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodOptions* MethodDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+mutable_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+mutable_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::mutable_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_path	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::mutable_path() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+mutable_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::mutable_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::mutable_proto_file(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_public_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_service	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_service	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::mutable_service(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::mutable_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_span	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::mutable_span() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+mutable_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::mutable_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+mutable_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumValueOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FieldOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FileOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MessageOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MethodOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^ServiceOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::EnumOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumValueOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::EnumValueOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FieldOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::FieldOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FileOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::FileOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MessageOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::MessageOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MethodOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::MethodOptions
+mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* ServiceOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::ServiceOptions
+mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::DescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumValueOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FieldOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileDescriptorSet
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MessageOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MethodOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::ServiceOptions
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::SourceCodeInfo
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::UninterpretedOption
+mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+mutable_value	deps/include/google/protobuf/descriptor.pb.h	/^EnumDescriptorProto::mutable_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+mutable_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::mutable_value(int index) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+mutable_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_weak_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
+mutex_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable Mutex mutex_;$/;"	m	class:google::protobuf::compiler::python::Generator
+mutex_	deps/include/google/protobuf/descriptor.h	/^  Mutex* mutex_;$/;"	m	class:google::protobuf::DescriptorPool
+my_node	include/ps/internal/van.h	/^  const Node& my_node() const {$/;"	f	class:ps::Van
+my_node_	include/ps/internal/van.h	/^  Node my_node_;$/;"	m	class:ps::Van
+my_rank	include/ps/internal/postoffice.h	/^  int my_rank() const { return IDtoRank(van_->my_node().id); }$/;"	f	class:ps::Postoffice
+name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string name;                \/\/ E.g. "--foo_out"$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
+name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::name() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+name	deps/include/google/protobuf/descriptor.pb.h	/^UninterpretedOption::name() const {$/;"	f	class:google::protobuf::UninterpretedOption
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption_NamePart& UninterpretedOption::name(int index) const {$/;"	f	class:google::protobuf::UninterpretedOption
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& DescriptorProto::name() const {$/;"	f	class:google::protobuf::DescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& EnumDescriptorProto::name() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& EnumValueDescriptorProto::name() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::name() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::name() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& ServiceDescriptorProto::name() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+name_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::Descriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::EnumDescriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::EnumValueDescriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::FieldDescriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::FileDescriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::MethodDescriptor
+name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::ServiceDescriptor
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart > name_;$/;"	m	class:google::protobuf::UninterpretedOption
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::DescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::FileDescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption_NamePart::name_part() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+name_part_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_part_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
+name_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int UninterpretedOption::name_size() const {$/;"	f	class:google::protobuf::UninterpretedOption
+negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int64 UninterpretedOption::negative_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+negative_int_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int64 negative_int_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+nested_	deps/include/google/protobuf/text_format.h	/^    NestedMap nested_;$/;"	m	class:google::protobuf::TextFormat::ParseInfoTree
+nested_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::nested_type() const {$/;"	f	class:google::protobuf::DescriptorProto
+nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto& DescriptorProto::nested_type(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
+nested_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > nested_type_;$/;"	m	class:google::protobuf::DescriptorProto
+nested_type_count_	deps/include/google/protobuf/descriptor.h	/^  int nested_type_count_;$/;"	m	class:google::protobuf::Descriptor
+nested_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::nested_type_size() const {$/;"	f	class:google::protobuf::DescriptorProto
+nested_types_	deps/include/google/protobuf/descriptor.h	/^  Descriptor* nested_types_;$/;"	m	class:google::protobuf::Descriptor
+no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::no_standard_descriptor_accessor() const {$/;"	f	class:google::protobuf::MessageOptions
+no_standard_descriptor_accessor_	deps/include/google/protobuf/descriptor.pb.h	/^  bool no_standard_descriptor_accessor_;$/;"	m	class:google::protobuf::MessageOptions
+node	include/ps/internal/message.h	/^  std::vector<Node> node;$/;"	m	struct:ps::Control
+node_ids_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, std::vector<int>> node_ids_;$/;"	m	class:ps::Postoffice
+noexcept	include/dmlc/logging.h	/^#define noexcept(/;"	d
+num	tests/test_simple_app.cc	/^int num = 0;$/;"	v
+num_retry	src/resender.h	/^    int num_retry = 0;$/;"	m	struct:ps::Resender::Entry
+num_servers	include/ps/internal/postoffice.h	/^  int num_servers() const { return num_servers_; }$/;"	f	class:ps::Postoffice
+num_servers_	include/ps/internal/postoffice.h	/^  int num_servers_, num_workers_;$/;"	m	class:ps::Postoffice
+num_servers_	include/ps/internal/van.h	/^  int num_servers_ = 0;$/;"	m	class:ps::Van
+num_workers	include/ps/internal/postoffice.h	/^  int num_workers() const { return num_workers_; }$/;"	f	class:ps::Postoffice
+num_workers_	include/ps/internal/postoffice.h	/^  int num_servers_, num_workers_;$/;"	m	class:ps::Postoffice
+num_workers_	include/ps/internal/van.h	/^  int num_workers_ = 0;$/;"	m	class:ps::Van
+number	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 EnumValueDescriptorProto::number() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+number	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FieldDescriptorProto::number() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+number	deps/include/google/protobuf/extension_set.h	/^  inline int number() const { return number_; }$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
+number	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownField::number() const { return number_; }$/;"	f	class:google::protobuf::UnknownField
+number_	deps/include/google/protobuf/descriptor.h	/^  int number_;$/;"	m	class:google::protobuf::EnumValueDescriptor
+number_	deps/include/google/protobuf/descriptor.h	/^  int number_;$/;"	m	class:google::protobuf::FieldDescriptor
+number_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 number_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+number_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 number_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+number_	deps/include/google/protobuf/extension_set.h	/^  const int number_;$/;"	m	class:google::protobuf::internal::ExtensionIdentifier
+obj_	include/ps/simple_app.h	/^  Customer* obj_;$/;"	m	class:ps::SimpleApp
+object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure0
+object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure1
+object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure2
+object_size_	deps/include/google/protobuf/generated_message_reflection.h	/^  int object_size_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+off64_t	include/dmlc/base.h	/^#define off64_t /;"	d
+offsets_	deps/include/google/protobuf/generated_message_reflection.h	/^  const int* offsets_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+operator !=	deps/include/google/protobuf/repeated_field.h	/^  bool operator!=(const iterator& x) const { return it_ != x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator !=	deps/include/google/protobuf/repeated_field.h	/^  bool operator!=(const iterator& x) const { return it_ != x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator !=	deps/include/google/protobuf/stubs/common.h	/^  bool operator!=(C* p) const { return array_ != p; }$/;"	f	class:google::protobuf::internal::scoped_array
+operator !=	deps/include/google/protobuf/stubs/common.h	/^  bool operator!=(C* p) const { return ptr_ != p; }$/;"	f	class:google::protobuf::internal::scoped_ptr
+operator ()	deps/include/google/protobuf/repeated_field.h	/^  void operator()(Element to[], const Element from[], int array_size) {$/;"	f	struct:google::protobuf::internal::ElementCopier
+operator ()	deps/include/google/protobuf/repeated_field.h	/^void ElementCopier<Element, HasTrivialCopy>::operator()($/;"	f	class:google::protobuf::internal::ElementCopier
+operator ()	include/ps/kv_app.h	/^  void operator()($/;"	f	struct:ps::KVServerDefaultHandle
+operator *	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+operator *	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+operator *	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+operator *	deps/include/google/protobuf/repeated_field.h	/^  reference operator*() const { return *reinterpret_cast<Element**>(it_); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator *	deps/include/google/protobuf/repeated_field.h	/^  reference operator*() const { return *reinterpret_cast<Element*>(*it_); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator *	deps/include/google/protobuf/stubs/common.h	/^  C& operator*() const {$/;"	f	class:google::protobuf::internal::scoped_ptr
+operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(difference_type d, iterator it) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(difference_type d, iterator it) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator++(int \/* unused *\/) {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator++(int \/* unused *\/) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator++(int) { return iterator(it_++); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator++(int) { return iterator(it_++); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator++() { ++it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator++() { ++it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator +=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator+=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator +=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator+=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator -	deps/include/google/protobuf/repeated_field.h	/^  difference_type operator-(const iterator& x) const { return it_ - x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator -	deps/include/google/protobuf/repeated_field.h	/^  difference_type operator-(const iterator& x) const { return it_ - x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator -	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator-(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator -	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator-(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator--(int) { return iterator(it_--); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator--(int) { return iterator(it_--); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator--() { --it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator--() { --it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator -=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator-=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator -=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator-=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator ->	deps/include/google/protobuf/repeated_field.h	/^  pointer   operator->() const { return &(operator*()); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator ->	deps/include/google/protobuf/repeated_field.h	/^  pointer   operator->() const { return &(operator*()); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator ->	deps/include/google/protobuf/stubs/common.h	/^  C* operator->() const  {$/;"	f	class:google::protobuf::internal::scoped_ptr
+operator <	deps/include/google/protobuf/repeated_field.h	/^  bool operator<(const iterator& x) const { return it_ < x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator <	deps/include/google/protobuf/repeated_field.h	/^  bool operator<(const iterator& x) const { return it_ < x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator <<	include/ps/sarray.h	/^std::ostream& operator<<(std::ostream& os, const SArray<V>& obj) {$/;"	f	namespace:ps
+operator <=	deps/include/google/protobuf/repeated_field.h	/^  bool operator<=(const iterator& x) const { return it_ <= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator <=	deps/include/google/protobuf/repeated_field.h	/^  bool operator<=(const iterator& x) const { return it_ <= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorRequest& operator=(const CodeGeneratorRequest& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorResponse& operator=(const CodeGeneratorResponse& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorResponse_File& operator=(const CodeGeneratorResponse_File& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline DescriptorProto& operator=(const DescriptorProto& from) {$/;"	f	class:google::protobuf::DescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline DescriptorProto_ExtensionRange& operator=(const DescriptorProto_ExtensionRange& from) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumDescriptorProto& operator=(const EnumDescriptorProto& from) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumOptions& operator=(const EnumOptions& from) {$/;"	f	class:google::protobuf::EnumOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumValueDescriptorProto& operator=(const EnumValueDescriptorProto& from) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumValueOptions& operator=(const EnumValueOptions& from) {$/;"	f	class:google::protobuf::EnumValueOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FieldDescriptorProto& operator=(const FieldDescriptorProto& from) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FieldOptions& operator=(const FieldOptions& from) {$/;"	f	class:google::protobuf::FieldOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileDescriptorProto& operator=(const FileDescriptorProto& from) {$/;"	f	class:google::protobuf::FileDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileDescriptorSet& operator=(const FileDescriptorSet& from) {$/;"	f	class:google::protobuf::FileDescriptorSet
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileOptions& operator=(const FileOptions& from) {$/;"	f	class:google::protobuf::FileOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MessageOptions& operator=(const MessageOptions& from) {$/;"	f	class:google::protobuf::MessageOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MethodDescriptorProto& operator=(const MethodDescriptorProto& from) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MethodOptions& operator=(const MethodOptions& from) {$/;"	f	class:google::protobuf::MethodOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline ServiceDescriptorProto& operator=(const ServiceDescriptorProto& from) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline ServiceOptions& operator=(const ServiceOptions& from) {$/;"	f	class:google::protobuf::ServiceOptions
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline SourceCodeInfo& operator=(const SourceCodeInfo& from) {$/;"	f	class:google::protobuf::SourceCodeInfo
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline SourceCodeInfo_Location& operator=(const SourceCodeInfo_Location& from) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline UninterpretedOption& operator=(const UninterpretedOption& from) {$/;"	f	class:google::protobuf::UninterpretedOption
+operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline UninterpretedOption_NamePart& operator=(const UninterpretedOption_NamePart& from) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+operator =	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator=($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
+operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator=(const T& value) {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
+operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator=($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator=(const T& value) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
+operator =	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::operator=(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
+operator =	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>& RepeatedPtrField<Element>::operator=($/;"	f	class:google::protobuf::RepeatedPtrField
+operator =	include/ps/sarray.h	/^  template <typename W> void operator=(const SArray<W>& arr) {$/;"	f	class:ps::SArray
+operator =	include/ps/sarray.h	/^  template <typename W> void operator=(const std::initializer_list<W>& list) {$/;"	f	class:ps::SArray
+operator ==	deps/include/google/protobuf/repeated_field.h	/^  bool operator==(const iterator& x) const { return it_ == x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator ==	deps/include/google/protobuf/repeated_field.h	/^  bool operator==(const iterator& x) const { return it_ == x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator ==	deps/include/google/protobuf/stubs/common.h	/^  bool operator==(C* p) const { return array_ == p; }$/;"	f	class:google::protobuf::internal::scoped_array
+operator ==	deps/include/google/protobuf/stubs/common.h	/^  bool operator==(C* p) const { return ptr_ == p; }$/;"	f	class:google::protobuf::internal::scoped_ptr
+operator >	deps/include/google/protobuf/repeated_field.h	/^  bool operator>(const iterator& x) const { return it_ > x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator >	deps/include/google/protobuf/repeated_field.h	/^  bool operator>(const iterator& x) const { return it_ > x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator >=	deps/include/google/protobuf/repeated_field.h	/^  bool operator>=(const iterator& x) const { return it_ >= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator >=	deps/include/google/protobuf/repeated_field.h	/^  bool operator>=(const iterator& x) const { return it_ >= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator []	deps/include/google/protobuf/repeated_field.h	/^  reference operator[](difference_type d) const { return *(*this + d); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
+operator []	deps/include/google/protobuf/repeated_field.h	/^  reference operator[](difference_type d) const { return *(*this + d); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+operator []	deps/include/google/protobuf/stubs/common.h	/^  C& operator[](std::ptrdiff_t i) const {$/;"	f	class:google::protobuf::internal::scoped_array
+operator []	include/ps/sarray.h	/^  inline V& operator[] (int i) { return data()[i]; }$/;"	f	class:ps::SArray
+operator []	include/ps/sarray.h	/^  inline const V& operator[] (int i) const { return data()[i]; }$/;"	f	class:ps::SArray
+optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions_OptimizeMode FileOptions::optimize_for() const {$/;"	f	class:google::protobuf::FileOptions
+optimize_for_	deps/include/google/protobuf/descriptor.pb.h	/^  int optimize_for_;$/;"	m	class:google::protobuf::FileOptions
+option_flag_name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string option_flag_name;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumOptions& EnumDescriptorProto::options() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumValueOptions& EnumValueDescriptorProto::options() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldOptions& FieldDescriptorProto::options() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FileOptions& FileDescriptorProto::options() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MessageOptions& DescriptorProto::options() const {$/;"	f	class:google::protobuf::DescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MethodOptions& MethodDescriptorProto::options() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::ServiceOptions& ServiceDescriptorProto::options() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+options_	deps/include/google/protobuf/descriptor.h	/^  const EnumOptions* options_;$/;"	m	class:google::protobuf::EnumDescriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const EnumValueOptions* options_;$/;"	m	class:google::protobuf::EnumValueDescriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const FieldOptions* options_;$/;"	m	class:google::protobuf::FieldDescriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const FileOptions* options_;$/;"	m	class:google::protobuf::FileDescriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const MessageOptions* options_;$/;"	m	class:google::protobuf::Descriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const MethodOptions* options_;$/;"	m	class:google::protobuf::MethodDescriptor
+options_	deps/include/google/protobuf/descriptor.h	/^  const ServiceOptions* options_;$/;"	m	class:google::protobuf::ServiceDescriptor
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::EnumOptions* options_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::EnumValueOptions* options_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::FieldOptions* options_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::FileOptions* options_;$/;"	m	class:google::protobuf::FileDescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::MessageOptions* options_;$/;"	m	class:google::protobuf::DescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::MethodOptions* options_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::ServiceOptions* options_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
+or_	deps/include/google/protobuf/stubs/template_util.h	/^struct or_ : public integral_constant<bool, (A::value || B::value)> {$/;"	s	namespace:google::protobuf::internal
+os	docs/conf.py	/^import os$/;"	i
+os	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
+os	tests/lint.py	/^import os$/;"	i
+os	tracker/dmlc_local.py	/^import os$/;"	i
+os	tracker/dmlc_mpi.py	/^import os$/;"	i
+os	tracker/dmlc_ssh.py	/^import os$/;"	i
+os	tracker/tracker.py	/^import os$/;"	i
+output	deps/include/google/protobuf/wire_format_lite.h	/^#define output /;"	d
+output	deps/include/google/protobuf/wire_format_lite.h	/^#undef output$/;"	d
+output_	deps/include/google/protobuf/io/coded_stream.h	/^  ZeroCopyOutputStream* output_;$/;"	m	class:google::protobuf::io::CodedOutputStream
+output_	deps/include/google/protobuf/io/printer.h	/^  ZeroCopyOutputStream* const output_;$/;"	m	class:google::protobuf::io::Printer
+output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    ostream* output_;$/;"	m	class:google::protobuf::io::OstreamOutputStream::CopyingOstreamOutputStream
+output_buffer_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* output_buffer_;$/;"	m	class:google::protobuf::io::GzipInputStream
+output_buffer_length_	deps/include/google/protobuf/io/gzip_stream.h	/^  size_t output_buffer_length_;$/;"	m	class:google::protobuf::io::GzipInputStream
+output_directives_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<OutputDirective> output_directives_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+output_location	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string output_location;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
+output_position_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* output_position_;$/;"	m	class:google::protobuf::io::GzipInputStream
+output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::output_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+output_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* output_type_;$/;"	m	class:google::protobuf::MethodDescriptor
+output_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* output_type_;$/;"	m	class:google::protobuf::MethodDescriptorProto
+overflow_bytes_	deps/include/google/protobuf/io/coded_stream.h	/^  int overflow_bytes_;$/;"	m	class:google::protobuf::io::CodedInputStream
+owner_	deps/include/google/protobuf/compiler/importer.h	/^    SourceTreeDescriptorDatabase* owner_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase::ValidationErrorCollector
+owns_copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool owns_copying_stream_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+owns_copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool owns_copying_stream_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+pLinuxKernelCmpxchg	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^LinuxKernelCmpxchgFunc pLinuxKernelCmpxchg __attribute__((weak)) =$/;"	m	namespace:google::protobuf::internal
+pLinuxKernelMemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^LinuxKernelMemoryBarrierFunc pLinuxKernelMemoryBarrier __attribute__((weak)) =$/;"	m	namespace:google::protobuf::internal
+package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::package() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+package_	deps/include/google/protobuf/descriptor.h	/^  const string* package_;$/;"	m	class:google::protobuf::FileDescriptor
+package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* package_;$/;"	m	class:google::protobuf::FileDescriptorProto
+packed	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::packed() const {$/;"	f	class:google::protobuf::FieldOptions
+packed_	deps/include/google/protobuf/descriptor.pb.h	/^  bool packed_;$/;"	m	class:google::protobuf::FieldOptions
+parameter	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string parameter;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
+parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorRequest::parameter() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+parameter_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* parameter_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+parse_info_tree_	deps/include/google/protobuf/text_format.h	/^    ParseInfoTree* parse_info_tree_;$/;"	m	class:google::protobuf::TextFormat::Parser
+parser	docs/sphinx_util.py	/^from recommonmark import parser, transform$/;"	i
+parser	tracker/dmlc_mpi.py	/^parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using MPI')$/;"	v
+parser_	deps/include/google/protobuf/compiler/parser.h	/^    Parser* parser_;$/;"	m	class:google::protobuf::compiler::Parser::LocationRecorder
+path	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::path() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+path	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 SourceCodeInfo_Location::path(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+path_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > path_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+path_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo_Location::path_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+plugin_prefix_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string plugin_prefix_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+plugins_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  map<string, string> plugins_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::pointer pointer;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
+pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::pointer pointer;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type* pointer;$/;"	t	class:google::protobuf::RepeatedField
+pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type* pointer;$/;"	t	class:google::protobuf::RepeatedPtrField
+pointer_begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_begin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+pointer_begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_begin() {$/;"	f	class:google::protobuf::RepeatedPtrField
+pointer_end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_end() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+pointer_end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_end() {$/;"	f	class:google::protobuf::RepeatedPtrField
+pointer_iterator	deps/include/google/protobuf/repeated_field.h	/^  pointer_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+pool	deps/include/google/protobuf/compiler/importer.h	/^  inline const DescriptorPool* pool() const {$/;"	f	class:google::protobuf::compiler::Importer
+pool_	deps/include/google/protobuf/compiler/importer.h	/^  DescriptorPool pool_;$/;"	m	class:google::protobuf::compiler::Importer
+pool_	deps/include/google/protobuf/descriptor.h	/^  const DescriptorPool* pool_;$/;"	m	class:google::protobuf::FileDescriptor
+pool_	deps/include/google/protobuf/descriptor_database.h	/^  const DescriptorPool& pool_;$/;"	m	class:google::protobuf::DescriptorPoolDatabase
+pool_	deps/include/google/protobuf/dynamic_message.h	/^  const DescriptorPool* pool_;$/;"	m	class:google::protobuf::DynamicMessageFactory
+pop_back	include/ps/sarray.h	/^  void pop_back() { if (size_) --size_; }$/;"	f	class:ps::SArray
+port	include/ps/internal/message.h	/^  int port;$/;"	m	struct:ps::Node
+position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int position_;$/;"	m	class:google::protobuf::io::ArrayInputStream
+position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int position_;$/;"	m	class:google::protobuf::io::ArrayOutputStream
+position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int64 position_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
+position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int64 position_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
+positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::uint64 UninterpretedOption::positive_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+positive_int_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint64 positive_int_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+previous	deps/include/google/protobuf/io/tokenizer.h	/^inline const Tokenizer::Token& Tokenizer::previous() {$/;"	f	class:google::protobuf::io::Tokenizer
+previous_	deps/include/google/protobuf/io/tokenizer.h	/^  Token previous_;          \/\/ Returned by previous().$/;"	m	class:google::protobuf::io::Tokenizer
+previous_seek_failed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool previous_seek_failed_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
+print_summary	tests/lint.py	/^    def print_summary(self, strm):$/;"	m	class:LintHelper
+printer_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable io::Printer* printer_;  \/\/ Set in Generate().  Under mutex_.$/;"	m	class:google::protobuf::compiler::python::Generator
+process	tests/lint.py	/^def process(fname, allow_type):$/;"	f
+process_cpp	tests/lint.py	/^    def process_cpp(self, path, suffix):$/;"	m	class:LintHelper
+process_python	tests/lint.py	/^    def process_python(self, path):$/;"	m	class:LintHelper
+project	docs/conf.py	/^project = u'ps-lite'$/;"	v
+proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::proto_file() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::google::protobuf::FileDescriptorProto& CodeGeneratorRequest::proto_file(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+proto_file_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > proto_file_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
+proto_file_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorRequest::proto_file_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+proto_path_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<pair<string, string> > proto_path_;  \/\/ Search path for proto files.$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+protobuf	deps/include/google/protobuf/compiler/code_generator.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/importer.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/parser.h	/^namespace protobuf { class Message; }$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/parser.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/plugin.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/descriptor.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/descriptor.pb.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/descriptor_database.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/dynamic_message.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/extension_set.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/generated_message_reflection.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/generated_message_util.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/coded_stream.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/gzip_stream.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/printer.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/tokenizer.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/message.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/message_lite.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/reflection_ops.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/repeated_field.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/service.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/common.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/once.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/template_util.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/stubs/type_traits.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/text_format.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/unknown_field_set.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/wire_format.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/wire_format_lite.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace protobuf {$/;"	n	namespace:google
+protobuf_AddDesc_meta_2eproto	src/meta.pb.cc	/^void protobuf_AddDesc_meta_2eproto() {$/;"	f	namespace:ps
+protobuf_AddDesc_meta_2eproto_impl	src/meta.pb.cc	/^void protobuf_AddDesc_meta_2eproto_impl() {$/;"	f	namespace:ps
+protobuf_ShutdownFile_meta_2eproto	src/meta.pb.cc	/^void protobuf_ShutdownFile_meta_2eproto() {$/;"	f	namespace:ps
+prototypes_	deps/include/google/protobuf/dynamic_message.h	/^  scoped_ptr<PrototypeMap> prototypes_;$/;"	m	class:google::protobuf::DynamicMessageFactory
+prototypes_mutex_	deps/include/google/protobuf/dynamic_message.h	/^  mutable Mutex prototypes_mutex_;$/;"	m	class:google::protobuf::DynamicMessageFactory
+ps	include/ps/base.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/assign_op.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/customer.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/env.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/message.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/parallel_kv_match.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/parallel_sort.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/postoffice.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/threadsafe_queue.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/utils.h	/^namespace ps {$/;"	n
+ps	include/ps/internal/van.h	/^namespace ps {$/;"	n
+ps	include/ps/kv_app.h	/^namespace ps {$/;"	n
+ps	include/ps/ps.h	/^namespace ps {$/;"	n
+ps	include/ps/range.h	/^namespace ps {$/;"	n
+ps	include/ps/sarray.h	/^namespace ps {$/;"	n
+ps	include/ps/simple_app.h	/^namespace ps {$/;"	n
+ps	src/customer.cc	/^namespace ps {$/;"	n	file:
+ps	src/meta.pb.cc	/^namespace ps {$/;"	n	file:
+ps	src/network_utils.h	/^namespace ps {$/;"	n
+ps	src/postoffice.cc	/^namespace ps {$/;"	n	file:
+ps	src/resender.h	/^namespace ps {$/;"	n
+ps	src/van.cc	/^namespace ps {$/;"	n	file:
+ps	src/zmq_van.h	/^namespace ps {$/;"	n
+ptr	include/ps/sarray.h	/^  inline const std::shared_ptr<V>& ptr() const { return ptr_; }$/;"	f	class:ps::SArray
+ptr	include/ps/sarray.h	/^  inline std::shared_ptr<V>& ptr() { return ptr_; }$/;"	f	class:ps::SArray
+ptr_	deps/include/google/protobuf/stubs/common.h	/^  C* ptr_;$/;"	m	class:google::protobuf::internal::scoped_ptr
+ptr_	include/ps/sarray.h	/^  std::shared_ptr<V> ptr_;$/;"	m	class:ps::SArray
+public_dependencies_	deps/include/google/protobuf/descriptor.h	/^  int* public_dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
+public_dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::public_dependency($/;"	f	class:google::protobuf::FileDescriptor
+public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::public_dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FileDescriptorProto::public_dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+public_dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > public_dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
+public_dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int public_dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
+public_dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::public_dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+push	include/ps/internal/message.h	/^  bool push;$/;"	m	struct:ps::Meta
+push	include/ps/kv_app.h	/^  bool push;$/;"	m	struct:ps::KVMeta
+push_back	include/ps/sarray.h	/^  inline void push_back(const V& val) {$/;"	f	class:ps::SArray
+py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::py_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
+py_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool py_generic_services_;$/;"	m	class:google::protobuf::FileOptions
+pygments_style	docs/conf.py	/^pygments_style = 'sphinx'$/;"	v
+python	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace python {$/;"	n	namespace:google::protobuf::compiler
+queue_	include/ps/internal/threadsafe_queue.h	/^  std::queue<T> queue_;$/;"	m	class:ps::ThreadsafeQueue
+rand_r	src/zmq_van.h	/^#define rand_r(/;"	d
+random	src/windows/unistd.h	/^#define random /;"	d
+random	tracker/tracker.py	/^import random$/;"	i
+raw_data	deps/include/google/protobuf/repeated_field.h	/^inline void* const* RepeatedPtrFieldBase::raw_data() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+raw_mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline void** RepeatedPtrFieldBase::raw_mutable_data() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+rbegin	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rbegin() const {$/;"	f	class:google::protobuf::RepeatedField
+rbegin	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rbegin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+rbegin	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rbegin() {$/;"	f	class:google::protobuf::RepeatedField
+rbegin	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rbegin() {$/;"	f	class:google::protobuf::RepeatedPtrField
+re	tests/lint.py	/^import re$/;"	i
+read_error_	deps/include/google/protobuf/io/tokenizer.h	/^  bool read_error_;         \/\/ Did we previously encounter a read error?$/;"	m	class:google::protobuf::io::Tokenizer
+receiver_	src/zmq_van.h	/^  void *receiver_ = nullptr;$/;"	m	class:ps::ZMQVan
+receiver_thread_	include/ps/internal/van.h	/^  std::unique_ptr<std::thread> receiver_thread_;$/;"	m	class:ps::Van
+record_start_	deps/include/google/protobuf/io/tokenizer.h	/^  int record_start_;$/;"	m	class:google::protobuf::io::Tokenizer
+record_target_	deps/include/google/protobuf/io/tokenizer.h	/^  string* record_target_;$/;"	m	class:google::protobuf::io::Tokenizer
+recursion_depth_	deps/include/google/protobuf/io/coded_stream.h	/^  int recursion_depth_;$/;"	m	class:google::protobuf::io::CodedInputStream
+recursion_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int recursion_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
+recv_bytes_	include/ps/internal/van.h	/^  size_t recv_bytes_ = 0;$/;"	m	class:ps::Van
+recv_handle_	include/ps/internal/customer.h	/^  RecvHandle recv_handle_;$/;"	m	class:ps::Customer
+recv_kvs_	include/ps/kv_app.h	/^  std::unordered_map<int, std::vector<KVPairs<Val>>> recv_kvs_;$/;"	m	class:ps::KVWorker
+recv_queue_	include/ps/internal/customer.h	/^  ThreadsafeQueue<Message> recv_queue_;$/;"	m	class:ps::Customer
+recv_thread_	include/ps/internal/customer.h	/^  std::unique_ptr<std::thread> recv_thread_;$/;"	m	class:ps::Customer
+recvall	tracker/tracker.py	/^    def recvall(self, nbytes):$/;"	m	class:ExSocket
+recver	include/ps/internal/message.h	/^  int recver;$/;"	m	struct:ps::Meta
+recvint	tracker/tracker.py	/^    def recvint(self):$/;"	m	class:ExSocket
+recvstr	tracker/tracker.py	/^    def recvstr(self):$/;"	m	class:ExSocket
+reference	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::reference reference;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
+reference	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::reference reference;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+reference	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type& reference;$/;"	t	class:google::protobuf::RepeatedField
+reference	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type& reference;$/;"	t	class:google::protobuf::RepeatedPtrField
+reflection	deps/include/google/protobuf/message.h	/^  const Reflection* reflection;$/;"	m	struct:google::protobuf::Metadata
+release	deps/include/google/protobuf/stubs/common.h	/^  C* release() {$/;"	f	class:google::protobuf::internal::scoped_array
+release	deps/include/google/protobuf/stubs/common.h	/^  C* release() {$/;"	f	class:google::protobuf::internal::scoped_ptr
+release	docs/conf.py	/^release = u'1.0'$/;"	v
+release_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+release_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+release_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+release_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse::release_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+release_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldOptions::release_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
+release_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+release_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_go_package() {$/;"	f	class:google::protobuf::FileOptions
+release_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+release_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+release_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+release_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
+release_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_java_package() {$/;"	f	class:google::protobuf::FileOptions
+release_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::release_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+release_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* DescriptorProto::release_name() {$/;"	f	class:google::protobuf::DescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumDescriptorProto::release_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumValueDescriptorProto::release_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::release_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* ServiceDescriptorProto::release_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+release_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption_NamePart::release_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumOptions* EnumDescriptorProto::release_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::release_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions* FieldDescriptorProto::release_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions* FileDescriptorProto::release_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MessageOptions* DescriptorProto::release_options() {$/;"	f	class:google::protobuf::DescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodOptions* MethodDescriptorProto::release_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::release_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+release_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+release_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::release_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
+release_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::release_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+release_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::release_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
+release_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+release_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::release_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+release_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+remove_const	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_const	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const<T const> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_cv	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_cv {$/;"	s	namespace:google::protobuf::internal
+remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const volatile> {$/;"	s	namespace:google::protobuf::internal
+remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* volatile> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T*> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference<T&> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_volatile	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+remove_volatile	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile<T volatile> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
+rend	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rend() const {$/;"	f	class:google::protobuf::RepeatedField
+rend	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rend() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+rend	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rend() {$/;"	f	class:google::protobuf::RepeatedField
+rend	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rend() {$/;"	f	class:google::protobuf::RepeatedPtrField
+repeated_bool_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <bool       >* repeated_bool_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_double_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <double     >* repeated_double_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_enum_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int        >* repeated_enum_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_float_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <float      >* repeated_float_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_int32_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int32      >* repeated_int32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_int64_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int64      >* repeated_int64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_message_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedPtrField<MessageLite>* repeated_message_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_string_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedPtrField<string     >* repeated_string_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_uint32_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <uint32     >* repeated_uint32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+repeated_uint64_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <uint64     >* repeated_uint64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+request	include/ps/internal/message.h	/^  bool request;$/;"	m	struct:ps::Meta
+request_handle_	include/ps/kv_app.h	/^  ReqHandle request_handle_;$/;"	m	class:ps::KVServer
+request_handle_	include/ps/simple_app.h	/^  Handle request_handle_;$/;"	m	class:ps::SimpleApp
+require_syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  bool require_syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
+resender_	include/ps/internal/van.h	/^  Resender* resender_ = nullptr;$/;"	m	class:ps::Van
+reserve	include/ps/sarray.h	/^  void reserve(size_t size) {$/;"	f	class:ps::SArray
+reset	deps/include/google/protobuf/stubs/common.h	/^  void reset(C* p = NULL) {$/;"	f	class:google::protobuf::internal::scoped_array
+reset	deps/include/google/protobuf/stubs/common.h	/^  void reset(C* p = NULL) {$/;"	f	class:google::protobuf::internal::scoped_ptr
+reset	include/ps/sarray.h	/^  void reset(V* data, size_t size, Deleter del) {$/;"	f	class:ps::SArray
+resize	include/ps/sarray.h	/^  void resize(size_t size, V val = 0) {$/;"	f	class:ps::SArray
+response_handle_	include/ps/simple_app.h	/^  Handle response_handle_;$/;"	m	class:ps::SimpleApp
+revents	deps/include/zmq.h	/^    short revents;$/;"	m	struct:zmq_pollitem_t
+reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<iterator> reverse_iterator;$/;"	t	class:google::protobuf::RepeatedField
+reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<iterator> reverse_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
+role	include/ps/internal/message.h	/^  Role role;$/;"	m	struct:ps::Node
+run	tracker/dmlc_local.py	/^    def run(self):$/;"	m	class:LocalLauncher
+run	tracker/dmlc_mpi.py	/^    def run(prog):$/;"	f	function:mpi_submit
+run	tracker/dmlc_ssh.py	/^            def run(prog):$/;"	f	function:SSHLauncher.submit.ssh_submit
+run	tracker/dmlc_ssh.py	/^    def run(self):$/;"	m	class:SSHLauncher
+run	tracker/tracker.py	/^        def run():$/;"	f	function:RabitTracker.start
+scheduler_	include/ps/internal/van.h	/^  Node scheduler_;$/;"	m	class:ps::Van
+scoped_array	deps/include/google/protobuf/stubs/common.h	/^  explicit scoped_array(C* p = NULL) : array_(p) { }$/;"	f	class:google::protobuf::internal::scoped_array
+scoped_array	deps/include/google/protobuf/stubs/common.h	/^class scoped_array {$/;"	c	namespace:google::protobuf::internal
+scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^  explicit scoped_ptr(C* p = NULL) : ptr_(p) { }$/;"	f	class:google::protobuf::internal::scoped_ptr
+scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^class scoped_ptr {$/;"	c	namespace:google::protobuf::internal
+segment	include/ps/sarray.h	/^  SArray<V> segment(size_t begin, size_t end) const {$/;"	f	class:ps::SArray
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure0
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure0
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure1
+self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure2
+send	src/resender.h	/^    Time send;$/;"	m	struct:ps::Resender::Entry
+send_buff_	src/resender.h	/^  std::unordered_map<uint64_t, Entry> send_buff_;$/;"	m	class:ps::Resender
+sender	include/ps/internal/message.h	/^  int sender;$/;"	m	struct:ps::Meta
+sender	include/ps/kv_app.h	/^  int sender;$/;"	m	struct:ps::KVMeta
+sender	include/ps/simple_app.h	/^  int sender;$/;"	m	struct:ps::SimpleData
+senders_	src/zmq_van.h	/^  std::unordered_map<int, void*> senders_;$/;"	m	class:ps::ZMQVan
+sendint	tracker/tracker.py	/^    def sendint(self, n):$/;"	m	class:ExSocket
+sendstr	tracker/tracker.py	/^    def sendstr(self, s):$/;"	m	class:ExSocket
+server_key_ranges_	include/ps/internal/postoffice.h	/^  std::vector<Range> server_key_ranges_;$/;"	m	class:ps::Postoffice
+service	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::service() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+service	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::ServiceDescriptorProto& FileDescriptorProto::service(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+service_	deps/include/google/protobuf/descriptor.h	/^  const ServiceDescriptor* service_;$/;"	m	class:google::protobuf::MethodDescriptor
+service_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto > service_;$/;"	m	class:google::protobuf::FileDescriptorProto
+service_count_	deps/include/google/protobuf/descriptor.h	/^  int service_count_;$/;"	m	class:google::protobuf::FileDescriptor
+service_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::service_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+services_	deps/include/google/protobuf/descriptor.h	/^  ServiceDescriptor* services_;$/;"	m	class:google::protobuf::FileDescriptor
+set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_allocated_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_aggregate_value(::std::string* aggregate_value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_allocated_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_content(::std::string* content) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_allocated_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_default_value(::std::string* default_value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_allocated_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_allocated_error(::std::string* error) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+set_allocated_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_allocated_experimental_map_key(::std::string* experimental_map_key) {$/;"	f	class:google::protobuf::FieldOptions
+set_allocated_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_extendee(::std::string* extendee) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_allocated_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_go_package(::std::string* go_package) {$/;"	f	class:google::protobuf::FileOptions
+set_allocated_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_identifier_value(::std::string* identifier_value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_allocated_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_input_type(::std::string* input_type) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_allocated_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_insertion_point(::std::string* insertion_point) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_allocated_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_java_outer_classname(::std::string* java_outer_classname) {$/;"	f	class:google::protobuf::FileOptions
+set_allocated_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_java_package(::std::string* java_package) {$/;"	f	class:google::protobuf::FileOptions
+set_allocated_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_allocated_leading_comments(::std::string* leading_comments) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_allocated_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::DescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_allocated_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_allocated_name_part(::std::string* name_part) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_allocated_options(::google::protobuf::MessageOptions* options) {$/;"	f	class:google::protobuf::DescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_allocated_options(::google::protobuf::EnumOptions* options) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_allocated_options(::google::protobuf::EnumValueOptions* options) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_options(::google::protobuf::FieldOptions* options) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_options(::google::protobuf::FileOptions* options) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_options(::google::protobuf::MethodOptions* options) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_allocated_options(::google::protobuf::ServiceOptions* options) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_allocated_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_output_type(::std::string* output_type) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_allocated_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_package(::std::string* package) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_allocated_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_allocated_parameter(::std::string* parameter) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_allocated_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_allocated_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_string_value(::std::string* string_value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_allocated_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_allocated_trailing_comments(::std::string* trailing_comments) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_allocated_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_type_name(::std::string* type_name) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::set_allow_alias(bool value) {$/;"	f	class:google::protobuf::EnumOptions
+set_allow_f_after_float	deps/include/google/protobuf/io/tokenizer.h	/^  void set_allow_f_after_float(bool value) { allow_f_after_float_ = value; }$/;"	f	class:google::protobuf::io::Tokenizer
+set_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_cc_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
+set_comment_style	deps/include/google/protobuf/io/tokenizer.h	/^  void set_comment_style(CommentStyle style) { comment_style_ = style; }$/;"	f	class:google::protobuf::io::Tokenizer
+set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_ctype(::google::protobuf::FieldOptions_CType value) {$/;"	f	class:google::protobuf::FieldOptions
+set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_deprecated(bool value) {$/;"	f	class:google::protobuf::FieldOptions
+set_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_double_value(double value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_end(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldOptions
+set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const char* value) {$/;"	f	class:google::protobuf::FieldOptions
+set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldOptions
+set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_fixed32	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_fixed32(uint32 value) {$/;"	f	class:google::protobuf::UnknownField
+set_fixed64	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_fixed64(uint64 value) {$/;"	f	class:google::protobuf::UnknownField
+set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
+set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const char* value) {$/;"	f	class:google::protobuf::FileOptions
+set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
+set_has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::set_has_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
+set_has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+set_has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_ctype() {$/;"	f	class:google::protobuf::FieldOptions
+set_has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
+set_has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_has_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+set_has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_has_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+set_has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
+set_has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_go_package() {$/;"	f	class:google::protobuf::FileOptions
+set_has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_has_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
+set_has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+set_has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
+set_has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
+set_has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_package() {$/;"	f	class:google::protobuf::FileOptions
+set_has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_lazy() {$/;"	f	class:google::protobuf::FieldOptions
+set_has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_has_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_has_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
+set_has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::DescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_has_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_has_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
+set_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::DescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_packed() {$/;"	f	class:google::protobuf::FieldOptions
+set_has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_has_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
+set_has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_has_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+set_has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
+set_has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_has_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_weak() {$/;"	f	class:google::protobuf::FieldOptions
+set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_is_extension(bool value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_generate_equals_and_hash(bool value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_multiple_files(bool value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const char* value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
+set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const char* value) {$/;"	f	class:google::protobuf::FileOptions
+set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
+set_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_label(::google::protobuf::FieldDescriptorProto_Label value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_lazy(bool value) {$/;"	f	class:google::protobuf::FieldOptions
+set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const ::std::string& value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const char* value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const char* value, size_t size) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_length_delimited(const string& value) {$/;"	f	class:google::protobuf::UnknownField
+set_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_message_set_wire_format(bool value) {$/;"	f	class:google::protobuf::MessageOptions
+set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::DescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::DescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::DescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::EnumDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+set_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_negative_int_value(::google::protobuf::int64 value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_no_standard_descriptor_accessor(bool value) {$/;"	f	class:google::protobuf::MessageOptions
+set_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_number(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+set_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_number(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value) {$/;"	f	class:google::protobuf::FileOptions
+set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
+set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_packed(bool value) {$/;"	f	class:google::protobuf::FieldOptions
+set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+set_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_path(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_positive_int_value(::google::protobuf::uint64 value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_public_dependency(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+set_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_py_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
+set_request_handle	include/ps/kv_app.h	/^  void set_request_handle(const ReqHandle& request_handle) {$/;"	f	class:ps::KVServer
+set_request_handle	include/ps/simple_app.h	/^  virtual inline void set_request_handle(const Handle& request_handle) {$/;"	f	class:ps::SimpleApp
+set_response_handle	include/ps/simple_app.h	/^  virtual inline void set_response_handle(const Handle& response_handle) {$/;"	f	class:ps::SimpleApp
+set_slicer	include/ps/kv_app.h	/^  void set_slicer(const Slicer& slicer) {$/;"	f	class:ps::KVWorker
+set_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_span(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_start(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const void* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
+set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const ::std::string& value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const char* value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const char* value, size_t size) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+set_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type(::google::protobuf::FieldDescriptorProto_Type value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
+set_varint	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_varint(uint64 value) {$/;"	f	class:google::protobuf::UnknownField
+set_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_weak(bool value) {$/;"	f	class:google::protobuf::FieldOptions
+set_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_weak_dependency(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
+setup	docs/conf.py	/^def setup(app):$/;"	f
+signal	tracker/dmlc_local.py	/^import signal$/;"	i
+simple_app	include/ps/internal/message.h	/^  bool simple_app;$/;"	m	struct:ps::Meta
+single_line_mode_	deps/include/google/protobuf/text_format.h	/^    bool single_line_mode_;$/;"	m	class:google::protobuf::TextFormat::Printer
+size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::size() const {$/;"	f	class:google::protobuf::RepeatedField
+size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::size() const {$/;"	f	class:google::protobuf::RepeatedPtrField
+size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::size() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
+size	include/ps/range.h	/^  uint64_t size() const { return end_ - begin_; }$/;"	f	class:ps::Range
+size	include/ps/sarray.h	/^  inline size_t size() const { return size_; }$/;"	f	class:ps::SArray
+size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int size_;           \/\/ Total size of the array.$/;"	m	class:google::protobuf::io::ArrayInputStream
+size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int size_;           \/\/ Total size of the array.$/;"	m	class:google::protobuf::io::ArrayOutputStream
+size_	include/ps/sarray.h	/^  size_t size_ = 0;$/;"	m	class:ps::SArray
+size_type	deps/include/google/protobuf/repeated_field.h	/^  typedef int size_type;$/;"	t	class:google::protobuf::RepeatedField
+size_type	deps/include/google/protobuf/repeated_field.h	/^  typedef int size_type;$/;"	t	class:google::protobuf::RepeatedPtrField
+slave_envs	tracker/tracker.py	/^    def slave_envs(self):$/;"	m	class:PSTracker
+slave_envs	tracker/tracker.py	/^    def slave_envs(self):$/;"	m	class:RabitTracker
+slicer_	include/ps/kv_app.h	/^  Slicer slicer_;$/;"	m	class:ps::KVWorker
+small_	deps/include/google/protobuf/stubs/template_util.h	/^typedef char small_;$/;"	t	namespace:google::protobuf::internal
+snprintf	include/dmlc/base.h	/^#define snprintf /;"	d
+socket	deps/include/zmq.h	/^    void *socket;$/;"	m	struct:zmq_pollitem_t
+socket	tracker/tracker.py	/^import socket$/;"	i
+source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::SourceCodeInfo& FileDescriptorProto::source_code_info() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+source_code_info_	deps/include/google/protobuf/compiler/parser.h	/^  SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::compiler::Parser
+source_code_info_	deps/include/google/protobuf/descriptor.h	/^  const SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::FileDescriptor
+source_code_info_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::FileDescriptorProto
+source_info_in_descriptor_set_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool source_info_in_descriptor_set_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+source_location_table_	deps/include/google/protobuf/compiler/parser.h	/^  SourceLocationTable* source_location_table_;  \/\/ legacy$/;"	m	class:google::protobuf::compiler::Parser
+source_locations_	deps/include/google/protobuf/compiler/importer.h	/^  SourceLocationTable source_locations_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+source_parsers	docs/conf.py	/^source_parsers = {$/;"	v
+source_suffix	docs/conf.py	/^source_suffix = ['.md']$/;"	v
+source_tree_	deps/include/google/protobuf/compiler/importer.h	/^  SourceTree* source_tree_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+sources_	deps/include/google/protobuf/descriptor_database.h	/^  vector<DescriptorDatabase*> sources_;$/;"	m	class:google::protobuf::MergedDescriptorDatabase
+span	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::span() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+span	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 SourceCodeInfo_Location::span(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+span_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > span_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+span_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo_Location::span_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+srandom	src/windows/unistd.h	/^#define srandom /;"	d
+ssh_submit	tracker/dmlc_ssh.py	/^        def ssh_submit(nworker, nserver, pass_envs):$/;"	f	function:SSHLauncher.submit
+ssize_t	src/windows/unistd.h	/^#define ssize_t /;"	d
+start	deps/include/google/protobuf/descriptor.h	/^    int start;  \/\/ inclusive$/;"	m	struct:google::protobuf::Descriptor::ExtensionRange
+start	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::start() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+start	tracker/tracker.py	/^    def start(self, nslave):$/;"	m	class:RabitTracker
+start_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 start_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
+start_column	deps/include/google/protobuf/descriptor.h	/^  int start_column;$/;"	m	struct:google::protobuf::SourceLocation
+start_line	deps/include/google/protobuf/descriptor.h	/^  int start_line;$/;"	m	struct:google::protobuf::SourceLocation
+start_time_	include/ps/internal/postoffice.h	/^  time_t start_time_;$/;"	m	class:ps::Postoffice
+static_descriptor_initializer_meta_2eproto_	src/meta.pb.cc	/^} static_descriptor_initializer_meta_2eproto_;$/;"	m	namespace:ps	typeref:struct:ps::StaticDescriptorInitializer_meta_2eproto	file:
+std	deps/include/google/protobuf/stubs/common.h	/^namespace std {}$/;"	n
+stop_after_syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  bool stop_after_syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
+store	include/ps/kv_app.h	/^  std::unordered_map<Key, Val> store;$/;"	m	struct:ps::KVServerDefaultHandle
+stream_count_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int stream_count_;$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
+streams_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  ZeroCopyInputStream* const* streams_;$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
+string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::string_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
+string_value	deps/include/google/protobuf/extension_set.h	/^      string*               string_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+string_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* string_value_;$/;"	m	class:google::protobuf::UninterpretedOption
+string_value_	deps/include/google/protobuf/unknown_field_set.h	/^      string* string_value_;$/;"	m	union:google::protobuf::UnknownField::__anon4::__anon5
+struct	tracker/tracker.py	/^import struct$/;"	i
+sub_data_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* sub_data_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+sub_data_size_	deps/include/google/protobuf/io/gzip_stream.h	/^  int sub_data_size_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+sub_stream_	deps/include/google/protobuf/io/gzip_stream.h	/^  ZeroCopyInputStream* sub_stream_;$/;"	m	class:google::protobuf::io::GzipInputStream
+sub_stream_	deps/include/google/protobuf/io/gzip_stream.h	/^  ZeroCopyOutputStream* sub_stream_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+submit	tracker/dmlc_local.py	/^    def submit(self):$/;"	m	class:LocalLauncher
+submit	tracker/dmlc_ssh.py	/^    def submit(self):$/;"	m	class:SSHLauncher
+submit	tracker/tracker.py	/^def submit(nworker, nserver, fun_submit, hostIP = 'auto', pscmd = None):$/;"	f
+subprocess	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
+subprocess	tracker/dmlc_local.py	/^import subprocess$/;"	i
+subprocess	tracker/dmlc_mpi.py	/^import subprocess$/;"	i
+subprocess	tracker/dmlc_ssh.py	/^import subprocess$/;"	i
+subprocess	tracker/tracker.py	/^import subprocess$/;"	i
+superclass	deps/include/google/protobuf/repeated_field.h	/^          std::random_access_iterator_tag, Element*> superclass;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
+superclass	deps/include/google/protobuf/repeated_field.h	/^          std::random_access_iterator_tag, Element> superclass;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
+swap	deps/include/google/protobuf/stubs/common.h	/^  void swap(scoped_array& p2) {$/;"	f	class:google::protobuf::internal::scoped_array
+swap	deps/include/google/protobuf/stubs/common.h	/^  void swap(scoped_ptr& p2) {$/;"	f	class:google::protobuf::internal::scoped_ptr
+sync_dir	tracker/dmlc_ssh.py	/^    def sync_dir(self, local_dir, slave_node, slave_dir):$/;"	m	class:SSHLauncher
+syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  string syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
+sys	docs/conf.py	/^import sys$/;"	i
+sys	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
+sys	tests/lint.py	/^import sys$/;"	i
+sys	tracker/dmlc_local.py	/^import sys$/;"	i
+sys	tracker/dmlc_mpi.py	/^import sys$/;"	i
+sys	tracker/dmlc_ssh.py	/^import sys$/;"	i
+sys	tracker/tracker.py	/^import sys$/;"	i
+tables_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptorTables* tables_;$/;"	m	class:google::protobuf::FileDescriptor
+tables_	deps/include/google/protobuf/descriptor.h	/^  scoped_ptr<Tables> tables_;$/;"	m	class:google::protobuf::DescriptorPool
+target_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  string* target_;$/;"	m	class:google::protobuf::io::StringOutputStream
+templates_path	docs/conf.py	/^templates_path = ['_templates']$/;"	v
+texinfo_documents	docs/conf.py	/^texinfo_documents = [$/;"	v
+text	deps/include/google/protobuf/io/tokenizer.h	/^    string text;       \/\/ The exact text of the token as it appeared in$/;"	m	struct:google::protobuf::io::Tokenizer::Token
+time	tracker/tracker.py	/^import time$/;"	i
+timeout_	src/resender.h	/^  int timeout_;$/;"	m	class:ps::Resender
+timestamp	include/ps/internal/message.h	/^  int timestamp;$/;"	m	struct:ps::Meta
+timestamp	include/ps/kv_app.h	/^  int timestamp;$/;"	m	struct:ps::KVMeta
+timestamp	include/ps/simple_app.h	/^  int timestamp;$/;"	m	struct:ps::SimpleData
+todo_include_todos	docs/conf.py	/^todo_include_todos = False$/;"	v
+total_bytes_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_;  \/\/ Sum of sizes of all buffers seen so far.$/;"	m	class:google::protobuf::io::CodedOutputStream
+total_bytes_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
+total_bytes_read_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_read_;  \/\/ total bytes read from input_, including$/;"	m	class:google::protobuf::io::CodedInputStream
+total_bytes_warning_threshold_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_warning_threshold_;$/;"	m	class:google::protobuf::io::CodedInputStream
+total_size_	deps/include/google/protobuf/repeated_field.h	/^  int      total_size_;$/;"	m	class:google::protobuf::RepeatedField
+total_size_	deps/include/google/protobuf/repeated_field.h	/^  int    total_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
+tracker	tracker/dmlc_local.py	/^import tracker$/;"	i
+tracker	tracker/dmlc_mpi.py	/^import tracker$/;"	i
+tracker	tracker/dmlc_ssh.py	/^import tracker$/;"	i
+tracker_	include/ps/internal/customer.h	/^  std::vector<std::pair<int, int>> tracker_;$/;"	m	class:ps::Customer
+tracker_cond_	include/ps/internal/customer.h	/^  std::condition_variable tracker_cond_;$/;"	m	class:ps::Customer
+tracker_mu_	include/ps/internal/customer.h	/^  std::mutex tracker_mu_;$/;"	m	class:ps::Customer
+trailing_comments	deps/include/google/protobuf/descriptor.h	/^  string trailing_comments;$/;"	m	struct:google::protobuf::SourceLocation
+trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& SourceCodeInfo_Location::trailing_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+trailing_comments_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* trailing_comments_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
+transform	docs/sphinx_util.py	/^from recommonmark import parser, transform$/;"	i
+true_	deps/include/google/protobuf/stubs/template_util.h	/^typedef true_type  true_;$/;"	t	namespace:google::protobuf::internal
+true_type	deps/include/google/protobuf/stubs/template_util.h	/^typedef integral_constant<bool, true>  true_type;$/;"	t	namespace:google::protobuf::internal
+type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto_Type FieldDescriptorProto::type() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+type	deps/include/google/protobuf/extension_set.h	/^    FieldType type;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
+type	deps/include/google/protobuf/extension_set.h	/^  FieldType type;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
+type	deps/include/google/protobuf/io/tokenizer.h	/^    TokenType type;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
+type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef A type;$/;"	t	struct:google::protobuf::internal::if_
+type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef B type;$/;"	t	struct:google::protobuf::internal::if_
+type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef T type;$/;"	t	struct:google::protobuf::internal::identity_
+type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef integral_constant<T, v> type;$/;"	t	struct:google::protobuf::internal::integral_constant
+type	deps/include/google/protobuf/stubs/type_traits.h	/^  typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
+type	deps/include/google/protobuf/stubs/type_traits.h	/^  typedef typename remove_const<typename remove_volatile<T>::type>::type type;$/;"	t	struct:google::protobuf::internal::remove_cv
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference { typedef T& type; };$/;"	t	struct:google::protobuf::internal::add_reference
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference<T&> { typedef T& type; };$/;"	t	struct:google::protobuf::internal::add_reference
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_const
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const<T const> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_const
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* volatile> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T*> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_reference
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference<T&> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_reference
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_volatile
+type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile<T volatile> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_volatile
+type	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownField::Type UnknownField::type() const {$/;"	f	class:google::protobuf::UnknownField
+type_	deps/include/google/protobuf/descriptor.h	/^  Type type_;$/;"	m	class:google::protobuf::FieldDescriptor
+type_	deps/include/google/protobuf/descriptor.h	/^  const EnumDescriptor* type_;$/;"	m	class:google::protobuf::EnumValueDescriptor
+type_	deps/include/google/protobuf/descriptor.pb.h	/^  int type_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+type_equals_	deps/include/google/protobuf/stubs/template_util.h	/^struct type_equals_ : public false_ {$/;"	s	namespace:google::protobuf::internal
+type_equals_	deps/include/google/protobuf/stubs/template_util.h	/^struct type_equals_<A, A> : public true_ {$/;"	s	namespace:google::protobuf::internal
+type_name	deps/include/google/protobuf/descriptor.h	/^inline const char* FieldDescriptor::type_name() const {$/;"	f	class:google::protobuf::FieldDescriptor
+type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::type_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+type_name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* type_name_;$/;"	m	class:google::protobuf::FieldDescriptorProto
+uint	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned int uint;$/;"	t	namespace:google::protobuf
+uint16	deps/include/google/protobuf/stubs/common.h	/^typedef uint16_t uint16;$/;"	t	namespace:google::protobuf
+uint16	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int16 uint16;$/;"	t	namespace:google::protobuf
+uint16_t	include/dmlc/base.h	/^typedef unsigned __int16 uint16_t;$/;"	t
+uint16_t	include/ps/internal/utils.h	/^typedef unsigned __int16 uint16_t;$/;"	t	namespace:ps
+uint32	deps/include/google/protobuf/stubs/common.h	/^typedef uint32_t uint32;$/;"	t	namespace:google::protobuf
+uint32	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int32 uint32;$/;"	t	namespace:google::protobuf
+uint32_t	include/dmlc/base.h	/^typedef unsigned __int32 uint32_t;$/;"	t
+uint32_t	include/ps/internal/utils.h	/^typedef unsigned __int32 uint32_t;$/;"	t	namespace:ps
+uint32_value	deps/include/google/protobuf/extension_set.h	/^      uint32                uint32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+uint64	deps/include/google/protobuf/stubs/common.h	/^typedef uint64_t uint64;$/;"	t	namespace:google::protobuf
+uint64	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int64 uint64;$/;"	t	namespace:google::protobuf
+uint64_t	include/dmlc/base.h	/^typedef unsigned __int64 uint64_t;$/;"	t
+uint64_t	include/ps/internal/utils.h	/^typedef unsigned __int64 uint64_t;$/;"	t	namespace:ps
+uint64_value	deps/include/google/protobuf/extension_set.h	/^      uint64                uint64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
+uint8	deps/include/google/protobuf/stubs/common.h	/^typedef uint8_t  uint8;$/;"	t	namespace:google::protobuf
+uint8	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int8  uint8;$/;"	t	namespace:google::protobuf
+uint8_t	include/dmlc/base.h	/^typedef unsigned char uint8_t;$/;"	t
+uint8_t	include/ps/internal/utils.h	/^typedef unsigned char    uint8_t;$/;"	t	namespace:ps
+underlay_	deps/include/google/protobuf/descriptor.h	/^  const DescriptorPool* underlay_;$/;"	m	class:google::protobuf::DescriptorPool
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::EnumOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumValueOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::EnumValueOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FieldOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::FieldOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FileOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::FileOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MessageOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::MessageOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MethodOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::MethodOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^ServiceOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::ServiceOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& EnumOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::EnumOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& EnumValueOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::EnumValueOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& FieldOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::FieldOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& FileOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::FileOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& MessageOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::MessageOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& MethodOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::MethodOptions
+uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& ServiceOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::ServiceOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::EnumOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::EnumValueOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::FieldOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::FileOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::MessageOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::MethodOptions
+uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::ServiceOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::EnumOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumValueOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::EnumValueOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FieldOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::FieldOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::FileOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int MessageOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::MessageOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int MethodOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::MethodOptions
+uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int ServiceOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::ServiceOptions
+unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
+unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
+unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::DescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumValueOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FieldOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileDescriptorSet
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MessageOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MethodOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::ServiceOptions
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::SourceCodeInfo
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::UninterpretedOption
+unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
+unknown_fields_	deps/include/google/protobuf/wire_format.h	/^  UnknownFieldSet* unknown_fields_;$/;"	m	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
+unknown_fields_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int unknown_fields_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
+unlink	src/windows/unistd.h	/^#define unlink /;"	d
+upb	deps/include/google/protobuf/generated_message_reflection.h	/^namespace upb {$/;"	n	namespace:google
+upb	deps/include/google/protobuf/repeated_field.h	/^namespace upb {$/;"	n	namespace:google
+upcoming_doc_comments_	deps/include/google/protobuf/compiler/parser.h	/^  string upcoming_doc_comments_;$/;"	m	class:google::protobuf::compiler::Parser
+use_short_repeated_primitives_	deps/include/google/protobuf/text_format.h	/^    bool use_short_repeated_primitives_;$/;"	m	class:google::protobuf::TextFormat::Printer
+using_validation_error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  bool using_validation_error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+utf8_string_escaping_	deps/include/google/protobuf/text_format.h	/^    bool utf8_string_escaping_;$/;"	m	class:google::protobuf::TextFormat::Printer
+validation_error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  ValidationErrorCollector validation_error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
+vals	include/ps/kv_app.h	/^  SArray<Val> vals;$/;"	m	struct:ps::KVPairs
+value	deps/include/google/protobuf/descriptor.pb.h	/^EnumDescriptorProto::value() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumValueDescriptorProto& EnumDescriptorProto::value(int index) const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+value	deps/include/google/protobuf/io/coded_stream.h	/^    static const int value =$/;"	m	struct:google::protobuf::io::CodedOutputStream::StaticVarintSize32
+value	deps/include/google/protobuf/stubs/template_util.h	/^  static const T value = v;$/;"	m	struct:google::protobuf::internal::integral_constant
+value	deps/include/google/protobuf/stubs/template_util.h	/^template <class T, T v> const T integral_constant<T, v>::value;$/;"	m	class:google::protobuf::internal::integral_constant
+value	deps/include/google/protobuf/stubs/type_traits.h	/^  static const bool value = sizeof(tester<T>(0)) == sizeof(small_);$/;"	m	struct:google::protobuf::internal::internal::is_class_or_union
+value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto > value_;$/;"	m	class:google::protobuf::EnumDescriptorProto
+value_count_	deps/include/google/protobuf/descriptor.h	/^  int value_count_;$/;"	m	class:google::protobuf::EnumDescriptor
+value_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumDescriptorProto::value_size() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
+value_type	deps/include/google/protobuf/repeated_field.h	/^  typedef Element value_type;$/;"	t	class:google::protobuf::RepeatedField
+value_type	deps/include/google/protobuf/repeated_field.h	/^  typedef Element value_type;$/;"	t	class:google::protobuf::RepeatedPtrField
+value_type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef T value_type;$/;"	t	struct:google::protobuf::internal::integral_constant
+values_	deps/include/google/protobuf/descriptor.h	/^  EnumValueDescriptor* values_;$/;"	m	class:google::protobuf::EnumDescriptor
+van	include/ps/internal/postoffice.h	/^  Van* van() { return van_; }$/;"	f	class:ps::Postoffice
+van_	include/ps/internal/postoffice.h	/^  Van* van_;$/;"	m	class:ps::Postoffice
+van_	src/resender.h	/^  Van* van_;$/;"	m	class:ps::Resender
+variable_delimiter_	deps/include/google/protobuf/io/printer.h	/^  const char variable_delimiter_;$/;"	m	class:google::protobuf::io::Printer
+varint	deps/include/google/protobuf/unknown_field_set.h	/^inline uint64 UnknownField::varint () const {$/;"	f	class:google::protobuf::UnknownField
+varint_	deps/include/google/protobuf/unknown_field_set.h	/^    uint64 varint_;$/;"	m	union:google::protobuf::UnknownField::__anon4
+verbose	include/ps/internal/postoffice.h	/^  int verbose() const { return verbose_; }$/;"	f	class:ps::Postoffice
+verbose_	include/ps/internal/postoffice.h	/^  int verbose_;$/;"	m	class:ps::Postoffice
+version	docs/conf.py	/^version = u'1.0'$/;"	v
+version_info_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string version_info_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
+virtual_path	deps/include/google/protobuf/compiler/importer.h	/^    string virtual_path;$/;"	m	struct:google::protobuf::compiler::DiskSourceTree::Mapping
+vsnprintf	include/dmlc/base.h	/^#define vsnprintf /;"	d
+weak	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::weak() const {$/;"	f	class:google::protobuf::FieldOptions
+weak_	deps/include/google/protobuf/descriptor.pb.h	/^  bool weak_;$/;"	m	class:google::protobuf::FieldOptions
+weak_dependencies_	deps/include/google/protobuf/descriptor.h	/^  int* weak_dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
+weak_dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::weak_dependency($/;"	f	class:google::protobuf::FileDescriptor
+weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::weak_dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FileDescriptorProto::weak_dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
+weak_dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > weak_dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
+weak_dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int weak_dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
+weak_dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::weak_dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
+zcontext_	deps/include/google/protobuf/io/gzip_stream.h	/^  z_stream zcontext_;$/;"	m	class:google::protobuf::io::GzipInputStream
+zcontext_	deps/include/google/protobuf/io/gzip_stream.h	/^  z_stream zcontext_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+zerror_	deps/include/google/protobuf/io/gzip_stream.h	/^  int zerror_;$/;"	m	class:google::protobuf::io::GzipInputStream
+zerror_	deps/include/google/protobuf/io/gzip_stream.h	/^  int zerror_;$/;"	m	class:google::protobuf::io::GzipOutputStream
+zmq_free_fn	deps/include/zmq.h	/^typedef void (zmq_free_fn) (void *data, void *hint);$/;"	t
+zmq_msg_t	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	s
+zmq_msg_t	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	t	typeref:struct:zmq_msg_t
+zmq_pollitem_t	deps/include/zmq.h	/^typedef struct zmq_pollitem_t$/;"	s
+zmq_pollitem_t	deps/include/zmq.h	/^} zmq_pollitem_t;$/;"	t	typeref:struct:zmq_pollitem_t
+zmq_thread_fn	deps/include/zmq.h	/^typedef void (zmq_thread_fn) (void*);$/;"	t
+~Customer	src/customer.cc	/^Customer::~Customer() {$/;"	f	class:ps::Customer
+~FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^  virtual ~FieldSkipper() {}$/;"	f	class:google::protobuf::internal::FieldSkipper
+~FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^  ~FunctionClosure1() {}$/;"	f	class:google::protobuf::internal::FunctionClosure1
+~FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^  ~FunctionClosure2() {}$/;"	f	class:google::protobuf::internal::FunctionClosure2
+~GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^  virtual ~GeneratedExtensionFinder() {}$/;"	f	class:google::protobuf::internal::GeneratedExtensionFinder
+~KVServer	include/ps/kv_app.h	/^  virtual ~KVServer() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::KVServer
+~KVWorker	include/ps/kv_app.h	/^  virtual ~KVWorker() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::KVWorker
+~LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^    virtual ~LazyMessageExtension() {}$/;"	f	class:google::protobuf::internal::ExtensionSet::LazyMessageExtension
+~MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure0() {}$/;"	f	class:google::protobuf::internal::MethodClosure0
+~MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure1() {}$/;"	f	class:google::protobuf::internal::MethodClosure1
+~MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure2() {}$/;"	f	class:google::protobuf::internal::MethodClosure2
+~MutexLock	deps/include/google/protobuf/stubs/common.h	/^  ~MutexLock() { this->mu_->Unlock(); }$/;"	f	class:google::protobuf::internal::MutexLock
+~MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^  ~MutexLockMaybe() { if (this->mu_ != NULL) { this->mu_->Unlock(); } }$/;"	f	class:google::protobuf::internal::MutexLockMaybe
+~PBControl	src/meta.pb.cc	/^PBControl::~PBControl() {$/;"	f	class:ps::PBControl
+~PBMeta	src/meta.pb.cc	/^PBMeta::~PBMeta() {$/;"	f	class:ps::PBMeta
+~PBNode	src/meta.pb.cc	/^PBNode::~PBNode() {$/;"	f	class:ps::PBNode
+~Postoffice	include/ps/internal/postoffice.h	/^  ~Postoffice() { delete van_; }$/;"	f	class:ps::Postoffice
+~RepeatedField	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::~RepeatedField() {$/;"	f	class:google::protobuf::RepeatedField
+~RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::~RepeatedPtrField() {$/;"	f	class:google::protobuf::RepeatedPtrField
+~Resender	src/resender.h	/^  ~Resender() {$/;"	f	class:ps::Resender
+~SArray	include/ps/sarray.h	/^  ~SArray() { }$/;"	f	class:ps::SArray
+~SimpleApp	include/ps/simple_app.h	/^  virtual ~SimpleApp() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::SimpleApp
+~ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^  ~ThreadsafeQueue() { }$/;"	f	class:ps::ThreadsafeQueue
+~UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^  virtual ~UnknownFieldSetFieldSkipper() {}$/;"	f	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
+~Van	include/ps/internal/van.h	/^  virtual ~Van() { }$/;"	f	class:ps::Van
+~ZMQVan	src/zmq_van.h	/^  virtual ~ZMQVan() { }$/;"	f	class:ps::ZMQVan
+~scoped_array	deps/include/google/protobuf/stubs/common.h	/^  ~scoped_array() {$/;"	f	class:google::protobuf::internal::scoped_array
+~scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^  ~scoped_ptr() {$/;"	f	class:google::protobuf::internal::scoped_ptr
diff --git a/ps-lite/tests/README.md b/ps-lite/tests/README.md
new file mode 100644
index 00000000..a17e6cc0
--- /dev/null
+++ b/ps-lite/tests/README.md
@@ -0,0 +1,7 @@
+How to use
+
+build by `make test` in the root directory, then run
+
+```bash
+find test_* -type f -executable -exec ./repeat.sh 4 ./local.sh 2 2 ./{} \;
+```
diff --git a/ps-lite/tests/lint.py b/ps-lite/tests/lint.py
new file mode 100755
index 00000000..4dd898be
--- /dev/null
+++ b/ps-lite/tests/lint.py
@@ -0,0 +1,173 @@
+#!/usr/bin/env python
+# pylint: disable=protected-access, unused-variable, locally-disabled, redefined-variable-type
+"""Lint helper to generate lint summary of source.
+
+Copyright by Contributors
+"""
+import codecs
+import sys
+import re
+import os
+import cpplint
+from cpplint import _cpplint_state
+from pylint import epylint
+
+CXX_SUFFIX = set(['cc', 'c', 'cpp', 'h', 'cu', 'hpp'])
+PYTHON_SUFFIX = set(['py'])
+
+class LintHelper(object):
+    """Class to help runing the lint and records summary"""
+
+    @staticmethod
+    def _print_summary_map(strm, result_map, ftype):
+        """Print summary of certain result map."""
+        if len(result_map) == 0:
+            return 0
+        npass = len([x for k, x in result_map.iteritems() if len(x) == 0])
+        strm.write('=====%d/%d %s files passed check=====\n' % (npass, len(result_map), ftype))
+        for fname, emap in result_map.iteritems():
+            if len(emap) == 0:
+                continue
+            strm.write('%s: %d Errors of %d Categories map=%s\n' % (
+                fname, sum(emap.values()), len(emap), str(emap)))
+        return len(result_map) - npass
+
+    def __init__(self):
+        self.project_name = None
+        self.cpp_header_map = {}
+        self.cpp_src_map = {}
+        self.python_map = {}
+        pylint_disable = ['superfluous-parens',
+                          'too-many-instance-attributes',
+                          'too-few-public-methods']
+        # setup pylint
+        self.pylint_opts = ['--extension-pkg-whitelist=numpy',
+                            '--disable=' + ','.join(pylint_disable)]
+
+        self.pylint_cats = set(['error', 'warning', 'convention', 'refactor'])
+        # setup cpp lint
+        cpplint_args = ['.', '--extensions=' + (','.join(CXX_SUFFIX))]
+        _ = cpplint.ParseArguments(cpplint_args)
+        cpplint._SetFilters(','.join(['-build/c++11',
+                                      '-build/namespaces',
+                                      '-build/include,',
+                                      '+build/include_what_you_use',
+                                      '+build/include_order']))
+        cpplint._SetCountingStyle('toplevel')
+        cpplint._line_length = 100
+
+    def process_cpp(self, path, suffix):
+        """Process a cpp file."""
+        _cpplint_state.ResetErrorCounts()
+        cpplint.ProcessFile(str(path), _cpplint_state.verbose_level)
+        _cpplint_state.PrintErrorCounts()
+        errors = _cpplint_state.errors_by_category.copy()
+
+        if suffix == 'h':
+            self.cpp_header_map[str(path)] = errors
+        else:
+            self.cpp_src_map[str(path)] = errors
+
+    def process_python(self, path):
+        """Process a python file."""
+        (pylint_stdout, pylint_stderr) = epylint.py_run(
+            ' '.join([str(path)] + self.pylint_opts), return_std=True)
+        emap = {}
+        print pylint_stderr.read()
+        for line in pylint_stdout:
+            sys.stderr.write(line)
+            key = line.split(':')[-1].split('(')[0].strip()
+            if key not in self.pylint_cats:
+                continue
+            if key not in emap:
+                emap[key] = 1
+            else:
+                emap[key] += 1
+        sys.stderr.write('\n')
+        self.python_map[str(path)] = emap
+
+    def print_summary(self, strm):
+        """Print summary of lint."""
+        nerr = 0
+        nerr += LintHelper._print_summary_map(strm, self.cpp_header_map, 'cpp-header')
+        nerr += LintHelper._print_summary_map(strm, self.cpp_src_map, 'cpp-soruce')
+        nerr += LintHelper._print_summary_map(strm, self.python_map, 'python')
+        if nerr == 0:
+            strm.write('All passed!\n')
+        else:
+            strm.write('%d files failed lint\n' % nerr)
+        return nerr
+
+# singleton helper for lint check
+_HELPER = LintHelper()
+
+def get_header_guard_dmlc(filename):
+    """Get Header Guard Convention for DMLC Projects.
+
+    For headers in include, directly use the path
+    For headers in src, use project name plus path
+
+    Examples: with project-name = dmlc
+        include/dmlc/timer.h -> DMLC_TIMTER_H_
+        src/io/libsvm_parser.h -> DMLC_IO_LIBSVM_PARSER_H_
+    """
+    fileinfo = cpplint.FileInfo(filename)
+    file_path_from_root = fileinfo.RepositoryName()
+    inc_list = ['include', 'api', 'wrapper']
+
+    if file_path_from_root.find('src/') != -1 and _HELPER.project_name is not None:
+        idx = file_path_from_root.find('src/')
+        file_path_from_root = _HELPER.project_name +  file_path_from_root[idx + 3:]
+    else:
+        for spath in inc_list:
+            prefix = spath + os.sep
+            if file_path_from_root.startswith(prefix):
+                file_path_from_root = re.sub('^' + prefix, '', file_path_from_root)
+                break
+    return re.sub(r'[-./\s]', '_', file_path_from_root).upper() + '_'
+
+cpplint.GetHeaderGuardCPPVariable = get_header_guard_dmlc
+
+def process(fname, allow_type):
+    """Process a file."""
+    fname = str(fname)
+    arr = fname.rsplit('.', 1)
+    if fname.find('#') != -1 or arr[-1] not in allow_type:
+        return
+    if arr[-1] in CXX_SUFFIX and (not fname.endswith(".pb.h")) and (not fname.endswith(".pb.cc")):
+        _HELPER.process_cpp(fname, arr[-1])
+    if arr[-1] in PYTHON_SUFFIX:
+        _HELPER.process_python(fname)
+
+def main():
+    """Main entry function."""
+    if len(sys.argv) < 3:
+        print('Usage: <project-name> <filetype> <list-of-path to traverse>')
+        print('\tfiletype can be python/cpp/all')
+        exit(-1)
+    _HELPER.project_name = sys.argv[1]
+    file_type = sys.argv[2]
+    allow_type = []
+    if file_type == 'python' or file_type == 'all':
+        allow_type += [x for x in PYTHON_SUFFIX]
+    if file_type == 'cpp' or file_type == 'all':
+        allow_type += [x for x in CXX_SUFFIX]
+    allow_type = set(allow_type)
+    if os.name != 'nt':
+        sys.stderr = codecs.StreamReaderWriter(sys.stderr,
+                                               codecs.getreader('utf8'),
+                                               codecs.getwriter('utf8'),
+                                               'replace')
+    for path in sys.argv[3:]:
+        if os.path.isfile(path):
+            process(path, allow_type)
+        else:
+            for root, dirs, files in os.walk(path):
+                for name in files:
+                    process(os.path.join(root, name), allow_type)
+
+    nerr = _HELPER.print_summary(sys.stderr)
+    sys.exit(nerr > 0)
+
+if __name__ == '__main__':
+    main()
diff --git a/ps-lite/tests/local.sh b/ps-lite/tests/local.sh
new file mode 100755
index 00000000..089b1747
--- /dev/null
+++ b/ps-lite/tests/local.sh
@@ -0,0 +1,37 @@
+#!/bin/bash
+# set -x
+if [ $# -lt 3 ]; then
+    echo "usage: $0 num_servers num_workers bin [args..]"
+    exit -1;
+fi
+
+export DMLC_NUM_SERVER=$1
+shift
+export DMLC_NUM_WORKER=$1
+shift
+bin=$1
+shift
+arg="$@"
+
+# start the scheduler
+export DMLC_PS_ROOT_URI='127.0.0.1'
+export DMLC_PS_ROOT_PORT=8000
+export DMLC_ROLE='scheduler'
+${bin} ${arg} &
+
+
+# start servers
+export DMLC_ROLE='server'
+for ((i=0; i<${DMLC_NUM_SERVER}; ++i)); do
+    export HEAPPROFILE=./S${i}
+    ${bin} ${arg} &
+done
+
+# start workers
+export DMLC_ROLE='worker'
+for ((i=0; i<${DMLC_NUM_WORKER}; ++i)); do
+    export HEAPPROFILE=./W${i}
+    ${bin} ${arg} &
+done
+
+wait
diff --git a/ps-lite/tests/repeat.sh b/ps-lite/tests/repeat.sh
new file mode 100755
index 00000000..c38c1d2c
--- /dev/null
+++ b/ps-lite/tests/repeat.sh
@@ -0,0 +1,16 @@
+#!/bin/bash
+
+if [ $# -lt 2 ]; then
+    echo "usage: $0 num_repeats bin [args...]"
+    exit -1;
+fi
+np=$1
+shift
+
+for ((i=0; i<${np}; ++i)); do
+    echo "repeat $i: $@"
+    $@
+    if [ $? != 0 ]; then
+        break
+    fi
+done
diff --git a/ps-lite/tests/test.mk b/ps-lite/tests/test.mk
new file mode 100644
index 00000000..f4c6974e
--- /dev/null
+++ b/ps-lite/tests/test.mk
@@ -0,0 +1,10 @@
+TEST_SRC = $(wildcard tests/test_*.cc)
+TEST = $(patsubst tests/test_%.cc, tests/test_%, $(TEST_SRC))
+
+# -ltcmalloc_and_profiler
+LDFLAGS = -Wl,-rpath,$(DEPS_PATH)/lib $(PS_LDFLAGS_SO) -pthread
+tests/% : tests/%.cc build/libps.a
+	$(CXX) -std=c++0x $(CFLAGS) -MM -MT tests/$* $< >tests/$*.d
+	$(CXX) -std=c++0x $(CFLAGS) -o $@ $(filter %.cc %.a, $^) $(LDFLAGS)
+
+-include tests/*.d
diff --git a/ps-lite/tests/travis/travis_before_cache.sh b/ps-lite/tests/travis/travis_before_cache.sh
new file mode 100755
index 00000000..6789ae08
--- /dev/null
+++ b/ps-lite/tests/travis/travis_before_cache.sh
@@ -0,0 +1,3 @@
+#!/bin/bash
+# do nothing for now
+ls -alLR ${CACHE_PREFIX}
\ No newline at end of file
diff --git a/ps-lite/tests/travis/travis_script.sh b/ps-lite/tests/travis/travis_script.sh
new file mode 100755
index 00000000..2bfb92f0
--- /dev/null
+++ b/ps-lite/tests/travis/travis_script.sh
@@ -0,0 +1,16 @@
+#!/bin/bash
+# main script of travis
+
+if [ ${TASK} == "lint" ]; then
+    make lint || exit -1
+fi
+
+if [ ${TASK} == "build" ]; then
+    make DEPS_PATH=${CACHE_PREFIX} CXX=${CXX} || exit -1
+fi
+
+if [ ${TASK} == "test" ]; then
+    make test DEPS_PATH=${CACHE_PREFIX} CXX=${CXX} || exit -1
+    cd tests
+    find test_* -type f -executable -exec ./repeat.sh 4 ./local.sh 2 2 ./{} \;
+fi
diff --git a/ps-lite/tests/travis/travis_setup_env.sh b/ps-lite/tests/travis/travis_setup_env.sh
new file mode 100644
index 00000000..7bdf4430
--- /dev/null
+++ b/ps-lite/tests/travis/travis_setup_env.sh
@@ -0,0 +1,12 @@
+# script to be sourced in travis yml
+# setup all enviroment variables
+
+export CACHE_PREFIX=${HOME}/.cache/usr
+export PATH=${HOME}/.local/bin:${PATH}
+export PATH=${PATH}:${CACHE_PREFIX}/bin
+export CPLUS_INCLUDE_PATH=${CPLUS_INCLUDE_PATH}:${CACHE_PREFIX}/include
+export C_INCLUDE_PATH=${C_INCLUDE_PATH}:${CACHE_PREFIX}/include
+export LIBRARY_PATH=${LIBRARY_PATH}:${CACHE_PREFIX}/lib
+export LD_LIBRARY_PATH=${LD_LIBRARY_PATH}:${CACHE_PREFIX}/lib
+
+# alias make="make -j4"
diff --git a/ps-lite/tracker/README.md b/ps-lite/tracker/README.md
new file mode 100644
index 00000000..e674d568
--- /dev/null
+++ b/ps-lite/tracker/README.md
@@ -0,0 +1,26 @@
+tracker
+====
+
+This folder contains tracker scripts that can be used to submit jobs to
+different distributed platforms.
+
+(Refactor of https://github.com/dmlc/dmlc-core/tree/master/tracker will merged
+back when ready)
+
+## How to use
+
+Assume `prog` is an execuable program, and `[args...]` are the possible
+arguments that `prog` accepts.
+
+### Local machine
+
+Run a job using 4 workers and 2 servers on the local machine:
+
+```bash
+./dmlc_local.py -s 2 -n 4 ./prog [args...]
+```
+
+### Launch via `mpirun`
+
+If `mpirun` is available (shipped with `openmpi` or `mpich2`), we can launch a
+job using `dmlc_mpi.py`.
diff --git a/ps-lite/tracker/dmlc_local.py b/ps-lite/tracker/dmlc_local.py
new file mode 100755
index 00000000..c9cef4db
--- /dev/null
+++ b/ps-lite/tracker/dmlc_local.py
@@ -0,0 +1,100 @@
+#!/usr/bin/env python
+"""
+DMLC submission script, local machine version
+"""
+
+import argparse
+import sys
+import os
+import subprocess
+from threading import Thread
+import tracker
+import signal
+import logging
+
+keepalive = """
+nrep=0
+rc=254
+while [ $rc -eq 254 ];
+do
+    export DMLC_NUM_ATTEMPT=$nrep
+    %s
+    rc=$?;
+    nrep=$((nrep+1));
+done
+"""
+
+class LocalLauncher(object):
+    def __init__(self, args, unknown):
+        self.args = args
+        self.cmd = ' '.join(args.command) + ' ' + ' '.join(unknown)
+
+    def exec_cmd(self, cmd, role, pass_env):
+        env = os.environ.copy()
+        for k, v in pass_env.items():
+            env[k] = str(v)
+
+        env['DMLC_ROLE'] = role
+
+        ntrial = 0
+        while True:
+            if os.name == 'nt':
+                env['DMLC_NUM_ATTEMPT'] = str(ntrial)
+                ret = subprocess.call(cmd, shell=True, env = env)
+                if ret == 254:
+                    ntrial += 1
+                    continue
+            else:
+                bash = keepalive % (cmd)
+                ret = subprocess.call(bash, shell=True, executable='bash', env = env)
+            if ret == 0:
+                logging.debug('Thread %d exit with 0')
+                return
+            else:
+                if os.name == 'nt':
+                    os.exit(-1)
+                else:
+                    raise Exception('Get nonzero return code=%d' % ret)
+
+    def submit(self):
+        def mthread_submit(nworker, nserver, envs):
+            """
+            customized submit script
+            """
+            procs = {}
+            for i in range(nworker + nserver):
+                role = 'worker' if i < nworker else 'server'
+                procs[i] = Thread(target = self.exec_cmd, args = (self.cmd, role, envs))
+                procs[i].setDaemon(True)
+                procs[i].start()
+        return mthread_submit
+
+    def run(self):
+        tracker.config_logger(self.args)
+        tracker.submit(self.args.num_workers,
+                       self.args.num_servers,
+                       fun_submit = self.submit(),
+                       pscmd = self.cmd)
+
+def main():
+    parser = argparse.ArgumentParser(
+        description='DMLC script to submit dmlc jobs as local process')
+
+    parser.add_argument('-n', '--num-workers', required=True, type=int,
+                        help = 'number of worker nodes to be launched')
+    parser.add_argument('-s', '--num-servers', type=int,
+                        help = 'number of server nodes to be launched')
+    parser.add_argument('--log-level', default='INFO', type=str,
+                        choices=['INFO', 'DEBUG'],
+                        help = 'logging level')
+    parser.add_argument('--log-file', type=str,
+                        help = 'output log to the specific log file')
+    parser.add_argument('command', nargs='+',
+                        help = 'command for launching the program')
+    args, unknown = parser.parse_known_args()
+
+    launcher = LocalLauncher(args, unknown)
+    launcher.run()
+
+if __name__ == '__main__':
+    main()
diff --git a/ps-lite/tracker/dmlc_mpi.py b/ps-lite/tracker/dmlc_mpi.py
new file mode 100755
index 00000000..395880cc
--- /dev/null
+++ b/ps-lite/tracker/dmlc_mpi.py
@@ -0,0 +1,91 @@
+#!/usr/bin/env python
+"""
+DMLC submission script, MPI version
+"""
+import argparse
+import sys
+import os
+import subprocess
+import tracker
+from threading import Thread
+
+parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using MPI')
+parser.add_argument('-n', '--nworker', required=True, type=int,
+                    help = 'number of worker proccess to be launched')
+parser.add_argument('-s', '--server-nodes', default = 0, type=int,
+                    help = 'number of server nodes to be launched')
+parser.add_argument('--log-level', default='INFO', type=str,
+                    choices=['INFO', 'DEBUG'],
+                    help = 'logging level')
+parser.add_argument('--log-file', type=str,
+                    help = 'output log to the specific log file')
+parser.add_argument('-H', '--hostfile', type=str,
+                    help = 'the hostfile of mpi server')
+parser.add_argument('command', nargs='+',
+                    help = 'command for dmlc program')
+parser.add_argument('--host-ip', type=str,
+                    help = 'the scheduler ip', default='ip')
+args, unknown = parser.parse_known_args()
+#
+# submission script using MPI
+#
+
+def get_mpi_env(envs):
+    """get the mpirun command for setting the envornment
+
+    support both openmpi and mpich2
+    """
+    outfile="/tmp/mpiver"
+    os.system("mpirun 1>/tmp/mpiver 2>/tmp/mpiver")
+    with open (outfile, "r") as infile:
+        mpi_ver = infile.read()
+    cmd = ''
+    if 'Open MPI' in mpi_ver:
+        for k, v in envs.items():
+            cmd += ' -x %s=%s' % (k, str(v))
+    elif 'mpich' in mpi_ver:
+        for k, v in envs.items():
+            cmd += ' -env %s %s' % (k, str(v))
+    else:
+        raise Exception('unknow mpi version %s' % (mpi_ver))
+
+    return cmd
+
+def mpi_submit(nworker, nserver, pass_envs):
+    """
+      customized submit script, that submit nslave jobs, each must contain args as parameter
+      note this can be a lambda function containing additional parameters in input
+      Parameters
+         nworker number of slave process to start up
+         nserver number of server nodes to start up
+         pass_envs enviroment variables to be added to the starting programs
+    """
+    def run(prog):
+        """"""
+        subprocess.check_call(prog, shell = True)
+
+    cmd = ''
+    if args.hostfile is not None:
+        cmd = '--hostfile %s' % (args.hostfile)
+    cmd += ' ' + ' '.join(args.command) + ' ' + ' '.join(unknown)
+
+    # start servers
+    if nserver > 0:
+        pass_envs['DMLC_ROLE'] = 'server'
+        prog = 'mpirun -n %d %s %s' % (nserver, get_mpi_env(pass_envs), cmd)
+        thread = Thread(target = run, args=(prog,))
+        thread.setDaemon(True)
+        thread.start()
+
+    if nworker > 0:
+        pass_envs['DMLC_ROLE'] = 'worker'
+        prog = 'mpirun -n %d %s %s' % (nworker, get_mpi_env(pass_envs), cmd)
+        thread = Thread(target = run, args=(prog,))
+        thread.setDaemon(True)
+        thread.start()
+
+tracker.config_logger(args)
+
+tracker.submit(args.nworker, args.server_nodes, fun_submit = mpi_submit,
+               hostIP=args.host_ip,
+               pscmd=(' '.join(args.command) + ' ' + ' '.join(unknown)))
diff --git a/ps-lite/tracker/dmlc_ssh.py b/ps-lite/tracker/dmlc_ssh.py
new file mode 100755
index 00000000..7779852d
--- /dev/null
+++ b/ps-lite/tracker/dmlc_ssh.py
@@ -0,0 +1,113 @@
+#!/usr/bin/env python
+"""
+DMLC submission script by ssh
+
+One need to make sure all slaves machines are ssh-able.
+"""
+
+import argparse
+import sys
+import os
+import subprocess
+import tracker
+import logging
+from threading import Thread
+
+class SSHLauncher(object):
+    def __init__(self, args, unknown):
+        self.args = args
+        self.cmd = (' '.join(args.command) + ' ' + ' '.join(unknown))
+
+        assert args.hostfile is not None
+        with open(args.hostfile) as f:
+            hosts = f.readlines()
+        assert len(hosts) > 0
+        self.hosts=[]
+        for h in hosts:
+            if len(h.strip()) > 0:
+                self.hosts.append(h.strip())
+
+    def sync_dir(self, local_dir, slave_node, slave_dir):
+        """
+        sync the working directory from root node into slave node
+        """
+        remote = slave_node + ':' + slave_dir
+        logging.info('rsync %s -> %s', local_dir, remote)
+
+        # TODO uses multithread
+        prog = 'rsync -az --rsh="ssh -o StrictHostKeyChecking=no" %s %s' % (
+            local_dir, remote)
+        subprocess.check_call([prog], shell = True)
+
+
+    def get_env(self, pass_envs):
+        envs = []
+        # get system envs
+        keys = ['LD_LIBRARY_PATH', 'AWS_ACCESS_KEY_ID', 'AWS_SECRET_ACCESS_KEY']
+        for k in keys:
+            v = os.getenv(k)
+            if v is not None:
+                envs.append('export ' + k + '=' + v + ';')
+        # get ass_envs
+        for k, v in pass_envs.items():
+            envs.append('export ' + str(k) + '=' + str(v) + ';')
+        return (' '.join(envs))
+
+    def submit(self):
+        def ssh_submit(nworker, nserver, pass_envs):
+            """
+            customized submit script
+            """
+            # thread func to run the job
+            def run(prog):
+                subprocess.check_call(prog, shell = True)
+
+            # sync programs if necessary
+            local_dir = os.getcwd()+'/'
+            working_dir = local_dir
+            if self.args.sync_dir is not None:
+                working_dir = self.args.sync_dir
+                for h in self.hosts:
+                    self.sync_dir(local_dir, h, working_dir)
+
+            # launch jobs
+            for i in range(nworker + nserver):
+                pass_envs['DMLC_ROLE'] = 'server' if i < nserver else 'worker'
+                node = self.hosts[i % len(self.hosts)]
+                prog = self.get_env(pass_envs) + ' cd ' + working_dir + '; ' + self.cmd
+                prog = 'ssh -o StrictHostKeyChecking=no ' + node + ' \'' + prog + '\''
+
+                thread = Thread(target = run, args=(prog,))
+                thread.setDaemon(True)
+                thread.start()
+
+        return ssh_submit
+
+    def run(self):
+        tracker.config_logger(self.args)
+        tracker.submit(self.args.num_workers,
+                       self.args.num_servers,
+                       fun_submit = self.submit(),
+                       pscmd = self.cmd)
+
+def main():
+    parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using ssh')
+    parser.add_argument('-n', '--num-workers', required=True, type=int,
+                        help = 'number of worker nodes to be launched')
+    parser.add_argument('-s', '--num-servers', default = 0, type=int,
+                        help = 'number of server nodes to be launched')
+    parser.add_argument('-H', '--hostfile', type=str,
+                        help = 'the hostfile of all slave nodes')
+    parser.add_argument('command', nargs='+',
+                        help = 'command for dmlc program')
+    parser.add_argument('--sync-dir', type=str,
+                        help = 'if specificed, it will sync the current \
+                        directory into slave machines\'s SYNC_DIR')
+
+    args, unknown = parser.parse_known_args()
+
+    launcher = SSHLauncher(args, unknown)
+    launcher.run()
+
+if __name__ == '__main__':
+    main()
diff --git a/ps-lite/tracker/tracker.py b/ps-lite/tracker/tracker.py
new file mode 100644
index 00000000..bfaa06b3
--- /dev/null
+++ b/ps-lite/tracker/tracker.py
@@ -0,0 +1,433 @@
+"""
+Tracker script for DMLC
+Implements the tracker control protocol
+ - start dmlc jobs
+ - start ps scheduler and rabit tracker
+ - help nodes to establish links with each other
+
+Tianqi Chen
+"""
+
+import sys
+import os
+import socket
+import struct
+import subprocess
+import time
+import logging
+import random
+from threading import Thread
+
+"""
+Extension of socket to handle recv and send of special data
+"""
+class ExSocket:
+    def __init__(self, sock):
+        self.sock = sock
+    def recvall(self, nbytes):
+        res = []
+        sock = self.sock
+        nread = 0
+        while nread < nbytes:
+            chunk = self.sock.recv(min(nbytes - nread, 1024))
+            nread += len(chunk)
+            res.append(chunk)
+        return ''.join(res)
+    def recvint(self):
+        return struct.unpack('@i', self.recvall(4))[0]
+    def sendint(self, n):
+        self.sock.sendall(struct.pack('@i', n))
+    def sendstr(self, s):
+        self.sendint(len(s))
+        self.sock.sendall(s)
+    def recvstr(self):
+        slen = self.recvint()
+        return self.recvall(slen)
+
+# magic number used to verify existence of data
+kMagic = 0xff99
+
+class SlaveEntry:
+    def __init__(self, sock, s_addr):
+        slave = ExSocket(sock)
+        self.sock = slave
+        self.host = socket.gethostbyname(s_addr[0])
+        magic = slave.recvint()
+        assert magic == kMagic, 'invalid magic number=%d from %s' % (magic, self.host)
+        slave.sendint(kMagic)
+        self.rank = slave.recvint()
+        self.world_size = slave.recvint()
+        self.jobid = slave.recvstr()
+        self.cmd = slave.recvstr()
+
+    def decide_rank(self, job_map):
+        if self.rank >= 0:
+            return self.rank
+        if self.jobid != 'NULL' and self.jobid in job_map:
+            return job_map[self.jobid]
+        return -1
+
+    def assign_rank(self, rank, wait_conn, tree_map, parent_map, ring_map):
+        self.rank = rank
+        nnset = set(tree_map[rank])
+        rprev, rnext = ring_map[rank]
+        self.sock.sendint(rank)
+        # send parent rank
+        self.sock.sendint(parent_map[rank])
+        # send world size
+        self.sock.sendint(len(tree_map))
+        self.sock.sendint(len(nnset))
+        # send the rprev and next link
+        for r in nnset:
+            self.sock.sendint(r)
+        # send prev link
+        if rprev != -1 and rprev != rank:
+            nnset.add(rprev)
+            self.sock.sendint(rprev)
+        else:
+            self.sock.sendint(-1)
+        # send next link
+        if rnext != -1 and rnext != rank:
+            nnset.add(rnext)
+            self.sock.sendint(rnext)
+        else:
+            self.sock.sendint(-1)
+        while True:
+            ngood = self.sock.recvint()
+            goodset = set([])
+            for i in xrange(ngood):
+                goodset.add(self.sock.recvint())
+            assert goodset.issubset(nnset)
+            badset = nnset - goodset
+            conset = []
+            for r in badset:
+                if r in wait_conn:
+                    conset.append(r)
+            self.sock.sendint(len(conset))
+            self.sock.sendint(len(badset) - len(conset))
+            for r in conset:
+                self.sock.sendstr(wait_conn[r].host)
+                self.sock.sendint(wait_conn[r].port)
+                self.sock.sendint(r)
+            nerr = self.sock.recvint()
+            if nerr != 0:
+                continue
+            self.port = self.sock.recvint()
+            rmset = []
+            # all connection was successuly setup
+            for r in conset:
+                wait_conn[r].wait_accept -= 1
+                if wait_conn[r].wait_accept == 0:
+                    rmset.append(r)
+            for r in rmset:
+                wait_conn.pop(r, None)
+            self.wait_accept = len(badset) - len(conset)
+            return rmset
+
+class RabitTracker:
+    """
+    tracker for rabit
+    """
+    def __init__(self, hostIP, nslave, port = 9091, port_end = 9999):
+        sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+        for port in range(port, port_end):
+            try:
+                sock.bind((hostIP, port))
+                self.port = port
+                break
+            except socket.error:
+                continue
+        sock.listen(16)
+        self.sock = sock
+        self.hostIP = hostIP
+        logging.info('start listen on %s:%d' % (hostIP, self.port))
+
+    def __del__(self):
+        self.sock.close()
+
+    def slave_envs(self):
+        """
+        get enviroment variables for slaves
+        can be passed in as args or envs
+        """
+        return {'DMLC_TRACKER_URI': self.hostIP,
+                'DMLC_TRACKER_PORT': self.port}
+
+    def get_neighbor(self, rank, nslave):
+        rank = rank + 1
+        ret = []
+        if rank > 1:
+            ret.append(rank / 2 - 1)
+        if rank * 2 - 1  < nslave:
+            ret.append(rank * 2 - 1)
+        if rank * 2 < nslave:
+            ret.append(rank * 2)
+        return ret
+
+    def get_tree(self, nslave):
+        tree_map = {}
+        parent_map = {}
+        for r in range(nslave):
+            tree_map[r] = self.get_neighbor(r, nslave)
+            parent_map[r] = (r + 1) / 2 - 1
+        return tree_map, parent_map
+
+    def find_share_ring(self, tree_map, parent_map, r):
+        """
+        get a ring structure that tends to share nodes with the tree
+        return a list starting from r
+        """
+        nset = set(tree_map[r])
+        cset = nset - set([parent_map[r]])
+        if len(cset) == 0:
+            return [r]
+        rlst = [r]
+        cnt = 0
+        for v in cset:
+            vlst = self.find_share_ring(tree_map, parent_map, v)
+            cnt += 1
+            if cnt == len(cset):
+                vlst.reverse()
+            rlst += vlst
+        return rlst
+
+    def get_ring(self, tree_map, parent_map):
+        """
+        get a ring connection used to recover local data
+        """
+        assert parent_map[0] == -1
+        rlst = self.find_share_ring(tree_map, parent_map, 0)
+        assert len(rlst) == len(tree_map)
+        ring_map = {}
+        nslave = len(tree_map)
+        for r in range(nslave):
+            rprev = (r + nslave - 1) % nslave
+            rnext = (r + 1) % nslave
+            ring_map[rlst[r]] = (rlst[rprev], rlst[rnext])
+        return ring_map
+
+    def get_link_map(self, nslave):
+        """
+        get the link map, this is a bit hacky, call for better algorithm
+        to place similar nodes together
+        """
+        tree_map, parent_map = self.get_tree(nslave)
+        ring_map = self.get_ring(tree_map, parent_map)
+        rmap = {0 : 0}
+        k = 0
+        for i in range(nslave - 1):
+            k = ring_map[k][1]
+            rmap[k] = i + 1
+
+        ring_map_ = {}
+        tree_map_ = {}
+        parent_map_ ={}
+        for k, v in ring_map.items():
+            ring_map_[rmap[k]] = (rmap[v[0]], rmap[v[1]])
+        for k, v in tree_map.items():
+            tree_map_[rmap[k]] = [rmap[x] for x in v]
+        for k, v in parent_map.items():
+            if k != 0:
+                parent_map_[rmap[k]] = rmap[v]
+            else:
+                parent_map_[rmap[k]] = -1
+        return tree_map_, parent_map_, ring_map_
+
+    def handle_print(self,slave, msg):
+        logging.info(msg.strip())
+        sys.stdout.write(msg)
+        sys.stdout.flush()
+
+    def accept_slaves(self, nslave):
+        # set of nodes that finishs the job
+        shutdown = {}
+        # set of nodes that is waiting for connections
+        wait_conn = {}
+        # maps job id to rank
+        job_map = {}
+        # list of workers that is pending to be assigned rank
+        pending = []
+        # lazy initialize tree_map
+        tree_map = None
+
+        while len(shutdown) != nslave:
+            fd, s_addr = self.sock.accept()
+            s = SlaveEntry(fd, s_addr)
+            if s.cmd == 'print':
+                msg = s.sock.recvstr()
+                self.handle_print(s, msg)
+                continue
+            if s.cmd == 'shutdown':
+                assert s.rank >= 0 and s.rank not in shutdown
+                assert s.rank not in wait_conn
+                shutdown[s.rank] = s
+                logging.debug('Recieve %s signal from %d' % (s.cmd, s.rank))
+                continue
+            assert s.cmd == 'start' or s.cmd == 'recover'
+            # lazily initialize the slaves
+            if tree_map == None:
+                assert s.cmd == 'start'
+                if s.world_size > 0:
+                    nslave = s.world_size
+                tree_map, parent_map, ring_map = self.get_link_map(nslave)
+                # set of nodes that is pending for getting up
+                todo_nodes = range(nslave)
+            else:
+                assert s.world_size == -1 or s.world_size == nslave
+            if s.cmd == 'recover':
+                assert s.rank >= 0
+
+            rank = s.decide_rank(job_map)
+            # batch assignment of ranks
+            if rank == -1:
+                assert len(todo_nodes) != 0
+                pending.append(s)
+                if len(pending) == len(todo_nodes):
+                    pending.sort(key = lambda x : x.host)
+                    for s in pending:
+                        rank = todo_nodes.pop(0)
+                        if s.jobid != 'NULL':
+                            job_map[s.jobid] = rank
+                        s.assign_rank(rank, wait_conn, tree_map, parent_map, ring_map)
+                        if s.wait_accept > 0:
+                            wait_conn[rank] = s
+                        logging.debug('Recieve %s signal from %s; assign rank %d' % (s.cmd, s.host, s.rank))
+                if len(todo_nodes) == 0:
+                    logging.info('@tracker All of %d nodes getting started' % nslave)
+                    self.start_time = time.time()
+            else:
+                s.assign_rank(rank, wait_conn, tree_map, parent_map, ring_map)
+                logging.debug('Recieve %s signal from %d' % (s.cmd, s.rank))
+                if s.wait_accept > 0:
+                    wait_conn[rank] = s
+        logging.info('@tracker All nodes finishes job')
+        self.end_time = time.time()
+        logging.info('@tracker %s secs between node start and job finish' % str(self.end_time - self.start_time))
+
+    def start(self, nslave):
+        def run():
+            self.accept_slaves(nslave)
+        self.thread = Thread(target = run, args = ())
+        self.thread.setDaemon(True)
+        self.thread.start()
+
+    def join(self):
+        while self.thread.isAlive():
+            self.thread.join(100)
+
+class PSTracker:
+    """Start the schduler node in PS
+    """
+    def __init__(self, hostIP, cmd, port = 9091, port_end = 9999, envs = {}):
+        """
+        Starts the PS scheduler
+        """
+        self.cmd = cmd
+        if cmd is None:
+            return
+
+        self.hostIP = hostIP
+        sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
+        max_retry = 100
+
+        for i in range(0, max_retry):
+            if i + 1 == max_retry:
+                raise Exception('the schduler is faild to bind a port')
+            port = random.randint(port, port_end)
+            try:
+                sock.bind(('', port))
+                self.port = port
+                sock.close()
+                break
+            except socket.error:
+                continue
+        env = os.environ.copy()
+
+        env['DMLC_ROLE'] = 'scheduler'
+        env['DMLC_PS_ROOT_URI'] = str(self.hostIP)
+        env['DMLC_PS_ROOT_PORT'] = str(self.port)
+        for k, v in envs.items():
+            env[k] = str(v)
+        self.thread = Thread(target = (lambda : subprocess.check_call(self.cmd, env=env, shell=True)), args = ())
+        self.thread.setDaemon(True)
+        self.thread.start()
+
+    def join(self):
+        if self.cmd is not None:
+            while self.thread.isAlive():
+                self.thread.join(100)
+
+    def slave_envs(self):
+        if self.cmd is None:
+            return {}
+        else:
+            return {'DMLC_PS_ROOT_URI': self.hostIP,
+                    'DMLC_PS_ROOT_PORT': self.port}
+
+def submit(nworker, nserver, fun_submit, hostIP = 'auto', pscmd = None):
+    """submit job
+
+    Paramaters
+    ----------
+    nworker : int
+        number of workers
+    nserver : int
+        number of servers, if 0 then submit as rabit a job, otherwise sumbit as
+        a parmaeter server job
+    fun_sumbit : func
+        the function to submit the jobs for servers and workers
+    hostIP : str, optional
+        the host ip of the root node
+    pscmd :
+    """
+    # get the root node ip
+    if hostIP == 'auto':
+        hostIP = 'ip'
+    if hostIP == 'dns':
+        hostIP = socket.getfqdn()
+    elif hostIP == 'ip':
+        from socket import gaierror
+        try:
+            hostIP = socket.gethostbyname(socket.getfqdn())
+        except gaierror:
+            logging.warn('gethostbyname(socket.getfqdn()) failed... trying on hostname()')
+            hostIP = socket.gethostbyname(socket.gethostname())
+        if hostIP.startswith("127."):
+            s = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
+            # doesn't have to be reachable
+            s.connect(('10.255.255.255', 0))
+            hostIP = s.getsockname()[0]
+
+    envs = {'DMLC_NUM_WORKER' : nworker,
+            'DMLC_NUM_SERVER' : nserver}
+
+    # start the root
+    if nserver == 0:
+        rabit = RabitTracker(hostIP = hostIP, nslave = nworker)
+        envs.update(rabit.slave_envs())
+        rabit.start(nworker)
+    else:
+        pserver = PSTracker(hostIP = hostIP, cmd=pscmd, envs = envs)
+        envs.update(pserver.slave_envs())
+
+    # start the workers and servers
+    fun_submit(nworker, nserver, envs)
+
+    # wait the root finished
+    if nserver == 0:
+        rabit.join()
+    else:
+        pserver.join()
+
+def config_logger(args):
+    FORMAT = '%(asctime)s %(levelname)s %(message)s'
+    level = args.log_level if 'log_level' in args else 'DEBUG'
+    level = eval('logging.' + level)
+    if 'log_file' not in args or args.log_file is None:
+        logging.basicConfig(format=FORMAT, level = level)
+    else:
+        logging.basicConfig(format=FORMAT, level = level, filename = args.log_file)
+        console = logging.StreamHandler()
+        console.setFormatter(logging.Formatter(FORMAT))
+        console.setLevel(level)
+        logging.getLogger('').addHandler(console)

From e849f96f1057ad690e715e0f1070cb15af0bd4fc Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:10:08 +0800
Subject: [PATCH 27/82] update: CMakeLists.txt

---
 CMakeLists.txt | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 3af60922..92f2995d 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -52,7 +52,8 @@ include_directories(
   "${PROJECT_SOURCE_DIR}"
   "${PROJECT_BINARY_DIR}"
   "${PROJECT_SOURCE_DIR}/gtest/include"
-  "${PROJECT_SOURCE_DIR}/ps-lite"
+  "${PROJECT_SOURCE_DIR}/ps-lite/include"
+  "${PROJECT_SOURCE_DIR}/ps-lite/deps/include"
 )
 
 link_directories(
@@ -64,15 +65,14 @@ link_directories(
   "${PROJECT_BINARY_DIR}/src/solver"
   "${PROJECT_BINARY_DIR}/src/distributed"
   "${PROJECT_BINARY_DIR}/src/c_api"
-  "${PROJECT_BINARY_DIR}/ps-lite/deps/lib"
-  "${PROJECT_BINARY_DIR}/ps-lite/build"
+  "${PROJECT_SOURCE_DIR}/ps-lite/deps/lib"
+  "${PROJECT_SOURCE_DIR}/ps-lite/build"
 )
 
 #-------------------------------------------------------------------------------
 # Declare packages in xLearn project.
 #-------------------------------------------------------------------------------
 add_subdirectory(gtest)
-add_subdirectory(ps-lite)
 add_subdirectory(demo)
 add_subdirectory(src/base)
 add_subdirectory(src/data)

From 4638646ca03d1bcc4f491dd35bc622e7aaeaabf9 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:10:27 +0800
Subject: [PATCH 28/82] update: /src/c_api/CMakeLists.txt

---
 src/c_api/CMakeLists.txt | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/src/c_api/CMakeLists.txt b/src/c_api/CMakeLists.txt
index ff8312cc..2e78faa5 100644
--- a/src/c_api/CMakeLists.txt
+++ b/src/c_api/CMakeLists.txt
@@ -4,7 +4,7 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 
 # Build static library
-set(STA_DEPS solver reader loss score data base)
+set(STA_DEPS solver reader loss score data base distributed)
 add_library(xlearn_api STATIC c_api.cc c_api_error.cc)
 target_link_libraries(xlearn_api ${STA_DEPS})
 
@@ -18,6 +18,8 @@ add_library(xlearn_api_shared SHARED c_api.cc c_api_error.cc
 ../reader/parser.cc ../reader/file_splitor.cc ../reader/reader.cc 
 ../score/score_function.cc ../score/linear_score.cc ../score/fm_score.cc 
 ../score/ffm_score.cc 
+../distributed/dist_cross_entropy_loss.cc 
+../distributed/dist_score_function.cc ../distributed/dist_linear_score.cc 
 ../solver/checker.cc ../solver/trainer.cc 
 ../solver/inference.cc ../solver/solver.cc)
 
@@ -27,7 +29,7 @@ set_target_properties(xlearn_api_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(xlearn_api PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build unittests.
-set(LIBS xlearn_api solver reader loss score data base pthread gtest)
+set(LIBS xlearn_api solver reader protobuf zmq loss score data base pthread gtest distributed_shared)
 
 add_executable(c_api_test c_api_test.cc)
 target_link_libraries(c_api_test gtest_main ${LIBS})

From 6acfc490a26b76ca822b3088c72361b2dc1d79c5 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:10:49 +0800
Subject: [PATCH 29/82] update: src/distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index f877ee1a..eab7b00d 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,9 +1,9 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
-set(STA_DEPS data base)
-add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc)
+set(STA_DEPS data base loss)
+add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc)
 target_link_libraries(distributed ${STA_DEPS})
 
-set(SHA_DEPS data_shared base_shared)
-add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc)
+set(SHA_DEPS data_shared base_shared loss_shared)
+add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc)
 target_link_libraries(distributed_shared ${SHA_DEPS})

From b9a3d3ea5186114a19c198ea4c5b390daa265be5 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:11:18 +0800
Subject: [PATCH 30/82] update: /src/distributed/dist_cross_entropy_loss.h

---
 src/distributed/dist_cross_entropy_loss.cc | 14 +++++++-------
 src/distributed/dist_cross_entropy_loss.h  |  2 +-
 2 files changed, 8 insertions(+), 8 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 4bc702e2..a7a75008 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -19,7 +19,7 @@ Author: Chao Ma (mctt90@gmail.com)
 This file is the implementation of CrossEntropyLoss class.
 */
 
-#include "src/loss/dist_cross_entropy_loss.h"
+#include "src/distributed/dist_cross_entropy_loss.h"
 
 #include<thread>
 #include<atomic>
@@ -83,14 +83,14 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
                                std::unordered_map<index_t, real_t>* w,
-                               Score* score_func,
+                               DistScore* score_func,
                                bool is_norm,
                                real_t* sum,
                                std::unordered_map<index_t, real_t>* g,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  score_func->DistCalcScore(matrix, w, sum, g, start_idx, end_idx);
+  score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -130,9 +130,9 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   feature_ids.erase(unique(feature_ids.begin(), feature_ids.end()),
                       feature_ids.end());
 
-  gradient_pull.resize(feature_ids.size);
-  if (model->score_func_.compare("linear_dist") == 0) {
-    kv_w_.Pull(feature_ids, gradient_pull);
+  gradient_pull.resize(feature_ids.size());
+  if (model->score_func_.compare("dist_linear") == 0) {
+    kv_w_->Pull(feature_ids, gradient_pull);
   }
   for (int i = 0; i < gradient_pull.size(); ++i) {
     index_t idx = feature_ids[i];
@@ -164,7 +164,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     gradient_pull.push_back(g);
   }
   if (model->score_func_.compare("dist_linear") == 0) {
-    kv_w_.Push(feat_ids, gradient_push);
+    kv_w_->Push(feature_ids, gradient_push);
   }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
index 8a022442..337a4814 100644
--- a/src/distributed/dist_cross_entropy_loss.h
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -48,7 +48,7 @@ class DistCrossEntropyLoss : public Loss {
   void CalcGrad(const DMatrix* data_matrix, Model& model);
 
   // Return current loss type.
-  std::string loss_type() { return "log_loss"; }
+  std::string loss_type() { return "dist_log_loss"; }
 
  private:
   DISALLOW_COPY_AND_ASSIGN(DistCrossEntropyLoss);

From ba0934bd679fd934c68a39aa89afda9600515b33 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:11:48 +0800
Subject: [PATCH 31/82] update: src/distributed/dist_score_function.h

---
 src/distributed/dist_score_function.cc | 10 +++-------
 src/distributed/dist_score_function.h  | 27 ++++++++++----------------
 2 files changed, 13 insertions(+), 24 deletions(-)

diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
index 4a805d87..99369f34 100644
--- a/src/distributed/dist_score_function.cc
+++ b/src/distributed/dist_score_function.cc
@@ -19,19 +19,15 @@ Author: Chao Ma (mctt90@gmail.com)
 This file is the implementation of the base Score class.
 */
 
-#include "src/score/dist_score_function.h"
-#include "src/score/linear_score.h"
-//#include "src/score/fm_score.h"
-//#include "src/score/ffm_score.h"
+#include "src/distributed/dist_score_function.h"
+#include "src/distributed/dist_linear_score.h"
 
 namespace xLearn {
 
 //------------------------------------------------------------------------------
 // Class register
 //------------------------------------------------------------------------------
-CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_score_registry, DistScore);
+CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_dist_score_registry, DistScore);
 REGISTER_SCORE("dist_linear", DistLinearScore);
-//REGISTER_SCORE("fm", FMScore);
-//REGISTER_SCORE("ffm", FFMScore);
 
 }  // namespace xLearn
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index a294f5e6..cb51f4de 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -16,7 +16,7 @@
 
 /*
 Author: Chao Ma (mctt90@gmail.com)
-This file defines the Score class, including linear score,
+This file defines the DistScore class, including linear score,
 FM score, FFM score, and etc.
 */
 
@@ -35,7 +35,7 @@ FM score, FFM score, and etc.
 namespace xLearn {
 
 //------------------------------------------------------------------------------
-// Score is an abstract class, which can be implemented by different
+// DistScore is an abstract class, which can be implemented by different
 // score functions such as LinearScore (liner_score.h), FMScore (fm_score.h)
 // FFMScore (ffm_score.h) etc. On common, we initial a Score function and
 // pass its pointer to a Loss class like this:
@@ -75,19 +75,12 @@ class DistScore {
                            std::unordered_map<index_t, real_t>* w,
                            real_t norm = 1.0) = 0;
 
-  virtual real_t DistCalcScore(const Matrix* matrix,
+  virtual void DistCalcGrad(const DMatrix* matrix,
                                std::unordered_map<index_t, real_t>* w,
                                real_t* sum,
                                std::unordered_map<index_t, real_t>* g,
-                               size_t start_idx,
-                               size_t end_idx) = 0;
-
-  // Calculate gradient and update current
-  // model parameters
-  virtual void DistCalcGrad(const SparseRow* row,
-                        Model& model,
-                        real_t pg,
-                        real_t norm = 1.0) = 0;
+                               index_t start_idx,
+                               index_t end_idx) = 0;
 
  protected:
   real_t learning_rate_;
@@ -99,18 +92,18 @@ class DistScore {
   std::string opt_type_;
 
  private:
-  DISALLOW_COPY_AND_ASSIGN(Score);
+  DISALLOW_COPY_AND_ASSIGN(DistScore);
 };
 
 //------------------------------------------------------------------------------
 // Class register
 //------------------------------------------------------------------------------
-CLASS_REGISTER_DEFINE_REGISTRY(xLearn_score_registry, Score);
+CLASS_REGISTER_DEFINE_REGISTRY(xLearn_dist_score_registry, DistScore);
 
 #define REGISTER_SCORE(format_name, score_name)             \
   CLASS_REGISTER_OBJECT_CREATOR(                            \
-      xLearn_score_registry,                                \
-      Score,                                                \
+      xLearn_dist_score_registry,                                \
+      DistScore,                                                \
       format_name,                                          \
       score_name)
 
@@ -121,4 +114,4 @@ CLASS_REGISTER_DEFINE_REGISTRY(xLearn_score_registry, Score);
 
 }  // namespace xLearn
 
-#endif  // XLEARN_LOSS_SCORE_FUNCTION_H_
+#endif  // XLEARN_LOSS_DIST_SCORE_FUNCTION_H_

From abc1acfe36b563eff9c961106b83d7bd14c608bf Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:12:14 +0800
Subject: [PATCH 32/82] update: src/distributed/dist_linear_score.h

---
 src/distributed/dist_linear_score.cc | 40 ++++++++++++++--------------
 src/distributed/dist_linear_score.h  | 19 +++++--------
 2 files changed, 26 insertions(+), 33 deletions(-)

diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index dc8bdac2..5674771c 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -19,7 +19,7 @@ Author: Chao Ma (mctt90@gmail.com)
 This file is the implementation of LinearScore class.
 */
 
-#include "src/score/dist_linear_score.h"
+#include "src/distributed/dist_linear_score.h"
 #include "src/base/math.h"
 
 namespace xLearn {
@@ -32,18 +32,18 @@ real_t DistLinearScore::CalcScore(const SparseRow* row,
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
     index_t idx = iter->feat_id;
-    score += w[idx] * iter->feat_val;
+    score += (*w)[idx] * iter->feat_val;
   }
   return score;
 }
 
 // Calculate gradient and update current model
-void DistLinearScore::CalcDistGrad(const Matrix* matrix,
+void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
                            std::unordered_map<index_t, real_t>* w,
-                           real_t* sum;
+                           real_t* sum,
                            std::unordered_map<index_t, real_t>* g,
-                           real_t start_idx,
-                           real_t end_idx) {
+                           index_t start_idx,
+                           index_t end_idx) {
   // Using sgd
   if (opt_type_.compare("sgd") == 0) {
     this->calc_grad_sgd(matrix, w, sum, g, start_idx, end_idx);
@@ -59,7 +59,7 @@ void DistLinearScore::CalcDistGrad(const Matrix* matrix,
 }
 
 // Calculate gradient and update current model using sgd
-void DistLinearScore::calc_grad_sgd(const Matrix* matrix,
+void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
                                 std::unordered_map<index_t, real_t>* w,
                                 real_t* sum,
                                 std::unordered_map<index_t, real_t>* g,
@@ -68,22 +68,22 @@ void DistLinearScore::calc_grad_sgd(const Matrix* matrix,
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w, norm);
+    real_t pred = CalcScore(row, w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
-    sum += log1p(exp(-y*pred));
+    (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val;
-      gradient += regu_lambda_ * w[idx_g]; // get gradient
-      g[idx_g] += gradient;
+      gradient += regu_lambda_ * (*w)[idx_g]; // get gradient
+      (*g)[idx_g] += gradient;
     }
   }
 }
 
 // Calculate gradient and update current model using adagrad
-void DistLinearScore::calc_grad_adagrad(const Matrix* matrix,
+void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
                                     std::unordered_map<index_t, real_t>* w,
                                     real_t* sum,
                                     std::unordered_map<index_t, real_t>* g,
@@ -92,22 +92,22 @@ void DistLinearScore::calc_grad_adagrad(const Matrix* matrix,
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w, norm);
+    real_t pred = CalcScore(row, w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
-    sum += log1p(exp(-y*pred));
+    (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val;
-      gradient += regu_lambda_ * w[idx_g]; // get gradient
-      g[idx_g] += gradient;
+      gradient += regu_lambda_ * (*w)[idx_g]; // get gradient
+      (*g)[idx_g] += gradient;
     }
   }
 }
 
 // Calculate gradient and update current model using ftrl
-void DistLinearScore::calc_grad_ftrl(const Matrix* matrix,
+void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
                                  std::unordered_map<index_t, real_t>* w,
                                  real_t* sum,
                                  std::unordered_map<index_t, real_t>* g,
@@ -115,15 +115,15 @@ void DistLinearScore::calc_grad_ftrl(const Matrix* matrix,
                                  real_t end_idx) {
   for (int i = 0; i < start_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w, norm);
+    real_t pred = CalcScore(row, w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
-    sum += log1p(exp(-y * pred));
+    (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val; // get gradient
-      g[idx_g] += gradient;
+      (*g)[idx_g] += gradient;
     }
   }
 }
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index 2681138a..85b36f0c 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -24,7 +24,7 @@ This file defines the LinearScore class.
 
 #include "src/base/common.h"
 #include "src/data/model_parameters.h"
-#include "src/score/dist_score_function.h"
+#include "src/distributed/dist_score_function.h"
 
 namespace xLearn {
 
@@ -44,23 +44,16 @@ class DistLinearScore : public DistScore {
                    std::unordered_map<index_t, real_t>* w,
                    real_t norm = 1.0);
 
-  void DistCalcScore(const Matrix* matrix,
+  void DistCalcGrad(const DMatrix* matrix,
                      std::unordered_map<index_t, real_t>* w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>* g,
                      index_t start_idx,
                      index_t end_idx);
 
-  // Calculate gradient and update current
-  // model parameters.
-  void CalcGrad(const SparseRow* row,
-                Model& model,
-                real_t pg,
-                real_t norm = 1.0);
-
  protected:
   // Calculate gradient and update model using sgd
-  void calc_grad_sgd(const Matrix* matrix,
+  void calc_grad_sgd(const DMatrix* matrix,
                      std::unordered_map<index_t, real_t>* w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>* g,
@@ -69,7 +62,7 @@ class DistLinearScore : public DistScore {
                     );
 
   // Calculate gradient and update model using adagrad
-  void calc_grad_adagrad(const Matrix* matrix,
+  void calc_grad_adagrad(const DMatrix* matrix,
                          std::unordered_map<index_t, real_t>* w,
                          real_t* sum,
                          std::unordered_map<index_t, real_t>* g,
@@ -78,7 +71,7 @@ class DistLinearScore : public DistScore {
                         );
 
   // Calculate gradient and update model using ftrl
-  void calc_grad_ftrl(const Matrix* matrix,
+  void calc_grad_ftrl(const DMatrix* matrix,
                       std::unordered_map<index_t, real_t>* w,
                       real_t* sum,
                       std::unordered_map<index_t, real_t>* g,
@@ -87,7 +80,7 @@ class DistLinearScore : public DistScore {
                      );
 
  private:
-  DISALLOW_COPY_AND_ASSIGN(LinearScore);
+  DISALLOW_COPY_AND_ASSIGN(DistLinearScore);
 };
 
 }  // namespace xLearn

From 42bfca0b80c850149ee890893c1d813474b6fb19 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:12:36 +0800
Subject: [PATCH 33/82] add: DistScore Register

---
 src/loss/CMakeLists.txt | 6 +++---
 src/loss/loss.cc        | 2 ++
 2 files changed, 5 insertions(+), 3 deletions(-)

diff --git a/src/loss/CMakeLists.txt b/src/loss/CMakeLists.txt
index 8e5fe209..6c7ad985 100644
--- a/src/loss/CMakeLists.txt
+++ b/src/loss/CMakeLists.txt
@@ -2,13 +2,13 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
 # Build static library
-set(STA_DEPS score data base)
+set(STA_DEPS score data base protobuf zmq ps)
 add_library(loss STATIC loss.cc squared_loss.cc 
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss ${STA_DEPS})
 
 # Build shared library
-set(SHA_DEPS score_shared data_shared base_shared)
+set(SHA_DEPS score_shared data_shared base_shared protobuf zmq ps)
 add_library(loss_shared SHARED loss.cc squared_loss.cc
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss_shared ${SHA_DEPS})
@@ -19,7 +19,7 @@ set_target_properties(loss_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(loss PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build uinttests
-set(LIBS loss score data base gtest)
+set(LIBS loss score data base gtest protobuf zmq ps)
 
 add_executable(loss_test loss_test.cc)
 target_link_libraries(loss_test gtest_main ${LIBS})
diff --git a/src/loss/loss.cc b/src/loss/loss.cc
index 59c3e3b1..28f5eb33 100644
--- a/src/loss/loss.cc
+++ b/src/loss/loss.cc
@@ -22,6 +22,7 @@ This file is the implementation of the base Loss class.
 #include "src/loss/loss.h"
 #include "src/loss/squared_loss.h"
 #include "src/loss/cross_entropy_loss.h"
+#include "src/distributed/dist_cross_entropy_loss.h"
 
 namespace xLearn {
 
@@ -31,6 +32,7 @@ namespace xLearn {
 CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_loss_registry, Loss);
 REGISTER_LOSS("squared", SquaredLoss);
 REGISTER_LOSS("cross-entropy", CrossEntropyLoss);
+REGISTER_LOSS("dist-cross-entropy", DistCrossEntropyLoss);
 
 // Predict in one thread
 void pred_thread(const DMatrix* matrix,

From 25ecec2df1101256154143a69d59fbe181ec52ef Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 15:35:30 +0800
Subject: [PATCH 34/82] update: loss.h

---
 src/distributed/dist_cross_entropy_loss.cc | 21 ++++++++++-----------
 src/loss/loss.h                            |  1 +
 2 files changed, 11 insertions(+), 11 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index a7a75008..7dca8db6 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -112,8 +112,8 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   CHECK_GT(matrix->row_length, 0);
   size_t row_len = matrix->row_length;
   total_example_ += row_len;
-  std::vector<index_t> feature_ids;
-  std::vector<real_t> gradient_pull;
+  auto feature_ids = std::vector<ps::Key>();
+  auto gradient_pull = std::make_shared<std::vector<float>>();
   std::unordered_map<index_t, real_t> weight_map;
   std::unordered_map<index_t, real_t> gradient_push_map;
   std::vector<real_t> gradient_push;
@@ -130,16 +130,15 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   feature_ids.erase(unique(feature_ids.begin(), feature_ids.end()),
                       feature_ids.end());
 
-  gradient_pull.resize(feature_ids.size());
-  if (model->score_func_.compare("dist_linear") == 0) {
-    kv_w_->Pull(feature_ids, gradient_pull);
+  gradient_pull->resize(feature_ids.size());
+  if (model.GetScoreFunction().compare("dist_linear") == 0) {
+    kv_w_->Pull(feature_ids, &(*gradient_pull));
   }
-  for (int i = 0; i < gradient_pull.size(); ++i) {
+  for (int i = 0; i < gradient_pull->size(); ++i) {
     index_t idx = feature_ids[i];
-    real_t weight = gradient_pull[i];
+    real_t weight = (*gradient_pull)[i];
     weight_map[idx] = weight;
   }
-  gradient_push_map.resize(feature_ids.size(), 0.0);
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
   std::vector<real_t> sum(count, 0);
@@ -158,12 +157,12 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   }
   // Wait all of the threads finish their job
   pool_->Sync(count);
-  for (int i = 0; i < feat_ids.size(); ++i) {
+  for (int i = 0; i < feature_ids.size(); ++i) {
     index_t idx = feature_ids[i];
     real_t g = gradient_push_map[idx];
-    gradient_pull.push_back(g);
+    gradient_pull->push_back(g);
   }
-  if (model->score_func_.compare("dist_linear") == 0) {
+  if (model.GetScoreFunction().compare("dist_linear") == 0) {
     kv_w_->Push(feature_ids, gradient_push);
   }
   // Accumulate loss
diff --git a/src/loss/loss.h b/src/loss/loss.h
index 2bc277d0..acfddff9 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -32,6 +32,7 @@ function or objective function.
 #include "src/base/thread_pool.h"
 #include "src/data/model_parameters.h"
 #include "src/score/score_function.h"
+#include "src/distributed/dist_score_function.h"
 
 #include "ps/ps.h"
 

From b6d67cef01a657ca2134a5cf971d47df13d2087c Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 16:28:24 +0800
Subject: [PATCH 35/82] add: xlearn_shared deps

---
 src/c_api/CMakeLists.txt | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/src/c_api/CMakeLists.txt b/src/c_api/CMakeLists.txt
index 2e78faa5..571c9578 100644
--- a/src/c_api/CMakeLists.txt
+++ b/src/c_api/CMakeLists.txt
@@ -4,7 +4,7 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 
 # Build static library
-set(STA_DEPS solver reader loss score data base distributed)
+set(STA_DEPS solver reader loss score data base ps protobuf zmq distributed)
 add_library(xlearn_api STATIC c_api.cc c_api_error.cc)
 target_link_libraries(xlearn_api ${STA_DEPS})
 
@@ -23,13 +23,15 @@ add_library(xlearn_api_shared SHARED c_api.cc c_api_error.cc
 ../solver/checker.cc ../solver/trainer.cc 
 ../solver/inference.cc ../solver/solver.cc)
 
+target_link_libraries(xlearn_api_shared ps zmq protobuf)
+
 # Set properties
 set_target_properties(xlearn_api_shared PROPERTIES OUTPUT_NAME "xlearn_api")
 set_target_properties(xlearn_api_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(xlearn_api PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build unittests.
-set(LIBS xlearn_api solver reader protobuf zmq loss score data base pthread gtest distributed_shared)
+set(LIBS xlearn_api solver reader loss score data base pthread gtest ps protobuf zmq distributed_shared)
 
 add_executable(c_api_test c_api_test.cc)
 target_link_libraries(c_api_test gtest_main ${LIBS})

From 0e44248051266ae6e00cab568c887d8c503b941a Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 16:29:15 +0800
Subject: [PATCH 36/82] fix: bug for reference map in multithread

---
 src/distributed/dist_cross_entropy_loss.cc | 14 +++++-----
 src/distributed/dist_linear_score.cc       | 32 +++++++++++-----------
 src/distributed/dist_linear_score.h        | 16 +++++------
 src/distributed/dist_score_function.h      |  4 +--
 4 files changed, 33 insertions(+), 33 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 7dca8db6..53b76215 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -82,15 +82,15 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
-                               std::unordered_map<index_t, real_t>* w,
-                               DistScore* score_func,
+                               std::unordered_map<index_t, real_t>& w,
+                               DistScore* dist_score_func,
                                bool is_norm,
                                real_t* sum,
-                               std::unordered_map<index_t, real_t>* g,
+                               std::unordered_map<index_t, real_t>& g,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
+  dist_score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -147,11 +147,11 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
-                             weight_map,
-                             score_func_,
+                             std::ref(weight_map),
+                             dist_score_func_,
                              norm_,
                              &(sum[i]),
-                             gradient_push_map,
+                             std::ref(gradient_push_map),
                              start_idx,
                              end_idx));
   }
diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index 5674771c..c7dbe424 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -39,9 +39,9 @@ real_t DistLinearScore::CalcScore(const SparseRow* row,
 
 // Calculate gradient and update current model
 void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
-                           std::unordered_map<index_t, real_t>* w,
+                           std::unordered_map<index_t, real_t>& w,
                            real_t* sum,
-                           std::unordered_map<index_t, real_t>* g,
+                           std::unordered_map<index_t, real_t>& g,
                            index_t start_idx,
                            index_t end_idx) {
   // Using sgd
@@ -60,15 +60,15 @@ void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using sgd
 void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
-                                std::unordered_map<index_t, real_t>* w,
+                                std::unordered_map<index_t, real_t>& w,
                                 real_t* sum,
-                                std::unordered_map<index_t, real_t>* g,
+                                std::unordered_map<index_t, real_t>& g,
                                 real_t start_idx,
                                 real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w);
+    real_t pred = CalcScore(row, &w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -76,23 +76,23 @@ void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val;
-      gradient += regu_lambda_ * (*w)[idx_g]; // get gradient
-      (*g)[idx_g] += gradient;
+      gradient += regu_lambda_ * w[idx_g]; // get gradient
+      g[idx_g] += gradient;
     }
   }
 }
 
 // Calculate gradient and update current model using adagrad
 void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
-                                    std::unordered_map<index_t, real_t>* w,
+                                    std::unordered_map<index_t, real_t>& w,
                                     real_t* sum,
-                                    std::unordered_map<index_t, real_t>* g,
+                                    std::unordered_map<index_t, real_t>& g,
                                     real_t start_idx,
                                     real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w);
+    real_t pred = CalcScore(row, &w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -100,22 +100,22 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val;
-      gradient += regu_lambda_ * (*w)[idx_g]; // get gradient
-      (*g)[idx_g] += gradient;
+      gradient += regu_lambda_ * w[idx_g]; // get gradient
+      g[idx_g] += gradient;
     }
   }
 }
 
 // Calculate gradient and update current model using ftrl
 void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
-                                 std::unordered_map<index_t, real_t>* w,
+                                 std::unordered_map<index_t, real_t>& w,
                                  real_t* sum,
-                                 std::unordered_map<index_t, real_t>* g,
+                                 std::unordered_map<index_t, real_t>& g,
                                  real_t start_idx,
                                  real_t end_idx) {
   for (int i = 0; i < start_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, w);
+    real_t pred = CalcScore(row, &w);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -123,7 +123,7 @@ void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
         iter != row->end(); ++iter) {
       index_t idx_g = iter->feat_id;
       real_t gradient = pg * iter->feat_val; // get gradient
-      (*g)[idx_g] += gradient;
+      g[idx_g] += gradient;
     }
   }
 }
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index 85b36f0c..d35a2416 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -45,36 +45,36 @@ class DistLinearScore : public DistScore {
                    real_t norm = 1.0);
 
   void DistCalcGrad(const DMatrix* matrix,
-                     std::unordered_map<index_t, real_t>* w,
+                     std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
-                     std::unordered_map<index_t, real_t>* g,
+                     std::unordered_map<index_t, real_t>& g,
                      index_t start_idx,
                      index_t end_idx);
 
  protected:
   // Calculate gradient and update model using sgd
   void calc_grad_sgd(const DMatrix* matrix,
-                     std::unordered_map<index_t, real_t>* w,
+                     std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
-                     std::unordered_map<index_t, real_t>* g,
+                     std::unordered_map<index_t, real_t>& g,
                      real_t start_idx,
                      real_t end_idx
                     );
 
   // Calculate gradient and update model using adagrad
   void calc_grad_adagrad(const DMatrix* matrix,
-                         std::unordered_map<index_t, real_t>* w,
+                         std::unordered_map<index_t, real_t>& w,
                          real_t* sum,
-                         std::unordered_map<index_t, real_t>* g,
+                         std::unordered_map<index_t, real_t>& g,
                          real_t start_idx,
                          real_t end_idx
                         );
 
   // Calculate gradient and update model using ftrl
   void calc_grad_ftrl(const DMatrix* matrix,
-                      std::unordered_map<index_t, real_t>* w,
+                      std::unordered_map<index_t, real_t>& w,
                       real_t* sum,
-                      std::unordered_map<index_t, real_t>* g,
+                      std::unordered_map<index_t, real_t>& g,
                       real_t start_idx,
                       real_t end_idx
                      );
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index cb51f4de..2eb5ab30 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -76,9 +76,9 @@ class DistScore {
                            real_t norm = 1.0) = 0;
 
   virtual void DistCalcGrad(const DMatrix* matrix,
-                               std::unordered_map<index_t, real_t>* w,
+                               std::unordered_map<index_t, real_t>& w,
                                real_t* sum,
-                               std::unordered_map<index_t, real_t>* g,
+                               std::unordered_map<index_t, real_t>& g,
                                index_t start_idx,
                                index_t end_idx) = 0;
 

From 4162c41eb21c0fd041d887e243344dbb8b18c733 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 16:29:50 +0800
Subject: [PATCH 37/82] update: src/loss/CMakeLists.txt

---
 src/loss/CMakeLists.txt |  6 +++---
 src/loss/loss.h         | 14 ++++++++++++++
 2 files changed, 17 insertions(+), 3 deletions(-)

diff --git a/src/loss/CMakeLists.txt b/src/loss/CMakeLists.txt
index 6c7ad985..0ef11765 100644
--- a/src/loss/CMakeLists.txt
+++ b/src/loss/CMakeLists.txt
@@ -2,13 +2,13 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
 # Build static library
-set(STA_DEPS score data base protobuf zmq ps)
+set(STA_DEPS score data base ps protobuf zmq distributed)
 add_library(loss STATIC loss.cc squared_loss.cc 
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss ${STA_DEPS})
 
 # Build shared library
-set(SHA_DEPS score_shared data_shared base_shared protobuf zmq ps)
+set(SHA_DEPS score_shared data_shared base_shared ps protobuf zmq distributed)
 add_library(loss_shared SHARED loss.cc squared_loss.cc
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss_shared ${SHA_DEPS})
@@ -19,7 +19,7 @@ set_target_properties(loss_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(loss PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build uinttests
-set(LIBS loss score data base gtest protobuf zmq ps)
+set(LIBS loss score data base gtest)
 
 add_executable(loss_test loss_test.cc)
 target_link_libraries(loss_test gtest_main ${LIBS})
diff --git a/src/loss/loss.h b/src/loss/loss.h
index acfddff9..bdb454e6 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -94,6 +94,19 @@ class Loss {
     lock_free_ = lock_free;
   }
 
+  void DistInitialize(DistScore* score,
+                  ThreadPool* pool,
+                  bool norm = true,
+                  bool lock_free = false) {
+    CHECK_NOTNULL(score);
+    CHECK_NOTNULL(pool);
+    dist_score_func_ = score;
+    pool_ = pool;
+    norm_ = norm;
+    threadNumber_ = pool_->ThreadNumber();
+    lock_free_ = lock_free;
+  }
+
   // Given predictions and labels, accumulate loss value.
   virtual void Evalute(const std::vector<real_t>& pred,
                        const std::vector<real_t>& label) = 0;
@@ -127,6 +140,7 @@ class Loss {
   /* The score function, including LinearScore,
   FMScore, FFMScore, etc */
   Score* score_func_;
+  DistScore* dist_score_func_;
   /* Use instance-wise normalization */
   bool norm_;
   /* Open lock-free training ? */

From d11c06e703688ee3cfe5ca59ac5d286dbbe693dc Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 22:16:31 +0800
Subject: [PATCH 38/82] rm: ps-lite

---
 ps-lite/CMakeLists.txt                        |   65 -
 ps-lite/LICENSE                               |  201 -
 ps-lite/Makefile                              |   52 -
 ps-lite/README.md                             |   95 -
 ps-lite/cmake/External/zmq.cmake              |   62 -
 ps-lite/cmake/Modules/FindZMQ.cmake           |   17 -
 ps-lite/cmake/ProtoBuf.cmake                  |   86 -
 ps-lite/deps/bin/curve_keygen                 |  Bin 8592 -> 0 bytes
 ps-lite/deps/bin/protoc                       |  Bin 15580 -> 0 bytes
 .../google/protobuf/compiler/code_generator.h |  142 -
 .../compiler/command_line_interface.h         |  353 -
 .../protobuf/compiler/cpp/cpp_generator.h     |   72 -
 .../google/protobuf/compiler/importer.h       |  304 -
 .../protobuf/compiler/java/java_generator.h   |   72 -
 .../include/google/protobuf/compiler/parser.h |  477 --
 .../include/google/protobuf/compiler/plugin.h |   72 -
 .../google/protobuf/compiler/plugin.pb.h      |  856 ---
 .../google/protobuf/compiler/plugin.proto     |  147 -
 .../compiler/python/python_generator.h        |  161 -
 .../deps/include/google/protobuf/descriptor.h | 1521 -----
 .../include/google/protobuf/descriptor.pb.h   | 5992 -----------------
 .../include/google/protobuf/descriptor.proto  |  620 --
 .../google/protobuf/descriptor_database.h     |  367 -
 .../include/google/protobuf/dynamic_message.h |  136 -
 .../include/google/protobuf/extension_set.h   | 1007 ---
 .../protobuf/generated_enum_reflection.h      |   85 -
 .../protobuf/generated_message_reflection.h   |  419 --
 .../google/protobuf/generated_message_util.h  |   77 -
 .../include/google/protobuf/io/coded_stream.h | 1136 ----
 .../include/google/protobuf/io/gzip_stream.h  |  209 -
 .../deps/include/google/protobuf/io/printer.h |  136 -
 .../include/google/protobuf/io/tokenizer.h    |  384 --
 .../google/protobuf/io/zero_copy_stream.h     |  238 -
 .../protobuf/io/zero_copy_stream_impl.h       |  357 -
 .../protobuf/io/zero_copy_stream_impl_lite.h  |  340 -
 .../deps/include/google/protobuf/message.h    |  837 ---
 .../include/google/protobuf/message_lite.h    |  246 -
 .../include/google/protobuf/reflection_ops.h  |   81 -
 .../include/google/protobuf/repeated_field.h  | 1519 -----
 .../deps/include/google/protobuf/service.h    |  291 -
 .../include/google/protobuf/stubs/atomicops.h |  206 -
 .../stubs/atomicops_internals_arm_gcc.h       |  151 -
 .../stubs/atomicops_internals_arm_qnx.h       |  146 -
 .../atomicops_internals_atomicword_compat.h   |  122 -
 .../stubs/atomicops_internals_macosx.h        |  225 -
 .../stubs/atomicops_internals_mips_gcc.h      |  187 -
 .../stubs/atomicops_internals_pnacl.h         |   73 -
 .../stubs/atomicops_internals_x86_gcc.h       |  293 -
 .../stubs/atomicops_internals_x86_msvc.h      |  150 -
 .../include/google/protobuf/stubs/common.h    | 1223 ----
 .../deps/include/google/protobuf/stubs/once.h |  148 -
 .../google/protobuf/stubs/platform_macros.h   |   70 -
 .../google/protobuf/stubs/template_util.h     |  138 -
 .../google/protobuf/stubs/type_traits.h       |  336 -
 .../include/google/protobuf/text_format.h     |  369 -
 .../google/protobuf/unknown_field_set.h       |  311 -
 .../include/google/protobuf/wire_format.h     |  308 -
 .../google/protobuf/wire_format_lite.h        |  622 --
 .../google/protobuf/wire_format_lite_inl.h    |  776 ---
 ps-lite/deps/include/zmq.h                    |  463 --
 ps-lite/deps/include/zmq_utils.h              |   20 -
 ps-lite/deps/lib/pkgconfig/libzmq.pc          |   10 -
 ps-lite/deps/lib/pkgconfig/protobuf-lite.pc   |   13 -
 ps-lite/deps/lib/pkgconfig/protobuf.pc        |   14 -
 ps-lite/deps/share/man/man3/zmq_bind.3        |  194 -
 ps-lite/deps/share/man/man3/zmq_close.3       |   70 -
 ps-lite/deps/share/man/man3/zmq_connect.3     |  171 -
 ps-lite/deps/share/man/man3/zmq_ctx_get.3     |   85 -
 ps-lite/deps/share/man/man3/zmq_ctx_new.3     |   55 -
 ps-lite/deps/share/man/man3/zmq_ctx_set.3     |  148 -
 .../deps/share/man/man3/zmq_ctx_shutdown.3    |   58 -
 ps-lite/deps/share/man/man3/zmq_ctx_term.3    |  129 -
 .../deps/share/man/man3/zmq_curve_keypair.3   |   69 -
 ps-lite/deps/share/man/man3/zmq_disconnect.3  |  113 -
 ps-lite/deps/share/man/man3/zmq_errno.3       |   67 -
 ps-lite/deps/share/man/man3/zmq_getsockopt.3  | 1879 ------
 ps-lite/deps/share/man/man3/zmq_has.3         |  113 -
 ps-lite/deps/share/man/man3/zmq_msg_close.3   |   70 -
 ps-lite/deps/share/man/man3/zmq_msg_copy.3    |  106 -
 ps-lite/deps/share/man/man3/zmq_msg_data.3    |   65 -
 ps-lite/deps/share/man/man3/zmq_msg_get.3     |  104 -
 ps-lite/deps/share/man/man3/zmq_msg_gets.3    |   93 -
 ps-lite/deps/share/man/man3/zmq_msg_init.3    |   99 -
 .../deps/share/man/man3/zmq_msg_init_data.3   |  146 -
 .../deps/share/man/man3/zmq_msg_init_size.3   |   86 -
 ps-lite/deps/share/man/man3/zmq_msg_more.3    |   75 -
 ps-lite/deps/share/man/man3/zmq_msg_move.3    |   68 -
 ps-lite/deps/share/man/man3/zmq_msg_recv.3    |  161 -
 ps-lite/deps/share/man/man3/zmq_msg_send.3    |  179 -
 ps-lite/deps/share/man/man3/zmq_msg_set.3     |   56 -
 ps-lite/deps/share/man/man3/zmq_msg_size.3    |   65 -
 ps-lite/deps/share/man/man3/zmq_poll.3        |  177 -
 ps-lite/deps/share/man/man3/zmq_proxy.3       |   89 -
 .../deps/share/man/man3/zmq_proxy_steerable.3 |  112 -
 ps-lite/deps/share/man/man3/zmq_recv.3        |  122 -
 ps-lite/deps/share/man/man3/zmq_recvmsg.3     |  175 -
 ps-lite/deps/share/man/man3/zmq_send.3        |  153 -
 ps-lite/deps/share/man/man3/zmq_send_const.3  |  153 -
 ps-lite/deps/share/man/man3/zmq_sendmsg.3     |  193 -
 ps-lite/deps/share/man/man3/zmq_setsockopt.3  | 2473 -------
 ps-lite/deps/share/man/man3/zmq_socket.3      | 1025 ---
 .../deps/share/man/man3/zmq_socket_monitor.3  |  235 -
 ps-lite/deps/share/man/man3/zmq_strerror.3    |   67 -
 ps-lite/deps/share/man/man3/zmq_unbind.3      |  120 -
 ps-lite/deps/share/man/man3/zmq_version.3     |   67 -
 ps-lite/deps/share/man/man3/zmq_z85_decode.3  |   64 -
 ps-lite/deps/share/man/man3/zmq_z85_encode.3  |   69 -
 ps-lite/deps/share/man/man7/zmq.7             |  246 -
 ps-lite/deps/share/man/man7/zmq_curve.7       |   93 -
 ps-lite/deps/share/man/man7/zmq_inproc.7      |  103 -
 ps-lite/deps/share/man/man7/zmq_ipc.7         |  166 -
 ps-lite/deps/share/man/man7/zmq_null.7        |   40 -
 ps-lite/deps/share/man/man7/zmq_pgm.7         |  200 -
 ps-lite/deps/share/man/man7/zmq_plain.7       |   43 -
 ps-lite/deps/share/man/man7/zmq_tcp.7         |  188 -
 ps-lite/deps/share/man/man7/zmq_tipc.7        |  106 -
 ps-lite/docs/Doxyfile                         | 2310 -------
 ps-lite/docs/Makefile                         |  216 -
 ps-lite/docs/api.md                           |   40 -
 ps-lite/docs/conf.py                          |  315 -
 ps-lite/docs/env.md                           |   15 -
 ps-lite/docs/get_started.md                   |    1 -
 ps-lite/docs/how_to.md                        |   74 -
 ps-lite/docs/index.md                         |   16 -
 ps-lite/docs/overview.md                      |  184 -
 ps-lite/docs/requirements.txt                 |    1 -
 ps-lite/docs/sphinx_util.py                   |   19 -
 ps-lite/docs/tutorials.md                     |    1 -
 ps-lite/include/dmlc/base.h                   |  178 -
 ps-lite/include/dmlc/logging.h                |  234 -
 ps-lite/include/ps/base.h                     |   33 -
 ps-lite/include/ps/internal/assign_op.h       |   72 -
 ps-lite/include/ps/internal/customer.h        |  102 -
 ps-lite/include/ps/internal/env.h             |   63 -
 ps-lite/include/ps/internal/message.h         |  218 -
 .../include/ps/internal/parallel_kv_match.h   |  123 -
 ps-lite/include/ps/internal/parallel_sort.h   |   58 -
 ps-lite/include/ps/internal/postoffice.h      |  189 -
 .../include/ps/internal/threadsafe_queue.h    |   59 -
 ps-lite/include/ps/internal/utils.h           |   48 -
 ps-lite/include/ps/internal/van.h             |  130 -
 ps-lite/include/ps/kv_app.h                   |  607 --
 ps-lite/include/ps/ps.h                       |   78 -
 ps-lite/include/ps/range.h                    |   26 -
 ps-lite/include/ps/sarray.h                   |  315 -
 ps-lite/include/ps/simple_app.h               |  179 -
 ps-lite/make/deps.mk                          |   68 -
 ps-lite/make/ps.mk                            |   13 -
 ps-lite/src/customer.cc                       |   66 -
 ps-lite/src/meta.proto                        |   49 -
 ps-lite/src/network_utils.h                   |  258 -
 ps-lite/src/postoffice.cc                     |  176 -
 ps-lite/src/resender.h                        |  141 -
 ps-lite/src/van.cc                            |  422 --
 ps-lite/src/windows/unistd.h                  |   48 -
 ps-lite/src/zmq_van.h                         |  287 -
 ps-lite/tags                                  | 4116 -----------
 ps-lite/tests/README.md                       |    7 -
 ps-lite/tests/lint.py                         |  173 -
 ps-lite/tests/local.sh                        |   37 -
 ps-lite/tests/repeat.sh                       |   16 -
 ps-lite/tests/test.mk                         |   10 -
 ps-lite/tests/travis/travis_before_cache.sh   |    3 -
 ps-lite/tests/travis/travis_script.sh         |   16 -
 ps-lite/tests/travis/travis_setup_env.sh      |   12 -
 ps-lite/tracker/README.md                     |   26 -
 ps-lite/tracker/dmlc_local.py                 |  100 -
 ps-lite/tracker/dmlc_mpi.py                   |   91 -
 ps-lite/tracker/dmlc_ssh.py                   |  113 -
 ps-lite/tracker/tracker.py                    |  433 --
 170 files changed, 49194 deletions(-)
 delete mode 100644 ps-lite/CMakeLists.txt
 delete mode 100644 ps-lite/LICENSE
 delete mode 100644 ps-lite/Makefile
 delete mode 100644 ps-lite/README.md
 delete mode 100644 ps-lite/cmake/External/zmq.cmake
 delete mode 100644 ps-lite/cmake/Modules/FindZMQ.cmake
 delete mode 100644 ps-lite/cmake/ProtoBuf.cmake
 delete mode 100755 ps-lite/deps/bin/curve_keygen
 delete mode 100755 ps-lite/deps/bin/protoc
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/code_generator.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/importer.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/parser.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/plugin.proto
 delete mode 100644 ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/descriptor.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/descriptor.pb.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/descriptor.proto
 delete mode 100644 ps-lite/deps/include/google/protobuf/descriptor_database.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/dynamic_message.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/extension_set.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/generated_message_reflection.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/generated_message_util.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/coded_stream.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/gzip_stream.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/printer.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/tokenizer.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/message.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/message_lite.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/reflection_ops.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/repeated_field.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/service.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/common.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/once.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/template_util.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/stubs/type_traits.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/text_format.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/unknown_field_set.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/wire_format.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/wire_format_lite.h
 delete mode 100644 ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
 delete mode 100644 ps-lite/deps/include/zmq.h
 delete mode 100644 ps-lite/deps/include/zmq_utils.h
 delete mode 100644 ps-lite/deps/lib/pkgconfig/libzmq.pc
 delete mode 100644 ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
 delete mode 100644 ps-lite/deps/lib/pkgconfig/protobuf.pc
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_bind.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_close.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_connect.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_get.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_new.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_set.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_ctx_term.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_curve_keypair.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_disconnect.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_errno.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_getsockopt.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_has.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_close.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_copy.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_data.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_get.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_gets.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init_data.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_init_size.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_more.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_move.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_recv.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_send.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_set.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_msg_size.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_poll.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_proxy.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_recv.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_recvmsg.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_send.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_send_const.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_sendmsg.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_setsockopt.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_socket.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_socket_monitor.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_strerror.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_unbind.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_version.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_z85_decode.3
 delete mode 100644 ps-lite/deps/share/man/man3/zmq_z85_encode.3
 delete mode 100644 ps-lite/deps/share/man/man7/zmq.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_curve.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_inproc.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_ipc.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_null.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_pgm.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_plain.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_tcp.7
 delete mode 100644 ps-lite/deps/share/man/man7/zmq_tipc.7
 delete mode 100644 ps-lite/docs/Doxyfile
 delete mode 100644 ps-lite/docs/Makefile
 delete mode 100644 ps-lite/docs/api.md
 delete mode 100644 ps-lite/docs/conf.py
 delete mode 100644 ps-lite/docs/env.md
 delete mode 100644 ps-lite/docs/get_started.md
 delete mode 100644 ps-lite/docs/how_to.md
 delete mode 100644 ps-lite/docs/index.md
 delete mode 100644 ps-lite/docs/overview.md
 delete mode 100644 ps-lite/docs/requirements.txt
 delete mode 100644 ps-lite/docs/sphinx_util.py
 delete mode 100644 ps-lite/docs/tutorials.md
 delete mode 100644 ps-lite/include/dmlc/base.h
 delete mode 100644 ps-lite/include/dmlc/logging.h
 delete mode 100644 ps-lite/include/ps/base.h
 delete mode 100644 ps-lite/include/ps/internal/assign_op.h
 delete mode 100644 ps-lite/include/ps/internal/customer.h
 delete mode 100644 ps-lite/include/ps/internal/env.h
 delete mode 100644 ps-lite/include/ps/internal/message.h
 delete mode 100644 ps-lite/include/ps/internal/parallel_kv_match.h
 delete mode 100644 ps-lite/include/ps/internal/parallel_sort.h
 delete mode 100644 ps-lite/include/ps/internal/postoffice.h
 delete mode 100644 ps-lite/include/ps/internal/threadsafe_queue.h
 delete mode 100644 ps-lite/include/ps/internal/utils.h
 delete mode 100644 ps-lite/include/ps/internal/van.h
 delete mode 100644 ps-lite/include/ps/kv_app.h
 delete mode 100644 ps-lite/include/ps/ps.h
 delete mode 100644 ps-lite/include/ps/range.h
 delete mode 100644 ps-lite/include/ps/sarray.h
 delete mode 100644 ps-lite/include/ps/simple_app.h
 delete mode 100644 ps-lite/make/deps.mk
 delete mode 100644 ps-lite/make/ps.mk
 delete mode 100644 ps-lite/src/customer.cc
 delete mode 100644 ps-lite/src/meta.proto
 delete mode 100644 ps-lite/src/network_utils.h
 delete mode 100644 ps-lite/src/postoffice.cc
 delete mode 100644 ps-lite/src/resender.h
 delete mode 100644 ps-lite/src/van.cc
 delete mode 100644 ps-lite/src/windows/unistd.h
 delete mode 100644 ps-lite/src/zmq_van.h
 delete mode 100644 ps-lite/tags
 delete mode 100644 ps-lite/tests/README.md
 delete mode 100755 ps-lite/tests/lint.py
 delete mode 100755 ps-lite/tests/local.sh
 delete mode 100755 ps-lite/tests/repeat.sh
 delete mode 100644 ps-lite/tests/test.mk
 delete mode 100755 ps-lite/tests/travis/travis_before_cache.sh
 delete mode 100755 ps-lite/tests/travis/travis_script.sh
 delete mode 100644 ps-lite/tests/travis/travis_setup_env.sh
 delete mode 100644 ps-lite/tracker/README.md
 delete mode 100755 ps-lite/tracker/dmlc_local.py
 delete mode 100755 ps-lite/tracker/dmlc_mpi.py
 delete mode 100755 ps-lite/tracker/dmlc_ssh.py
 delete mode 100644 ps-lite/tracker/tracker.py

diff --git a/ps-lite/CMakeLists.txt b/ps-lite/CMakeLists.txt
deleted file mode 100644
index e5d13d02..00000000
--- a/ps-lite/CMakeLists.txt
+++ /dev/null
@@ -1,65 +0,0 @@
-cmake_minimum_required(VERSION 2.8.7)
-
-project(pslite C CXX)
-
-if(NOT MSVC)
-  set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} -std=c++11")
-endif()
-
-list(APPEND CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake/Modules)
-
-include(ExternalProject) 
-set(pslite_LINKER_LIBS_L "" )
-set(pslite_LINKER_LIBS_L_RELEASE "" )
-set(pslite_LINKER_LIBS_L_DEBUG "" )
-set(pslite_INCLUDE_DIR_L "" )
-
-# ---[ zmq
-include("cmake/External/zmq.cmake")
-include_directories(pslite ${ZMQ_INCLUDE_DIRS})
-list(APPEND pslite_LINKER_LIBS_L ${ZMQ_LIBRARIES})
-# ---[ Google-protobuf
-include(cmake/ProtoBuf.cmake)
-
-# generate protobuf sources
-set(proto_gen_folder "${PROJECT_BINARY_DIR}/src")
-file(GLOB_RECURSE proto_files "src/*.proto")
-pslite_protobuf_generate_cpp_py(${proto_gen_folder} proto_srcs proto_hdrs proto_python "${PROJECT_SOURCE_DIR}" "src" ${proto_files})
-include_directories(pslite "${PROJECT_SOURCE_DIR}/include/")
-include_directories(pslite "${PROJECT_BINARY_DIR}/include/")
-include_directories(pslite "${PROJECT_BINARY_DIR}/src/")
-list(APPEND pslite_INCLUDE_DIR_L "${PROJECT_BINARY_DIR}/include/")
-
-#FILE(COPY DIRECTORY "${PROJECT_BINARY_DIR}/include" DESTINATION "${PROJECT_SOURCE_DIR}/" FILES_MATCHING PATTERN "*.pb.h")
-FILE(GLOB SOURCE "src/*.cc")
-
-if(MSVC)
-set(CMAKE_CXX_FLAGS "${CMAKE_CXX_FLAGS} /EHsc")
-FILE(GLOB getopt_SOURCE "src/windows/getopt.c")
-list(APPEND SOURCE ${getopt_SOURCE}) 
-add_definitions(-DSTATIC_GETOPT)
-include_directories(pslite "${PROJECT_SOURCE_DIR}/src/windows")
-list(APPEND pslite_LINKER_LIBS_L "ipHlpApi.lib" "ws2_32.lib")
-  foreach(flag_var
-        CMAKE_CXX_FLAGS CMAKE_CXX_FLAGS_DEBUG CMAKE_CXX_FLAGS_RELEASE
-        CMAKE_CXX_FLAGS_MINSIZEREL CMAKE_CXX_FLAGS_RELWITHDEBINFO)
-    if(${flag_var} MATCHES "/MD")
-      string(REGEX REPLACE "/MD" "/MT" ${flag_var} "${${flag_var}}")
-    endif(${flag_var} MATCHES "/MD")
-  endforeach(flag_var)
-endif()
-
-list(APPEND SOURCE ${proto_srcs}) 
-add_library(pslite ${SOURCE}) 
-
-target_link_libraries(pslite ${pslite_LINKER_LIBS})
-
-list(APPEND pslite_LINKER_LIBS_L_RELEASE ${Protobuf_LIBRARY})
-list(APPEND pslite_LINKER_LIBS_L_DEBUG ${Protobuf_LIBRARY_DEBUG})
-list(APPEND pslite_INCLUDE_DIR_L "${PROJECT_SOURCE_DIR}/include")
-list(APPEND pslite_INCLUDE_DIR_L ${PROTOBUF_INCLUDE_DIR})
-
-set(pslite_LINKER_LIBS ${pslite_LINKER_LIBS_L} PARENT_SCOPE)
-set(pslite_LINKER_LIBS_RELEASE ${pslite_LINKER_LIBS_L_RELEASE} PARENT_SCOPE)
-set(pslite_LINKER_LIBS_DEBUG ${pslite_LINKER_LIBS_L_DEBUG} PARENT_SCOPE)
-set(pslite_INCLUDE_DIR ${pslite_INCLUDE_DIR_L} PARENT_SCOPE)
diff --git a/ps-lite/LICENSE b/ps-lite/LICENSE
deleted file mode 100644
index dec0d207..00000000
--- a/ps-lite/LICENSE
+++ /dev/null
@@ -1,201 +0,0 @@
-Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "{}"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright 2015 Carnegie Mellon University
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.
diff --git a/ps-lite/Makefile b/ps-lite/Makefile
deleted file mode 100644
index 512221bf..00000000
--- a/ps-lite/Makefile
+++ /dev/null
@@ -1,52 +0,0 @@
-ifdef config
-include $(config)
-endif
-
-include make/ps.mk
-
-ifndef CXX
-CXX = g++
-endif
-
-ifndef DEPS_PATH
-DEPS_PATH = $(shell pwd)/deps
-endif
-
-
-ifndef PROTOC
-PROTOC = ${DEPS_PATH}/bin/protoc
-endif
-
-INCPATH = -I./src -I./include -I$(DEPS_PATH)/include
-CFLAGS = -std=c++11 -msse2 -fPIC -O3 -ggdb -Wall -finline-functions $(INCPATH) $(ADD_CFLAGS)
-
-all: ps test
-
-include make/deps.mk
-
-clean:
-	rm -rf build $(TEST) tests/*.d
-	find src -name "*.pb.[ch]*" -delete
-
-lint:
-	python tests/lint.py ps all include/ps src
-
-ps: build/libps.a
-
-OBJS = $(addprefix build/, customer.o postoffice.o van.o meta.pb.o)
-build/libps.a: $(OBJS)
-	ar crv $@ $(filter %.o, $?)
-
-build/%.o: src/%.cc ${ZMQ} src/meta.pb.h
-	@mkdir -p $(@D)
-	$(CXX) $(INCPATH) -std=c++0x -MM -MT build/$*.o $< >build/$*.d
-	$(CXX) $(CFLAGS) -c $< -o $@
-
-src/%.pb.cc src/%.pb.h : src/%.proto ${PROTOBUF}
-	$(PROTOC) --cpp_out=./src --proto_path=./src $<
-
--include build/*.d
--include build/*/*.d
-
-include tests/test.mk
-test: $(TEST)
diff --git a/ps-lite/README.md b/ps-lite/README.md
deleted file mode 100644
index a3f9ce9b..00000000
--- a/ps-lite/README.md
+++ /dev/null
@@ -1,95 +0,0 @@
-<img src="http://parameterserver.org/images/parameterserver.png"  width=400 />
-
-[![Build Status](https://travis-ci.org/dmlc/ps-lite.svg?branch=master)](https://travis-ci.org/dmlc/ps-lite)
-[![GitHub license](http://dmlc.github.io/img/apache2.svg)](./LICENSE)
-
-A light and efficient implementation of the parameter server
-framework. It provides clean yet powerful APIs. For example, a worker node can
-communicate with the server nodes by
-- `Push(keys, values)`: push a list of (key, value) pairs to the server nodes
-- `Pull(keys)`: pull the values from servers for a list of keys
-- `Wait`: wait untill a push or pull finished.
-
-A simple example:
-
-```c++
-  std::vector<uint64_t> key = {1, 3, 5};
-  std::vector<float> val = {1, 1, 1};
-  std::vector<float> recv_val;
-  ps::KVWorker<float> w;
-  w.Wait(w.Push(key, val));
-  w.Wait(w.Pull(key, &recv_val));
-```
-
-More features:
-
-- Flexible and high-performance communication: zero-copy push/pull, supporting
-  dynamic length values, user-defined filters for communication compression
-- Server-side programming: supporting user-defined handles on server nodes
-
-### Build
-
-`ps-lite` requires a C++11 compiler such as `g++ >= 4.8`. On Ubuntu >= 13.10, we
-can install it by
-```
-sudo apt-get update && sudo apt-get install -y build-essential git
-```
-Instructions for
-[older Ubuntu](http://ubuntuhandbook.org/index.php/2013/08/install-gcc-4-8-via-ppa-in-ubuntu-12-04-13-04/),
-[Centos](http://linux.web.cern.ch/linux/devtoolset/),
-and
-[Mac Os X](http://hpc.sourceforge.net/).
-
-Then clone and build
-
-```bash
-git clone https://github.com/dmlc/ps-lite
-cd ps-lite && make -j4
-```
-
-### How to use
-
-`ps-lite` provides asynchronous communication for other projects: 
-  - Distributed deep neural networks:
-    [MXNet](https://github.com/dmlc/mxnet),
-    [CXXNET](https://github.com/dmlc/cxxnet) and
-    [Minverva](https://github.com/minerva-developers/minerva)
-  - Distributed high dimensional inference, such as sparse logistic regression,
-    factorization machines:
-    [DiFacto](https://github.com/dmlc/difacto)
-    [Wormhole](https://github.com/dmlc/wormhole)
-
-### History
-
-We started to work on the parameter server framework since 2010.
-
-1. The first generation was
-designed and optimized for specific algorithms, such as logistic regression and
-LDA, to serve the sheer size industrial machine learning tasks (hundreds billions of
-examples and features with 10-100TB data size) .
-
-2. Later we tried to build a open-source general purpose framework for machine learning
-algorithms. The project is available at [dmlc/parameter_server](https://github.com/dmlc/parameter_server).
-
-3. Given the growing demands from other projects, we created `ps-lite`, which provides a clean data communication API and a
-lightweight implementation. The implementation is based on `dmlc/parameter_server`, but we refactored the job launchers, file I/O and machine
-learning algorithms codes into different projects such as `dmlc-core` and
-`wormhole`.
-
-4. From the experience we learned during developing
-   [dmlc/mxnet](https://github.com/dmlc/mxnet), we further refactored the API and implementation from [v1](https://github.com/dmlc/ps-lite/releases/tag/v1). The main
-   changes include
-   - less library dependencies
-   - more flexible user-defined callbacks, which facilitate other language
-   bindings
-   - let the users, such as the dependency
-     engine of mxnet, manage the data consistency
-
-### Research papers
-  1. Mu Li, Dave Andersen, Alex Smola, Junwoo Park, Amr Ahmed, Vanja Josifovski,
-     James Long, Eugene Shekita, Bor-Yiing
-     Su. [Scaling Distributed Machine Learning with the Parameter Server](http://www.cs.cmu.edu/~muli/file/parameter_server_osdi14.pdf). In
-     Operating Systems Design and Implementation (OSDI), 2014
-  2. Mu Li, Dave Andersen, Alex Smola, and Kai
-     Yu. [Communication Efficient Distributed Machine Learning with the Parameter Server](http://www.cs.cmu.edu/~muli/file/parameter_server_nips14.pdf). In
-     Neural Information Processing Systems (NIPS), 2014
diff --git a/ps-lite/cmake/External/zmq.cmake b/ps-lite/cmake/External/zmq.cmake
deleted file mode 100644
index 32074700..00000000
--- a/ps-lite/cmake/External/zmq.cmake
+++ /dev/null
@@ -1,62 +0,0 @@
-if (NOT __ZMQ_INCLUDED) # guard against multiple includes
-  set(__ZMQ_INCLUDED TRUE)
-
-  # use the system-wide ZMQ if present
-  find_package(ZMQ)
-  if (ZMQ_FOUND)
-    set(ZMQ_EXTERNAL FALSE)
-  else()
-    # ZMQ will use pthreads if it's available in the system, so we must link with it
-    find_package(Threads)
-
-    # build directory
-    set(ZMQ_PREFIX ${CMAKE_BINARY_DIR}/external/ZMQ-prefix)
-    # install directory
-    set(ZMQ_INSTALL ${CMAKE_BINARY_DIR}/external/ZMQ-install)
-
-    # we build ZMQ statically, but want to link it into the caffe shared library
-    # this requires position-independent code
-    if (UNIX)
-        set(ZMQ_EXTRA_COMPILER_FLAGS "-fPIC")
-    endif()
-
-    set(ZMQ_CXX_FLAGS ${CMAKE_CXX_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
-    set(ZMQ_C_FLAGS ${CMAKE_C_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
-
-    ExternalProject_Add(ZMQ
-      PREFIX ${ZMQ_PREFIX}
-      GIT_REPOSITORY "https://github.com/zeromq/libZMQ.git"
-      UPDATE_COMMAND ""
-      INSTALL_DIR ${ZMQ_INSTALL}
-      CMAKE_ARGS -DCMAKE_BUILD_TYPE=${CMAKE_BUILD_TYPE}
-                 -DCMAKE_INSTALL_PREFIX=${ZMQ_INSTALL}
-                 -DBUILD_SHARED_LIBS=OFF
-                 -DBUILD_STATIC_LIBS=ON
-                 -DBUILD_PACKAGING=OFF
-                 -DBUILD_TESTING=OFF
-                 -DBUILD_NC_TESTS=OFF
-                 -BUILD_CONFIG_TESTS=OFF
-                 -DINSTALL_HEADERS=ON
-                 -DCMAKE_C_FLAGS=${ZMQ_C_FLAGS}
-                 -DCMAKE_CXX_FLAGS=${ZMQ_CXX_FLAGS}
-      LOG_DOWNLOAD 1
-      LOG_INSTALL 1
-      )
-
-    set(ZMQ_FOUND TRUE)
-    set(ZMQ_INCLUDE_DIRS ${ZMQ_INSTALL}/include)
-	
-	if(MSVC)
-		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-${CMAKE_VS_PLATFORM_TOOLSET}*.lib")
-		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/ZMQ.lib ${CMAKE_THREAD_LIBS_INIT})
-	else()
-		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-*.a")
-		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/libZMQ.a ${CMAKE_THREAD_LIBS_INIT})
-	endif()
-    set(ZMQ_LIBRARY_DIRS ${ZMQ_INSTALL}/lib)
-    set(ZMQ_EXTERNAL TRUE)
-
-    list(APPEND external_project_dependencies ZMQ)
-  endif()
-
-endif()
diff --git a/ps-lite/cmake/Modules/FindZMQ.cmake b/ps-lite/cmake/Modules/FindZMQ.cmake
deleted file mode 100644
index 11319098..00000000
--- a/ps-lite/cmake/Modules/FindZMQ.cmake
+++ /dev/null
@@ -1,17 +0,0 @@
-# - Try to find ZMQ
-# Once done this will define
-# ZMQ_FOUND - System has ZMQ
-# ZMQ_INCLUDE_DIRS - The ZMQ include directories
-# ZMQ_LIBRARIES - The libraries needed to use ZMQ
-# ZMQ_DEFINITIONS - Compiler switches required for using ZMQ
-
-find_path ( ZMQ_INCLUDE_DIR zmq.h )
-find_library ( ZMQ_LIBRARY NAMES zmq )
-
-set ( ZMQ_LIBRARIES ${ZMQ_LIBRARY} )
-set ( ZMQ_INCLUDE_DIRS ${ZMQ_INCLUDE_DIR} )
-
-include ( FindPackageHandleStandardArgs )
-# handle the QUIETLY and REQUIRED arguments and set ZMQ_FOUND to TRUE
-# if all listed variables are TRUE
-find_package_handle_standard_args ( ZMQ DEFAULT_MSG ZMQ_LIBRARY ZMQ_INCLUDE_DIR )
\ No newline at end of file
diff --git a/ps-lite/cmake/ProtoBuf.cmake b/ps-lite/cmake/ProtoBuf.cmake
deleted file mode 100644
index b22d1910..00000000
--- a/ps-lite/cmake/ProtoBuf.cmake
+++ /dev/null
@@ -1,86 +0,0 @@
-# Finds Google Protocol Buffers library and compilers and extends
-# the standard cmake script with version and python generation support
-
-find_package( Protobuf REQUIRED )
-include_directories(SYSTEM ${PROTOBUF_INCLUDE_DIR})
-
-
-# As of Ubuntu 14.04 protoc is no longer a part of libprotobuf-dev package
-# and should be installed separately as in: sudo apt-get install protobuf-compiler
-if(EXISTS ${PROTOBUF_PROTOC_EXECUTABLE})
-  message(STATUS "Found PROTOBUF Compiler: ${PROTOBUF_PROTOC_EXECUTABLE}")
-else()
-  message(FATAL_ERROR "Could not find PROTOBUF Compiler")
-endif()
-
-
-# place where to generate protobuf sources
-set(proto_gen_folder "${PROJECT_BINARY_DIR}/include/pslite/proto")
-include_directories(SYSTEM "${PROJECT_BINARY_DIR}/include")
-
-set(PROTOBUF_GENERATE_CPP_APPEND_PATH TRUE)
-
-################################################################################################
-# Modification of standard 'protobuf_generate_cpp()' with output dir parameter and python support
-# Usage:
-#   pslite_protobuf_generate_cpp_py(<output_dir> <srcs_var> <hdrs_var> <python_var> <proto_files>)
-function(pslite_protobuf_generate_cpp_py output_dir srcs_var hdrs_var python_var work_path proto_path)
-  if(NOT ARGN)
-    message(SEND_ERROR "Error: pslite_protobuf_generate_cpp_py() called without any proto files")
-    return()
-  endif()
-
-  if(PROTOBUF_GENERATE_CPP_APPEND_PATH)
-    # Create an include path for each file specified
-    foreach(fil ${ARGN})
-      get_filename_component(abs_fil ${fil} ABSOLUTE)
-      get_filename_component(abs_path ${abs_fil} PATH)
-      list(FIND _protoc_include ${abs_path} _contains_already)
-      if(${_contains_already} EQUAL -1)
-        list(APPEND _protoc_include -I ${abs_path})
-      endif()
-    endforeach()
-  else()
-    set(_protoc_include -I ${CMAKE_CURRENT_SOURCE_DIR})
-  endif()
-
-  if(DEFINED PROTOBUF_IMPORT_DIRS)
-    foreach(dir ${PROTOBUF_IMPORT_DIRS})
-      get_filename_component(abs_path ${dir} ABSOLUTE)
-      list(FIND _protoc_include ${abs_path} _contains_already)
-      if(${_contains_already} EQUAL -1)
-        list(APPEND _protoc_include -I ${abs_path})
-      endif()
-    endforeach()
-  endif()
-
-  set(${srcs_var})
-  set(${hdrs_var})
-  set(${python_var})
-  foreach(fil ${ARGN})
-    get_filename_component(abs_fil ${fil} ABSOLUTE)
-    get_filename_component(fil_we ${fil} NAME_WE)
-	string(REPLACE ${work_path}/ "" o_fil ${abs_fil})
-	string(REPLACE "${fil_we}.proto" "" o_fil_path ${o_fil})
-
-    list(APPEND ${srcs_var} "${o_fil_path}/${fil_we}.pb.cc")
-    list(APPEND ${hdrs_var} "${o_fil_path}/${fil_we}.pb.h")
-    list(APPEND ${python_var} "${o_fil_path}/${fil_we}_pb2.py")
-	
-    add_custom_command(
-      OUTPUT "${o_fil_path}/${fil_we}.pb.cc"
-             "${o_fil_path}/${fil_we}.pb.h"
-             "${o_fil_path}/${fil_we}_pb2.py"
-      COMMAND ${CMAKE_COMMAND} -E make_directory "${output_dir}"
-      COMMAND ${PROTOBUF_PROTOC_EXECUTABLE} --cpp_out    ${output_dir} ${o_fil} --proto_path ${proto_path}
-      COMMAND ${PROTOBUF_PROTOC_EXECUTABLE} --python_out ${output_dir} ${o_fil} --proto_path ${proto_path}
-      DEPENDS ${abs_fil}
-	  WORKING_DIRECTORY ${work_path}
-      COMMENT "Running C++/Python protocol buffer compiler on ${o_fil}" VERBATIM )
-  endforeach()
-
-  set_source_files_properties(${${srcs_var}} ${${hdrs_var}} ${${python_var}} PROPERTIES GENERATED TRUE)
-  set(${srcs_var} ${${srcs_var}} PARENT_SCOPE)
-  set(${hdrs_var} ${${hdrs_var}} PARENT_SCOPE)
-  set(${python_var} ${${python_var}} PARENT_SCOPE)
-endfunction()
diff --git a/ps-lite/deps/bin/curve_keygen b/ps-lite/deps/bin/curve_keygen
deleted file mode 100755
index c67ace79e2672ef9a87f3cfc9c5b09e20e0901c6..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 8592
zcmeHMO^6&t6t2miAtvrd#2-|stga>|nMsT*3%atK%_O@d>Si-5aW9pgncD3pJ>6qh
zcV;IltR@Q%W?>E@5hCo}tAYek@uHp-5y`<rE|C!w@uY}2ey^%~c4iX2EB&B;zE|(P
ze)UxkQ(g7dA3y(f8)KP`j4f|qjO|1@vzf6K#?fQ!K9ngGA!a6y<>&LW&y%)SGQIGY
zh~iv>p%8`q=|ZoG_8;uku^1yahIDix3n4<e6jIMff4no>F&PZ~5|0z!6!&$ri7j_S
zAygO@RY%nyZ)S&ycW-Qw;KX5T9B)gkF!6*f-Kq?r>yKy0@kV2N!o+(=ZpyEu!ocws
zV}t&9YjM1L;vj^(r6)E9gowPF<CTTuE%+MuuE&Q1X1=uMB!v58m=ROcy0%b+I5JU~
z=o-QL^{i{MzFq5zcdip#2+tL&UMc#nsD{Bm#!JG``$7JR5dYolEQD+QTf9N|Q+_-S
zK)5>|y?4o)lF9n-;KcNE$MZ*~lXsZ+%@dfUsVC1E#fiIGKZM`e0qSwawxZdJ_6*v7
zu{mR8N8Ho9w+2kHMt3oG8tv^UGbr6cwp8f%@=r1d|82JzyaPIpf}ab^MJmX-PBB-m
zyJcXK`%x&5H$Q9srbeHX?>{qi_QtOtY<?IzPzOguMR_d2q=W3ne94b~huuPO8HL6u
zXT$aumYY*DP`M??@|7LcEN?Ma_DfMkdZEhso?LMKTF$RZPx(<$k~!C3bX4e+L?9Of
zsg&b;qN;LLwcm9@nJY^GnhMJK%1haiEav1C%{)i()a3aap8gK6PiB4YusT&&p{!&N
zCq9%V<xT67__580GW~v~y?e6<W2Z-8OZ;5sX1({scnvs}l!26il!26il!5;%19MZ2
z8&j|S)WrOzR>!jVulzj!Cr!3>&8W&yHS$+lUmEzXhL>Ac4g6Naw_5KRxC2{-M!wm)
zV&D-CFSS-RjMk=BU;Vm~f1`B)_`>gO;Nqj`v|iR||G)~ivXsO$yjt_<H}V%hL44La
zW(I0BFroVtXSp@9u5YZo(r&j~51G-m#>x`Gy8sWi8!I6J3e{{6UqzJm@JG7-Sl6GT
zKC$}XJ7^|OwTByMn>LKuk3YcA^uF)(zUlP7K(Amsiif`M@<r*%zzU_}7N3lQb8`OK
zll-i#S1l*l$1PaZd|t(;LTD9T$<0@T;&ngbCCg)xlHBol$@dnV#R!40Q{oGbi+Fy(
z&29>#Wtrs#TXN~4kIxPcKgH)qNA~fW?UZbWbSz%9l-xf$!WaCYVud`kQDLAgRVi?a
zvP@4pfb?dMPVz&KBRj8b+_{ZJk&RQSx{@|^CJ&g0c<A}j5kV=GvUZXY9$)6gI)-B&
zOnULWndR23y5coIIE&f|Z5>C+QXoSjhvP#``(x|Kt5y)!buRR<YE*Qc5*e{Fwvfm>
z3h}JnaE=1$)_3gz@4PCp9Ythi6B$r|Ku?x1XP-M^mKA(rh{NTa6o`dY+Q%_B5Cjrb
zXt^%OR#Jh?sFFO}<AE$j4l;|krEJ^S7@wS*eId_h<_@2jp5({#FY>XmF8!(e<ZQl>
z==C?n1N06-x?8+kdawNiS}OFtN<#gODBIyVsJ%(M-q8rvrTBaD?YLcv+t=eZu}j;O
zfs}!ifs}!ifs}!ifs}!ifs}!ifs}!ifs}#&4g))f1`Cw!&T)bJG0{24pi?DwGT=?4
zmqFn9ta<0SkV{U;mapSzN=pU?)hJY~IZn5Q`Ziq@alwq+?`|uW5xAG!ASyN@;DjZV
zxFfg7YFEW_JT^=R7aQ4ix>qAfI;0-R=o?0TSaG+;=8S_5-018BEtzQ<LfwsV|45ij
ywLFEo8y_{e<4+wrC&6W)zDJGkfXDmw95>WA&qe6D7>*1rw_sJP452qs#{LG_k|mY^

diff --git a/ps-lite/deps/bin/protoc b/ps-lite/deps/bin/protoc
deleted file mode 100755
index 9d70a91e5becdbb8201d2ae31f4fddb2a206976a..0000000000000000000000000000000000000000
GIT binary patch
literal 0
HcmV?d00001

literal 15580
zcmeHOeQX@X6<;SYID8rct=sZ(pcuJCiS4)qr;1c3&XEgAjER#fL_+KHd1D_v-<|Hx
z#IA&78eQe>WyKZYHk2Y6{%M2?N~>C;5?8q*Qlfs5QVLO<qNt^4jY1Wnwpe_*zu%kP
z_1^j;!Jxt)H`2_T-+MD}-n^Ne-J7|2>Akl<x>VDumTTI`GELJ~Ax>VRY59>`kkhm;
zAx02&y>s)n@c!`bd&n&hRpoGAL_G~?K-c$#_w6Y!BK1S%Jk7zdO{+$PNfLBDXAI>W
z020)fz80MU|F<hu8R8YQ#R*3IP}j4$!Je$g3hLW*gVL9AO1RjqP~+&EwU7Grej|}K
zSSP6On4|Bwqkx!x_re_e`eHHN7>XI`oSuvJ1oh=^RQ5gQ3<7bPK2NdA=z1)h%fyp?
z4nL@`=4Peuup=k-hoEj<A50#MCwujH@<0j&gZdtG^z}MQh=V%(`Z-Tp(HC9cx_QrL
zpCqL0(rO(ZumlHlo?s43BwyG2Qod=jpuQRwW(dvJCFFSWS#X1{Clh*hc%Ubh(9^lh
z9DOw*WuI#vG3{{!^<C!zP+d<%7t>c4Qu>ZKb%_1?*xxTWG7|btJ*PXjckBpn-R?eP
zO##0FGn~0XQR;D~jxcV;Iv_=m&^I-p(|myL&@`v2lxqUshaAVU4zUPK8;;)zj0g5|
z<U0`=ScZ}I^I7)$0kABDQ2(oC90jfd2_e$##=&f+F%j=+>>W<H^Xe<$(~jq^%-^@_
z(M?Z3yYG#+A8otq(beG9B5GG$Ch>L`lZViN{<0p|34dTaqllEzc1`1gvQlf@n>8}o
z#-VsLmF*uq7)|yy_NHQk14c5JZA>MN1BukZ##Gu!W>bTin9-O>^~JNfcudb2eHkO0
zji-`&I@_4eu1&;qMq{r5z^)*sGpSsvXYjzf)^+GuyhmF7tn7%DS)u&S@pt`Evy8K*
zYIZDO@VD1BdzRB~e|fFC1r^H6$JVUzYOs8(Pyez_uVU7fm+u<R=8S=LTf9b4{x(F8
z?<nRU=PTz9G3R3?R6J1eK*a+U4^%u*@j%4`6%SNAQ1QTL>w&!y^PiE2&$Z!q;EDVP
zAI{9s9J4fyT*RC>PhyoOKbV=ZU%(Hph&6E(c}QwLqU4Uf_?-Zx5fw_pG)r|v=0vS9
zCma+~%mzi86lo<naTk9eXrTPT04jSoP$vq^()jzL?g)t8M<dL95&0=8TquzrDNIPI
z!Wbp?Hk1;vDx*5!*lwReD=wd%v2S)uqo+kOUY{+IACm6oBQ(^iPU2@Ynr|a2Si&@|
zebSeFr!eyl>Q>BtMbe54k(_9Ay4&V-m;KP7P866gLH{VbWLhKa%OFaDHH5sfx=<2v
zVS?gFVT=-cuWPc?vwXL*dz39&)sy(K4J9K)1xuKwbwn9e6lUH*<BEAykz<NHPqLuh
zqCo6U(<0OAr$r^~WT44z<XyW(T$rF3c2i<MiBckV?6x=n5i1{2=AUH4R`un|{7It1
zm@v(;)5^9}!puA9tYX@VoL6L;WFhm%M1lDl?A}Mi%zUSiu?X#Z7jqG;Hssx2h`2C8
zF^r+aehsDky^se6^Gzm?HO8^n>GY`}t=KWQ2Id_5YX8W`V0qj0F{sBL@-f=TXrE=|
z8^C~_H8UVq_4{hhXha1|n5I=nWaevynRie~F&h+VQlyn+A%9t-K!&@OE-<Yoy5J93
zK%l(=dDl@QE=*7iM^R!whf;n=jj<yb?pkGjgbiEO+m!ijM0m=?C~KdPe5Ww;4(e9S
zenrxX43R8oz9^viV<8%5=Iex5wY0BB^`ZuOw-+KVOi+woP-5HI3Gw&B9c~!}%aYC%
zM7=%e7R5M|Z~xrKV0rr~ALBH&56v?2lWf%tkHRUt<ar8@L<+k`Bj&CnU>75WFzGnr
zQN&}2&o9{XUB!runkG7}>G#l99om8m&Li*kSHy)0iqT(6>}hNi`ujUZJ27fUm31d!
z-3yqDXnhjaorHC#kv|3NNY5hLi02Wf7q;${ST|;~T{C}Hh;^FHXVE-Zr;vAz6memK
zVi-w@-4!s>9Tah)Wr?i?QE#8c2BOkrmB_bmbnEh6N5&N{1CHP;5RUM@34e<EX8w1s
zJq5{{^7e!R8N^?*iNn}oGye$F$1%{R^<$({@6P3+&QZ>UAG&5uy*#(j)X{l(Jo^bY
zP(PQ41|n==gV%t(ajcRoG@&3@R-4N_ZsR-+zcsg!sreh0Nne5r{{$+@%>RkUePSMU
z-ShC~Z$gG}zo!iK@SUQ@ajVC@Msa1~tR<J5_3mh09xPU*yZ(j}ZZWBMnhZp3io4rv
zgT<afzMuyG;p6;{y8lIpL<9R()^DjWT+S_&#;N8T;BqWanAS<oXUstD>YKGr`!F&Q
zbH!@=A!Lg3y>{qaZNz+NI#PIO+U8MN<k0cj`(G^1)W3>aGxet>{fne$Bz;}dvy%Q@
z(l;c1Q&P4yQ~#Ev=Oq1?q~|4lN78>w`d>-89?aCghg8#cS~uQ@%;v6{`t6{_eln-t
z#1gD>XT03YUhbrq`<0jbg_nEA%Z+=vA9%ULUhX?yjtjnOE$QWYz1)5;$E9DDyUWXM
zLT=`XM-FMrzbpM2r~M4$h#L{Rc_Q-<M4mq72;N7;sh*NNf~m6!;BiW};h`aTmf#ZT
zYX|)`0avF6&_5H50C0a@B;R*{)Oi|!szuudEY8$+TMd%`0JMXConQ-Q*)5<Q1pNTi
zCX!(QDv&zo0I0xZvF~Aprh+F4_`yO2KO^`MfC@x%6%4!`K<eBBK#6EO1fZk0)=HcM
zoI^!Q#Ly2NAd*!OQzCv_?EsN90n|exVK2a~$cf}2z-^8IXABH-_!3*Itz8>Sr}fle
z&dsHB+BPF;WTH7E)V^j-sNab88ktZu*&9+vJnK;Mf#`!#spJ*C8yu%V=s-MSuvB_D
z*N@{LD)-8D3a`8*ExJLhQj|D^h|!h|&#Kyx<#`FuqZ!%|$>;em1{E$@j<Xu(v}NNf
zwW?$2GJ@)?rrj%Ok)#`XSa=fpNq^(eR~-7fLv4q?<IoQrdWloN)}dc^=xT?qb7;sZ
z-|FBk4&CX{Z#wh=hc04rMO5)X#RC-&R6J1eK*a+U4^%u*@j%4`6%SNAQ1L*;0}FWI
znp^9-xzluQo38Kg*wB|s^(Bl}_phj}vD82syBC@DP3@_H0c?8gj3<rl$()fn5RDnl
z>o+Ixf7i~$U|&3$4e#F3(Uoh__2%aFJ<%-w^Q!)7zCG5_)dFU$Kbp~VnP@zh-5v{v
z$=n!4{a7@Y%8(NdYxibC#U)vC=Wc_4v^6r$&PpotDVWpQ(bcRsx3s5vjaju_TXgMn
zWFyS^bj@tpJ(vu~J9l*Mh%K$3?ako_msWG@MbvD;{#^6=_H^1Ck&9_>Zmo-H>ucQC
zYi{9Q-p6WfzIqqa-UhWpxbb5(Hm8zm={k9g7J44%dmMvL;|3j<I^wx7Cc=O=QlsYl
zCs8=-g09>~JgNinBz9HRT+w4gQN0Jxa8k#55bKu-r1uRC>9|LeO(moFyZo^JV3Rh&
zlXnSK#p}_>z3TeOZX=67;cFwcFcZs8!boZ(qgBN=UJ;NhK6(#sso+YEzdqJIzn20l
z)CMT&%k{JWSeHhsin4@O>A1tNOxJ1$qVc5Gp)DKe$MqZ|HkdPT>xX;8+THuzb#M`l
zUEIxGuAN`4EnhL-3Oc@u|I;{!efOKHMzmUIUvvfb)UN{1z30PPS3~aZn>GlRe|X3~
z?Iyu$FPQtbTM$8^MTOl8Q;mezkV5X^VE{kA2@*fPKY+&q`1b+Ki)H@$cLeaa0{E!_
zekFh}g)g8FsS0}n`0)UKCV)!;{3nGy|NJ$8DZqJ!#&Z-NUT_;7{|=G+Ej)I(5|MXP
zu14f2@Z1kB(0HAM?^WJ)xgPP0h&%%1{Rsq~+kI+!LmJ=R&Xc*wl+*ROb5)mV9DIyE
z7vBO)G2;LG8SuHWaIueoB^c@d1Xx0Kc_A;Mp1dCxtvB~Ie&M#}*12#y^S!_?+|qot
zF5K3f_xFVxnp4GV<&(Ug%ii}KhEJl*wW$0}ujBe@;5`r4Ja2jT9X{vvO$`a$y2DpO
XB7wWW&PRl{t-alMOEzINVSW7{&=bbK

diff --git a/ps-lite/deps/include/google/protobuf/compiler/code_generator.h b/ps-lite/deps/include/google/protobuf/compiler/code_generator.h
deleted file mode 100644
index 252f68d1..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/code_generator.h
+++ /dev/null
@@ -1,142 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Defines the abstract interface implemented by each of the language-specific
-// code generators.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
-#define GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
-
-#include <google/protobuf/stubs/common.h>
-#include <string>
-#include <vector>
-#include <utility>
-
-namespace google {
-namespace protobuf {
-
-namespace io { class ZeroCopyOutputStream; }
-class FileDescriptor;
-
-namespace compiler {
-
-// Defined in this file.
-class CodeGenerator;
-class GeneratorContext;
-
-// The abstract interface to a class which generates code implementing a
-// particular proto file in a particular language.  A number of these may
-// be registered with CommandLineInterface to support various languages.
-class LIBPROTOC_EXPORT CodeGenerator {
- public:
-  inline CodeGenerator() {}
-  virtual ~CodeGenerator();
-
-  // Generates code for the given proto file, generating one or more files in
-  // the given output directory.
-  //
-  // A parameter to be passed to the generator can be specified on the
-  // command line.  This is intended to be used by Java and similar languages
-  // to specify which specific class from the proto file is to be generated,
-  // though it could have other uses as well.  It is empty if no parameter was
-  // given.
-  //
-  // Returns true if successful.  Otherwise, sets *error to a description of
-  // the problem (e.g. "invalid parameter") and returns false.
-  virtual bool Generate(const FileDescriptor* file,
-                        const string& parameter,
-                        GeneratorContext* generator_context,
-                        string* error) const = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodeGenerator);
-};
-
-// CodeGenerators generate one or more files in a given directory.  This
-// abstract interface represents the directory to which the CodeGenerator is
-// to write and other information about the context in which the Generator
-// runs.
-class LIBPROTOC_EXPORT GeneratorContext {
- public:
-  inline GeneratorContext() {}
-  virtual ~GeneratorContext();
-
-  // Opens the given file, truncating it if it exists, and returns a
-  // ZeroCopyOutputStream that writes to the file.  The caller takes ownership
-  // of the returned object.  This method never fails (a dummy stream will be
-  // returned instead).
-  //
-  // The filename given should be relative to the root of the source tree.
-  // E.g. the C++ generator, when generating code for "foo/bar.proto", will
-  // generate the files "foo/bar.pb.h" and "foo/bar.pb.cc"; note that
-  // "foo/" is included in these filenames.  The filename is not allowed to
-  // contain "." or ".." components.
-  virtual io::ZeroCopyOutputStream* Open(const string& filename) = 0;
-
-  // Creates a ZeroCopyOutputStream which will insert code into the given file
-  // at the given insertion point.  See plugin.proto (plugin.pb.h) for more
-  // information on insertion points.  The default implementation
-  // assert-fails -- it exists only for backwards-compatibility.
-  //
-  // WARNING:  This feature is currently EXPERIMENTAL and is subject to change.
-  virtual io::ZeroCopyOutputStream* OpenForInsert(
-      const string& filename, const string& insertion_point);
-
-  // Returns a vector of FileDescriptors for all the files being compiled
-  // in this run.  Useful for languages, such as Go, that treat files
-  // differently when compiled as a set rather than individually.
-  virtual void ListParsedFiles(vector<const FileDescriptor*>* output);
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GeneratorContext);
-};
-
-// The type GeneratorContext was once called OutputDirectory. This typedef
-// provides backward compatibility.
-typedef GeneratorContext OutputDirectory;
-
-// Several code generators treat the parameter argument as holding a
-// list of options separated by commas.  This helper function parses
-// a set of comma-delimited name/value pairs: e.g.,
-//   "foo=bar,baz,qux=corge"
-// parses to the pairs:
-//   ("foo", "bar"), ("baz", ""), ("qux", "corge")
-extern void ParseGeneratorParameter(const string&,
-            vector<pair<string, string> >*);
-
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h b/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
deleted file mode 100644
index 86ea9bde..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/command_line_interface.h
+++ /dev/null
@@ -1,353 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Implements the Protocol Compiler front-end such that it may be reused by
-// custom compilers written to support other languages.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
-#define GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
-
-#include <google/protobuf/stubs/common.h>
-#include <string>
-#include <vector>
-#include <map>
-#include <set>
-#include <utility>
-
-namespace google {
-namespace protobuf {
-
-class FileDescriptor;        // descriptor.h
-class DescriptorPool;        // descriptor.h
-class FileDescriptorProto;   // descriptor.pb.h
-template<typename T> class RepeatedPtrField;  // repeated_field.h
-
-namespace compiler {
-
-class CodeGenerator;        // code_generator.h
-class GeneratorContext;      // code_generator.h
-class DiskSourceTree;       // importer.h
-
-// This class implements the command-line interface to the protocol compiler.
-// It is designed to make it very easy to create a custom protocol compiler
-// supporting the languages of your choice.  For example, if you wanted to
-// create a custom protocol compiler binary which includes both the regular
-// C++ support plus support for your own custom output "Foo", you would
-// write a class "FooGenerator" which implements the CodeGenerator interface,
-// then write a main() procedure like this:
-//
-//   int main(int argc, char* argv[]) {
-//     google::protobuf::compiler::CommandLineInterface cli;
-//
-//     // Support generation of C++ source and headers.
-//     google::protobuf::compiler::cpp::CppGenerator cpp_generator;
-//     cli.RegisterGenerator("--cpp_out", &cpp_generator,
-//       "Generate C++ source and header.");
-//
-//     // Support generation of Foo code.
-//     FooGenerator foo_generator;
-//     cli.RegisterGenerator("--foo_out", &foo_generator,
-//       "Generate Foo file.");
-//
-//     return cli.Run(argc, argv);
-//   }
-//
-// The compiler is invoked with syntax like:
-//   protoc --cpp_out=outdir --foo_out=outdir --proto_path=src src/foo.proto
-//
-// For a full description of the command-line syntax, invoke it with --help.
-class LIBPROTOC_EXPORT CommandLineInterface {
- public:
-  CommandLineInterface();
-  ~CommandLineInterface();
-
-  // Register a code generator for a language.
-  //
-  // Parameters:
-  // * flag_name: The command-line flag used to specify an output file of
-  //   this type.  The name must start with a '-'.  If the name is longer
-  //   than one letter, it must start with two '-'s.
-  // * generator: The CodeGenerator which will be called to generate files
-  //   of this type.
-  // * help_text: Text describing this flag in the --help output.
-  //
-  // Some generators accept extra parameters.  You can specify this parameter
-  // on the command-line by placing it before the output directory, separated
-  // by a colon:
-  //   protoc --foo_out=enable_bar:outdir
-  // The text before the colon is passed to CodeGenerator::Generate() as the
-  // "parameter".
-  void RegisterGenerator(const string& flag_name,
-                         CodeGenerator* generator,
-                         const string& help_text);
-
-  // Register a code generator for a language.
-  // Besides flag_name you can specify another option_flag_name that could be
-  // used to pass extra parameters to the registered code generator.
-  // Suppose you have registered a generator by calling:
-  //   command_line_interface.RegisterGenerator("--foo_out", "--foo_opt", ...)
-  // Then you could invoke the compiler with a command like:
-  //   protoc --foo_out=enable_bar:outdir --foo_opt=enable_baz
-  // This will pass "enable_bar,enable_baz" as the parameter to the generator.
-  void RegisterGenerator(const string& flag_name,
-                         const string& option_flag_name,
-                         CodeGenerator* generator,
-                         const string& help_text);
-
-  // Enables "plugins".  In this mode, if a command-line flag ends with "_out"
-  // but does not match any registered generator, the compiler will attempt to
-  // find a "plugin" to implement the generator.  Plugins are just executables.
-  // They should live somewhere in the PATH.
-  //
-  // The compiler determines the executable name to search for by concatenating
-  // exe_name_prefix with the unrecognized flag name, removing "_out".  So, for
-  // example, if exe_name_prefix is "protoc-" and you pass the flag --foo_out,
-  // the compiler will try to run the program "protoc-foo".
-  //
-  // The plugin program should implement the following usage:
-  //   plugin [--out=OUTDIR] [--parameter=PARAMETER] PROTO_FILES < DESCRIPTORS
-  // --out indicates the output directory (as passed to the --foo_out
-  // parameter); if omitted, the current directory should be used.  --parameter
-  // gives the generator parameter, if any was provided.  The PROTO_FILES list
-  // the .proto files which were given on the compiler command-line; these are
-  // the files for which the plugin is expected to generate output code.
-  // Finally, DESCRIPTORS is an encoded FileDescriptorSet (as defined in
-  // descriptor.proto).  This is piped to the plugin's stdin.  The set will
-  // include descriptors for all the files listed in PROTO_FILES as well as
-  // all files that they import.  The plugin MUST NOT attempt to read the
-  // PROTO_FILES directly -- it must use the FileDescriptorSet.
-  //
-  // The plugin should generate whatever files are necessary, as code generators
-  // normally do.  It should write the names of all files it generates to
-  // stdout.  The names should be relative to the output directory, NOT absolute
-  // names or relative to the current directory.  If any errors occur, error
-  // messages should be written to stderr.  If an error is fatal, the plugin
-  // should exit with a non-zero exit code.
-  void AllowPlugins(const string& exe_name_prefix);
-
-  // Run the Protocol Compiler with the given command-line parameters.
-  // Returns the error code which should be returned by main().
-  //
-  // It may not be safe to call Run() in a multi-threaded environment because
-  // it calls strerror().  I'm not sure why you'd want to do this anyway.
-  int Run(int argc, const char* const argv[]);
-
-  // Call SetInputsAreCwdRelative(true) if the input files given on the command
-  // line should be interpreted relative to the proto import path specified
-  // using --proto_path or -I flags.  Otherwise, input file names will be
-  // interpreted relative to the current working directory (or as absolute
-  // paths if they start with '/'), though they must still reside inside
-  // a directory given by --proto_path or the compiler will fail.  The latter
-  // mode is generally more intuitive and easier to use, especially e.g. when
-  // defining implicit rules in Makefiles.
-  void SetInputsAreProtoPathRelative(bool enable) {
-    inputs_are_proto_path_relative_ = enable;
-  }
-
-  // Provides some text which will be printed when the --version flag is
-  // used.  The version of libprotoc will also be printed on the next line
-  // after this text.
-  void SetVersionInfo(const string& text) {
-    version_info_ = text;
-  }
-
-
- private:
-  // -----------------------------------------------------------------
-
-  class ErrorPrinter;
-  class GeneratorContextImpl;
-  class MemoryOutputStream;
-
-  // Clear state from previous Run().
-  void Clear();
-
-  // Remaps each file in input_files_ so that it is relative to one of the
-  // directories in proto_path_.  Returns false if an error occurred.  This
-  // is only used if inputs_are_proto_path_relative_ is false.
-  bool MakeInputsBeProtoPathRelative(
-    DiskSourceTree* source_tree);
-
-  // Return status for ParseArguments() and InterpretArgument().
-  enum ParseArgumentStatus {
-    PARSE_ARGUMENT_DONE_AND_CONTINUE,
-    PARSE_ARGUMENT_DONE_AND_EXIT,
-    PARSE_ARGUMENT_FAIL
-  };
-
-  // Parse all command-line arguments.
-  ParseArgumentStatus ParseArguments(int argc, const char* const argv[]);
-
-  // Parses a command-line argument into a name/value pair.  Returns
-  // true if the next argument in the argv should be used as the value,
-  // false otherwise.
-  //
-  // Exmaples:
-  //   "-Isrc/protos" ->
-  //     name = "-I", value = "src/protos"
-  //   "--cpp_out=src/foo.pb2.cc" ->
-  //     name = "--cpp_out", value = "src/foo.pb2.cc"
-  //   "foo.proto" ->
-  //     name = "", value = "foo.proto"
-  bool ParseArgument(const char* arg, string* name, string* value);
-
-  // Interprets arguments parsed with ParseArgument.
-  ParseArgumentStatus InterpretArgument(const string& name,
-                                        const string& value);
-
-  // Print the --help text to stderr.
-  void PrintHelpText();
-
-  // Generate the given output file from the given input.
-  struct OutputDirective;  // see below
-  bool GenerateOutput(const vector<const FileDescriptor*>& parsed_files,
-                      const OutputDirective& output_directive,
-                      GeneratorContext* generator_context);
-  bool GeneratePluginOutput(const vector<const FileDescriptor*>& parsed_files,
-                            const string& plugin_name,
-                            const string& parameter,
-                            GeneratorContext* generator_context,
-                            string* error);
-
-  // Implements --encode and --decode.
-  bool EncodeOrDecode(const DescriptorPool* pool);
-
-  // Implements the --descriptor_set_out option.
-  bool WriteDescriptorSet(const vector<const FileDescriptor*> parsed_files);
-
-  // Get all transitive dependencies of the given file (including the file
-  // itself), adding them to the given list of FileDescriptorProtos.  The
-  // protos will be ordered such that every file is listed before any file that
-  // depends on it, so that you can call DescriptorPool::BuildFile() on them
-  // in order.  Any files in *already_seen will not be added, and each file
-  // added will be inserted into *already_seen.  If include_source_code_info is
-  // true then include the source code information in the FileDescriptorProtos.
-  static void GetTransitiveDependencies(
-      const FileDescriptor* file,
-      bool include_source_code_info,
-      set<const FileDescriptor*>* already_seen,
-      RepeatedPtrField<FileDescriptorProto>* output);
-
-  // -----------------------------------------------------------------
-
-  // The name of the executable as invoked (i.e. argv[0]).
-  string executable_name_;
-
-  // Version info set with SetVersionInfo().
-  string version_info_;
-
-  // Registered generators.
-  struct GeneratorInfo {
-    string flag_name;
-    string option_flag_name;
-    CodeGenerator* generator;
-    string help_text;
-  };
-  typedef map<string, GeneratorInfo> GeneratorMap;
-  GeneratorMap generators_by_flag_name_;
-  GeneratorMap generators_by_option_name_;
-  // A map from generator names to the parameters specified using the option
-  // flag. For example, if the user invokes the compiler with:
-  //   protoc --foo_out=outputdir --foo_opt=enable_bar ...
-  // Then there will be an entry ("--foo_out", "enable_bar") in this map.
-  map<string, string> generator_parameters_;
-
-  // See AllowPlugins().  If this is empty, plugins aren't allowed.
-  string plugin_prefix_;
-
-  // Maps specific plugin names to files.  When executing a plugin, this map
-  // is searched first to find the plugin executable.  If not found here, the
-  // PATH (or other OS-specific search strategy) is searched.
-  map<string, string> plugins_;
-
-  // Stuff parsed from command line.
-  enum Mode {
-    MODE_COMPILE,  // Normal mode:  parse .proto files and compile them.
-    MODE_ENCODE,   // --encode:  read text from stdin, write binary to stdout.
-    MODE_DECODE    // --decode:  read binary from stdin, write text to stdout.
-  };
-
-  Mode mode_;
-
-  enum ErrorFormat {
-    ERROR_FORMAT_GCC,   // GCC error output format (default).
-    ERROR_FORMAT_MSVS   // Visual Studio output (--error_format=msvs).
-  };
-
-  ErrorFormat error_format_;
-
-  vector<pair<string, string> > proto_path_;  // Search path for proto files.
-  vector<string> input_files_;                // Names of the input proto files.
-
-  // output_directives_ lists all the files we are supposed to output and what
-  // generator to use for each.
-  struct OutputDirective {
-    string name;                // E.g. "--foo_out"
-    CodeGenerator* generator;   // NULL for plugins
-    string parameter;
-    string output_location;
-  };
-  vector<OutputDirective> output_directives_;
-
-  // When using --encode or --decode, this names the type we are encoding or
-  // decoding.  (Empty string indicates --decode_raw.)
-  string codec_type_;
-
-  // If --descriptor_set_out was given, this is the filename to which the
-  // FileDescriptorSet should be written.  Otherwise, empty.
-  string descriptor_set_name_;
-
-  // True if --include_imports was given, meaning that we should
-  // write all transitive dependencies to the DescriptorSet.  Otherwise, only
-  // the .proto files listed on the command-line are added.
-  bool imports_in_descriptor_set_;
-
-  // True if --include_source_info was given, meaning that we should not strip
-  // SourceCodeInfo from the DescriptorSet.
-  bool source_info_in_descriptor_set_;
-
-  // Was the --disallow_services flag used?
-  bool disallow_services_;
-
-  // See SetInputsAreProtoPathRelative().
-  bool inputs_are_proto_path_relative_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CommandLineInterface);
-};
-
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h b/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
deleted file mode 100644
index a90e84d7..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/cpp/cpp_generator.h
+++ /dev/null
@@ -1,72 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Generates C++ code for a given .proto file.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
-#define GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
-
-#include <string>
-#include <google/protobuf/compiler/code_generator.h>
-
-namespace google {
-namespace protobuf {
-namespace compiler {
-namespace cpp {
-
-// CodeGenerator implementation which generates a C++ source file and
-// header.  If you create your own protocol compiler binary and you want
-// it to support C++ output, you can do so by registering an instance of this
-// CodeGenerator with the CommandLineInterface in your main() function.
-class LIBPROTOC_EXPORT CppGenerator : public CodeGenerator {
- public:
-  CppGenerator();
-  ~CppGenerator();
-
-  // implements CodeGenerator ----------------------------------------
-  bool Generate(const FileDescriptor* file,
-                const string& parameter,
-                GeneratorContext* generator_context,
-                string* error) const;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CppGenerator);
-};
-
-}  // namespace cpp
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/importer.h b/ps-lite/deps/include/google/protobuf/compiler/importer.h
deleted file mode 100644
index 7a62fa0e..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/importer.h
+++ /dev/null
@@ -1,304 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file is the public interface to the .proto file parser.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
-#define GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
-
-#include <string>
-#include <vector>
-#include <set>
-#include <utility>
-#include <google/protobuf/descriptor.h>
-#include <google/protobuf/descriptor_database.h>
-#include <google/protobuf/compiler/parser.h>
-
-namespace google {
-namespace protobuf {
-
-namespace io { class ZeroCopyInputStream; }
-
-namespace compiler {
-
-// Defined in this file.
-class Importer;
-class MultiFileErrorCollector;
-class SourceTree;
-class DiskSourceTree;
-
-// TODO(kenton):  Move all SourceTree stuff to a separate file?
-
-// An implementation of DescriptorDatabase which loads files from a SourceTree
-// and parses them.
-//
-// Note:  This class is not thread-safe since it maintains a table of source
-//   code locations for error reporting.  However, when a DescriptorPool wraps
-//   a DescriptorDatabase, it uses mutex locking to make sure only one method
-//   of the database is called at a time, even if the DescriptorPool is used
-//   from multiple threads.  Therefore, there is only a problem if you create
-//   multiple DescriptorPools wrapping the same SourceTreeDescriptorDatabase
-//   and use them from multiple threads.
-//
-// Note:  This class does not implement FindFileContainingSymbol() or
-//   FindFileContainingExtension(); these will always return false.
-class LIBPROTOBUF_EXPORT SourceTreeDescriptorDatabase : public DescriptorDatabase {
- public:
-  SourceTreeDescriptorDatabase(SourceTree* source_tree);
-  ~SourceTreeDescriptorDatabase();
-
-  // Instructs the SourceTreeDescriptorDatabase to report any parse errors
-  // to the given MultiFileErrorCollector.  This should be called before
-  // parsing.  error_collector must remain valid until either this method
-  // is called again or the SourceTreeDescriptorDatabase is destroyed.
-  void RecordErrorsTo(MultiFileErrorCollector* error_collector) {
-    error_collector_ = error_collector;
-  }
-
-  // Gets a DescriptorPool::ErrorCollector which records errors to the
-  // MultiFileErrorCollector specified with RecordErrorsTo().  This collector
-  // has the ability to determine exact line and column numbers of errors
-  // from the information given to it by the DescriptorPool.
-  DescriptorPool::ErrorCollector* GetValidationErrorCollector() {
-    using_validation_error_collector_ = true;
-    return &validation_error_collector_;
-  }
-
-  // implements DescriptorDatabase -----------------------------------
-  bool FindFileByName(const string& filename, FileDescriptorProto* output);
-  bool FindFileContainingSymbol(const string& symbol_name,
-                                FileDescriptorProto* output);
-  bool FindFileContainingExtension(const string& containing_type,
-                                   int field_number,
-                                   FileDescriptorProto* output);
-
- private:
-  class SingleFileErrorCollector;
-
-  SourceTree* source_tree_;
-  MultiFileErrorCollector* error_collector_;
-
-  class LIBPROTOBUF_EXPORT ValidationErrorCollector : public DescriptorPool::ErrorCollector {
-   public:
-    ValidationErrorCollector(SourceTreeDescriptorDatabase* owner);
-    ~ValidationErrorCollector();
-
-    // implements ErrorCollector ---------------------------------------
-    void AddError(const string& filename,
-                  const string& element_name,
-                  const Message* descriptor,
-                  ErrorLocation location,
-                  const string& message);
-
-   private:
-    SourceTreeDescriptorDatabase* owner_;
-  };
-  friend class ValidationErrorCollector;
-
-  bool using_validation_error_collector_;
-  SourceLocationTable source_locations_;
-  ValidationErrorCollector validation_error_collector_;
-};
-
-// Simple interface for parsing .proto files.  This wraps the process
-// of opening the file, parsing it with a Parser, recursively parsing all its
-// imports, and then cross-linking the results to produce a FileDescriptor.
-//
-// This is really just a thin wrapper around SourceTreeDescriptorDatabase.
-// You may find that SourceTreeDescriptorDatabase is more flexible.
-//
-// TODO(kenton):  I feel like this class is not well-named.
-class LIBPROTOBUF_EXPORT Importer {
- public:
-  Importer(SourceTree* source_tree,
-           MultiFileErrorCollector* error_collector);
-  ~Importer();
-
-  // Import the given file and build a FileDescriptor representing it.  If
-  // the file is already in the DescriptorPool, the existing FileDescriptor
-  // will be returned.  The FileDescriptor is property of the DescriptorPool,
-  // and will remain valid until it is destroyed.  If any errors occur, they
-  // will be reported using the error collector and Import() will return NULL.
-  //
-  // A particular Importer object will only report errors for a particular
-  // file once.  All future attempts to import the same file will return NULL
-  // without reporting any errors.  The idea is that you might want to import
-  // a lot of files without seeing the same errors over and over again.  If
-  // you want to see errors for the same files repeatedly, you can use a
-  // separate Importer object to import each one (but use the same
-  // DescriptorPool so that they can be cross-linked).
-  const FileDescriptor* Import(const string& filename);
-
-  // The DescriptorPool in which all imported FileDescriptors and their
-  // contents are stored.
-  inline const DescriptorPool* pool() const {
-    return &pool_;
-  }
-
- private:
-  SourceTreeDescriptorDatabase database_;
-  DescriptorPool pool_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Importer);
-};
-
-// If the importer encounters problems while trying to import the proto files,
-// it reports them to a MultiFileErrorCollector.
-class LIBPROTOBUF_EXPORT MultiFileErrorCollector {
- public:
-  inline MultiFileErrorCollector() {}
-  virtual ~MultiFileErrorCollector();
-
-  // Line and column numbers are zero-based.  A line number of -1 indicates
-  // an error with the entire file (e.g. "not found").
-  virtual void AddError(const string& filename, int line, int column,
-                        const string& message) = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MultiFileErrorCollector);
-};
-
-// Abstract interface which represents a directory tree containing proto files.
-// Used by the default implementation of Importer to resolve import statements
-// Most users will probably want to use the DiskSourceTree implementation,
-// below.
-class LIBPROTOBUF_EXPORT SourceTree {
- public:
-  inline SourceTree() {}
-  virtual ~SourceTree();
-
-  // Open the given file and return a stream that reads it, or NULL if not
-  // found.  The caller takes ownership of the returned object.  The filename
-  // must be a path relative to the root of the source tree and must not
-  // contain "." or ".." components.
-  virtual io::ZeroCopyInputStream* Open(const string& filename) = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(SourceTree);
-};
-
-// An implementation of SourceTree which loads files from locations on disk.
-// Multiple mappings can be set up to map locations in the DiskSourceTree to
-// locations in the physical filesystem.
-class LIBPROTOBUF_EXPORT DiskSourceTree : public SourceTree {
- public:
-  DiskSourceTree();
-  ~DiskSourceTree();
-
-  // Map a path on disk to a location in the SourceTree.  The path may be
-  // either a file or a directory.  If it is a directory, the entire tree
-  // under it will be mapped to the given virtual location.  To map a directory
-  // to the root of the source tree, pass an empty string for virtual_path.
-  //
-  // If multiple mapped paths apply when opening a file, they will be searched
-  // in order.  For example, if you do:
-  //   MapPath("bar", "foo/bar");
-  //   MapPath("", "baz");
-  // and then you do:
-  //   Open("bar/qux");
-  // the DiskSourceTree will first try to open foo/bar/qux, then baz/bar/qux,
-  // returning the first one that opens successfuly.
-  //
-  // disk_path may be an absolute path or relative to the current directory,
-  // just like a path you'd pass to open().
-  void MapPath(const string& virtual_path, const string& disk_path);
-
-  // Return type for DiskFileToVirtualFile().
-  enum DiskFileToVirtualFileResult {
-    SUCCESS,
-    SHADOWED,
-    CANNOT_OPEN,
-    NO_MAPPING
-  };
-
-  // Given a path to a file on disk, find a virtual path mapping to that
-  // file.  The first mapping created with MapPath() whose disk_path contains
-  // the filename is used.  However, that virtual path may not actually be
-  // usable to open the given file.  Possible return values are:
-  // * SUCCESS: The mapping was found.  *virtual_file is filled in so that
-  //   calling Open(*virtual_file) will open the file named by disk_file.
-  // * SHADOWED: A mapping was found, but using Open() to open this virtual
-  //   path will end up returning some different file.  This is because some
-  //   other mapping with a higher precedence also matches this virtual path
-  //   and maps it to a different file that exists on disk.  *virtual_file
-  //   is filled in as it would be in the SUCCESS case.  *shadowing_disk_file
-  //   is filled in with the disk path of the file which would be opened if
-  //   you were to call Open(*virtual_file).
-  // * CANNOT_OPEN: The mapping was found and was not shadowed, but the
-  //   file specified cannot be opened.  When this value is returned,
-  //   errno will indicate the reason the file cannot be opened.  *virtual_file
-  //   will be set to the virtual path as in the SUCCESS case, even though
-  //   it is not useful.
-  // * NO_MAPPING: Indicates that no mapping was found which contains this
-  //   file.
-  DiskFileToVirtualFileResult
-    DiskFileToVirtualFile(const string& disk_file,
-                          string* virtual_file,
-                          string* shadowing_disk_file);
-
-  // Given a virtual path, find the path to the file on disk.
-  // Return true and update disk_file with the on-disk path if the file exists.
-  // Return false and leave disk_file untouched if the file doesn't exist.
-  bool VirtualFileToDiskFile(const string& virtual_file, string* disk_file);
-
-  // implements SourceTree -------------------------------------------
-  io::ZeroCopyInputStream* Open(const string& filename);
-
- private:
-  struct Mapping {
-    string virtual_path;
-    string disk_path;
-
-    inline Mapping(const string& virtual_path_param,
-                   const string& disk_path_param)
-      : virtual_path(virtual_path_param), disk_path(disk_path_param) {}
-  };
-  vector<Mapping> mappings_;
-
-  // Like Open(), but returns the on-disk path in disk_file if disk_file is
-  // non-NULL and the file could be successfully opened.
-  io::ZeroCopyInputStream* OpenVirtualFile(const string& virtual_file,
-                                           string* disk_file);
-
-  // Like Open() but given the actual on-disk path.
-  io::ZeroCopyInputStream* OpenDiskFile(const string& filename);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DiskSourceTree);
-};
-
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h b/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
deleted file mode 100644
index 888b8d85..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/java/java_generator.h
+++ /dev/null
@@ -1,72 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Generates Java code for a given .proto file.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
-#define GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
-
-#include <string>
-#include <google/protobuf/compiler/code_generator.h>
-
-namespace google {
-namespace protobuf {
-namespace compiler {
-namespace java {
-
-// CodeGenerator implementation which generates Java code.  If you create your
-// own protocol compiler binary and you want it to support Java output, you
-// can do so by registering an instance of this CodeGenerator with the
-// CommandLineInterface in your main() function.
-class LIBPROTOC_EXPORT JavaGenerator : public CodeGenerator {
- public:
-  JavaGenerator();
-  ~JavaGenerator();
-
-  // implements CodeGenerator ----------------------------------------
-  bool Generate(const FileDescriptor* file,
-                const string& parameter,
-                GeneratorContext* context,
-                string* error) const;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(JavaGenerator);
-};
-
-}  // namespace java
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/parser.h b/ps-lite/deps/include/google/protobuf/compiler/parser.h
deleted file mode 100644
index cfd3649b..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/parser.h
+++ /dev/null
@@ -1,477 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Implements parsing of .proto files to FileDescriptorProtos.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_PARSER_H__
-#define GOOGLE_PROTOBUF_COMPILER_PARSER_H__
-
-#include <map>
-#include <string>
-#include <utility>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/descriptor.h>
-#include <google/protobuf/descriptor.pb.h>
-#include <google/protobuf/repeated_field.h>
-#include <google/protobuf/io/tokenizer.h>
-
-namespace google {
-namespace protobuf { class Message; }
-
-namespace protobuf {
-namespace compiler {
-
-// Defined in this file.
-class Parser;
-class SourceLocationTable;
-
-// Implements parsing of protocol definitions (such as .proto files).
-//
-// Note that most users will be more interested in the Importer class.
-// Parser is a lower-level class which simply converts a single .proto file
-// to a FileDescriptorProto.  It does not resolve import directives or perform
-// many other kinds of validation needed to construct a complete
-// FileDescriptor.
-class LIBPROTOBUF_EXPORT Parser {
- public:
-  Parser();
-  ~Parser();
-
-  // Parse the entire input and construct a FileDescriptorProto representing
-  // it.  Returns true if no errors occurred, false otherwise.
-  bool Parse(io::Tokenizer* input, FileDescriptorProto* file);
-
-  // Optional fetaures:
-
-  // DEPRECATED:  New code should use the SourceCodeInfo embedded in the
-  //   FileDescriptorProto.
-  //
-  // Requests that locations of certain definitions be recorded to the given
-  // SourceLocationTable while parsing.  This can be used to look up exact line
-  // and column numbers for errors reported by DescriptorPool during validation.
-  // Set to NULL (the default) to discard source location information.
-  void RecordSourceLocationsTo(SourceLocationTable* location_table) {
-    source_location_table_ = location_table;
-  }
-
-  // Requests that errors be recorded to the given ErrorCollector while
-  // parsing.  Set to NULL (the default) to discard error messages.
-  void RecordErrorsTo(io::ErrorCollector* error_collector) {
-    error_collector_ = error_collector;
-  }
-
-  // Returns the identifier used in the "syntax = " declaration, if one was
-  // seen during the last call to Parse(), or the empty string otherwise.
-  const string& GetSyntaxIdentifier() { return syntax_identifier_; }
-
-  // If set true, input files will be required to begin with a syntax
-  // identifier.  Otherwise, files may omit this.  If a syntax identifier
-  // is provided, it must be 'syntax = "proto2";' and must appear at the
-  // top of this file regardless of whether or not it was required.
-  void SetRequireSyntaxIdentifier(bool value) {
-    require_syntax_identifier_ = value;
-  }
-
-  // Call SetStopAfterSyntaxIdentifier(true) to tell the parser to stop
-  // parsing as soon as it has seen the syntax identifier, or lack thereof.
-  // This is useful for quickly identifying the syntax of the file without
-  // parsing the whole thing.  If this is enabled, no error will be recorded
-  // if the syntax identifier is something other than "proto2" (since
-  // presumably the caller intends to deal with that), but other kinds of
-  // errors (e.g. parse errors) will still be reported.  When this is enabled,
-  // you may pass a NULL FileDescriptorProto to Parse().
-  void SetStopAfterSyntaxIdentifier(bool value) {
-    stop_after_syntax_identifier_ = value;
-  }
-
- private:
-  class LocationRecorder;
-
-  // =================================================================
-  // Error recovery helpers
-
-  // Consume the rest of the current statement.  This consumes tokens
-  // until it sees one of:
-  //   ';'  Consumes the token and returns.
-  //   '{'  Consumes the brace then calls SkipRestOfBlock().
-  //   '}'  Returns without consuming.
-  //   EOF  Returns (can't consume).
-  // The Parser often calls SkipStatement() after encountering a syntax
-  // error.  This allows it to go on parsing the following lines, allowing
-  // it to report more than just one error in the file.
-  void SkipStatement();
-
-  // Consume the rest of the current block, including nested blocks,
-  // ending after the closing '}' is encountered and consumed, or at EOF.
-  void SkipRestOfBlock();
-
-  // -----------------------------------------------------------------
-  // Single-token consuming helpers
-  //
-  // These make parsing code more readable.
-
-  // True if the current token is TYPE_END.
-  inline bool AtEnd();
-
-  // True if the next token matches the given text.
-  inline bool LookingAt(const char* text);
-  // True if the next token is of the given type.
-  inline bool LookingAtType(io::Tokenizer::TokenType token_type);
-
-  // If the next token exactly matches the text given, consume it and return
-  // true.  Otherwise, return false without logging an error.
-  bool TryConsume(const char* text);
-
-  // These attempt to read some kind of token from the input.  If successful,
-  // they return true.  Otherwise they return false and add the given error
-  // to the error list.
-
-  // Consume a token with the exact text given.
-  bool Consume(const char* text, const char* error);
-  // Same as above, but automatically generates the error "Expected \"text\".",
-  // where "text" is the expected token text.
-  bool Consume(const char* text);
-  // Consume a token of type IDENTIFIER and store its text in "output".
-  bool ConsumeIdentifier(string* output, const char* error);
-  // Consume an integer and store its value in "output".
-  bool ConsumeInteger(int* output, const char* error);
-  // Consume a signed integer and store its value in "output".
-  bool ConsumeSignedInteger(int* output, const char* error);
-  // Consume a 64-bit integer and store its value in "output".  If the value
-  // is greater than max_value, an error will be reported.
-  bool ConsumeInteger64(uint64 max_value, uint64* output, const char* error);
-  // Consume a number and store its value in "output".  This will accept
-  // tokens of either INTEGER or FLOAT type.
-  bool ConsumeNumber(double* output, const char* error);
-  // Consume a string literal and store its (unescaped) value in "output".
-  bool ConsumeString(string* output, const char* error);
-
-  // Consume a token representing the end of the statement.  Comments between
-  // this token and the next will be harvested for documentation.  The given
-  // LocationRecorder should refer to the declaration that was just parsed;
-  // it will be populated with these comments.
-  //
-  // TODO(kenton):  The LocationRecorder is const because historically locations
-  //   have been passed around by const reference, for no particularly good
-  //   reason.  We should probably go through and change them all to mutable
-  //   pointer to make this more intuitive.
-  bool TryConsumeEndOfDeclaration(const char* text,
-                                  const LocationRecorder* location);
-  bool ConsumeEndOfDeclaration(const char* text,
-                               const LocationRecorder* location);
-
-  // -----------------------------------------------------------------
-  // Error logging helpers
-
-  // Invokes error_collector_->AddError(), if error_collector_ is not NULL.
-  void AddError(int line, int column, const string& error);
-
-  // Invokes error_collector_->AddError() with the line and column number
-  // of the current token.
-  void AddError(const string& error);
-
-  // Records a location in the SourceCodeInfo.location table (see
-  // descriptor.proto).  We use RAII to ensure that the start and end locations
-  // are recorded -- the constructor records the start location and the
-  // destructor records the end location.  Since the parser is
-  // recursive-descent, this works out beautifully.
-  class LIBPROTOBUF_EXPORT LocationRecorder {
-   public:
-    // Construct the file's "root" location.
-    LocationRecorder(Parser* parser);
-
-    // Construct a location that represents a declaration nested within the
-    // given parent.  E.g. a field's location is nested within the location
-    // for a message type.  The parent's path will be copied, so you should
-    // call AddPath() only to add the path components leading from the parent
-    // to the child (as opposed to leading from the root to the child).
-    LocationRecorder(const LocationRecorder& parent);
-
-    // Convenience constructors that call AddPath() one or two times.
-    LocationRecorder(const LocationRecorder& parent, int path1);
-    LocationRecorder(const LocationRecorder& parent, int path1, int path2);
-
-    ~LocationRecorder();
-
-    // Add a path component.  See SourceCodeInfo.Location.path in
-    // descriptor.proto.
-    void AddPath(int path_component);
-
-    // By default the location is considered to start at the current token at
-    // the time the LocationRecorder is created.  StartAt() sets the start
-    // location to the given token instead.
-    void StartAt(const io::Tokenizer::Token& token);
-
-    // By default the location is considered to end at the previous token at
-    // the time the LocationRecorder is destroyed.  EndAt() sets the end
-    // location to the given token instead.
-    void EndAt(const io::Tokenizer::Token& token);
-
-    // Records the start point of this location to the SourceLocationTable that
-    // was passed to RecordSourceLocationsTo(), if any.  SourceLocationTable
-    // is an older way of keeping track of source locations which is still
-    // used in some places.
-    void RecordLegacyLocation(const Message* descriptor,
-        DescriptorPool::ErrorCollector::ErrorLocation location);
-
-    // Attaches leading and trailing comments to the location.  The two strings
-    // will be swapped into place, so after this is called *leading and
-    // *trailing will be empty.
-    //
-    // TODO(kenton):  See comment on TryConsumeEndOfDeclaration(), above, for
-    //   why this is const.
-    void AttachComments(string* leading, string* trailing) const;
-
-   private:
-    Parser* parser_;
-    SourceCodeInfo::Location* location_;
-
-    void Init(const LocationRecorder& parent);
-  };
-
-  // =================================================================
-  // Parsers for various language constructs
-
-  // Parses the "syntax = \"proto2\";" line at the top of the file.  Returns
-  // false if it failed to parse or if the syntax identifier was not
-  // recognized.
-  bool ParseSyntaxIdentifier();
-
-  // These methods parse various individual bits of code.  They return
-  // false if they completely fail to parse the construct.  In this case,
-  // it is probably necessary to skip the rest of the statement to recover.
-  // However, if these methods return true, it does NOT mean that there
-  // were no errors; only that there were no *syntax* errors.  For instance,
-  // if a service method is defined using proper syntax but uses a primitive
-  // type as its input or output, ParseMethodField() still returns true
-  // and only reports the error by calling AddError().  In practice, this
-  // makes logic much simpler for the caller.
-
-  // Parse a top-level message, enum, service, etc.
-  bool ParseTopLevelStatement(FileDescriptorProto* file,
-                              const LocationRecorder& root_location);
-
-  // Parse various language high-level language construrcts.
-  bool ParseMessageDefinition(DescriptorProto* message,
-                              const LocationRecorder& message_location);
-  bool ParseEnumDefinition(EnumDescriptorProto* enum_type,
-                           const LocationRecorder& enum_location);
-  bool ParseServiceDefinition(ServiceDescriptorProto* service,
-                              const LocationRecorder& service_location);
-  bool ParsePackage(FileDescriptorProto* file,
-                    const LocationRecorder& root_location);
-  bool ParseImport(RepeatedPtrField<string>* dependency,
-                   RepeatedField<int32>* public_dependency,
-                   RepeatedField<int32>* weak_dependency,
-                   const LocationRecorder& root_location);
-  bool ParseOption(Message* options,
-                   const LocationRecorder& options_location);
-
-  // These methods parse the contents of a message, enum, or service type and
-  // add them to the given object.  They consume the entire block including
-  // the beginning and ending brace.
-  bool ParseMessageBlock(DescriptorProto* message,
-                         const LocationRecorder& message_location);
-  bool ParseEnumBlock(EnumDescriptorProto* enum_type,
-                      const LocationRecorder& enum_location);
-  bool ParseServiceBlock(ServiceDescriptorProto* service,
-                         const LocationRecorder& service_location);
-
-  // Parse one statement within a message, enum, or service block, inclunding
-  // final semicolon.
-  bool ParseMessageStatement(DescriptorProto* message,
-                             const LocationRecorder& message_location);
-  bool ParseEnumStatement(EnumDescriptorProto* message,
-                          const LocationRecorder& enum_location);
-  bool ParseServiceStatement(ServiceDescriptorProto* message,
-                             const LocationRecorder& service_location);
-
-  // Parse a field of a message.  If the field is a group, its type will be
-  // added to "messages".
-  //
-  // parent_location and location_field_number_for_nested_type are needed when
-  // parsing groups -- we need to generate a nested message type within the
-  // parent and record its location accordingly.  Since the parent could be
-  // either a FileDescriptorProto or a DescriptorProto, we must pass in the
-  // correct field number to use.
-  bool ParseMessageField(FieldDescriptorProto* field,
-                         RepeatedPtrField<DescriptorProto>* messages,
-                         const LocationRecorder& parent_location,
-                         int location_field_number_for_nested_type,
-                         const LocationRecorder& field_location);
-
-  // Parse an "extensions" declaration.
-  bool ParseExtensions(DescriptorProto* message,
-                       const LocationRecorder& extensions_location);
-
-  // Parse an "extend" declaration.  (See also comments for
-  // ParseMessageField().)
-  bool ParseExtend(RepeatedPtrField<FieldDescriptorProto>* extensions,
-                   RepeatedPtrField<DescriptorProto>* messages,
-                   const LocationRecorder& parent_location,
-                   int location_field_number_for_nested_type,
-                   const LocationRecorder& extend_location);
-
-  // Parse a single enum value within an enum block.
-  bool ParseEnumConstant(EnumValueDescriptorProto* enum_value,
-                         const LocationRecorder& enum_value_location);
-
-  // Parse enum constant options, i.e. the list in square brackets at the end
-  // of the enum constant value definition.
-  bool ParseEnumConstantOptions(EnumValueDescriptorProto* value,
-                                const LocationRecorder& enum_value_location);
-
-  // Parse a single method within a service definition.
-  bool ParseServiceMethod(MethodDescriptorProto* method,
-                          const LocationRecorder& method_location);
-
-
-  // Parse options of a single method or stream.
-  bool ParseOptions(const LocationRecorder& parent_location,
-                    const int optionsFieldNumber,
-                    Message* mutable_options);
-
-  // Parse "required", "optional", or "repeated" and fill in "label"
-  // with the value.
-  bool ParseLabel(FieldDescriptorProto::Label* label);
-
-  // Parse a type name and fill in "type" (if it is a primitive) or
-  // "type_name" (if it is not) with the type parsed.
-  bool ParseType(FieldDescriptorProto::Type* type,
-                 string* type_name);
-  // Parse a user-defined type and fill in "type_name" with the name.
-  // If a primitive type is named, it is treated as an error.
-  bool ParseUserDefinedType(string* type_name);
-
-  // Parses field options, i.e. the stuff in square brackets at the end
-  // of a field definition.  Also parses default value.
-  bool ParseFieldOptions(FieldDescriptorProto* field,
-                         const LocationRecorder& field_location);
-
-  // Parse the "default" option.  This needs special handling because its
-  // type is the field's type.
-  bool ParseDefaultAssignment(FieldDescriptorProto* field,
-                              const LocationRecorder& field_location);
-
-  enum OptionStyle {
-    OPTION_ASSIGNMENT,  // just "name = value"
-    OPTION_STATEMENT    // "option name = value;"
-  };
-
-  // Parse a single option name/value pair, e.g. "ctype = CORD".  The name
-  // identifies a field of the given Message, and the value of that field
-  // is set to the parsed value.
-  bool ParseOption(Message* options,
-                   const LocationRecorder& options_location,
-                   OptionStyle style);
-
-  // Parses a single part of a multipart option name. A multipart name consists
-  // of names separated by dots. Each name is either an identifier or a series
-  // of identifiers separated by dots and enclosed in parentheses. E.g.,
-  // "foo.(bar.baz).qux".
-  bool ParseOptionNamePart(UninterpretedOption* uninterpreted_option,
-                           const LocationRecorder& part_location);
-
-  // Parses a string surrounded by balanced braces.  Strips off the outer
-  // braces and stores the enclosed string in *value.
-  // E.g.,
-  //     { foo }                     *value gets 'foo'
-  //     { foo { bar: box } }        *value gets 'foo { bar: box }'
-  //     {}                          *value gets ''
-  //
-  // REQUIRES: LookingAt("{")
-  // When finished successfully, we are looking at the first token past
-  // the ending brace.
-  bool ParseUninterpretedBlock(string* value);
-
-  // =================================================================
-
-  io::Tokenizer* input_;
-  io::ErrorCollector* error_collector_;
-  SourceCodeInfo* source_code_info_;
-  SourceLocationTable* source_location_table_;  // legacy
-  bool had_errors_;
-  bool require_syntax_identifier_;
-  bool stop_after_syntax_identifier_;
-  string syntax_identifier_;
-
-  // Leading doc comments for the next declaration.  These are not complete
-  // yet; use ConsumeEndOfDeclaration() to get the complete comments.
-  string upcoming_doc_comments_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Parser);
-};
-
-// A table mapping (descriptor, ErrorLocation) pairs -- as reported by
-// DescriptorPool when validating descriptors -- to line and column numbers
-// within the original source code.
-//
-// This is semi-obsolete:  FileDescriptorProto.source_code_info now contains
-// far more complete information about source locations.  However, as of this
-// writing you still need to use SourceLocationTable when integrating with
-// DescriptorPool.
-class LIBPROTOBUF_EXPORT SourceLocationTable {
- public:
-  SourceLocationTable();
-  ~SourceLocationTable();
-
-  // Finds the precise location of the given error and fills in *line and
-  // *column with the line and column numbers.  If not found, sets *line to
-  // -1 and *column to 0 (since line = -1 is used to mean "error has no exact
-  // location" in the ErrorCollector interface).  Returns true if found, false
-  // otherwise.
-  bool Find(const Message* descriptor,
-            DescriptorPool::ErrorCollector::ErrorLocation location,
-            int* line, int* column) const;
-
-  // Adds a location to the table.
-  void Add(const Message* descriptor,
-           DescriptorPool::ErrorCollector::ErrorLocation location,
-           int line, int column);
-
-  // Clears the contents of the table.
-  void Clear();
-
- private:
-  typedef map<
-    pair<const Message*, DescriptorPool::ErrorCollector::ErrorLocation>,
-    pair<int, int> > LocationMap;
-  LocationMap location_map_;
-};
-
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_PARSER_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.h b/ps-lite/deps/include/google/protobuf/compiler/plugin.h
deleted file mode 100644
index 6fa2de12..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/plugin.h
+++ /dev/null
@@ -1,72 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//
-// Front-end for protoc code generator plugins written in C++.
-//
-// To implement a protoc plugin in C++, simply write an implementation of
-// CodeGenerator, then create a main() function like:
-//   int main(int argc, char* argv[]) {
-//     MyCodeGenerator generator;
-//     return google::protobuf::compiler::PluginMain(argc, argv, &generator);
-//   }
-// You must link your plugin against libprotobuf and libprotoc.
-//
-// To get protoc to use the plugin, do one of the following:
-// * Place the plugin binary somewhere in the PATH and give it the name
-//   "protoc-gen-NAME" (replacing "NAME" with the name of your plugin).  If you
-//   then invoke protoc with the parameter --NAME_out=OUT_DIR (again, replace
-//   "NAME" with your plugin's name), protoc will invoke your plugin to generate
-//   the output, which will be placed in OUT_DIR.
-// * Place the plugin binary anywhere, with any name, and pass the --plugin
-//   parameter to protoc to direct it to your plugin like so:
-//     protoc --plugin=protoc-gen-NAME=path/to/mybinary --NAME_out=OUT_DIR
-//   On Windows, make sure to include the .exe suffix:
-//     protoc --plugin=protoc-gen-NAME=path/to/mybinary.exe --NAME_out=OUT_DIR
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
-#define GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
-
-#include <google/protobuf/stubs/common.h>
-namespace google {
-namespace protobuf {
-namespace compiler {
-
-class CodeGenerator;    // code_generator.h
-
-// Implements main() for a protoc plugin exposing the given code generator.
-LIBPROTOC_EXPORT int PluginMain(int argc, char* argv[], const CodeGenerator* generator);
-
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h b/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
deleted file mode 100644
index 68cc21c7..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/plugin.pb.h
+++ /dev/null
@@ -1,856 +0,0 @@
-// Generated by the protocol buffer compiler.  DO NOT EDIT!
-// source: google/protobuf/compiler/plugin.proto
-
-#ifndef PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
-#define PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
-
-#include <string>
-
-#include <google/protobuf/stubs/common.h>
-
-#if GOOGLE_PROTOBUF_VERSION < 2005000
-#error This file was generated by a newer version of protoc which is
-#error incompatible with your Protocol Buffer headers.  Please update
-#error your headers.
-#endif
-#if 2005000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
-#error This file was generated by an older version of protoc which is
-#error incompatible with your Protocol Buffer headers.  Please
-#error regenerate this file with a newer version of protoc.
-#endif
-
-#include <google/protobuf/generated_message_util.h>
-#include <google/protobuf/message.h>
-#include <google/protobuf/repeated_field.h>
-#include <google/protobuf/extension_set.h>
-#include <google/protobuf/unknown_field_set.h>
-#include "google/protobuf/descriptor.pb.h"
-// @@protoc_insertion_point(includes)
-
-namespace google {
-namespace protobuf {
-namespace compiler {
-
-// Internal implementation detail -- do not call these.
-void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-
-class CodeGeneratorRequest;
-class CodeGeneratorResponse;
-class CodeGeneratorResponse_File;
-
-// ===================================================================
-
-class LIBPROTOC_EXPORT CodeGeneratorRequest : public ::google::protobuf::Message {
- public:
-  CodeGeneratorRequest();
-  virtual ~CodeGeneratorRequest();
-
-  CodeGeneratorRequest(const CodeGeneratorRequest& from);
-
-  inline CodeGeneratorRequest& operator=(const CodeGeneratorRequest& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const CodeGeneratorRequest& default_instance();
-
-  void Swap(CodeGeneratorRequest* other);
-
-  // implements Message ----------------------------------------------
-
-  CodeGeneratorRequest* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const CodeGeneratorRequest& from);
-  void MergeFrom(const CodeGeneratorRequest& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated string file_to_generate = 1;
-  inline int file_to_generate_size() const;
-  inline void clear_file_to_generate();
-  static const int kFileToGenerateFieldNumber = 1;
-  inline const ::std::string& file_to_generate(int index) const;
-  inline ::std::string* mutable_file_to_generate(int index);
-  inline void set_file_to_generate(int index, const ::std::string& value);
-  inline void set_file_to_generate(int index, const char* value);
-  inline void set_file_to_generate(int index, const char* value, size_t size);
-  inline ::std::string* add_file_to_generate();
-  inline void add_file_to_generate(const ::std::string& value);
-  inline void add_file_to_generate(const char* value);
-  inline void add_file_to_generate(const char* value, size_t size);
-  inline const ::google::protobuf::RepeatedPtrField< ::std::string>& file_to_generate() const;
-  inline ::google::protobuf::RepeatedPtrField< ::std::string>* mutable_file_to_generate();
-
-  // optional string parameter = 2;
-  inline bool has_parameter() const;
-  inline void clear_parameter();
-  static const int kParameterFieldNumber = 2;
-  inline const ::std::string& parameter() const;
-  inline void set_parameter(const ::std::string& value);
-  inline void set_parameter(const char* value);
-  inline void set_parameter(const char* value, size_t size);
-  inline ::std::string* mutable_parameter();
-  inline ::std::string* release_parameter();
-  inline void set_allocated_parameter(::std::string* parameter);
-
-  // repeated .google.protobuf.FileDescriptorProto proto_file = 15;
-  inline int proto_file_size() const;
-  inline void clear_proto_file();
-  static const int kProtoFileFieldNumber = 15;
-  inline const ::google::protobuf::FileDescriptorProto& proto_file(int index) const;
-  inline ::google::protobuf::FileDescriptorProto* mutable_proto_file(int index);
-  inline ::google::protobuf::FileDescriptorProto* add_proto_file();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
-      proto_file() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
-      mutable_proto_file();
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorRequest)
- private:
-  inline void set_has_parameter();
-  inline void clear_has_parameter();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::std::string> file_to_generate_;
-  ::std::string* parameter_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > proto_file_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-
-  void InitAsDefaultInstance();
-  static CodeGeneratorRequest* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOC_EXPORT CodeGeneratorResponse_File : public ::google::protobuf::Message {
- public:
-  CodeGeneratorResponse_File();
-  virtual ~CodeGeneratorResponse_File();
-
-  CodeGeneratorResponse_File(const CodeGeneratorResponse_File& from);
-
-  inline CodeGeneratorResponse_File& operator=(const CodeGeneratorResponse_File& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const CodeGeneratorResponse_File& default_instance();
-
-  void Swap(CodeGeneratorResponse_File* other);
-
-  // implements Message ----------------------------------------------
-
-  CodeGeneratorResponse_File* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const CodeGeneratorResponse_File& from);
-  void MergeFrom(const CodeGeneratorResponse_File& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // optional string insertion_point = 2;
-  inline bool has_insertion_point() const;
-  inline void clear_insertion_point();
-  static const int kInsertionPointFieldNumber = 2;
-  inline const ::std::string& insertion_point() const;
-  inline void set_insertion_point(const ::std::string& value);
-  inline void set_insertion_point(const char* value);
-  inline void set_insertion_point(const char* value, size_t size);
-  inline ::std::string* mutable_insertion_point();
-  inline ::std::string* release_insertion_point();
-  inline void set_allocated_insertion_point(::std::string* insertion_point);
-
-  // optional string content = 15;
-  inline bool has_content() const;
-  inline void clear_content();
-  static const int kContentFieldNumber = 15;
-  inline const ::std::string& content() const;
-  inline void set_content(const ::std::string& value);
-  inline void set_content(const char* value);
-  inline void set_content(const char* value, size_t size);
-  inline ::std::string* mutable_content();
-  inline ::std::string* release_content();
-  inline void set_allocated_content(::std::string* content);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorResponse.File)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_insertion_point();
-  inline void clear_has_insertion_point();
-  inline void set_has_content();
-  inline void clear_has_content();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::std::string* insertion_point_;
-  ::std::string* content_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-
-  void InitAsDefaultInstance();
-  static CodeGeneratorResponse_File* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOC_EXPORT CodeGeneratorResponse : public ::google::protobuf::Message {
- public:
-  CodeGeneratorResponse();
-  virtual ~CodeGeneratorResponse();
-
-  CodeGeneratorResponse(const CodeGeneratorResponse& from);
-
-  inline CodeGeneratorResponse& operator=(const CodeGeneratorResponse& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const CodeGeneratorResponse& default_instance();
-
-  void Swap(CodeGeneratorResponse* other);
-
-  // implements Message ----------------------------------------------
-
-  CodeGeneratorResponse* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const CodeGeneratorResponse& from);
-  void MergeFrom(const CodeGeneratorResponse& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef CodeGeneratorResponse_File File;
-
-  // accessors -------------------------------------------------------
-
-  // optional string error = 1;
-  inline bool has_error() const;
-  inline void clear_error();
-  static const int kErrorFieldNumber = 1;
-  inline const ::std::string& error() const;
-  inline void set_error(const ::std::string& value);
-  inline void set_error(const char* value);
-  inline void set_error(const char* value, size_t size);
-  inline ::std::string* mutable_error();
-  inline ::std::string* release_error();
-  inline void set_allocated_error(::std::string* error);
-
-  // repeated .google.protobuf.compiler.CodeGeneratorResponse.File file = 15;
-  inline int file_size() const;
-  inline void clear_file();
-  static const int kFileFieldNumber = 15;
-  inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& file(int index) const;
-  inline ::google::protobuf::compiler::CodeGeneratorResponse_File* mutable_file(int index);
-  inline ::google::protobuf::compiler::CodeGeneratorResponse_File* add_file();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >&
-      file() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >*
-      mutable_file();
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.compiler.CodeGeneratorResponse)
- private:
-  inline void set_has_error();
-  inline void clear_has_error();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* error_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File > file_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
-
-  friend void LIBPROTOC_EXPORT protobuf_AddDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fcompiler_2fplugin_2eproto();
-
-  void InitAsDefaultInstance();
-  static CodeGeneratorResponse* default_instance_;
-};
-// ===================================================================
-
-
-// ===================================================================
-
-// CodeGeneratorRequest
-
-// repeated string file_to_generate = 1;
-inline int CodeGeneratorRequest::file_to_generate_size() const {
-  return file_to_generate_.size();
-}
-inline void CodeGeneratorRequest::clear_file_to_generate() {
-  file_to_generate_.Clear();
-}
-inline const ::std::string& CodeGeneratorRequest::file_to_generate(int index) const {
-  return file_to_generate_.Get(index);
-}
-inline ::std::string* CodeGeneratorRequest::mutable_file_to_generate(int index) {
-  return file_to_generate_.Mutable(index);
-}
-inline void CodeGeneratorRequest::set_file_to_generate(int index, const ::std::string& value) {
-  file_to_generate_.Mutable(index)->assign(value);
-}
-inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value) {
-  file_to_generate_.Mutable(index)->assign(value);
-}
-inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value, size_t size) {
-  file_to_generate_.Mutable(index)->assign(
-    reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorRequest::add_file_to_generate() {
-  return file_to_generate_.Add();
-}
-inline void CodeGeneratorRequest::add_file_to_generate(const ::std::string& value) {
-  file_to_generate_.Add()->assign(value);
-}
-inline void CodeGeneratorRequest::add_file_to_generate(const char* value) {
-  file_to_generate_.Add()->assign(value);
-}
-inline void CodeGeneratorRequest::add_file_to_generate(const char* value, size_t size) {
-  file_to_generate_.Add()->assign(reinterpret_cast<const char*>(value), size);
-}
-inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
-CodeGeneratorRequest::file_to_generate() const {
-  return file_to_generate_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::std::string>*
-CodeGeneratorRequest::mutable_file_to_generate() {
-  return &file_to_generate_;
-}
-
-// optional string parameter = 2;
-inline bool CodeGeneratorRequest::has_parameter() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void CodeGeneratorRequest::set_has_parameter() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void CodeGeneratorRequest::clear_has_parameter() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void CodeGeneratorRequest::clear_parameter() {
-  if (parameter_ != &::google::protobuf::internal::kEmptyString) {
-    parameter_->clear();
-  }
-  clear_has_parameter();
-}
-inline const ::std::string& CodeGeneratorRequest::parameter() const {
-  return *parameter_;
-}
-inline void CodeGeneratorRequest::set_parameter(const ::std::string& value) {
-  set_has_parameter();
-  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
-    parameter_ = new ::std::string;
-  }
-  parameter_->assign(value);
-}
-inline void CodeGeneratorRequest::set_parameter(const char* value) {
-  set_has_parameter();
-  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
-    parameter_ = new ::std::string;
-  }
-  parameter_->assign(value);
-}
-inline void CodeGeneratorRequest::set_parameter(const char* value, size_t size) {
-  set_has_parameter();
-  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
-    parameter_ = new ::std::string;
-  }
-  parameter_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorRequest::mutable_parameter() {
-  set_has_parameter();
-  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
-    parameter_ = new ::std::string;
-  }
-  return parameter_;
-}
-inline ::std::string* CodeGeneratorRequest::release_parameter() {
-  clear_has_parameter();
-  if (parameter_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = parameter_;
-    parameter_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void CodeGeneratorRequest::set_allocated_parameter(::std::string* parameter) {
-  if (parameter_ != &::google::protobuf::internal::kEmptyString) {
-    delete parameter_;
-  }
-  if (parameter) {
-    set_has_parameter();
-    parameter_ = parameter;
-  } else {
-    clear_has_parameter();
-    parameter_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated .google.protobuf.FileDescriptorProto proto_file = 15;
-inline int CodeGeneratorRequest::proto_file_size() const {
-  return proto_file_.size();
-}
-inline void CodeGeneratorRequest::clear_proto_file() {
-  proto_file_.Clear();
-}
-inline const ::google::protobuf::FileDescriptorProto& CodeGeneratorRequest::proto_file(int index) const {
-  return proto_file_.Get(index);
-}
-inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::mutable_proto_file(int index) {
-  return proto_file_.Mutable(index);
-}
-inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::add_proto_file() {
-  return proto_file_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
-CodeGeneratorRequest::proto_file() const {
-  return proto_file_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
-CodeGeneratorRequest::mutable_proto_file() {
-  return &proto_file_;
-}
-
-// -------------------------------------------------------------------
-
-// CodeGeneratorResponse_File
-
-// optional string name = 1;
-inline bool CodeGeneratorResponse_File::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void CodeGeneratorResponse_File::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void CodeGeneratorResponse_File::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void CodeGeneratorResponse_File::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& CodeGeneratorResponse_File::name() const {
-  return *name_;
-}
-inline void CodeGeneratorResponse_File::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorResponse_File::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* CodeGeneratorResponse_File::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void CodeGeneratorResponse_File::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string insertion_point = 2;
-inline bool CodeGeneratorResponse_File::has_insertion_point() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void CodeGeneratorResponse_File::set_has_insertion_point() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void CodeGeneratorResponse_File::clear_has_insertion_point() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void CodeGeneratorResponse_File::clear_insertion_point() {
-  if (insertion_point_ != &::google::protobuf::internal::kEmptyString) {
-    insertion_point_->clear();
-  }
-  clear_has_insertion_point();
-}
-inline const ::std::string& CodeGeneratorResponse_File::insertion_point() const {
-  return *insertion_point_;
-}
-inline void CodeGeneratorResponse_File::set_insertion_point(const ::std::string& value) {
-  set_has_insertion_point();
-  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
-    insertion_point_ = new ::std::string;
-  }
-  insertion_point_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_insertion_point(const char* value) {
-  set_has_insertion_point();
-  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
-    insertion_point_ = new ::std::string;
-  }
-  insertion_point_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_insertion_point(const char* value, size_t size) {
-  set_has_insertion_point();
-  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
-    insertion_point_ = new ::std::string;
-  }
-  insertion_point_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorResponse_File::mutable_insertion_point() {
-  set_has_insertion_point();
-  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
-    insertion_point_ = new ::std::string;
-  }
-  return insertion_point_;
-}
-inline ::std::string* CodeGeneratorResponse_File::release_insertion_point() {
-  clear_has_insertion_point();
-  if (insertion_point_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = insertion_point_;
-    insertion_point_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void CodeGeneratorResponse_File::set_allocated_insertion_point(::std::string* insertion_point) {
-  if (insertion_point_ != &::google::protobuf::internal::kEmptyString) {
-    delete insertion_point_;
-  }
-  if (insertion_point) {
-    set_has_insertion_point();
-    insertion_point_ = insertion_point;
-  } else {
-    clear_has_insertion_point();
-    insertion_point_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string content = 15;
-inline bool CodeGeneratorResponse_File::has_content() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void CodeGeneratorResponse_File::set_has_content() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void CodeGeneratorResponse_File::clear_has_content() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void CodeGeneratorResponse_File::clear_content() {
-  if (content_ != &::google::protobuf::internal::kEmptyString) {
-    content_->clear();
-  }
-  clear_has_content();
-}
-inline const ::std::string& CodeGeneratorResponse_File::content() const {
-  return *content_;
-}
-inline void CodeGeneratorResponse_File::set_content(const ::std::string& value) {
-  set_has_content();
-  if (content_ == &::google::protobuf::internal::kEmptyString) {
-    content_ = new ::std::string;
-  }
-  content_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_content(const char* value) {
-  set_has_content();
-  if (content_ == &::google::protobuf::internal::kEmptyString) {
-    content_ = new ::std::string;
-  }
-  content_->assign(value);
-}
-inline void CodeGeneratorResponse_File::set_content(const char* value, size_t size) {
-  set_has_content();
-  if (content_ == &::google::protobuf::internal::kEmptyString) {
-    content_ = new ::std::string;
-  }
-  content_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorResponse_File::mutable_content() {
-  set_has_content();
-  if (content_ == &::google::protobuf::internal::kEmptyString) {
-    content_ = new ::std::string;
-  }
-  return content_;
-}
-inline ::std::string* CodeGeneratorResponse_File::release_content() {
-  clear_has_content();
-  if (content_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = content_;
-    content_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void CodeGeneratorResponse_File::set_allocated_content(::std::string* content) {
-  if (content_ != &::google::protobuf::internal::kEmptyString) {
-    delete content_;
-  }
-  if (content) {
-    set_has_content();
-    content_ = content;
-  } else {
-    clear_has_content();
-    content_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// -------------------------------------------------------------------
-
-// CodeGeneratorResponse
-
-// optional string error = 1;
-inline bool CodeGeneratorResponse::has_error() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void CodeGeneratorResponse::set_has_error() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void CodeGeneratorResponse::clear_has_error() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void CodeGeneratorResponse::clear_error() {
-  if (error_ != &::google::protobuf::internal::kEmptyString) {
-    error_->clear();
-  }
-  clear_has_error();
-}
-inline const ::std::string& CodeGeneratorResponse::error() const {
-  return *error_;
-}
-inline void CodeGeneratorResponse::set_error(const ::std::string& value) {
-  set_has_error();
-  if (error_ == &::google::protobuf::internal::kEmptyString) {
-    error_ = new ::std::string;
-  }
-  error_->assign(value);
-}
-inline void CodeGeneratorResponse::set_error(const char* value) {
-  set_has_error();
-  if (error_ == &::google::protobuf::internal::kEmptyString) {
-    error_ = new ::std::string;
-  }
-  error_->assign(value);
-}
-inline void CodeGeneratorResponse::set_error(const char* value, size_t size) {
-  set_has_error();
-  if (error_ == &::google::protobuf::internal::kEmptyString) {
-    error_ = new ::std::string;
-  }
-  error_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* CodeGeneratorResponse::mutable_error() {
-  set_has_error();
-  if (error_ == &::google::protobuf::internal::kEmptyString) {
-    error_ = new ::std::string;
-  }
-  return error_;
-}
-inline ::std::string* CodeGeneratorResponse::release_error() {
-  clear_has_error();
-  if (error_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = error_;
-    error_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void CodeGeneratorResponse::set_allocated_error(::std::string* error) {
-  if (error_ != &::google::protobuf::internal::kEmptyString) {
-    delete error_;
-  }
-  if (error) {
-    set_has_error();
-    error_ = error;
-  } else {
-    clear_has_error();
-    error_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated .google.protobuf.compiler.CodeGeneratorResponse.File file = 15;
-inline int CodeGeneratorResponse::file_size() const {
-  return file_.size();
-}
-inline void CodeGeneratorResponse::clear_file() {
-  file_.Clear();
-}
-inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& CodeGeneratorResponse::file(int index) const {
-  return file_.Get(index);
-}
-inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::mutable_file(int index) {
-  return file_.Mutable(index);
-}
-inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::add_file() {
-  return file_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >&
-CodeGeneratorResponse::file() const {
-  return file_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File >*
-CodeGeneratorResponse::mutable_file() {
-  return &file_;
-}
-
-
-// @@protoc_insertion_point(namespace_scope)
-
-}  // namespace compiler
-}  // namespace protobuf
-}  // namespace google
-
-#ifndef SWIG
-namespace google {
-namespace protobuf {
-
-
-}  // namespace google
-}  // namespace protobuf
-#endif  // SWIG
-
-// @@protoc_insertion_point(global_scope)
-
-#endif  // PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED
diff --git a/ps-lite/deps/include/google/protobuf/compiler/plugin.proto b/ps-lite/deps/include/google/protobuf/compiler/plugin.proto
deleted file mode 100644
index 77b888f3..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/plugin.proto
+++ /dev/null
@@ -1,147 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//
-// WARNING:  The plugin interface is currently EXPERIMENTAL and is subject to
-//   change.
-//
-// protoc (aka the Protocol Compiler) can be extended via plugins.  A plugin is
-// just a program that reads a CodeGeneratorRequest from stdin and writes a
-// CodeGeneratorResponse to stdout.
-//
-// Plugins written using C++ can use google/protobuf/compiler/plugin.h instead
-// of dealing with the raw protocol defined here.
-//
-// A plugin executable needs only to be placed somewhere in the path.  The
-// plugin should be named "protoc-gen-$NAME", and will then be used when the
-// flag "--${NAME}_out" is passed to protoc.
-
-package google.protobuf.compiler;
-option java_package = "com.google.protobuf.compiler";
-option java_outer_classname = "PluginProtos";
-
-import "google/protobuf/descriptor.proto";
-
-// An encoded CodeGeneratorRequest is written to the plugin's stdin.
-message CodeGeneratorRequest {
-  // The .proto files that were explicitly listed on the command-line.  The
-  // code generator should generate code only for these files.  Each file's
-  // descriptor will be included in proto_file, below.
-  repeated string file_to_generate = 1;
-
-  // The generator parameter passed on the command-line.
-  optional string parameter = 2;
-
-  // FileDescriptorProtos for all files in files_to_generate and everything
-  // they import.  The files will appear in topological order, so each file
-  // appears before any file that imports it.
-  //
-  // protoc guarantees that all proto_files will be written after
-  // the fields above, even though this is not technically guaranteed by the
-  // protobuf wire format.  This theoretically could allow a plugin to stream
-  // in the FileDescriptorProtos and handle them one by one rather than read
-  // the entire set into memory at once.  However, as of this writing, this
-  // is not similarly optimized on protoc's end -- it will store all fields in
-  // memory at once before sending them to the plugin.
-  repeated FileDescriptorProto proto_file = 15;
-}
-
-// The plugin writes an encoded CodeGeneratorResponse to stdout.
-message CodeGeneratorResponse {
-  // Error message.  If non-empty, code generation failed.  The plugin process
-  // should exit with status code zero even if it reports an error in this way.
-  //
-  // This should be used to indicate errors in .proto files which prevent the
-  // code generator from generating correct code.  Errors which indicate a
-  // problem in protoc itself -- such as the input CodeGeneratorRequest being
-  // unparseable -- should be reported by writing a message to stderr and
-  // exiting with a non-zero status code.
-  optional string error = 1;
-
-  // Represents a single generated file.
-  message File {
-    // The file name, relative to the output directory.  The name must not
-    // contain "." or ".." components and must be relative, not be absolute (so,
-    // the file cannot lie outside the output directory).  "/" must be used as
-    // the path separator, not "\".
-    //
-    // If the name is omitted, the content will be appended to the previous
-    // file.  This allows the generator to break large files into small chunks,
-    // and allows the generated text to be streamed back to protoc so that large
-    // files need not reside completely in memory at one time.  Note that as of
-    // this writing protoc does not optimize for this -- it will read the entire
-    // CodeGeneratorResponse before writing files to disk.
-    optional string name = 1;
-
-    // If non-empty, indicates that the named file should already exist, and the
-    // content here is to be inserted into that file at a defined insertion
-    // point.  This feature allows a code generator to extend the output
-    // produced by another code generator.  The original generator may provide
-    // insertion points by placing special annotations in the file that look
-    // like:
-    //   @@protoc_insertion_point(NAME)
-    // The annotation can have arbitrary text before and after it on the line,
-    // which allows it to be placed in a comment.  NAME should be replaced with
-    // an identifier naming the point -- this is what other generators will use
-    // as the insertion_point.  Code inserted at this point will be placed
-    // immediately above the line containing the insertion point (thus multiple
-    // insertions to the same point will come out in the order they were added).
-    // The double-@ is intended to make it unlikely that the generated code
-    // could contain things that look like insertion points by accident.
-    //
-    // For example, the C++ code generator places the following line in the
-    // .pb.h files that it generates:
-    //   // @@protoc_insertion_point(namespace_scope)
-    // This line appears within the scope of the file's package namespace, but
-    // outside of any particular class.  Another plugin can then specify the
-    // insertion_point "namespace_scope" to generate additional classes or
-    // other declarations that should be placed in this scope.
-    //
-    // Note that if the line containing the insertion point begins with
-    // whitespace, the same whitespace will be added to every line of the
-    // inserted text.  This is useful for languages like Python, where
-    // indentation matters.  In these languages, the insertion point comment
-    // should be indented the same amount as any inserted code will need to be
-    // in order to work correctly in that context.
-    //
-    // The code generator that generates the initial file and the one which
-    // inserts into it must both run as part of a single invocation of protoc.
-    // Code generators are executed in the order in which they appear on the
-    // command line.
-    //
-    // If |insertion_point| is present, |name| must also be present.
-    optional string insertion_point = 2;
-
-    // The file contents.
-    optional string content = 15;
-  }
-  repeated File file = 15;
-}
diff --git a/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h b/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
deleted file mode 100644
index a3f22cee..00000000
--- a/ps-lite/deps/include/google/protobuf/compiler/python/python_generator.h
+++ /dev/null
@@ -1,161 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: robinson@google.com (Will Robinson)
-//
-// Generates Python code for a given .proto file.
-
-#ifndef GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
-#define GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
-
-#include <string>
-
-#include <google/protobuf/compiler/code_generator.h>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-
-class Descriptor;
-class EnumDescriptor;
-class EnumValueDescriptor;
-class FieldDescriptor;
-class ServiceDescriptor;
-
-namespace io { class Printer; }
-
-namespace compiler {
-namespace python {
-
-// CodeGenerator implementation for generated Python protocol buffer classes.
-// If you create your own protocol compiler binary and you want it to support
-// Python output, you can do so by registering an instance of this
-// CodeGenerator with the CommandLineInterface in your main() function.
-class LIBPROTOC_EXPORT Generator : public CodeGenerator {
- public:
-  Generator();
-  virtual ~Generator();
-
-  // CodeGenerator methods.
-  virtual bool Generate(const FileDescriptor* file,
-                        const string& parameter,
-                        GeneratorContext* generator_context,
-                        string* error) const;
-
- private:
-  void PrintImports() const;
-  void PrintFileDescriptor() const;
-  void PrintTopLevelEnums() const;
-  void PrintAllNestedEnumsInFile() const;
-  void PrintNestedEnums(const Descriptor& descriptor) const;
-  void PrintEnum(const EnumDescriptor& enum_descriptor) const;
-
-  void PrintTopLevelExtensions() const;
-
-  void PrintFieldDescriptor(
-      const FieldDescriptor& field, bool is_extension) const;
-  void PrintFieldDescriptorsInDescriptor(
-      const Descriptor& message_descriptor,
-      bool is_extension,
-      const string& list_variable_name,
-      int (Descriptor::*CountFn)() const,
-      const FieldDescriptor* (Descriptor::*GetterFn)(int) const) const;
-  void PrintFieldsInDescriptor(const Descriptor& message_descriptor) const;
-  void PrintExtensionsInDescriptor(const Descriptor& message_descriptor) const;
-  void PrintMessageDescriptors() const;
-  void PrintDescriptor(const Descriptor& message_descriptor) const;
-  void PrintNestedDescriptors(const Descriptor& containing_descriptor) const;
-
-  void PrintMessages() const;
-  void PrintMessage(const Descriptor& message_descriptor) const;
-  void PrintNestedMessages(const Descriptor& containing_descriptor) const;
-
-  void FixForeignFieldsInDescriptors() const;
-  void FixForeignFieldsInDescriptor(
-      const Descriptor& descriptor,
-      const Descriptor* containing_descriptor) const;
-  void FixForeignFieldsInField(const Descriptor* containing_type,
-                               const FieldDescriptor& field,
-                               const string& python_dict_name) const;
-  void AddMessageToFileDescriptor(const Descriptor& descriptor) const;
-  string FieldReferencingExpression(const Descriptor* containing_type,
-                                    const FieldDescriptor& field,
-                                    const string& python_dict_name) const;
-  template <typename DescriptorT>
-  void FixContainingTypeInDescriptor(
-      const DescriptorT& descriptor,
-      const Descriptor* containing_descriptor) const;
-
-  void FixForeignFieldsInExtensions() const;
-  void FixForeignFieldsInExtension(
-      const FieldDescriptor& extension_field) const;
-  void FixForeignFieldsInNestedExtensions(const Descriptor& descriptor) const;
-
-  void PrintServices() const;
-  void PrintServiceDescriptor(const ServiceDescriptor& descriptor) const;
-  void PrintServiceClass(const ServiceDescriptor& descriptor) const;
-  void PrintServiceStub(const ServiceDescriptor& descriptor) const;
-
-  void PrintEnumValueDescriptor(const EnumValueDescriptor& descriptor) const;
-  string OptionsValue(const string& class_name,
-                      const string& serialized_options) const;
-  bool GeneratingDescriptorProto() const;
-
-  template <typename DescriptorT>
-  string ModuleLevelDescriptorName(const DescriptorT& descriptor) const;
-  string ModuleLevelMessageName(const Descriptor& descriptor) const;
-  string ModuleLevelServiceDescriptorName(
-      const ServiceDescriptor& descriptor) const;
-
-  template <typename DescriptorT, typename DescriptorProtoT>
-  void PrintSerializedPbInterval(
-      const DescriptorT& descriptor, DescriptorProtoT& proto) const;
-
-  void FixAllDescriptorOptions() const;
-  void FixOptionsForField(const FieldDescriptor& field) const;
-  void FixOptionsForEnum(const EnumDescriptor& descriptor) const;
-  void FixOptionsForMessage(const Descriptor& descriptor) const;
-
-  // Very coarse-grained lock to ensure that Generate() is reentrant.
-  // Guards file_, printer_ and file_descriptor_serialized_.
-  mutable Mutex mutex_;
-  mutable const FileDescriptor* file_;  // Set in Generate().  Under mutex_.
-  mutable string file_descriptor_serialized_;
-  mutable io::Printer* printer_;  // Set in Generate().  Under mutex_.
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Generator);
-};
-
-}  // namespace python
-}  // namespace compiler
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.h b/ps-lite/deps/include/google/protobuf/descriptor.h
deleted file mode 100644
index 33e3af72..00000000
--- a/ps-lite/deps/include/google/protobuf/descriptor.h
+++ /dev/null
@@ -1,1521 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains classes which describe a type of protocol message.
-// You can use a message's descriptor to learn at runtime what fields
-// it contains and what the types of those fields are.  The Message
-// interface also allows you to dynamically access and modify individual
-// fields by passing the FieldDescriptor of the field you are interested
-// in.
-//
-// Most users will not care about descriptors, because they will write
-// code specific to certain protocol types and will simply use the classes
-// generated by the protocol compiler directly.  Advanced users who want
-// to operate on arbitrary types (not known at compile time) may want to
-// read descriptors in order to learn about the contents of a message.
-// A very small number of users will want to construct their own
-// Descriptors, either because they are implementing Message manually or
-// because they are writing something like the protocol compiler.
-//
-// For an example of how you might use descriptors, see the code example
-// at the top of message.h.
-
-#ifndef GOOGLE_PROTOBUF_DESCRIPTOR_H__
-#define GOOGLE_PROTOBUF_DESCRIPTOR_H__
-
-#include <string>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-
-// TYPE_BOOL is defined in the MacOS's ConditionalMacros.h.
-#ifdef TYPE_BOOL
-#undef TYPE_BOOL
-#endif  // TYPE_BOOL
-
-namespace google {
-namespace protobuf {
-
-// Defined in this file.
-class Descriptor;
-class FieldDescriptor;
-class EnumDescriptor;
-class EnumValueDescriptor;
-class ServiceDescriptor;
-class MethodDescriptor;
-class FileDescriptor;
-class DescriptorDatabase;
-class DescriptorPool;
-
-// Defined in descriptor.proto
-class DescriptorProto;
-class FieldDescriptorProto;
-class EnumDescriptorProto;
-class EnumValueDescriptorProto;
-class ServiceDescriptorProto;
-class MethodDescriptorProto;
-class FileDescriptorProto;
-class MessageOptions;
-class FieldOptions;
-class EnumOptions;
-class EnumValueOptions;
-class ServiceOptions;
-class MethodOptions;
-class FileOptions;
-class UninterpretedOption;
-class SourceCodeInfo;
-
-// Defined in message.h
-class Message;
-
-// Defined in descriptor.cc
-class DescriptorBuilder;
-class FileDescriptorTables;
-
-// Defined in unknown_field_set.h.
-class UnknownField;
-
-// NB, all indices are zero-based.
-struct SourceLocation {
-  int start_line;
-  int end_line;
-  int start_column;
-  int end_column;
-
-  // Doc comments found at the source location.
-  // TODO(kenton):  Maybe this struct should have been named SourceInfo or
-  //   something instead.  Oh well.
-  string leading_comments;
-  string trailing_comments;
-};
-
-// Describes a type of protocol message, or a particular group within a
-// message.  To obtain the Descriptor for a given message object, call
-// Message::GetDescriptor().  Generated message classes also have a
-// static method called descriptor() which returns the type's descriptor.
-// Use DescriptorPool to construct your own descriptors.
-class LIBPROTOBUF_EXPORT Descriptor {
- public:
-  // The name of the message type, not including its scope.
-  const string& name() const;
-
-  // The fully-qualified name of the message type, scope delimited by
-  // periods.  For example, message type "Foo" which is declared in package
-  // "bar" has full name "bar.Foo".  If a type "Baz" is nested within
-  // Foo, Baz's full_name is "bar.Foo.Baz".  To get only the part that
-  // comes after the last '.', use name().
-  const string& full_name() const;
-
-  // Index of this descriptor within the file or containing type's message
-  // type array.
-  int index() const;
-
-  // The .proto file in which this message type was defined.  Never NULL.
-  const FileDescriptor* file() const;
-
-  // If this Descriptor describes a nested type, this returns the type
-  // in which it is nested.  Otherwise, returns NULL.
-  const Descriptor* containing_type() const;
-
-  // Get options for this message type.  These are specified in the .proto file
-  // by placing lines like "option foo = 1234;" in the message definition.
-  // Allowed options are defined by MessageOptions in
-  // google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const MessageOptions& options() const;
-
-  // Write the contents of this Descriptor into the given DescriptorProto.
-  // The target DescriptorProto must be clear before calling this; if it
-  // isn't, the result may be garbage.
-  void CopyTo(DescriptorProto* proto) const;
-
-  // Write the contents of this decriptor in a human-readable form. Output
-  // will be suitable for re-parsing.
-  string DebugString() const;
-
-  // Field stuff -----------------------------------------------------
-
-  // The number of fields in this message type.
-  int field_count() const;
-  // Gets a field by index, where 0 <= index < field_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FieldDescriptor* field(int index) const;
-
-  // Looks up a field by declared tag number.  Returns NULL if no such field
-  // exists.
-  const FieldDescriptor* FindFieldByNumber(int number) const;
-  // Looks up a field by name.  Returns NULL if no such field exists.
-  const FieldDescriptor* FindFieldByName(const string& name) const;
-
-  // Looks up a field by lowercased name (as returned by lowercase_name()).
-  // This lookup may be ambiguous if multiple field names differ only by case,
-  // in which case the field returned is chosen arbitrarily from the matches.
-  const FieldDescriptor* FindFieldByLowercaseName(
-      const string& lowercase_name) const;
-
-  // Looks up a field by camel-case name (as returned by camelcase_name()).
-  // This lookup may be ambiguous if multiple field names differ in a way that
-  // leads them to have identical camel-case names, in which case the field
-  // returned is chosen arbitrarily from the matches.
-  const FieldDescriptor* FindFieldByCamelcaseName(
-      const string& camelcase_name) const;
-
-  // Nested type stuff -----------------------------------------------
-
-  // The number of nested types in this message type.
-  int nested_type_count() const;
-  // Gets a nested type by index, where 0 <= index < nested_type_count().
-  // These are returned in the order they were defined in the .proto file.
-  const Descriptor* nested_type(int index) const;
-
-  // Looks up a nested type by name.  Returns NULL if no such nested type
-  // exists.
-  const Descriptor* FindNestedTypeByName(const string& name) const;
-
-  // Enum stuff ------------------------------------------------------
-
-  // The number of enum types in this message type.
-  int enum_type_count() const;
-  // Gets an enum type by index, where 0 <= index < enum_type_count().
-  // These are returned in the order they were defined in the .proto file.
-  const EnumDescriptor* enum_type(int index) const;
-
-  // Looks up an enum type by name.  Returns NULL if no such enum type exists.
-  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
-
-  // Looks up an enum value by name, among all enum types in this message.
-  // Returns NULL if no such value exists.
-  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
-
-  // Extensions ------------------------------------------------------
-
-  // A range of field numbers which are designated for third-party
-  // extensions.
-  struct ExtensionRange {
-    int start;  // inclusive
-    int end;    // exclusive
-  };
-
-  // The number of extension ranges in this message type.
-  int extension_range_count() const;
-  // Gets an extension range by index, where 0 <= index <
-  // extension_range_count(). These are returned in the order they were defined
-  // in the .proto file.
-  const ExtensionRange* extension_range(int index) const;
-
-  // Returns true if the number is in one of the extension ranges.
-  bool IsExtensionNumber(int number) const;
-
-  // The number of extensions -- extending *other* messages -- that were
-  // defined nested within this message type's scope.
-  int extension_count() const;
-  // Get an extension by index, where 0 <= index < extension_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FieldDescriptor* extension(int index) const;
-
-  // Looks up a named extension (which extends some *other* message type)
-  // defined within this message type's scope.
-  const FieldDescriptor* FindExtensionByName(const string& name) const;
-
-  // Similar to FindFieldByLowercaseName(), but finds extensions defined within
-  // this message type's scope.
-  const FieldDescriptor* FindExtensionByLowercaseName(const string& name) const;
-
-  // Similar to FindFieldByCamelcaseName(), but finds extensions defined within
-  // this message type's scope.
-  const FieldDescriptor* FindExtensionByCamelcaseName(const string& name) const;
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this message declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef MessageOptions OptionsType;
-
-  // Internal version of DebugString; controls the level of indenting for
-  // correct depth
-  void DebugString(int depth, string *contents) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  const FileDescriptor* file_;
-  const Descriptor* containing_type_;
-  const MessageOptions* options_;
-
-  // True if this is a placeholder for an unknown type.
-  bool is_placeholder_;
-  // True if this is a placeholder and the type name wasn't fully-qualified.
-  bool is_unqualified_placeholder_;
-
-  int field_count_;
-  FieldDescriptor* fields_;
-  int nested_type_count_;
-  Descriptor* nested_types_;
-  int enum_type_count_;
-  EnumDescriptor* enum_types_;
-  int extension_range_count_;
-  ExtensionRange* extension_ranges_;
-  int extension_count_;
-  FieldDescriptor* extensions_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<Descriptor>() and AllocateArray<Descriptor>() in descriptor.cc
-  // and update them to initialize the field.
-
-  // Must be constructed using DescriptorPool.
-  Descriptor() {}
-  friend class DescriptorBuilder;
-  friend class EnumDescriptor;
-  friend class FieldDescriptor;
-  friend class MethodDescriptor;
-  friend class FileDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Descriptor);
-};
-
-// Describes a single field of a message.  To get the descriptor for a given
-// field, first get the Descriptor for the message in which it is defined,
-// then call Descriptor::FindFieldByName().  To get a FieldDescriptor for
-// an extension, do one of the following:
-// - Get the Descriptor or FileDescriptor for its containing scope, then
-//   call Descriptor::FindExtensionByName() or
-//   FileDescriptor::FindExtensionByName().
-// - Given a DescriptorPool, call DescriptorPool::FindExtensionByNumber().
-// - Given a Reflection for a message object, call
-//   Reflection::FindKnownExtensionByName() or
-//   Reflection::FindKnownExtensionByNumber().
-// Use DescriptorPool to construct your own descriptors.
-class LIBPROTOBUF_EXPORT FieldDescriptor {
- public:
-  // Identifies a field type.  0 is reserved for errors.  The order is weird
-  // for historical reasons.  Types 12 and up are new in proto2.
-  enum Type {
-    TYPE_DOUBLE         = 1,   // double, exactly eight bytes on the wire.
-    TYPE_FLOAT          = 2,   // float, exactly four bytes on the wire.
-    TYPE_INT64          = 3,   // int64, varint on the wire.  Negative numbers
-                               // take 10 bytes.  Use TYPE_SINT64 if negative
-                               // values are likely.
-    TYPE_UINT64         = 4,   // uint64, varint on the wire.
-    TYPE_INT32          = 5,   // int32, varint on the wire.  Negative numbers
-                               // take 10 bytes.  Use TYPE_SINT32 if negative
-                               // values are likely.
-    TYPE_FIXED64        = 6,   // uint64, exactly eight bytes on the wire.
-    TYPE_FIXED32        = 7,   // uint32, exactly four bytes on the wire.
-    TYPE_BOOL           = 8,   // bool, varint on the wire.
-    TYPE_STRING         = 9,   // UTF-8 text.
-    TYPE_GROUP          = 10,  // Tag-delimited message.  Deprecated.
-    TYPE_MESSAGE        = 11,  // Length-delimited message.
-
-    TYPE_BYTES          = 12,  // Arbitrary byte array.
-    TYPE_UINT32         = 13,  // uint32, varint on the wire
-    TYPE_ENUM           = 14,  // Enum, varint on the wire
-    TYPE_SFIXED32       = 15,  // int32, exactly four bytes on the wire
-    TYPE_SFIXED64       = 16,  // int64, exactly eight bytes on the wire
-    TYPE_SINT32         = 17,  // int32, ZigZag-encoded varint on the wire
-    TYPE_SINT64         = 18,  // int64, ZigZag-encoded varint on the wire
-
-    MAX_TYPE            = 18,  // Constant useful for defining lookup tables
-                               // indexed by Type.
-  };
-
-  // Specifies the C++ data type used to represent the field.  There is a
-  // fixed mapping from Type to CppType where each Type maps to exactly one
-  // CppType.  0 is reserved for errors.
-  enum CppType {
-    CPPTYPE_INT32       = 1,     // TYPE_INT32, TYPE_SINT32, TYPE_SFIXED32
-    CPPTYPE_INT64       = 2,     // TYPE_INT64, TYPE_SINT64, TYPE_SFIXED64
-    CPPTYPE_UINT32      = 3,     // TYPE_UINT32, TYPE_FIXED32
-    CPPTYPE_UINT64      = 4,     // TYPE_UINT64, TYPE_FIXED64
-    CPPTYPE_DOUBLE      = 5,     // TYPE_DOUBLE
-    CPPTYPE_FLOAT       = 6,     // TYPE_FLOAT
-    CPPTYPE_BOOL        = 7,     // TYPE_BOOL
-    CPPTYPE_ENUM        = 8,     // TYPE_ENUM
-    CPPTYPE_STRING      = 9,     // TYPE_STRING, TYPE_BYTES
-    CPPTYPE_MESSAGE     = 10,    // TYPE_MESSAGE, TYPE_GROUP
-
-    MAX_CPPTYPE         = 10,    // Constant useful for defining lookup tables
-                                 // indexed by CppType.
-  };
-
-  // Identifies whether the field is optional, required, or repeated.  0 is
-  // reserved for errors.
-  enum Label {
-    LABEL_OPTIONAL      = 1,    // optional
-    LABEL_REQUIRED      = 2,    // required
-    LABEL_REPEATED      = 3,    // repeated
-
-    MAX_LABEL           = 3,    // Constant useful for defining lookup tables
-                                // indexed by Label.
-  };
-
-  // Valid field numbers are positive integers up to kMaxNumber.
-  static const int kMaxNumber = (1 << 29) - 1;
-
-  // First field number reserved for the protocol buffer library implementation.
-  // Users may not declare fields that use reserved numbers.
-  static const int kFirstReservedNumber = 19000;
-  // Last field number reserved for the protocol buffer library implementation.
-  // Users may not declare fields that use reserved numbers.
-  static const int kLastReservedNumber  = 19999;
-
-  const string& name() const;        // Name of this field within the message.
-  const string& full_name() const;   // Fully-qualified name of the field.
-  const FileDescriptor* file() const;// File in which this field was defined.
-  bool is_extension() const;         // Is this an extension field?
-  int number() const;                // Declared tag number.
-
-  // Same as name() except converted to lower-case.  This (and especially the
-  // FindFieldByLowercaseName() method) can be useful when parsing formats
-  // which prefer to use lowercase naming style.  (Although, technically
-  // field names should be lowercased anyway according to the protobuf style
-  // guide, so this only makes a difference when dealing with old .proto files
-  // which do not follow the guide.)
-  const string& lowercase_name() const;
-
-  // Same as name() except converted to camel-case.  In this conversion, any
-  // time an underscore appears in the name, it is removed and the next
-  // letter is capitalized.  Furthermore, the first letter of the name is
-  // lower-cased.  Examples:
-  //   FooBar -> fooBar
-  //   foo_bar -> fooBar
-  //   fooBar -> fooBar
-  // This (and especially the FindFieldByCamelcaseName() method) can be useful
-  // when parsing formats which prefer to use camel-case naming style.
-  const string& camelcase_name() const;
-
-  Type type() const;                  // Declared type of this field.
-  const char* type_name() const;      // Name of the declared type.
-  CppType cpp_type() const;           // C++ type of this field.
-  const char* cpp_type_name() const;  // Name of the C++ type.
-  Label label() const;                // optional/required/repeated
-
-  bool is_required() const;      // shorthand for label() == LABEL_REQUIRED
-  bool is_optional() const;      // shorthand for label() == LABEL_OPTIONAL
-  bool is_repeated() const;      // shorthand for label() == LABEL_REPEATED
-  bool is_packable() const;      // shorthand for is_repeated() &&
-                                 //               IsTypePackable(type())
-  bool is_packed() const;        // shorthand for is_packable() &&
-                                 //               options().packed()
-
-  // Index of this field within the message's field array, or the file or
-  // extension scope's extensions array.
-  int index() const;
-
-  // Does this field have an explicitly-declared default value?
-  bool has_default_value() const;
-
-  // Get the field default value if cpp_type() == CPPTYPE_INT32.  If no
-  // explicit default was defined, the default is 0.
-  int32 default_value_int32() const;
-  // Get the field default value if cpp_type() == CPPTYPE_INT64.  If no
-  // explicit default was defined, the default is 0.
-  int64 default_value_int64() const;
-  // Get the field default value if cpp_type() == CPPTYPE_UINT32.  If no
-  // explicit default was defined, the default is 0.
-  uint32 default_value_uint32() const;
-  // Get the field default value if cpp_type() == CPPTYPE_UINT64.  If no
-  // explicit default was defined, the default is 0.
-  uint64 default_value_uint64() const;
-  // Get the field default value if cpp_type() == CPPTYPE_FLOAT.  If no
-  // explicit default was defined, the default is 0.0.
-  float default_value_float() const;
-  // Get the field default value if cpp_type() == CPPTYPE_DOUBLE.  If no
-  // explicit default was defined, the default is 0.0.
-  double default_value_double() const;
-  // Get the field default value if cpp_type() == CPPTYPE_BOOL.  If no
-  // explicit default was defined, the default is false.
-  bool default_value_bool() const;
-  // Get the field default value if cpp_type() == CPPTYPE_ENUM.  If no
-  // explicit default was defined, the default is the first value defined
-  // in the enum type (all enum types are required to have at least one value).
-  // This never returns NULL.
-  const EnumValueDescriptor* default_value_enum() const;
-  // Get the field default value if cpp_type() == CPPTYPE_STRING.  If no
-  // explicit default was defined, the default is the empty string.
-  const string& default_value_string() const;
-
-  // The Descriptor for the message of which this is a field.  For extensions,
-  // this is the extended type.  Never NULL.
-  const Descriptor* containing_type() const;
-
-  // An extension may be declared within the scope of another message.  If this
-  // field is an extension (is_extension() is true), then extension_scope()
-  // returns that message, or NULL if the extension was declared at global
-  // scope.  If this is not an extension, extension_scope() is undefined (may
-  // assert-fail).
-  const Descriptor* extension_scope() const;
-
-  // If type is TYPE_MESSAGE or TYPE_GROUP, returns a descriptor for the
-  // message or the group type.  Otherwise, undefined.
-  const Descriptor* message_type() const;
-  // If type is TYPE_ENUM, returns a descriptor for the enum.  Otherwise,
-  // undefined.
-  const EnumDescriptor* enum_type() const;
-
-  // EXPERIMENTAL; DO NOT USE.
-  // If this field is a map field, experimental_map_key() is the field
-  // that is the key for this map.
-  // experimental_map_key()->containing_type() is the same as message_type().
-  const FieldDescriptor* experimental_map_key() const;
-
-  // Get the FieldOptions for this field.  This includes things listed in
-  // square brackets after the field definition.  E.g., the field:
-  //   optional string text = 1 [ctype=CORD];
-  // has the "ctype" option set.  Allowed options are defined by FieldOptions
-  // in google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const FieldOptions& options() const;
-
-  // See Descriptor::CopyTo().
-  void CopyTo(FieldDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
-  // Helper method to get the CppType for a particular Type.
-  static CppType TypeToCppType(Type type);
-
-  // Return true iff [packed = true] is valid for fields of this type.
-  static inline bool IsTypePackable(Type field_type);
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this field declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef FieldOptions OptionsType;
-
-  // See Descriptor::DebugString().
-  void DebugString(int depth, string *contents) const;
-
-  // formats the default value appropriately and returns it as a string.
-  // Must have a default value to call this. If quote_string_type is true, then
-  // types of CPPTYPE_STRING whill be surrounded by quotes and CEscaped.
-  string DefaultValueAsString(bool quote_string_type) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  const string* lowercase_name_;
-  const string* camelcase_name_;
-  const FileDescriptor* file_;
-  int number_;
-  Type type_;
-  Label label_;
-  bool is_extension_;
-  const Descriptor* containing_type_;
-  const Descriptor* extension_scope_;
-  const Descriptor* message_type_;
-  const EnumDescriptor* enum_type_;
-  const FieldDescriptor* experimental_map_key_;
-  const FieldOptions* options_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<FieldDescriptor>() and AllocateArray<FieldDescriptor>() in
-  // descriptor.cc and update them to initialize the field.
-
-  bool has_default_value_;
-  union {
-    int32  default_value_int32_;
-    int64  default_value_int64_;
-    uint32 default_value_uint32_;
-    uint64 default_value_uint64_;
-    float  default_value_float_;
-    double default_value_double_;
-    bool   default_value_bool_;
-
-    const EnumValueDescriptor* default_value_enum_;
-    const string* default_value_string_;
-  };
-
-  static const CppType kTypeToCppTypeMap[MAX_TYPE + 1];
-
-  static const char * const kTypeToName[MAX_TYPE + 1];
-
-  static const char * const kCppTypeToName[MAX_CPPTYPE + 1];
-
-  static const char * const kLabelToName[MAX_LABEL + 1];
-
-  // Must be constructed using DescriptorPool.
-  FieldDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class FileDescriptor;
-  friend class Descriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FieldDescriptor);
-};
-
-// Describes an enum type defined in a .proto file.  To get the EnumDescriptor
-// for a generated enum type, call TypeName_descriptor().  Use DescriptorPool
-// to construct your own descriptors.
-class LIBPROTOBUF_EXPORT EnumDescriptor {
- public:
-  // The name of this enum type in the containing scope.
-  const string& name() const;
-
-  // The fully-qualified name of the enum type, scope delimited by periods.
-  const string& full_name() const;
-
-  // Index of this enum within the file or containing message's enum array.
-  int index() const;
-
-  // The .proto file in which this enum type was defined.  Never NULL.
-  const FileDescriptor* file() const;
-
-  // The number of values for this EnumDescriptor.  Guaranteed to be greater
-  // than zero.
-  int value_count() const;
-  // Gets a value by index, where 0 <= index < value_count().
-  // These are returned in the order they were defined in the .proto file.
-  const EnumValueDescriptor* value(int index) const;
-
-  // Looks up a value by name.  Returns NULL if no such value exists.
-  const EnumValueDescriptor* FindValueByName(const string& name) const;
-  // Looks up a value by number.  Returns NULL if no such value exists.  If
-  // multiple values have this number, the first one defined is returned.
-  const EnumValueDescriptor* FindValueByNumber(int number) const;
-
-  // If this enum type is nested in a message type, this is that message type.
-  // Otherwise, NULL.
-  const Descriptor* containing_type() const;
-
-  // Get options for this enum type.  These are specified in the .proto file by
-  // placing lines like "option foo = 1234;" in the enum definition.  Allowed
-  // options are defined by EnumOptions in google/protobuf/descriptor.proto,
-  // and any available extensions of that message.
-  const EnumOptions& options() const;
-
-  // See Descriptor::CopyTo().
-  void CopyTo(EnumDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this enum declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef EnumOptions OptionsType;
-
-  // See Descriptor::DebugString().
-  void DebugString(int depth, string *contents) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  const FileDescriptor* file_;
-  const Descriptor* containing_type_;
-  const EnumOptions* options_;
-
-  // True if this is a placeholder for an unknown type.
-  bool is_placeholder_;
-  // True if this is a placeholder and the type name wasn't fully-qualified.
-  bool is_unqualified_placeholder_;
-
-  int value_count_;
-  EnumValueDescriptor* values_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<EnumDescriptor>() and AllocateArray<EnumDescriptor>() in
-  // descriptor.cc and update them to initialize the field.
-
-  // Must be constructed using DescriptorPool.
-  EnumDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class Descriptor;
-  friend class FieldDescriptor;
-  friend class EnumValueDescriptor;
-  friend class FileDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EnumDescriptor);
-};
-
-// Describes an individual enum constant of a particular type.  To get the
-// EnumValueDescriptor for a given enum value, first get the EnumDescriptor
-// for its type, then use EnumDescriptor::FindValueByName() or
-// EnumDescriptor::FindValueByNumber().  Use DescriptorPool to construct
-// your own descriptors.
-class LIBPROTOBUF_EXPORT EnumValueDescriptor {
- public:
-  const string& name() const;  // Name of this enum constant.
-  int index() const;           // Index within the enums's Descriptor.
-  int number() const;          // Numeric value of this enum constant.
-
-  // The full_name of an enum value is a sibling symbol of the enum type.
-  // e.g. the full name of FieldDescriptorProto::TYPE_INT32 is actually
-  // "google.protobuf.FieldDescriptorProto.TYPE_INT32", NOT
-  // "google.protobuf.FieldDescriptorProto.Type.TYPE_INT32".  This is to conform
-  // with C++ scoping rules for enums.
-  const string& full_name() const;
-
-  // The type of this value.  Never NULL.
-  const EnumDescriptor* type() const;
-
-  // Get options for this enum value.  These are specified in the .proto file
-  // by adding text like "[foo = 1234]" after an enum value definition.
-  // Allowed options are defined by EnumValueOptions in
-  // google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const EnumValueOptions& options() const;
-
-  // See Descriptor::CopyTo().
-  void CopyTo(EnumValueDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this enum value declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef EnumValueOptions OptionsType;
-
-  // See Descriptor::DebugString().
-  void DebugString(int depth, string *contents) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  int number_;
-  const EnumDescriptor* type_;
-  const EnumValueOptions* options_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<EnumValueDescriptor>() and AllocateArray<EnumValueDescriptor>()
-  // in descriptor.cc and update them to initialize the field.
-
-  // Must be constructed using DescriptorPool.
-  EnumValueDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class EnumDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EnumValueDescriptor);
-};
-
-// Describes an RPC service.  To get the ServiceDescriptor for a service,
-// call Service::GetDescriptor().  Generated service classes also have a
-// static method called descriptor() which returns the type's
-// ServiceDescriptor.  Use DescriptorPool to construct your own descriptors.
-class LIBPROTOBUF_EXPORT ServiceDescriptor {
- public:
-  // The name of the service, not including its containing scope.
-  const string& name() const;
-  // The fully-qualified name of the service, scope delimited by periods.
-  const string& full_name() const;
-  // Index of this service within the file's services array.
-  int index() const;
-
-  // The .proto file in which this service was defined.  Never NULL.
-  const FileDescriptor* file() const;
-
-  // Get options for this service type.  These are specified in the .proto file
-  // by placing lines like "option foo = 1234;" in the service definition.
-  // Allowed options are defined by ServiceOptions in
-  // google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const ServiceOptions& options() const;
-
-  // The number of methods this service defines.
-  int method_count() const;
-  // Gets a MethodDescriptor by index, where 0 <= index < method_count().
-  // These are returned in the order they were defined in the .proto file.
-  const MethodDescriptor* method(int index) const;
-
-  // Look up a MethodDescriptor by name.
-  const MethodDescriptor* FindMethodByName(const string& name) const;
-  // See Descriptor::CopyTo().
-  void CopyTo(ServiceDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this service declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef ServiceOptions OptionsType;
-
-  // See Descriptor::DebugString().
-  void DebugString(string *contents) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  const FileDescriptor* file_;
-  const ServiceOptions* options_;
-  int method_count_;
-  MethodDescriptor* methods_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<ServiceDescriptor>() and AllocateArray<ServiceDescriptor>() in
-  // descriptor.cc and update them to initialize the field.
-
-  // Must be constructed using DescriptorPool.
-  ServiceDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class FileDescriptor;
-  friend class MethodDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ServiceDescriptor);
-};
-
-// Describes an individual service method.  To obtain a MethodDescriptor given
-// a service, first get its ServiceDescriptor, then call
-// ServiceDescriptor::FindMethodByName().  Use DescriptorPool to construct your
-// own descriptors.
-class LIBPROTOBUF_EXPORT MethodDescriptor {
- public:
-  // Name of this method, not including containing scope.
-  const string& name() const;
-  // The fully-qualified name of the method, scope delimited by periods.
-  const string& full_name() const;
-  // Index within the service's Descriptor.
-  int index() const;
-
-  // Gets the service to which this method belongs.  Never NULL.
-  const ServiceDescriptor* service() const;
-
-  // Gets the type of protocol message which this method accepts as input.
-  const Descriptor* input_type() const;
-  // Gets the type of protocol message which this message produces as output.
-  const Descriptor* output_type() const;
-
-  // Get options for this method.  These are specified in the .proto file by
-  // placing lines like "option foo = 1234;" in curly-braces after a method
-  // declaration.  Allowed options are defined by MethodOptions in
-  // google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const MethodOptions& options() const;
-
-  // See Descriptor::CopyTo().
-  void CopyTo(MethodDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of this method declaration.  Returns false and leaves
-  // |*out_location| unchanged iff location information was not available.
-  bool GetSourceLocation(SourceLocation* out_location) const;
-
- private:
-  typedef MethodOptions OptionsType;
-
-  // See Descriptor::DebugString().
-  void DebugString(int depth, string *contents) const;
-
-  // Walks up the descriptor tree to generate the source location path
-  // to this descriptor from the file root.
-  void GetLocationPath(vector<int>* output) const;
-
-  const string* name_;
-  const string* full_name_;
-  const ServiceDescriptor* service_;
-  const Descriptor* input_type_;
-  const Descriptor* output_type_;
-  const MethodOptions* options_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<MethodDescriptor>() and AllocateArray<MethodDescriptor>() in
-  // descriptor.cc and update them to initialize the field.
-
-  // Must be constructed using DescriptorPool.
-  MethodDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class ServiceDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MethodDescriptor);
-};
-
-
-// Describes a whole .proto file.  To get the FileDescriptor for a compiled-in
-// file, get the descriptor for something defined in that file and call
-// descriptor->file().  Use DescriptorPool to construct your own descriptors.
-class LIBPROTOBUF_EXPORT FileDescriptor {
- public:
-  // The filename, relative to the source tree.
-  // e.g. "google/protobuf/descriptor.proto"
-  const string& name() const;
-
-  // The package, e.g. "google.protobuf.compiler".
-  const string& package() const;
-
-  // The DescriptorPool in which this FileDescriptor and all its contents were
-  // allocated.  Never NULL.
-  const DescriptorPool* pool() const;
-
-  // The number of files imported by this one.
-  int dependency_count() const;
-  // Gets an imported file by index, where 0 <= index < dependency_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FileDescriptor* dependency(int index) const;
-
-  // The number of files public imported by this one.
-  // The public dependency list is a subset of the dependency list.
-  int public_dependency_count() const;
-  // Gets a public imported file by index, where 0 <= index <
-  // public_dependency_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FileDescriptor* public_dependency(int index) const;
-
-  // The number of files that are imported for weak fields.
-  // The weak dependency list is a subset of the dependency list.
-  int weak_dependency_count() const;
-  // Gets a weak imported file by index, where 0 <= index <
-  // weak_dependency_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FileDescriptor* weak_dependency(int index) const;
-
-  // Number of top-level message types defined in this file.  (This does not
-  // include nested types.)
-  int message_type_count() const;
-  // Gets a top-level message type, where 0 <= index < message_type_count().
-  // These are returned in the order they were defined in the .proto file.
-  const Descriptor* message_type(int index) const;
-
-  // Number of top-level enum types defined in this file.  (This does not
-  // include nested types.)
-  int enum_type_count() const;
-  // Gets a top-level enum type, where 0 <= index < enum_type_count().
-  // These are returned in the order they were defined in the .proto file.
-  const EnumDescriptor* enum_type(int index) const;
-
-  // Number of services defined in this file.
-  int service_count() const;
-  // Gets a service, where 0 <= index < service_count().
-  // These are returned in the order they were defined in the .proto file.
-  const ServiceDescriptor* service(int index) const;
-
-  // Number of extensions defined at file scope.  (This does not include
-  // extensions nested within message types.)
-  int extension_count() const;
-  // Gets an extension's descriptor, where 0 <= index < extension_count().
-  // These are returned in the order they were defined in the .proto file.
-  const FieldDescriptor* extension(int index) const;
-
-  // Get options for this file.  These are specified in the .proto file by
-  // placing lines like "option foo = 1234;" at the top level, outside of any
-  // other definitions.  Allowed options are defined by FileOptions in
-  // google/protobuf/descriptor.proto, and any available extensions of that
-  // message.
-  const FileOptions& options() const;
-
-  // Find a top-level message type by name.  Returns NULL if not found.
-  const Descriptor* FindMessageTypeByName(const string& name) const;
-  // Find a top-level enum type by name.  Returns NULL if not found.
-  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
-  // Find an enum value defined in any top-level enum by name.  Returns NULL if
-  // not found.
-  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
-  // Find a service definition by name.  Returns NULL if not found.
-  const ServiceDescriptor* FindServiceByName(const string& name) const;
-  // Find a top-level extension definition by name.  Returns NULL if not found.
-  const FieldDescriptor* FindExtensionByName(const string& name) const;
-  // Similar to FindExtensionByName(), but searches by lowercased-name.  See
-  // Descriptor::FindFieldByLowercaseName().
-  const FieldDescriptor* FindExtensionByLowercaseName(const string& name) const;
-  // Similar to FindExtensionByName(), but searches by camelcased-name.  See
-  // Descriptor::FindFieldByCamelcaseName().
-  const FieldDescriptor* FindExtensionByCamelcaseName(const string& name) const;
-
-  // See Descriptor::CopyTo().
-  // Notes:
-  // - This method does NOT copy source code information since it is relatively
-  //   large and rarely needed.  See CopySourceCodeInfoTo() below.
-  void CopyTo(FileDescriptorProto* proto) const;
-  // Write the source code information of this FileDescriptor into the given
-  // FileDescriptorProto.  See CopyTo() above.
-  void CopySourceCodeInfoTo(FileDescriptorProto* proto) const;
-
-  // See Descriptor::DebugString().
-  string DebugString() const;
-
- private:
-  // Source Location ---------------------------------------------------
-
-  // Updates |*out_location| to the source location of the complete
-  // extent of the declaration or declaration-part denoted by |path|.
-  // Returns false and leaves |*out_location| unchanged iff location
-  // information was not available.  (See SourceCodeInfo for
-  // description of path encoding.)
-  bool GetSourceLocation(const vector<int>& path,
-                         SourceLocation* out_location) const;
-
-  typedef FileOptions OptionsType;
-
-  const string* name_;
-  const string* package_;
-  const DescriptorPool* pool_;
-  int dependency_count_;
-  const FileDescriptor** dependencies_;
-  int public_dependency_count_;
-  int* public_dependencies_;
-  int weak_dependency_count_;
-  int* weak_dependencies_;
-  int message_type_count_;
-  Descriptor* message_types_;
-  int enum_type_count_;
-  EnumDescriptor* enum_types_;
-  int service_count_;
-  ServiceDescriptor* services_;
-  int extension_count_;
-  FieldDescriptor* extensions_;
-  const FileOptions* options_;
-
-  const FileDescriptorTables* tables_;
-  const SourceCodeInfo* source_code_info_;
-  // IMPORTANT:  If you add a new field, make sure to search for all instances
-  // of Allocate<FileDescriptor>() and AllocateArray<FileDescriptor>() in
-  // descriptor.cc and update them to initialize the field.
-
-  FileDescriptor() {}
-  friend class DescriptorBuilder;
-  friend class Descriptor;
-  friend class FieldDescriptor;
-  friend class EnumDescriptor;
-  friend class EnumValueDescriptor;
-  friend class MethodDescriptor;
-  friend class ServiceDescriptor;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileDescriptor);
-};
-
-// ===================================================================
-
-// Used to construct descriptors.
-//
-// Normally you won't want to build your own descriptors.  Message classes
-// constructed by the protocol compiler will provide them for you.  However,
-// if you are implementing Message on your own, or if you are writing a
-// program which can operate on totally arbitrary types and needs to load
-// them from some sort of database, you might need to.
-//
-// Since Descriptors are composed of a whole lot of cross-linked bits of
-// data that would be a pain to put together manually, the
-// DescriptorPool class is provided to make the process easier.  It can
-// take a FileDescriptorProto (defined in descriptor.proto), validate it,
-// and convert it to a set of nicely cross-linked Descriptors.
-//
-// DescriptorPool also helps with memory management.  Descriptors are
-// composed of many objects containing static data and pointers to each
-// other.  In all likelihood, when it comes time to delete this data,
-// you'll want to delete it all at once.  In fact, it is not uncommon to
-// have a whole pool of descriptors all cross-linked with each other which
-// you wish to delete all at once.  This class represents such a pool, and
-// handles the memory management for you.
-//
-// You can also search for descriptors within a DescriptorPool by name, and
-// extensions by number.
-class LIBPROTOBUF_EXPORT DescriptorPool {
- public:
-  // Create a normal, empty DescriptorPool.
-  DescriptorPool();
-
-  // Constructs a DescriptorPool that, when it can't find something among the
-  // descriptors already in the pool, looks for it in the given
-  // DescriptorDatabase.
-  // Notes:
-  // - If a DescriptorPool is constructed this way, its BuildFile*() methods
-  //   must not be called (they will assert-fail).  The only way to populate
-  //   the pool with descriptors is to call the Find*By*() methods.
-  // - The Find*By*() methods may block the calling thread if the
-  //   DescriptorDatabase blocks.  This in turn means that parsing messages
-  //   may block if they need to look up extensions.
-  // - The Find*By*() methods will use mutexes for thread-safety, thus making
-  //   them slower even when they don't have to fall back to the database.
-  //   In fact, even the Find*By*() methods of descriptor objects owned by
-  //   this pool will be slower, since they will have to obtain locks too.
-  // - An ErrorCollector may optionally be given to collect validation errors
-  //   in files loaded from the database.  If not given, errors will be printed
-  //   to GOOGLE_LOG(ERROR).  Remember that files are built on-demand, so this
-  //   ErrorCollector may be called from any thread that calls one of the
-  //   Find*By*() methods.
-  class ErrorCollector;
-  explicit DescriptorPool(DescriptorDatabase* fallback_database,
-                          ErrorCollector* error_collector = NULL);
-
-  ~DescriptorPool();
-
-  // Get a pointer to the generated pool.  Generated protocol message classes
-  // which are compiled into the binary will allocate their descriptors in
-  // this pool.  Do not add your own descriptors to this pool.
-  static const DescriptorPool* generated_pool();
-
-  // Find a FileDescriptor in the pool by file name.  Returns NULL if not
-  // found.
-  const FileDescriptor* FindFileByName(const string& name) const;
-
-  // Find the FileDescriptor in the pool which defines the given symbol.
-  // If any of the Find*ByName() methods below would succeed, then this is
-  // equivalent to calling that method and calling the result's file() method.
-  // Otherwise this returns NULL.
-  const FileDescriptor* FindFileContainingSymbol(
-      const string& symbol_name) const;
-
-  // Looking up descriptors ------------------------------------------
-  // These find descriptors by fully-qualified name.  These will find both
-  // top-level descriptors and nested descriptors.  They return NULL if not
-  // found.
-
-  const Descriptor* FindMessageTypeByName(const string& name) const;
-  const FieldDescriptor* FindFieldByName(const string& name) const;
-  const FieldDescriptor* FindExtensionByName(const string& name) const;
-  const EnumDescriptor* FindEnumTypeByName(const string& name) const;
-  const EnumValueDescriptor* FindEnumValueByName(const string& name) const;
-  const ServiceDescriptor* FindServiceByName(const string& name) const;
-  const MethodDescriptor* FindMethodByName(const string& name) const;
-
-  // Finds an extension of the given type by number.  The extendee must be
-  // a member of this DescriptorPool or one of its underlays.
-  const FieldDescriptor* FindExtensionByNumber(const Descriptor* extendee,
-                                               int number) const;
-
-  // Finds extensions of extendee. The extensions will be appended to
-  // out in an undefined order. Only extensions defined directly in
-  // this DescriptorPool or one of its underlays are guaranteed to be
-  // found: extensions defined in the fallback database might not be found
-  // depending on the database implementation.
-  void FindAllExtensions(const Descriptor* extendee,
-                         vector<const FieldDescriptor*>* out) const;
-
-  // Building descriptors --------------------------------------------
-
-  // When converting a FileDescriptorProto to a FileDescriptor, various
-  // errors might be detected in the input.  The caller may handle these
-  // programmatically by implementing an ErrorCollector.
-  class LIBPROTOBUF_EXPORT ErrorCollector {
-   public:
-    inline ErrorCollector() {}
-    virtual ~ErrorCollector();
-
-    // These constants specify what exact part of the construct is broken.
-    // This is useful e.g. for mapping the error back to an exact location
-    // in a .proto file.
-    enum ErrorLocation {
-      NAME,              // the symbol name, or the package name for files
-      NUMBER,            // field or extension range number
-      TYPE,              // field type
-      EXTENDEE,          // field extendee
-      DEFAULT_VALUE,     // field default value
-      INPUT_TYPE,        // method input type
-      OUTPUT_TYPE,       // method output type
-      OPTION_NAME,       // name in assignment
-      OPTION_VALUE,      // value in option assignment
-      OTHER              // some other problem
-    };
-
-    // Reports an error in the FileDescriptorProto.
-    virtual void AddError(
-      const string& filename,      // File name in which the error occurred.
-      const string& element_name,  // Full name of the erroneous element.
-      const Message* descriptor,   // Descriptor of the erroneous element.
-      ErrorLocation location,      // One of the location constants, above.
-      const string& message        // Human-readable error message.
-      ) = 0;
-
-   private:
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ErrorCollector);
-  };
-
-  // Convert the FileDescriptorProto to real descriptors and place them in
-  // this DescriptorPool.  All dependencies of the file must already be in
-  // the pool.  Returns the resulting FileDescriptor, or NULL if there were
-  // problems with the input (e.g. the message was invalid, or dependencies
-  // were missing).  Details about the errors are written to GOOGLE_LOG(ERROR).
-  const FileDescriptor* BuildFile(const FileDescriptorProto& proto);
-
-  // Same as BuildFile() except errors are sent to the given ErrorCollector.
-  const FileDescriptor* BuildFileCollectingErrors(
-    const FileDescriptorProto& proto,
-    ErrorCollector* error_collector);
-
-  // By default, it is an error if a FileDescriptorProto contains references
-  // to types or other files that are not found in the DescriptorPool (or its
-  // backing DescriptorDatabase, if any).  If you call
-  // AllowUnknownDependencies(), however, then unknown types and files
-  // will be replaced by placeholder descriptors.  This can allow you to
-  // perform some useful operations with a .proto file even if you do not
-  // have access to other .proto files on which it depends.  However, some
-  // heuristics must be used to fill in the gaps in information, and these
-  // can lead to descriptors which are inaccurate.  For example, the
-  // DescriptorPool may be forced to guess whether an unknown type is a message
-  // or an enum, as well as what package it resides in.  Furthermore,
-  // placeholder types will not be discoverable via FindMessageTypeByName()
-  // and similar methods, which could confuse some descriptor-based algorithms.
-  // Generally, the results of this option should only be relied upon for
-  // debugging purposes.
-  void AllowUnknownDependencies() { allow_unknown_ = true; }
-
-  // Internal stuff --------------------------------------------------
-  // These methods MUST NOT be called from outside the proto2 library.
-  // These methods may contain hidden pitfalls and may be removed in a
-  // future library version.
-
-  // Create a DescriptorPool which is overlaid on top of some other pool.
-  // If you search for a descriptor in the overlay and it is not found, the
-  // underlay will be searched as a backup.  If the underlay has its own
-  // underlay, that will be searched next, and so on.  This also means that
-  // files built in the overlay will be cross-linked with the underlay's
-  // descriptors if necessary.  The underlay remains property of the caller;
-  // it must remain valid for the lifetime of the newly-constructed pool.
-  //
-  // Example:  Say you want to parse a .proto file at runtime in order to use
-  // its type with a DynamicMessage.  Say this .proto file has dependencies,
-  // but you know that all the dependencies will be things that are already
-  // compiled into the binary.  For ease of use, you'd like to load the types
-  // right out of generated_pool() rather than have to parse redundant copies
-  // of all these .protos and runtime.  But, you don't want to add the parsed
-  // types directly into generated_pool(): this is not allowed, and would be
-  // bad design anyway.  So, instead, you could use generated_pool() as an
-  // underlay for a new DescriptorPool in which you add only the new file.
-  //
-  // WARNING:  Use of underlays can lead to many subtle gotchas.  Instead,
-  //   try to formulate what you want to do in terms of DescriptorDatabases.
-  explicit DescriptorPool(const DescriptorPool* underlay);
-
-  // Called by generated classes at init time to add their descriptors to
-  // generated_pool.  Do NOT call this in your own code!  filename must be a
-  // permanent string (e.g. a string literal).
-  static void InternalAddGeneratedFile(
-      const void* encoded_file_descriptor, int size);
-
-
-  // For internal use only:  Gets a non-const pointer to the generated pool.
-  // This is called at static-initialization time only, so thread-safety is
-  // not a concern.  If both an underlay and a fallback database are present,
-  // the underlay takes precedence.
-  static DescriptorPool* internal_generated_pool();
-
-  // For internal use only:  Changes the behavior of BuildFile() such that it
-  // allows the file to make reference to message types declared in other files
-  // which it did not officially declare as dependencies.
-  void InternalDontEnforceDependencies();
-
-  // For internal use only.
-  void internal_set_underlay(const DescriptorPool* underlay) {
-    underlay_ = underlay;
-  }
-
-  // For internal (unit test) use only:  Returns true if a FileDescriptor has
-  // been constructed for the given file, false otherwise.  Useful for testing
-  // lazy descriptor initialization behavior.
-  bool InternalIsFileLoaded(const string& filename) const;
-
- private:
-  friend class Descriptor;
-  friend class FieldDescriptor;
-  friend class EnumDescriptor;
-  friend class ServiceDescriptor;
-  friend class FileDescriptor;
-  friend class DescriptorBuilder;
-
-  // Return true if the given name is a sub-symbol of any non-package
-  // descriptor that already exists in the descriptor pool.  (The full
-  // definition of such types is already known.)
-  bool IsSubSymbolOfBuiltType(const string& name) const;
-
-  // Tries to find something in the fallback database and link in the
-  // corresponding proto file.  Returns true if successful, in which case
-  // the caller should search for the thing again.  These are declared
-  // const because they are called by (semantically) const methods.
-  bool TryFindFileInFallbackDatabase(const string& name) const;
-  bool TryFindSymbolInFallbackDatabase(const string& name) const;
-  bool TryFindExtensionInFallbackDatabase(const Descriptor* containing_type,
-                                          int field_number) const;
-
-  // Like BuildFile() but called internally when the file has been loaded from
-  // fallback_database_.  Declared const because it is called by (semantically)
-  // const methods.
-  const FileDescriptor* BuildFileFromDatabase(
-    const FileDescriptorProto& proto) const;
-
-  // If fallback_database_ is NULL, this is NULL.  Otherwise, this is a mutex
-  // which must be locked while accessing tables_.
-  Mutex* mutex_;
-
-  // See constructor.
-  DescriptorDatabase* fallback_database_;
-  ErrorCollector* default_error_collector_;
-  const DescriptorPool* underlay_;
-
-  // This class contains a lot of hash maps with complicated types that
-  // we'd like to keep out of the header.
-  class Tables;
-  scoped_ptr<Tables> tables_;
-
-  bool enforce_dependencies_;
-  bool allow_unknown_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorPool);
-};
-
-// inline methods ====================================================
-
-// These macros makes this repetitive code more readable.
-#define PROTOBUF_DEFINE_ACCESSOR(CLASS, FIELD, TYPE) \
-  inline TYPE CLASS::FIELD() const { return FIELD##_; }
-
-// Strings fields are stored as pointers but returned as const references.
-#define PROTOBUF_DEFINE_STRING_ACCESSOR(CLASS, FIELD) \
-  inline const string& CLASS::FIELD() const { return *FIELD##_; }
-
-// Arrays take an index parameter, obviously.
-#define PROTOBUF_DEFINE_ARRAY_ACCESSOR(CLASS, FIELD, TYPE) \
-  inline TYPE CLASS::FIELD(int index) const { return FIELD##s_ + index; }
-
-#define PROTOBUF_DEFINE_OPTIONS_ACCESSOR(CLASS, TYPE) \
-  inline const TYPE& CLASS::options() const { return *options_; }
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(Descriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(Descriptor, full_name)
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, file, const FileDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, containing_type, const Descriptor*)
-
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, field_count, int)
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, nested_type_count, int)
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, enum_type_count, int)
-
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, field, const FieldDescriptor*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, nested_type, const Descriptor*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, enum_type, const EnumDescriptor*)
-
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, extension_range_count, int)
-PROTOBUF_DEFINE_ACCESSOR(Descriptor, extension_count, int)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, extension_range,
-                               const Descriptor::ExtensionRange*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(Descriptor, extension,
-                               const FieldDescriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(Descriptor, MessageOptions)
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, full_name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, lowercase_name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, camelcase_name)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, file, const FileDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, number, int)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, is_extension, bool)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, type, FieldDescriptor::Type)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, label, FieldDescriptor::Label)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, containing_type, const Descriptor*)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, extension_scope, const Descriptor*)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, message_type, const Descriptor*)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, enum_type, const EnumDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, experimental_map_key,
-                         const FieldDescriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(FieldDescriptor, FieldOptions)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, has_default_value, bool)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_int32 , int32 )
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_int64 , int64 )
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_uint32, uint32)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_uint64, uint64)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_float , float )
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_double, double)
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_bool  , bool  )
-PROTOBUF_DEFINE_ACCESSOR(FieldDescriptor, default_value_enum,
-                         const EnumValueDescriptor*)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FieldDescriptor, default_value_string)
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(EnumDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(EnumDescriptor, full_name)
-PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, file, const FileDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, containing_type, const Descriptor*)
-PROTOBUF_DEFINE_ACCESSOR(EnumDescriptor, value_count, int)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(EnumDescriptor, value,
-                               const EnumValueDescriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(EnumDescriptor, EnumOptions)
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(EnumValueDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(EnumValueDescriptor, full_name)
-PROTOBUF_DEFINE_ACCESSOR(EnumValueDescriptor, number, int)
-PROTOBUF_DEFINE_ACCESSOR(EnumValueDescriptor, type, const EnumDescriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(EnumValueDescriptor, EnumValueOptions)
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(ServiceDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(ServiceDescriptor, full_name)
-PROTOBUF_DEFINE_ACCESSOR(ServiceDescriptor, file, const FileDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(ServiceDescriptor, method_count, int)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(ServiceDescriptor, method,
-                               const MethodDescriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(ServiceDescriptor, ServiceOptions)
-
-PROTOBUF_DEFINE_STRING_ACCESSOR(MethodDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(MethodDescriptor, full_name)
-PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, service, const ServiceDescriptor*)
-PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, input_type, const Descriptor*)
-PROTOBUF_DEFINE_ACCESSOR(MethodDescriptor, output_type, const Descriptor*)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(MethodDescriptor, MethodOptions)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FileDescriptor, name)
-PROTOBUF_DEFINE_STRING_ACCESSOR(FileDescriptor, package)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, pool, const DescriptorPool*)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, dependency_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, public_dependency_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, weak_dependency_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, message_type_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, enum_type_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, service_count, int)
-PROTOBUF_DEFINE_ACCESSOR(FileDescriptor, extension_count, int)
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR(FileDescriptor, FileOptions)
-
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, message_type, const Descriptor*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, enum_type, const EnumDescriptor*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, service,
-                               const ServiceDescriptor*)
-PROTOBUF_DEFINE_ARRAY_ACCESSOR(FileDescriptor, extension,
-                               const FieldDescriptor*)
-
-#undef PROTOBUF_DEFINE_ACCESSOR
-#undef PROTOBUF_DEFINE_STRING_ACCESSOR
-#undef PROTOBUF_DEFINE_ARRAY_ACCESSOR
-
-// A few accessors differ from the macros...
-
-inline bool FieldDescriptor::is_required() const {
-  return label() == LABEL_REQUIRED;
-}
-
-inline bool FieldDescriptor::is_optional() const {
-  return label() == LABEL_OPTIONAL;
-}
-
-inline bool FieldDescriptor::is_repeated() const {
-  return label() == LABEL_REPEATED;
-}
-
-inline bool FieldDescriptor::is_packable() const {
-  return is_repeated() && IsTypePackable(type());
-}
-
-// To save space, index() is computed by looking at the descriptor's position
-// in the parent's array of children.
-inline int FieldDescriptor::index() const {
-  if (!is_extension_) {
-    return this - containing_type_->fields_;
-  } else if (extension_scope_ != NULL) {
-    return this - extension_scope_->extensions_;
-  } else {
-    return this - file_->extensions_;
-  }
-}
-
-inline int Descriptor::index() const {
-  if (containing_type_ == NULL) {
-    return this - file_->message_types_;
-  } else {
-    return this - containing_type_->nested_types_;
-  }
-}
-
-inline int EnumDescriptor::index() const {
-  if (containing_type_ == NULL) {
-    return this - file_->enum_types_;
-  } else {
-    return this - containing_type_->enum_types_;
-  }
-}
-
-inline int EnumValueDescriptor::index() const {
-  return this - type_->values_;
-}
-
-inline int ServiceDescriptor::index() const {
-  return this - file_->services_;
-}
-
-inline int MethodDescriptor::index() const {
-  return this - service_->methods_;
-}
-
-inline const char* FieldDescriptor::type_name() const {
-  return kTypeToName[type_];
-}
-
-inline FieldDescriptor::CppType FieldDescriptor::cpp_type() const {
-  return kTypeToCppTypeMap[type_];
-}
-
-inline const char* FieldDescriptor::cpp_type_name() const {
-  return kCppTypeToName[kTypeToCppTypeMap[type_]];
-}
-
-inline FieldDescriptor::CppType FieldDescriptor::TypeToCppType(Type type) {
-  return kTypeToCppTypeMap[type];
-}
-
-inline bool FieldDescriptor::IsTypePackable(Type field_type) {
-  return (field_type != FieldDescriptor::TYPE_STRING &&
-          field_type != FieldDescriptor::TYPE_GROUP &&
-          field_type != FieldDescriptor::TYPE_MESSAGE &&
-          field_type != FieldDescriptor::TYPE_BYTES);
-}
-
-inline const FileDescriptor* FileDescriptor::dependency(int index) const {
-  return dependencies_[index];
-}
-
-inline const FileDescriptor* FileDescriptor::public_dependency(
-    int index) const {
-  return dependencies_[public_dependencies_[index]];
-}
-
-inline const FileDescriptor* FileDescriptor::weak_dependency(
-    int index) const {
-  return dependencies_[weak_dependencies_[index]];
-}
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_DESCRIPTOR_H__
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.pb.h b/ps-lite/deps/include/google/protobuf/descriptor.pb.h
deleted file mode 100644
index 07cf8077..00000000
--- a/ps-lite/deps/include/google/protobuf/descriptor.pb.h
+++ /dev/null
@@ -1,5992 +0,0 @@
-// Generated by the protocol buffer compiler.  DO NOT EDIT!
-// source: google/protobuf/descriptor.proto
-
-#ifndef PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
-#define PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
-
-#include <string>
-
-#include <google/protobuf/stubs/common.h>
-
-#if GOOGLE_PROTOBUF_VERSION < 2005000
-#error This file was generated by a newer version of protoc which is
-#error incompatible with your Protocol Buffer headers.  Please update
-#error your headers.
-#endif
-#if 2005000 < GOOGLE_PROTOBUF_MIN_PROTOC_VERSION
-#error This file was generated by an older version of protoc which is
-#error incompatible with your Protocol Buffer headers.  Please
-#error regenerate this file with a newer version of protoc.
-#endif
-
-#include <google/protobuf/generated_message_util.h>
-#include <google/protobuf/message.h>
-#include <google/protobuf/repeated_field.h>
-#include <google/protobuf/extension_set.h>
-#include <google/protobuf/generated_enum_reflection.h>
-#include <google/protobuf/unknown_field_set.h>
-// @@protoc_insertion_point(includes)
-
-namespace google {
-namespace protobuf {
-
-// Internal implementation detail -- do not call these.
-void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-class FileDescriptorSet;
-class FileDescriptorProto;
-class DescriptorProto;
-class DescriptorProto_ExtensionRange;
-class FieldDescriptorProto;
-class EnumDescriptorProto;
-class EnumValueDescriptorProto;
-class ServiceDescriptorProto;
-class MethodDescriptorProto;
-class FileOptions;
-class MessageOptions;
-class FieldOptions;
-class EnumOptions;
-class EnumValueOptions;
-class ServiceOptions;
-class MethodOptions;
-class UninterpretedOption;
-class UninterpretedOption_NamePart;
-class SourceCodeInfo;
-class SourceCodeInfo_Location;
-
-enum FieldDescriptorProto_Type {
-  FieldDescriptorProto_Type_TYPE_DOUBLE = 1,
-  FieldDescriptorProto_Type_TYPE_FLOAT = 2,
-  FieldDescriptorProto_Type_TYPE_INT64 = 3,
-  FieldDescriptorProto_Type_TYPE_UINT64 = 4,
-  FieldDescriptorProto_Type_TYPE_INT32 = 5,
-  FieldDescriptorProto_Type_TYPE_FIXED64 = 6,
-  FieldDescriptorProto_Type_TYPE_FIXED32 = 7,
-  FieldDescriptorProto_Type_TYPE_BOOL = 8,
-  FieldDescriptorProto_Type_TYPE_STRING = 9,
-  FieldDescriptorProto_Type_TYPE_GROUP = 10,
-  FieldDescriptorProto_Type_TYPE_MESSAGE = 11,
-  FieldDescriptorProto_Type_TYPE_BYTES = 12,
-  FieldDescriptorProto_Type_TYPE_UINT32 = 13,
-  FieldDescriptorProto_Type_TYPE_ENUM = 14,
-  FieldDescriptorProto_Type_TYPE_SFIXED32 = 15,
-  FieldDescriptorProto_Type_TYPE_SFIXED64 = 16,
-  FieldDescriptorProto_Type_TYPE_SINT32 = 17,
-  FieldDescriptorProto_Type_TYPE_SINT64 = 18
-};
-LIBPROTOBUF_EXPORT bool FieldDescriptorProto_Type_IsValid(int value);
-const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MIN = FieldDescriptorProto_Type_TYPE_DOUBLE;
-const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MAX = FieldDescriptorProto_Type_TYPE_SINT64;
-const int FieldDescriptorProto_Type_Type_ARRAYSIZE = FieldDescriptorProto_Type_Type_MAX + 1;
-
-LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldDescriptorProto_Type_descriptor();
-inline const ::std::string& FieldDescriptorProto_Type_Name(FieldDescriptorProto_Type value) {
-  return ::google::protobuf::internal::NameOfEnum(
-    FieldDescriptorProto_Type_descriptor(), value);
-}
-inline bool FieldDescriptorProto_Type_Parse(
-    const ::std::string& name, FieldDescriptorProto_Type* value) {
-  return ::google::protobuf::internal::ParseNamedEnum<FieldDescriptorProto_Type>(
-    FieldDescriptorProto_Type_descriptor(), name, value);
-}
-enum FieldDescriptorProto_Label {
-  FieldDescriptorProto_Label_LABEL_OPTIONAL = 1,
-  FieldDescriptorProto_Label_LABEL_REQUIRED = 2,
-  FieldDescriptorProto_Label_LABEL_REPEATED = 3
-};
-LIBPROTOBUF_EXPORT bool FieldDescriptorProto_Label_IsValid(int value);
-const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MIN = FieldDescriptorProto_Label_LABEL_OPTIONAL;
-const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MAX = FieldDescriptorProto_Label_LABEL_REPEATED;
-const int FieldDescriptorProto_Label_Label_ARRAYSIZE = FieldDescriptorProto_Label_Label_MAX + 1;
-
-LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldDescriptorProto_Label_descriptor();
-inline const ::std::string& FieldDescriptorProto_Label_Name(FieldDescriptorProto_Label value) {
-  return ::google::protobuf::internal::NameOfEnum(
-    FieldDescriptorProto_Label_descriptor(), value);
-}
-inline bool FieldDescriptorProto_Label_Parse(
-    const ::std::string& name, FieldDescriptorProto_Label* value) {
-  return ::google::protobuf::internal::ParseNamedEnum<FieldDescriptorProto_Label>(
-    FieldDescriptorProto_Label_descriptor(), name, value);
-}
-enum FileOptions_OptimizeMode {
-  FileOptions_OptimizeMode_SPEED = 1,
-  FileOptions_OptimizeMode_CODE_SIZE = 2,
-  FileOptions_OptimizeMode_LITE_RUNTIME = 3
-};
-LIBPROTOBUF_EXPORT bool FileOptions_OptimizeMode_IsValid(int value);
-const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MIN = FileOptions_OptimizeMode_SPEED;
-const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MAX = FileOptions_OptimizeMode_LITE_RUNTIME;
-const int FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE = FileOptions_OptimizeMode_OptimizeMode_MAX + 1;
-
-LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FileOptions_OptimizeMode_descriptor();
-inline const ::std::string& FileOptions_OptimizeMode_Name(FileOptions_OptimizeMode value) {
-  return ::google::protobuf::internal::NameOfEnum(
-    FileOptions_OptimizeMode_descriptor(), value);
-}
-inline bool FileOptions_OptimizeMode_Parse(
-    const ::std::string& name, FileOptions_OptimizeMode* value) {
-  return ::google::protobuf::internal::ParseNamedEnum<FileOptions_OptimizeMode>(
-    FileOptions_OptimizeMode_descriptor(), name, value);
-}
-enum FieldOptions_CType {
-  FieldOptions_CType_STRING = 0,
-  FieldOptions_CType_CORD = 1,
-  FieldOptions_CType_STRING_PIECE = 2
-};
-LIBPROTOBUF_EXPORT bool FieldOptions_CType_IsValid(int value);
-const FieldOptions_CType FieldOptions_CType_CType_MIN = FieldOptions_CType_STRING;
-const FieldOptions_CType FieldOptions_CType_CType_MAX = FieldOptions_CType_STRING_PIECE;
-const int FieldOptions_CType_CType_ARRAYSIZE = FieldOptions_CType_CType_MAX + 1;
-
-LIBPROTOBUF_EXPORT const ::google::protobuf::EnumDescriptor* FieldOptions_CType_descriptor();
-inline const ::std::string& FieldOptions_CType_Name(FieldOptions_CType value) {
-  return ::google::protobuf::internal::NameOfEnum(
-    FieldOptions_CType_descriptor(), value);
-}
-inline bool FieldOptions_CType_Parse(
-    const ::std::string& name, FieldOptions_CType* value) {
-  return ::google::protobuf::internal::ParseNamedEnum<FieldOptions_CType>(
-    FieldOptions_CType_descriptor(), name, value);
-}
-// ===================================================================
-
-class LIBPROTOBUF_EXPORT FileDescriptorSet : public ::google::protobuf::Message {
- public:
-  FileDescriptorSet();
-  virtual ~FileDescriptorSet();
-
-  FileDescriptorSet(const FileDescriptorSet& from);
-
-  inline FileDescriptorSet& operator=(const FileDescriptorSet& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const FileDescriptorSet& default_instance();
-
-  void Swap(FileDescriptorSet* other);
-
-  // implements Message ----------------------------------------------
-
-  FileDescriptorSet* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const FileDescriptorSet& from);
-  void MergeFrom(const FileDescriptorSet& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.FileDescriptorProto file = 1;
-  inline int file_size() const;
-  inline void clear_file();
-  static const int kFileFieldNumber = 1;
-  inline const ::google::protobuf::FileDescriptorProto& file(int index) const;
-  inline ::google::protobuf::FileDescriptorProto* mutable_file(int index);
-  inline ::google::protobuf::FileDescriptorProto* add_file();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
-      file() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
-      mutable_file();
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.FileDescriptorSet)
- private:
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > file_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static FileDescriptorSet* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT FileDescriptorProto : public ::google::protobuf::Message {
- public:
-  FileDescriptorProto();
-  virtual ~FileDescriptorProto();
-
-  FileDescriptorProto(const FileDescriptorProto& from);
-
-  inline FileDescriptorProto& operator=(const FileDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const FileDescriptorProto& default_instance();
-
-  void Swap(FileDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  FileDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const FileDescriptorProto& from);
-  void MergeFrom(const FileDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // optional string package = 2;
-  inline bool has_package() const;
-  inline void clear_package();
-  static const int kPackageFieldNumber = 2;
-  inline const ::std::string& package() const;
-  inline void set_package(const ::std::string& value);
-  inline void set_package(const char* value);
-  inline void set_package(const char* value, size_t size);
-  inline ::std::string* mutable_package();
-  inline ::std::string* release_package();
-  inline void set_allocated_package(::std::string* package);
-
-  // repeated string dependency = 3;
-  inline int dependency_size() const;
-  inline void clear_dependency();
-  static const int kDependencyFieldNumber = 3;
-  inline const ::std::string& dependency(int index) const;
-  inline ::std::string* mutable_dependency(int index);
-  inline void set_dependency(int index, const ::std::string& value);
-  inline void set_dependency(int index, const char* value);
-  inline void set_dependency(int index, const char* value, size_t size);
-  inline ::std::string* add_dependency();
-  inline void add_dependency(const ::std::string& value);
-  inline void add_dependency(const char* value);
-  inline void add_dependency(const char* value, size_t size);
-  inline const ::google::protobuf::RepeatedPtrField< ::std::string>& dependency() const;
-  inline ::google::protobuf::RepeatedPtrField< ::std::string>* mutable_dependency();
-
-  // repeated int32 public_dependency = 10;
-  inline int public_dependency_size() const;
-  inline void clear_public_dependency();
-  static const int kPublicDependencyFieldNumber = 10;
-  inline ::google::protobuf::int32 public_dependency(int index) const;
-  inline void set_public_dependency(int index, ::google::protobuf::int32 value);
-  inline void add_public_dependency(::google::protobuf::int32 value);
-  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-      public_dependency() const;
-  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-      mutable_public_dependency();
-
-  // repeated int32 weak_dependency = 11;
-  inline int weak_dependency_size() const;
-  inline void clear_weak_dependency();
-  static const int kWeakDependencyFieldNumber = 11;
-  inline ::google::protobuf::int32 weak_dependency(int index) const;
-  inline void set_weak_dependency(int index, ::google::protobuf::int32 value);
-  inline void add_weak_dependency(::google::protobuf::int32 value);
-  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-      weak_dependency() const;
-  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-      mutable_weak_dependency();
-
-  // repeated .google.protobuf.DescriptorProto message_type = 4;
-  inline int message_type_size() const;
-  inline void clear_message_type();
-  static const int kMessageTypeFieldNumber = 4;
-  inline const ::google::protobuf::DescriptorProto& message_type(int index) const;
-  inline ::google::protobuf::DescriptorProto* mutable_message_type(int index);
-  inline ::google::protobuf::DescriptorProto* add_message_type();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
-      message_type() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
-      mutable_message_type();
-
-  // repeated .google.protobuf.EnumDescriptorProto enum_type = 5;
-  inline int enum_type_size() const;
-  inline void clear_enum_type();
-  static const int kEnumTypeFieldNumber = 5;
-  inline const ::google::protobuf::EnumDescriptorProto& enum_type(int index) const;
-  inline ::google::protobuf::EnumDescriptorProto* mutable_enum_type(int index);
-  inline ::google::protobuf::EnumDescriptorProto* add_enum_type();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
-      enum_type() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
-      mutable_enum_type();
-
-  // repeated .google.protobuf.ServiceDescriptorProto service = 6;
-  inline int service_size() const;
-  inline void clear_service();
-  static const int kServiceFieldNumber = 6;
-  inline const ::google::protobuf::ServiceDescriptorProto& service(int index) const;
-  inline ::google::protobuf::ServiceDescriptorProto* mutable_service(int index);
-  inline ::google::protobuf::ServiceDescriptorProto* add_service();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >&
-      service() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >*
-      mutable_service();
-
-  // repeated .google.protobuf.FieldDescriptorProto extension = 7;
-  inline int extension_size() const;
-  inline void clear_extension();
-  static const int kExtensionFieldNumber = 7;
-  inline const ::google::protobuf::FieldDescriptorProto& extension(int index) const;
-  inline ::google::protobuf::FieldDescriptorProto* mutable_extension(int index);
-  inline ::google::protobuf::FieldDescriptorProto* add_extension();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-      extension() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-      mutable_extension();
-
-  // optional .google.protobuf.FileOptions options = 8;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 8;
-  inline const ::google::protobuf::FileOptions& options() const;
-  inline ::google::protobuf::FileOptions* mutable_options();
-  inline ::google::protobuf::FileOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::FileOptions* options);
-
-  // optional .google.protobuf.SourceCodeInfo source_code_info = 9;
-  inline bool has_source_code_info() const;
-  inline void clear_source_code_info();
-  static const int kSourceCodeInfoFieldNumber = 9;
-  inline const ::google::protobuf::SourceCodeInfo& source_code_info() const;
-  inline ::google::protobuf::SourceCodeInfo* mutable_source_code_info();
-  inline ::google::protobuf::SourceCodeInfo* release_source_code_info();
-  inline void set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.FileDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_package();
-  inline void clear_has_package();
-  inline void set_has_options();
-  inline void clear_has_options();
-  inline void set_has_source_code_info();
-  inline void clear_has_source_code_info();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::std::string* package_;
-  ::google::protobuf::RepeatedPtrField< ::std::string> dependency_;
-  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > public_dependency_;
-  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > weak_dependency_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > message_type_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto > service_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;
-  ::google::protobuf::FileOptions* options_;
-  ::google::protobuf::SourceCodeInfo* source_code_info_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(11 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static FileDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT DescriptorProto_ExtensionRange : public ::google::protobuf::Message {
- public:
-  DescriptorProto_ExtensionRange();
-  virtual ~DescriptorProto_ExtensionRange();
-
-  DescriptorProto_ExtensionRange(const DescriptorProto_ExtensionRange& from);
-
-  inline DescriptorProto_ExtensionRange& operator=(const DescriptorProto_ExtensionRange& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const DescriptorProto_ExtensionRange& default_instance();
-
-  void Swap(DescriptorProto_ExtensionRange* other);
-
-  // implements Message ----------------------------------------------
-
-  DescriptorProto_ExtensionRange* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const DescriptorProto_ExtensionRange& from);
-  void MergeFrom(const DescriptorProto_ExtensionRange& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional int32 start = 1;
-  inline bool has_start() const;
-  inline void clear_start();
-  static const int kStartFieldNumber = 1;
-  inline ::google::protobuf::int32 start() const;
-  inline void set_start(::google::protobuf::int32 value);
-
-  // optional int32 end = 2;
-  inline bool has_end() const;
-  inline void clear_end();
-  static const int kEndFieldNumber = 2;
-  inline ::google::protobuf::int32 end() const;
-  inline void set_end(::google::protobuf::int32 value);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.DescriptorProto.ExtensionRange)
- private:
-  inline void set_has_start();
-  inline void clear_has_start();
-  inline void set_has_end();
-  inline void clear_has_end();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::int32 start_;
-  ::google::protobuf::int32 end_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static DescriptorProto_ExtensionRange* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT DescriptorProto : public ::google::protobuf::Message {
- public:
-  DescriptorProto();
-  virtual ~DescriptorProto();
-
-  DescriptorProto(const DescriptorProto& from);
-
-  inline DescriptorProto& operator=(const DescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const DescriptorProto& default_instance();
-
-  void Swap(DescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  DescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const DescriptorProto& from);
-  void MergeFrom(const DescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef DescriptorProto_ExtensionRange ExtensionRange;
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // repeated .google.protobuf.FieldDescriptorProto field = 2;
-  inline int field_size() const;
-  inline void clear_field();
-  static const int kFieldFieldNumber = 2;
-  inline const ::google::protobuf::FieldDescriptorProto& field(int index) const;
-  inline ::google::protobuf::FieldDescriptorProto* mutable_field(int index);
-  inline ::google::protobuf::FieldDescriptorProto* add_field();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-      field() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-      mutable_field();
-
-  // repeated .google.protobuf.FieldDescriptorProto extension = 6;
-  inline int extension_size() const;
-  inline void clear_extension();
-  static const int kExtensionFieldNumber = 6;
-  inline const ::google::protobuf::FieldDescriptorProto& extension(int index) const;
-  inline ::google::protobuf::FieldDescriptorProto* mutable_extension(int index);
-  inline ::google::protobuf::FieldDescriptorProto* add_extension();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-      extension() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-      mutable_extension();
-
-  // repeated .google.protobuf.DescriptorProto nested_type = 3;
-  inline int nested_type_size() const;
-  inline void clear_nested_type();
-  static const int kNestedTypeFieldNumber = 3;
-  inline const ::google::protobuf::DescriptorProto& nested_type(int index) const;
-  inline ::google::protobuf::DescriptorProto* mutable_nested_type(int index);
-  inline ::google::protobuf::DescriptorProto* add_nested_type();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
-      nested_type() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
-      mutable_nested_type();
-
-  // repeated .google.protobuf.EnumDescriptorProto enum_type = 4;
-  inline int enum_type_size() const;
-  inline void clear_enum_type();
-  static const int kEnumTypeFieldNumber = 4;
-  inline const ::google::protobuf::EnumDescriptorProto& enum_type(int index) const;
-  inline ::google::protobuf::EnumDescriptorProto* mutable_enum_type(int index);
-  inline ::google::protobuf::EnumDescriptorProto* add_enum_type();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
-      enum_type() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
-      mutable_enum_type();
-
-  // repeated .google.protobuf.DescriptorProto.ExtensionRange extension_range = 5;
-  inline int extension_range_size() const;
-  inline void clear_extension_range();
-  static const int kExtensionRangeFieldNumber = 5;
-  inline const ::google::protobuf::DescriptorProto_ExtensionRange& extension_range(int index) const;
-  inline ::google::protobuf::DescriptorProto_ExtensionRange* mutable_extension_range(int index);
-  inline ::google::protobuf::DescriptorProto_ExtensionRange* add_extension_range();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >&
-      extension_range() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >*
-      mutable_extension_range();
-
-  // optional .google.protobuf.MessageOptions options = 7;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 7;
-  inline const ::google::protobuf::MessageOptions& options() const;
-  inline ::google::protobuf::MessageOptions* mutable_options();
-  inline ::google::protobuf::MessageOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::MessageOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.DescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > field_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > nested_type_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange > extension_range_;
-  ::google::protobuf::MessageOptions* options_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static DescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT FieldDescriptorProto : public ::google::protobuf::Message {
- public:
-  FieldDescriptorProto();
-  virtual ~FieldDescriptorProto();
-
-  FieldDescriptorProto(const FieldDescriptorProto& from);
-
-  inline FieldDescriptorProto& operator=(const FieldDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const FieldDescriptorProto& default_instance();
-
-  void Swap(FieldDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  FieldDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const FieldDescriptorProto& from);
-  void MergeFrom(const FieldDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef FieldDescriptorProto_Type Type;
-  static const Type TYPE_DOUBLE = FieldDescriptorProto_Type_TYPE_DOUBLE;
-  static const Type TYPE_FLOAT = FieldDescriptorProto_Type_TYPE_FLOAT;
-  static const Type TYPE_INT64 = FieldDescriptorProto_Type_TYPE_INT64;
-  static const Type TYPE_UINT64 = FieldDescriptorProto_Type_TYPE_UINT64;
-  static const Type TYPE_INT32 = FieldDescriptorProto_Type_TYPE_INT32;
-  static const Type TYPE_FIXED64 = FieldDescriptorProto_Type_TYPE_FIXED64;
-  static const Type TYPE_FIXED32 = FieldDescriptorProto_Type_TYPE_FIXED32;
-  static const Type TYPE_BOOL = FieldDescriptorProto_Type_TYPE_BOOL;
-  static const Type TYPE_STRING = FieldDescriptorProto_Type_TYPE_STRING;
-  static const Type TYPE_GROUP = FieldDescriptorProto_Type_TYPE_GROUP;
-  static const Type TYPE_MESSAGE = FieldDescriptorProto_Type_TYPE_MESSAGE;
-  static const Type TYPE_BYTES = FieldDescriptorProto_Type_TYPE_BYTES;
-  static const Type TYPE_UINT32 = FieldDescriptorProto_Type_TYPE_UINT32;
-  static const Type TYPE_ENUM = FieldDescriptorProto_Type_TYPE_ENUM;
-  static const Type TYPE_SFIXED32 = FieldDescriptorProto_Type_TYPE_SFIXED32;
-  static const Type TYPE_SFIXED64 = FieldDescriptorProto_Type_TYPE_SFIXED64;
-  static const Type TYPE_SINT32 = FieldDescriptorProto_Type_TYPE_SINT32;
-  static const Type TYPE_SINT64 = FieldDescriptorProto_Type_TYPE_SINT64;
-  static inline bool Type_IsValid(int value) {
-    return FieldDescriptorProto_Type_IsValid(value);
-  }
-  static const Type Type_MIN =
-    FieldDescriptorProto_Type_Type_MIN;
-  static const Type Type_MAX =
-    FieldDescriptorProto_Type_Type_MAX;
-  static const int Type_ARRAYSIZE =
-    FieldDescriptorProto_Type_Type_ARRAYSIZE;
-  static inline const ::google::protobuf::EnumDescriptor*
-  Type_descriptor() {
-    return FieldDescriptorProto_Type_descriptor();
-  }
-  static inline const ::std::string& Type_Name(Type value) {
-    return FieldDescriptorProto_Type_Name(value);
-  }
-  static inline bool Type_Parse(const ::std::string& name,
-      Type* value) {
-    return FieldDescriptorProto_Type_Parse(name, value);
-  }
-
-  typedef FieldDescriptorProto_Label Label;
-  static const Label LABEL_OPTIONAL = FieldDescriptorProto_Label_LABEL_OPTIONAL;
-  static const Label LABEL_REQUIRED = FieldDescriptorProto_Label_LABEL_REQUIRED;
-  static const Label LABEL_REPEATED = FieldDescriptorProto_Label_LABEL_REPEATED;
-  static inline bool Label_IsValid(int value) {
-    return FieldDescriptorProto_Label_IsValid(value);
-  }
-  static const Label Label_MIN =
-    FieldDescriptorProto_Label_Label_MIN;
-  static const Label Label_MAX =
-    FieldDescriptorProto_Label_Label_MAX;
-  static const int Label_ARRAYSIZE =
-    FieldDescriptorProto_Label_Label_ARRAYSIZE;
-  static inline const ::google::protobuf::EnumDescriptor*
-  Label_descriptor() {
-    return FieldDescriptorProto_Label_descriptor();
-  }
-  static inline const ::std::string& Label_Name(Label value) {
-    return FieldDescriptorProto_Label_Name(value);
-  }
-  static inline bool Label_Parse(const ::std::string& name,
-      Label* value) {
-    return FieldDescriptorProto_Label_Parse(name, value);
-  }
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // optional int32 number = 3;
-  inline bool has_number() const;
-  inline void clear_number();
-  static const int kNumberFieldNumber = 3;
-  inline ::google::protobuf::int32 number() const;
-  inline void set_number(::google::protobuf::int32 value);
-
-  // optional .google.protobuf.FieldDescriptorProto.Label label = 4;
-  inline bool has_label() const;
-  inline void clear_label();
-  static const int kLabelFieldNumber = 4;
-  inline ::google::protobuf::FieldDescriptorProto_Label label() const;
-  inline void set_label(::google::protobuf::FieldDescriptorProto_Label value);
-
-  // optional .google.protobuf.FieldDescriptorProto.Type type = 5;
-  inline bool has_type() const;
-  inline void clear_type();
-  static const int kTypeFieldNumber = 5;
-  inline ::google::protobuf::FieldDescriptorProto_Type type() const;
-  inline void set_type(::google::protobuf::FieldDescriptorProto_Type value);
-
-  // optional string type_name = 6;
-  inline bool has_type_name() const;
-  inline void clear_type_name();
-  static const int kTypeNameFieldNumber = 6;
-  inline const ::std::string& type_name() const;
-  inline void set_type_name(const ::std::string& value);
-  inline void set_type_name(const char* value);
-  inline void set_type_name(const char* value, size_t size);
-  inline ::std::string* mutable_type_name();
-  inline ::std::string* release_type_name();
-  inline void set_allocated_type_name(::std::string* type_name);
-
-  // optional string extendee = 2;
-  inline bool has_extendee() const;
-  inline void clear_extendee();
-  static const int kExtendeeFieldNumber = 2;
-  inline const ::std::string& extendee() const;
-  inline void set_extendee(const ::std::string& value);
-  inline void set_extendee(const char* value);
-  inline void set_extendee(const char* value, size_t size);
-  inline ::std::string* mutable_extendee();
-  inline ::std::string* release_extendee();
-  inline void set_allocated_extendee(::std::string* extendee);
-
-  // optional string default_value = 7;
-  inline bool has_default_value() const;
-  inline void clear_default_value();
-  static const int kDefaultValueFieldNumber = 7;
-  inline const ::std::string& default_value() const;
-  inline void set_default_value(const ::std::string& value);
-  inline void set_default_value(const char* value);
-  inline void set_default_value(const char* value, size_t size);
-  inline ::std::string* mutable_default_value();
-  inline ::std::string* release_default_value();
-  inline void set_allocated_default_value(::std::string* default_value);
-
-  // optional .google.protobuf.FieldOptions options = 8;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 8;
-  inline const ::google::protobuf::FieldOptions& options() const;
-  inline ::google::protobuf::FieldOptions* mutable_options();
-  inline ::google::protobuf::FieldOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::FieldOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.FieldDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_number();
-  inline void clear_has_number();
-  inline void set_has_label();
-  inline void clear_has_label();
-  inline void set_has_type();
-  inline void clear_has_type();
-  inline void set_has_type_name();
-  inline void clear_has_type_name();
-  inline void set_has_extendee();
-  inline void clear_has_extendee();
-  inline void set_has_default_value();
-  inline void clear_has_default_value();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::google::protobuf::int32 number_;
-  int label_;
-  ::std::string* type_name_;
-  ::std::string* extendee_;
-  ::std::string* default_value_;
-  ::google::protobuf::FieldOptions* options_;
-  int type_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(8 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static FieldDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT EnumDescriptorProto : public ::google::protobuf::Message {
- public:
-  EnumDescriptorProto();
-  virtual ~EnumDescriptorProto();
-
-  EnumDescriptorProto(const EnumDescriptorProto& from);
-
-  inline EnumDescriptorProto& operator=(const EnumDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const EnumDescriptorProto& default_instance();
-
-  void Swap(EnumDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  EnumDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const EnumDescriptorProto& from);
-  void MergeFrom(const EnumDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // repeated .google.protobuf.EnumValueDescriptorProto value = 2;
-  inline int value_size() const;
-  inline void clear_value();
-  static const int kValueFieldNumber = 2;
-  inline const ::google::protobuf::EnumValueDescriptorProto& value(int index) const;
-  inline ::google::protobuf::EnumValueDescriptorProto* mutable_value(int index);
-  inline ::google::protobuf::EnumValueDescriptorProto* add_value();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >&
-      value() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >*
-      mutable_value();
-
-  // optional .google.protobuf.EnumOptions options = 3;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 3;
-  inline const ::google::protobuf::EnumOptions& options() const;
-  inline ::google::protobuf::EnumOptions* mutable_options();
-  inline ::google::protobuf::EnumOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::EnumOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.EnumDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto > value_;
-  ::google::protobuf::EnumOptions* options_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static EnumDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT EnumValueDescriptorProto : public ::google::protobuf::Message {
- public:
-  EnumValueDescriptorProto();
-  virtual ~EnumValueDescriptorProto();
-
-  EnumValueDescriptorProto(const EnumValueDescriptorProto& from);
-
-  inline EnumValueDescriptorProto& operator=(const EnumValueDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const EnumValueDescriptorProto& default_instance();
-
-  void Swap(EnumValueDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  EnumValueDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const EnumValueDescriptorProto& from);
-  void MergeFrom(const EnumValueDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // optional int32 number = 2;
-  inline bool has_number() const;
-  inline void clear_number();
-  static const int kNumberFieldNumber = 2;
-  inline ::google::protobuf::int32 number() const;
-  inline void set_number(::google::protobuf::int32 value);
-
-  // optional .google.protobuf.EnumValueOptions options = 3;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 3;
-  inline const ::google::protobuf::EnumValueOptions& options() const;
-  inline ::google::protobuf::EnumValueOptions* mutable_options();
-  inline ::google::protobuf::EnumValueOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::EnumValueOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.EnumValueDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_number();
-  inline void clear_has_number();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::google::protobuf::EnumValueOptions* options_;
-  ::google::protobuf::int32 number_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static EnumValueDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT ServiceDescriptorProto : public ::google::protobuf::Message {
- public:
-  ServiceDescriptorProto();
-  virtual ~ServiceDescriptorProto();
-
-  ServiceDescriptorProto(const ServiceDescriptorProto& from);
-
-  inline ServiceDescriptorProto& operator=(const ServiceDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const ServiceDescriptorProto& default_instance();
-
-  void Swap(ServiceDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  ServiceDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const ServiceDescriptorProto& from);
-  void MergeFrom(const ServiceDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // repeated .google.protobuf.MethodDescriptorProto method = 2;
-  inline int method_size() const;
-  inline void clear_method();
-  static const int kMethodFieldNumber = 2;
-  inline const ::google::protobuf::MethodDescriptorProto& method(int index) const;
-  inline ::google::protobuf::MethodDescriptorProto* mutable_method(int index);
-  inline ::google::protobuf::MethodDescriptorProto* add_method();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >&
-      method() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >*
-      mutable_method();
-
-  // optional .google.protobuf.ServiceOptions options = 3;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 3;
-  inline const ::google::protobuf::ServiceOptions& options() const;
-  inline ::google::protobuf::ServiceOptions* mutable_options();
-  inline ::google::protobuf::ServiceOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::ServiceOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.ServiceDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto > method_;
-  ::google::protobuf::ServiceOptions* options_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static ServiceDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT MethodDescriptorProto : public ::google::protobuf::Message {
- public:
-  MethodDescriptorProto();
-  virtual ~MethodDescriptorProto();
-
-  MethodDescriptorProto(const MethodDescriptorProto& from);
-
-  inline MethodDescriptorProto& operator=(const MethodDescriptorProto& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const MethodDescriptorProto& default_instance();
-
-  void Swap(MethodDescriptorProto* other);
-
-  // implements Message ----------------------------------------------
-
-  MethodDescriptorProto* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const MethodDescriptorProto& from);
-  void MergeFrom(const MethodDescriptorProto& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional string name = 1;
-  inline bool has_name() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 1;
-  inline const ::std::string& name() const;
-  inline void set_name(const ::std::string& value);
-  inline void set_name(const char* value);
-  inline void set_name(const char* value, size_t size);
-  inline ::std::string* mutable_name();
-  inline ::std::string* release_name();
-  inline void set_allocated_name(::std::string* name);
-
-  // optional string input_type = 2;
-  inline bool has_input_type() const;
-  inline void clear_input_type();
-  static const int kInputTypeFieldNumber = 2;
-  inline const ::std::string& input_type() const;
-  inline void set_input_type(const ::std::string& value);
-  inline void set_input_type(const char* value);
-  inline void set_input_type(const char* value, size_t size);
-  inline ::std::string* mutable_input_type();
-  inline ::std::string* release_input_type();
-  inline void set_allocated_input_type(::std::string* input_type);
-
-  // optional string output_type = 3;
-  inline bool has_output_type() const;
-  inline void clear_output_type();
-  static const int kOutputTypeFieldNumber = 3;
-  inline const ::std::string& output_type() const;
-  inline void set_output_type(const ::std::string& value);
-  inline void set_output_type(const char* value);
-  inline void set_output_type(const char* value, size_t size);
-  inline ::std::string* mutable_output_type();
-  inline ::std::string* release_output_type();
-  inline void set_allocated_output_type(::std::string* output_type);
-
-  // optional .google.protobuf.MethodOptions options = 4;
-  inline bool has_options() const;
-  inline void clear_options();
-  static const int kOptionsFieldNumber = 4;
-  inline const ::google::protobuf::MethodOptions& options() const;
-  inline ::google::protobuf::MethodOptions* mutable_options();
-  inline ::google::protobuf::MethodOptions* release_options();
-  inline void set_allocated_options(::google::protobuf::MethodOptions* options);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.MethodDescriptorProto)
- private:
-  inline void set_has_name();
-  inline void clear_has_name();
-  inline void set_has_input_type();
-  inline void clear_has_input_type();
-  inline void set_has_output_type();
-  inline void clear_has_output_type();
-  inline void set_has_options();
-  inline void clear_has_options();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_;
-  ::std::string* input_type_;
-  ::std::string* output_type_;
-  ::google::protobuf::MethodOptions* options_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(4 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static MethodDescriptorProto* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT FileOptions : public ::google::protobuf::Message {
- public:
-  FileOptions();
-  virtual ~FileOptions();
-
-  FileOptions(const FileOptions& from);
-
-  inline FileOptions& operator=(const FileOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const FileOptions& default_instance();
-
-  void Swap(FileOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  FileOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const FileOptions& from);
-  void MergeFrom(const FileOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef FileOptions_OptimizeMode OptimizeMode;
-  static const OptimizeMode SPEED = FileOptions_OptimizeMode_SPEED;
-  static const OptimizeMode CODE_SIZE = FileOptions_OptimizeMode_CODE_SIZE;
-  static const OptimizeMode LITE_RUNTIME = FileOptions_OptimizeMode_LITE_RUNTIME;
-  static inline bool OptimizeMode_IsValid(int value) {
-    return FileOptions_OptimizeMode_IsValid(value);
-  }
-  static const OptimizeMode OptimizeMode_MIN =
-    FileOptions_OptimizeMode_OptimizeMode_MIN;
-  static const OptimizeMode OptimizeMode_MAX =
-    FileOptions_OptimizeMode_OptimizeMode_MAX;
-  static const int OptimizeMode_ARRAYSIZE =
-    FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE;
-  static inline const ::google::protobuf::EnumDescriptor*
-  OptimizeMode_descriptor() {
-    return FileOptions_OptimizeMode_descriptor();
-  }
-  static inline const ::std::string& OptimizeMode_Name(OptimizeMode value) {
-    return FileOptions_OptimizeMode_Name(value);
-  }
-  static inline bool OptimizeMode_Parse(const ::std::string& name,
-      OptimizeMode* value) {
-    return FileOptions_OptimizeMode_Parse(name, value);
-  }
-
-  // accessors -------------------------------------------------------
-
-  // optional string java_package = 1;
-  inline bool has_java_package() const;
-  inline void clear_java_package();
-  static const int kJavaPackageFieldNumber = 1;
-  inline const ::std::string& java_package() const;
-  inline void set_java_package(const ::std::string& value);
-  inline void set_java_package(const char* value);
-  inline void set_java_package(const char* value, size_t size);
-  inline ::std::string* mutable_java_package();
-  inline ::std::string* release_java_package();
-  inline void set_allocated_java_package(::std::string* java_package);
-
-  // optional string java_outer_classname = 8;
-  inline bool has_java_outer_classname() const;
-  inline void clear_java_outer_classname();
-  static const int kJavaOuterClassnameFieldNumber = 8;
-  inline const ::std::string& java_outer_classname() const;
-  inline void set_java_outer_classname(const ::std::string& value);
-  inline void set_java_outer_classname(const char* value);
-  inline void set_java_outer_classname(const char* value, size_t size);
-  inline ::std::string* mutable_java_outer_classname();
-  inline ::std::string* release_java_outer_classname();
-  inline void set_allocated_java_outer_classname(::std::string* java_outer_classname);
-
-  // optional bool java_multiple_files = 10 [default = false];
-  inline bool has_java_multiple_files() const;
-  inline void clear_java_multiple_files();
-  static const int kJavaMultipleFilesFieldNumber = 10;
-  inline bool java_multiple_files() const;
-  inline void set_java_multiple_files(bool value);
-
-  // optional bool java_generate_equals_and_hash = 20 [default = false];
-  inline bool has_java_generate_equals_and_hash() const;
-  inline void clear_java_generate_equals_and_hash();
-  static const int kJavaGenerateEqualsAndHashFieldNumber = 20;
-  inline bool java_generate_equals_and_hash() const;
-  inline void set_java_generate_equals_and_hash(bool value);
-
-  // optional .google.protobuf.FileOptions.OptimizeMode optimize_for = 9 [default = SPEED];
-  inline bool has_optimize_for() const;
-  inline void clear_optimize_for();
-  static const int kOptimizeForFieldNumber = 9;
-  inline ::google::protobuf::FileOptions_OptimizeMode optimize_for() const;
-  inline void set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value);
-
-  // optional string go_package = 11;
-  inline bool has_go_package() const;
-  inline void clear_go_package();
-  static const int kGoPackageFieldNumber = 11;
-  inline const ::std::string& go_package() const;
-  inline void set_go_package(const ::std::string& value);
-  inline void set_go_package(const char* value);
-  inline void set_go_package(const char* value, size_t size);
-  inline ::std::string* mutable_go_package();
-  inline ::std::string* release_go_package();
-  inline void set_allocated_go_package(::std::string* go_package);
-
-  // optional bool cc_generic_services = 16 [default = false];
-  inline bool has_cc_generic_services() const;
-  inline void clear_cc_generic_services();
-  static const int kCcGenericServicesFieldNumber = 16;
-  inline bool cc_generic_services() const;
-  inline void set_cc_generic_services(bool value);
-
-  // optional bool java_generic_services = 17 [default = false];
-  inline bool has_java_generic_services() const;
-  inline void clear_java_generic_services();
-  static const int kJavaGenericServicesFieldNumber = 17;
-  inline bool java_generic_services() const;
-  inline void set_java_generic_services(bool value);
-
-  // optional bool py_generic_services = 18 [default = false];
-  inline bool has_py_generic_services() const;
-  inline void clear_py_generic_services();
-  static const int kPyGenericServicesFieldNumber = 18;
-  inline bool py_generic_services() const;
-  inline void set_py_generic_services(bool value);
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(FileOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.FileOptions)
- private:
-  inline void set_has_java_package();
-  inline void clear_has_java_package();
-  inline void set_has_java_outer_classname();
-  inline void clear_has_java_outer_classname();
-  inline void set_has_java_multiple_files();
-  inline void clear_has_java_multiple_files();
-  inline void set_has_java_generate_equals_and_hash();
-  inline void clear_has_java_generate_equals_and_hash();
-  inline void set_has_optimize_for();
-  inline void clear_has_optimize_for();
-  inline void set_has_go_package();
-  inline void clear_has_go_package();
-  inline void set_has_cc_generic_services();
-  inline void clear_has_cc_generic_services();
-  inline void set_has_java_generic_services();
-  inline void clear_has_java_generic_services();
-  inline void set_has_py_generic_services();
-  inline void clear_has_py_generic_services();
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* java_package_;
-  ::std::string* java_outer_classname_;
-  int optimize_for_;
-  bool java_multiple_files_;
-  bool java_generate_equals_and_hash_;
-  bool cc_generic_services_;
-  bool java_generic_services_;
-  ::std::string* go_package_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-  bool py_generic_services_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(10 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static FileOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT MessageOptions : public ::google::protobuf::Message {
- public:
-  MessageOptions();
-  virtual ~MessageOptions();
-
-  MessageOptions(const MessageOptions& from);
-
-  inline MessageOptions& operator=(const MessageOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const MessageOptions& default_instance();
-
-  void Swap(MessageOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  MessageOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const MessageOptions& from);
-  void MergeFrom(const MessageOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional bool message_set_wire_format = 1 [default = false];
-  inline bool has_message_set_wire_format() const;
-  inline void clear_message_set_wire_format();
-  static const int kMessageSetWireFormatFieldNumber = 1;
-  inline bool message_set_wire_format() const;
-  inline void set_message_set_wire_format(bool value);
-
-  // optional bool no_standard_descriptor_accessor = 2 [default = false];
-  inline bool has_no_standard_descriptor_accessor() const;
-  inline void clear_no_standard_descriptor_accessor();
-  static const int kNoStandardDescriptorAccessorFieldNumber = 2;
-  inline bool no_standard_descriptor_accessor() const;
-  inline void set_no_standard_descriptor_accessor(bool value);
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(MessageOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.MessageOptions)
- private:
-  inline void set_has_message_set_wire_format();
-  inline void clear_has_message_set_wire_format();
-  inline void set_has_no_standard_descriptor_accessor();
-  inline void clear_has_no_standard_descriptor_accessor();
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-  bool message_set_wire_format_;
-  bool no_standard_descriptor_accessor_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(3 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static MessageOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT FieldOptions : public ::google::protobuf::Message {
- public:
-  FieldOptions();
-  virtual ~FieldOptions();
-
-  FieldOptions(const FieldOptions& from);
-
-  inline FieldOptions& operator=(const FieldOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const FieldOptions& default_instance();
-
-  void Swap(FieldOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  FieldOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const FieldOptions& from);
-  void MergeFrom(const FieldOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef FieldOptions_CType CType;
-  static const CType STRING = FieldOptions_CType_STRING;
-  static const CType CORD = FieldOptions_CType_CORD;
-  static const CType STRING_PIECE = FieldOptions_CType_STRING_PIECE;
-  static inline bool CType_IsValid(int value) {
-    return FieldOptions_CType_IsValid(value);
-  }
-  static const CType CType_MIN =
-    FieldOptions_CType_CType_MIN;
-  static const CType CType_MAX =
-    FieldOptions_CType_CType_MAX;
-  static const int CType_ARRAYSIZE =
-    FieldOptions_CType_CType_ARRAYSIZE;
-  static inline const ::google::protobuf::EnumDescriptor*
-  CType_descriptor() {
-    return FieldOptions_CType_descriptor();
-  }
-  static inline const ::std::string& CType_Name(CType value) {
-    return FieldOptions_CType_Name(value);
-  }
-  static inline bool CType_Parse(const ::std::string& name,
-      CType* value) {
-    return FieldOptions_CType_Parse(name, value);
-  }
-
-  // accessors -------------------------------------------------------
-
-  // optional .google.protobuf.FieldOptions.CType ctype = 1 [default = STRING];
-  inline bool has_ctype() const;
-  inline void clear_ctype();
-  static const int kCtypeFieldNumber = 1;
-  inline ::google::protobuf::FieldOptions_CType ctype() const;
-  inline void set_ctype(::google::protobuf::FieldOptions_CType value);
-
-  // optional bool packed = 2;
-  inline bool has_packed() const;
-  inline void clear_packed();
-  static const int kPackedFieldNumber = 2;
-  inline bool packed() const;
-  inline void set_packed(bool value);
-
-  // optional bool lazy = 5 [default = false];
-  inline bool has_lazy() const;
-  inline void clear_lazy();
-  static const int kLazyFieldNumber = 5;
-  inline bool lazy() const;
-  inline void set_lazy(bool value);
-
-  // optional bool deprecated = 3 [default = false];
-  inline bool has_deprecated() const;
-  inline void clear_deprecated();
-  static const int kDeprecatedFieldNumber = 3;
-  inline bool deprecated() const;
-  inline void set_deprecated(bool value);
-
-  // optional string experimental_map_key = 9;
-  inline bool has_experimental_map_key() const;
-  inline void clear_experimental_map_key();
-  static const int kExperimentalMapKeyFieldNumber = 9;
-  inline const ::std::string& experimental_map_key() const;
-  inline void set_experimental_map_key(const ::std::string& value);
-  inline void set_experimental_map_key(const char* value);
-  inline void set_experimental_map_key(const char* value, size_t size);
-  inline ::std::string* mutable_experimental_map_key();
-  inline ::std::string* release_experimental_map_key();
-  inline void set_allocated_experimental_map_key(::std::string* experimental_map_key);
-
-  // optional bool weak = 10 [default = false];
-  inline bool has_weak() const;
-  inline void clear_weak();
-  static const int kWeakFieldNumber = 10;
-  inline bool weak() const;
-  inline void set_weak(bool value);
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(FieldOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.FieldOptions)
- private:
-  inline void set_has_ctype();
-  inline void clear_has_ctype();
-  inline void set_has_packed();
-  inline void clear_has_packed();
-  inline void set_has_lazy();
-  inline void clear_has_lazy();
-  inline void set_has_deprecated();
-  inline void clear_has_deprecated();
-  inline void set_has_experimental_map_key();
-  inline void clear_has_experimental_map_key();
-  inline void set_has_weak();
-  inline void clear_has_weak();
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  int ctype_;
-  bool packed_;
-  bool lazy_;
-  bool deprecated_;
-  bool weak_;
-  ::std::string* experimental_map_key_;
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static FieldOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT EnumOptions : public ::google::protobuf::Message {
- public:
-  EnumOptions();
-  virtual ~EnumOptions();
-
-  EnumOptions(const EnumOptions& from);
-
-  inline EnumOptions& operator=(const EnumOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const EnumOptions& default_instance();
-
-  void Swap(EnumOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  EnumOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const EnumOptions& from);
-  void MergeFrom(const EnumOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // optional bool allow_alias = 2 [default = true];
-  inline bool has_allow_alias() const;
-  inline void clear_allow_alias();
-  static const int kAllowAliasFieldNumber = 2;
-  inline bool allow_alias() const;
-  inline void set_allow_alias(bool value);
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(EnumOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.EnumOptions)
- private:
-  inline void set_has_allow_alias();
-  inline void clear_has_allow_alias();
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-  bool allow_alias_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static EnumOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT EnumValueOptions : public ::google::protobuf::Message {
- public:
-  EnumValueOptions();
-  virtual ~EnumValueOptions();
-
-  EnumValueOptions(const EnumValueOptions& from);
-
-  inline EnumValueOptions& operator=(const EnumValueOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const EnumValueOptions& default_instance();
-
-  void Swap(EnumValueOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  EnumValueOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const EnumValueOptions& from);
-  void MergeFrom(const EnumValueOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(EnumValueOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.EnumValueOptions)
- private:
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static EnumValueOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT ServiceOptions : public ::google::protobuf::Message {
- public:
-  ServiceOptions();
-  virtual ~ServiceOptions();
-
-  ServiceOptions(const ServiceOptions& from);
-
-  inline ServiceOptions& operator=(const ServiceOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const ServiceOptions& default_instance();
-
-  void Swap(ServiceOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  ServiceOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const ServiceOptions& from);
-  void MergeFrom(const ServiceOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(ServiceOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.ServiceOptions)
- private:
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static ServiceOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT MethodOptions : public ::google::protobuf::Message {
- public:
-  MethodOptions();
-  virtual ~MethodOptions();
-
-  MethodOptions(const MethodOptions& from);
-
-  inline MethodOptions& operator=(const MethodOptions& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const MethodOptions& default_instance();
-
-  void Swap(MethodOptions* other);
-
-  // implements Message ----------------------------------------------
-
-  MethodOptions* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const MethodOptions& from);
-  void MergeFrom(const MethodOptions& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-  inline int uninterpreted_option_size() const;
-  inline void clear_uninterpreted_option();
-  static const int kUninterpretedOptionFieldNumber = 999;
-  inline const ::google::protobuf::UninterpretedOption& uninterpreted_option(int index) const;
-  inline ::google::protobuf::UninterpretedOption* mutable_uninterpreted_option(int index);
-  inline ::google::protobuf::UninterpretedOption* add_uninterpreted_option();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-      uninterpreted_option() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-      mutable_uninterpreted_option();
-
-  GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(MethodOptions)
-  // @@protoc_insertion_point(class_scope:google.protobuf.MethodOptions)
- private:
-
-  ::google::protobuf::internal::ExtensionSet _extensions_;
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static MethodOptions* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT UninterpretedOption_NamePart : public ::google::protobuf::Message {
- public:
-  UninterpretedOption_NamePart();
-  virtual ~UninterpretedOption_NamePart();
-
-  UninterpretedOption_NamePart(const UninterpretedOption_NamePart& from);
-
-  inline UninterpretedOption_NamePart& operator=(const UninterpretedOption_NamePart& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const UninterpretedOption_NamePart& default_instance();
-
-  void Swap(UninterpretedOption_NamePart* other);
-
-  // implements Message ----------------------------------------------
-
-  UninterpretedOption_NamePart* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const UninterpretedOption_NamePart& from);
-  void MergeFrom(const UninterpretedOption_NamePart& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // required string name_part = 1;
-  inline bool has_name_part() const;
-  inline void clear_name_part();
-  static const int kNamePartFieldNumber = 1;
-  inline const ::std::string& name_part() const;
-  inline void set_name_part(const ::std::string& value);
-  inline void set_name_part(const char* value);
-  inline void set_name_part(const char* value, size_t size);
-  inline ::std::string* mutable_name_part();
-  inline ::std::string* release_name_part();
-  inline void set_allocated_name_part(::std::string* name_part);
-
-  // required bool is_extension = 2;
-  inline bool has_is_extension() const;
-  inline void clear_is_extension();
-  static const int kIsExtensionFieldNumber = 2;
-  inline bool is_extension() const;
-  inline void set_is_extension(bool value);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.UninterpretedOption.NamePart)
- private:
-  inline void set_has_name_part();
-  inline void clear_has_name_part();
-  inline void set_has_is_extension();
-  inline void clear_has_is_extension();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::std::string* name_part_;
-  bool is_extension_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(2 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static UninterpretedOption_NamePart* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT UninterpretedOption : public ::google::protobuf::Message {
- public:
-  UninterpretedOption();
-  virtual ~UninterpretedOption();
-
-  UninterpretedOption(const UninterpretedOption& from);
-
-  inline UninterpretedOption& operator=(const UninterpretedOption& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const UninterpretedOption& default_instance();
-
-  void Swap(UninterpretedOption* other);
-
-  // implements Message ----------------------------------------------
-
-  UninterpretedOption* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const UninterpretedOption& from);
-  void MergeFrom(const UninterpretedOption& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef UninterpretedOption_NamePart NamePart;
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.UninterpretedOption.NamePart name = 2;
-  inline int name_size() const;
-  inline void clear_name();
-  static const int kNameFieldNumber = 2;
-  inline const ::google::protobuf::UninterpretedOption_NamePart& name(int index) const;
-  inline ::google::protobuf::UninterpretedOption_NamePart* mutable_name(int index);
-  inline ::google::protobuf::UninterpretedOption_NamePart* add_name();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >&
-      name() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >*
-      mutable_name();
-
-  // optional string identifier_value = 3;
-  inline bool has_identifier_value() const;
-  inline void clear_identifier_value();
-  static const int kIdentifierValueFieldNumber = 3;
-  inline const ::std::string& identifier_value() const;
-  inline void set_identifier_value(const ::std::string& value);
-  inline void set_identifier_value(const char* value);
-  inline void set_identifier_value(const char* value, size_t size);
-  inline ::std::string* mutable_identifier_value();
-  inline ::std::string* release_identifier_value();
-  inline void set_allocated_identifier_value(::std::string* identifier_value);
-
-  // optional uint64 positive_int_value = 4;
-  inline bool has_positive_int_value() const;
-  inline void clear_positive_int_value();
-  static const int kPositiveIntValueFieldNumber = 4;
-  inline ::google::protobuf::uint64 positive_int_value() const;
-  inline void set_positive_int_value(::google::protobuf::uint64 value);
-
-  // optional int64 negative_int_value = 5;
-  inline bool has_negative_int_value() const;
-  inline void clear_negative_int_value();
-  static const int kNegativeIntValueFieldNumber = 5;
-  inline ::google::protobuf::int64 negative_int_value() const;
-  inline void set_negative_int_value(::google::protobuf::int64 value);
-
-  // optional double double_value = 6;
-  inline bool has_double_value() const;
-  inline void clear_double_value();
-  static const int kDoubleValueFieldNumber = 6;
-  inline double double_value() const;
-  inline void set_double_value(double value);
-
-  // optional bytes string_value = 7;
-  inline bool has_string_value() const;
-  inline void clear_string_value();
-  static const int kStringValueFieldNumber = 7;
-  inline const ::std::string& string_value() const;
-  inline void set_string_value(const ::std::string& value);
-  inline void set_string_value(const char* value);
-  inline void set_string_value(const void* value, size_t size);
-  inline ::std::string* mutable_string_value();
-  inline ::std::string* release_string_value();
-  inline void set_allocated_string_value(::std::string* string_value);
-
-  // optional string aggregate_value = 8;
-  inline bool has_aggregate_value() const;
-  inline void clear_aggregate_value();
-  static const int kAggregateValueFieldNumber = 8;
-  inline const ::std::string& aggregate_value() const;
-  inline void set_aggregate_value(const ::std::string& value);
-  inline void set_aggregate_value(const char* value);
-  inline void set_aggregate_value(const char* value, size_t size);
-  inline ::std::string* mutable_aggregate_value();
-  inline ::std::string* release_aggregate_value();
-  inline void set_allocated_aggregate_value(::std::string* aggregate_value);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.UninterpretedOption)
- private:
-  inline void set_has_identifier_value();
-  inline void clear_has_identifier_value();
-  inline void set_has_positive_int_value();
-  inline void clear_has_positive_int_value();
-  inline void set_has_negative_int_value();
-  inline void clear_has_negative_int_value();
-  inline void set_has_double_value();
-  inline void clear_has_double_value();
-  inline void set_has_string_value();
-  inline void clear_has_string_value();
-  inline void set_has_aggregate_value();
-  inline void clear_has_aggregate_value();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart > name_;
-  ::std::string* identifier_value_;
-  ::google::protobuf::uint64 positive_int_value_;
-  ::google::protobuf::int64 negative_int_value_;
-  double double_value_;
-  ::std::string* string_value_;
-  ::std::string* aggregate_value_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(7 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static UninterpretedOption* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT SourceCodeInfo_Location : public ::google::protobuf::Message {
- public:
-  SourceCodeInfo_Location();
-  virtual ~SourceCodeInfo_Location();
-
-  SourceCodeInfo_Location(const SourceCodeInfo_Location& from);
-
-  inline SourceCodeInfo_Location& operator=(const SourceCodeInfo_Location& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const SourceCodeInfo_Location& default_instance();
-
-  void Swap(SourceCodeInfo_Location* other);
-
-  // implements Message ----------------------------------------------
-
-  SourceCodeInfo_Location* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const SourceCodeInfo_Location& from);
-  void MergeFrom(const SourceCodeInfo_Location& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  // accessors -------------------------------------------------------
-
-  // repeated int32 path = 1 [packed = true];
-  inline int path_size() const;
-  inline void clear_path();
-  static const int kPathFieldNumber = 1;
-  inline ::google::protobuf::int32 path(int index) const;
-  inline void set_path(int index, ::google::protobuf::int32 value);
-  inline void add_path(::google::protobuf::int32 value);
-  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-      path() const;
-  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-      mutable_path();
-
-  // repeated int32 span = 2 [packed = true];
-  inline int span_size() const;
-  inline void clear_span();
-  static const int kSpanFieldNumber = 2;
-  inline ::google::protobuf::int32 span(int index) const;
-  inline void set_span(int index, ::google::protobuf::int32 value);
-  inline void add_span(::google::protobuf::int32 value);
-  inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-      span() const;
-  inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-      mutable_span();
-
-  // optional string leading_comments = 3;
-  inline bool has_leading_comments() const;
-  inline void clear_leading_comments();
-  static const int kLeadingCommentsFieldNumber = 3;
-  inline const ::std::string& leading_comments() const;
-  inline void set_leading_comments(const ::std::string& value);
-  inline void set_leading_comments(const char* value);
-  inline void set_leading_comments(const char* value, size_t size);
-  inline ::std::string* mutable_leading_comments();
-  inline ::std::string* release_leading_comments();
-  inline void set_allocated_leading_comments(::std::string* leading_comments);
-
-  // optional string trailing_comments = 4;
-  inline bool has_trailing_comments() const;
-  inline void clear_trailing_comments();
-  static const int kTrailingCommentsFieldNumber = 4;
-  inline const ::std::string& trailing_comments() const;
-  inline void set_trailing_comments(const ::std::string& value);
-  inline void set_trailing_comments(const char* value);
-  inline void set_trailing_comments(const char* value, size_t size);
-  inline ::std::string* mutable_trailing_comments();
-  inline ::std::string* release_trailing_comments();
-  inline void set_allocated_trailing_comments(::std::string* trailing_comments);
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.SourceCodeInfo.Location)
- private:
-  inline void set_has_leading_comments();
-  inline void clear_has_leading_comments();
-  inline void set_has_trailing_comments();
-  inline void clear_has_trailing_comments();
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > path_;
-  mutable int _path_cached_byte_size_;
-  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > span_;
-  mutable int _span_cached_byte_size_;
-  ::std::string* leading_comments_;
-  ::std::string* trailing_comments_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(4 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static SourceCodeInfo_Location* default_instance_;
-};
-// -------------------------------------------------------------------
-
-class LIBPROTOBUF_EXPORT SourceCodeInfo : public ::google::protobuf::Message {
- public:
-  SourceCodeInfo();
-  virtual ~SourceCodeInfo();
-
-  SourceCodeInfo(const SourceCodeInfo& from);
-
-  inline SourceCodeInfo& operator=(const SourceCodeInfo& from) {
-    CopyFrom(from);
-    return *this;
-  }
-
-  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {
-    return _unknown_fields_;
-  }
-
-  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {
-    return &_unknown_fields_;
-  }
-
-  static const ::google::protobuf::Descriptor* descriptor();
-  static const SourceCodeInfo& default_instance();
-
-  void Swap(SourceCodeInfo* other);
-
-  // implements Message ----------------------------------------------
-
-  SourceCodeInfo* New() const;
-  void CopyFrom(const ::google::protobuf::Message& from);
-  void MergeFrom(const ::google::protobuf::Message& from);
-  void CopyFrom(const SourceCodeInfo& from);
-  void MergeFrom(const SourceCodeInfo& from);
-  void Clear();
-  bool IsInitialized() const;
-
-  int ByteSize() const;
-  bool MergePartialFromCodedStream(
-      ::google::protobuf::io::CodedInputStream* input);
-  void SerializeWithCachedSizes(
-      ::google::protobuf::io::CodedOutputStream* output) const;
-  ::google::protobuf::uint8* SerializeWithCachedSizesToArray(::google::protobuf::uint8* output) const;
-  int GetCachedSize() const { return _cached_size_; }
-  private:
-  void SharedCtor();
-  void SharedDtor();
-  void SetCachedSize(int size) const;
-  public:
-
-  ::google::protobuf::Metadata GetMetadata() const;
-
-  // nested types ----------------------------------------------------
-
-  typedef SourceCodeInfo_Location Location;
-
-  // accessors -------------------------------------------------------
-
-  // repeated .google.protobuf.SourceCodeInfo.Location location = 1;
-  inline int location_size() const;
-  inline void clear_location();
-  static const int kLocationFieldNumber = 1;
-  inline const ::google::protobuf::SourceCodeInfo_Location& location(int index) const;
-  inline ::google::protobuf::SourceCodeInfo_Location* mutable_location(int index);
-  inline ::google::protobuf::SourceCodeInfo_Location* add_location();
-  inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >&
-      location() const;
-  inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >*
-      mutable_location();
-
-  // @@protoc_insertion_point(class_scope:google.protobuf.SourceCodeInfo)
- private:
-
-  ::google::protobuf::UnknownFieldSet _unknown_fields_;
-
-  ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location > location_;
-
-  mutable int _cached_size_;
-  ::google::protobuf::uint32 _has_bits_[(1 + 31) / 32];
-
-  friend void LIBPROTOBUF_EXPORT protobuf_AddDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_AssignDesc_google_2fprotobuf_2fdescriptor_2eproto();
-  friend void protobuf_ShutdownFile_google_2fprotobuf_2fdescriptor_2eproto();
-
-  void InitAsDefaultInstance();
-  static SourceCodeInfo* default_instance_;
-};
-// ===================================================================
-
-
-// ===================================================================
-
-// FileDescriptorSet
-
-// repeated .google.protobuf.FileDescriptorProto file = 1;
-inline int FileDescriptorSet::file_size() const {
-  return file_.size();
-}
-inline void FileDescriptorSet::clear_file() {
-  file_.Clear();
-}
-inline const ::google::protobuf::FileDescriptorProto& FileDescriptorSet::file(int index) const {
-  return file_.Get(index);
-}
-inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::mutable_file(int index) {
-  return file_.Mutable(index);
-}
-inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::add_file() {
-  return file_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >&
-FileDescriptorSet::file() const {
-  return file_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto >*
-FileDescriptorSet::mutable_file() {
-  return &file_;
-}
-
-// -------------------------------------------------------------------
-
-// FileDescriptorProto
-
-// optional string name = 1;
-inline bool FileDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void FileDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void FileDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void FileDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& FileDescriptorProto::name() const {
-  return *name_;
-}
-inline void FileDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void FileDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void FileDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* FileDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FileDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string package = 2;
-inline bool FileDescriptorProto::has_package() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void FileDescriptorProto::set_has_package() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void FileDescriptorProto::clear_has_package() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void FileDescriptorProto::clear_package() {
-  if (package_ != &::google::protobuf::internal::kEmptyString) {
-    package_->clear();
-  }
-  clear_has_package();
-}
-inline const ::std::string& FileDescriptorProto::package() const {
-  return *package_;
-}
-inline void FileDescriptorProto::set_package(const ::std::string& value) {
-  set_has_package();
-  if (package_ == &::google::protobuf::internal::kEmptyString) {
-    package_ = new ::std::string;
-  }
-  package_->assign(value);
-}
-inline void FileDescriptorProto::set_package(const char* value) {
-  set_has_package();
-  if (package_ == &::google::protobuf::internal::kEmptyString) {
-    package_ = new ::std::string;
-  }
-  package_->assign(value);
-}
-inline void FileDescriptorProto::set_package(const char* value, size_t size) {
-  set_has_package();
-  if (package_ == &::google::protobuf::internal::kEmptyString) {
-    package_ = new ::std::string;
-  }
-  package_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileDescriptorProto::mutable_package() {
-  set_has_package();
-  if (package_ == &::google::protobuf::internal::kEmptyString) {
-    package_ = new ::std::string;
-  }
-  return package_;
-}
-inline ::std::string* FileDescriptorProto::release_package() {
-  clear_has_package();
-  if (package_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = package_;
-    package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FileDescriptorProto::set_allocated_package(::std::string* package) {
-  if (package_ != &::google::protobuf::internal::kEmptyString) {
-    delete package_;
-  }
-  if (package) {
-    set_has_package();
-    package_ = package;
-  } else {
-    clear_has_package();
-    package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated string dependency = 3;
-inline int FileDescriptorProto::dependency_size() const {
-  return dependency_.size();
-}
-inline void FileDescriptorProto::clear_dependency() {
-  dependency_.Clear();
-}
-inline const ::std::string& FileDescriptorProto::dependency(int index) const {
-  return dependency_.Get(index);
-}
-inline ::std::string* FileDescriptorProto::mutable_dependency(int index) {
-  return dependency_.Mutable(index);
-}
-inline void FileDescriptorProto::set_dependency(int index, const ::std::string& value) {
-  dependency_.Mutable(index)->assign(value);
-}
-inline void FileDescriptorProto::set_dependency(int index, const char* value) {
-  dependency_.Mutable(index)->assign(value);
-}
-inline void FileDescriptorProto::set_dependency(int index, const char* value, size_t size) {
-  dependency_.Mutable(index)->assign(
-    reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileDescriptorProto::add_dependency() {
-  return dependency_.Add();
-}
-inline void FileDescriptorProto::add_dependency(const ::std::string& value) {
-  dependency_.Add()->assign(value);
-}
-inline void FileDescriptorProto::add_dependency(const char* value) {
-  dependency_.Add()->assign(value);
-}
-inline void FileDescriptorProto::add_dependency(const char* value, size_t size) {
-  dependency_.Add()->assign(reinterpret_cast<const char*>(value), size);
-}
-inline const ::google::protobuf::RepeatedPtrField< ::std::string>&
-FileDescriptorProto::dependency() const {
-  return dependency_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::std::string>*
-FileDescriptorProto::mutable_dependency() {
-  return &dependency_;
-}
-
-// repeated int32 public_dependency = 10;
-inline int FileDescriptorProto::public_dependency_size() const {
-  return public_dependency_.size();
-}
-inline void FileDescriptorProto::clear_public_dependency() {
-  public_dependency_.Clear();
-}
-inline ::google::protobuf::int32 FileDescriptorProto::public_dependency(int index) const {
-  return public_dependency_.Get(index);
-}
-inline void FileDescriptorProto::set_public_dependency(int index, ::google::protobuf::int32 value) {
-  public_dependency_.Set(index, value);
-}
-inline void FileDescriptorProto::add_public_dependency(::google::protobuf::int32 value) {
-  public_dependency_.Add(value);
-}
-inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-FileDescriptorProto::public_dependency() const {
-  return public_dependency_;
-}
-inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-FileDescriptorProto::mutable_public_dependency() {
-  return &public_dependency_;
-}
-
-// repeated int32 weak_dependency = 11;
-inline int FileDescriptorProto::weak_dependency_size() const {
-  return weak_dependency_.size();
-}
-inline void FileDescriptorProto::clear_weak_dependency() {
-  weak_dependency_.Clear();
-}
-inline ::google::protobuf::int32 FileDescriptorProto::weak_dependency(int index) const {
-  return weak_dependency_.Get(index);
-}
-inline void FileDescriptorProto::set_weak_dependency(int index, ::google::protobuf::int32 value) {
-  weak_dependency_.Set(index, value);
-}
-inline void FileDescriptorProto::add_weak_dependency(::google::protobuf::int32 value) {
-  weak_dependency_.Add(value);
-}
-inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-FileDescriptorProto::weak_dependency() const {
-  return weak_dependency_;
-}
-inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-FileDescriptorProto::mutable_weak_dependency() {
-  return &weak_dependency_;
-}
-
-// repeated .google.protobuf.DescriptorProto message_type = 4;
-inline int FileDescriptorProto::message_type_size() const {
-  return message_type_.size();
-}
-inline void FileDescriptorProto::clear_message_type() {
-  message_type_.Clear();
-}
-inline const ::google::protobuf::DescriptorProto& FileDescriptorProto::message_type(int index) const {
-  return message_type_.Get(index);
-}
-inline ::google::protobuf::DescriptorProto* FileDescriptorProto::mutable_message_type(int index) {
-  return message_type_.Mutable(index);
-}
-inline ::google::protobuf::DescriptorProto* FileDescriptorProto::add_message_type() {
-  return message_type_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
-FileDescriptorProto::message_type() const {
-  return message_type_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
-FileDescriptorProto::mutable_message_type() {
-  return &message_type_;
-}
-
-// repeated .google.protobuf.EnumDescriptorProto enum_type = 5;
-inline int FileDescriptorProto::enum_type_size() const {
-  return enum_type_.size();
-}
-inline void FileDescriptorProto::clear_enum_type() {
-  enum_type_.Clear();
-}
-inline const ::google::protobuf::EnumDescriptorProto& FileDescriptorProto::enum_type(int index) const {
-  return enum_type_.Get(index);
-}
-inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::mutable_enum_type(int index) {
-  return enum_type_.Mutable(index);
-}
-inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::add_enum_type() {
-  return enum_type_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
-FileDescriptorProto::enum_type() const {
-  return enum_type_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
-FileDescriptorProto::mutable_enum_type() {
-  return &enum_type_;
-}
-
-// repeated .google.protobuf.ServiceDescriptorProto service = 6;
-inline int FileDescriptorProto::service_size() const {
-  return service_.size();
-}
-inline void FileDescriptorProto::clear_service() {
-  service_.Clear();
-}
-inline const ::google::protobuf::ServiceDescriptorProto& FileDescriptorProto::service(int index) const {
-  return service_.Get(index);
-}
-inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::mutable_service(int index) {
-  return service_.Mutable(index);
-}
-inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::add_service() {
-  return service_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >&
-FileDescriptorProto::service() const {
-  return service_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto >*
-FileDescriptorProto::mutable_service() {
-  return &service_;
-}
-
-// repeated .google.protobuf.FieldDescriptorProto extension = 7;
-inline int FileDescriptorProto::extension_size() const {
-  return extension_.size();
-}
-inline void FileDescriptorProto::clear_extension() {
-  extension_.Clear();
-}
-inline const ::google::protobuf::FieldDescriptorProto& FileDescriptorProto::extension(int index) const {
-  return extension_.Get(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::mutable_extension(int index) {
-  return extension_.Mutable(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::add_extension() {
-  return extension_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-FileDescriptorProto::extension() const {
-  return extension_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-FileDescriptorProto::mutable_extension() {
-  return &extension_;
-}
-
-// optional .google.protobuf.FileOptions options = 8;
-inline bool FileDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000200u) != 0;
-}
-inline void FileDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000200u;
-}
-inline void FileDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000200u;
-}
-inline void FileDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::FileOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::FileOptions& FileDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::FileOptions* FileDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::FileOptions;
-  return options_;
-}
-inline ::google::protobuf::FileOptions* FileDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::FileOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void FileDescriptorProto::set_allocated_options(::google::protobuf::FileOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// optional .google.protobuf.SourceCodeInfo source_code_info = 9;
-inline bool FileDescriptorProto::has_source_code_info() const {
-  return (_has_bits_[0] & 0x00000400u) != 0;
-}
-inline void FileDescriptorProto::set_has_source_code_info() {
-  _has_bits_[0] |= 0x00000400u;
-}
-inline void FileDescriptorProto::clear_has_source_code_info() {
-  _has_bits_[0] &= ~0x00000400u;
-}
-inline void FileDescriptorProto::clear_source_code_info() {
-  if (source_code_info_ != NULL) source_code_info_->::google::protobuf::SourceCodeInfo::Clear();
-  clear_has_source_code_info();
-}
-inline const ::google::protobuf::SourceCodeInfo& FileDescriptorProto::source_code_info() const {
-  return source_code_info_ != NULL ? *source_code_info_ : *default_instance_->source_code_info_;
-}
-inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::mutable_source_code_info() {
-  set_has_source_code_info();
-  if (source_code_info_ == NULL) source_code_info_ = new ::google::protobuf::SourceCodeInfo;
-  return source_code_info_;
-}
-inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::release_source_code_info() {
-  clear_has_source_code_info();
-  ::google::protobuf::SourceCodeInfo* temp = source_code_info_;
-  source_code_info_ = NULL;
-  return temp;
-}
-inline void FileDescriptorProto::set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info) {
-  delete source_code_info_;
-  source_code_info_ = source_code_info;
-  if (source_code_info) {
-    set_has_source_code_info();
-  } else {
-    clear_has_source_code_info();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// DescriptorProto_ExtensionRange
-
-// optional int32 start = 1;
-inline bool DescriptorProto_ExtensionRange::has_start() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void DescriptorProto_ExtensionRange::set_has_start() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void DescriptorProto_ExtensionRange::clear_has_start() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void DescriptorProto_ExtensionRange::clear_start() {
-  start_ = 0;
-  clear_has_start();
-}
-inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::start() const {
-  return start_;
-}
-inline void DescriptorProto_ExtensionRange::set_start(::google::protobuf::int32 value) {
-  set_has_start();
-  start_ = value;
-}
-
-// optional int32 end = 2;
-inline bool DescriptorProto_ExtensionRange::has_end() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void DescriptorProto_ExtensionRange::set_has_end() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void DescriptorProto_ExtensionRange::clear_has_end() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void DescriptorProto_ExtensionRange::clear_end() {
-  end_ = 0;
-  clear_has_end();
-}
-inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::end() const {
-  return end_;
-}
-inline void DescriptorProto_ExtensionRange::set_end(::google::protobuf::int32 value) {
-  set_has_end();
-  end_ = value;
-}
-
-// -------------------------------------------------------------------
-
-// DescriptorProto
-
-// optional string name = 1;
-inline bool DescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void DescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void DescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void DescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& DescriptorProto::name() const {
-  return *name_;
-}
-inline void DescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void DescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void DescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* DescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* DescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void DescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated .google.protobuf.FieldDescriptorProto field = 2;
-inline int DescriptorProto::field_size() const {
-  return field_.size();
-}
-inline void DescriptorProto::clear_field() {
-  field_.Clear();
-}
-inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::field(int index) const {
-  return field_.Get(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_field(int index) {
-  return field_.Mutable(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_field() {
-  return field_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-DescriptorProto::field() const {
-  return field_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-DescriptorProto::mutable_field() {
-  return &field_;
-}
-
-// repeated .google.protobuf.FieldDescriptorProto extension = 6;
-inline int DescriptorProto::extension_size() const {
-  return extension_.size();
-}
-inline void DescriptorProto::clear_extension() {
-  extension_.Clear();
-}
-inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::extension(int index) const {
-  return extension_.Get(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_extension(int index) {
-  return extension_.Mutable(index);
-}
-inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_extension() {
-  return extension_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >&
-DescriptorProto::extension() const {
-  return extension_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto >*
-DescriptorProto::mutable_extension() {
-  return &extension_;
-}
-
-// repeated .google.protobuf.DescriptorProto nested_type = 3;
-inline int DescriptorProto::nested_type_size() const {
-  return nested_type_.size();
-}
-inline void DescriptorProto::clear_nested_type() {
-  nested_type_.Clear();
-}
-inline const ::google::protobuf::DescriptorProto& DescriptorProto::nested_type(int index) const {
-  return nested_type_.Get(index);
-}
-inline ::google::protobuf::DescriptorProto* DescriptorProto::mutable_nested_type(int index) {
-  return nested_type_.Mutable(index);
-}
-inline ::google::protobuf::DescriptorProto* DescriptorProto::add_nested_type() {
-  return nested_type_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >&
-DescriptorProto::nested_type() const {
-  return nested_type_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto >*
-DescriptorProto::mutable_nested_type() {
-  return &nested_type_;
-}
-
-// repeated .google.protobuf.EnumDescriptorProto enum_type = 4;
-inline int DescriptorProto::enum_type_size() const {
-  return enum_type_.size();
-}
-inline void DescriptorProto::clear_enum_type() {
-  enum_type_.Clear();
-}
-inline const ::google::protobuf::EnumDescriptorProto& DescriptorProto::enum_type(int index) const {
-  return enum_type_.Get(index);
-}
-inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::mutable_enum_type(int index) {
-  return enum_type_.Mutable(index);
-}
-inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::add_enum_type() {
-  return enum_type_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >&
-DescriptorProto::enum_type() const {
-  return enum_type_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto >*
-DescriptorProto::mutable_enum_type() {
-  return &enum_type_;
-}
-
-// repeated .google.protobuf.DescriptorProto.ExtensionRange extension_range = 5;
-inline int DescriptorProto::extension_range_size() const {
-  return extension_range_.size();
-}
-inline void DescriptorProto::clear_extension_range() {
-  extension_range_.Clear();
-}
-inline const ::google::protobuf::DescriptorProto_ExtensionRange& DescriptorProto::extension_range(int index) const {
-  return extension_range_.Get(index);
-}
-inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::mutable_extension_range(int index) {
-  return extension_range_.Mutable(index);
-}
-inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::add_extension_range() {
-  return extension_range_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >&
-DescriptorProto::extension_range() const {
-  return extension_range_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange >*
-DescriptorProto::mutable_extension_range() {
-  return &extension_range_;
-}
-
-// optional .google.protobuf.MessageOptions options = 7;
-inline bool DescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000040u) != 0;
-}
-inline void DescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000040u;
-}
-inline void DescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000040u;
-}
-inline void DescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::MessageOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::MessageOptions& DescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::MessageOptions* DescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::MessageOptions;
-  return options_;
-}
-inline ::google::protobuf::MessageOptions* DescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::MessageOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void DescriptorProto::set_allocated_options(::google::protobuf::MessageOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// FieldDescriptorProto
-
-// optional string name = 1;
-inline bool FieldDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void FieldDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void FieldDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void FieldDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& FieldDescriptorProto::name() const {
-  return *name_;
-}
-inline void FieldDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void FieldDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void FieldDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FieldDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* FieldDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FieldDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional int32 number = 3;
-inline bool FieldDescriptorProto::has_number() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void FieldDescriptorProto::set_has_number() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void FieldDescriptorProto::clear_has_number() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void FieldDescriptorProto::clear_number() {
-  number_ = 0;
-  clear_has_number();
-}
-inline ::google::protobuf::int32 FieldDescriptorProto::number() const {
-  return number_;
-}
-inline void FieldDescriptorProto::set_number(::google::protobuf::int32 value) {
-  set_has_number();
-  number_ = value;
-}
-
-// optional .google.protobuf.FieldDescriptorProto.Label label = 4;
-inline bool FieldDescriptorProto::has_label() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void FieldDescriptorProto::set_has_label() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void FieldDescriptorProto::clear_has_label() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void FieldDescriptorProto::clear_label() {
-  label_ = 1;
-  clear_has_label();
-}
-inline ::google::protobuf::FieldDescriptorProto_Label FieldDescriptorProto::label() const {
-  return static_cast< ::google::protobuf::FieldDescriptorProto_Label >(label_);
-}
-inline void FieldDescriptorProto::set_label(::google::protobuf::FieldDescriptorProto_Label value) {
-  assert(::google::protobuf::FieldDescriptorProto_Label_IsValid(value));
-  set_has_label();
-  label_ = value;
-}
-
-// optional .google.protobuf.FieldDescriptorProto.Type type = 5;
-inline bool FieldDescriptorProto::has_type() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void FieldDescriptorProto::set_has_type() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void FieldDescriptorProto::clear_has_type() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void FieldDescriptorProto::clear_type() {
-  type_ = 1;
-  clear_has_type();
-}
-inline ::google::protobuf::FieldDescriptorProto_Type FieldDescriptorProto::type() const {
-  return static_cast< ::google::protobuf::FieldDescriptorProto_Type >(type_);
-}
-inline void FieldDescriptorProto::set_type(::google::protobuf::FieldDescriptorProto_Type value) {
-  assert(::google::protobuf::FieldDescriptorProto_Type_IsValid(value));
-  set_has_type();
-  type_ = value;
-}
-
-// optional string type_name = 6;
-inline bool FieldDescriptorProto::has_type_name() const {
-  return (_has_bits_[0] & 0x00000010u) != 0;
-}
-inline void FieldDescriptorProto::set_has_type_name() {
-  _has_bits_[0] |= 0x00000010u;
-}
-inline void FieldDescriptorProto::clear_has_type_name() {
-  _has_bits_[0] &= ~0x00000010u;
-}
-inline void FieldDescriptorProto::clear_type_name() {
-  if (type_name_ != &::google::protobuf::internal::kEmptyString) {
-    type_name_->clear();
-  }
-  clear_has_type_name();
-}
-inline const ::std::string& FieldDescriptorProto::type_name() const {
-  return *type_name_;
-}
-inline void FieldDescriptorProto::set_type_name(const ::std::string& value) {
-  set_has_type_name();
-  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
-    type_name_ = new ::std::string;
-  }
-  type_name_->assign(value);
-}
-inline void FieldDescriptorProto::set_type_name(const char* value) {
-  set_has_type_name();
-  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
-    type_name_ = new ::std::string;
-  }
-  type_name_->assign(value);
-}
-inline void FieldDescriptorProto::set_type_name(const char* value, size_t size) {
-  set_has_type_name();
-  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
-    type_name_ = new ::std::string;
-  }
-  type_name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FieldDescriptorProto::mutable_type_name() {
-  set_has_type_name();
-  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
-    type_name_ = new ::std::string;
-  }
-  return type_name_;
-}
-inline ::std::string* FieldDescriptorProto::release_type_name() {
-  clear_has_type_name();
-  if (type_name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = type_name_;
-    type_name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FieldDescriptorProto::set_allocated_type_name(::std::string* type_name) {
-  if (type_name_ != &::google::protobuf::internal::kEmptyString) {
-    delete type_name_;
-  }
-  if (type_name) {
-    set_has_type_name();
-    type_name_ = type_name;
-  } else {
-    clear_has_type_name();
-    type_name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string extendee = 2;
-inline bool FieldDescriptorProto::has_extendee() const {
-  return (_has_bits_[0] & 0x00000020u) != 0;
-}
-inline void FieldDescriptorProto::set_has_extendee() {
-  _has_bits_[0] |= 0x00000020u;
-}
-inline void FieldDescriptorProto::clear_has_extendee() {
-  _has_bits_[0] &= ~0x00000020u;
-}
-inline void FieldDescriptorProto::clear_extendee() {
-  if (extendee_ != &::google::protobuf::internal::kEmptyString) {
-    extendee_->clear();
-  }
-  clear_has_extendee();
-}
-inline const ::std::string& FieldDescriptorProto::extendee() const {
-  return *extendee_;
-}
-inline void FieldDescriptorProto::set_extendee(const ::std::string& value) {
-  set_has_extendee();
-  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
-    extendee_ = new ::std::string;
-  }
-  extendee_->assign(value);
-}
-inline void FieldDescriptorProto::set_extendee(const char* value) {
-  set_has_extendee();
-  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
-    extendee_ = new ::std::string;
-  }
-  extendee_->assign(value);
-}
-inline void FieldDescriptorProto::set_extendee(const char* value, size_t size) {
-  set_has_extendee();
-  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
-    extendee_ = new ::std::string;
-  }
-  extendee_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FieldDescriptorProto::mutable_extendee() {
-  set_has_extendee();
-  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
-    extendee_ = new ::std::string;
-  }
-  return extendee_;
-}
-inline ::std::string* FieldDescriptorProto::release_extendee() {
-  clear_has_extendee();
-  if (extendee_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = extendee_;
-    extendee_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FieldDescriptorProto::set_allocated_extendee(::std::string* extendee) {
-  if (extendee_ != &::google::protobuf::internal::kEmptyString) {
-    delete extendee_;
-  }
-  if (extendee) {
-    set_has_extendee();
-    extendee_ = extendee;
-  } else {
-    clear_has_extendee();
-    extendee_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string default_value = 7;
-inline bool FieldDescriptorProto::has_default_value() const {
-  return (_has_bits_[0] & 0x00000040u) != 0;
-}
-inline void FieldDescriptorProto::set_has_default_value() {
-  _has_bits_[0] |= 0x00000040u;
-}
-inline void FieldDescriptorProto::clear_has_default_value() {
-  _has_bits_[0] &= ~0x00000040u;
-}
-inline void FieldDescriptorProto::clear_default_value() {
-  if (default_value_ != &::google::protobuf::internal::kEmptyString) {
-    default_value_->clear();
-  }
-  clear_has_default_value();
-}
-inline const ::std::string& FieldDescriptorProto::default_value() const {
-  return *default_value_;
-}
-inline void FieldDescriptorProto::set_default_value(const ::std::string& value) {
-  set_has_default_value();
-  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
-    default_value_ = new ::std::string;
-  }
-  default_value_->assign(value);
-}
-inline void FieldDescriptorProto::set_default_value(const char* value) {
-  set_has_default_value();
-  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
-    default_value_ = new ::std::string;
-  }
-  default_value_->assign(value);
-}
-inline void FieldDescriptorProto::set_default_value(const char* value, size_t size) {
-  set_has_default_value();
-  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
-    default_value_ = new ::std::string;
-  }
-  default_value_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FieldDescriptorProto::mutable_default_value() {
-  set_has_default_value();
-  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
-    default_value_ = new ::std::string;
-  }
-  return default_value_;
-}
-inline ::std::string* FieldDescriptorProto::release_default_value() {
-  clear_has_default_value();
-  if (default_value_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = default_value_;
-    default_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FieldDescriptorProto::set_allocated_default_value(::std::string* default_value) {
-  if (default_value_ != &::google::protobuf::internal::kEmptyString) {
-    delete default_value_;
-  }
-  if (default_value) {
-    set_has_default_value();
-    default_value_ = default_value;
-  } else {
-    clear_has_default_value();
-    default_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional .google.protobuf.FieldOptions options = 8;
-inline bool FieldDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000080u) != 0;
-}
-inline void FieldDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000080u;
-}
-inline void FieldDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000080u;
-}
-inline void FieldDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::FieldOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::FieldOptions& FieldDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::FieldOptions* FieldDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::FieldOptions;
-  return options_;
-}
-inline ::google::protobuf::FieldOptions* FieldDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::FieldOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void FieldDescriptorProto::set_allocated_options(::google::protobuf::FieldOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// EnumDescriptorProto
-
-// optional string name = 1;
-inline bool EnumDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void EnumDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void EnumDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void EnumDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& EnumDescriptorProto::name() const {
-  return *name_;
-}
-inline void EnumDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void EnumDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void EnumDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* EnumDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* EnumDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void EnumDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated .google.protobuf.EnumValueDescriptorProto value = 2;
-inline int EnumDescriptorProto::value_size() const {
-  return value_.size();
-}
-inline void EnumDescriptorProto::clear_value() {
-  value_.Clear();
-}
-inline const ::google::protobuf::EnumValueDescriptorProto& EnumDescriptorProto::value(int index) const {
-  return value_.Get(index);
-}
-inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::mutable_value(int index) {
-  return value_.Mutable(index);
-}
-inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::add_value() {
-  return value_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >&
-EnumDescriptorProto::value() const {
-  return value_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto >*
-EnumDescriptorProto::mutable_value() {
-  return &value_;
-}
-
-// optional .google.protobuf.EnumOptions options = 3;
-inline bool EnumDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void EnumDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void EnumDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void EnumDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::EnumOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::EnumOptions& EnumDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::EnumOptions* EnumDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::EnumOptions;
-  return options_;
-}
-inline ::google::protobuf::EnumOptions* EnumDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::EnumOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void EnumDescriptorProto::set_allocated_options(::google::protobuf::EnumOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// EnumValueDescriptorProto
-
-// optional string name = 1;
-inline bool EnumValueDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void EnumValueDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void EnumValueDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void EnumValueDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& EnumValueDescriptorProto::name() const {
-  return *name_;
-}
-inline void EnumValueDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void EnumValueDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void EnumValueDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* EnumValueDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* EnumValueDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void EnumValueDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional int32 number = 2;
-inline bool EnumValueDescriptorProto::has_number() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void EnumValueDescriptorProto::set_has_number() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void EnumValueDescriptorProto::clear_has_number() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void EnumValueDescriptorProto::clear_number() {
-  number_ = 0;
-  clear_has_number();
-}
-inline ::google::protobuf::int32 EnumValueDescriptorProto::number() const {
-  return number_;
-}
-inline void EnumValueDescriptorProto::set_number(::google::protobuf::int32 value) {
-  set_has_number();
-  number_ = value;
-}
-
-// optional .google.protobuf.EnumValueOptions options = 3;
-inline bool EnumValueDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void EnumValueDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void EnumValueDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void EnumValueDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::EnumValueOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::EnumValueOptions& EnumValueDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::EnumValueOptions;
-  return options_;
-}
-inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::EnumValueOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void EnumValueDescriptorProto::set_allocated_options(::google::protobuf::EnumValueOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// ServiceDescriptorProto
-
-// optional string name = 1;
-inline bool ServiceDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void ServiceDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void ServiceDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void ServiceDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& ServiceDescriptorProto::name() const {
-  return *name_;
-}
-inline void ServiceDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void ServiceDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void ServiceDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* ServiceDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* ServiceDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void ServiceDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// repeated .google.protobuf.MethodDescriptorProto method = 2;
-inline int ServiceDescriptorProto::method_size() const {
-  return method_.size();
-}
-inline void ServiceDescriptorProto::clear_method() {
-  method_.Clear();
-}
-inline const ::google::protobuf::MethodDescriptorProto& ServiceDescriptorProto::method(int index) const {
-  return method_.Get(index);
-}
-inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::mutable_method(int index) {
-  return method_.Mutable(index);
-}
-inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::add_method() {
-  return method_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >&
-ServiceDescriptorProto::method() const {
-  return method_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto >*
-ServiceDescriptorProto::mutable_method() {
-  return &method_;
-}
-
-// optional .google.protobuf.ServiceOptions options = 3;
-inline bool ServiceDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void ServiceDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void ServiceDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void ServiceDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::ServiceOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::ServiceOptions& ServiceDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::ServiceOptions;
-  return options_;
-}
-inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::ServiceOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void ServiceDescriptorProto::set_allocated_options(::google::protobuf::ServiceOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// MethodDescriptorProto
-
-// optional string name = 1;
-inline bool MethodDescriptorProto::has_name() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void MethodDescriptorProto::set_has_name() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void MethodDescriptorProto::clear_has_name() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void MethodDescriptorProto::clear_name() {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    name_->clear();
-  }
-  clear_has_name();
-}
-inline const ::std::string& MethodDescriptorProto::name() const {
-  return *name_;
-}
-inline void MethodDescriptorProto::set_name(const ::std::string& value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void MethodDescriptorProto::set_name(const char* value) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(value);
-}
-inline void MethodDescriptorProto::set_name(const char* value, size_t size) {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  name_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* MethodDescriptorProto::mutable_name() {
-  set_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    name_ = new ::std::string;
-  }
-  return name_;
-}
-inline ::std::string* MethodDescriptorProto::release_name() {
-  clear_has_name();
-  if (name_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_;
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void MethodDescriptorProto::set_allocated_name(::std::string* name) {
-  if (name_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_;
-  }
-  if (name) {
-    set_has_name();
-    name_ = name;
-  } else {
-    clear_has_name();
-    name_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string input_type = 2;
-inline bool MethodDescriptorProto::has_input_type() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void MethodDescriptorProto::set_has_input_type() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void MethodDescriptorProto::clear_has_input_type() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void MethodDescriptorProto::clear_input_type() {
-  if (input_type_ != &::google::protobuf::internal::kEmptyString) {
-    input_type_->clear();
-  }
-  clear_has_input_type();
-}
-inline const ::std::string& MethodDescriptorProto::input_type() const {
-  return *input_type_;
-}
-inline void MethodDescriptorProto::set_input_type(const ::std::string& value) {
-  set_has_input_type();
-  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
-    input_type_ = new ::std::string;
-  }
-  input_type_->assign(value);
-}
-inline void MethodDescriptorProto::set_input_type(const char* value) {
-  set_has_input_type();
-  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
-    input_type_ = new ::std::string;
-  }
-  input_type_->assign(value);
-}
-inline void MethodDescriptorProto::set_input_type(const char* value, size_t size) {
-  set_has_input_type();
-  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
-    input_type_ = new ::std::string;
-  }
-  input_type_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* MethodDescriptorProto::mutable_input_type() {
-  set_has_input_type();
-  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
-    input_type_ = new ::std::string;
-  }
-  return input_type_;
-}
-inline ::std::string* MethodDescriptorProto::release_input_type() {
-  clear_has_input_type();
-  if (input_type_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = input_type_;
-    input_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void MethodDescriptorProto::set_allocated_input_type(::std::string* input_type) {
-  if (input_type_ != &::google::protobuf::internal::kEmptyString) {
-    delete input_type_;
-  }
-  if (input_type) {
-    set_has_input_type();
-    input_type_ = input_type;
-  } else {
-    clear_has_input_type();
-    input_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string output_type = 3;
-inline bool MethodDescriptorProto::has_output_type() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void MethodDescriptorProto::set_has_output_type() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void MethodDescriptorProto::clear_has_output_type() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void MethodDescriptorProto::clear_output_type() {
-  if (output_type_ != &::google::protobuf::internal::kEmptyString) {
-    output_type_->clear();
-  }
-  clear_has_output_type();
-}
-inline const ::std::string& MethodDescriptorProto::output_type() const {
-  return *output_type_;
-}
-inline void MethodDescriptorProto::set_output_type(const ::std::string& value) {
-  set_has_output_type();
-  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
-    output_type_ = new ::std::string;
-  }
-  output_type_->assign(value);
-}
-inline void MethodDescriptorProto::set_output_type(const char* value) {
-  set_has_output_type();
-  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
-    output_type_ = new ::std::string;
-  }
-  output_type_->assign(value);
-}
-inline void MethodDescriptorProto::set_output_type(const char* value, size_t size) {
-  set_has_output_type();
-  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
-    output_type_ = new ::std::string;
-  }
-  output_type_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* MethodDescriptorProto::mutable_output_type() {
-  set_has_output_type();
-  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
-    output_type_ = new ::std::string;
-  }
-  return output_type_;
-}
-inline ::std::string* MethodDescriptorProto::release_output_type() {
-  clear_has_output_type();
-  if (output_type_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = output_type_;
-    output_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void MethodDescriptorProto::set_allocated_output_type(::std::string* output_type) {
-  if (output_type_ != &::google::protobuf::internal::kEmptyString) {
-    delete output_type_;
-  }
-  if (output_type) {
-    set_has_output_type();
-    output_type_ = output_type;
-  } else {
-    clear_has_output_type();
-    output_type_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional .google.protobuf.MethodOptions options = 4;
-inline bool MethodDescriptorProto::has_options() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void MethodDescriptorProto::set_has_options() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void MethodDescriptorProto::clear_has_options() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void MethodDescriptorProto::clear_options() {
-  if (options_ != NULL) options_->::google::protobuf::MethodOptions::Clear();
-  clear_has_options();
-}
-inline const ::google::protobuf::MethodOptions& MethodDescriptorProto::options() const {
-  return options_ != NULL ? *options_ : *default_instance_->options_;
-}
-inline ::google::protobuf::MethodOptions* MethodDescriptorProto::mutable_options() {
-  set_has_options();
-  if (options_ == NULL) options_ = new ::google::protobuf::MethodOptions;
-  return options_;
-}
-inline ::google::protobuf::MethodOptions* MethodDescriptorProto::release_options() {
-  clear_has_options();
-  ::google::protobuf::MethodOptions* temp = options_;
-  options_ = NULL;
-  return temp;
-}
-inline void MethodDescriptorProto::set_allocated_options(::google::protobuf::MethodOptions* options) {
-  delete options_;
-  options_ = options;
-  if (options) {
-    set_has_options();
-  } else {
-    clear_has_options();
-  }
-}
-
-// -------------------------------------------------------------------
-
-// FileOptions
-
-// optional string java_package = 1;
-inline bool FileOptions::has_java_package() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void FileOptions::set_has_java_package() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void FileOptions::clear_has_java_package() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void FileOptions::clear_java_package() {
-  if (java_package_ != &::google::protobuf::internal::kEmptyString) {
-    java_package_->clear();
-  }
-  clear_has_java_package();
-}
-inline const ::std::string& FileOptions::java_package() const {
-  return *java_package_;
-}
-inline void FileOptions::set_java_package(const ::std::string& value) {
-  set_has_java_package();
-  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
-    java_package_ = new ::std::string;
-  }
-  java_package_->assign(value);
-}
-inline void FileOptions::set_java_package(const char* value) {
-  set_has_java_package();
-  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
-    java_package_ = new ::std::string;
-  }
-  java_package_->assign(value);
-}
-inline void FileOptions::set_java_package(const char* value, size_t size) {
-  set_has_java_package();
-  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
-    java_package_ = new ::std::string;
-  }
-  java_package_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileOptions::mutable_java_package() {
-  set_has_java_package();
-  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
-    java_package_ = new ::std::string;
-  }
-  return java_package_;
-}
-inline ::std::string* FileOptions::release_java_package() {
-  clear_has_java_package();
-  if (java_package_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = java_package_;
-    java_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FileOptions::set_allocated_java_package(::std::string* java_package) {
-  if (java_package_ != &::google::protobuf::internal::kEmptyString) {
-    delete java_package_;
-  }
-  if (java_package) {
-    set_has_java_package();
-    java_package_ = java_package;
-  } else {
-    clear_has_java_package();
-    java_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string java_outer_classname = 8;
-inline bool FileOptions::has_java_outer_classname() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void FileOptions::set_has_java_outer_classname() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void FileOptions::clear_has_java_outer_classname() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void FileOptions::clear_java_outer_classname() {
-  if (java_outer_classname_ != &::google::protobuf::internal::kEmptyString) {
-    java_outer_classname_->clear();
-  }
-  clear_has_java_outer_classname();
-}
-inline const ::std::string& FileOptions::java_outer_classname() const {
-  return *java_outer_classname_;
-}
-inline void FileOptions::set_java_outer_classname(const ::std::string& value) {
-  set_has_java_outer_classname();
-  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
-    java_outer_classname_ = new ::std::string;
-  }
-  java_outer_classname_->assign(value);
-}
-inline void FileOptions::set_java_outer_classname(const char* value) {
-  set_has_java_outer_classname();
-  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
-    java_outer_classname_ = new ::std::string;
-  }
-  java_outer_classname_->assign(value);
-}
-inline void FileOptions::set_java_outer_classname(const char* value, size_t size) {
-  set_has_java_outer_classname();
-  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
-    java_outer_classname_ = new ::std::string;
-  }
-  java_outer_classname_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileOptions::mutable_java_outer_classname() {
-  set_has_java_outer_classname();
-  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
-    java_outer_classname_ = new ::std::string;
-  }
-  return java_outer_classname_;
-}
-inline ::std::string* FileOptions::release_java_outer_classname() {
-  clear_has_java_outer_classname();
-  if (java_outer_classname_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = java_outer_classname_;
-    java_outer_classname_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FileOptions::set_allocated_java_outer_classname(::std::string* java_outer_classname) {
-  if (java_outer_classname_ != &::google::protobuf::internal::kEmptyString) {
-    delete java_outer_classname_;
-  }
-  if (java_outer_classname) {
-    set_has_java_outer_classname();
-    java_outer_classname_ = java_outer_classname;
-  } else {
-    clear_has_java_outer_classname();
-    java_outer_classname_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional bool java_multiple_files = 10 [default = false];
-inline bool FileOptions::has_java_multiple_files() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void FileOptions::set_has_java_multiple_files() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void FileOptions::clear_has_java_multiple_files() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void FileOptions::clear_java_multiple_files() {
-  java_multiple_files_ = false;
-  clear_has_java_multiple_files();
-}
-inline bool FileOptions::java_multiple_files() const {
-  return java_multiple_files_;
-}
-inline void FileOptions::set_java_multiple_files(bool value) {
-  set_has_java_multiple_files();
-  java_multiple_files_ = value;
-}
-
-// optional bool java_generate_equals_and_hash = 20 [default = false];
-inline bool FileOptions::has_java_generate_equals_and_hash() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void FileOptions::set_has_java_generate_equals_and_hash() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void FileOptions::clear_has_java_generate_equals_and_hash() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void FileOptions::clear_java_generate_equals_and_hash() {
-  java_generate_equals_and_hash_ = false;
-  clear_has_java_generate_equals_and_hash();
-}
-inline bool FileOptions::java_generate_equals_and_hash() const {
-  return java_generate_equals_and_hash_;
-}
-inline void FileOptions::set_java_generate_equals_and_hash(bool value) {
-  set_has_java_generate_equals_and_hash();
-  java_generate_equals_and_hash_ = value;
-}
-
-// optional .google.protobuf.FileOptions.OptimizeMode optimize_for = 9 [default = SPEED];
-inline bool FileOptions::has_optimize_for() const {
-  return (_has_bits_[0] & 0x00000010u) != 0;
-}
-inline void FileOptions::set_has_optimize_for() {
-  _has_bits_[0] |= 0x00000010u;
-}
-inline void FileOptions::clear_has_optimize_for() {
-  _has_bits_[0] &= ~0x00000010u;
-}
-inline void FileOptions::clear_optimize_for() {
-  optimize_for_ = 1;
-  clear_has_optimize_for();
-}
-inline ::google::protobuf::FileOptions_OptimizeMode FileOptions::optimize_for() const {
-  return static_cast< ::google::protobuf::FileOptions_OptimizeMode >(optimize_for_);
-}
-inline void FileOptions::set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value) {
-  assert(::google::protobuf::FileOptions_OptimizeMode_IsValid(value));
-  set_has_optimize_for();
-  optimize_for_ = value;
-}
-
-// optional string go_package = 11;
-inline bool FileOptions::has_go_package() const {
-  return (_has_bits_[0] & 0x00000020u) != 0;
-}
-inline void FileOptions::set_has_go_package() {
-  _has_bits_[0] |= 0x00000020u;
-}
-inline void FileOptions::clear_has_go_package() {
-  _has_bits_[0] &= ~0x00000020u;
-}
-inline void FileOptions::clear_go_package() {
-  if (go_package_ != &::google::protobuf::internal::kEmptyString) {
-    go_package_->clear();
-  }
-  clear_has_go_package();
-}
-inline const ::std::string& FileOptions::go_package() const {
-  return *go_package_;
-}
-inline void FileOptions::set_go_package(const ::std::string& value) {
-  set_has_go_package();
-  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
-    go_package_ = new ::std::string;
-  }
-  go_package_->assign(value);
-}
-inline void FileOptions::set_go_package(const char* value) {
-  set_has_go_package();
-  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
-    go_package_ = new ::std::string;
-  }
-  go_package_->assign(value);
-}
-inline void FileOptions::set_go_package(const char* value, size_t size) {
-  set_has_go_package();
-  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
-    go_package_ = new ::std::string;
-  }
-  go_package_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FileOptions::mutable_go_package() {
-  set_has_go_package();
-  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
-    go_package_ = new ::std::string;
-  }
-  return go_package_;
-}
-inline ::std::string* FileOptions::release_go_package() {
-  clear_has_go_package();
-  if (go_package_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = go_package_;
-    go_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FileOptions::set_allocated_go_package(::std::string* go_package) {
-  if (go_package_ != &::google::protobuf::internal::kEmptyString) {
-    delete go_package_;
-  }
-  if (go_package) {
-    set_has_go_package();
-    go_package_ = go_package;
-  } else {
-    clear_has_go_package();
-    go_package_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional bool cc_generic_services = 16 [default = false];
-inline bool FileOptions::has_cc_generic_services() const {
-  return (_has_bits_[0] & 0x00000040u) != 0;
-}
-inline void FileOptions::set_has_cc_generic_services() {
-  _has_bits_[0] |= 0x00000040u;
-}
-inline void FileOptions::clear_has_cc_generic_services() {
-  _has_bits_[0] &= ~0x00000040u;
-}
-inline void FileOptions::clear_cc_generic_services() {
-  cc_generic_services_ = false;
-  clear_has_cc_generic_services();
-}
-inline bool FileOptions::cc_generic_services() const {
-  return cc_generic_services_;
-}
-inline void FileOptions::set_cc_generic_services(bool value) {
-  set_has_cc_generic_services();
-  cc_generic_services_ = value;
-}
-
-// optional bool java_generic_services = 17 [default = false];
-inline bool FileOptions::has_java_generic_services() const {
-  return (_has_bits_[0] & 0x00000080u) != 0;
-}
-inline void FileOptions::set_has_java_generic_services() {
-  _has_bits_[0] |= 0x00000080u;
-}
-inline void FileOptions::clear_has_java_generic_services() {
-  _has_bits_[0] &= ~0x00000080u;
-}
-inline void FileOptions::clear_java_generic_services() {
-  java_generic_services_ = false;
-  clear_has_java_generic_services();
-}
-inline bool FileOptions::java_generic_services() const {
-  return java_generic_services_;
-}
-inline void FileOptions::set_java_generic_services(bool value) {
-  set_has_java_generic_services();
-  java_generic_services_ = value;
-}
-
-// optional bool py_generic_services = 18 [default = false];
-inline bool FileOptions::has_py_generic_services() const {
-  return (_has_bits_[0] & 0x00000100u) != 0;
-}
-inline void FileOptions::set_has_py_generic_services() {
-  _has_bits_[0] |= 0x00000100u;
-}
-inline void FileOptions::clear_has_py_generic_services() {
-  _has_bits_[0] &= ~0x00000100u;
-}
-inline void FileOptions::clear_py_generic_services() {
-  py_generic_services_ = false;
-  clear_has_py_generic_services();
-}
-inline bool FileOptions::py_generic_services() const {
-  return py_generic_services_;
-}
-inline void FileOptions::set_py_generic_services(bool value) {
-  set_has_py_generic_services();
-  py_generic_services_ = value;
-}
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int FileOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void FileOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& FileOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* FileOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* FileOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-FileOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-FileOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// MessageOptions
-
-// optional bool message_set_wire_format = 1 [default = false];
-inline bool MessageOptions::has_message_set_wire_format() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void MessageOptions::set_has_message_set_wire_format() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void MessageOptions::clear_has_message_set_wire_format() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void MessageOptions::clear_message_set_wire_format() {
-  message_set_wire_format_ = false;
-  clear_has_message_set_wire_format();
-}
-inline bool MessageOptions::message_set_wire_format() const {
-  return message_set_wire_format_;
-}
-inline void MessageOptions::set_message_set_wire_format(bool value) {
-  set_has_message_set_wire_format();
-  message_set_wire_format_ = value;
-}
-
-// optional bool no_standard_descriptor_accessor = 2 [default = false];
-inline bool MessageOptions::has_no_standard_descriptor_accessor() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void MessageOptions::set_has_no_standard_descriptor_accessor() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void MessageOptions::clear_has_no_standard_descriptor_accessor() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void MessageOptions::clear_no_standard_descriptor_accessor() {
-  no_standard_descriptor_accessor_ = false;
-  clear_has_no_standard_descriptor_accessor();
-}
-inline bool MessageOptions::no_standard_descriptor_accessor() const {
-  return no_standard_descriptor_accessor_;
-}
-inline void MessageOptions::set_no_standard_descriptor_accessor(bool value) {
-  set_has_no_standard_descriptor_accessor();
-  no_standard_descriptor_accessor_ = value;
-}
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int MessageOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void MessageOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& MessageOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* MessageOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* MessageOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-MessageOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-MessageOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// FieldOptions
-
-// optional .google.protobuf.FieldOptions.CType ctype = 1 [default = STRING];
-inline bool FieldOptions::has_ctype() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void FieldOptions::set_has_ctype() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void FieldOptions::clear_has_ctype() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void FieldOptions::clear_ctype() {
-  ctype_ = 0;
-  clear_has_ctype();
-}
-inline ::google::protobuf::FieldOptions_CType FieldOptions::ctype() const {
-  return static_cast< ::google::protobuf::FieldOptions_CType >(ctype_);
-}
-inline void FieldOptions::set_ctype(::google::protobuf::FieldOptions_CType value) {
-  assert(::google::protobuf::FieldOptions_CType_IsValid(value));
-  set_has_ctype();
-  ctype_ = value;
-}
-
-// optional bool packed = 2;
-inline bool FieldOptions::has_packed() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void FieldOptions::set_has_packed() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void FieldOptions::clear_has_packed() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void FieldOptions::clear_packed() {
-  packed_ = false;
-  clear_has_packed();
-}
-inline bool FieldOptions::packed() const {
-  return packed_;
-}
-inline void FieldOptions::set_packed(bool value) {
-  set_has_packed();
-  packed_ = value;
-}
-
-// optional bool lazy = 5 [default = false];
-inline bool FieldOptions::has_lazy() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void FieldOptions::set_has_lazy() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void FieldOptions::clear_has_lazy() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void FieldOptions::clear_lazy() {
-  lazy_ = false;
-  clear_has_lazy();
-}
-inline bool FieldOptions::lazy() const {
-  return lazy_;
-}
-inline void FieldOptions::set_lazy(bool value) {
-  set_has_lazy();
-  lazy_ = value;
-}
-
-// optional bool deprecated = 3 [default = false];
-inline bool FieldOptions::has_deprecated() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void FieldOptions::set_has_deprecated() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void FieldOptions::clear_has_deprecated() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void FieldOptions::clear_deprecated() {
-  deprecated_ = false;
-  clear_has_deprecated();
-}
-inline bool FieldOptions::deprecated() const {
-  return deprecated_;
-}
-inline void FieldOptions::set_deprecated(bool value) {
-  set_has_deprecated();
-  deprecated_ = value;
-}
-
-// optional string experimental_map_key = 9;
-inline bool FieldOptions::has_experimental_map_key() const {
-  return (_has_bits_[0] & 0x00000010u) != 0;
-}
-inline void FieldOptions::set_has_experimental_map_key() {
-  _has_bits_[0] |= 0x00000010u;
-}
-inline void FieldOptions::clear_has_experimental_map_key() {
-  _has_bits_[0] &= ~0x00000010u;
-}
-inline void FieldOptions::clear_experimental_map_key() {
-  if (experimental_map_key_ != &::google::protobuf::internal::kEmptyString) {
-    experimental_map_key_->clear();
-  }
-  clear_has_experimental_map_key();
-}
-inline const ::std::string& FieldOptions::experimental_map_key() const {
-  return *experimental_map_key_;
-}
-inline void FieldOptions::set_experimental_map_key(const ::std::string& value) {
-  set_has_experimental_map_key();
-  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
-    experimental_map_key_ = new ::std::string;
-  }
-  experimental_map_key_->assign(value);
-}
-inline void FieldOptions::set_experimental_map_key(const char* value) {
-  set_has_experimental_map_key();
-  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
-    experimental_map_key_ = new ::std::string;
-  }
-  experimental_map_key_->assign(value);
-}
-inline void FieldOptions::set_experimental_map_key(const char* value, size_t size) {
-  set_has_experimental_map_key();
-  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
-    experimental_map_key_ = new ::std::string;
-  }
-  experimental_map_key_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* FieldOptions::mutable_experimental_map_key() {
-  set_has_experimental_map_key();
-  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
-    experimental_map_key_ = new ::std::string;
-  }
-  return experimental_map_key_;
-}
-inline ::std::string* FieldOptions::release_experimental_map_key() {
-  clear_has_experimental_map_key();
-  if (experimental_map_key_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = experimental_map_key_;
-    experimental_map_key_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void FieldOptions::set_allocated_experimental_map_key(::std::string* experimental_map_key) {
-  if (experimental_map_key_ != &::google::protobuf::internal::kEmptyString) {
-    delete experimental_map_key_;
-  }
-  if (experimental_map_key) {
-    set_has_experimental_map_key();
-    experimental_map_key_ = experimental_map_key;
-  } else {
-    clear_has_experimental_map_key();
-    experimental_map_key_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional bool weak = 10 [default = false];
-inline bool FieldOptions::has_weak() const {
-  return (_has_bits_[0] & 0x00000020u) != 0;
-}
-inline void FieldOptions::set_has_weak() {
-  _has_bits_[0] |= 0x00000020u;
-}
-inline void FieldOptions::clear_has_weak() {
-  _has_bits_[0] &= ~0x00000020u;
-}
-inline void FieldOptions::clear_weak() {
-  weak_ = false;
-  clear_has_weak();
-}
-inline bool FieldOptions::weak() const {
-  return weak_;
-}
-inline void FieldOptions::set_weak(bool value) {
-  set_has_weak();
-  weak_ = value;
-}
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int FieldOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void FieldOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& FieldOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* FieldOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* FieldOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-FieldOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-FieldOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// EnumOptions
-
-// optional bool allow_alias = 2 [default = true];
-inline bool EnumOptions::has_allow_alias() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void EnumOptions::set_has_allow_alias() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void EnumOptions::clear_has_allow_alias() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void EnumOptions::clear_allow_alias() {
-  allow_alias_ = true;
-  clear_has_allow_alias();
-}
-inline bool EnumOptions::allow_alias() const {
-  return allow_alias_;
-}
-inline void EnumOptions::set_allow_alias(bool value) {
-  set_has_allow_alias();
-  allow_alias_ = value;
-}
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int EnumOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void EnumOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& EnumOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* EnumOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* EnumOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-EnumOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-EnumOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// EnumValueOptions
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int EnumValueOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void EnumValueOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& EnumValueOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* EnumValueOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* EnumValueOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-EnumValueOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-EnumValueOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// ServiceOptions
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int ServiceOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void ServiceOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& ServiceOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* ServiceOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* ServiceOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-ServiceOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-ServiceOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// MethodOptions
-
-// repeated .google.protobuf.UninterpretedOption uninterpreted_option = 999;
-inline int MethodOptions::uninterpreted_option_size() const {
-  return uninterpreted_option_.size();
-}
-inline void MethodOptions::clear_uninterpreted_option() {
-  uninterpreted_option_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption& MethodOptions::uninterpreted_option(int index) const {
-  return uninterpreted_option_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption* MethodOptions::mutable_uninterpreted_option(int index) {
-  return uninterpreted_option_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption* MethodOptions::add_uninterpreted_option() {
-  return uninterpreted_option_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >&
-MethodOptions::uninterpreted_option() const {
-  return uninterpreted_option_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption >*
-MethodOptions::mutable_uninterpreted_option() {
-  return &uninterpreted_option_;
-}
-
-// -------------------------------------------------------------------
-
-// UninterpretedOption_NamePart
-
-// required string name_part = 1;
-inline bool UninterpretedOption_NamePart::has_name_part() const {
-  return (_has_bits_[0] & 0x00000001u) != 0;
-}
-inline void UninterpretedOption_NamePart::set_has_name_part() {
-  _has_bits_[0] |= 0x00000001u;
-}
-inline void UninterpretedOption_NamePart::clear_has_name_part() {
-  _has_bits_[0] &= ~0x00000001u;
-}
-inline void UninterpretedOption_NamePart::clear_name_part() {
-  if (name_part_ != &::google::protobuf::internal::kEmptyString) {
-    name_part_->clear();
-  }
-  clear_has_name_part();
-}
-inline const ::std::string& UninterpretedOption_NamePart::name_part() const {
-  return *name_part_;
-}
-inline void UninterpretedOption_NamePart::set_name_part(const ::std::string& value) {
-  set_has_name_part();
-  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
-    name_part_ = new ::std::string;
-  }
-  name_part_->assign(value);
-}
-inline void UninterpretedOption_NamePart::set_name_part(const char* value) {
-  set_has_name_part();
-  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
-    name_part_ = new ::std::string;
-  }
-  name_part_->assign(value);
-}
-inline void UninterpretedOption_NamePart::set_name_part(const char* value, size_t size) {
-  set_has_name_part();
-  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
-    name_part_ = new ::std::string;
-  }
-  name_part_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* UninterpretedOption_NamePart::mutable_name_part() {
-  set_has_name_part();
-  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
-    name_part_ = new ::std::string;
-  }
-  return name_part_;
-}
-inline ::std::string* UninterpretedOption_NamePart::release_name_part() {
-  clear_has_name_part();
-  if (name_part_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = name_part_;
-    name_part_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void UninterpretedOption_NamePart::set_allocated_name_part(::std::string* name_part) {
-  if (name_part_ != &::google::protobuf::internal::kEmptyString) {
-    delete name_part_;
-  }
-  if (name_part) {
-    set_has_name_part();
-    name_part_ = name_part;
-  } else {
-    clear_has_name_part();
-    name_part_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// required bool is_extension = 2;
-inline bool UninterpretedOption_NamePart::has_is_extension() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void UninterpretedOption_NamePart::set_has_is_extension() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void UninterpretedOption_NamePart::clear_has_is_extension() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void UninterpretedOption_NamePart::clear_is_extension() {
-  is_extension_ = false;
-  clear_has_is_extension();
-}
-inline bool UninterpretedOption_NamePart::is_extension() const {
-  return is_extension_;
-}
-inline void UninterpretedOption_NamePart::set_is_extension(bool value) {
-  set_has_is_extension();
-  is_extension_ = value;
-}
-
-// -------------------------------------------------------------------
-
-// UninterpretedOption
-
-// repeated .google.protobuf.UninterpretedOption.NamePart name = 2;
-inline int UninterpretedOption::name_size() const {
-  return name_.size();
-}
-inline void UninterpretedOption::clear_name() {
-  name_.Clear();
-}
-inline const ::google::protobuf::UninterpretedOption_NamePart& UninterpretedOption::name(int index) const {
-  return name_.Get(index);
-}
-inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::mutable_name(int index) {
-  return name_.Mutable(index);
-}
-inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::add_name() {
-  return name_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >&
-UninterpretedOption::name() const {
-  return name_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart >*
-UninterpretedOption::mutable_name() {
-  return &name_;
-}
-
-// optional string identifier_value = 3;
-inline bool UninterpretedOption::has_identifier_value() const {
-  return (_has_bits_[0] & 0x00000002u) != 0;
-}
-inline void UninterpretedOption::set_has_identifier_value() {
-  _has_bits_[0] |= 0x00000002u;
-}
-inline void UninterpretedOption::clear_has_identifier_value() {
-  _has_bits_[0] &= ~0x00000002u;
-}
-inline void UninterpretedOption::clear_identifier_value() {
-  if (identifier_value_ != &::google::protobuf::internal::kEmptyString) {
-    identifier_value_->clear();
-  }
-  clear_has_identifier_value();
-}
-inline const ::std::string& UninterpretedOption::identifier_value() const {
-  return *identifier_value_;
-}
-inline void UninterpretedOption::set_identifier_value(const ::std::string& value) {
-  set_has_identifier_value();
-  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
-    identifier_value_ = new ::std::string;
-  }
-  identifier_value_->assign(value);
-}
-inline void UninterpretedOption::set_identifier_value(const char* value) {
-  set_has_identifier_value();
-  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
-    identifier_value_ = new ::std::string;
-  }
-  identifier_value_->assign(value);
-}
-inline void UninterpretedOption::set_identifier_value(const char* value, size_t size) {
-  set_has_identifier_value();
-  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
-    identifier_value_ = new ::std::string;
-  }
-  identifier_value_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* UninterpretedOption::mutable_identifier_value() {
-  set_has_identifier_value();
-  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
-    identifier_value_ = new ::std::string;
-  }
-  return identifier_value_;
-}
-inline ::std::string* UninterpretedOption::release_identifier_value() {
-  clear_has_identifier_value();
-  if (identifier_value_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = identifier_value_;
-    identifier_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void UninterpretedOption::set_allocated_identifier_value(::std::string* identifier_value) {
-  if (identifier_value_ != &::google::protobuf::internal::kEmptyString) {
-    delete identifier_value_;
-  }
-  if (identifier_value) {
-    set_has_identifier_value();
-    identifier_value_ = identifier_value;
-  } else {
-    clear_has_identifier_value();
-    identifier_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional uint64 positive_int_value = 4;
-inline bool UninterpretedOption::has_positive_int_value() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void UninterpretedOption::set_has_positive_int_value() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void UninterpretedOption::clear_has_positive_int_value() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void UninterpretedOption::clear_positive_int_value() {
-  positive_int_value_ = GOOGLE_ULONGLONG(0);
-  clear_has_positive_int_value();
-}
-inline ::google::protobuf::uint64 UninterpretedOption::positive_int_value() const {
-  return positive_int_value_;
-}
-inline void UninterpretedOption::set_positive_int_value(::google::protobuf::uint64 value) {
-  set_has_positive_int_value();
-  positive_int_value_ = value;
-}
-
-// optional int64 negative_int_value = 5;
-inline bool UninterpretedOption::has_negative_int_value() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void UninterpretedOption::set_has_negative_int_value() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void UninterpretedOption::clear_has_negative_int_value() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void UninterpretedOption::clear_negative_int_value() {
-  negative_int_value_ = GOOGLE_LONGLONG(0);
-  clear_has_negative_int_value();
-}
-inline ::google::protobuf::int64 UninterpretedOption::negative_int_value() const {
-  return negative_int_value_;
-}
-inline void UninterpretedOption::set_negative_int_value(::google::protobuf::int64 value) {
-  set_has_negative_int_value();
-  negative_int_value_ = value;
-}
-
-// optional double double_value = 6;
-inline bool UninterpretedOption::has_double_value() const {
-  return (_has_bits_[0] & 0x00000010u) != 0;
-}
-inline void UninterpretedOption::set_has_double_value() {
-  _has_bits_[0] |= 0x00000010u;
-}
-inline void UninterpretedOption::clear_has_double_value() {
-  _has_bits_[0] &= ~0x00000010u;
-}
-inline void UninterpretedOption::clear_double_value() {
-  double_value_ = 0;
-  clear_has_double_value();
-}
-inline double UninterpretedOption::double_value() const {
-  return double_value_;
-}
-inline void UninterpretedOption::set_double_value(double value) {
-  set_has_double_value();
-  double_value_ = value;
-}
-
-// optional bytes string_value = 7;
-inline bool UninterpretedOption::has_string_value() const {
-  return (_has_bits_[0] & 0x00000020u) != 0;
-}
-inline void UninterpretedOption::set_has_string_value() {
-  _has_bits_[0] |= 0x00000020u;
-}
-inline void UninterpretedOption::clear_has_string_value() {
-  _has_bits_[0] &= ~0x00000020u;
-}
-inline void UninterpretedOption::clear_string_value() {
-  if (string_value_ != &::google::protobuf::internal::kEmptyString) {
-    string_value_->clear();
-  }
-  clear_has_string_value();
-}
-inline const ::std::string& UninterpretedOption::string_value() const {
-  return *string_value_;
-}
-inline void UninterpretedOption::set_string_value(const ::std::string& value) {
-  set_has_string_value();
-  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
-    string_value_ = new ::std::string;
-  }
-  string_value_->assign(value);
-}
-inline void UninterpretedOption::set_string_value(const char* value) {
-  set_has_string_value();
-  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
-    string_value_ = new ::std::string;
-  }
-  string_value_->assign(value);
-}
-inline void UninterpretedOption::set_string_value(const void* value, size_t size) {
-  set_has_string_value();
-  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
-    string_value_ = new ::std::string;
-  }
-  string_value_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* UninterpretedOption::mutable_string_value() {
-  set_has_string_value();
-  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
-    string_value_ = new ::std::string;
-  }
-  return string_value_;
-}
-inline ::std::string* UninterpretedOption::release_string_value() {
-  clear_has_string_value();
-  if (string_value_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = string_value_;
-    string_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void UninterpretedOption::set_allocated_string_value(::std::string* string_value) {
-  if (string_value_ != &::google::protobuf::internal::kEmptyString) {
-    delete string_value_;
-  }
-  if (string_value) {
-    set_has_string_value();
-    string_value_ = string_value;
-  } else {
-    clear_has_string_value();
-    string_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string aggregate_value = 8;
-inline bool UninterpretedOption::has_aggregate_value() const {
-  return (_has_bits_[0] & 0x00000040u) != 0;
-}
-inline void UninterpretedOption::set_has_aggregate_value() {
-  _has_bits_[0] |= 0x00000040u;
-}
-inline void UninterpretedOption::clear_has_aggregate_value() {
-  _has_bits_[0] &= ~0x00000040u;
-}
-inline void UninterpretedOption::clear_aggregate_value() {
-  if (aggregate_value_ != &::google::protobuf::internal::kEmptyString) {
-    aggregate_value_->clear();
-  }
-  clear_has_aggregate_value();
-}
-inline const ::std::string& UninterpretedOption::aggregate_value() const {
-  return *aggregate_value_;
-}
-inline void UninterpretedOption::set_aggregate_value(const ::std::string& value) {
-  set_has_aggregate_value();
-  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
-    aggregate_value_ = new ::std::string;
-  }
-  aggregate_value_->assign(value);
-}
-inline void UninterpretedOption::set_aggregate_value(const char* value) {
-  set_has_aggregate_value();
-  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
-    aggregate_value_ = new ::std::string;
-  }
-  aggregate_value_->assign(value);
-}
-inline void UninterpretedOption::set_aggregate_value(const char* value, size_t size) {
-  set_has_aggregate_value();
-  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
-    aggregate_value_ = new ::std::string;
-  }
-  aggregate_value_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* UninterpretedOption::mutable_aggregate_value() {
-  set_has_aggregate_value();
-  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
-    aggregate_value_ = new ::std::string;
-  }
-  return aggregate_value_;
-}
-inline ::std::string* UninterpretedOption::release_aggregate_value() {
-  clear_has_aggregate_value();
-  if (aggregate_value_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = aggregate_value_;
-    aggregate_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void UninterpretedOption::set_allocated_aggregate_value(::std::string* aggregate_value) {
-  if (aggregate_value_ != &::google::protobuf::internal::kEmptyString) {
-    delete aggregate_value_;
-  }
-  if (aggregate_value) {
-    set_has_aggregate_value();
-    aggregate_value_ = aggregate_value;
-  } else {
-    clear_has_aggregate_value();
-    aggregate_value_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// -------------------------------------------------------------------
-
-// SourceCodeInfo_Location
-
-// repeated int32 path = 1 [packed = true];
-inline int SourceCodeInfo_Location::path_size() const {
-  return path_.size();
-}
-inline void SourceCodeInfo_Location::clear_path() {
-  path_.Clear();
-}
-inline ::google::protobuf::int32 SourceCodeInfo_Location::path(int index) const {
-  return path_.Get(index);
-}
-inline void SourceCodeInfo_Location::set_path(int index, ::google::protobuf::int32 value) {
-  path_.Set(index, value);
-}
-inline void SourceCodeInfo_Location::add_path(::google::protobuf::int32 value) {
-  path_.Add(value);
-}
-inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-SourceCodeInfo_Location::path() const {
-  return path_;
-}
-inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-SourceCodeInfo_Location::mutable_path() {
-  return &path_;
-}
-
-// repeated int32 span = 2 [packed = true];
-inline int SourceCodeInfo_Location::span_size() const {
-  return span_.size();
-}
-inline void SourceCodeInfo_Location::clear_span() {
-  span_.Clear();
-}
-inline ::google::protobuf::int32 SourceCodeInfo_Location::span(int index) const {
-  return span_.Get(index);
-}
-inline void SourceCodeInfo_Location::set_span(int index, ::google::protobuf::int32 value) {
-  span_.Set(index, value);
-}
-inline void SourceCodeInfo_Location::add_span(::google::protobuf::int32 value) {
-  span_.Add(value);
-}
-inline const ::google::protobuf::RepeatedField< ::google::protobuf::int32 >&
-SourceCodeInfo_Location::span() const {
-  return span_;
-}
-inline ::google::protobuf::RepeatedField< ::google::protobuf::int32 >*
-SourceCodeInfo_Location::mutable_span() {
-  return &span_;
-}
-
-// optional string leading_comments = 3;
-inline bool SourceCodeInfo_Location::has_leading_comments() const {
-  return (_has_bits_[0] & 0x00000004u) != 0;
-}
-inline void SourceCodeInfo_Location::set_has_leading_comments() {
-  _has_bits_[0] |= 0x00000004u;
-}
-inline void SourceCodeInfo_Location::clear_has_leading_comments() {
-  _has_bits_[0] &= ~0x00000004u;
-}
-inline void SourceCodeInfo_Location::clear_leading_comments() {
-  if (leading_comments_ != &::google::protobuf::internal::kEmptyString) {
-    leading_comments_->clear();
-  }
-  clear_has_leading_comments();
-}
-inline const ::std::string& SourceCodeInfo_Location::leading_comments() const {
-  return *leading_comments_;
-}
-inline void SourceCodeInfo_Location::set_leading_comments(const ::std::string& value) {
-  set_has_leading_comments();
-  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
-    leading_comments_ = new ::std::string;
-  }
-  leading_comments_->assign(value);
-}
-inline void SourceCodeInfo_Location::set_leading_comments(const char* value) {
-  set_has_leading_comments();
-  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
-    leading_comments_ = new ::std::string;
-  }
-  leading_comments_->assign(value);
-}
-inline void SourceCodeInfo_Location::set_leading_comments(const char* value, size_t size) {
-  set_has_leading_comments();
-  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
-    leading_comments_ = new ::std::string;
-  }
-  leading_comments_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* SourceCodeInfo_Location::mutable_leading_comments() {
-  set_has_leading_comments();
-  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
-    leading_comments_ = new ::std::string;
-  }
-  return leading_comments_;
-}
-inline ::std::string* SourceCodeInfo_Location::release_leading_comments() {
-  clear_has_leading_comments();
-  if (leading_comments_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = leading_comments_;
-    leading_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void SourceCodeInfo_Location::set_allocated_leading_comments(::std::string* leading_comments) {
-  if (leading_comments_ != &::google::protobuf::internal::kEmptyString) {
-    delete leading_comments_;
-  }
-  if (leading_comments) {
-    set_has_leading_comments();
-    leading_comments_ = leading_comments;
-  } else {
-    clear_has_leading_comments();
-    leading_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// optional string trailing_comments = 4;
-inline bool SourceCodeInfo_Location::has_trailing_comments() const {
-  return (_has_bits_[0] & 0x00000008u) != 0;
-}
-inline void SourceCodeInfo_Location::set_has_trailing_comments() {
-  _has_bits_[0] |= 0x00000008u;
-}
-inline void SourceCodeInfo_Location::clear_has_trailing_comments() {
-  _has_bits_[0] &= ~0x00000008u;
-}
-inline void SourceCodeInfo_Location::clear_trailing_comments() {
-  if (trailing_comments_ != &::google::protobuf::internal::kEmptyString) {
-    trailing_comments_->clear();
-  }
-  clear_has_trailing_comments();
-}
-inline const ::std::string& SourceCodeInfo_Location::trailing_comments() const {
-  return *trailing_comments_;
-}
-inline void SourceCodeInfo_Location::set_trailing_comments(const ::std::string& value) {
-  set_has_trailing_comments();
-  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
-    trailing_comments_ = new ::std::string;
-  }
-  trailing_comments_->assign(value);
-}
-inline void SourceCodeInfo_Location::set_trailing_comments(const char* value) {
-  set_has_trailing_comments();
-  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
-    trailing_comments_ = new ::std::string;
-  }
-  trailing_comments_->assign(value);
-}
-inline void SourceCodeInfo_Location::set_trailing_comments(const char* value, size_t size) {
-  set_has_trailing_comments();
-  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
-    trailing_comments_ = new ::std::string;
-  }
-  trailing_comments_->assign(reinterpret_cast<const char*>(value), size);
-}
-inline ::std::string* SourceCodeInfo_Location::mutable_trailing_comments() {
-  set_has_trailing_comments();
-  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
-    trailing_comments_ = new ::std::string;
-  }
-  return trailing_comments_;
-}
-inline ::std::string* SourceCodeInfo_Location::release_trailing_comments() {
-  clear_has_trailing_comments();
-  if (trailing_comments_ == &::google::protobuf::internal::kEmptyString) {
-    return NULL;
-  } else {
-    ::std::string* temp = trailing_comments_;
-    trailing_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-    return temp;
-  }
-}
-inline void SourceCodeInfo_Location::set_allocated_trailing_comments(::std::string* trailing_comments) {
-  if (trailing_comments_ != &::google::protobuf::internal::kEmptyString) {
-    delete trailing_comments_;
-  }
-  if (trailing_comments) {
-    set_has_trailing_comments();
-    trailing_comments_ = trailing_comments;
-  } else {
-    clear_has_trailing_comments();
-    trailing_comments_ = const_cast< ::std::string*>(&::google::protobuf::internal::kEmptyString);
-  }
-}
-
-// -------------------------------------------------------------------
-
-// SourceCodeInfo
-
-// repeated .google.protobuf.SourceCodeInfo.Location location = 1;
-inline int SourceCodeInfo::location_size() const {
-  return location_.size();
-}
-inline void SourceCodeInfo::clear_location() {
-  location_.Clear();
-}
-inline const ::google::protobuf::SourceCodeInfo_Location& SourceCodeInfo::location(int index) const {
-  return location_.Get(index);
-}
-inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::mutable_location(int index) {
-  return location_.Mutable(index);
-}
-inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::add_location() {
-  return location_.Add();
-}
-inline const ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >&
-SourceCodeInfo::location() const {
-  return location_;
-}
-inline ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location >*
-SourceCodeInfo::mutable_location() {
-  return &location_;
-}
-
-
-// @@protoc_insertion_point(namespace_scope)
-
-}  // namespace protobuf
-}  // namespace google
-
-#ifndef SWIG
-namespace google {
-namespace protobuf {
-
-template <>
-inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Type>() {
-  return ::google::protobuf::FieldDescriptorProto_Type_descriptor();
-}
-template <>
-inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Label>() {
-  return ::google::protobuf::FieldDescriptorProto_Label_descriptor();
-}
-template <>
-inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FileOptions_OptimizeMode>() {
-  return ::google::protobuf::FileOptions_OptimizeMode_descriptor();
-}
-template <>
-inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldOptions_CType>() {
-  return ::google::protobuf::FieldOptions_CType_descriptor();
-}
-
-}  // namespace google
-}  // namespace protobuf
-#endif  // SWIG
-
-// @@protoc_insertion_point(global_scope)
-
-#endif  // PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED
diff --git a/ps-lite/deps/include/google/protobuf/descriptor.proto b/ps-lite/deps/include/google/protobuf/descriptor.proto
deleted file mode 100644
index a785f79f..00000000
--- a/ps-lite/deps/include/google/protobuf/descriptor.proto
+++ /dev/null
@@ -1,620 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// The messages in this file describe the definitions found in .proto files.
-// A valid .proto file can be translated directly to a FileDescriptorProto
-// without any other information (e.g. without reading its imports).
-
-
-
-package google.protobuf;
-option java_package = "com.google.protobuf";
-option java_outer_classname = "DescriptorProtos";
-
-// descriptor.proto must be optimized for speed because reflection-based
-// algorithms don't work during bootstrapping.
-option optimize_for = SPEED;
-
-// The protocol compiler can output a FileDescriptorSet containing the .proto
-// files it parses.
-message FileDescriptorSet {
-  repeated FileDescriptorProto file = 1;
-}
-
-// Describes a complete .proto file.
-message FileDescriptorProto {
-  optional string name = 1;       // file name, relative to root of source tree
-  optional string package = 2;    // e.g. "foo", "foo.bar", etc.
-
-  // Names of files imported by this file.
-  repeated string dependency = 3;
-  // Indexes of the public imported files in the dependency list above.
-  repeated int32 public_dependency = 10;
-  // Indexes of the weak imported files in the dependency list.
-  // For Google-internal migration only. Do not use.
-  repeated int32 weak_dependency = 11;
-
-  // All top-level definitions in this file.
-  repeated DescriptorProto message_type = 4;
-  repeated EnumDescriptorProto enum_type = 5;
-  repeated ServiceDescriptorProto service = 6;
-  repeated FieldDescriptorProto extension = 7;
-
-  optional FileOptions options = 8;
-
-  // This field contains optional information about the original source code.
-  // You may safely remove this entire field whithout harming runtime
-  // functionality of the descriptors -- the information is needed only by
-  // development tools.
-  optional SourceCodeInfo source_code_info = 9;
-}
-
-// Describes a message type.
-message DescriptorProto {
-  optional string name = 1;
-
-  repeated FieldDescriptorProto field = 2;
-  repeated FieldDescriptorProto extension = 6;
-
-  repeated DescriptorProto nested_type = 3;
-  repeated EnumDescriptorProto enum_type = 4;
-
-  message ExtensionRange {
-    optional int32 start = 1;
-    optional int32 end = 2;
-  }
-  repeated ExtensionRange extension_range = 5;
-
-  optional MessageOptions options = 7;
-}
-
-// Describes a field within a message.
-message FieldDescriptorProto {
-  enum Type {
-    // 0 is reserved for errors.
-    // Order is weird for historical reasons.
-    TYPE_DOUBLE         = 1;
-    TYPE_FLOAT          = 2;
-    // Not ZigZag encoded.  Negative numbers take 10 bytes.  Use TYPE_SINT64 if
-    // negative values are likely.
-    TYPE_INT64          = 3;
-    TYPE_UINT64         = 4;
-    // Not ZigZag encoded.  Negative numbers take 10 bytes.  Use TYPE_SINT32 if
-    // negative values are likely.
-    TYPE_INT32          = 5;
-    TYPE_FIXED64        = 6;
-    TYPE_FIXED32        = 7;
-    TYPE_BOOL           = 8;
-    TYPE_STRING         = 9;
-    TYPE_GROUP          = 10;  // Tag-delimited aggregate.
-    TYPE_MESSAGE        = 11;  // Length-delimited aggregate.
-
-    // New in version 2.
-    TYPE_BYTES          = 12;
-    TYPE_UINT32         = 13;
-    TYPE_ENUM           = 14;
-    TYPE_SFIXED32       = 15;
-    TYPE_SFIXED64       = 16;
-    TYPE_SINT32         = 17;  // Uses ZigZag encoding.
-    TYPE_SINT64         = 18;  // Uses ZigZag encoding.
-  };
-
-  enum Label {
-    // 0 is reserved for errors
-    LABEL_OPTIONAL      = 1;
-    LABEL_REQUIRED      = 2;
-    LABEL_REPEATED      = 3;
-    // TODO(sanjay): Should we add LABEL_MAP?
-  };
-
-  optional string name = 1;
-  optional int32 number = 3;
-  optional Label label = 4;
-
-  // If type_name is set, this need not be set.  If both this and type_name
-  // are set, this must be either TYPE_ENUM or TYPE_MESSAGE.
-  optional Type type = 5;
-
-  // For message and enum types, this is the name of the type.  If the name
-  // starts with a '.', it is fully-qualified.  Otherwise, C++-like scoping
-  // rules are used to find the type (i.e. first the nested types within this
-  // message are searched, then within the parent, on up to the root
-  // namespace).
-  optional string type_name = 6;
-
-  // For extensions, this is the name of the type being extended.  It is
-  // resolved in the same manner as type_name.
-  optional string extendee = 2;
-
-  // For numeric types, contains the original text representation of the value.
-  // For booleans, "true" or "false".
-  // For strings, contains the default text contents (not escaped in any way).
-  // For bytes, contains the C escaped value.  All bytes >= 128 are escaped.
-  // TODO(kenton):  Base-64 encode?
-  optional string default_value = 7;
-
-  optional FieldOptions options = 8;
-}
-
-// Describes an enum type.
-message EnumDescriptorProto {
-  optional string name = 1;
-
-  repeated EnumValueDescriptorProto value = 2;
-
-  optional EnumOptions options = 3;
-}
-
-// Describes a value within an enum.
-message EnumValueDescriptorProto {
-  optional string name = 1;
-  optional int32 number = 2;
-
-  optional EnumValueOptions options = 3;
-}
-
-// Describes a service.
-message ServiceDescriptorProto {
-  optional string name = 1;
-  repeated MethodDescriptorProto method = 2;
-
-  optional ServiceOptions options = 3;
-}
-
-// Describes a method of a service.
-message MethodDescriptorProto {
-  optional string name = 1;
-
-  // Input and output type names.  These are resolved in the same way as
-  // FieldDescriptorProto.type_name, but must refer to a message type.
-  optional string input_type = 2;
-  optional string output_type = 3;
-
-  optional MethodOptions options = 4;
-}
-
-
-// ===================================================================
-// Options
-
-// Each of the definitions above may have "options" attached.  These are
-// just annotations which may cause code to be generated slightly differently
-// or may contain hints for code that manipulates protocol messages.
-//
-// Clients may define custom options as extensions of the *Options messages.
-// These extensions may not yet be known at parsing time, so the parser cannot
-// store the values in them.  Instead it stores them in a field in the *Options
-// message called uninterpreted_option. This field must have the same name
-// across all *Options messages. We then use this field to populate the
-// extensions when we build a descriptor, at which point all protos have been
-// parsed and so all extensions are known.
-//
-// Extension numbers for custom options may be chosen as follows:
-// * For options which will only be used within a single application or
-//   organization, or for experimental options, use field numbers 50000
-//   through 99999.  It is up to you to ensure that you do not use the
-//   same number for multiple options.
-// * For options which will be published and used publicly by multiple
-//   independent entities, e-mail protobuf-global-extension-registry@google.com
-//   to reserve extension numbers. Simply provide your project name (e.g.
-//   Object-C plugin) and your porject website (if available) -- there's no need
-//   to explain how you intend to use them. Usually you only need one extension
-//   number. You can declare multiple options with only one extension number by
-//   putting them in a sub-message. See the Custom Options section of the docs
-//   for examples:
-//   http://code.google.com/apis/protocolbuffers/docs/proto.html#options
-//   If this turns out to be popular, a web service will be set up
-//   to automatically assign option numbers.
-
-
-message FileOptions {
-
-  // Sets the Java package where classes generated from this .proto will be
-  // placed.  By default, the proto package is used, but this is often
-  // inappropriate because proto packages do not normally start with backwards
-  // domain names.
-  optional string java_package = 1;
-
-
-  // If set, all the classes from the .proto file are wrapped in a single
-  // outer class with the given name.  This applies to both Proto1
-  // (equivalent to the old "--one_java_file" option) and Proto2 (where
-  // a .proto always translates to a single class, but you may want to
-  // explicitly choose the class name).
-  optional string java_outer_classname = 8;
-
-  // If set true, then the Java code generator will generate a separate .java
-  // file for each top-level message, enum, and service defined in the .proto
-  // file.  Thus, these types will *not* be nested inside the outer class
-  // named by java_outer_classname.  However, the outer class will still be
-  // generated to contain the file's getDescriptor() method as well as any
-  // top-level extensions defined in the file.
-  optional bool java_multiple_files = 10 [default=false];
-
-  // If set true, then the Java code generator will generate equals() and
-  // hashCode() methods for all messages defined in the .proto file. This is
-  // purely a speed optimization, as the AbstractMessage base class includes
-  // reflection-based implementations of these methods.
-  optional bool java_generate_equals_and_hash = 20 [default=false];
-
-  // Generated classes can be optimized for speed or code size.
-  enum OptimizeMode {
-    SPEED = 1;        // Generate complete code for parsing, serialization,
-                      // etc.
-    CODE_SIZE = 2;    // Use ReflectionOps to implement these methods.
-    LITE_RUNTIME = 3; // Generate code using MessageLite and the lite runtime.
-  }
-  optional OptimizeMode optimize_for = 9 [default=SPEED];
-
-  // Sets the Go package where structs generated from this .proto will be
-  // placed.  There is no default.
-  optional string go_package = 11;
-
-
-
-  // Should generic services be generated in each language?  "Generic" services
-  // are not specific to any particular RPC system.  They are generated by the
-  // main code generators in each language (without additional plugins).
-  // Generic services were the only kind of service generation supported by
-  // early versions of proto2.
-  //
-  // Generic services are now considered deprecated in favor of using plugins
-  // that generate code specific to your particular RPC system.  Therefore,
-  // these default to false.  Old code which depends on generic services should
-  // explicitly set them to true.
-  optional bool cc_generic_services = 16 [default=false];
-  optional bool java_generic_services = 17 [default=false];
-  optional bool py_generic_services = 18 [default=false];
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message MessageOptions {
-  // Set true to use the old proto1 MessageSet wire format for extensions.
-  // This is provided for backwards-compatibility with the MessageSet wire
-  // format.  You should not use this for any other reason:  It's less
-  // efficient, has fewer features, and is more complicated.
-  //
-  // The message must be defined exactly as follows:
-  //   message Foo {
-  //     option message_set_wire_format = true;
-  //     extensions 4 to max;
-  //   }
-  // Note that the message cannot have any defined fields; MessageSets only
-  // have extensions.
-  //
-  // All extensions of your type must be singular messages; e.g. they cannot
-  // be int32s, enums, or repeated messages.
-  //
-  // Because this is an option, the above two restrictions are not enforced by
-  // the protocol compiler.
-  optional bool message_set_wire_format = 1 [default=false];
-
-  // Disables the generation of the standard "descriptor()" accessor, which can
-  // conflict with a field of the same name.  This is meant to make migration
-  // from proto1 easier; new code should avoid fields named "descriptor".
-  optional bool no_standard_descriptor_accessor = 2 [default=false];
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message FieldOptions {
-  // The ctype option instructs the C++ code generator to use a different
-  // representation of the field than it normally would.  See the specific
-  // options below.  This option is not yet implemented in the open source
-  // release -- sorry, we'll try to include it in a future version!
-  optional CType ctype = 1 [default = STRING];
-  enum CType {
-    // Default mode.
-    STRING = 0;
-
-    CORD = 1;
-
-    STRING_PIECE = 2;
-  }
-  // The packed option can be enabled for repeated primitive fields to enable
-  // a more efficient representation on the wire. Rather than repeatedly
-  // writing the tag and type for each element, the entire array is encoded as
-  // a single length-delimited blob.
-  optional bool packed = 2;
-
-
-
-  // Should this field be parsed lazily?  Lazy applies only to message-type
-  // fields.  It means that when the outer message is initially parsed, the
-  // inner message's contents will not be parsed but instead stored in encoded
-  // form.  The inner message will actually be parsed when it is first accessed.
-  //
-  // This is only a hint.  Implementations are free to choose whether to use
-  // eager or lazy parsing regardless of the value of this option.  However,
-  // setting this option true suggests that the protocol author believes that
-  // using lazy parsing on this field is worth the additional bookkeeping
-  // overhead typically needed to implement it.
-  //
-  // This option does not affect the public interface of any generated code;
-  // all method signatures remain the same.  Furthermore, thread-safety of the
-  // interface is not affected by this option; const methods remain safe to
-  // call from multiple threads concurrently, while non-const methods continue
-  // to require exclusive access.
-  //
-  //
-  // Note that implementations may choose not to check required fields within
-  // a lazy sub-message.  That is, calling IsInitialized() on the outher message
-  // may return true even if the inner message has missing required fields.
-  // This is necessary because otherwise the inner message would have to be
-  // parsed in order to perform the check, defeating the purpose of lazy
-  // parsing.  An implementation which chooses not to check required fields
-  // must be consistent about it.  That is, for any particular sub-message, the
-  // implementation must either *always* check its required fields, or *never*
-  // check its required fields, regardless of whether or not the message has
-  // been parsed.
-  optional bool lazy = 5 [default=false];
-
-  // Is this field deprecated?
-  // Depending on the target platform, this can emit Deprecated annotations
-  // for accessors, or it will be completely ignored; in the very least, this
-  // is a formalization for deprecating fields.
-  optional bool deprecated = 3 [default=false];
-
-  // EXPERIMENTAL.  DO NOT USE.
-  // For "map" fields, the name of the field in the enclosed type that
-  // is the key for this map.  For example, suppose we have:
-  //   message Item {
-  //     required string name = 1;
-  //     required string value = 2;
-  //   }
-  //   message Config {
-  //     repeated Item items = 1 [experimental_map_key="name"];
-  //   }
-  // In this situation, the map key for Item will be set to "name".
-  // TODO: Fully-implement this, then remove the "experimental_" prefix.
-  optional string experimental_map_key = 9;
-
-  // For Google-internal migration only. Do not use.
-  optional bool weak = 10 [default=false];
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message EnumOptions {
-
-  // Set this option to false to disallow mapping different tag names to a same
-  // value.
-  optional bool allow_alias = 2 [default=true];
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message EnumValueOptions {
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message ServiceOptions {
-
-  // Note:  Field numbers 1 through 32 are reserved for Google's internal RPC
-  //   framework.  We apologize for hoarding these numbers to ourselves, but
-  //   we were already using them long before we decided to release Protocol
-  //   Buffers.
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-message MethodOptions {
-
-  // Note:  Field numbers 1 through 32 are reserved for Google's internal RPC
-  //   framework.  We apologize for hoarding these numbers to ourselves, but
-  //   we were already using them long before we decided to release Protocol
-  //   Buffers.
-
-  // The parser stores options it doesn't recognize here. See above.
-  repeated UninterpretedOption uninterpreted_option = 999;
-
-  // Clients can define custom options in extensions of this message. See above.
-  extensions 1000 to max;
-}
-
-
-// A message representing a option the parser does not recognize. This only
-// appears in options protos created by the compiler::Parser class.
-// DescriptorPool resolves these when building Descriptor objects. Therefore,
-// options protos in descriptor objects (e.g. returned by Descriptor::options(),
-// or produced by Descriptor::CopyTo()) will never have UninterpretedOptions
-// in them.
-message UninterpretedOption {
-  // The name of the uninterpreted option.  Each string represents a segment in
-  // a dot-separated name.  is_extension is true iff a segment represents an
-  // extension (denoted with parentheses in options specs in .proto files).
-  // E.g.,{ ["foo", false], ["bar.baz", true], ["qux", false] } represents
-  // "foo.(bar.baz).qux".
-  message NamePart {
-    required string name_part = 1;
-    required bool is_extension = 2;
-  }
-  repeated NamePart name = 2;
-
-  // The value of the uninterpreted option, in whatever type the tokenizer
-  // identified it as during parsing. Exactly one of these should be set.
-  optional string identifier_value = 3;
-  optional uint64 positive_int_value = 4;
-  optional int64 negative_int_value = 5;
-  optional double double_value = 6;
-  optional bytes string_value = 7;
-  optional string aggregate_value = 8;
-}
-
-// ===================================================================
-// Optional source code info
-
-// Encapsulates information about the original source file from which a
-// FileDescriptorProto was generated.
-message SourceCodeInfo {
-  // A Location identifies a piece of source code in a .proto file which
-  // corresponds to a particular definition.  This information is intended
-  // to be useful to IDEs, code indexers, documentation generators, and similar
-  // tools.
-  //
-  // For example, say we have a file like:
-  //   message Foo {
-  //     optional string foo = 1;
-  //   }
-  // Let's look at just the field definition:
-  //   optional string foo = 1;
-  //   ^       ^^     ^^  ^  ^^^
-  //   a       bc     de  f  ghi
-  // We have the following locations:
-  //   span   path               represents
-  //   [a,i)  [ 4, 0, 2, 0 ]     The whole field definition.
-  //   [a,b)  [ 4, 0, 2, 0, 4 ]  The label (optional).
-  //   [c,d)  [ 4, 0, 2, 0, 5 ]  The type (string).
-  //   [e,f)  [ 4, 0, 2, 0, 1 ]  The name (foo).
-  //   [g,h)  [ 4, 0, 2, 0, 3 ]  The number (1).
-  //
-  // Notes:
-  // - A location may refer to a repeated field itself (i.e. not to any
-  //   particular index within it).  This is used whenever a set of elements are
-  //   logically enclosed in a single code segment.  For example, an entire
-  //   extend block (possibly containing multiple extension definitions) will
-  //   have an outer location whose path refers to the "extensions" repeated
-  //   field without an index.
-  // - Multiple locations may have the same path.  This happens when a single
-  //   logical declaration is spread out across multiple places.  The most
-  //   obvious example is the "extend" block again -- there may be multiple
-  //   extend blocks in the same scope, each of which will have the same path.
-  // - A location's span is not always a subset of its parent's span.  For
-  //   example, the "extendee" of an extension declaration appears at the
-  //   beginning of the "extend" block and is shared by all extensions within
-  //   the block.
-  // - Just because a location's span is a subset of some other location's span
-  //   does not mean that it is a descendent.  For example, a "group" defines
-  //   both a type and a field in a single declaration.  Thus, the locations
-  //   corresponding to the type and field and their components will overlap.
-  // - Code which tries to interpret locations should probably be designed to
-  //   ignore those that it doesn't understand, as more types of locations could
-  //   be recorded in the future.
-  repeated Location location = 1;
-  message Location {
-    // Identifies which part of the FileDescriptorProto was defined at this
-    // location.
-    //
-    // Each element is a field number or an index.  They form a path from
-    // the root FileDescriptorProto to the place where the definition.  For
-    // example, this path:
-    //   [ 4, 3, 2, 7, 1 ]
-    // refers to:
-    //   file.message_type(3)  // 4, 3
-    //       .field(7)         // 2, 7
-    //       .name()           // 1
-    // This is because FileDescriptorProto.message_type has field number 4:
-    //   repeated DescriptorProto message_type = 4;
-    // and DescriptorProto.field has field number 2:
-    //   repeated FieldDescriptorProto field = 2;
-    // and FieldDescriptorProto.name has field number 1:
-    //   optional string name = 1;
-    //
-    // Thus, the above path gives the location of a field name.  If we removed
-    // the last element:
-    //   [ 4, 3, 2, 7 ]
-    // this path refers to the whole field declaration (from the beginning
-    // of the label to the terminating semicolon).
-    repeated int32 path = 1 [packed=true];
-
-    // Always has exactly three or four elements: start line, start column,
-    // end line (optional, otherwise assumed same as start line), end column.
-    // These are packed into a single field for efficiency.  Note that line
-    // and column numbers are zero-based -- typically you will want to add
-    // 1 to each before displaying to a user.
-    repeated int32 span = 2 [packed=true];
-
-    // If this SourceCodeInfo represents a complete declaration, these are any
-    // comments appearing before and after the declaration which appear to be
-    // attached to the declaration.
-    //
-    // A series of line comments appearing on consecutive lines, with no other
-    // tokens appearing on those lines, will be treated as a single comment.
-    //
-    // Only the comment content is provided; comment markers (e.g. //) are
-    // stripped out.  For block comments, leading whitespace and an asterisk
-    // will be stripped from the beginning of each line other than the first.
-    // Newlines are included in the output.
-    //
-    // Examples:
-    //
-    //   optional int32 foo = 1;  // Comment attached to foo.
-    //   // Comment attached to bar.
-    //   optional int32 bar = 2;
-    //
-    //   optional string baz = 3;
-    //   // Comment attached to baz.
-    //   // Another line attached to baz.
-    //
-    //   // Comment attached to qux.
-    //   //
-    //   // Another line attached to qux.
-    //   optional double qux = 4;
-    //
-    //   optional string corge = 5;
-    //   /* Block comment attached
-    //    * to corge.  Leading asterisks
-    //    * will be removed. */
-    //   /* Block comment attached to
-    //    * grault. */
-    //   optional int32 grault = 6;
-    optional string leading_comments = 3;
-    optional string trailing_comments = 4;
-  }
-}
diff --git a/ps-lite/deps/include/google/protobuf/descriptor_database.h b/ps-lite/deps/include/google/protobuf/descriptor_database.h
deleted file mode 100644
index 2ccb1458..00000000
--- a/ps-lite/deps/include/google/protobuf/descriptor_database.h
+++ /dev/null
@@ -1,367 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Interface for manipulating databases of descriptors.
-
-#ifndef GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
-#define GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
-
-#include <map>
-#include <string>
-#include <utility>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/descriptor.h>
-
-namespace google {
-namespace protobuf {
-
-// Defined in this file.
-class DescriptorDatabase;
-class SimpleDescriptorDatabase;
-class EncodedDescriptorDatabase;
-class DescriptorPoolDatabase;
-class MergedDescriptorDatabase;
-
-// Abstract interface for a database of descriptors.
-//
-// This is useful if you want to create a DescriptorPool which loads
-// descriptors on-demand from some sort of large database.  If the database
-// is large, it may be inefficient to enumerate every .proto file inside it
-// calling DescriptorPool::BuildFile() for each one.  Instead, a DescriptorPool
-// can be created which wraps a DescriptorDatabase and only builds particular
-// descriptors when they are needed.
-class LIBPROTOBUF_EXPORT DescriptorDatabase {
- public:
-  inline DescriptorDatabase() {}
-  virtual ~DescriptorDatabase();
-
-  // Find a file by file name.  Fills in in *output and returns true if found.
-  // Otherwise, returns false, leaving the contents of *output undefined.
-  virtual bool FindFileByName(const string& filename,
-                              FileDescriptorProto* output) = 0;
-
-  // Find the file that declares the given fully-qualified symbol name.
-  // If found, fills in *output and returns true, otherwise returns false
-  // and leaves *output undefined.
-  virtual bool FindFileContainingSymbol(const string& symbol_name,
-                                        FileDescriptorProto* output) = 0;
-
-  // Find the file which defines an extension extending the given message type
-  // with the given field number.  If found, fills in *output and returns true,
-  // otherwise returns false and leaves *output undefined.  containing_type
-  // must be a fully-qualified type name.
-  virtual bool FindFileContainingExtension(const string& containing_type,
-                                           int field_number,
-                                           FileDescriptorProto* output) = 0;
-
-  // Finds the tag numbers used by all known extensions of
-  // extendee_type, and appends them to output in an undefined
-  // order. This method is best-effort: it's not guaranteed that the
-  // database will find all extensions, and it's not guaranteed that
-  // FindFileContainingExtension will return true on all of the found
-  // numbers. Returns true if the search was successful, otherwise
-  // returns false and leaves output unchanged.
-  //
-  // This method has a default implementation that always returns
-  // false.
-  virtual bool FindAllExtensionNumbers(const string& extendee_type,
-                                       vector<int>* output) {
-    return false;
-  }
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorDatabase);
-};
-
-// A DescriptorDatabase into which you can insert files manually.
-//
-// FindFileContainingSymbol() is fully-implemented.  When you add a file, its
-// symbols will be indexed for this purpose.  Note that the implementation
-// may return false positives, but only if it isn't possible for the symbol
-// to be defined in any other file.  In particular, if a file defines a symbol
-// "Foo", then searching for "Foo.[anything]" will match that file.  This way,
-// the database does not need to aggressively index all children of a symbol.
-//
-// FindFileContainingExtension() is mostly-implemented.  It works if and only
-// if the original FieldDescriptorProto defining the extension has a
-// fully-qualified type name in its "extendee" field (i.e. starts with a '.').
-// If the extendee is a relative name, SimpleDescriptorDatabase will not
-// attempt to resolve the type, so it will not know what type the extension is
-// extending.  Therefore, calling FindFileContainingExtension() with the
-// extension's containing type will never actually find that extension.  Note
-// that this is an unlikely problem, as all FileDescriptorProtos created by the
-// protocol compiler (as well as ones created by calling
-// FileDescriptor::CopyTo()) will always use fully-qualified names for all
-// types.  You only need to worry if you are constructing FileDescriptorProtos
-// yourself, or are calling compiler::Parser directly.
-class LIBPROTOBUF_EXPORT SimpleDescriptorDatabase : public DescriptorDatabase {
- public:
-  SimpleDescriptorDatabase();
-  ~SimpleDescriptorDatabase();
-
-  // Adds the FileDescriptorProto to the database, making a copy.  The object
-  // can be deleted after Add() returns.  Returns false if the file conflicted
-  // with a file already in the database, in which case an error will have
-  // been written to GOOGLE_LOG(ERROR).
-  bool Add(const FileDescriptorProto& file);
-
-  // Adds the FileDescriptorProto to the database and takes ownership of it.
-  bool AddAndOwn(const FileDescriptorProto* file);
-
-  // implements DescriptorDatabase -----------------------------------
-  bool FindFileByName(const string& filename,
-                      FileDescriptorProto* output);
-  bool FindFileContainingSymbol(const string& symbol_name,
-                                FileDescriptorProto* output);
-  bool FindFileContainingExtension(const string& containing_type,
-                                   int field_number,
-                                   FileDescriptorProto* output);
-  bool FindAllExtensionNumbers(const string& extendee_type,
-                               vector<int>* output);
-
- private:
-  // So that it can use DescriptorIndex.
-  friend class EncodedDescriptorDatabase;
-
-  // An index mapping file names, symbol names, and extension numbers to
-  // some sort of values.
-  template <typename Value>
-  class DescriptorIndex {
-   public:
-    // Helpers to recursively add particular descriptors and all their contents
-    // to the index.
-    bool AddFile(const FileDescriptorProto& file,
-                 Value value);
-    bool AddSymbol(const string& name, Value value);
-    bool AddNestedExtensions(const DescriptorProto& message_type,
-                             Value value);
-    bool AddExtension(const FieldDescriptorProto& field,
-                      Value value);
-
-    Value FindFile(const string& filename);
-    Value FindSymbol(const string& name);
-    Value FindExtension(const string& containing_type, int field_number);
-    bool FindAllExtensionNumbers(const string& containing_type,
-                                 vector<int>* output);
-
-   private:
-    map<string, Value> by_name_;
-    map<string, Value> by_symbol_;
-    map<pair<string, int>, Value> by_extension_;
-
-    // Invariant:  The by_symbol_ map does not contain any symbols which are
-    // prefixes of other symbols in the map.  For example, "foo.bar" is a
-    // prefix of "foo.bar.baz" (but is not a prefix of "foo.barbaz").
-    //
-    // This invariant is important because it means that given a symbol name,
-    // we can find a key in the map which is a prefix of the symbol in O(lg n)
-    // time, and we know that there is at most one such key.
-    //
-    // The prefix lookup algorithm works like so:
-    // 1) Find the last key in the map which is less than or equal to the
-    //    search key.
-    // 2) If the found key is a prefix of the search key, then return it.
-    //    Otherwise, there is no match.
-    //
-    // I am sure this algorithm has been described elsewhere, but since I
-    // wasn't able to find it quickly I will instead prove that it works
-    // myself.  The key to the algorithm is that if a match exists, step (1)
-    // will find it.  Proof:
-    // 1) Define the "search key" to be the key we are looking for, the "found
-    //    key" to be the key found in step (1), and the "match key" to be the
-    //    key which actually matches the serach key (i.e. the key we're trying
-    //    to find).
-    // 2) The found key must be less than or equal to the search key by
-    //    definition.
-    // 3) The match key must also be less than or equal to the search key
-    //    (because it is a prefix).
-    // 4) The match key cannot be greater than the found key, because if it
-    //    were, then step (1) of the algorithm would have returned the match
-    //    key instead (since it finds the *greatest* key which is less than or
-    //    equal to the search key).
-    // 5) Therefore, the found key must be between the match key and the search
-    //    key, inclusive.
-    // 6) Since the search key must be a sub-symbol of the match key, if it is
-    //    not equal to the match key, then search_key[match_key.size()] must
-    //    be '.'.
-    // 7) Since '.' sorts before any other character that is valid in a symbol
-    //    name, then if the found key is not equal to the match key, then
-    //    found_key[match_key.size()] must also be '.', because any other value
-    //    would make it sort after the search key.
-    // 8) Therefore, if the found key is not equal to the match key, then the
-    //    found key must be a sub-symbol of the match key.  However, this would
-    //    contradict our map invariant which says that no symbol in the map is
-    //    a sub-symbol of any other.
-    // 9) Therefore, the found key must match the match key.
-    //
-    // The above proof assumes the match key exists.  In the case that the
-    // match key does not exist, then step (1) will return some other symbol.
-    // That symbol cannot be a super-symbol of the search key since if it were,
-    // then it would be a match, and we're assuming the match key doesn't exist.
-    // Therefore, step 2 will correctly return no match.
-
-    // Find the last entry in the by_symbol_ map whose key is less than or
-    // equal to the given name.
-    typename map<string, Value>::iterator FindLastLessOrEqual(
-        const string& name);
-
-    // True if either the arguments are equal or super_symbol identifies a
-    // parent symbol of sub_symbol (e.g. "foo.bar" is a parent of
-    // "foo.bar.baz", but not a parent of "foo.barbaz").
-    bool IsSubSymbol(const string& sub_symbol, const string& super_symbol);
-
-    // Returns true if and only if all characters in the name are alphanumerics,
-    // underscores, or periods.
-    bool ValidateSymbolName(const string& name);
-  };
-
-
-  DescriptorIndex<const FileDescriptorProto*> index_;
-  vector<const FileDescriptorProto*> files_to_delete_;
-
-  // If file is non-NULL, copy it into *output and return true, otherwise
-  // return false.
-  bool MaybeCopy(const FileDescriptorProto* file,
-                 FileDescriptorProto* output);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(SimpleDescriptorDatabase);
-};
-
-// Very similar to SimpleDescriptorDatabase, but stores all the descriptors
-// as raw bytes and generally tries to use as little memory as possible.
-//
-// The same caveats regarding FindFileContainingExtension() apply as with
-// SimpleDescriptorDatabase.
-class LIBPROTOBUF_EXPORT EncodedDescriptorDatabase : public DescriptorDatabase {
- public:
-  EncodedDescriptorDatabase();
-  ~EncodedDescriptorDatabase();
-
-  // Adds the FileDescriptorProto to the database.  The descriptor is provided
-  // in encoded form.  The database does not make a copy of the bytes, nor
-  // does it take ownership; it's up to the caller to make sure the bytes
-  // remain valid for the life of the database.  Returns false and logs an error
-  // if the bytes are not a valid FileDescriptorProto or if the file conflicted
-  // with a file already in the database.
-  bool Add(const void* encoded_file_descriptor, int size);
-
-  // Like Add(), but makes a copy of the data, so that the caller does not
-  // need to keep it around.
-  bool AddCopy(const void* encoded_file_descriptor, int size);
-
-  // Like FindFileContainingSymbol but returns only the name of the file.
-  bool FindNameOfFileContainingSymbol(const string& symbol_name,
-                                      string* output);
-
-  // implements DescriptorDatabase -----------------------------------
-  bool FindFileByName(const string& filename,
-                      FileDescriptorProto* output);
-  bool FindFileContainingSymbol(const string& symbol_name,
-                                FileDescriptorProto* output);
-  bool FindFileContainingExtension(const string& containing_type,
-                                   int field_number,
-                                   FileDescriptorProto* output);
-  bool FindAllExtensionNumbers(const string& extendee_type,
-                               vector<int>* output);
-
- private:
-  SimpleDescriptorDatabase::DescriptorIndex<pair<const void*, int> > index_;
-  vector<void*> files_to_delete_;
-
-  // If encoded_file.first is non-NULL, parse the data into *output and return
-  // true, otherwise return false.
-  bool MaybeParse(pair<const void*, int> encoded_file,
-                  FileDescriptorProto* output);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(EncodedDescriptorDatabase);
-};
-
-// A DescriptorDatabase that fetches files from a given pool.
-class LIBPROTOBUF_EXPORT DescriptorPoolDatabase : public DescriptorDatabase {
- public:
-  DescriptorPoolDatabase(const DescriptorPool& pool);
-  ~DescriptorPoolDatabase();
-
-  // implements DescriptorDatabase -----------------------------------
-  bool FindFileByName(const string& filename,
-                      FileDescriptorProto* output);
-  bool FindFileContainingSymbol(const string& symbol_name,
-                                FileDescriptorProto* output);
-  bool FindFileContainingExtension(const string& containing_type,
-                                   int field_number,
-                                   FileDescriptorProto* output);
-  bool FindAllExtensionNumbers(const string& extendee_type,
-                               vector<int>* output);
-
- private:
-  const DescriptorPool& pool_;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DescriptorPoolDatabase);
-};
-
-// A DescriptorDatabase that wraps two or more others.  It first searches the
-// first database and, if that fails, tries the second, and so on.
-class LIBPROTOBUF_EXPORT MergedDescriptorDatabase : public DescriptorDatabase {
- public:
-  // Merge just two databases.  The sources remain property of the caller.
-  MergedDescriptorDatabase(DescriptorDatabase* source1,
-                           DescriptorDatabase* source2);
-  // Merge more than two databases.  The sources remain property of the caller.
-  // The vector may be deleted after the constructor returns but the
-  // DescriptorDatabases need to stick around.
-  MergedDescriptorDatabase(const vector<DescriptorDatabase*>& sources);
-  ~MergedDescriptorDatabase();
-
-  // implements DescriptorDatabase -----------------------------------
-  bool FindFileByName(const string& filename,
-                      FileDescriptorProto* output);
-  bool FindFileContainingSymbol(const string& symbol_name,
-                                FileDescriptorProto* output);
-  bool FindFileContainingExtension(const string& containing_type,
-                                   int field_number,
-                                   FileDescriptorProto* output);
-  // Merges the results of calling all databases. Returns true iff any
-  // of the databases returned true.
-  bool FindAllExtensionNumbers(const string& extendee_type,
-                               vector<int>* output);
-
- private:
-  vector<DescriptorDatabase*> sources_;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MergedDescriptorDatabase);
-};
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__
diff --git a/ps-lite/deps/include/google/protobuf/dynamic_message.h b/ps-lite/deps/include/google/protobuf/dynamic_message.h
deleted file mode 100644
index b3d1e5d2..00000000
--- a/ps-lite/deps/include/google/protobuf/dynamic_message.h
+++ /dev/null
@@ -1,136 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Defines an implementation of Message which can emulate types which are not
-// known at compile-time.
-
-#ifndef GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
-#define GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
-
-#include <google/protobuf/message.h>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-
-// Defined in other files.
-class Descriptor;        // descriptor.h
-class DescriptorPool;    // descriptor.h
-
-// Constructs implementations of Message which can emulate types which are not
-// known at compile-time.
-//
-// Sometimes you want to be able to manipulate protocol types that you don't
-// know about at compile time.  It would be nice to be able to construct
-// a Message object which implements the message type given by any arbitrary
-// Descriptor.  DynamicMessage provides this.
-//
-// As it turns out, a DynamicMessage needs to construct extra
-// information about its type in order to operate.  Most of this information
-// can be shared between all DynamicMessages of the same type.  But, caching
-// this information in some sort of global map would be a bad idea, since
-// the cached information for a particular descriptor could outlive the
-// descriptor itself.  To avoid this problem, DynamicMessageFactory
-// encapsulates this "cache".  All DynamicMessages of the same type created
-// from the same factory will share the same support data.  Any Descriptors
-// used with a particular factory must outlive the factory.
-class LIBPROTOBUF_EXPORT DynamicMessageFactory : public MessageFactory {
- public:
-  // Construct a DynamicMessageFactory that will search for extensions in
-  // the DescriptorPool in which the extendee is defined.
-  DynamicMessageFactory();
-
-  // Construct a DynamicMessageFactory that will search for extensions in
-  // the given DescriptorPool.
-  //
-  // DEPRECATED:  Use CodedInputStream::SetExtensionRegistry() to tell the
-  //   parser to look for extensions in an alternate pool.  However, note that
-  //   this is almost never what you want to do.  Almost all users should use
-  //   the zero-arg constructor.
-  DynamicMessageFactory(const DescriptorPool* pool);
-
-  ~DynamicMessageFactory();
-
-  // Call this to tell the DynamicMessageFactory that if it is given a
-  // Descriptor d for which:
-  //   d->file()->pool() == DescriptorPool::generated_pool(),
-  // then it should delegate to MessageFactory::generated_factory() instead
-  // of constructing a dynamic implementation of the message.  In theory there
-  // is no down side to doing this, so it may become the default in the future.
-  void SetDelegateToGeneratedFactory(bool enable) {
-    delegate_to_generated_factory_ = enable;
-  }
-
-  // implements MessageFactory ---------------------------------------
-
-  // Given a Descriptor, constructs the default (prototype) Message of that
-  // type.  You can then call that message's New() method to construct a
-  // mutable message of that type.
-  //
-  // Calling this method twice with the same Descriptor returns the same
-  // object.  The returned object remains property of the factory and will
-  // be destroyed when the factory is destroyed.  Also, any objects created
-  // by calling the prototype's New() method share some data with the
-  // prototype, so these must be destroyed before the DynamicMessageFactory
-  // is destroyed.
-  //
-  // The given descriptor must outlive the returned message, and hence must
-  // outlive the DynamicMessageFactory.
-  //
-  // The method is thread-safe.
-  const Message* GetPrototype(const Descriptor* type);
-
- private:
-  const DescriptorPool* pool_;
-  bool delegate_to_generated_factory_;
-
-  // This struct just contains a hash_map.  We can't #include <google/protobuf/stubs/hash.h> from
-  // this header due to hacks needed for hash_map portability in the open source
-  // release.  Namely, stubs/hash.h, which defines hash_map portably, is not a
-  // public header (for good reason), but dynamic_message.h is, and public
-  // headers may only #include other public headers.
-  struct PrototypeMap;
-  scoped_ptr<PrototypeMap> prototypes_;
-  mutable Mutex prototypes_mutex_;
-
-  friend class DynamicMessage;
-  const Message* GetPrototypeNoLock(const Descriptor* type);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(DynamicMessageFactory);
-};
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__
diff --git a/ps-lite/deps/include/google/protobuf/extension_set.h b/ps-lite/deps/include/google/protobuf/extension_set.h
deleted file mode 100644
index df8f1f36..00000000
--- a/ps-lite/deps/include/google/protobuf/extension_set.h
+++ /dev/null
@@ -1,1007 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-
-#ifndef GOOGLE_PROTOBUF_EXTENSION_SET_H__
-#define GOOGLE_PROTOBUF_EXTENSION_SET_H__
-
-#include <vector>
-#include <map>
-#include <utility>
-#include <string>
-
-
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-
-namespace protobuf {
-  class Descriptor;                                    // descriptor.h
-  class FieldDescriptor;                               // descriptor.h
-  class DescriptorPool;                                // descriptor.h
-  class MessageLite;                                   // message_lite.h
-  class Message;                                       // message.h
-  class MessageFactory;                                // message.h
-  class UnknownFieldSet;                               // unknown_field_set.h
-  namespace io {
-    class CodedInputStream;                              // coded_stream.h
-    class CodedOutputStream;                             // coded_stream.h
-  }
-  namespace internal {
-    class FieldSkipper;                                  // wire_format_lite.h
-    class RepeatedPtrFieldBase;                          // repeated_field.h
-  }
-  template <typename Element> class RepeatedField;     // repeated_field.h
-  template <typename Element> class RepeatedPtrField;  // repeated_field.h
-}
-
-namespace protobuf {
-namespace internal {
-
-// Used to store values of type WireFormatLite::FieldType without having to
-// #include wire_format_lite.h.  Also, ensures that we use only one byte to
-// store these values, which is important to keep the layout of
-// ExtensionSet::Extension small.
-typedef uint8 FieldType;
-
-// A function which, given an integer value, returns true if the number
-// matches one of the defined values for the corresponding enum type.  This
-// is used with RegisterEnumExtension, below.
-typedef bool EnumValidityFunc(int number);
-
-// Version of the above which takes an argument.  This is needed to deal with
-// extensions that are not compiled in.
-typedef bool EnumValidityFuncWithArg(const void* arg, int number);
-
-// Information about a registered extension.
-struct ExtensionInfo {
-  inline ExtensionInfo() {}
-  inline ExtensionInfo(FieldType type_param, bool isrepeated, bool ispacked)
-      : type(type_param), is_repeated(isrepeated), is_packed(ispacked),
-        descriptor(NULL) {}
-
-  FieldType type;
-  bool is_repeated;
-  bool is_packed;
-
-  struct EnumValidityCheck {
-    EnumValidityFuncWithArg* func;
-    const void* arg;
-  };
-
-  union {
-    EnumValidityCheck enum_validity_check;
-    const MessageLite* message_prototype;
-  };
-
-  // The descriptor for this extension, if one exists and is known.  May be
-  // NULL.  Must not be NULL if the descriptor for the extension does not
-  // live in the same pool as the descriptor for the containing type.
-  const FieldDescriptor* descriptor;
-};
-
-// Abstract interface for an object which looks up extension definitions.  Used
-// when parsing.
-class LIBPROTOBUF_EXPORT ExtensionFinder {
- public:
-  virtual ~ExtensionFinder();
-
-  // Find the extension with the given containing type and number.
-  virtual bool Find(int number, ExtensionInfo* output) = 0;
-};
-
-// Implementation of ExtensionFinder which finds extensions defined in .proto
-// files which have been compiled into the binary.
-class LIBPROTOBUF_EXPORT GeneratedExtensionFinder : public ExtensionFinder {
- public:
-  GeneratedExtensionFinder(const MessageLite* containing_type)
-      : containing_type_(containing_type) {}
-  virtual ~GeneratedExtensionFinder() {}
-
-  // Returns true and fills in *output if found, otherwise returns false.
-  virtual bool Find(int number, ExtensionInfo* output);
-
- private:
-  const MessageLite* containing_type_;
-};
-
-// Note:  extension_set_heavy.cc defines DescriptorPoolExtensionFinder for
-// finding extensions from a DescriptorPool.
-
-// This is an internal helper class intended for use within the protocol buffer
-// library and generated classes.  Clients should not use it directly.  Instead,
-// use the generated accessors such as GetExtension() of the class being
-// extended.
-//
-// This class manages extensions for a protocol message object.  The
-// message's HasExtension(), GetExtension(), MutableExtension(), and
-// ClearExtension() methods are just thin wrappers around the embedded
-// ExtensionSet.  When parsing, if a tag number is encountered which is
-// inside one of the message type's extension ranges, the tag is passed
-// off to the ExtensionSet for parsing.  Etc.
-class LIBPROTOBUF_EXPORT ExtensionSet {
- public:
-  ExtensionSet();
-  ~ExtensionSet();
-
-  // These are called at startup by protocol-compiler-generated code to
-  // register known extensions.  The registrations are used by ParseField()
-  // to look up extensions for parsed field numbers.  Note that dynamic parsing
-  // does not use ParseField(); only protocol-compiler-generated parsing
-  // methods do.
-  static void RegisterExtension(const MessageLite* containing_type,
-                                int number, FieldType type,
-                                bool is_repeated, bool is_packed);
-  static void RegisterEnumExtension(const MessageLite* containing_type,
-                                    int number, FieldType type,
-                                    bool is_repeated, bool is_packed,
-                                    EnumValidityFunc* is_valid);
-  static void RegisterMessageExtension(const MessageLite* containing_type,
-                                       int number, FieldType type,
-                                       bool is_repeated, bool is_packed,
-                                       const MessageLite* prototype);
-
-  // =================================================================
-
-  // Add all fields which are currently present to the given vector.  This
-  // is useful to implement Reflection::ListFields().
-  void AppendToList(const Descriptor* containing_type,
-                    const DescriptorPool* pool,
-                    vector<const FieldDescriptor*>* output) const;
-
-  // =================================================================
-  // Accessors
-  //
-  // Generated message classes include type-safe templated wrappers around
-  // these methods.  Generally you should use those rather than call these
-  // directly, unless you are doing low-level memory management.
-  //
-  // When calling any of these accessors, the extension number requested
-  // MUST exist in the DescriptorPool provided to the constructor.  Otheriwse,
-  // the method will fail an assert.  Normally, though, you would not call
-  // these directly; you would either call the generated accessors of your
-  // message class (e.g. GetExtension()) or you would call the accessors
-  // of the reflection interface.  In both cases, it is impossible to
-  // trigger this assert failure:  the generated accessors only accept
-  // linked-in extension types as parameters, while the Reflection interface
-  // requires you to provide the FieldDescriptor describing the extension.
-  //
-  // When calling any of these accessors, a protocol-compiler-generated
-  // implementation of the extension corresponding to the number MUST
-  // be linked in, and the FieldDescriptor used to refer to it MUST be
-  // the one generated by that linked-in code.  Otherwise, the method will
-  // die on an assert failure.  The message objects returned by the message
-  // accessors are guaranteed to be of the correct linked-in type.
-  //
-  // These methods pretty much match Reflection except that:
-  // - They're not virtual.
-  // - They identify fields by number rather than FieldDescriptors.
-  // - They identify enum values using integers rather than descriptors.
-  // - Strings provide Mutable() in addition to Set() accessors.
-
-  bool Has(int number) const;
-  int ExtensionSize(int number) const;   // Size of a repeated extension.
-  int NumExtensions() const;  // The number of extensions
-  FieldType ExtensionType(int number) const;
-  void ClearExtension(int number);
-
-  // singular fields -------------------------------------------------
-
-  int32  GetInt32 (int number, int32  default_value) const;
-  int64  GetInt64 (int number, int64  default_value) const;
-  uint32 GetUInt32(int number, uint32 default_value) const;
-  uint64 GetUInt64(int number, uint64 default_value) const;
-  float  GetFloat (int number, float  default_value) const;
-  double GetDouble(int number, double default_value) const;
-  bool   GetBool  (int number, bool   default_value) const;
-  int    GetEnum  (int number, int    default_value) const;
-  const string & GetString (int number, const string&  default_value) const;
-  const MessageLite& GetMessage(int number,
-                                const MessageLite& default_value) const;
-  const MessageLite& GetMessage(int number, const Descriptor* message_type,
-                                MessageFactory* factory) const;
-
-  // |descriptor| may be NULL so long as it is known that the descriptor for
-  // the extension lives in the same pool as the descriptor for the containing
-  // type.
-#define desc const FieldDescriptor* descriptor  // avoid line wrapping
-  void SetInt32 (int number, FieldType type, int32  value, desc);
-  void SetInt64 (int number, FieldType type, int64  value, desc);
-  void SetUInt32(int number, FieldType type, uint32 value, desc);
-  void SetUInt64(int number, FieldType type, uint64 value, desc);
-  void SetFloat (int number, FieldType type, float  value, desc);
-  void SetDouble(int number, FieldType type, double value, desc);
-  void SetBool  (int number, FieldType type, bool   value, desc);
-  void SetEnum  (int number, FieldType type, int    value, desc);
-  void SetString(int number, FieldType type, const string& value, desc);
-  string * MutableString (int number, FieldType type, desc);
-  MessageLite* MutableMessage(int number, FieldType type,
-                              const MessageLite& prototype, desc);
-  MessageLite* MutableMessage(const FieldDescriptor* decsriptor,
-                              MessageFactory* factory);
-  // Adds the given message to the ExtensionSet, taking ownership of the
-  // message object. Existing message with the same number will be deleted.
-  // If "message" is NULL, this is equivalent to "ClearExtension(number)".
-  void SetAllocatedMessage(int number, FieldType type,
-                           const FieldDescriptor* descriptor,
-                           MessageLite* message);
-  MessageLite* ReleaseMessage(int number, const MessageLite& prototype);
-  MessageLite* ReleaseMessage(const FieldDescriptor* descriptor,
-                              MessageFactory* factory);
-#undef desc
-
-  // repeated fields -------------------------------------------------
-
-  void* MutableRawRepeatedField(int number);
-
-  int32  GetRepeatedInt32 (int number, int index) const;
-  int64  GetRepeatedInt64 (int number, int index) const;
-  uint32 GetRepeatedUInt32(int number, int index) const;
-  uint64 GetRepeatedUInt64(int number, int index) const;
-  float  GetRepeatedFloat (int number, int index) const;
-  double GetRepeatedDouble(int number, int index) const;
-  bool   GetRepeatedBool  (int number, int index) const;
-  int    GetRepeatedEnum  (int number, int index) const;
-  const string & GetRepeatedString (int number, int index) const;
-  const MessageLite& GetRepeatedMessage(int number, int index) const;
-
-  void SetRepeatedInt32 (int number, int index, int32  value);
-  void SetRepeatedInt64 (int number, int index, int64  value);
-  void SetRepeatedUInt32(int number, int index, uint32 value);
-  void SetRepeatedUInt64(int number, int index, uint64 value);
-  void SetRepeatedFloat (int number, int index, float  value);
-  void SetRepeatedDouble(int number, int index, double value);
-  void SetRepeatedBool  (int number, int index, bool   value);
-  void SetRepeatedEnum  (int number, int index, int    value);
-  void SetRepeatedString(int number, int index, const string& value);
-  string * MutableRepeatedString (int number, int index);
-  MessageLite* MutableRepeatedMessage(int number, int index);
-
-#define desc const FieldDescriptor* descriptor  // avoid line wrapping
-  void AddInt32 (int number, FieldType type, bool packed, int32  value, desc);
-  void AddInt64 (int number, FieldType type, bool packed, int64  value, desc);
-  void AddUInt32(int number, FieldType type, bool packed, uint32 value, desc);
-  void AddUInt64(int number, FieldType type, bool packed, uint64 value, desc);
-  void AddFloat (int number, FieldType type, bool packed, float  value, desc);
-  void AddDouble(int number, FieldType type, bool packed, double value, desc);
-  void AddBool  (int number, FieldType type, bool packed, bool   value, desc);
-  void AddEnum  (int number, FieldType type, bool packed, int    value, desc);
-  void AddString(int number, FieldType type, const string& value, desc);
-  string * AddString (int number, FieldType type, desc);
-  MessageLite* AddMessage(int number, FieldType type,
-                          const MessageLite& prototype, desc);
-  MessageLite* AddMessage(const FieldDescriptor* descriptor,
-                          MessageFactory* factory);
-#undef desc
-
-  void RemoveLast(int number);
-  MessageLite* ReleaseLast(int number);
-  void SwapElements(int number, int index1, int index2);
-
-  // -----------------------------------------------------------------
-  // TODO(kenton):  Hardcore memory management accessors
-
-  // =================================================================
-  // convenience methods for implementing methods of Message
-  //
-  // These could all be implemented in terms of the other methods of this
-  // class, but providing them here helps keep the generated code size down.
-
-  void Clear();
-  void MergeFrom(const ExtensionSet& other);
-  void Swap(ExtensionSet* other);
-  bool IsInitialized() const;
-
-  // Parses a single extension from the input. The input should start out
-  // positioned immediately after the tag.
-  bool ParseField(uint32 tag, io::CodedInputStream* input,
-                  ExtensionFinder* extension_finder,
-                  FieldSkipper* field_skipper);
-
-  // Specific versions for lite or full messages (constructs the appropriate
-  // FieldSkipper automatically).  |containing_type| is the default
-  // instance for the containing message; it is used only to look up the
-  // extension by number.  See RegisterExtension(), above.  Unlike the other
-  // methods of ExtensionSet, this only works for generated message types --
-  // it looks up extensions registered using RegisterExtension().
-  bool ParseField(uint32 tag, io::CodedInputStream* input,
-                  const MessageLite* containing_type);
-  bool ParseField(uint32 tag, io::CodedInputStream* input,
-                  const Message* containing_type,
-                  UnknownFieldSet* unknown_fields);
-
-  // Parse an entire message in MessageSet format.  Such messages have no
-  // fields, only extensions.
-  bool ParseMessageSet(io::CodedInputStream* input,
-                       ExtensionFinder* extension_finder,
-                       FieldSkipper* field_skipper);
-
-  // Specific versions for lite or full messages (constructs the appropriate
-  // FieldSkipper automatically).
-  bool ParseMessageSet(io::CodedInputStream* input,
-                       const MessageLite* containing_type);
-  bool ParseMessageSet(io::CodedInputStream* input,
-                       const Message* containing_type,
-                       UnknownFieldSet* unknown_fields);
-
-  // Write all extension fields with field numbers in the range
-  //   [start_field_number, end_field_number)
-  // to the output stream, using the cached sizes computed when ByteSize() was
-  // last called.  Note that the range bounds are inclusive-exclusive.
-  void SerializeWithCachedSizes(int start_field_number,
-                                int end_field_number,
-                                io::CodedOutputStream* output) const;
-
-  // Same as SerializeWithCachedSizes, but without any bounds checking.
-  // The caller must ensure that target has sufficient capacity for the
-  // serialized extensions.
-  //
-  // Returns a pointer past the last written byte.
-  uint8* SerializeWithCachedSizesToArray(int start_field_number,
-                                         int end_field_number,
-                                         uint8* target) const;
-
-  // Like above but serializes in MessageSet format.
-  void SerializeMessageSetWithCachedSizes(io::CodedOutputStream* output) const;
-  uint8* SerializeMessageSetWithCachedSizesToArray(uint8* target) const;
-
-  // Returns the total serialized size of all the extensions.
-  int ByteSize() const;
-
-  // Like ByteSize() but uses MessageSet format.
-  int MessageSetByteSize() const;
-
-  // Returns (an estimate of) the total number of bytes used for storing the
-  // extensions in memory, excluding sizeof(*this).  If the ExtensionSet is
-  // for a lite message (and thus possibly contains lite messages), the results
-  // are undefined (might work, might crash, might corrupt data, might not even
-  // be linked in).  It's up to the protocol compiler to avoid calling this on
-  // such ExtensionSets (easy enough since lite messages don't implement
-  // SpaceUsed()).
-  int SpaceUsedExcludingSelf() const;
-
- private:
-
-  // Interface of a lazily parsed singular message extension.
-  class LIBPROTOBUF_EXPORT LazyMessageExtension {
-   public:
-    LazyMessageExtension() {}
-    virtual ~LazyMessageExtension() {}
-
-    virtual LazyMessageExtension* New() const = 0;
-    virtual const MessageLite& GetMessage(
-        const MessageLite& prototype) const = 0;
-    virtual MessageLite* MutableMessage(const MessageLite& prototype) = 0;
-    virtual void SetAllocatedMessage(MessageLite *message) = 0;
-    virtual MessageLite* ReleaseMessage(const MessageLite& prototype) = 0;
-
-    virtual bool IsInitialized() const = 0;
-    virtual int ByteSize() const = 0;
-    virtual int SpaceUsed() const = 0;
-
-    virtual void MergeFrom(const LazyMessageExtension& other) = 0;
-    virtual void Clear() = 0;
-
-    virtual bool ReadMessage(const MessageLite& prototype,
-                             io::CodedInputStream* input) = 0;
-    virtual void WriteMessage(int number,
-                              io::CodedOutputStream* output) const = 0;
-    virtual uint8* WriteMessageToArray(int number, uint8* target) const = 0;
-   private:
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(LazyMessageExtension);
-  };
-  struct Extension {
-    // The order of these fields packs Extension into 24 bytes when using 8
-    // byte alignment. Consider this when adding or removing fields here.
-    union {
-      int32                 int32_value;
-      int64                 int64_value;
-      uint32                uint32_value;
-      uint64                uint64_value;
-      float                 float_value;
-      double                double_value;
-      bool                  bool_value;
-      int                   enum_value;
-      string*               string_value;
-      MessageLite*          message_value;
-      LazyMessageExtension* lazymessage_value;
-
-      RepeatedField   <int32      >* repeated_int32_value;
-      RepeatedField   <int64      >* repeated_int64_value;
-      RepeatedField   <uint32     >* repeated_uint32_value;
-      RepeatedField   <uint64     >* repeated_uint64_value;
-      RepeatedField   <float      >* repeated_float_value;
-      RepeatedField   <double     >* repeated_double_value;
-      RepeatedField   <bool       >* repeated_bool_value;
-      RepeatedField   <int        >* repeated_enum_value;
-      RepeatedPtrField<string     >* repeated_string_value;
-      RepeatedPtrField<MessageLite>* repeated_message_value;
-    };
-
-    FieldType type;
-    bool is_repeated;
-
-    // For singular types, indicates if the extension is "cleared".  This
-    // happens when an extension is set and then later cleared by the caller.
-    // We want to keep the Extension object around for reuse, so instead of
-    // removing it from the map, we just set is_cleared = true.  This has no
-    // meaning for repeated types; for those, the size of the RepeatedField
-    // simply becomes zero when cleared.
-    bool is_cleared : 4;
-
-    // For singular message types, indicates whether lazy parsing is enabled
-    // for this extension. This field is only valid when type == TYPE_MESSAGE
-    // and !is_repeated because we only support lazy parsing for singular
-    // message types currently. If is_lazy = true, the extension is stored in
-    // lazymessage_value. Otherwise, the extension will be message_value.
-    bool is_lazy : 4;
-
-    // For repeated types, this indicates if the [packed=true] option is set.
-    bool is_packed;
-
-    // For packed fields, the size of the packed data is recorded here when
-    // ByteSize() is called then used during serialization.
-    // TODO(kenton):  Use atomic<int> when C++ supports it.
-    mutable int cached_size;
-
-    // The descriptor for this extension, if one exists and is known.  May be
-    // NULL.  Must not be NULL if the descriptor for the extension does not
-    // live in the same pool as the descriptor for the containing type.
-    const FieldDescriptor* descriptor;
-
-    // Some helper methods for operations on a single Extension.
-    void SerializeFieldWithCachedSizes(
-        int number,
-        io::CodedOutputStream* output) const;
-    uint8* SerializeFieldWithCachedSizesToArray(
-        int number,
-        uint8* target) const;
-    void SerializeMessageSetItemWithCachedSizes(
-        int number,
-        io::CodedOutputStream* output) const;
-    uint8* SerializeMessageSetItemWithCachedSizesToArray(
-        int number,
-        uint8* target) const;
-    int ByteSize(int number) const;
-    int MessageSetItemByteSize(int number) const;
-    void Clear();
-    int GetSize() const;
-    void Free();
-    int SpaceUsedExcludingSelf() const;
-  };
-
-
-  // Returns true and fills field_number and extension if extension is found.
-  bool FindExtensionInfoFromTag(uint32 tag, ExtensionFinder* extension_finder,
-                                int* field_number, ExtensionInfo* extension);
-
-  // Parses a single extension from the input. The input should start out
-  // positioned immediately after the wire tag. This method is called in
-  // ParseField() after field number is extracted from the wire tag and
-  // ExtensionInfo is found by the field number.
-  bool ParseFieldWithExtensionInfo(int field_number,
-                                   const ExtensionInfo& extension,
-                                   io::CodedInputStream* input,
-                                   FieldSkipper* field_skipper);
-
-  // Like ParseField(), but this method may parse singular message extensions
-  // lazily depending on the value of FLAGS_eagerly_parse_message_sets.
-  bool ParseFieldMaybeLazily(uint32 tag, io::CodedInputStream* input,
-                             ExtensionFinder* extension_finder,
-                             FieldSkipper* field_skipper);
-
-  // Gets the extension with the given number, creating it if it does not
-  // already exist.  Returns true if the extension did not already exist.
-  bool MaybeNewExtension(int number, const FieldDescriptor* descriptor,
-                         Extension** result);
-
-  // Parse a single MessageSet item -- called just after the item group start
-  // tag has been read.
-  bool ParseMessageSetItem(io::CodedInputStream* input,
-                           ExtensionFinder* extension_finder,
-                           FieldSkipper* field_skipper);
-
-
-  // Hack:  RepeatedPtrFieldBase declares ExtensionSet as a friend.  This
-  //   friendship should automatically extend to ExtensionSet::Extension, but
-  //   unfortunately some older compilers (e.g. GCC 3.4.4) do not implement this
-  //   correctly.  So, we must provide helpers for calling methods of that
-  //   class.
-
-  // Defined in extension_set_heavy.cc.
-  static inline int RepeatedMessage_SpaceUsedExcludingSelf(
-      RepeatedPtrFieldBase* field);
-
-  // The Extension struct is small enough to be passed by value, so we use it
-  // directly as the value type in the map rather than use pointers.  We use
-  // a map rather than hash_map here because we expect most ExtensionSets will
-  // only contain a small number of extensions whereas hash_map is optimized
-  // for 100 elements or more.  Also, we want AppendToList() to order fields
-  // by field number.
-  std::map<int, Extension> extensions_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ExtensionSet);
-};
-
-// These are just for convenience...
-inline void ExtensionSet::SetString(int number, FieldType type,
-                                    const string& value,
-                                    const FieldDescriptor* descriptor) {
-  MutableString(number, type, descriptor)->assign(value);
-}
-inline void ExtensionSet::SetRepeatedString(int number, int index,
-                                            const string& value) {
-  MutableRepeatedString(number, index)->assign(value);
-}
-inline void ExtensionSet::AddString(int number, FieldType type,
-                                    const string& value,
-                                    const FieldDescriptor* descriptor) {
-  AddString(number, type, descriptor)->assign(value);
-}
-
-// ===================================================================
-// Glue for generated extension accessors
-
-// -------------------------------------------------------------------
-// Template magic
-
-// First we have a set of classes representing "type traits" for different
-// field types.  A type traits class knows how to implement basic accessors
-// for extensions of a particular type given an ExtensionSet.  The signature
-// for a type traits class looks like this:
-//
-//   class TypeTraits {
-//    public:
-//     typedef ? ConstType;
-//     typedef ? MutableType;
-//
-//     static inline ConstType Get(int number, const ExtensionSet& set);
-//     static inline void Set(int number, ConstType value, ExtensionSet* set);
-//     static inline MutableType Mutable(int number, ExtensionSet* set);
-//
-//     // Variants for repeated fields.
-//     static inline ConstType Get(int number, const ExtensionSet& set,
-//                                 int index);
-//     static inline void Set(int number, int index,
-//                            ConstType value, ExtensionSet* set);
-//     static inline MutableType Mutable(int number, int index,
-//                                       ExtensionSet* set);
-//     static inline void Add(int number, ConstType value, ExtensionSet* set);
-//     static inline MutableType Add(int number, ExtensionSet* set);
-//   };
-//
-// Not all of these methods make sense for all field types.  For example, the
-// "Mutable" methods only make sense for strings and messages, and the
-// repeated methods only make sense for repeated types.  So, each type
-// traits class implements only the set of methods from this signature that it
-// actually supports.  This will cause a compiler error if the user tries to
-// access an extension using a method that doesn't make sense for its type.
-// For example, if "foo" is an extension of type "optional int32", then if you
-// try to write code like:
-//   my_message.MutableExtension(foo)
-// you will get a compile error because PrimitiveTypeTraits<int32> does not
-// have a "Mutable()" method.
-
-// -------------------------------------------------------------------
-// PrimitiveTypeTraits
-
-// Since the ExtensionSet has different methods for each primitive type,
-// we must explicitly define the methods of the type traits class for each
-// known type.
-template <typename Type>
-class PrimitiveTypeTraits {
- public:
-  typedef Type ConstType;
-
-  static inline ConstType Get(int number, const ExtensionSet& set,
-                              ConstType default_value);
-  static inline void Set(int number, FieldType field_type,
-                         ConstType value, ExtensionSet* set);
-};
-
-template <typename Type>
-class RepeatedPrimitiveTypeTraits {
- public:
-  typedef Type ConstType;
-
-  static inline Type Get(int number, const ExtensionSet& set, int index);
-  static inline void Set(int number, int index, Type value, ExtensionSet* set);
-  static inline void Add(int number, FieldType field_type,
-                         bool is_packed, Type value, ExtensionSet* set);
-};
-
-#define PROTOBUF_DEFINE_PRIMITIVE_TYPE(TYPE, METHOD)                       \
-template<> inline TYPE PrimitiveTypeTraits<TYPE>::Get(                     \
-    int number, const ExtensionSet& set, TYPE default_value) {             \
-  return set.Get##METHOD(number, default_value);                           \
-}                                                                          \
-template<> inline void PrimitiveTypeTraits<TYPE>::Set(                     \
-    int number, FieldType field_type, TYPE value, ExtensionSet* set) {     \
-  set->Set##METHOD(number, field_type, value, NULL);                       \
-}                                                                          \
-                                                                           \
-template<> inline TYPE RepeatedPrimitiveTypeTraits<TYPE>::Get(             \
-    int number, const ExtensionSet& set, int index) {                      \
-  return set.GetRepeated##METHOD(number, index);                           \
-}                                                                          \
-template<> inline void RepeatedPrimitiveTypeTraits<TYPE>::Set(             \
-    int number, int index, TYPE value, ExtensionSet* set) {                \
-  set->SetRepeated##METHOD(number, index, value);                          \
-}                                                                          \
-template<> inline void RepeatedPrimitiveTypeTraits<TYPE>::Add(             \
-    int number, FieldType field_type, bool is_packed,                      \
-    TYPE value, ExtensionSet* set) {                                       \
-  set->Add##METHOD(number, field_type, is_packed, value, NULL);            \
-}
-
-PROTOBUF_DEFINE_PRIMITIVE_TYPE( int32,  Int32)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE( int64,  Int64)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE(uint32, UInt32)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE(uint64, UInt64)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE( float,  Float)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE(double, Double)
-PROTOBUF_DEFINE_PRIMITIVE_TYPE(  bool,   Bool)
-
-#undef PROTOBUF_DEFINE_PRIMITIVE_TYPE
-
-// -------------------------------------------------------------------
-// StringTypeTraits
-
-// Strings support both Set() and Mutable().
-class LIBPROTOBUF_EXPORT StringTypeTraits {
- public:
-  typedef const string& ConstType;
-  typedef string* MutableType;
-
-  static inline const string& Get(int number, const ExtensionSet& set,
-                                  ConstType default_value) {
-    return set.GetString(number, default_value);
-  }
-  static inline void Set(int number, FieldType field_type,
-                         const string& value, ExtensionSet* set) {
-    set->SetString(number, field_type, value, NULL);
-  }
-  static inline string* Mutable(int number, FieldType field_type,
-                                ExtensionSet* set) {
-    return set->MutableString(number, field_type, NULL);
-  }
-};
-
-class LIBPROTOBUF_EXPORT RepeatedStringTypeTraits {
- public:
-  typedef const string& ConstType;
-  typedef string* MutableType;
-
-  static inline const string& Get(int number, const ExtensionSet& set,
-                                  int index) {
-    return set.GetRepeatedString(number, index);
-  }
-  static inline void Set(int number, int index,
-                         const string& value, ExtensionSet* set) {
-    set->SetRepeatedString(number, index, value);
-  }
-  static inline string* Mutable(int number, int index, ExtensionSet* set) {
-    return set->MutableRepeatedString(number, index);
-  }
-  static inline void Add(int number, FieldType field_type,
-                         bool /*is_packed*/, const string& value,
-                         ExtensionSet* set) {
-    set->AddString(number, field_type, value, NULL);
-  }
-  static inline string* Add(int number, FieldType field_type,
-                            ExtensionSet* set) {
-    return set->AddString(number, field_type, NULL);
-  }
-};
-
-// -------------------------------------------------------------------
-// EnumTypeTraits
-
-// ExtensionSet represents enums using integers internally, so we have to
-// static_cast around.
-template <typename Type, bool IsValid(int)>
-class EnumTypeTraits {
- public:
-  typedef Type ConstType;
-
-  static inline ConstType Get(int number, const ExtensionSet& set,
-                              ConstType default_value) {
-    return static_cast<Type>(set.GetEnum(number, default_value));
-  }
-  static inline void Set(int number, FieldType field_type,
-                         ConstType value, ExtensionSet* set) {
-    GOOGLE_DCHECK(IsValid(value));
-    set->SetEnum(number, field_type, value, NULL);
-  }
-};
-
-template <typename Type, bool IsValid(int)>
-class RepeatedEnumTypeTraits {
- public:
-  typedef Type ConstType;
-
-  static inline ConstType Get(int number, const ExtensionSet& set, int index) {
-    return static_cast<Type>(set.GetRepeatedEnum(number, index));
-  }
-  static inline void Set(int number, int index,
-                         ConstType value, ExtensionSet* set) {
-    GOOGLE_DCHECK(IsValid(value));
-    set->SetRepeatedEnum(number, index, value);
-  }
-  static inline void Add(int number, FieldType field_type,
-                         bool is_packed, ConstType value, ExtensionSet* set) {
-    GOOGLE_DCHECK(IsValid(value));
-    set->AddEnum(number, field_type, is_packed, value, NULL);
-  }
-};
-
-// -------------------------------------------------------------------
-// MessageTypeTraits
-
-// ExtensionSet guarantees that when manipulating extensions with message
-// types, the implementation used will be the compiled-in class representing
-// that type.  So, we can static_cast down to the exact type we expect.
-template <typename Type>
-class MessageTypeTraits {
- public:
-  typedef const Type& ConstType;
-  typedef Type* MutableType;
-
-  static inline ConstType Get(int number, const ExtensionSet& set,
-                              ConstType default_value) {
-    return static_cast<const Type&>(
-        set.GetMessage(number, default_value));
-  }
-  static inline MutableType Mutable(int number, FieldType field_type,
-                                    ExtensionSet* set) {
-    return static_cast<Type*>(
-      set->MutableMessage(number, field_type, Type::default_instance(), NULL));
-  }
-  static inline void SetAllocated(int number, FieldType field_type,
-                                  MutableType message, ExtensionSet* set) {
-    set->SetAllocatedMessage(number, field_type, NULL, message);
-  }
-  static inline MutableType Release(int number, FieldType field_type,
-                                    ExtensionSet* set) {
-    return static_cast<Type*>(set->ReleaseMessage(
-        number, Type::default_instance()));
-  }
-};
-
-template <typename Type>
-class RepeatedMessageTypeTraits {
- public:
-  typedef const Type& ConstType;
-  typedef Type* MutableType;
-
-  static inline ConstType Get(int number, const ExtensionSet& set, int index) {
-    return static_cast<const Type&>(set.GetRepeatedMessage(number, index));
-  }
-  static inline MutableType Mutable(int number, int index, ExtensionSet* set) {
-    return static_cast<Type*>(set->MutableRepeatedMessage(number, index));
-  }
-  static inline MutableType Add(int number, FieldType field_type,
-                                ExtensionSet* set) {
-    return static_cast<Type*>(
-        set->AddMessage(number, field_type, Type::default_instance(), NULL));
-  }
-};
-
-// -------------------------------------------------------------------
-// ExtensionIdentifier
-
-// This is the type of actual extension objects.  E.g. if you have:
-//   extends Foo with optional int32 bar = 1234;
-// then "bar" will be defined in C++ as:
-//   ExtensionIdentifier<Foo, PrimitiveTypeTraits<int32>, 1, false> bar(1234);
-//
-// Note that we could, in theory, supply the field number as a template
-// parameter, and thus make an instance of ExtensionIdentifier have no
-// actual contents.  However, if we did that, then using at extension
-// identifier would not necessarily cause the compiler to output any sort
-// of reference to any simple defined in the extension's .pb.o file.  Some
-// linkers will actually drop object files that are not explicitly referenced,
-// but that would be bad because it would cause this extension to not be
-// registered at static initialization, and therefore using it would crash.
-
-template <typename ExtendeeType, typename TypeTraitsType,
-          FieldType field_type, bool is_packed>
-class ExtensionIdentifier {
- public:
-  typedef TypeTraitsType TypeTraits;
-  typedef ExtendeeType Extendee;
-
-  ExtensionIdentifier(int number, typename TypeTraits::ConstType default_value)
-      : number_(number), default_value_(default_value) {}
-  inline int number() const { return number_; }
-  typename TypeTraits::ConstType default_value() const {
-    return default_value_;
-  }
-
- private:
-  const int number_;
-  typename TypeTraits::ConstType default_value_;
-};
-
-// -------------------------------------------------------------------
-// Generated accessors
-
-// This macro should be expanded in the context of a generated type which
-// has extensions.
-//
-// We use "_proto_TypeTraits" as a type name below because "TypeTraits"
-// causes problems if the class has a nested message or enum type with that
-// name and "_TypeTraits" is technically reserved for the C++ library since
-// it starts with an underscore followed by a capital letter.
-//
-// For similar reason, we use "_field_type" and "_is_packed" as parameter names
-// below, so that "field_type" and "is_packed" can be used as field names.
-#define GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(CLASSNAME)                        \
-  /* Has, Size, Clear */                                                      \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline bool HasExtension(                                                   \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
-    return _extensions_.Has(id.number());                                     \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline void ClearExtension(                                                 \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
-    _extensions_.ClearExtension(id.number());                                 \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline int ExtensionSize(                                                   \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
-    return _extensions_.ExtensionSize(id.number());                           \
-  }                                                                           \
-                                                                              \
-  /* Singular accessors */                                                    \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::ConstType GetExtension(                  \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) const {   \
-    return _proto_TypeTraits::Get(id.number(), _extensions_,                  \
-                                  id.default_value());                        \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::MutableType MutableExtension(            \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
-    return _proto_TypeTraits::Mutable(id.number(), _field_type,               \
-                                      &_extensions_);                         \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline void SetExtension(                                                   \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      typename _proto_TypeTraits::ConstType value) {                          \
-    _proto_TypeTraits::Set(id.number(), _field_type, value, &_extensions_);   \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline void SetAllocatedExtension(                                          \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      typename _proto_TypeTraits::MutableType value) {                        \
-    _proto_TypeTraits::SetAllocated(id.number(), _field_type,                 \
-                                    value, &_extensions_);                    \
-  }                                                                           \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::MutableType ReleaseExtension(            \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
-    return _proto_TypeTraits::Release(id.number(), _field_type,               \
-                                      &_extensions_);                         \
-  }                                                                           \
-                                                                              \
-  /* Repeated accessors */                                                    \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::ConstType GetExtension(                  \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      int index) const {                                                      \
-    return _proto_TypeTraits::Get(id.number(), _extensions_, index);          \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::MutableType MutableExtension(            \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      int index) {                                                            \
-    return _proto_TypeTraits::Mutable(id.number(), index, &_extensions_);     \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline void SetExtension(                                                   \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      int index, typename _proto_TypeTraits::ConstType value) {               \
-    _proto_TypeTraits::Set(id.number(), index, value, &_extensions_);         \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline typename _proto_TypeTraits::MutableType AddExtension(                \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id) {         \
-    return _proto_TypeTraits::Add(id.number(), _field_type, &_extensions_);   \
-  }                                                                           \
-                                                                              \
-  template <typename _proto_TypeTraits,                                       \
-            ::google::protobuf::internal::FieldType _field_type,                        \
-            bool _is_packed>                                                  \
-  inline void AddExtension(                                                   \
-      const ::google::protobuf::internal::ExtensionIdentifier<                          \
-        CLASSNAME, _proto_TypeTraits, _field_type, _is_packed>& id,           \
-      typename _proto_TypeTraits::ConstType value) {                          \
-    _proto_TypeTraits::Add(id.number(), _field_type, _is_packed,              \
-                           value, &_extensions_);                             \
-  }
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_EXTENSION_SET_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h b/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
deleted file mode 100644
index a09a540b..00000000
--- a/ps-lite/deps/include/google/protobuf/generated_enum_reflection.h
+++ /dev/null
@@ -1,85 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: jasonh@google.com (Jason Hsueh)
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-// It provides reflection support for generated enums, and is included in
-// generated .pb.h files and should have minimal dependencies. The methods are
-// implemented in generated_message_reflection.cc.
-
-#ifndef GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
-#define GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
-
-#include <string>
-
-namespace google {
-namespace protobuf {
-  class EnumDescriptor;
-}  // namespace protobuf
-
-namespace protobuf {
-
-// Returns the EnumDescriptor for enum type E, which must be a
-// proto-declared enum type.  Code generated by the protocol compiler
-// will include specializations of this template for each enum type declared.
-template <typename E>
-const EnumDescriptor* GetEnumDescriptor();
-
-namespace internal {
-
-// Helper for EnumType_Parse functions: try to parse the string 'name' as an
-// enum name of the given type, returning true and filling in value on success,
-// or returning false and leaving value unchanged on failure.
-LIBPROTOBUF_EXPORT bool ParseNamedEnum(const EnumDescriptor* descriptor,
-                    const string& name,
-                    int* value);
-
-template<typename EnumType>
-bool ParseNamedEnum(const EnumDescriptor* descriptor,
-                    const string& name,
-                    EnumType* value) {
-  int tmp;
-  if (!ParseNamedEnum(descriptor, name, &tmp)) return false;
-  *value = static_cast<EnumType>(tmp);
-  return true;
-}
-
-// Just a wrapper around printing the name of a value. The main point of this
-// function is not to be inlined, so that you can do this without including
-// descriptor.h.
-LIBPROTOBUF_EXPORT const string& NameOfEnum(const EnumDescriptor* descriptor, int value);
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_message_reflection.h b/ps-lite/deps/include/google/protobuf/generated_message_reflection.h
deleted file mode 100644
index c1c142fa..00000000
--- a/ps-lite/deps/include/google/protobuf/generated_message_reflection.h
+++ /dev/null
@@ -1,419 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-
-#ifndef GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
-#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
-
-#include <string>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-// TODO(jasonh): Remove this once the compiler change to directly include this
-// is released to components.
-#include <google/protobuf/generated_enum_reflection.h>
-#include <google/protobuf/message.h>
-#include <google/protobuf/unknown_field_set.h>
-
-
-namespace google {
-namespace upb {
-namespace google_opensource {
-class GMR_Handlers;
-}  // namespace google_opensource
-}  // namespace upb
-
-namespace protobuf {
-  class DescriptorPool;
-}
-
-namespace protobuf {
-namespace internal {
-
-// Defined in this file.
-class GeneratedMessageReflection;
-
-// Defined in other files.
-class ExtensionSet;             // extension_set.h
-
-// THIS CLASS IS NOT INTENDED FOR DIRECT USE.  It is intended for use
-// by generated code.  This class is just a big hack that reduces code
-// size.
-//
-// A GeneratedMessageReflection is an implementation of Reflection
-// which expects all fields to be backed by simple variables located in
-// memory.  The locations are given using a base pointer and a set of
-// offsets.
-//
-// It is required that the user represents fields of each type in a standard
-// way, so that GeneratedMessageReflection can cast the void* pointer to
-// the appropriate type.  For primitive fields and string fields, each field
-// should be represented using the obvious C++ primitive type.  Enums and
-// Messages are different:
-//  - Singular Message fields are stored as a pointer to a Message.  These
-//    should start out NULL, except for in the default instance where they
-//    should start out pointing to other default instances.
-//  - Enum fields are stored as an int.  This int must always contain
-//    a valid value, such that EnumDescriptor::FindValueByNumber() would
-//    not return NULL.
-//  - Repeated fields are stored as RepeatedFields or RepeatedPtrFields
-//    of whatever type the individual field would be.  Strings and
-//    Messages use RepeatedPtrFields while everything else uses
-//    RepeatedFields.
-class LIBPROTOBUF_EXPORT GeneratedMessageReflection : public Reflection {
- public:
-  // Constructs a GeneratedMessageReflection.
-  // Parameters:
-  //   descriptor:    The descriptor for the message type being implemented.
-  //   default_instance:  The default instance of the message.  This is only
-  //                  used to obtain pointers to default instances of embedded
-  //                  messages, which GetMessage() will return if the particular
-  //                  sub-message has not been initialized yet.  (Thus, all
-  //                  embedded message fields *must* have non-NULL pointers
-  //                  in the default instance.)
-  //   offsets:       An array of ints giving the byte offsets, relative to
-  //                  the start of the message object, of each field.  These can
-  //                  be computed at compile time using the
-  //                  GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET() macro, defined
-  //                  below.
-  //   has_bits_offset:  Offset in the message of an array of uint32s of size
-  //                  descriptor->field_count()/32, rounded up.  This is a
-  //                  bitfield where each bit indicates whether or not the
-  //                  corresponding field of the message has been initialized.
-  //                  The bit for field index i is obtained by the expression:
-  //                    has_bits[i / 32] & (1 << (i % 32))
-  //   unknown_fields_offset:  Offset in the message of the UnknownFieldSet for
-  //                  the message.
-  //   extensions_offset:  Offset in the message of the ExtensionSet for the
-  //                  message, or -1 if the message type has no extension
-  //                  ranges.
-  //   pool:          DescriptorPool to search for extension definitions.  Only
-  //                  used by FindKnownExtensionByName() and
-  //                  FindKnownExtensionByNumber().
-  //   factory:       MessageFactory to use to construct extension messages.
-  //   object_size:   The size of a message object of this type, as measured
-  //                  by sizeof().
-  GeneratedMessageReflection(const Descriptor* descriptor,
-                             const Message* default_instance,
-                             const int offsets[],
-                             int has_bits_offset,
-                             int unknown_fields_offset,
-                             int extensions_offset,
-                             const DescriptorPool* pool,
-                             MessageFactory* factory,
-                             int object_size);
-  ~GeneratedMessageReflection();
-
-  // implements Reflection -------------------------------------------
-
-  const UnknownFieldSet& GetUnknownFields(const Message& message) const;
-  UnknownFieldSet* MutableUnknownFields(Message* message) const;
-
-  int SpaceUsed(const Message& message) const;
-
-  bool HasField(const Message& message, const FieldDescriptor* field) const;
-  int FieldSize(const Message& message, const FieldDescriptor* field) const;
-  void ClearField(Message* message, const FieldDescriptor* field) const;
-  void RemoveLast(Message* message, const FieldDescriptor* field) const;
-  Message* ReleaseLast(Message* message, const FieldDescriptor* field) const;
-  void Swap(Message* message1, Message* message2) const;
-  void SwapElements(Message* message, const FieldDescriptor* field,
-            int index1, int index2) const;
-  void ListFields(const Message& message,
-                  vector<const FieldDescriptor*>* output) const;
-
-  int32  GetInt32 (const Message& message,
-                   const FieldDescriptor* field) const;
-  int64  GetInt64 (const Message& message,
-                   const FieldDescriptor* field) const;
-  uint32 GetUInt32(const Message& message,
-                   const FieldDescriptor* field) const;
-  uint64 GetUInt64(const Message& message,
-                   const FieldDescriptor* field) const;
-  float  GetFloat (const Message& message,
-                   const FieldDescriptor* field) const;
-  double GetDouble(const Message& message,
-                   const FieldDescriptor* field) const;
-  bool   GetBool  (const Message& message,
-                   const FieldDescriptor* field) const;
-  string GetString(const Message& message,
-                   const FieldDescriptor* field) const;
-  const string& GetStringReference(const Message& message,
-                                   const FieldDescriptor* field,
-                                   string* scratch) const;
-  const EnumValueDescriptor* GetEnum(const Message& message,
-                                     const FieldDescriptor* field) const;
-  const Message& GetMessage(const Message& message,
-                            const FieldDescriptor* field,
-                            MessageFactory* factory = NULL) const;
-
-  void SetInt32 (Message* message,
-                 const FieldDescriptor* field, int32  value) const;
-  void SetInt64 (Message* message,
-                 const FieldDescriptor* field, int64  value) const;
-  void SetUInt32(Message* message,
-                 const FieldDescriptor* field, uint32 value) const;
-  void SetUInt64(Message* message,
-                 const FieldDescriptor* field, uint64 value) const;
-  void SetFloat (Message* message,
-                 const FieldDescriptor* field, float  value) const;
-  void SetDouble(Message* message,
-                 const FieldDescriptor* field, double value) const;
-  void SetBool  (Message* message,
-                 const FieldDescriptor* field, bool   value) const;
-  void SetString(Message* message,
-                 const FieldDescriptor* field,
-                 const string& value) const;
-  void SetEnum  (Message* message, const FieldDescriptor* field,
-                 const EnumValueDescriptor* value) const;
-  Message* MutableMessage(Message* message, const FieldDescriptor* field,
-                          MessageFactory* factory = NULL) const;
-  Message* ReleaseMessage(Message* message, const FieldDescriptor* field,
-                          MessageFactory* factory = NULL) const;
-
-  int32  GetRepeatedInt32 (const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  int64  GetRepeatedInt64 (const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  uint32 GetRepeatedUInt32(const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  uint64 GetRepeatedUInt64(const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  float  GetRepeatedFloat (const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  double GetRepeatedDouble(const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  bool   GetRepeatedBool  (const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  string GetRepeatedString(const Message& message,
-                           const FieldDescriptor* field, int index) const;
-  const string& GetRepeatedStringReference(const Message& message,
-                                           const FieldDescriptor* field,
-                                           int index, string* scratch) const;
-  const EnumValueDescriptor* GetRepeatedEnum(const Message& message,
-                                             const FieldDescriptor* field,
-                                             int index) const;
-  const Message& GetRepeatedMessage(const Message& message,
-                                    const FieldDescriptor* field,
-                                    int index) const;
-
-  // Set the value of a field.
-  void SetRepeatedInt32 (Message* message,
-                         const FieldDescriptor* field, int index, int32  value) const;
-  void SetRepeatedInt64 (Message* message,
-                         const FieldDescriptor* field, int index, int64  value) const;
-  void SetRepeatedUInt32(Message* message,
-                         const FieldDescriptor* field, int index, uint32 value) const;
-  void SetRepeatedUInt64(Message* message,
-                         const FieldDescriptor* field, int index, uint64 value) const;
-  void SetRepeatedFloat (Message* message,
-                         const FieldDescriptor* field, int index, float  value) const;
-  void SetRepeatedDouble(Message* message,
-                         const FieldDescriptor* field, int index, double value) const;
-  void SetRepeatedBool  (Message* message,
-                         const FieldDescriptor* field, int index, bool   value) const;
-  void SetRepeatedString(Message* message,
-                         const FieldDescriptor* field, int index,
-                         const string& value) const;
-  void SetRepeatedEnum(Message* message, const FieldDescriptor* field,
-                       int index, const EnumValueDescriptor* value) const;
-  // Get a mutable pointer to a field with a message type.
-  Message* MutableRepeatedMessage(Message* message,
-                                  const FieldDescriptor* field,
-                                  int index) const;
-
-  void AddInt32 (Message* message,
-                 const FieldDescriptor* field, int32  value) const;
-  void AddInt64 (Message* message,
-                 const FieldDescriptor* field, int64  value) const;
-  void AddUInt32(Message* message,
-                 const FieldDescriptor* field, uint32 value) const;
-  void AddUInt64(Message* message,
-                 const FieldDescriptor* field, uint64 value) const;
-  void AddFloat (Message* message,
-                 const FieldDescriptor* field, float  value) const;
-  void AddDouble(Message* message,
-                 const FieldDescriptor* field, double value) const;
-  void AddBool  (Message* message,
-                 const FieldDescriptor* field, bool   value) const;
-  void AddString(Message* message,
-                 const FieldDescriptor* field, const string& value) const;
-  void AddEnum(Message* message,
-               const FieldDescriptor* field,
-               const EnumValueDescriptor* value) const;
-  Message* AddMessage(Message* message, const FieldDescriptor* field,
-                      MessageFactory* factory = NULL) const;
-
-  const FieldDescriptor* FindKnownExtensionByName(const string& name) const;
-  const FieldDescriptor* FindKnownExtensionByNumber(int number) const;
-
- protected:
-  virtual void* MutableRawRepeatedField(
-      Message* message, const FieldDescriptor* field, FieldDescriptor::CppType,
-      int ctype, const Descriptor* desc) const;
-
- private:
-  friend class GeneratedMessage;
-
-  // To parse directly into a proto2 generated class, the class GMR_Handlers
-  // needs access to member offsets and hasbits.
-  friend class LIBPROTOBUF_EXPORT upb::google_opensource::GMR_Handlers;
-
-  const Descriptor* descriptor_;
-  const Message* default_instance_;
-  const int* offsets_;
-
-  int has_bits_offset_;
-  int unknown_fields_offset_;
-  int extensions_offset_;
-  int object_size_;
-
-  const DescriptorPool* descriptor_pool_;
-  MessageFactory* message_factory_;
-
-  template <typename Type>
-  inline const Type& GetRaw(const Message& message,
-                            const FieldDescriptor* field) const;
-  template <typename Type>
-  inline Type* MutableRaw(Message* message,
-                          const FieldDescriptor* field) const;
-  template <typename Type>
-  inline const Type& DefaultRaw(const FieldDescriptor* field) const;
-
-  inline const uint32* GetHasBits(const Message& message) const;
-  inline uint32* MutableHasBits(Message* message) const;
-  inline const ExtensionSet& GetExtensionSet(const Message& message) const;
-  inline ExtensionSet* MutableExtensionSet(Message* message) const;
-
-  inline bool HasBit(const Message& message,
-                     const FieldDescriptor* field) const;
-  inline void SetBit(Message* message,
-                     const FieldDescriptor* field) const;
-  inline void ClearBit(Message* message,
-                       const FieldDescriptor* field) const;
-
-  template <typename Type>
-  inline const Type& GetField(const Message& message,
-                              const FieldDescriptor* field) const;
-  template <typename Type>
-  inline void SetField(Message* message,
-                       const FieldDescriptor* field, const Type& value) const;
-  template <typename Type>
-  inline Type* MutableField(Message* message,
-                            const FieldDescriptor* field) const;
-  template <typename Type>
-  inline const Type& GetRepeatedField(const Message& message,
-                                      const FieldDescriptor* field,
-                                      int index) const;
-  template <typename Type>
-  inline const Type& GetRepeatedPtrField(const Message& message,
-                                         const FieldDescriptor* field,
-                                         int index) const;
-  template <typename Type>
-  inline void SetRepeatedField(Message* message,
-                               const FieldDescriptor* field, int index,
-                               Type value) const;
-  template <typename Type>
-  inline Type* MutableRepeatedField(Message* message,
-                                    const FieldDescriptor* field,
-                                    int index) const;
-  template <typename Type>
-  inline void AddField(Message* message,
-                       const FieldDescriptor* field, const Type& value) const;
-  template <typename Type>
-  inline Type* AddField(Message* message,
-                        const FieldDescriptor* field) const;
-
-  int GetExtensionNumberOrDie(const Descriptor* type) const;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GeneratedMessageReflection);
-};
-
-// Returns the offset of the given field within the given aggregate type.
-// This is equivalent to the ANSI C offsetof() macro.  However, according
-// to the C++ standard, offsetof() only works on POD types, and GCC
-// enforces this requirement with a warning.  In practice, this rule is
-// unnecessarily strict; there is probably no compiler or platform on
-// which the offsets of the direct fields of a class are non-constant.
-// Fields inherited from superclasses *can* have non-constant offsets,
-// but that's not what this macro will be used for.
-//
-// Note that we calculate relative to the pointer value 16 here since if we
-// just use zero, GCC complains about dereferencing a NULL pointer.  We
-// choose 16 rather than some other number just in case the compiler would
-// be confused by an unaligned pointer.
-#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(TYPE, FIELD)    \
-  static_cast<int>(                                           \
-    reinterpret_cast<const char*>(                            \
-      &reinterpret_cast<const TYPE*>(16)->FIELD) -            \
-    reinterpret_cast<const char*>(16))
-
-// There are some places in proto2 where dynamic_cast would be useful as an
-// optimization.  For example, take Message::MergeFrom(const Message& other).
-// For a given generated message FooMessage, we generate these two methods:
-//   void MergeFrom(const FooMessage& other);
-//   void MergeFrom(const Message& other);
-// The former method can be implemented directly in terms of FooMessage's
-// inline accessors, but the latter method must work with the reflection
-// interface.  However, if the parameter to the latter method is actually of
-// type FooMessage, then we'd like to be able to just call the other method
-// as an optimization.  So, we use dynamic_cast to check this.
-//
-// That said, dynamic_cast requires RTTI, which many people like to disable
-// for performance and code size reasons.  When RTTI is not available, we
-// still need to produce correct results.  So, in this case we have to fall
-// back to using reflection, which is what we would have done anyway if the
-// objects were not of the exact same class.
-//
-// dynamic_cast_if_available() implements this logic.  If RTTI is
-// enabled, it does a dynamic_cast.  If RTTI is disabled, it just returns
-// NULL.
-//
-// If you need to compile without RTTI, simply #define GOOGLE_PROTOBUF_NO_RTTI.
-// On MSVC, this should be detected automatically.
-template<typename To, typename From>
-inline To dynamic_cast_if_available(From from) {
-#if defined(GOOGLE_PROTOBUF_NO_RTTI) || (defined(_MSC_VER)&&!defined(_CPPRTTI))
-  return NULL;
-#else
-  return dynamic_cast<To>(from);
-#endif
-}
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__
diff --git a/ps-lite/deps/include/google/protobuf/generated_message_util.h b/ps-lite/deps/include/google/protobuf/generated_message_util.h
deleted file mode 100644
index b2fb8f0b..00000000
--- a/ps-lite/deps/include/google/protobuf/generated_message_util.h
+++ /dev/null
@@ -1,77 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains miscellaneous helper code used by generated code --
-// including lite types -- but which should not be used directly by users.
-
-#ifndef GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
-#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
-
-#include <string>
-
-#include <google/protobuf/stubs/common.h>
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// Annotation for the compiler to emit a deprecation message if a field marked
-// with option 'deprecated=true' is used in the code, or for other things in
-// generated code which are deprecated.
-//
-// For internal use in the pb.cc files, deprecation warnings are suppressed
-// there.
-#undef DEPRECATED_PROTOBUF_FIELD
-#define PROTOBUF_DEPRECATED
-
-
-// Constants for special floating point values.
-LIBPROTOBUF_EXPORT double Infinity();
-LIBPROTOBUF_EXPORT double NaN();
-
-// Constant used for empty default strings.
-LIBPROTOBUF_EXPORT extern const ::std::string kEmptyString;
-
-// Defined in generated_message_reflection.cc -- not actually part of the lite
-// library.
-//
-// TODO(jasonh): The various callers get this declaration from a variety of
-// places: probably in most cases repeated_field.h. Clean these up so they all
-// get the declaration from this file.
-LIBPROTOBUF_EXPORT int StringSpaceUsedExcludingSelf(const string& str);
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/coded_stream.h b/ps-lite/deps/include/google/protobuf/io/coded_stream.h
deleted file mode 100644
index 66cbee00..00000000
--- a/ps-lite/deps/include/google/protobuf/io/coded_stream.h
+++ /dev/null
@@ -1,1136 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains the CodedInputStream and CodedOutputStream classes,
-// which wrap a ZeroCopyInputStream or ZeroCopyOutputStream, respectively,
-// and allow you to read or write individual pieces of data in various
-// formats.  In particular, these implement the varint encoding for
-// integers, a simple variable-length encoding in which smaller numbers
-// take fewer bytes.
-//
-// Typically these classes will only be used internally by the protocol
-// buffer library in order to encode and decode protocol buffers.  Clients
-// of the library only need to know about this class if they wish to write
-// custom message parsing or serialization procedures.
-//
-// CodedOutputStream example:
-//   // Write some data to "myfile".  First we write a 4-byte "magic number"
-//   // to identify the file type, then write a length-delimited string.  The
-//   // string is composed of a varint giving the length followed by the raw
-//   // bytes.
-//   int fd = open("myfile", O_WRONLY);
-//   ZeroCopyOutputStream* raw_output = new FileOutputStream(fd);
-//   CodedOutputStream* coded_output = new CodedOutputStream(raw_output);
-//
-//   int magic_number = 1234;
-//   char text[] = "Hello world!";
-//   coded_output->WriteLittleEndian32(magic_number);
-//   coded_output->WriteVarint32(strlen(text));
-//   coded_output->WriteRaw(text, strlen(text));
-//
-//   delete coded_output;
-//   delete raw_output;
-//   close(fd);
-//
-// CodedInputStream example:
-//   // Read a file created by the above code.
-//   int fd = open("myfile", O_RDONLY);
-//   ZeroCopyInputStream* raw_input = new FileInputStream(fd);
-//   CodedInputStream coded_input = new CodedInputStream(raw_input);
-//
-//   coded_input->ReadLittleEndian32(&magic_number);
-//   if (magic_number != 1234) {
-//     cerr << "File not in expected format." << endl;
-//     return;
-//   }
-//
-//   uint32 size;
-//   coded_input->ReadVarint32(&size);
-//
-//   char* text = new char[size + 1];
-//   coded_input->ReadRaw(buffer, size);
-//   text[size] = '\0';
-//
-//   delete coded_input;
-//   delete raw_input;
-//   close(fd);
-//
-//   cout << "Text is: " << text << endl;
-//   delete [] text;
-//
-// For those who are interested, varint encoding is defined as follows:
-//
-// The encoding operates on unsigned integers of up to 64 bits in length.
-// Each byte of the encoded value has the format:
-// * bits 0-6: Seven bits of the number being encoded.
-// * bit 7: Zero if this is the last byte in the encoding (in which
-//   case all remaining bits of the number are zero) or 1 if
-//   more bytes follow.
-// The first byte contains the least-significant 7 bits of the number, the
-// second byte (if present) contains the next-least-significant 7 bits,
-// and so on.  So, the binary number 1011000101011 would be encoded in two
-// bytes as "10101011 00101100".
-//
-// In theory, varint could be used to encode integers of any length.
-// However, for practicality we set a limit at 64 bits.  The maximum encoded
-// length of a number is thus 10 bytes.
-
-#ifndef GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
-#define GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
-
-#include <string>
-#ifdef _MSC_VER
-  #if defined(_M_IX86) && \
-      !defined(PROTOBUF_DISABLE_LITTLE_ENDIAN_OPT_FOR_TEST)
-    #define PROTOBUF_LITTLE_ENDIAN 1
-  #endif
-  #if _MSC_VER >= 1300
-    // If MSVC has "/RTCc" set, it will complain about truncating casts at
-    // runtime.  This file contains some intentional truncating casts.
-    #pragma runtime_checks("c", off)
-  #endif
-#else
-  #include <sys/param.h>   // __BYTE_ORDER
-  #if defined(__BYTE_ORDER) && __BYTE_ORDER == __LITTLE_ENDIAN && \
-      !defined(PROTOBUF_DISABLE_LITTLE_ENDIAN_OPT_FOR_TEST)
-    #define PROTOBUF_LITTLE_ENDIAN 1
-  #endif
-#endif
-#include <google/protobuf/stubs/common.h>
-
-
-namespace google {
-namespace protobuf {
-
-class DescriptorPool;
-class MessageFactory;
-
-namespace io {
-
-// Defined in this file.
-class CodedInputStream;
-class CodedOutputStream;
-
-// Defined in other files.
-class ZeroCopyInputStream;           // zero_copy_stream.h
-class ZeroCopyOutputStream;          // zero_copy_stream.h
-
-// Class which reads and decodes binary data which is composed of varint-
-// encoded integers and fixed-width pieces.  Wraps a ZeroCopyInputStream.
-// Most users will not need to deal with CodedInputStream.
-//
-// Most methods of CodedInputStream that return a bool return false if an
-// underlying I/O error occurs or if the data is malformed.  Once such a
-// failure occurs, the CodedInputStream is broken and is no longer useful.
-class LIBPROTOBUF_EXPORT CodedInputStream {
- public:
-  // Create a CodedInputStream that reads from the given ZeroCopyInputStream.
-  explicit CodedInputStream(ZeroCopyInputStream* input);
-
-  // Create a CodedInputStream that reads from the given flat array.  This is
-  // faster than using an ArrayInputStream.  PushLimit(size) is implied by
-  // this constructor.
-  explicit CodedInputStream(const uint8* buffer, int size);
-
-  // Destroy the CodedInputStream and position the underlying
-  // ZeroCopyInputStream at the first unread byte.  If an error occurred while
-  // reading (causing a method to return false), then the exact position of
-  // the input stream may be anywhere between the last value that was read
-  // successfully and the stream's byte limit.
-  ~CodedInputStream();
-
-  // Return true if this CodedInputStream reads from a flat array instead of
-  // a ZeroCopyInputStream.
-  inline bool IsFlat() const;
-
-  // Skips a number of bytes.  Returns false if an underlying read error
-  // occurs.
-  bool Skip(int count);
-
-  // Sets *data to point directly at the unread part of the CodedInputStream's
-  // underlying buffer, and *size to the size of that buffer, but does not
-  // advance the stream's current position.  This will always either produce
-  // a non-empty buffer or return false.  If the caller consumes any of
-  // this data, it should then call Skip() to skip over the consumed bytes.
-  // This may be useful for implementing external fast parsing routines for
-  // types of data not covered by the CodedInputStream interface.
-  bool GetDirectBufferPointer(const void** data, int* size);
-
-  // Like GetDirectBufferPointer, but this method is inlined, and does not
-  // attempt to Refresh() if the buffer is currently empty.
-  inline void GetDirectBufferPointerInline(const void** data,
-                                           int* size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  // Read raw bytes, copying them into the given buffer.
-  bool ReadRaw(void* buffer, int size);
-
-  // Like ReadRaw, but reads into a string.
-  //
-  // Implementation Note:  ReadString() grows the string gradually as it
-  // reads in the data, rather than allocating the entire requested size
-  // upfront.  This prevents denial-of-service attacks in which a client
-  // could claim that a string is going to be MAX_INT bytes long in order to
-  // crash the server because it can't allocate this much space at once.
-  bool ReadString(string* buffer, int size);
-  // Like the above, with inlined optimizations. This should only be used
-  // by the protobuf implementation.
-  inline bool InternalReadStringInline(string* buffer,
-                                       int size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-
-  // Read a 32-bit little-endian integer.
-  bool ReadLittleEndian32(uint32* value);
-  // Read a 64-bit little-endian integer.
-  bool ReadLittleEndian64(uint64* value);
-
-  // These methods read from an externally provided buffer. The caller is
-  // responsible for ensuring that the buffer has sufficient space.
-  // Read a 32-bit little-endian integer.
-  static const uint8* ReadLittleEndian32FromArray(const uint8* buffer,
-                                                   uint32* value);
-  // Read a 64-bit little-endian integer.
-  static const uint8* ReadLittleEndian64FromArray(const uint8* buffer,
-                                                   uint64* value);
-
-  // Read an unsigned integer with Varint encoding, truncating to 32 bits.
-  // Reading a 32-bit value is equivalent to reading a 64-bit one and casting
-  // it to uint32, but may be more efficient.
-  bool ReadVarint32(uint32* value);
-  // Read an unsigned integer with Varint encoding.
-  bool ReadVarint64(uint64* value);
-
-  // Read a tag.  This calls ReadVarint32() and returns the result, or returns
-  // zero (which is not a valid tag) if ReadVarint32() fails.  Also, it updates
-  // the last tag value, which can be checked with LastTagWas().
-  // Always inline because this is only called in once place per parse loop
-  // but it is called for every iteration of said loop, so it should be fast.
-  // GCC doesn't want to inline this by default.
-  uint32 ReadTag() GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  // Usually returns true if calling ReadVarint32() now would produce the given
-  // value.  Will always return false if ReadVarint32() would not return the
-  // given value.  If ExpectTag() returns true, it also advances past
-  // the varint.  For best performance, use a compile-time constant as the
-  // parameter.
-  // Always inline because this collapses to a small number of instructions
-  // when given a constant parameter, but GCC doesn't want to inline by default.
-  bool ExpectTag(uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  // Like above, except this reads from the specified buffer. The caller is
-  // responsible for ensuring that the buffer is large enough to read a varint
-  // of the expected size. For best performance, use a compile-time constant as
-  // the expected tag parameter.
-  //
-  // Returns a pointer beyond the expected tag if it was found, or NULL if it
-  // was not.
-  static const uint8* ExpectTagFromArray(
-      const uint8* buffer,
-      uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  // Usually returns true if no more bytes can be read.  Always returns false
-  // if more bytes can be read.  If ExpectAtEnd() returns true, a subsequent
-  // call to LastTagWas() will act as if ReadTag() had been called and returned
-  // zero, and ConsumedEntireMessage() will return true.
-  bool ExpectAtEnd();
-
-  // If the last call to ReadTag() returned the given value, returns true.
-  // Otherwise, returns false;
-  //
-  // This is needed because parsers for some types of embedded messages
-  // (with field type TYPE_GROUP) don't actually know that they've reached the
-  // end of a message until they see an ENDGROUP tag, which was actually part
-  // of the enclosing message.  The enclosing message would like to check that
-  // tag to make sure it had the right number, so it calls LastTagWas() on
-  // return from the embedded parser to check.
-  bool LastTagWas(uint32 expected);
-
-  // When parsing message (but NOT a group), this method must be called
-  // immediately after MergeFromCodedStream() returns (if it returns true)
-  // to further verify that the message ended in a legitimate way.  For
-  // example, this verifies that parsing did not end on an end-group tag.
-  // It also checks for some cases where, due to optimizations,
-  // MergeFromCodedStream() can incorrectly return true.
-  bool ConsumedEntireMessage();
-
-  // Limits ----------------------------------------------------------
-  // Limits are used when parsing length-delimited embedded messages.
-  // After the message's length is read, PushLimit() is used to prevent
-  // the CodedInputStream from reading beyond that length.  Once the
-  // embedded message has been parsed, PopLimit() is called to undo the
-  // limit.
-
-  // Opaque type used with PushLimit() and PopLimit().  Do not modify
-  // values of this type yourself.  The only reason that this isn't a
-  // struct with private internals is for efficiency.
-  typedef int Limit;
-
-  // Places a limit on the number of bytes that the stream may read,
-  // starting from the current position.  Once the stream hits this limit,
-  // it will act like the end of the input has been reached until PopLimit()
-  // is called.
-  //
-  // As the names imply, the stream conceptually has a stack of limits.  The
-  // shortest limit on the stack is always enforced, even if it is not the
-  // top limit.
-  //
-  // The value returned by PushLimit() is opaque to the caller, and must
-  // be passed unchanged to the corresponding call to PopLimit().
-  Limit PushLimit(int byte_limit);
-
-  // Pops the last limit pushed by PushLimit().  The input must be the value
-  // returned by that call to PushLimit().
-  void PopLimit(Limit limit);
-
-  // Returns the number of bytes left until the nearest limit on the
-  // stack is hit, or -1 if no limits are in place.
-  int BytesUntilLimit() const;
-
-  // Returns current position relative to the beginning of the input stream.
-  int CurrentPosition() const;
-
-  // Total Bytes Limit -----------------------------------------------
-  // To prevent malicious users from sending excessively large messages
-  // and causing integer overflows or memory exhaustion, CodedInputStream
-  // imposes a hard limit on the total number of bytes it will read.
-
-  // Sets the maximum number of bytes that this CodedInputStream will read
-  // before refusing to continue.  To prevent integer overflows in the
-  // protocol buffers implementation, as well as to prevent servers from
-  // allocating enormous amounts of memory to hold parsed messages, the
-  // maximum message length should be limited to the shortest length that
-  // will not harm usability.  The theoretical shortest message that could
-  // cause integer overflows is 512MB.  The default limit is 64MB.  Apps
-  // should set shorter limits if possible.  If warning_threshold is not -1,
-  // a warning will be printed to stderr after warning_threshold bytes are
-  // read.  For backwards compatibility all negative values get squached to -1,
-  // as other negative values might have special internal meanings.
-  // An error will always be printed to stderr if the limit is reached.
-  //
-  // This is unrelated to PushLimit()/PopLimit().
-  //
-  // Hint:  If you are reading this because your program is printing a
-  //   warning about dangerously large protocol messages, you may be
-  //   confused about what to do next.  The best option is to change your
-  //   design such that excessively large messages are not necessary.
-  //   For example, try to design file formats to consist of many small
-  //   messages rather than a single large one.  If this is infeasible,
-  //   you will need to increase the limit.  Chances are, though, that
-  //   your code never constructs a CodedInputStream on which the limit
-  //   can be set.  You probably parse messages by calling things like
-  //   Message::ParseFromString().  In this case, you will need to change
-  //   your code to instead construct some sort of ZeroCopyInputStream
-  //   (e.g. an ArrayInputStream), construct a CodedInputStream around
-  //   that, then call Message::ParseFromCodedStream() instead.  Then
-  //   you can adjust the limit.  Yes, it's more work, but you're doing
-  //   something unusual.
-  void SetTotalBytesLimit(int total_bytes_limit, int warning_threshold);
-
-  // Recursion Limit -------------------------------------------------
-  // To prevent corrupt or malicious messages from causing stack overflows,
-  // we must keep track of the depth of recursion when parsing embedded
-  // messages and groups.  CodedInputStream keeps track of this because it
-  // is the only object that is passed down the stack during parsing.
-
-  // Sets the maximum recursion depth.  The default is 100.
-  void SetRecursionLimit(int limit);
-
-
-  // Increments the current recursion depth.  Returns true if the depth is
-  // under the limit, false if it has gone over.
-  bool IncrementRecursionDepth();
-
-  // Decrements the recursion depth.
-  void DecrementRecursionDepth();
-
-  // Extension Registry ----------------------------------------------
-  // ADVANCED USAGE:  99.9% of people can ignore this section.
-  //
-  // By default, when parsing extensions, the parser looks for extension
-  // definitions in the pool which owns the outer message's Descriptor.
-  // However, you may call SetExtensionRegistry() to provide an alternative
-  // pool instead.  This makes it possible, for example, to parse a message
-  // using a generated class, but represent some extensions using
-  // DynamicMessage.
-
-  // Set the pool used to look up extensions.  Most users do not need to call
-  // this as the correct pool will be chosen automatically.
-  //
-  // WARNING:  It is very easy to misuse this.  Carefully read the requirements
-  //   below.  Do not use this unless you are sure you need it.  Almost no one
-  //   does.
-  //
-  // Let's say you are parsing a message into message object m, and you want
-  // to take advantage of SetExtensionRegistry().  You must follow these
-  // requirements:
-  //
-  // The given DescriptorPool must contain m->GetDescriptor().  It is not
-  // sufficient for it to simply contain a descriptor that has the same name
-  // and content -- it must be the *exact object*.  In other words:
-  //   assert(pool->FindMessageTypeByName(m->GetDescriptor()->full_name()) ==
-  //          m->GetDescriptor());
-  // There are two ways to satisfy this requirement:
-  // 1) Use m->GetDescriptor()->pool() as the pool.  This is generally useless
-  //    because this is the pool that would be used anyway if you didn't call
-  //    SetExtensionRegistry() at all.
-  // 2) Use a DescriptorPool which has m->GetDescriptor()->pool() as an
-  //    "underlay".  Read the documentation for DescriptorPool for more
-  //    information about underlays.
-  //
-  // You must also provide a MessageFactory.  This factory will be used to
-  // construct Message objects representing extensions.  The factory's
-  // GetPrototype() MUST return non-NULL for any Descriptor which can be found
-  // through the provided pool.
-  //
-  // If the provided factory might return instances of protocol-compiler-
-  // generated (i.e. compiled-in) types, or if the outer message object m is
-  // a generated type, then the given factory MUST have this property:  If
-  // GetPrototype() is given a Descriptor which resides in
-  // DescriptorPool::generated_pool(), the factory MUST return the same
-  // prototype which MessageFactory::generated_factory() would return.  That
-  // is, given a descriptor for a generated type, the factory must return an
-  // instance of the generated class (NOT DynamicMessage).  However, when
-  // given a descriptor for a type that is NOT in generated_pool, the factory
-  // is free to return any implementation.
-  //
-  // The reason for this requirement is that generated sub-objects may be
-  // accessed via the standard (non-reflection) extension accessor methods,
-  // and these methods will down-cast the object to the generated class type.
-  // If the object is not actually of that type, the results would be undefined.
-  // On the other hand, if an extension is not compiled in, then there is no
-  // way the code could end up accessing it via the standard accessors -- the
-  // only way to access the extension is via reflection.  When using reflection,
-  // DynamicMessage and generated messages are indistinguishable, so it's fine
-  // if these objects are represented using DynamicMessage.
-  //
-  // Using DynamicMessageFactory on which you have called
-  // SetDelegateToGeneratedFactory(true) should be sufficient to satisfy the
-  // above requirement.
-  //
-  // If either pool or factory is NULL, both must be NULL.
-  //
-  // Note that this feature is ignored when parsing "lite" messages as they do
-  // not have descriptors.
-  void SetExtensionRegistry(const DescriptorPool* pool,
-                            MessageFactory* factory);
-
-  // Get the DescriptorPool set via SetExtensionRegistry(), or NULL if no pool
-  // has been provided.
-  const DescriptorPool* GetExtensionPool();
-
-  // Get the MessageFactory set via SetExtensionRegistry(), or NULL if no
-  // factory has been provided.
-  MessageFactory* GetExtensionFactory();
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodedInputStream);
-
-  ZeroCopyInputStream* input_;
-  const uint8* buffer_;
-  const uint8* buffer_end_;     // pointer to the end of the buffer.
-  int total_bytes_read_;  // total bytes read from input_, including
-                          // the current buffer
-
-  // If total_bytes_read_ surpasses INT_MAX, we record the extra bytes here
-  // so that we can BackUp() on destruction.
-  int overflow_bytes_;
-
-  // LastTagWas() stuff.
-  uint32 last_tag_;         // result of last ReadTag().
-
-  // This is set true by ReadTag{Fallback/Slow}() if it is called when exactly
-  // at EOF, or by ExpectAtEnd() when it returns true.  This happens when we
-  // reach the end of a message and attempt to read another tag.
-  bool legitimate_message_end_;
-
-  // See EnableAliasing().
-  bool aliasing_enabled_;
-
-  // Limits
-  Limit current_limit_;   // if position = -1, no limit is applied
-
-  // For simplicity, if the current buffer crosses a limit (either a normal
-  // limit created by PushLimit() or the total bytes limit), buffer_size_
-  // only tracks the number of bytes before that limit.  This field
-  // contains the number of bytes after it.  Note that this implies that if
-  // buffer_size_ == 0 and buffer_size_after_limit_ > 0, we know we've
-  // hit a limit.  However, if both are zero, it doesn't necessarily mean
-  // we aren't at a limit -- the buffer may have ended exactly at the limit.
-  int buffer_size_after_limit_;
-
-  // Maximum number of bytes to read, period.  This is unrelated to
-  // current_limit_.  Set using SetTotalBytesLimit().
-  int total_bytes_limit_;
-
-  // If positive/0: Limit for bytes read after which a warning due to size
-  // should be logged.
-  // If -1: Printing of warning disabled. Can be set by client.
-  // If -2: Internal: Limit has been reached, print full size when destructing.
-  int total_bytes_warning_threshold_;
-
-  // Current recursion depth, controlled by IncrementRecursionDepth() and
-  // DecrementRecursionDepth().
-  int recursion_depth_;
-  // Recursion depth limit, set by SetRecursionLimit().
-  int recursion_limit_;
-
-  // See SetExtensionRegistry().
-  const DescriptorPool* extension_pool_;
-  MessageFactory* extension_factory_;
-
-  // Private member functions.
-
-  // Advance the buffer by a given number of bytes.
-  void Advance(int amount);
-
-  // Back up input_ to the current buffer position.
-  void BackUpInputToCurrentPosition();
-
-  // Recomputes the value of buffer_size_after_limit_.  Must be called after
-  // current_limit_ or total_bytes_limit_ changes.
-  void RecomputeBufferLimits();
-
-  // Writes an error message saying that we hit total_bytes_limit_.
-  void PrintTotalBytesLimitError();
-
-  // Called when the buffer runs out to request more data.  Implies an
-  // Advance(BufferSize()).
-  bool Refresh();
-
-  // When parsing varints, we optimize for the common case of small values, and
-  // then optimize for the case when the varint fits within the current buffer
-  // piece. The Fallback method is used when we can't use the one-byte
-  // optimization. The Slow method is yet another fallback when the buffer is
-  // not large enough. Making the slow path out-of-line speeds up the common
-  // case by 10-15%. The slow path is fairly uncommon: it only triggers when a
-  // message crosses multiple buffers.
-  bool ReadVarint32Fallback(uint32* value);
-  bool ReadVarint64Fallback(uint64* value);
-  bool ReadVarint32Slow(uint32* value);
-  bool ReadVarint64Slow(uint64* value);
-  bool ReadLittleEndian32Fallback(uint32* value);
-  bool ReadLittleEndian64Fallback(uint64* value);
-  // Fallback/slow methods for reading tags. These do not update last_tag_,
-  // but will set legitimate_message_end_ if we are at the end of the input
-  // stream.
-  uint32 ReadTagFallback();
-  uint32 ReadTagSlow();
-  bool ReadStringFallback(string* buffer, int size);
-
-  // Return the size of the buffer.
-  int BufferSize() const;
-
-  static const int kDefaultTotalBytesLimit = 64 << 20;  // 64MB
-
-  static const int kDefaultTotalBytesWarningThreshold = 32 << 20;  // 32MB
-
-  static int default_recursion_limit_;  // 100 by default.
-};
-
-// Class which encodes and writes binary data which is composed of varint-
-// encoded integers and fixed-width pieces.  Wraps a ZeroCopyOutputStream.
-// Most users will not need to deal with CodedOutputStream.
-//
-// Most methods of CodedOutputStream which return a bool return false if an
-// underlying I/O error occurs.  Once such a failure occurs, the
-// CodedOutputStream is broken and is no longer useful. The Write* methods do
-// not return the stream status, but will invalidate the stream if an error
-// occurs. The client can probe HadError() to determine the status.
-//
-// Note that every method of CodedOutputStream which writes some data has
-// a corresponding static "ToArray" version. These versions write directly
-// to the provided buffer, returning a pointer past the last written byte.
-// They require that the buffer has sufficient capacity for the encoded data.
-// This allows an optimization where we check if an output stream has enough
-// space for an entire message before we start writing and, if there is, we
-// call only the ToArray methods to avoid doing bound checks for each
-// individual value.
-// i.e., in the example above:
-//
-//   CodedOutputStream coded_output = new CodedOutputStream(raw_output);
-//   int magic_number = 1234;
-//   char text[] = "Hello world!";
-//
-//   int coded_size = sizeof(magic_number) +
-//                    CodedOutputStream::VarintSize32(strlen(text)) +
-//                    strlen(text);
-//
-//   uint8* buffer =
-//       coded_output->GetDirectBufferForNBytesAndAdvance(coded_size);
-//   if (buffer != NULL) {
-//     // The output stream has enough space in the buffer: write directly to
-//     // the array.
-//     buffer = CodedOutputStream::WriteLittleEndian32ToArray(magic_number,
-//                                                            buffer);
-//     buffer = CodedOutputStream::WriteVarint32ToArray(strlen(text), buffer);
-//     buffer = CodedOutputStream::WriteRawToArray(text, strlen(text), buffer);
-//   } else {
-//     // Make bound-checked writes, which will ask the underlying stream for
-//     // more space as needed.
-//     coded_output->WriteLittleEndian32(magic_number);
-//     coded_output->WriteVarint32(strlen(text));
-//     coded_output->WriteRaw(text, strlen(text));
-//   }
-//
-//   delete coded_output;
-class LIBPROTOBUF_EXPORT CodedOutputStream {
- public:
-  // Create an CodedOutputStream that writes to the given ZeroCopyOutputStream.
-  explicit CodedOutputStream(ZeroCopyOutputStream* output);
-
-  // Destroy the CodedOutputStream and position the underlying
-  // ZeroCopyOutputStream immediately after the last byte written.
-  ~CodedOutputStream();
-
-  // Skips a number of bytes, leaving the bytes unmodified in the underlying
-  // buffer.  Returns false if an underlying write error occurs.  This is
-  // mainly useful with GetDirectBufferPointer().
-  bool Skip(int count);
-
-  // Sets *data to point directly at the unwritten part of the
-  // CodedOutputStream's underlying buffer, and *size to the size of that
-  // buffer, but does not advance the stream's current position.  This will
-  // always either produce a non-empty buffer or return false.  If the caller
-  // writes any data to this buffer, it should then call Skip() to skip over
-  // the consumed bytes.  This may be useful for implementing external fast
-  // serialization routines for types of data not covered by the
-  // CodedOutputStream interface.
-  bool GetDirectBufferPointer(void** data, int* size);
-
-  // If there are at least "size" bytes available in the current buffer,
-  // returns a pointer directly into the buffer and advances over these bytes.
-  // The caller may then write directly into this buffer (e.g. using the
-  // *ToArray static methods) rather than go through CodedOutputStream.  If
-  // there are not enough bytes available, returns NULL.  The return pointer is
-  // invalidated as soon as any other non-const method of CodedOutputStream
-  // is called.
-  inline uint8* GetDirectBufferForNBytesAndAdvance(int size);
-
-  // Write raw bytes, copying them from the given buffer.
-  void WriteRaw(const void* buffer, int size);
-  // Like WriteRaw()  but writing directly to the target array.
-  // This is _not_ inlined, as the compiler often optimizes memcpy into inline
-  // copy loops. Since this gets called by every field with string or bytes
-  // type, inlining may lead to a significant amount of code bloat, with only a
-  // minor performance gain.
-  static uint8* WriteRawToArray(const void* buffer, int size, uint8* target);
-
-  // Equivalent to WriteRaw(str.data(), str.size()).
-  void WriteString(const string& str);
-  // Like WriteString()  but writing directly to the target array.
-  static uint8* WriteStringToArray(const string& str, uint8* target);
-
-
-  // Write a 32-bit little-endian integer.
-  void WriteLittleEndian32(uint32 value);
-  // Like WriteLittleEndian32()  but writing directly to the target array.
-  static uint8* WriteLittleEndian32ToArray(uint32 value, uint8* target);
-  // Write a 64-bit little-endian integer.
-  void WriteLittleEndian64(uint64 value);
-  // Like WriteLittleEndian64()  but writing directly to the target array.
-  static uint8* WriteLittleEndian64ToArray(uint64 value, uint8* target);
-
-  // Write an unsigned integer with Varint encoding.  Writing a 32-bit value
-  // is equivalent to casting it to uint64 and writing it as a 64-bit value,
-  // but may be more efficient.
-  void WriteVarint32(uint32 value);
-  // Like WriteVarint32()  but writing directly to the target array.
-  static uint8* WriteVarint32ToArray(uint32 value, uint8* target);
-  // Write an unsigned integer with Varint encoding.
-  void WriteVarint64(uint64 value);
-  // Like WriteVarint64()  but writing directly to the target array.
-  static uint8* WriteVarint64ToArray(uint64 value, uint8* target);
-
-  // Equivalent to WriteVarint32() except when the value is negative,
-  // in which case it must be sign-extended to a full 10 bytes.
-  void WriteVarint32SignExtended(int32 value);
-  // Like WriteVarint32SignExtended()  but writing directly to the target array.
-  static uint8* WriteVarint32SignExtendedToArray(int32 value, uint8* target);
-
-  // This is identical to WriteVarint32(), but optimized for writing tags.
-  // In particular, if the input is a compile-time constant, this method
-  // compiles down to a couple instructions.
-  // Always inline because otherwise the aformentioned optimization can't work,
-  // but GCC by default doesn't want to inline this.
-  void WriteTag(uint32 value);
-  // Like WriteTag()  but writing directly to the target array.
-  static uint8* WriteTagToArray(
-      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  // Returns the number of bytes needed to encode the given value as a varint.
-  static int VarintSize32(uint32 value);
-  // Returns the number of bytes needed to encode the given value as a varint.
-  static int VarintSize64(uint64 value);
-
-  // If negative, 10 bytes.  Otheriwse, same as VarintSize32().
-  static int VarintSize32SignExtended(int32 value);
-
-  // Compile-time equivalent of VarintSize32().
-  template <uint32 Value>
-  struct StaticVarintSize32 {
-    static const int value =
-        (Value < (1 << 7))
-            ? 1
-            : (Value < (1 << 14))
-                ? 2
-                : (Value < (1 << 21))
-                    ? 3
-                    : (Value < (1 << 28))
-                        ? 4
-                        : 5;
-  };
-
-  // Returns the total number of bytes written since this object was created.
-  inline int ByteCount() const;
-
-  // Returns true if there was an underlying I/O error since this object was
-  // created.
-  bool HadError() const { return had_error_; }
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CodedOutputStream);
-
-  ZeroCopyOutputStream* output_;
-  uint8* buffer_;
-  int buffer_size_;
-  int total_bytes_;  // Sum of sizes of all buffers seen so far.
-  bool had_error_;   // Whether an error occurred during output.
-
-  // Advance the buffer by a given number of bytes.
-  void Advance(int amount);
-
-  // Called when the buffer runs out to request more data.  Implies an
-  // Advance(buffer_size_).
-  bool Refresh();
-
-  static uint8* WriteVarint32FallbackToArray(uint32 value, uint8* target);
-
-  // Always-inlined versions of WriteVarint* functions so that code can be
-  // reused, while still controlling size. For instance, WriteVarint32ToArray()
-  // should not directly call this: since it is inlined itself, doing so
-  // would greatly increase the size of generated code. Instead, it should call
-  // WriteVarint32FallbackToArray.  Meanwhile, WriteVarint32() is already
-  // out-of-line, so it should just invoke this directly to avoid any extra
-  // function call overhead.
-  static uint8* WriteVarint32FallbackToArrayInline(
-      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-  static uint8* WriteVarint64ToArrayInline(
-      uint64 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  static int VarintSize32Fallback(uint32 value);
-};
-
-// inline methods ====================================================
-// The vast majority of varints are only one byte.  These inline
-// methods optimize for that case.
-
-inline bool CodedInputStream::ReadVarint32(uint32* value) {
-  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && *buffer_ < 0x80) {
-    *value = *buffer_;
-    Advance(1);
-    return true;
-  } else {
-    return ReadVarint32Fallback(value);
-  }
-}
-
-inline bool CodedInputStream::ReadVarint64(uint64* value) {
-  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && *buffer_ < 0x80) {
-    *value = *buffer_;
-    Advance(1);
-    return true;
-  } else {
-    return ReadVarint64Fallback(value);
-  }
-}
-
-// static
-inline const uint8* CodedInputStream::ReadLittleEndian32FromArray(
-    const uint8* buffer,
-    uint32* value) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  memcpy(value, buffer, sizeof(*value));
-  return buffer + sizeof(*value);
-#else
-  *value = (static_cast<uint32>(buffer[0])      ) |
-           (static_cast<uint32>(buffer[1]) <<  8) |
-           (static_cast<uint32>(buffer[2]) << 16) |
-           (static_cast<uint32>(buffer[3]) << 24);
-  return buffer + sizeof(*value);
-#endif
-}
-// static
-inline const uint8* CodedInputStream::ReadLittleEndian64FromArray(
-    const uint8* buffer,
-    uint64* value) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  memcpy(value, buffer, sizeof(*value));
-  return buffer + sizeof(*value);
-#else
-  uint32 part0 = (static_cast<uint32>(buffer[0])      ) |
-                 (static_cast<uint32>(buffer[1]) <<  8) |
-                 (static_cast<uint32>(buffer[2]) << 16) |
-                 (static_cast<uint32>(buffer[3]) << 24);
-  uint32 part1 = (static_cast<uint32>(buffer[4])      ) |
-                 (static_cast<uint32>(buffer[5]) <<  8) |
-                 (static_cast<uint32>(buffer[6]) << 16) |
-                 (static_cast<uint32>(buffer[7]) << 24);
-  *value = static_cast<uint64>(part0) |
-          (static_cast<uint64>(part1) << 32);
-  return buffer + sizeof(*value);
-#endif
-}
-
-inline bool CodedInputStream::ReadLittleEndian32(uint32* value) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  if (GOOGLE_PREDICT_TRUE(BufferSize() >= static_cast<int>(sizeof(*value)))) {
-    memcpy(value, buffer_, sizeof(*value));
-    Advance(sizeof(*value));
-    return true;
-  } else {
-    return ReadLittleEndian32Fallback(value);
-  }
-#else
-  return ReadLittleEndian32Fallback(value);
-#endif
-}
-
-inline bool CodedInputStream::ReadLittleEndian64(uint64* value) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  if (GOOGLE_PREDICT_TRUE(BufferSize() >= static_cast<int>(sizeof(*value)))) {
-    memcpy(value, buffer_, sizeof(*value));
-    Advance(sizeof(*value));
-    return true;
-  } else {
-    return ReadLittleEndian64Fallback(value);
-  }
-#else
-  return ReadLittleEndian64Fallback(value);
-#endif
-}
-
-inline uint32 CodedInputStream::ReadTag() {
-  if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && buffer_[0] < 0x80) {
-    last_tag_ = buffer_[0];
-    Advance(1);
-    return last_tag_;
-  } else {
-    last_tag_ = ReadTagFallback();
-    return last_tag_;
-  }
-}
-
-inline bool CodedInputStream::LastTagWas(uint32 expected) {
-  return last_tag_ == expected;
-}
-
-inline bool CodedInputStream::ConsumedEntireMessage() {
-  return legitimate_message_end_;
-}
-
-inline bool CodedInputStream::ExpectTag(uint32 expected) {
-  if (expected < (1 << 7)) {
-    if (GOOGLE_PREDICT_TRUE(buffer_ < buffer_end_) && buffer_[0] == expected) {
-      Advance(1);
-      return true;
-    } else {
-      return false;
-    }
-  } else if (expected < (1 << 14)) {
-    if (GOOGLE_PREDICT_TRUE(BufferSize() >= 2) &&
-        buffer_[0] == static_cast<uint8>(expected | 0x80) &&
-        buffer_[1] == static_cast<uint8>(expected >> 7)) {
-      Advance(2);
-      return true;
-    } else {
-      return false;
-    }
-  } else {
-    // Don't bother optimizing for larger values.
-    return false;
-  }
-}
-
-inline const uint8* CodedInputStream::ExpectTagFromArray(
-    const uint8* buffer, uint32 expected) {
-  if (expected < (1 << 7)) {
-    if (buffer[0] == expected) {
-      return buffer + 1;
-    }
-  } else if (expected < (1 << 14)) {
-    if (buffer[0] == static_cast<uint8>(expected | 0x80) &&
-        buffer[1] == static_cast<uint8>(expected >> 7)) {
-      return buffer + 2;
-    }
-  }
-  return NULL;
-}
-
-inline void CodedInputStream::GetDirectBufferPointerInline(const void** data,
-                                                           int* size) {
-  *data = buffer_;
-  *size = buffer_end_ - buffer_;
-}
-
-inline bool CodedInputStream::ExpectAtEnd() {
-  // If we are at a limit we know no more bytes can be read.  Otherwise, it's
-  // hard to say without calling Refresh(), and we'd rather not do that.
-
-  if (buffer_ == buffer_end_ &&
-      ((buffer_size_after_limit_ != 0) ||
-       (total_bytes_read_ == current_limit_))) {
-    last_tag_ = 0;                   // Pretend we called ReadTag()...
-    legitimate_message_end_ = true;  // ... and it hit EOF.
-    return true;
-  } else {
-    return false;
-  }
-}
-
-inline int CodedInputStream::CurrentPosition() const {
-  return total_bytes_read_ - (BufferSize() + buffer_size_after_limit_);
-}
-
-inline uint8* CodedOutputStream::GetDirectBufferForNBytesAndAdvance(int size) {
-  if (buffer_size_ < size) {
-    return NULL;
-  } else {
-    uint8* result = buffer_;
-    Advance(size);
-    return result;
-  }
-}
-
-inline uint8* CodedOutputStream::WriteVarint32ToArray(uint32 value,
-                                                        uint8* target) {
-  if (value < 0x80) {
-    *target = value;
-    return target + 1;
-  } else {
-    return WriteVarint32FallbackToArray(value, target);
-  }
-}
-
-inline void CodedOutputStream::WriteVarint32SignExtended(int32 value) {
-  if (value < 0) {
-    WriteVarint64(static_cast<uint64>(value));
-  } else {
-    WriteVarint32(static_cast<uint32>(value));
-  }
-}
-
-inline uint8* CodedOutputStream::WriteVarint32SignExtendedToArray(
-    int32 value, uint8* target) {
-  if (value < 0) {
-    return WriteVarint64ToArray(static_cast<uint64>(value), target);
-  } else {
-    return WriteVarint32ToArray(static_cast<uint32>(value), target);
-  }
-}
-
-inline uint8* CodedOutputStream::WriteLittleEndian32ToArray(uint32 value,
-                                                            uint8* target) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  memcpy(target, &value, sizeof(value));
-#else
-  target[0] = static_cast<uint8>(value);
-  target[1] = static_cast<uint8>(value >>  8);
-  target[2] = static_cast<uint8>(value >> 16);
-  target[3] = static_cast<uint8>(value >> 24);
-#endif
-  return target + sizeof(value);
-}
-
-inline uint8* CodedOutputStream::WriteLittleEndian64ToArray(uint64 value,
-                                                            uint8* target) {
-#if defined(PROTOBUF_LITTLE_ENDIAN)
-  memcpy(target, &value, sizeof(value));
-#else
-  uint32 part0 = static_cast<uint32>(value);
-  uint32 part1 = static_cast<uint32>(value >> 32);
-
-  target[0] = static_cast<uint8>(part0);
-  target[1] = static_cast<uint8>(part0 >>  8);
-  target[2] = static_cast<uint8>(part0 >> 16);
-  target[3] = static_cast<uint8>(part0 >> 24);
-  target[4] = static_cast<uint8>(part1);
-  target[5] = static_cast<uint8>(part1 >>  8);
-  target[6] = static_cast<uint8>(part1 >> 16);
-  target[7] = static_cast<uint8>(part1 >> 24);
-#endif
-  return target + sizeof(value);
-}
-
-inline void CodedOutputStream::WriteTag(uint32 value) {
-  WriteVarint32(value);
-}
-
-inline uint8* CodedOutputStream::WriteTagToArray(
-    uint32 value, uint8* target) {
-  if (value < (1 << 7)) {
-    target[0] = value;
-    return target + 1;
-  } else if (value < (1 << 14)) {
-    target[0] = static_cast<uint8>(value | 0x80);
-    target[1] = static_cast<uint8>(value >> 7);
-    return target + 2;
-  } else {
-    return WriteVarint32FallbackToArray(value, target);
-  }
-}
-
-inline int CodedOutputStream::VarintSize32(uint32 value) {
-  if (value < (1 << 7)) {
-    return 1;
-  } else  {
-    return VarintSize32Fallback(value);
-  }
-}
-
-inline int CodedOutputStream::VarintSize32SignExtended(int32 value) {
-  if (value < 0) {
-    return 10;     // TODO(kenton):  Make this a symbolic constant.
-  } else {
-    return VarintSize32(static_cast<uint32>(value));
-  }
-}
-
-inline void CodedOutputStream::WriteString(const string& str) {
-  WriteRaw(str.data(), static_cast<int>(str.size()));
-}
-
-inline uint8* CodedOutputStream::WriteStringToArray(
-    const string& str, uint8* target) {
-  return WriteRawToArray(str.data(), static_cast<int>(str.size()), target);
-}
-
-inline int CodedOutputStream::ByteCount() const {
-  return total_bytes_ - buffer_size_;
-}
-
-inline void CodedInputStream::Advance(int amount) {
-  buffer_ += amount;
-}
-
-inline void CodedOutputStream::Advance(int amount) {
-  buffer_ += amount;
-  buffer_size_ -= amount;
-}
-
-inline void CodedInputStream::SetRecursionLimit(int limit) {
-  recursion_limit_ = limit;
-}
-
-inline bool CodedInputStream::IncrementRecursionDepth() {
-  ++recursion_depth_;
-  return recursion_depth_ <= recursion_limit_;
-}
-
-inline void CodedInputStream::DecrementRecursionDepth() {
-  if (recursion_depth_ > 0) --recursion_depth_;
-}
-
-inline void CodedInputStream::SetExtensionRegistry(const DescriptorPool* pool,
-                                                   MessageFactory* factory) {
-  extension_pool_ = pool;
-  extension_factory_ = factory;
-}
-
-inline const DescriptorPool* CodedInputStream::GetExtensionPool() {
-  return extension_pool_;
-}
-
-inline MessageFactory* CodedInputStream::GetExtensionFactory() {
-  return extension_factory_;
-}
-
-inline int CodedInputStream::BufferSize() const {
-  return buffer_end_ - buffer_;
-}
-
-inline CodedInputStream::CodedInputStream(ZeroCopyInputStream* input)
-  : input_(input),
-    buffer_(NULL),
-    buffer_end_(NULL),
-    total_bytes_read_(0),
-    overflow_bytes_(0),
-    last_tag_(0),
-    legitimate_message_end_(false),
-    aliasing_enabled_(false),
-    current_limit_(kint32max),
-    buffer_size_after_limit_(0),
-    total_bytes_limit_(kDefaultTotalBytesLimit),
-    total_bytes_warning_threshold_(kDefaultTotalBytesWarningThreshold),
-    recursion_depth_(0),
-    recursion_limit_(default_recursion_limit_),
-    extension_pool_(NULL),
-    extension_factory_(NULL) {
-  // Eagerly Refresh() so buffer space is immediately available.
-  Refresh();
-}
-
-inline CodedInputStream::CodedInputStream(const uint8* buffer, int size)
-  : input_(NULL),
-    buffer_(buffer),
-    buffer_end_(buffer + size),
-    total_bytes_read_(size),
-    overflow_bytes_(0),
-    last_tag_(0),
-    legitimate_message_end_(false),
-    aliasing_enabled_(false),
-    current_limit_(size),
-    buffer_size_after_limit_(0),
-    total_bytes_limit_(kDefaultTotalBytesLimit),
-    total_bytes_warning_threshold_(kDefaultTotalBytesWarningThreshold),
-    recursion_depth_(0),
-    recursion_limit_(default_recursion_limit_),
-    extension_pool_(NULL),
-    extension_factory_(NULL) {
-  // Note that setting current_limit_ == size is important to prevent some
-  // code paths from trying to access input_ and segfaulting.
-}
-
-inline bool CodedInputStream::IsFlat() const {
-  return input_ == NULL;
-}
-
-}  // namespace io
-}  // namespace protobuf
-
-
-#if defined(_MSC_VER) && _MSC_VER >= 1300
-  #pragma runtime_checks("c", restore)
-#endif  // _MSC_VER
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_CODED_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/gzip_stream.h b/ps-lite/deps/include/google/protobuf/io/gzip_stream.h
deleted file mode 100644
index 365e9ea5..00000000
--- a/ps-lite/deps/include/google/protobuf/io/gzip_stream.h
+++ /dev/null
@@ -1,209 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: brianolson@google.com (Brian Olson)
-//
-// This file contains the definition for classes GzipInputStream and
-// GzipOutputStream.
-//
-// GzipInputStream decompresses data from an underlying
-// ZeroCopyInputStream and provides the decompressed data as a
-// ZeroCopyInputStream.
-//
-// GzipOutputStream is an ZeroCopyOutputStream that compresses data to
-// an underlying ZeroCopyOutputStream.
-
-#ifndef GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
-#define GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
-
-#include <zlib.h>
-
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/io/zero_copy_stream.h>
-
-namespace google {
-namespace protobuf {
-namespace io {
-
-// A ZeroCopyInputStream that reads compressed data through zlib
-class LIBPROTOBUF_EXPORT GzipInputStream : public ZeroCopyInputStream {
- public:
-  // Format key for constructor
-  enum Format {
-    // zlib will autodetect gzip header or deflate stream
-    AUTO = 0,
-
-    // GZIP streams have some extra header data for file attributes.
-    GZIP = 1,
-
-    // Simpler zlib stream format.
-    ZLIB = 2,
-  };
-
-  // buffer_size and format may be -1 for default of 64kB and GZIP format
-  explicit GzipInputStream(
-      ZeroCopyInputStream* sub_stream,
-      Format format = AUTO,
-      int buffer_size = -1);
-  virtual ~GzipInputStream();
-
-  // Return last error message or NULL if no error.
-  inline const char* ZlibErrorMessage() const {
-    return zcontext_.msg;
-  }
-  inline int ZlibErrorCode() const {
-    return zerror_;
-  }
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
- private:
-  Format format_;
-
-  ZeroCopyInputStream* sub_stream_;
-
-  z_stream zcontext_;
-  int zerror_;
-
-  void* output_buffer_;
-  void* output_position_;
-  size_t output_buffer_length_;
-
-  int Inflate(int flush);
-  void DoNextOutput(const void** data, int* size);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GzipInputStream);
-};
-
-
-class LIBPROTOBUF_EXPORT GzipOutputStream : public ZeroCopyOutputStream {
- public:
-  // Format key for constructor
-  enum Format {
-    // GZIP streams have some extra header data for file attributes.
-    GZIP = 1,
-
-    // Simpler zlib stream format.
-    ZLIB = 2,
-  };
-
-  struct LIBPROTOBUF_EXPORT Options {
-    // Defaults to GZIP.
-    Format format;
-
-    // What size buffer to use internally.  Defaults to 64kB.
-    int buffer_size;
-
-    // A number between 0 and 9, where 0 is no compression and 9 is best
-    // compression.  Defaults to Z_DEFAULT_COMPRESSION (see zlib.h).
-    int compression_level;
-
-    // Defaults to Z_DEFAULT_STRATEGY.  Can also be set to Z_FILTERED,
-    // Z_HUFFMAN_ONLY, or Z_RLE.  See the documentation for deflateInit2 in
-    // zlib.h for definitions of these constants.
-    int compression_strategy;
-
-    Options();  // Initializes with default values.
-  };
-
-  // Create a GzipOutputStream with default options.
-  explicit GzipOutputStream(ZeroCopyOutputStream* sub_stream);
-
-  // Create a GzipOutputStream with the given options.
-  GzipOutputStream(
-      ZeroCopyOutputStream* sub_stream,
-      const Options& options);
-
-  virtual ~GzipOutputStream();
-
-  // Return last error message or NULL if no error.
-  inline const char* ZlibErrorMessage() const {
-    return zcontext_.msg;
-  }
-  inline int ZlibErrorCode() const {
-    return zerror_;
-  }
-
-  // Flushes data written so far to zipped data in the underlying stream.
-  // It is the caller's responsibility to flush the underlying stream if
-  // necessary.
-  // Compression may be less efficient stopping and starting around flushes.
-  // Returns true if no error.
-  //
-  // Please ensure that block size is > 6. Here is an excerpt from the zlib
-  // doc that explains why:
-  //
-  // In the case of a Z_FULL_FLUSH or Z_SYNC_FLUSH, make sure that avail_out
-  // is greater than six to avoid repeated flush markers due to
-  // avail_out == 0 on return.
-  bool Flush();
-
-  // Writes out all data and closes the gzip stream.
-  // It is the caller's responsibility to close the underlying stream if
-  // necessary.
-  // Returns true if no error.
-  bool Close();
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  ZeroCopyOutputStream* sub_stream_;
-  // Result from calling Next() on sub_stream_
-  void* sub_data_;
-  int sub_data_size_;
-
-  z_stream zcontext_;
-  int zerror_;
-  void* input_buffer_;
-  size_t input_buffer_length_;
-
-  // Shared constructor code.
-  void Init(ZeroCopyOutputStream* sub_stream, const Options& options);
-
-  // Do some compression.
-  // Takes zlib flush mode.
-  // Returns zlib error code.
-  int Deflate(int flush);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(GzipOutputStream);
-};
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/printer.h b/ps-lite/deps/include/google/protobuf/io/printer.h
deleted file mode 100644
index 5be48543..00000000
--- a/ps-lite/deps/include/google/protobuf/io/printer.h
+++ /dev/null
@@ -1,136 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Utility class for writing text to a ZeroCopyOutputStream.
-
-#ifndef GOOGLE_PROTOBUF_IO_PRINTER_H__
-#define GOOGLE_PROTOBUF_IO_PRINTER_H__
-
-#include <string>
-#include <map>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-namespace io {
-
-class ZeroCopyOutputStream;     // zero_copy_stream.h
-
-// This simple utility class assists in code generation.  It basically
-// allows the caller to define a set of variables and then output some
-// text with variable substitutions.  Example usage:
-//
-//   Printer printer(output, '$');
-//   map<string, string> vars;
-//   vars["name"] = "Bob";
-//   printer.Print(vars, "My name is $name$.");
-//
-// The above writes "My name is Bob." to the output stream.
-//
-// Printer aggressively enforces correct usage, crashing (with assert failures)
-// in the case of undefined variables in debug builds. This helps greatly in
-// debugging code which uses it.
-class LIBPROTOBUF_EXPORT Printer {
- public:
-  // Create a printer that writes text to the given output stream.  Use the
-  // given character as the delimiter for variables.
-  Printer(ZeroCopyOutputStream* output, char variable_delimiter);
-  ~Printer();
-
-  // Print some text after applying variable substitutions.  If a particular
-  // variable in the text is not defined, this will crash.  Variables to be
-  // substituted are identified by their names surrounded by delimiter
-  // characters (as given to the constructor).  The variable bindings are
-  // defined by the given map.
-  void Print(const map<string, string>& variables, const char* text);
-
-  // Like the first Print(), except the substitutions are given as parameters.
-  void Print(const char* text);
-  // Like the first Print(), except the substitutions are given as parameters.
-  void Print(const char* text, const char* variable, const string& value);
-  // Like the first Print(), except the substitutions are given as parameters.
-  void Print(const char* text, const char* variable1, const string& value1,
-                               const char* variable2, const string& value2);
-  // Like the first Print(), except the substitutions are given as parameters.
-  void Print(const char* text, const char* variable1, const string& value1,
-                               const char* variable2, const string& value2,
-                               const char* variable3, const string& value3);
-  // TODO(kenton):  Overloaded versions with more variables?  Three seems
-  //   to be enough.
-
-  // Indent text by two spaces.  After calling Indent(), two spaces will be
-  // inserted at the beginning of each line of text.  Indent() may be called
-  // multiple times to produce deeper indents.
-  void Indent();
-
-  // Reduces the current indent level by two spaces, or crashes if the indent
-  // level is zero.
-  void Outdent();
-
-  // Write a string to the output buffer.
-  // This method does not look for newlines to add indentation.
-  void PrintRaw(const string& data);
-
-  // Write a zero-delimited string to output buffer.
-  // This method does not look for newlines to add indentation.
-  void PrintRaw(const char* data);
-
-  // Write some bytes to the output buffer.
-  // This method does not look for newlines to add indentation.
-  void WriteRaw(const char* data, int size);
-
-  // True if any write to the underlying stream failed.  (We don't just
-  // crash in this case because this is an I/O failure, not a programming
-  // error.)
-  bool failed() const { return failed_; }
-
- private:
-  const char variable_delimiter_;
-
-  ZeroCopyOutputStream* const output_;
-  char* buffer_;
-  int buffer_size_;
-
-  string indent_;
-  bool at_start_of_line_;
-  bool failed_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Printer);
-};
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_PRINTER_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/tokenizer.h b/ps-lite/deps/include/google/protobuf/io/tokenizer.h
deleted file mode 100644
index d85b82f9..00000000
--- a/ps-lite/deps/include/google/protobuf/io/tokenizer.h
+++ /dev/null
@@ -1,384 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Class for parsing tokenized text from a ZeroCopyInputStream.
-
-#ifndef GOOGLE_PROTOBUF_IO_TOKENIZER_H__
-#define GOOGLE_PROTOBUF_IO_TOKENIZER_H__
-
-#include <string>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-namespace io {
-
-class ZeroCopyInputStream;     // zero_copy_stream.h
-
-// Defined in this file.
-class ErrorCollector;
-class Tokenizer;
-
-// Abstract interface for an object which collects the errors that occur
-// during parsing.  A typical implementation might simply print the errors
-// to stdout.
-class LIBPROTOBUF_EXPORT ErrorCollector {
- public:
-  inline ErrorCollector() {}
-  virtual ~ErrorCollector();
-
-  // Indicates that there was an error in the input at the given line and
-  // column numbers.  The numbers are zero-based, so you may want to add
-  // 1 to each before printing them.
-  virtual void AddError(int line, int column, const string& message) = 0;
-
-  // Indicates that there was a warning in the input at the given line and
-  // column numbers.  The numbers are zero-based, so you may want to add
-  // 1 to each before printing them.
-  virtual void AddWarning(int line, int column, const string& message) { }
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ErrorCollector);
-};
-
-// This class converts a stream of raw text into a stream of tokens for
-// the protocol definition parser to parse.  The tokens recognized are
-// similar to those that make up the C language; see the TokenType enum for
-// precise descriptions.  Whitespace and comments are skipped.  By default,
-// C- and C++-style comments are recognized, but other styles can be used by
-// calling set_comment_style().
-class LIBPROTOBUF_EXPORT Tokenizer {
- public:
-  // Construct a Tokenizer that reads and tokenizes text from the given
-  // input stream and writes errors to the given error_collector.
-  // The caller keeps ownership of input and error_collector.
-  Tokenizer(ZeroCopyInputStream* input, ErrorCollector* error_collector);
-  ~Tokenizer();
-
-  enum TokenType {
-    TYPE_START,       // Next() has not yet been called.
-    TYPE_END,         // End of input reached.  "text" is empty.
-
-    TYPE_IDENTIFIER,  // A sequence of letters, digits, and underscores, not
-                      // starting with a digit.  It is an error for a number
-                      // to be followed by an identifier with no space in
-                      // between.
-    TYPE_INTEGER,     // A sequence of digits representing an integer.  Normally
-                      // the digits are decimal, but a prefix of "0x" indicates
-                      // a hex number and a leading zero indicates octal, just
-                      // like with C numeric literals.  A leading negative sign
-                      // is NOT included in the token; it's up to the parser to
-                      // interpret the unary minus operator on its own.
-    TYPE_FLOAT,       // A floating point literal, with a fractional part and/or
-                      // an exponent.  Always in decimal.  Again, never
-                      // negative.
-    TYPE_STRING,      // A quoted sequence of escaped characters.  Either single
-                      // or double quotes can be used, but they must match.
-                      // A string literal cannot cross a line break.
-    TYPE_SYMBOL,      // Any other printable character, like '!' or '+'.
-                      // Symbols are always a single character, so "!+$%" is
-                      // four tokens.
-  };
-
-  // Structure representing a token read from the token stream.
-  struct Token {
-    TokenType type;
-    string text;       // The exact text of the token as it appeared in
-                       // the input.  e.g. tokens of TYPE_STRING will still
-                       // be escaped and in quotes.
-
-    // "line" and "column" specify the position of the first character of
-    // the token within the input stream.  They are zero-based.
-    int line;
-    int column;
-    int end_column;
-  };
-
-  // Get the current token.  This is updated when Next() is called.  Before
-  // the first call to Next(), current() has type TYPE_START and no contents.
-  const Token& current();
-
-  // Return the previous token -- i.e. what current() returned before the
-  // previous call to Next().
-  const Token& previous();
-
-  // Advance to the next token.  Returns false if the end of the input is
-  // reached.
-  bool Next();
-
-  // Like Next(), but also collects comments which appear between the previous
-  // and next tokens.
-  //
-  // Comments which appear to be attached to the previous token are stored
-  // in *prev_tailing_comments.  Comments which appear to be attached to the
-  // next token are stored in *next_leading_comments.  Comments appearing in
-  // between which do not appear to be attached to either will be added to
-  // detached_comments.  Any of these parameters can be NULL to simply discard
-  // the comments.
-  //
-  // A series of line comments appearing on consecutive lines, with no other
-  // tokens appearing on those lines, will be treated as a single comment.
-  //
-  // Only the comment content is returned; comment markers (e.g. //) are
-  // stripped out.  For block comments, leading whitespace and an asterisk will
-  // be stripped from the beginning of each line other than the first.  Newlines
-  // are included in the output.
-  //
-  // Examples:
-  //
-  //   optional int32 foo = 1;  // Comment attached to foo.
-  //   // Comment attached to bar.
-  //   optional int32 bar = 2;
-  //
-  //   optional string baz = 3;
-  //   // Comment attached to baz.
-  //   // Another line attached to baz.
-  //
-  //   // Comment attached to qux.
-  //   //
-  //   // Another line attached to qux.
-  //   optional double qux = 4;
-  //
-  //   // Detached comment.  This is not attached to qux or corge
-  //   // because there are blank lines separating it from both.
-  //
-  //   optional string corge = 5;
-  //   /* Block comment attached
-  //    * to corge.  Leading asterisks
-  //    * will be removed. */
-  //   /* Block comment attached to
-  //    * grault. */
-  //   optional int32 grault = 6;
-  bool NextWithComments(string* prev_trailing_comments,
-                        vector<string>* detached_comments,
-                        string* next_leading_comments);
-
-  // Parse helpers ---------------------------------------------------
-
-  // Parses a TYPE_FLOAT token.  This never fails, so long as the text actually
-  // comes from a TYPE_FLOAT token parsed by Tokenizer.  If it doesn't, the
-  // result is undefined (possibly an assert failure).
-  static double ParseFloat(const string& text);
-
-  // Parses a TYPE_STRING token.  This never fails, so long as the text actually
-  // comes from a TYPE_STRING token parsed by Tokenizer.  If it doesn't, the
-  // result is undefined (possibly an assert failure).
-  static void ParseString(const string& text, string* output);
-
-  // Identical to ParseString, but appends to output.
-  static void ParseStringAppend(const string& text, string* output);
-
-  // Parses a TYPE_INTEGER token.  Returns false if the result would be
-  // greater than max_value.  Otherwise, returns true and sets *output to the
-  // result.  If the text is not from a Token of type TYPE_INTEGER originally
-  // parsed by a Tokenizer, the result is undefined (possibly an assert
-  // failure).
-  static bool ParseInteger(const string& text, uint64 max_value,
-                           uint64* output);
-
-  // Options ---------------------------------------------------------
-
-  // Set true to allow floats to be suffixed with the letter 'f'.  Tokens
-  // which would otherwise be integers but which have the 'f' suffix will be
-  // forced to be interpreted as floats.  For all other purposes, the 'f' is
-  // ignored.
-  void set_allow_f_after_float(bool value) { allow_f_after_float_ = value; }
-
-  // Valid values for set_comment_style().
-  enum CommentStyle {
-    // Line comments begin with "//", block comments are delimited by "/*" and
-    // "*/".
-    CPP_COMMENT_STYLE,
-    // Line comments begin with "#".  No way to write block comments.
-    SH_COMMENT_STYLE
-  };
-
-  // Sets the comment style.
-  void set_comment_style(CommentStyle style) { comment_style_ = style; }
-
-  // -----------------------------------------------------------------
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Tokenizer);
-
-  Token current_;           // Returned by current().
-  Token previous_;          // Returned by previous().
-
-  ZeroCopyInputStream* input_;
-  ErrorCollector* error_collector_;
-
-  char current_char_;       // == buffer_[buffer_pos_], updated by NextChar().
-  const char* buffer_;      // Current buffer returned from input_.
-  int buffer_size_;         // Size of buffer_.
-  int buffer_pos_;          // Current position within the buffer.
-  bool read_error_;         // Did we previously encounter a read error?
-
-  // Line and column number of current_char_ within the whole input stream.
-  int line_;
-  int column_;
-
-  // String to which text should be appended as we advance through it.
-  // Call RecordTo(&str) to start recording and StopRecording() to stop.
-  // E.g. StartToken() calls RecordTo(&current_.text).  record_start_ is the
-  // position within the current buffer where recording started.
-  string* record_target_;
-  int record_start_;
-
-  // Options.
-  bool allow_f_after_float_;
-  CommentStyle comment_style_;
-
-  // Since we count columns we need to interpret tabs somehow.  We'll take
-  // the standard 8-character definition for lack of any way to do better.
-  static const int kTabWidth = 8;
-
-  // -----------------------------------------------------------------
-  // Helper methods.
-
-  // Consume this character and advance to the next one.
-  void NextChar();
-
-  // Read a new buffer from the input.
-  void Refresh();
-
-  inline void RecordTo(string* target);
-  inline void StopRecording();
-
-  // Called when the current character is the first character of a new
-  // token (not including whitespace or comments).
-  inline void StartToken();
-  // Called when the current character is the first character after the
-  // end of the last token.  After this returns, current_.text will
-  // contain all text consumed since StartToken() was called.
-  inline void EndToken();
-
-  // Convenience method to add an error at the current line and column.
-  void AddError(const string& message) {
-    error_collector_->AddError(line_, column_, message);
-  }
-
-  // -----------------------------------------------------------------
-  // The following four methods are used to consume tokens of specific
-  // types.  They are actually used to consume all characters *after*
-  // the first, since the calling function consumes the first character
-  // in order to decide what kind of token is being read.
-
-  // Read and consume a string, ending when the given delimiter is
-  // consumed.
-  void ConsumeString(char delimiter);
-
-  // Read and consume a number, returning TYPE_FLOAT or TYPE_INTEGER
-  // depending on what was read.  This needs to know if the first
-  // character was a zero in order to correctly recognize hex and octal
-  // numbers.
-  // It also needs to know if the first characted was a . to parse floating
-  // point correctly.
-  TokenType ConsumeNumber(bool started_with_zero, bool started_with_dot);
-
-  // Consume the rest of a line.
-  void ConsumeLineComment(string* content);
-  // Consume until "*/".
-  void ConsumeBlockComment(string* content);
-
-  enum NextCommentStatus {
-    // Started a line comment.
-    LINE_COMMENT,
-
-    // Started a block comment.
-    BLOCK_COMMENT,
-
-    // Consumed a slash, then realized it wasn't a comment.  current_ has
-    // been filled in with a slash token.  The caller should return it.
-    SLASH_NOT_COMMENT,
-
-    // We do not appear to be starting a comment here.
-    NO_COMMENT
-  };
-
-  // If we're at the start of a new comment, consume it and return what kind
-  // of comment it is.
-  NextCommentStatus TryConsumeCommentStart();
-
-  // -----------------------------------------------------------------
-  // These helper methods make the parsing code more readable.  The
-  // "character classes" refered to are defined at the top of the .cc file.
-  // Basically it is a C++ class with one method:
-  //   static bool InClass(char c);
-  // The method returns true if c is a member of this "class", like "Letter"
-  // or "Digit".
-
-  // Returns true if the current character is of the given character
-  // class, but does not consume anything.
-  template<typename CharacterClass>
-  inline bool LookingAt();
-
-  // If the current character is in the given class, consume it and return
-  // true.  Otherwise return false.
-  // e.g. TryConsumeOne<Letter>()
-  template<typename CharacterClass>
-  inline bool TryConsumeOne();
-
-  // Like above, but try to consume the specific character indicated.
-  inline bool TryConsume(char c);
-
-  // Consume zero or more of the given character class.
-  template<typename CharacterClass>
-  inline void ConsumeZeroOrMore();
-
-  // Consume one or more of the given character class or log the given
-  // error message.
-  // e.g. ConsumeOneOrMore<Digit>("Expected digits.");
-  template<typename CharacterClass>
-  inline void ConsumeOneOrMore(const char* error);
-};
-
-// inline methods ====================================================
-inline const Tokenizer::Token& Tokenizer::current() {
-  return current_;
-}
-
-inline const Tokenizer::Token& Tokenizer::previous() {
-  return previous_;
-}
-
-inline void Tokenizer::ParseString(const string& text, string* output) {
-  output->clear();
-  ParseStringAppend(text, output);
-}
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_TOKENIZER_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
deleted file mode 100644
index db5326f7..00000000
--- a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream.h
+++ /dev/null
@@ -1,238 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains the ZeroCopyInputStream and ZeroCopyOutputStream
-// interfaces, which represent abstract I/O streams to and from which
-// protocol buffers can be read and written.  For a few simple
-// implementations of these interfaces, see zero_copy_stream_impl.h.
-//
-// These interfaces are different from classic I/O streams in that they
-// try to minimize the amount of data copying that needs to be done.
-// To accomplish this, responsibility for allocating buffers is moved to
-// the stream object, rather than being the responsibility of the caller.
-// So, the stream can return a buffer which actually points directly into
-// the final data structure where the bytes are to be stored, and the caller
-// can interact directly with that buffer, eliminating an intermediate copy
-// operation.
-//
-// As an example, consider the common case in which you are reading bytes
-// from an array that is already in memory (or perhaps an mmap()ed file).
-// With classic I/O streams, you would do something like:
-//   char buffer[BUFFER_SIZE];
-//   input->Read(buffer, BUFFER_SIZE);
-//   DoSomething(buffer, BUFFER_SIZE);
-// Then, the stream basically just calls memcpy() to copy the data from
-// the array into your buffer.  With a ZeroCopyInputStream, you would do
-// this instead:
-//   const void* buffer;
-//   int size;
-//   input->Next(&buffer, &size);
-//   DoSomething(buffer, size);
-// Here, no copy is performed.  The input stream returns a pointer directly
-// into the backing array, and the caller ends up reading directly from it.
-//
-// If you want to be able to read the old-fashion way, you can create
-// a CodedInputStream or CodedOutputStream wrapping these objects and use
-// their ReadRaw()/WriteRaw() methods.  These will, of course, add a copy
-// step, but Coded*Stream will handle buffering so at least it will be
-// reasonably efficient.
-//
-// ZeroCopyInputStream example:
-//   // Read in a file and print its contents to stdout.
-//   int fd = open("myfile", O_RDONLY);
-//   ZeroCopyInputStream* input = new FileInputStream(fd);
-//
-//   const void* buffer;
-//   int size;
-//   while (input->Next(&buffer, &size)) {
-//     cout.write(buffer, size);
-//   }
-//
-//   delete input;
-//   close(fd);
-//
-// ZeroCopyOutputStream example:
-//   // Copy the contents of "infile" to "outfile", using plain read() for
-//   // "infile" but a ZeroCopyOutputStream for "outfile".
-//   int infd = open("infile", O_RDONLY);
-//   int outfd = open("outfile", O_WRONLY);
-//   ZeroCopyOutputStream* output = new FileOutputStream(outfd);
-//
-//   void* buffer;
-//   int size;
-//   while (output->Next(&buffer, &size)) {
-//     int bytes = read(infd, buffer, size);
-//     if (bytes < size) {
-//       // Reached EOF.
-//       output->BackUp(size - bytes);
-//       break;
-//     }
-//   }
-//
-//   delete output;
-//   close(infd);
-//   close(outfd);
-
-#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
-#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
-
-#include <string>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-
-namespace protobuf {
-namespace io {
-
-// Defined in this file.
-class ZeroCopyInputStream;
-class ZeroCopyOutputStream;
-
-// Abstract interface similar to an input stream but designed to minimize
-// copying.
-class LIBPROTOBUF_EXPORT ZeroCopyInputStream {
- public:
-  inline ZeroCopyInputStream() {}
-  virtual ~ZeroCopyInputStream();
-
-  // Obtains a chunk of data from the stream.
-  //
-  // Preconditions:
-  // * "size" and "data" are not NULL.
-  //
-  // Postconditions:
-  // * If the returned value is false, there is no more data to return or
-  //   an error occurred.  All errors are permanent.
-  // * Otherwise, "size" points to the actual number of bytes read and "data"
-  //   points to a pointer to a buffer containing these bytes.
-  // * Ownership of this buffer remains with the stream, and the buffer
-  //   remains valid only until some other method of the stream is called
-  //   or the stream is destroyed.
-  // * It is legal for the returned buffer to have zero size, as long
-  //   as repeatedly calling Next() eventually yields a buffer with non-zero
-  //   size.
-  virtual bool Next(const void** data, int* size) = 0;
-
-  // Backs up a number of bytes, so that the next call to Next() returns
-  // data again that was already returned by the last call to Next().  This
-  // is useful when writing procedures that are only supposed to read up
-  // to a certain point in the input, then return.  If Next() returns a
-  // buffer that goes beyond what you wanted to read, you can use BackUp()
-  // to return to the point where you intended to finish.
-  //
-  // Preconditions:
-  // * The last method called must have been Next().
-  // * count must be less than or equal to the size of the last buffer
-  //   returned by Next().
-  //
-  // Postconditions:
-  // * The last "count" bytes of the last buffer returned by Next() will be
-  //   pushed back into the stream.  Subsequent calls to Next() will return
-  //   the same data again before producing new data.
-  virtual void BackUp(int count) = 0;
-
-  // Skips a number of bytes.  Returns false if the end of the stream is
-  // reached or some input error occurred.  In the end-of-stream case, the
-  // stream is advanced to the end of the stream (so ByteCount() will return
-  // the total size of the stream).
-  virtual bool Skip(int count) = 0;
-
-  // Returns the total number of bytes read since this object was created.
-  virtual int64 ByteCount() const = 0;
-
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ZeroCopyInputStream);
-};
-
-// Abstract interface similar to an output stream but designed to minimize
-// copying.
-class LIBPROTOBUF_EXPORT ZeroCopyOutputStream {
- public:
-  inline ZeroCopyOutputStream() {}
-  virtual ~ZeroCopyOutputStream();
-
-  // Obtains a buffer into which data can be written.  Any data written
-  // into this buffer will eventually (maybe instantly, maybe later on)
-  // be written to the output.
-  //
-  // Preconditions:
-  // * "size" and "data" are not NULL.
-  //
-  // Postconditions:
-  // * If the returned value is false, an error occurred.  All errors are
-  //   permanent.
-  // * Otherwise, "size" points to the actual number of bytes in the buffer
-  //   and "data" points to the buffer.
-  // * Ownership of this buffer remains with the stream, and the buffer
-  //   remains valid only until some other method of the stream is called
-  //   or the stream is destroyed.
-  // * Any data which the caller stores in this buffer will eventually be
-  //   written to the output (unless BackUp() is called).
-  // * It is legal for the returned buffer to have zero size, as long
-  //   as repeatedly calling Next() eventually yields a buffer with non-zero
-  //   size.
-  virtual bool Next(void** data, int* size) = 0;
-
-  // Backs up a number of bytes, so that the end of the last buffer returned
-  // by Next() is not actually written.  This is needed when you finish
-  // writing all the data you want to write, but the last buffer was bigger
-  // than you needed.  You don't want to write a bunch of garbage after the
-  // end of your data, so you use BackUp() to back up.
-  //
-  // Preconditions:
-  // * The last method called must have been Next().
-  // * count must be less than or equal to the size of the last buffer
-  //   returned by Next().
-  // * The caller must not have written anything to the last "count" bytes
-  //   of that buffer.
-  //
-  // Postconditions:
-  // * The last "count" bytes of the last buffer returned by Next() will be
-  //   ignored.
-  virtual void BackUp(int count) = 0;
-
-  // Returns the total number of bytes written since this object was created.
-  virtual int64 ByteCount() const = 0;
-
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ZeroCopyOutputStream);
-};
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
deleted file mode 100644
index 9fedb005..00000000
--- a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl.h
+++ /dev/null
@@ -1,357 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains common implementations of the interfaces defined in
-// zero_copy_stream.h which are only included in the full (non-lite)
-// protobuf library.  These implementations include Unix file descriptors
-// and C++ iostreams.  See also:  zero_copy_stream_impl_lite.h
-
-#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
-#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
-
-#include <string>
-#include <iosfwd>
-#include <google/protobuf/io/zero_copy_stream.h>
-#include <google/protobuf/io/zero_copy_stream_impl_lite.h>
-#include <google/protobuf/stubs/common.h>
-
-
-namespace google {
-namespace protobuf {
-namespace io {
-
-
-// ===================================================================
-
-// A ZeroCopyInputStream which reads from a file descriptor.
-//
-// FileInputStream is preferred over using an ifstream with IstreamInputStream.
-// The latter will introduce an extra layer of buffering, harming performance.
-// Also, it's conceivable that FileInputStream could someday be enhanced
-// to use zero-copy file descriptors on OSs which support them.
-class LIBPROTOBUF_EXPORT FileInputStream : public ZeroCopyInputStream {
- public:
-  // Creates a stream that reads from the given Unix file descriptor.
-  // If a block_size is given, it specifies the number of bytes that
-  // should be read and returned with each call to Next().  Otherwise,
-  // a reasonable default is used.
-  explicit FileInputStream(int file_descriptor, int block_size = -1);
-  ~FileInputStream();
-
-  // Flushes any buffers and closes the underlying file.  Returns false if
-  // an error occurs during the process; use GetErrno() to examine the error.
-  // Even if an error occurs, the file descriptor is closed when this returns.
-  bool Close();
-
-  // By default, the file descriptor is not closed when the stream is
-  // destroyed.  Call SetCloseOnDelete(true) to change that.  WARNING:
-  // This leaves no way for the caller to detect if close() fails.  If
-  // detecting close() errors is important to you, you should arrange
-  // to close the descriptor yourself.
-  void SetCloseOnDelete(bool value) { copying_input_.SetCloseOnDelete(value); }
-
-  // If an I/O error has occurred on this file descriptor, this is the
-  // errno from that error.  Otherwise, this is zero.  Once an error
-  // occurs, the stream is broken and all subsequent operations will
-  // fail.
-  int GetErrno() { return copying_input_.GetErrno(); }
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
- private:
-  class LIBPROTOBUF_EXPORT CopyingFileInputStream : public CopyingInputStream {
-   public:
-    CopyingFileInputStream(int file_descriptor);
-    ~CopyingFileInputStream();
-
-    bool Close();
-    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }
-    int GetErrno() { return errno_; }
-
-    // implements CopyingInputStream ---------------------------------
-    int Read(void* buffer, int size);
-    int Skip(int count);
-
-   private:
-    // The file descriptor.
-    const int file_;
-    bool close_on_delete_;
-    bool is_closed_;
-
-    // The errno of the I/O error, if one has occurred.  Otherwise, zero.
-    int errno_;
-
-    // Did we try to seek once and fail?  If so, we assume this file descriptor
-    // doesn't support seeking and won't try again.
-    bool previous_seek_failed_;
-
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingFileInputStream);
-  };
-
-  CopyingFileInputStream copying_input_;
-  CopyingInputStreamAdaptor impl_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileInputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyOutputStream which writes to a file descriptor.
-//
-// FileOutputStream is preferred over using an ofstream with
-// OstreamOutputStream.  The latter will introduce an extra layer of buffering,
-// harming performance.  Also, it's conceivable that FileOutputStream could
-// someday be enhanced to use zero-copy file descriptors on OSs which
-// support them.
-class LIBPROTOBUF_EXPORT FileOutputStream : public ZeroCopyOutputStream {
- public:
-  // Creates a stream that writes to the given Unix file descriptor.
-  // If a block_size is given, it specifies the size of the buffers
-  // that should be returned by Next().  Otherwise, a reasonable default
-  // is used.
-  explicit FileOutputStream(int file_descriptor, int block_size = -1);
-  ~FileOutputStream();
-
-  // Flushes any buffers and closes the underlying file.  Returns false if
-  // an error occurs during the process; use GetErrno() to examine the error.
-  // Even if an error occurs, the file descriptor is closed when this returns.
-  bool Close();
-
-  // Flushes FileOutputStream's buffers but does not close the
-  // underlying file. No special measures are taken to ensure that
-  // underlying operating system file object is synchronized to disk.
-  bool Flush();
-
-  // By default, the file descriptor is not closed when the stream is
-  // destroyed.  Call SetCloseOnDelete(true) to change that.  WARNING:
-  // This leaves no way for the caller to detect if close() fails.  If
-  // detecting close() errors is important to you, you should arrange
-  // to close the descriptor yourself.
-  void SetCloseOnDelete(bool value) { copying_output_.SetCloseOnDelete(value); }
-
-  // If an I/O error has occurred on this file descriptor, this is the
-  // errno from that error.  Otherwise, this is zero.  Once an error
-  // occurs, the stream is broken and all subsequent operations will
-  // fail.
-  int GetErrno() { return copying_output_.GetErrno(); }
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  class LIBPROTOBUF_EXPORT CopyingFileOutputStream : public CopyingOutputStream {
-   public:
-    CopyingFileOutputStream(int file_descriptor);
-    ~CopyingFileOutputStream();
-
-    bool Close();
-    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }
-    int GetErrno() { return errno_; }
-
-    // implements CopyingOutputStream --------------------------------
-    bool Write(const void* buffer, int size);
-
-   private:
-    // The file descriptor.
-    const int file_;
-    bool close_on_delete_;
-    bool is_closed_;
-
-    // The errno of the I/O error, if one has occurred.  Otherwise, zero.
-    int errno_;
-
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingFileOutputStream);
-  };
-
-  CopyingFileOutputStream copying_output_;
-  CopyingOutputStreamAdaptor impl_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(FileOutputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyInputStream which reads from a C++ istream.
-//
-// Note that for reading files (or anything represented by a file descriptor),
-// FileInputStream is more efficient.
-class LIBPROTOBUF_EXPORT IstreamInputStream : public ZeroCopyInputStream {
- public:
-  // Creates a stream that reads from the given C++ istream.
-  // If a block_size is given, it specifies the number of bytes that
-  // should be read and returned with each call to Next().  Otherwise,
-  // a reasonable default is used.
-  explicit IstreamInputStream(istream* stream, int block_size = -1);
-  ~IstreamInputStream();
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
- private:
-  class LIBPROTOBUF_EXPORT CopyingIstreamInputStream : public CopyingInputStream {
-   public:
-    CopyingIstreamInputStream(istream* input);
-    ~CopyingIstreamInputStream();
-
-    // implements CopyingInputStream ---------------------------------
-    int Read(void* buffer, int size);
-    // (We use the default implementation of Skip().)
-
-   private:
-    // The stream.
-    istream* input_;
-
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingIstreamInputStream);
-  };
-
-  CopyingIstreamInputStream copying_input_;
-  CopyingInputStreamAdaptor impl_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(IstreamInputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyOutputStream which writes to a C++ ostream.
-//
-// Note that for writing files (or anything represented by a file descriptor),
-// FileOutputStream is more efficient.
-class LIBPROTOBUF_EXPORT OstreamOutputStream : public ZeroCopyOutputStream {
- public:
-  // Creates a stream that writes to the given C++ ostream.
-  // If a block_size is given, it specifies the size of the buffers
-  // that should be returned by Next().  Otherwise, a reasonable default
-  // is used.
-  explicit OstreamOutputStream(ostream* stream, int block_size = -1);
-  ~OstreamOutputStream();
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  class LIBPROTOBUF_EXPORT CopyingOstreamOutputStream : public CopyingOutputStream {
-   public:
-    CopyingOstreamOutputStream(ostream* output);
-    ~CopyingOstreamOutputStream();
-
-    // implements CopyingOutputStream --------------------------------
-    bool Write(const void* buffer, int size);
-
-   private:
-    // The stream.
-    ostream* output_;
-
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingOstreamOutputStream);
-  };
-
-  CopyingOstreamOutputStream copying_output_;
-  CopyingOutputStreamAdaptor impl_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(OstreamOutputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyInputStream which reads from several other streams in sequence.
-// ConcatenatingInputStream is unable to distinguish between end-of-stream
-// and read errors in the underlying streams, so it assumes any errors mean
-// end-of-stream.  So, if the underlying streams fail for any other reason,
-// ConcatenatingInputStream may do odd things.  It is suggested that you do
-// not use ConcatenatingInputStream on streams that might produce read errors
-// other than end-of-stream.
-class LIBPROTOBUF_EXPORT ConcatenatingInputStream : public ZeroCopyInputStream {
- public:
-  // All streams passed in as well as the array itself must remain valid
-  // until the ConcatenatingInputStream is destroyed.
-  ConcatenatingInputStream(ZeroCopyInputStream* const streams[], int count);
-  ~ConcatenatingInputStream();
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
-
- private:
-  // As streams are retired, streams_ is incremented and count_ is
-  // decremented.
-  ZeroCopyInputStream* const* streams_;
-  int stream_count_;
-  int64 bytes_retired_;  // Bytes read from previous streams.
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ConcatenatingInputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyInputStream which wraps some other stream and limits it to
-// a particular byte count.
-class LIBPROTOBUF_EXPORT LimitingInputStream : public ZeroCopyInputStream {
- public:
-  LimitingInputStream(ZeroCopyInputStream* input, int64 limit);
-  ~LimitingInputStream();
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
-
- private:
-  ZeroCopyInputStream* input_;
-  int64 limit_;  // Decreases as we go, becomes negative if we overshoot.
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(LimitingInputStream);
-};
-
-// ===================================================================
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__
diff --git a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h b/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
deleted file mode 100644
index 153f543e..00000000
--- a/ps-lite/deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h
+++ /dev/null
@@ -1,340 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This file contains common implementations of the interfaces defined in
-// zero_copy_stream.h which are included in the "lite" protobuf library.
-// These implementations cover I/O on raw arrays and strings, as well as
-// adaptors which make it easy to implement streams based on traditional
-// streams.  Of course, many users will probably want to write their own
-// implementations of these interfaces specific to the particular I/O
-// abstractions they prefer to use, but these should cover the most common
-// cases.
-
-#ifndef GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
-#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
-
-#include <string>
-#include <iosfwd>
-#include <google/protobuf/io/zero_copy_stream.h>
-#include <google/protobuf/stubs/common.h>
-
-
-namespace google {
-namespace protobuf {
-namespace io {
-
-// ===================================================================
-
-// A ZeroCopyInputStream backed by an in-memory array of bytes.
-class LIBPROTOBUF_EXPORT ArrayInputStream : public ZeroCopyInputStream {
- public:
-  // Create an InputStream that returns the bytes pointed to by "data".
-  // "data" remains the property of the caller but must remain valid until
-  // the stream is destroyed.  If a block_size is given, calls to Next()
-  // will return data blocks no larger than the given size.  Otherwise, the
-  // first call to Next() returns the entire array.  block_size is mainly
-  // useful for testing; in production you would probably never want to set
-  // it.
-  ArrayInputStream(const void* data, int size, int block_size = -1);
-  ~ArrayInputStream();
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
-
- private:
-  const uint8* const data_;  // The byte array.
-  const int size_;           // Total size of the array.
-  const int block_size_;     // How many bytes to return at a time.
-
-  int position_;
-  int last_returned_size_;   // How many bytes we returned last time Next()
-                             // was called (used for error checking only).
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ArrayInputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyOutputStream backed by an in-memory array of bytes.
-class LIBPROTOBUF_EXPORT ArrayOutputStream : public ZeroCopyOutputStream {
- public:
-  // Create an OutputStream that writes to the bytes pointed to by "data".
-  // "data" remains the property of the caller but must remain valid until
-  // the stream is destroyed.  If a block_size is given, calls to Next()
-  // will return data blocks no larger than the given size.  Otherwise, the
-  // first call to Next() returns the entire array.  block_size is mainly
-  // useful for testing; in production you would probably never want to set
-  // it.
-  ArrayOutputStream(void* data, int size, int block_size = -1);
-  ~ArrayOutputStream();
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  uint8* const data_;        // The byte array.
-  const int size_;           // Total size of the array.
-  const int block_size_;     // How many bytes to return at a time.
-
-  int position_;
-  int last_returned_size_;   // How many bytes we returned last time Next()
-                             // was called (used for error checking only).
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ArrayOutputStream);
-};
-
-// ===================================================================
-
-// A ZeroCopyOutputStream which appends bytes to a string.
-class LIBPROTOBUF_EXPORT StringOutputStream : public ZeroCopyOutputStream {
- public:
-  // Create a StringOutputStream which appends bytes to the given string.
-  // The string remains property of the caller, but it MUST NOT be accessed
-  // in any way until the stream is destroyed.
-  //
-  // Hint:  If you call target->reserve(n) before creating the stream,
-  //   the first call to Next() will return at least n bytes of buffer
-  //   space.
-  explicit StringOutputStream(string* target);
-  ~StringOutputStream();
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  static const int kMinimumSize = 16;
-
-  string* target_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(StringOutputStream);
-};
-
-// Note:  There is no StringInputStream.  Instead, just create an
-// ArrayInputStream as follows:
-//   ArrayInputStream input(str.data(), str.size());
-
-// ===================================================================
-
-// A generic traditional input stream interface.
-//
-// Lots of traditional input streams (e.g. file descriptors, C stdio
-// streams, and C++ iostreams) expose an interface where every read
-// involves copying bytes into a buffer.  If you want to take such an
-// interface and make a ZeroCopyInputStream based on it, simply implement
-// CopyingInputStream and then use CopyingInputStreamAdaptor.
-//
-// CopyingInputStream implementations should avoid buffering if possible.
-// CopyingInputStreamAdaptor does its own buffering and will read data
-// in large blocks.
-class LIBPROTOBUF_EXPORT CopyingInputStream {
- public:
-  virtual ~CopyingInputStream();
-
-  // Reads up to "size" bytes into the given buffer.  Returns the number of
-  // bytes read.  Read() waits until at least one byte is available, or
-  // returns zero if no bytes will ever become available (EOF), or -1 if a
-  // permanent read error occurred.
-  virtual int Read(void* buffer, int size) = 0;
-
-  // Skips the next "count" bytes of input.  Returns the number of bytes
-  // actually skipped.  This will always be exactly equal to "count" unless
-  // EOF was reached or a permanent read error occurred.
-  //
-  // The default implementation just repeatedly calls Read() into a scratch
-  // buffer.
-  virtual int Skip(int count);
-};
-
-// A ZeroCopyInputStream which reads from a CopyingInputStream.  This is
-// useful for implementing ZeroCopyInputStreams that read from traditional
-// streams.  Note that this class is not really zero-copy.
-//
-// If you want to read from file descriptors or C++ istreams, this is
-// already implemented for you:  use FileInputStream or IstreamInputStream
-// respectively.
-class LIBPROTOBUF_EXPORT CopyingInputStreamAdaptor : public ZeroCopyInputStream {
- public:
-  // Creates a stream that reads from the given CopyingInputStream.
-  // If a block_size is given, it specifies the number of bytes that
-  // should be read and returned with each call to Next().  Otherwise,
-  // a reasonable default is used.  The caller retains ownership of
-  // copying_stream unless SetOwnsCopyingStream(true) is called.
-  explicit CopyingInputStreamAdaptor(CopyingInputStream* copying_stream,
-                                     int block_size = -1);
-  ~CopyingInputStreamAdaptor();
-
-  // Call SetOwnsCopyingStream(true) to tell the CopyingInputStreamAdaptor to
-  // delete the underlying CopyingInputStream when it is destroyed.
-  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }
-
-  // implements ZeroCopyInputStream ----------------------------------
-  bool Next(const void** data, int* size);
-  void BackUp(int count);
-  bool Skip(int count);
-  int64 ByteCount() const;
-
- private:
-  // Insures that buffer_ is not NULL.
-  void AllocateBufferIfNeeded();
-  // Frees the buffer and resets buffer_used_.
-  void FreeBuffer();
-
-  // The underlying copying stream.
-  CopyingInputStream* copying_stream_;
-  bool owns_copying_stream_;
-
-  // True if we have seen a permenant error from the underlying stream.
-  bool failed_;
-
-  // The current position of copying_stream_, relative to the point where
-  // we started reading.
-  int64 position_;
-
-  // Data is read into this buffer.  It may be NULL if no buffer is currently
-  // in use.  Otherwise, it points to an array of size buffer_size_.
-  scoped_array<uint8> buffer_;
-  const int buffer_size_;
-
-  // Number of valid bytes currently in the buffer (i.e. the size last
-  // returned by Next()).  0 <= buffer_used_ <= buffer_size_.
-  int buffer_used_;
-
-  // Number of bytes in the buffer which were backed up over by a call to
-  // BackUp().  These need to be returned again.
-  // 0 <= backup_bytes_ <= buffer_used_
-  int backup_bytes_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingInputStreamAdaptor);
-};
-
-// ===================================================================
-
-// A generic traditional output stream interface.
-//
-// Lots of traditional output streams (e.g. file descriptors, C stdio
-// streams, and C++ iostreams) expose an interface where every write
-// involves copying bytes from a buffer.  If you want to take such an
-// interface and make a ZeroCopyOutputStream based on it, simply implement
-// CopyingOutputStream and then use CopyingOutputStreamAdaptor.
-//
-// CopyingOutputStream implementations should avoid buffering if possible.
-// CopyingOutputStreamAdaptor does its own buffering and will write data
-// in large blocks.
-class LIBPROTOBUF_EXPORT CopyingOutputStream {
- public:
-  virtual ~CopyingOutputStream();
-
-  // Writes "size" bytes from the given buffer to the output.  Returns true
-  // if successful, false on a write error.
-  virtual bool Write(const void* buffer, int size) = 0;
-};
-
-// A ZeroCopyOutputStream which writes to a CopyingOutputStream.  This is
-// useful for implementing ZeroCopyOutputStreams that write to traditional
-// streams.  Note that this class is not really zero-copy.
-//
-// If you want to write to file descriptors or C++ ostreams, this is
-// already implemented for you:  use FileOutputStream or OstreamOutputStream
-// respectively.
-class LIBPROTOBUF_EXPORT CopyingOutputStreamAdaptor : public ZeroCopyOutputStream {
- public:
-  // Creates a stream that writes to the given Unix file descriptor.
-  // If a block_size is given, it specifies the size of the buffers
-  // that should be returned by Next().  Otherwise, a reasonable default
-  // is used.
-  explicit CopyingOutputStreamAdaptor(CopyingOutputStream* copying_stream,
-                                      int block_size = -1);
-  ~CopyingOutputStreamAdaptor();
-
-  // Writes all pending data to the underlying stream.  Returns false if a
-  // write error occurred on the underlying stream.  (The underlying
-  // stream itself is not necessarily flushed.)
-  bool Flush();
-
-  // Call SetOwnsCopyingStream(true) to tell the CopyingOutputStreamAdaptor to
-  // delete the underlying CopyingOutputStream when it is destroyed.
-  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }
-
-  // implements ZeroCopyOutputStream ---------------------------------
-  bool Next(void** data, int* size);
-  void BackUp(int count);
-  int64 ByteCount() const;
-
- private:
-  // Write the current buffer, if it is present.
-  bool WriteBuffer();
-  // Insures that buffer_ is not NULL.
-  void AllocateBufferIfNeeded();
-  // Frees the buffer.
-  void FreeBuffer();
-
-  // The underlying copying stream.
-  CopyingOutputStream* copying_stream_;
-  bool owns_copying_stream_;
-
-  // True if we have seen a permenant error from the underlying stream.
-  bool failed_;
-
-  // The current position of copying_stream_, relative to the point where
-  // we started writing.
-  int64 position_;
-
-  // Data is written from this buffer.  It may be NULL if no buffer is
-  // currently in use.  Otherwise, it points to an array of size buffer_size_.
-  scoped_array<uint8> buffer_;
-  const int buffer_size_;
-
-  // Number of valid bytes currently in the buffer (i.e. the size last
-  // returned by Next()).  When BackUp() is called, we just reduce this.
-  // 0 <= buffer_used_ <= buffer_size_.
-  int buffer_used_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(CopyingOutputStreamAdaptor);
-};
-
-// ===================================================================
-
-}  // namespace io
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/message.h b/ps-lite/deps/include/google/protobuf/message.h
deleted file mode 100644
index 0f90bc1a..00000000
--- a/ps-lite/deps/include/google/protobuf/message.h
+++ /dev/null
@@ -1,837 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Defines Message, the abstract interface implemented by non-lite
-// protocol message objects.  Although it's possible to implement this
-// interface manually, most users will use the protocol compiler to
-// generate implementations.
-//
-// Example usage:
-//
-// Say you have a message defined as:
-//
-//   message Foo {
-//     optional string text = 1;
-//     repeated int32 numbers = 2;
-//   }
-//
-// Then, if you used the protocol compiler to generate a class from the above
-// definition, you could use it like so:
-//
-//   string data;  // Will store a serialized version of the message.
-//
-//   {
-//     // Create a message and serialize it.
-//     Foo foo;
-//     foo.set_text("Hello World!");
-//     foo.add_numbers(1);
-//     foo.add_numbers(5);
-//     foo.add_numbers(42);
-//
-//     foo.SerializeToString(&data);
-//   }
-//
-//   {
-//     // Parse the serialized message and check that it contains the
-//     // correct data.
-//     Foo foo;
-//     foo.ParseFromString(data);
-//
-//     assert(foo.text() == "Hello World!");
-//     assert(foo.numbers_size() == 3);
-//     assert(foo.numbers(0) == 1);
-//     assert(foo.numbers(1) == 5);
-//     assert(foo.numbers(2) == 42);
-//   }
-//
-//   {
-//     // Same as the last block, but do it dynamically via the Message
-//     // reflection interface.
-//     Message* foo = new Foo;
-//     const Descriptor* descriptor = foo->GetDescriptor();
-//
-//     // Get the descriptors for the fields we're interested in and verify
-//     // their types.
-//     const FieldDescriptor* text_field = descriptor->FindFieldByName("text");
-//     assert(text_field != NULL);
-//     assert(text_field->type() == FieldDescriptor::TYPE_STRING);
-//     assert(text_field->label() == FieldDescriptor::LABEL_OPTIONAL);
-//     const FieldDescriptor* numbers_field = descriptor->
-//                                            FindFieldByName("numbers");
-//     assert(numbers_field != NULL);
-//     assert(numbers_field->type() == FieldDescriptor::TYPE_INT32);
-//     assert(numbers_field->label() == FieldDescriptor::LABEL_REPEATED);
-//
-//     // Parse the message.
-//     foo->ParseFromString(data);
-//
-//     // Use the reflection interface to examine the contents.
-//     const Reflection* reflection = foo->GetReflection();
-//     assert(reflection->GetString(foo, text_field) == "Hello World!");
-//     assert(reflection->FieldSize(foo, numbers_field) == 3);
-//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 0) == 1);
-//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 1) == 5);
-//     assert(reflection->GetRepeatedInt32(foo, numbers_field, 2) == 42);
-//
-//     delete foo;
-//   }
-
-#ifndef GOOGLE_PROTOBUF_MESSAGE_H__
-#define GOOGLE_PROTOBUF_MESSAGE_H__
-
-#include <vector>
-#include <string>
-
-#ifdef __DECCXX
-// HP C++'s iosfwd doesn't work.
-#include <iostream>
-#else
-#include <iosfwd>
-#endif
-
-#include <google/protobuf/message_lite.h>
-
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/descriptor.h>
-
-
-namespace google {
-namespace protobuf {
-
-// Defined in this file.
-class Message;
-class Reflection;
-class MessageFactory;
-
-// Defined in other files.
-class UnknownFieldSet;         // unknown_field_set.h
-namespace io {
-  class ZeroCopyInputStream;   // zero_copy_stream.h
-  class ZeroCopyOutputStream;  // zero_copy_stream.h
-  class CodedInputStream;      // coded_stream.h
-  class CodedOutputStream;     // coded_stream.h
-}
-
-
-template<typename T>
-class RepeatedField;     // repeated_field.h
-
-template<typename T>
-class RepeatedPtrField;  // repeated_field.h
-
-// A container to hold message metadata.
-struct Metadata {
-  const Descriptor* descriptor;
-  const Reflection* reflection;
-};
-
-// Abstract interface for protocol messages.
-//
-// See also MessageLite, which contains most every-day operations.  Message
-// adds descriptors and reflection on top of that.
-//
-// The methods of this class that are virtual but not pure-virtual have
-// default implementations based on reflection.  Message classes which are
-// optimized for speed will want to override these with faster implementations,
-// but classes optimized for code size may be happy with keeping them.  See
-// the optimize_for option in descriptor.proto.
-class LIBPROTOBUF_EXPORT Message : public MessageLite {
- public:
-  inline Message() {}
-  virtual ~Message();
-
-  // Basic Operations ------------------------------------------------
-
-  // Construct a new instance of the same type.  Ownership is passed to the
-  // caller.  (This is also defined in MessageLite, but is defined again here
-  // for return-type covariance.)
-  virtual Message* New() const = 0;
-
-  // Make this message into a copy of the given message.  The given message
-  // must have the same descriptor, but need not necessarily be the same class.
-  // By default this is just implemented as "Clear(); MergeFrom(from);".
-  virtual void CopyFrom(const Message& from);
-
-  // Merge the fields from the given message into this message.  Singular
-  // fields will be overwritten, except for embedded messages which will
-  // be merged.  Repeated fields will be concatenated.  The given message
-  // must be of the same type as this message (i.e. the exact same class).
-  virtual void MergeFrom(const Message& from);
-
-  // Verifies that IsInitialized() returns true.  GOOGLE_CHECK-fails otherwise, with
-  // a nice error message.
-  void CheckInitialized() const;
-
-  // Slowly build a list of all required fields that are not set.
-  // This is much, much slower than IsInitialized() as it is implemented
-  // purely via reflection.  Generally, you should not call this unless you
-  // have already determined that an error exists by calling IsInitialized().
-  void FindInitializationErrors(vector<string>* errors) const;
-
-  // Like FindInitializationErrors, but joins all the strings, delimited by
-  // commas, and returns them.
-  string InitializationErrorString() const;
-
-  // Clears all unknown fields from this message and all embedded messages.
-  // Normally, if unknown tag numbers are encountered when parsing a message,
-  // the tag and value are stored in the message's UnknownFieldSet and
-  // then written back out when the message is serialized.  This allows servers
-  // which simply route messages to other servers to pass through messages
-  // that have new field definitions which they don't yet know about.  However,
-  // this behavior can have security implications.  To avoid it, call this
-  // method after parsing.
-  //
-  // See Reflection::GetUnknownFields() for more on unknown fields.
-  virtual void DiscardUnknownFields();
-
-  // Computes (an estimate of) the total number of bytes currently used for
-  // storing the message in memory.  The default implementation calls the
-  // Reflection object's SpaceUsed() method.
-  virtual int SpaceUsed() const;
-
-  // Debugging & Testing----------------------------------------------
-
-  // Generates a human readable form of this message, useful for debugging
-  // and other purposes.
-  string DebugString() const;
-  // Like DebugString(), but with less whitespace.
-  string ShortDebugString() const;
-  // Like DebugString(), but do not escape UTF-8 byte sequences.
-  string Utf8DebugString() const;
-  // Convenience function useful in GDB.  Prints DebugString() to stdout.
-  void PrintDebugString() const;
-
-  // Heavy I/O -------------------------------------------------------
-  // Additional parsing and serialization methods not implemented by
-  // MessageLite because they are not supported by the lite library.
-
-  // Parse a protocol buffer from a file descriptor.  If successful, the entire
-  // input will be consumed.
-  bool ParseFromFileDescriptor(int file_descriptor);
-  // Like ParseFromFileDescriptor(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromFileDescriptor(int file_descriptor);
-  // Parse a protocol buffer from a C++ istream.  If successful, the entire
-  // input will be consumed.
-  bool ParseFromIstream(istream* input);
-  // Like ParseFromIstream(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromIstream(istream* input);
-
-  // Serialize the message and write it to the given file descriptor.  All
-  // required fields must be set.
-  bool SerializeToFileDescriptor(int file_descriptor) const;
-  // Like SerializeToFileDescriptor(), but allows missing required fields.
-  bool SerializePartialToFileDescriptor(int file_descriptor) const;
-  // Serialize the message and write it to the given C++ ostream.  All
-  // required fields must be set.
-  bool SerializeToOstream(ostream* output) const;
-  // Like SerializeToOstream(), but allows missing required fields.
-  bool SerializePartialToOstream(ostream* output) const;
-
-
-  // Reflection-based methods ----------------------------------------
-  // These methods are pure-virtual in MessageLite, but Message provides
-  // reflection-based default implementations.
-
-  virtual string GetTypeName() const;
-  virtual void Clear();
-  virtual bool IsInitialized() const;
-  virtual void CheckTypeAndMergeFrom(const MessageLite& other);
-  virtual bool MergePartialFromCodedStream(io::CodedInputStream* input);
-  virtual int ByteSize() const;
-  virtual void SerializeWithCachedSizes(io::CodedOutputStream* output) const;
-
- private:
-  // This is called only by the default implementation of ByteSize(), to
-  // update the cached size.  If you override ByteSize(), you do not need
-  // to override this.  If you do not override ByteSize(), you MUST override
-  // this; the default implementation will crash.
-  //
-  // The method is private because subclasses should never call it; only
-  // override it.  Yes, C++ lets you do that.  Crazy, huh?
-  virtual void SetCachedSize(int size) const;
-
- public:
-
-  // Introspection ---------------------------------------------------
-
-  // Typedef for backwards-compatibility.
-  typedef google::protobuf::Reflection Reflection;
-
-  // Get a Descriptor for this message's type.  This describes what
-  // fields the message contains, the types of those fields, etc.
-  const Descriptor* GetDescriptor() const { return GetMetadata().descriptor; }
-
-  // Get the Reflection interface for this Message, which can be used to
-  // read and modify the fields of the Message dynamically (in other words,
-  // without knowing the message type at compile time).  This object remains
-  // property of the Message.
-  //
-  // This method remains virtual in case a subclass does not implement
-  // reflection and wants to override the default behavior.
-  virtual const Reflection* GetReflection() const {
-    return GetMetadata().reflection;
-  }
-
- protected:
-  // Get a struct containing the metadata for the Message. Most subclasses only
-  // need to implement this method, rather than the GetDescriptor() and
-  // GetReflection() wrappers.
-  virtual Metadata GetMetadata() const  = 0;
-
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Message);
-};
-
-// This interface contains methods that can be used to dynamically access
-// and modify the fields of a protocol message.  Their semantics are
-// similar to the accessors the protocol compiler generates.
-//
-// To get the Reflection for a given Message, call Message::GetReflection().
-//
-// This interface is separate from Message only for efficiency reasons;
-// the vast majority of implementations of Message will share the same
-// implementation of Reflection (GeneratedMessageReflection,
-// defined in generated_message.h), and all Messages of a particular class
-// should share the same Reflection object (though you should not rely on
-// the latter fact).
-//
-// There are several ways that these methods can be used incorrectly.  For
-// example, any of the following conditions will lead to undefined
-// results (probably assertion failures):
-// - The FieldDescriptor is not a field of this message type.
-// - The method called is not appropriate for the field's type.  For
-//   each field type in FieldDescriptor::TYPE_*, there is only one
-//   Get*() method, one Set*() method, and one Add*() method that is
-//   valid for that type.  It should be obvious which (except maybe
-//   for TYPE_BYTES, which are represented using strings in C++).
-// - A Get*() or Set*() method for singular fields is called on a repeated
-//   field.
-// - GetRepeated*(), SetRepeated*(), or Add*() is called on a non-repeated
-//   field.
-// - The Message object passed to any method is not of the right type for
-//   this Reflection object (i.e. message.GetReflection() != reflection).
-//
-// You might wonder why there is not any abstract representation for a field
-// of arbitrary type.  E.g., why isn't there just a "GetField()" method that
-// returns "const Field&", where "Field" is some class with accessors like
-// "GetInt32Value()".  The problem is that someone would have to deal with
-// allocating these Field objects.  For generated message classes, having to
-// allocate space for an additional object to wrap every field would at least
-// double the message's memory footprint, probably worse.  Allocating the
-// objects on-demand, on the other hand, would be expensive and prone to
-// memory leaks.  So, instead we ended up with this flat interface.
-//
-// TODO(kenton):  Create a utility class which callers can use to read and
-//   write fields from a Reflection without paying attention to the type.
-class LIBPROTOBUF_EXPORT Reflection {
- public:
-  inline Reflection() {}
-  virtual ~Reflection();
-
-  // Get the UnknownFieldSet for the message.  This contains fields which
-  // were seen when the Message was parsed but were not recognized according
-  // to the Message's definition.
-  virtual const UnknownFieldSet& GetUnknownFields(
-      const Message& message) const = 0;
-  // Get a mutable pointer to the UnknownFieldSet for the message.  This
-  // contains fields which were seen when the Message was parsed but were not
-  // recognized according to the Message's definition.
-  virtual UnknownFieldSet* MutableUnknownFields(Message* message) const = 0;
-
-  // Estimate the amount of memory used by the message object.
-  virtual int SpaceUsed(const Message& message) const = 0;
-
-  // Check if the given non-repeated field is set.
-  virtual bool HasField(const Message& message,
-                        const FieldDescriptor* field) const = 0;
-
-  // Get the number of elements of a repeated field.
-  virtual int FieldSize(const Message& message,
-                        const FieldDescriptor* field) const = 0;
-
-  // Clear the value of a field, so that HasField() returns false or
-  // FieldSize() returns zero.
-  virtual void ClearField(Message* message,
-                          const FieldDescriptor* field) const = 0;
-
-  // Removes the last element of a repeated field.
-  // We don't provide a way to remove any element other than the last
-  // because it invites inefficient use, such as O(n^2) filtering loops
-  // that should have been O(n).  If you want to remove an element other
-  // than the last, the best way to do it is to re-arrange the elements
-  // (using Swap()) so that the one you want removed is at the end, then
-  // call RemoveLast().
-  virtual void RemoveLast(Message* message,
-                          const FieldDescriptor* field) const = 0;
-  // Removes the last element of a repeated message field, and returns the
-  // pointer to the caller.  Caller takes ownership of the returned pointer.
-  virtual Message* ReleaseLast(Message* message,
-                               const FieldDescriptor* field) const = 0;
-
-  // Swap the complete contents of two messages.
-  virtual void Swap(Message* message1, Message* message2) const = 0;
-
-  // Swap two elements of a repeated field.
-  virtual void SwapElements(Message* message,
-                    const FieldDescriptor* field,
-                    int index1,
-                    int index2) const = 0;
-
-  // List all fields of the message which are currently set.  This includes
-  // extensions.  Singular fields will only be listed if HasField(field) would
-  // return true and repeated fields will only be listed if FieldSize(field)
-  // would return non-zero.  Fields (both normal fields and extension fields)
-  // will be listed ordered by field number.
-  virtual void ListFields(const Message& message,
-                          vector<const FieldDescriptor*>* output) const = 0;
-
-  // Singular field getters ------------------------------------------
-  // These get the value of a non-repeated field.  They return the default
-  // value for fields that aren't set.
-
-  virtual int32  GetInt32 (const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual int64  GetInt64 (const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual uint32 GetUInt32(const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual uint64 GetUInt64(const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual float  GetFloat (const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual double GetDouble(const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual bool   GetBool  (const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual string GetString(const Message& message,
-                           const FieldDescriptor* field) const = 0;
-  virtual const EnumValueDescriptor* GetEnum(
-      const Message& message, const FieldDescriptor* field) const = 0;
-  // See MutableMessage() for the meaning of the "factory" parameter.
-  virtual const Message& GetMessage(const Message& message,
-                                    const FieldDescriptor* field,
-                                    MessageFactory* factory = NULL) const = 0;
-
-  // Get a string value without copying, if possible.
-  //
-  // GetString() necessarily returns a copy of the string.  This can be
-  // inefficient when the string is already stored in a string object in the
-  // underlying message.  GetStringReference() will return a reference to the
-  // underlying string in this case.  Otherwise, it will copy the string into
-  // *scratch and return that.
-  //
-  // Note:  It is perfectly reasonable and useful to write code like:
-  //     str = reflection->GetStringReference(field, &str);
-  //   This line would ensure that only one copy of the string is made
-  //   regardless of the field's underlying representation.  When initializing
-  //   a newly-constructed string, though, it's just as fast and more readable
-  //   to use code like:
-  //     string str = reflection->GetString(field);
-  virtual const string& GetStringReference(const Message& message,
-                                           const FieldDescriptor* field,
-                                           string* scratch) const = 0;
-
-
-  // Singular field mutators -----------------------------------------
-  // These mutate the value of a non-repeated field.
-
-  virtual void SetInt32 (Message* message,
-                         const FieldDescriptor* field, int32  value) const = 0;
-  virtual void SetInt64 (Message* message,
-                         const FieldDescriptor* field, int64  value) const = 0;
-  virtual void SetUInt32(Message* message,
-                         const FieldDescriptor* field, uint32 value) const = 0;
-  virtual void SetUInt64(Message* message,
-                         const FieldDescriptor* field, uint64 value) const = 0;
-  virtual void SetFloat (Message* message,
-                         const FieldDescriptor* field, float  value) const = 0;
-  virtual void SetDouble(Message* message,
-                         const FieldDescriptor* field, double value) const = 0;
-  virtual void SetBool  (Message* message,
-                         const FieldDescriptor* field, bool   value) const = 0;
-  virtual void SetString(Message* message,
-                         const FieldDescriptor* field,
-                         const string& value) const = 0;
-  virtual void SetEnum  (Message* message,
-                         const FieldDescriptor* field,
-                         const EnumValueDescriptor* value) const = 0;
-  // Get a mutable pointer to a field with a message type.  If a MessageFactory
-  // is provided, it will be used to construct instances of the sub-message;
-  // otherwise, the default factory is used.  If the field is an extension that
-  // does not live in the same pool as the containing message's descriptor (e.g.
-  // it lives in an overlay pool), then a MessageFactory must be provided.
-  // If you have no idea what that meant, then you probably don't need to worry
-  // about it (don't provide a MessageFactory).  WARNING:  If the
-  // FieldDescriptor is for a compiled-in extension, then
-  // factory->GetPrototype(field->message_type() MUST return an instance of the
-  // compiled-in class for this type, NOT DynamicMessage.
-  virtual Message* MutableMessage(Message* message,
-                                  const FieldDescriptor* field,
-                                  MessageFactory* factory = NULL) const = 0;
-  // Releases the message specified by 'field' and returns the pointer,
-  // ReleaseMessage() will return the message the message object if it exists.
-  // Otherwise, it may or may not return NULL.  In any case, if the return value
-  // is non-NULL, the caller takes ownership of the pointer.
-  // If the field existed (HasField() is true), then the returned pointer will
-  // be the same as the pointer returned by MutableMessage().
-  // This function has the same effect as ClearField().
-  virtual Message* ReleaseMessage(Message* message,
-                                  const FieldDescriptor* field,
-                                  MessageFactory* factory = NULL) const = 0;
-
-
-  // Repeated field getters ------------------------------------------
-  // These get the value of one element of a repeated field.
-
-  virtual int32  GetRepeatedInt32 (const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual int64  GetRepeatedInt64 (const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual uint32 GetRepeatedUInt32(const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual uint64 GetRepeatedUInt64(const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual float  GetRepeatedFloat (const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual double GetRepeatedDouble(const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual bool   GetRepeatedBool  (const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual string GetRepeatedString(const Message& message,
-                                   const FieldDescriptor* field,
-                                   int index) const = 0;
-  virtual const EnumValueDescriptor* GetRepeatedEnum(
-      const Message& message,
-      const FieldDescriptor* field, int index) const = 0;
-  virtual const Message& GetRepeatedMessage(
-      const Message& message,
-      const FieldDescriptor* field, int index) const = 0;
-
-  // See GetStringReference(), above.
-  virtual const string& GetRepeatedStringReference(
-      const Message& message, const FieldDescriptor* field,
-      int index, string* scratch) const = 0;
-
-
-  // Repeated field mutators -----------------------------------------
-  // These mutate the value of one element of a repeated field.
-
-  virtual void SetRepeatedInt32 (Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, int32  value) const = 0;
-  virtual void SetRepeatedInt64 (Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, int64  value) const = 0;
-  virtual void SetRepeatedUInt32(Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, uint32 value) const = 0;
-  virtual void SetRepeatedUInt64(Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, uint64 value) const = 0;
-  virtual void SetRepeatedFloat (Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, float  value) const = 0;
-  virtual void SetRepeatedDouble(Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, double value) const = 0;
-  virtual void SetRepeatedBool  (Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, bool   value) const = 0;
-  virtual void SetRepeatedString(Message* message,
-                                 const FieldDescriptor* field,
-                                 int index, const string& value) const = 0;
-  virtual void SetRepeatedEnum(Message* message,
-                               const FieldDescriptor* field, int index,
-                               const EnumValueDescriptor* value) const = 0;
-  // Get a mutable pointer to an element of a repeated field with a message
-  // type.
-  virtual Message* MutableRepeatedMessage(
-      Message* message, const FieldDescriptor* field, int index) const = 0;
-
-
-  // Repeated field adders -------------------------------------------
-  // These add an element to a repeated field.
-
-  virtual void AddInt32 (Message* message,
-                         const FieldDescriptor* field, int32  value) const = 0;
-  virtual void AddInt64 (Message* message,
-                         const FieldDescriptor* field, int64  value) const = 0;
-  virtual void AddUInt32(Message* message,
-                         const FieldDescriptor* field, uint32 value) const = 0;
-  virtual void AddUInt64(Message* message,
-                         const FieldDescriptor* field, uint64 value) const = 0;
-  virtual void AddFloat (Message* message,
-                         const FieldDescriptor* field, float  value) const = 0;
-  virtual void AddDouble(Message* message,
-                         const FieldDescriptor* field, double value) const = 0;
-  virtual void AddBool  (Message* message,
-                         const FieldDescriptor* field, bool   value) const = 0;
-  virtual void AddString(Message* message,
-                         const FieldDescriptor* field,
-                         const string& value) const = 0;
-  virtual void AddEnum  (Message* message,
-                         const FieldDescriptor* field,
-                         const EnumValueDescriptor* value) const = 0;
-  // See MutableMessage() for comments on the "factory" parameter.
-  virtual Message* AddMessage(Message* message,
-                              const FieldDescriptor* field,
-                              MessageFactory* factory = NULL) const = 0;
-
-
-  // Repeated field accessors  -------------------------------------------------
-  // The methods above, e.g. GetRepeatedInt32(msg, fd, index), provide singular
-  // access to the data in a RepeatedField.  The methods below provide aggregate
-  // access by exposing the RepeatedField object itself with the Message.
-  // Applying these templates to inappropriate types will lead to an undefined
-  // reference at link time (e.g. GetRepeatedField<***double>), or possibly a
-  // template matching error at compile time (e.g. GetRepeatedPtrField<File>).
-  //
-  // Usage example: my_doubs = refl->GetRepeatedField<double>(msg, fd);
-
-  // for T = Cord and all protobuf scalar types except enums.
-  template<typename T>
-  const RepeatedField<T>& GetRepeatedField(
-      const Message&, const FieldDescriptor*) const;
-
-  // for T = Cord and all protobuf scalar types except enums.
-  template<typename T>
-  RepeatedField<T>* MutableRepeatedField(
-      Message*, const FieldDescriptor*) const;
-
-  // for T = string, google::protobuf::internal::StringPieceField
-  //         google::protobuf::Message & descendants.
-  template<typename T>
-  const RepeatedPtrField<T>& GetRepeatedPtrField(
-      const Message&, const FieldDescriptor*) const;
-
-  // for T = string, google::protobuf::internal::StringPieceField
-  //         google::protobuf::Message & descendants.
-  template<typename T>
-  RepeatedPtrField<T>* MutableRepeatedPtrField(
-      Message*, const FieldDescriptor*) const;
-
-  // Extensions ----------------------------------------------------------------
-
-  // Try to find an extension of this message type by fully-qualified field
-  // name.  Returns NULL if no extension is known for this name or number.
-  virtual const FieldDescriptor* FindKnownExtensionByName(
-      const string& name) const = 0;
-
-  // Try to find an extension of this message type by field number.
-  // Returns NULL if no extension is known for this name or number.
-  virtual const FieldDescriptor* FindKnownExtensionByNumber(
-      int number) const = 0;
-
-  // ---------------------------------------------------------------------------
-
- protected:
-  // Obtain a pointer to a Repeated Field Structure and do some type checking:
-  //   on field->cpp_type(),
-  //   on field->field_option().ctype() (if ctype >= 0)
-  //   of field->message_type() (if message_type != NULL).
-  // We use 1 routine rather than 4 (const vs mutable) x (scalar vs pointer).
-  virtual void* MutableRawRepeatedField(
-      Message* message, const FieldDescriptor* field, FieldDescriptor::CppType,
-      int ctype, const Descriptor* message_type) const = 0;
-
- private:
-  // Special version for specialized implementations of string.  We can't call
-  // MutableRawRepeatedField directly here because we don't have access to
-  // FieldOptions::* which are defined in descriptor.pb.h.  Including that
-  // file here is not possible because it would cause a circular include cycle.
-  void* MutableRawRepeatedString(
-      Message* message, const FieldDescriptor* field, bool is_string) const;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Reflection);
-};
-
-// Abstract interface for a factory for message objects.
-class LIBPROTOBUF_EXPORT MessageFactory {
- public:
-  inline MessageFactory() {}
-  virtual ~MessageFactory();
-
-  // Given a Descriptor, gets or constructs the default (prototype) Message
-  // of that type.  You can then call that message's New() method to construct
-  // a mutable message of that type.
-  //
-  // Calling this method twice with the same Descriptor returns the same
-  // object.  The returned object remains property of the factory.  Also, any
-  // objects created by calling the prototype's New() method share some data
-  // with the prototype, so these must be destoyed before the MessageFactory
-  // is destroyed.
-  //
-  // The given descriptor must outlive the returned message, and hence must
-  // outlive the MessageFactory.
-  //
-  // Some implementations do not support all types.  GetPrototype() will
-  // return NULL if the descriptor passed in is not supported.
-  //
-  // This method may or may not be thread-safe depending on the implementation.
-  // Each implementation should document its own degree thread-safety.
-  virtual const Message* GetPrototype(const Descriptor* type) = 0;
-
-  // Gets a MessageFactory which supports all generated, compiled-in messages.
-  // In other words, for any compiled-in type FooMessage, the following is true:
-  //   MessageFactory::generated_factory()->GetPrototype(
-  //     FooMessage::descriptor()) == FooMessage::default_instance()
-  // This factory supports all types which are found in
-  // DescriptorPool::generated_pool().  If given a descriptor from any other
-  // pool, GetPrototype() will return NULL.  (You can also check if a
-  // descriptor is for a generated message by checking if
-  // descriptor->file()->pool() == DescriptorPool::generated_pool().)
-  //
-  // This factory is 100% thread-safe; calling GetPrototype() does not modify
-  // any shared data.
-  //
-  // This factory is a singleton.  The caller must not delete the object.
-  static MessageFactory* generated_factory();
-
-  // For internal use only:  Registers a .proto file at static initialization
-  // time, to be placed in generated_factory.  The first time GetPrototype()
-  // is called with a descriptor from this file, |register_messages| will be
-  // called, with the file name as the parameter.  It must call
-  // InternalRegisterGeneratedMessage() (below) to register each message type
-  // in the file.  This strange mechanism is necessary because descriptors are
-  // built lazily, so we can't register types by their descriptor until we
-  // know that the descriptor exists.  |filename| must be a permanent string.
-  static void InternalRegisterGeneratedFile(
-      const char* filename, void (*register_messages)(const string&));
-
-  // For internal use only:  Registers a message type.  Called only by the
-  // functions which are registered with InternalRegisterGeneratedFile(),
-  // above.
-  static void InternalRegisterGeneratedMessage(const Descriptor* descriptor,
-                                               const Message* prototype);
-
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MessageFactory);
-};
-
-#define DECLARE_GET_REPEATED_FIELD(TYPE)                         \
-template<>                                                       \
-LIBPROTOBUF_EXPORT                                               \
-const RepeatedField<TYPE>& Reflection::GetRepeatedField<TYPE>(   \
-    const Message& message, const FieldDescriptor* field) const; \
-                                                                 \
-template<>                                                       \
-LIBPROTOBUF_EXPORT                                               \
-RepeatedField<TYPE>* Reflection::MutableRepeatedField<TYPE>(     \
-    Message* message, const FieldDescriptor* field) const;
-
-DECLARE_GET_REPEATED_FIELD(int32)
-DECLARE_GET_REPEATED_FIELD(int64)
-DECLARE_GET_REPEATED_FIELD(uint32)
-DECLARE_GET_REPEATED_FIELD(uint64)
-DECLARE_GET_REPEATED_FIELD(float)
-DECLARE_GET_REPEATED_FIELD(double)
-DECLARE_GET_REPEATED_FIELD(bool)
-
-#undef DECLARE_GET_REPEATED_FIELD
-
-// =============================================================================
-// Implementation details for {Get,Mutable}RawRepeatedPtrField.  We provide
-// specializations for <string>, <StringPieceField> and <Message> and handle
-// everything else with the default template which will match any type having
-// a method with signature "static const google::protobuf::Descriptor* descriptor()".
-// Such a type presumably is a descendant of google::protobuf::Message.
-
-template<>
-inline const RepeatedPtrField<string>& Reflection::GetRepeatedPtrField<string>(
-    const Message& message, const FieldDescriptor* field) const {
-  return *static_cast<RepeatedPtrField<string>* >(
-      MutableRawRepeatedString(const_cast<Message*>(&message), field, true));
-}
-
-template<>
-inline RepeatedPtrField<string>* Reflection::MutableRepeatedPtrField<string>(
-    Message* message, const FieldDescriptor* field) const {
-  return static_cast<RepeatedPtrField<string>* >(
-      MutableRawRepeatedString(message, field, true));
-}
-
-
-// -----
-
-template<>
-inline const RepeatedPtrField<Message>& Reflection::GetRepeatedPtrField(
-    const Message& message, const FieldDescriptor* field) const {
-  return *static_cast<RepeatedPtrField<Message>* >(
-      MutableRawRepeatedField(const_cast<Message*>(&message), field,
-          FieldDescriptor::CPPTYPE_MESSAGE, -1,
-          NULL));
-}
-
-template<>
-inline RepeatedPtrField<Message>* Reflection::MutableRepeatedPtrField(
-    Message* message, const FieldDescriptor* field) const {
-  return static_cast<RepeatedPtrField<Message>* >(
-      MutableRawRepeatedField(message, field,
-          FieldDescriptor::CPPTYPE_MESSAGE, -1,
-          NULL));
-}
-
-template<typename PB>
-inline const RepeatedPtrField<PB>& Reflection::GetRepeatedPtrField(
-    const Message& message, const FieldDescriptor* field) const {
-  return *static_cast<RepeatedPtrField<PB>* >(
-      MutableRawRepeatedField(const_cast<Message*>(&message), field,
-          FieldDescriptor::CPPTYPE_MESSAGE, -1,
-          PB::default_instance().GetDescriptor()));
-}
-
-template<typename PB>
-inline RepeatedPtrField<PB>* Reflection::MutableRepeatedPtrField(
-    Message* message, const FieldDescriptor* field) const {
-  return static_cast<RepeatedPtrField<PB>* >(
-      MutableRawRepeatedField(message, field,
-          FieldDescriptor::CPPTYPE_MESSAGE, -1,
-          PB::default_instance().GetDescriptor()));
-}
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_MESSAGE_H__
diff --git a/ps-lite/deps/include/google/protobuf/message_lite.h b/ps-lite/deps/include/google/protobuf/message_lite.h
deleted file mode 100644
index 1ec3068c..00000000
--- a/ps-lite/deps/include/google/protobuf/message_lite.h
+++ /dev/null
@@ -1,246 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Authors: wink@google.com (Wink Saville),
-//          kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Defines MessageLite, the abstract interface implemented by all (lite
-// and non-lite) protocol message objects.
-
-#ifndef GOOGLE_PROTOBUF_MESSAGE_LITE_H__
-#define GOOGLE_PROTOBUF_MESSAGE_LITE_H__
-
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-
-namespace io {
-  class CodedInputStream;
-  class CodedOutputStream;
-  class ZeroCopyInputStream;
-  class ZeroCopyOutputStream;
-}
-
-// Interface to light weight protocol messages.
-//
-// This interface is implemented by all protocol message objects.  Non-lite
-// messages additionally implement the Message interface, which is a
-// subclass of MessageLite.  Use MessageLite instead when you only need
-// the subset of features which it supports -- namely, nothing that uses
-// descriptors or reflection.  You can instruct the protocol compiler
-// to generate classes which implement only MessageLite, not the full
-// Message interface, by adding the following line to the .proto file:
-//
-//   option optimize_for = LITE_RUNTIME;
-//
-// This is particularly useful on resource-constrained systems where
-// the full protocol buffers runtime library is too big.
-//
-// Note that on non-constrained systems (e.g. servers) when you need
-// to link in lots of protocol definitions, a better way to reduce
-// total code footprint is to use optimize_for = CODE_SIZE.  This
-// will make the generated code smaller while still supporting all the
-// same features (at the expense of speed).  optimize_for = LITE_RUNTIME
-// is best when you only have a small number of message types linked
-// into your binary, in which case the size of the protocol buffers
-// runtime itself is the biggest problem.
-class LIBPROTOBUF_EXPORT MessageLite {
- public:
-  inline MessageLite() {}
-  virtual ~MessageLite();
-
-  // Basic Operations ------------------------------------------------
-
-  // Get the name of this message type, e.g. "foo.bar.BazProto".
-  virtual string GetTypeName() const = 0;
-
-  // Construct a new instance of the same type.  Ownership is passed to the
-  // caller.
-  virtual MessageLite* New() const = 0;
-
-  // Clear all fields of the message and set them to their default values.
-  // Clear() avoids freeing memory, assuming that any memory allocated
-  // to hold parts of the message will be needed again to hold the next
-  // message.  If you actually want to free the memory used by a Message,
-  // you must delete it.
-  virtual void Clear() = 0;
-
-  // Quickly check if all required fields have values set.
-  virtual bool IsInitialized() const = 0;
-
-  // This is not implemented for Lite messages -- it just returns "(cannot
-  // determine missing fields for lite message)".  However, it is implemented
-  // for full messages.  See message.h.
-  virtual string InitializationErrorString() const;
-
-  // If |other| is the exact same class as this, calls MergeFrom().  Otherwise,
-  // results are undefined (probably crash).
-  virtual void CheckTypeAndMergeFrom(const MessageLite& other) = 0;
-
-  // Parsing ---------------------------------------------------------
-  // Methods for parsing in protocol buffer format.  Most of these are
-  // just simple wrappers around MergeFromCodedStream().
-
-  // Fill the message with a protocol buffer parsed from the given input
-  // stream.  Returns false on a read error or if the input is in the
-  // wrong format.
-  bool ParseFromCodedStream(io::CodedInputStream* input);
-  // Like ParseFromCodedStream(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromCodedStream(io::CodedInputStream* input);
-  // Read a protocol buffer from the given zero-copy input stream.  If
-  // successful, the entire input will be consumed.
-  bool ParseFromZeroCopyStream(io::ZeroCopyInputStream* input);
-  // Like ParseFromZeroCopyStream(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromZeroCopyStream(io::ZeroCopyInputStream* input);
-  // Read a protocol buffer from the given zero-copy input stream, expecting
-  // the message to be exactly "size" bytes long.  If successful, exactly
-  // this many bytes will have been consumed from the input.
-  bool ParseFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input, int size);
-  // Like ParseFromBoundedZeroCopyStream(), but accepts messages that are
-  // missing required fields.
-  bool ParsePartialFromBoundedZeroCopyStream(io::ZeroCopyInputStream* input,
-                                             int size);
-  // Parse a protocol buffer contained in a string.
-  bool ParseFromString(const string& data);
-  // Like ParseFromString(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromString(const string& data);
-  // Parse a protocol buffer contained in an array of bytes.
-  bool ParseFromArray(const void* data, int size);
-  // Like ParseFromArray(), but accepts messages that are missing
-  // required fields.
-  bool ParsePartialFromArray(const void* data, int size);
-
-
-  // Reads a protocol buffer from the stream and merges it into this
-  // Message.  Singular fields read from the input overwrite what is
-  // already in the Message and repeated fields are appended to those
-  // already present.
-  //
-  // It is the responsibility of the caller to call input->LastTagWas()
-  // (for groups) or input->ConsumedEntireMessage() (for non-groups) after
-  // this returns to verify that the message's end was delimited correctly.
-  //
-  // ParsefromCodedStream() is implemented as Clear() followed by
-  // MergeFromCodedStream().
-  bool MergeFromCodedStream(io::CodedInputStream* input);
-
-  // Like MergeFromCodedStream(), but succeeds even if required fields are
-  // missing in the input.
-  //
-  // MergeFromCodedStream() is just implemented as MergePartialFromCodedStream()
-  // followed by IsInitialized().
-  virtual bool MergePartialFromCodedStream(io::CodedInputStream* input) = 0;
-
-
-  // Serialization ---------------------------------------------------
-  // Methods for serializing in protocol buffer format.  Most of these
-  // are just simple wrappers around ByteSize() and SerializeWithCachedSizes().
-
-  // Write a protocol buffer of this message to the given output.  Returns
-  // false on a write error.  If the message is missing required fields,
-  // this may GOOGLE_CHECK-fail.
-  bool SerializeToCodedStream(io::CodedOutputStream* output) const;
-  // Like SerializeToCodedStream(), but allows missing required fields.
-  bool SerializePartialToCodedStream(io::CodedOutputStream* output) const;
-  // Write the message to the given zero-copy output stream.  All required
-  // fields must be set.
-  bool SerializeToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
-  // Like SerializeToZeroCopyStream(), but allows missing required fields.
-  bool SerializePartialToZeroCopyStream(io::ZeroCopyOutputStream* output) const;
-  // Serialize the message and store it in the given string.  All required
-  // fields must be set.
-  bool SerializeToString(string* output) const;
-  // Like SerializeToString(), but allows missing required fields.
-  bool SerializePartialToString(string* output) const;
-  // Serialize the message and store it in the given byte array.  All required
-  // fields must be set.
-  bool SerializeToArray(void* data, int size) const;
-  // Like SerializeToArray(), but allows missing required fields.
-  bool SerializePartialToArray(void* data, int size) const;
-
-  // Make a string encoding the message. Is equivalent to calling
-  // SerializeToString() on a string and using that.  Returns the empty
-  // string if SerializeToString() would have returned an error.
-  // Note: If you intend to generate many such strings, you may
-  // reduce heap fragmentation by instead re-using the same string
-  // object with calls to SerializeToString().
-  string SerializeAsString() const;
-  // Like SerializeAsString(), but allows missing required fields.
-  string SerializePartialAsString() const;
-
-  // Like SerializeToString(), but appends to the data to the string's existing
-  // contents.  All required fields must be set.
-  bool AppendToString(string* output) const;
-  // Like AppendToString(), but allows missing required fields.
-  bool AppendPartialToString(string* output) const;
-
-  // Computes the serialized size of the message.  This recursively calls
-  // ByteSize() on all embedded messages.  If a subclass does not override
-  // this, it MUST override SetCachedSize().
-  virtual int ByteSize() const = 0;
-
-  // Serializes the message without recomputing the size.  The message must
-  // not have changed since the last call to ByteSize(); if it has, the results
-  // are undefined.
-  virtual void SerializeWithCachedSizes(
-      io::CodedOutputStream* output) const = 0;
-
-  // Like SerializeWithCachedSizes, but writes directly to *target, returning
-  // a pointer to the byte immediately after the last byte written.  "target"
-  // must point at a byte array of at least ByteSize() bytes.
-  virtual uint8* SerializeWithCachedSizesToArray(uint8* target) const;
-
-  // Returns the result of the last call to ByteSize().  An embedded message's
-  // size is needed both to serialize it (because embedded messages are
-  // length-delimited) and to compute the outer message's size.  Caching
-  // the size avoids computing it multiple times.
-  //
-  // ByteSize() does not automatically use the cached size when available
-  // because this would require invalidating it every time the message was
-  // modified, which would be too hard and expensive.  (E.g. if a deeply-nested
-  // sub-message is changed, all of its parents' cached sizes would need to be
-  // invalidated, which is too much work for an otherwise inlined setter
-  // method.)
-  virtual int GetCachedSize() const = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MessageLite);
-};
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_MESSAGE_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/reflection_ops.h b/ps-lite/deps/include/google/protobuf/reflection_ops.h
deleted file mode 100644
index 60165c2a..00000000
--- a/ps-lite/deps/include/google/protobuf/reflection_ops.h
+++ /dev/null
@@ -1,81 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-
-#ifndef GOOGLE_PROTOBUF_REFLECTION_OPS_H__
-#define GOOGLE_PROTOBUF_REFLECTION_OPS_H__
-
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/message.h>
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// Basic operations that can be performed using reflection.
-// These can be used as a cheap way to implement the corresponding
-// methods of the Message interface, though they are likely to be
-// slower than implementations tailored for the specific message type.
-//
-// This class should stay limited to operations needed to implement
-// the Message interface.
-//
-// This class is really a namespace that contains only static methods.
-class LIBPROTOBUF_EXPORT ReflectionOps {
- public:
-  static void Copy(const Message& from, Message* to);
-  static void Merge(const Message& from, Message* to);
-  static void Clear(Message* message);
-  static bool IsInitialized(const Message& message);
-  static void DiscardUnknownFields(Message* message);
-
-  // Finds all unset required fields in the message and adds their full
-  // paths (e.g. "foo.bar[5].baz") to *names.  "prefix" will be attached to
-  // the front of each name.
-  static void FindInitializationErrors(const Message& message,
-                                       const string& prefix,
-                                       vector<string>* errors);
-
- private:
-  // All methods are static.  No need to construct.
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ReflectionOps);
-};
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_REFLECTION_OPS_H__
diff --git a/ps-lite/deps/include/google/protobuf/repeated_field.h b/ps-lite/deps/include/google/protobuf/repeated_field.h
deleted file mode 100644
index 570d4b75..00000000
--- a/ps-lite/deps/include/google/protobuf/repeated_field.h
+++ /dev/null
@@ -1,1519 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// RepeatedField and RepeatedPtrField are used by generated protocol message
-// classes to manipulate repeated fields.  These classes are very similar to
-// STL's vector, but include a number of optimizations found to be useful
-// specifically in the case of Protocol Buffers.  RepeatedPtrField is
-// particularly different from STL vector as it manages ownership of the
-// pointers that it contains.
-//
-// Typically, clients should not need to access RepeatedField objects directly,
-// but should instead use the accessor functions generated automatically by the
-// protocol compiler.
-
-#ifndef GOOGLE_PROTOBUF_REPEATED_FIELD_H__
-#define GOOGLE_PROTOBUF_REPEATED_FIELD_H__
-
-#include <algorithm>
-#include <string>
-#include <iterator>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/stubs/type_traits.h>
-#include <google/protobuf/generated_message_util.h>
-#include <google/protobuf/message_lite.h>
-
-namespace google {
-
-namespace upb {
-namespace google_opensource {
-class GMR_Handlers;
-}  // namespace google_opensource
-}  // namespace upb
-
-namespace protobuf {
-
-class Message;
-
-namespace internal {
-
-static const int kMinRepeatedFieldAllocationSize = 4;
-
-// A utility function for logging that doesn't need any template types.
-void LogIndexOutOfBounds(int index, int size);
-}  // namespace internal
-
-
-// RepeatedField is used to represent repeated fields of a primitive type (in
-// other words, everything except strings and nested Messages).  Most users will
-// not ever use a RepeatedField directly; they will use the get-by-index,
-// set-by-index, and add accessors that are generated for all repeated fields.
-template <typename Element>
-class RepeatedField {
- public:
-  RepeatedField();
-  RepeatedField(const RepeatedField& other);
-  template <typename Iter>
-  RepeatedField(Iter begin, const Iter& end);
-  ~RepeatedField();
-
-  RepeatedField& operator=(const RepeatedField& other);
-
-  int size() const;
-
-  const Element& Get(int index) const;
-  Element* Mutable(int index);
-  void Set(int index, const Element& value);
-  void Add(const Element& value);
-  Element* Add();
-  // Remove the last element in the array.
-  void RemoveLast();
-
-  // Extract elements with indices in "[start .. start+num-1]".
-  // Copy them into "elements[0 .. num-1]" if "elements" is not NULL.
-  // Caution: implementation also moves elements with indices [start+num ..].
-  // Calling this routine inside a loop can cause quadratic behavior.
-  void ExtractSubrange(int start, int num, Element* elements);
-
-  void Clear();
-  void MergeFrom(const RepeatedField& other);
-  void CopyFrom(const RepeatedField& other);
-
-  // Reserve space to expand the field to at least the given size.  If the
-  // array is grown, it will always be at least doubled in size.
-  void Reserve(int new_size);
-
-  // Resize the RepeatedField to a new, smaller size.  This is O(1).
-  void Truncate(int new_size);
-
-  void AddAlreadyReserved(const Element& value);
-  Element* AddAlreadyReserved();
-  int Capacity() const;
-
-  // Gets the underlying array.  This pointer is possibly invalidated by
-  // any add or remove operation.
-  Element* mutable_data();
-  const Element* data() const;
-
-  // Swap entire contents with "other".
-  void Swap(RepeatedField* other);
-
-  // Swap two elements.
-  void SwapElements(int index1, int index2);
-
-  // STL-like iterator support
-  typedef Element* iterator;
-  typedef const Element* const_iterator;
-  typedef Element value_type;
-  typedef value_type& reference;
-  typedef const value_type& const_reference;
-  typedef value_type* pointer;
-  typedef const value_type* const_pointer;
-  typedef int size_type;
-  typedef ptrdiff_t difference_type;
-
-  iterator begin();
-  const_iterator begin() const;
-  iterator end();
-  const_iterator end() const;
-
-  // Reverse iterator support
-  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-  typedef std::reverse_iterator<iterator> reverse_iterator;
-  reverse_iterator rbegin() {
-    return reverse_iterator(end());
-  }
-  const_reverse_iterator rbegin() const {
-    return const_reverse_iterator(end());
-  }
-  reverse_iterator rend() {
-    return reverse_iterator(begin());
-  }
-  const_reverse_iterator rend() const {
-    return const_reverse_iterator(begin());
-  }
-
-  // Returns the number of bytes used by the repeated field, excluding
-  // sizeof(*this)
-  int SpaceUsedExcludingSelf() const;
-
- private:
-  static const int kInitialSize = 0;
-
-  Element* elements_;
-  int      current_size_;
-  int      total_size_;
-
-  // Move the contents of |from| into |to|, possibly clobbering |from| in the
-  // process.  For primitive types this is just a memcpy(), but it could be
-  // specialized for non-primitive types to, say, swap each element instead.
-  void MoveArray(Element to[], Element from[], int size);
-
-  // Copy the elements of |from| into |to|.
-  void CopyArray(Element to[], const Element from[], int size);
-};
-
-namespace internal {
-template <typename It> class RepeatedPtrIterator;
-template <typename It, typename VoidPtr> class RepeatedPtrOverPtrsIterator;
-}  // namespace internal
-
-namespace internal {
-
-// This is a helper template to copy an array of elements effeciently when they
-// have a trivial copy constructor, and correctly otherwise. This really
-// shouldn't be necessary, but our compiler doesn't optimize std::copy very
-// effectively.
-template <typename Element,
-          bool HasTrivialCopy = has_trivial_copy<Element>::value>
-struct ElementCopier {
-  void operator()(Element to[], const Element from[], int array_size);
-};
-
-}  // namespace internal
-
-namespace internal {
-
-// This is the common base class for RepeatedPtrFields.  It deals only in void*
-// pointers.  Users should not use this interface directly.
-//
-// The methods of this interface correspond to the methods of RepeatedPtrField,
-// but may have a template argument called TypeHandler.  Its signature is:
-//   class TypeHandler {
-//    public:
-//     typedef MyType Type;
-//     static Type* New();
-//     static void Delete(Type*);
-//     static void Clear(Type*);
-//     static void Merge(const Type& from, Type* to);
-//
-//     // Only needs to be implemented if SpaceUsedExcludingSelf() is called.
-//     static int SpaceUsed(const Type&);
-//   };
-class LIBPROTOBUF_EXPORT RepeatedPtrFieldBase {
- protected:
-  // The reflection implementation needs to call protected methods directly,
-  // reinterpreting pointers as being to Message instead of a specific Message
-  // subclass.
-  friend class GeneratedMessageReflection;
-
-  // ExtensionSet stores repeated message extensions as
-  // RepeatedPtrField<MessageLite>, but non-lite ExtensionSets need to
-  // implement SpaceUsed(), and thus need to call SpaceUsedExcludingSelf()
-  // reinterpreting MessageLite as Message.  ExtensionSet also needs to make
-  // use of AddFromCleared(), which is not part of the public interface.
-  friend class ExtensionSet;
-
-  // To parse directly into a proto2 generated class, the upb class GMR_Handlers
-  // needs to be able to modify a RepeatedPtrFieldBase directly.
-  friend class LIBPROTOBUF_EXPORT upb::google_opensource::GMR_Handlers;
-
-  RepeatedPtrFieldBase();
-
-  // Must be called from destructor.
-  template <typename TypeHandler>
-  void Destroy();
-
-  int size() const;
-
-  template <typename TypeHandler>
-  const typename TypeHandler::Type& Get(int index) const;
-  template <typename TypeHandler>
-  typename TypeHandler::Type* Mutable(int index);
-  template <typename TypeHandler>
-  typename TypeHandler::Type* Add();
-  template <typename TypeHandler>
-  void RemoveLast();
-  template <typename TypeHandler>
-  void Clear();
-  template <typename TypeHandler>
-  void MergeFrom(const RepeatedPtrFieldBase& other);
-  template <typename TypeHandler>
-  void CopyFrom(const RepeatedPtrFieldBase& other);
-
-  void CloseGap(int start, int num) {
-    // Close up a gap of "num" elements starting at offset "start".
-    for (int i = start + num; i < allocated_size_; ++i)
-      elements_[i - num] = elements_[i];
-    current_size_ -= num;
-    allocated_size_ -= num;
-  }
-
-  void Reserve(int new_size);
-
-  int Capacity() const;
-
-  // Used for constructing iterators.
-  void* const* raw_data() const;
-  void** raw_mutable_data() const;
-
-  template <typename TypeHandler>
-  typename TypeHandler::Type** mutable_data();
-  template <typename TypeHandler>
-  const typename TypeHandler::Type* const* data() const;
-
-  void Swap(RepeatedPtrFieldBase* other);
-
-  void SwapElements(int index1, int index2);
-
-  template <typename TypeHandler>
-  int SpaceUsedExcludingSelf() const;
-
-
-  // Advanced memory management --------------------------------------
-
-  // Like Add(), but if there are no cleared objects to use, returns NULL.
-  template <typename TypeHandler>
-  typename TypeHandler::Type* AddFromCleared();
-
-  template <typename TypeHandler>
-  void AddAllocated(typename TypeHandler::Type* value);
-  template <typename TypeHandler>
-  typename TypeHandler::Type* ReleaseLast();
-
-  int ClearedCount() const;
-  template <typename TypeHandler>
-  void AddCleared(typename TypeHandler::Type* value);
-  template <typename TypeHandler>
-  typename TypeHandler::Type* ReleaseCleared();
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RepeatedPtrFieldBase);
-
-  static const int kInitialSize = 0;
-
-  void** elements_;
-  int    current_size_;
-  int    allocated_size_;
-  int    total_size_;
-
-  template <typename TypeHandler>
-  static inline typename TypeHandler::Type* cast(void* element) {
-    return reinterpret_cast<typename TypeHandler::Type*>(element);
-  }
-  template <typename TypeHandler>
-  static inline const typename TypeHandler::Type* cast(const void* element) {
-    return reinterpret_cast<const typename TypeHandler::Type*>(element);
-  }
-};
-
-template <typename GenericType>
-class GenericTypeHandler {
- public:
-  typedef GenericType Type;
-  static GenericType* New() { return new GenericType; }
-  static void Delete(GenericType* value) { delete value; }
-  static void Clear(GenericType* value) { value->Clear(); }
-  static void Merge(const GenericType& from, GenericType* to) {
-    to->MergeFrom(from);
-  }
-  static int SpaceUsed(const GenericType& value) { return value.SpaceUsed(); }
-  static const Type& default_instance() { return Type::default_instance(); }
-};
-
-template <>
-inline void GenericTypeHandler<MessageLite>::Merge(
-    const MessageLite& from, MessageLite* to) {
-  to->CheckTypeAndMergeFrom(from);
-}
-
-template <>
-inline const MessageLite& GenericTypeHandler<MessageLite>::default_instance() {
-  // Yes, the behavior of the code is undefined, but this function is only
-  // called when we're already deep into the world of undefined, because the
-  // caller called Get(index) out of bounds.
-  MessageLite* null = NULL;
-  return *null;
-}
-
-template <>
-inline const Message& GenericTypeHandler<Message>::default_instance() {
-  // Yes, the behavior of the code is undefined, but this function is only
-  // called when we're already deep into the world of undefined, because the
-  // caller called Get(index) out of bounds.
-  Message* null = NULL;
-  return *null;
-}
-
-
-// HACK:  If a class is declared as DLL-exported in MSVC, it insists on
-//   generating copies of all its methods -- even inline ones -- to include
-//   in the DLL.  But SpaceUsed() calls StringSpaceUsedExcludingSelf() which
-//   isn't in the lite library, therefore the lite library cannot link if
-//   StringTypeHandler is exported.  So, we factor out StringTypeHandlerBase,
-//   export that, then make StringTypeHandler be a subclass which is NOT
-//   exported.
-// TODO(kenton):  There has to be a better way.
-class LIBPROTOBUF_EXPORT StringTypeHandlerBase {
- public:
-  typedef string Type;
-  static string* New();
-  static void Delete(string* value);
-  static void Clear(string* value) { value->clear(); }
-  static void Merge(const string& from, string* to) { *to = from; }
-  static const Type& default_instance() {
-    return ::google::protobuf::internal::kEmptyString;
-  }
-};
-
-class StringTypeHandler : public StringTypeHandlerBase {
- public:
-  static int SpaceUsed(const string& value)  {
-    return sizeof(value) + StringSpaceUsedExcludingSelf(value);
-  }
-};
-
-
-}  // namespace internal
-
-// RepeatedPtrField is like RepeatedField, but used for repeated strings or
-// Messages.
-template <typename Element>
-class RepeatedPtrField : public internal::RepeatedPtrFieldBase {
- public:
-  RepeatedPtrField();
-  RepeatedPtrField(const RepeatedPtrField& other);
-  template <typename Iter>
-  RepeatedPtrField(Iter begin, const Iter& end);
-  ~RepeatedPtrField();
-
-  RepeatedPtrField& operator=(const RepeatedPtrField& other);
-
-  int size() const;
-
-  const Element& Get(int index) const;
-  Element* Mutable(int index);
-  Element* Add();
-
-  // Remove the last element in the array.
-  // Ownership of the element is retained by the array.
-  void RemoveLast();
-
-  // Delete elements with indices in the range [start .. start+num-1].
-  // Caution: implementation moves all elements with indices [start+num .. ].
-  // Calling this routine inside a loop can cause quadratic behavior.
-  void DeleteSubrange(int start, int num);
-
-  void Clear();
-  void MergeFrom(const RepeatedPtrField& other);
-  void CopyFrom(const RepeatedPtrField& other);
-
-  // Reserve space to expand the field to at least the given size.  This only
-  // resizes the pointer array; it doesn't allocate any objects.  If the
-  // array is grown, it will always be at least doubled in size.
-  void Reserve(int new_size);
-
-  int Capacity() const;
-
-  // Gets the underlying array.  This pointer is possibly invalidated by
-  // any add or remove operation.
-  Element** mutable_data();
-  const Element* const* data() const;
-
-  // Swap entire contents with "other".
-  void Swap(RepeatedPtrField* other);
-
-  // Swap two elements.
-  void SwapElements(int index1, int index2);
-
-  // STL-like iterator support
-  typedef internal::RepeatedPtrIterator<Element> iterator;
-  typedef internal::RepeatedPtrIterator<const Element> const_iterator;
-  typedef Element value_type;
-  typedef value_type& reference;
-  typedef const value_type& const_reference;
-  typedef value_type* pointer;
-  typedef const value_type* const_pointer;
-  typedef int size_type;
-  typedef ptrdiff_t difference_type;
-
-  iterator begin();
-  const_iterator begin() const;
-  iterator end();
-  const_iterator end() const;
-
-  // Reverse iterator support
-  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;
-  typedef std::reverse_iterator<iterator> reverse_iterator;
-  reverse_iterator rbegin() {
-    return reverse_iterator(end());
-  }
-  const_reverse_iterator rbegin() const {
-    return const_reverse_iterator(end());
-  }
-  reverse_iterator rend() {
-    return reverse_iterator(begin());
-  }
-  const_reverse_iterator rend() const {
-    return const_reverse_iterator(begin());
-  }
-
-  // Custom STL-like iterator that iterates over and returns the underlying
-  // pointers to Element rather than Element itself.
-  typedef internal::RepeatedPtrOverPtrsIterator<Element, void*>
-  pointer_iterator;
-  typedef internal::RepeatedPtrOverPtrsIterator<const Element, const void*>
-  const_pointer_iterator;
-  pointer_iterator pointer_begin();
-  const_pointer_iterator pointer_begin() const;
-  pointer_iterator pointer_end();
-  const_pointer_iterator pointer_end() const;
-
-  // Returns (an estimate of) the number of bytes used by the repeated field,
-  // excluding sizeof(*this).
-  int SpaceUsedExcludingSelf() const;
-
-  // Advanced memory management --------------------------------------
-  // When hardcore memory management becomes necessary -- as it sometimes
-  // does here at Google -- the following methods may be useful.
-
-  // Add an already-allocated object, passing ownership to the
-  // RepeatedPtrField.
-  void AddAllocated(Element* value);
-  // Remove the last element and return it, passing ownership to the caller.
-  // Requires:  size() > 0
-  Element* ReleaseLast();
-
-  // Extract elements with indices in the range "[start .. start+num-1]".
-  // The caller assumes ownership of the extracted elements and is responsible
-  // for deleting them when they are no longer needed.
-  // If "elements" is non-NULL, then pointers to the extracted elements
-  // are stored in "elements[0 .. num-1]" for the convenience of the caller.
-  // If "elements" is NULL, then the caller must use some other mechanism
-  // to perform any further operations (like deletion) on these elements.
-  // Caution: implementation also moves elements with indices [start+num ..].
-  // Calling this routine inside a loop can cause quadratic behavior.
-  void ExtractSubrange(int start, int num, Element** elements);
-
-  // When elements are removed by calls to RemoveLast() or Clear(), they
-  // are not actually freed.  Instead, they are cleared and kept so that
-  // they can be reused later.  This can save lots of CPU time when
-  // repeatedly reusing a protocol message for similar purposes.
-  //
-  // Hardcore programs may choose to manipulate these cleared objects
-  // to better optimize memory management using the following routines.
-
-  // Get the number of cleared objects that are currently being kept
-  // around for reuse.
-  int ClearedCount() const;
-  // Add an element to the pool of cleared objects, passing ownership to
-  // the RepeatedPtrField.  The element must be cleared prior to calling
-  // this method.
-  void AddCleared(Element* value);
-  // Remove a single element from the cleared pool and return it, passing
-  // ownership to the caller.  The element is guaranteed to be cleared.
-  // Requires:  ClearedCount() > 0
-  Element* ReleaseCleared();
-
- protected:
-  // Note:  RepeatedPtrField SHOULD NOT be subclassed by users.  We only
-  //   subclass it in one place as a hack for compatibility with proto1.  The
-  //   subclass needs to know about TypeHandler in order to call protected
-  //   methods on RepeatedPtrFieldBase.
-  class TypeHandler;
-
-};
-
-// implementation ====================================================
-
-template <typename Element>
-inline RepeatedField<Element>::RepeatedField()
-  : elements_(NULL),
-    current_size_(0),
-    total_size_(kInitialSize) {
-}
-
-template <typename Element>
-inline RepeatedField<Element>::RepeatedField(const RepeatedField& other)
-  : elements_(NULL),
-    current_size_(0),
-    total_size_(kInitialSize) {
-  CopyFrom(other);
-}
-
-template <typename Element>
-template <typename Iter>
-inline RepeatedField<Element>::RepeatedField(Iter begin, const Iter& end)
-  : elements_(NULL),
-    current_size_(0),
-    total_size_(kInitialSize) {
-  for (; begin != end; ++begin) {
-    Add(*begin);
-  }
-}
-
-template <typename Element>
-RepeatedField<Element>::~RepeatedField() {
-  delete [] elements_;
-}
-
-template <typename Element>
-inline RepeatedField<Element>&
-RepeatedField<Element>::operator=(const RepeatedField& other) {
-  if (this != &other)
-    CopyFrom(other);
-  return *this;
-}
-
-template <typename Element>
-inline int RepeatedField<Element>::size() const {
-  return current_size_;
-}
-
-template <typename Element>
-inline int RepeatedField<Element>::Capacity() const {
-  return total_size_;
-}
-
-template<typename Element>
-inline void RepeatedField<Element>::AddAlreadyReserved(const Element& value) {
-  GOOGLE_DCHECK_LT(size(), Capacity());
-  elements_[current_size_++] = value;
-}
-
-template<typename Element>
-inline Element* RepeatedField<Element>::AddAlreadyReserved() {
-  GOOGLE_DCHECK_LT(size(), Capacity());
-  return &elements_[current_size_++];
-}
-
-template <typename Element>
-inline const Element& RepeatedField<Element>::Get(int index) const {
-  GOOGLE_DCHECK_LT(index, size());
-  return elements_[index];
-}
-
-template <typename Element>
-inline Element* RepeatedField<Element>::Mutable(int index) {
-  GOOGLE_DCHECK_LT(index, size());
-  return elements_ + index;
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::Set(int index, const Element& value) {
-  GOOGLE_DCHECK_LT(index, size());
-  elements_[index] = value;
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::Add(const Element& value) {
-  if (current_size_ == total_size_) Reserve(total_size_ + 1);
-  elements_[current_size_++] = value;
-}
-
-template <typename Element>
-inline Element* RepeatedField<Element>::Add() {
-  if (current_size_ == total_size_) Reserve(total_size_ + 1);
-  return &elements_[current_size_++];
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::RemoveLast() {
-  GOOGLE_DCHECK_GT(current_size_, 0);
-  --current_size_;
-}
-
-template <typename Element>
-void RepeatedField<Element>::ExtractSubrange(
-    int start, int num, Element* elements) {
-  GOOGLE_DCHECK_GE(start, 0);
-  GOOGLE_DCHECK_GE(num, 0);
-  GOOGLE_DCHECK_LE(start + num, this->size());
-
-  // Save the values of the removed elements if requested.
-  if (elements != NULL) {
-    for (int i = 0; i < num; ++i)
-      elements[i] = this->Get(i + start);
-  }
-
-  // Slide remaining elements down to fill the gap.
-  if (num > 0) {
-    for (int i = start + num; i < this->size(); ++i)
-      this->Set(i - num, this->Get(i));
-    this->Truncate(this->size() - num);
-  }
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::Clear() {
-  current_size_ = 0;
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::MergeFrom(const RepeatedField& other) {
-  if (other.current_size_ != 0) {
-    Reserve(current_size_ + other.current_size_);
-    CopyArray(elements_ + current_size_, other.elements_, other.current_size_);
-    current_size_ += other.current_size_;
-  }
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::CopyFrom(const RepeatedField& other) {
-  Clear();
-  MergeFrom(other);
-}
-
-template <typename Element>
-inline Element* RepeatedField<Element>::mutable_data() {
-  return elements_;
-}
-
-template <typename Element>
-inline const Element* RepeatedField<Element>::data() const {
-  return elements_;
-}
-
-
-template <typename Element>
-void RepeatedField<Element>::Swap(RepeatedField* other) {
-  if (this == other) return;
-  Element* swap_elements     = elements_;
-  int      swap_current_size = current_size_;
-  int      swap_total_size   = total_size_;
-
-  elements_     = other->elements_;
-  current_size_ = other->current_size_;
-  total_size_   = other->total_size_;
-
-  other->elements_     = swap_elements;
-  other->current_size_ = swap_current_size;
-  other->total_size_   = swap_total_size;
-}
-
-template <typename Element>
-void RepeatedField<Element>::SwapElements(int index1, int index2) {
-  std::swap(elements_[index1], elements_[index2]);
-}
-
-template <typename Element>
-inline typename RepeatedField<Element>::iterator
-RepeatedField<Element>::begin() {
-  return elements_;
-}
-template <typename Element>
-inline typename RepeatedField<Element>::const_iterator
-RepeatedField<Element>::begin() const {
-  return elements_;
-}
-template <typename Element>
-inline typename RepeatedField<Element>::iterator
-RepeatedField<Element>::end() {
-  return elements_ + current_size_;
-}
-template <typename Element>
-inline typename RepeatedField<Element>::const_iterator
-RepeatedField<Element>::end() const {
-  return elements_ + current_size_;
-}
-
-template <typename Element>
-inline int RepeatedField<Element>::SpaceUsedExcludingSelf() const {
-  return (elements_ != NULL) ? total_size_ * sizeof(elements_[0]) : 0;
-}
-
-// Avoid inlining of Reserve(): new, copy, and delete[] lead to a significant
-// amount of code bloat.
-template <typename Element>
-void RepeatedField<Element>::Reserve(int new_size) {
-  if (total_size_ >= new_size) return;
-
-  Element* old_elements = elements_;
-  total_size_ = max(google::protobuf::internal::kMinRepeatedFieldAllocationSize,
-                    max(total_size_ * 2, new_size));
-  elements_ = new Element[total_size_];
-  if (old_elements != NULL) {
-    MoveArray(elements_, old_elements, current_size_);
-    delete [] old_elements;
-  }
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::Truncate(int new_size) {
-  GOOGLE_DCHECK_LE(new_size, current_size_);
-  current_size_ = new_size;
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::MoveArray(
-    Element to[], Element from[], int array_size) {
-  CopyArray(to, from, array_size);
-}
-
-template <typename Element>
-inline void RepeatedField<Element>::CopyArray(
-    Element to[], const Element from[], int array_size) {
-  internal::ElementCopier<Element>()(to, from, array_size);
-}
-
-namespace internal {
-
-template <typename Element, bool HasTrivialCopy>
-void ElementCopier<Element, HasTrivialCopy>::operator()(
-    Element to[], const Element from[], int array_size) {
-  std::copy(from, from + array_size, to);
-}
-
-template <typename Element>
-struct ElementCopier<Element, true> {
-  void operator()(Element to[], const Element from[], int array_size) {
-    memcpy(to, from, array_size * sizeof(Element));
-  }
-};
-
-}  // namespace internal
-
-
-// -------------------------------------------------------------------
-
-namespace internal {
-
-inline RepeatedPtrFieldBase::RepeatedPtrFieldBase()
-  : elements_(NULL),
-    current_size_(0),
-    allocated_size_(0),
-    total_size_(kInitialSize) {
-}
-
-template <typename TypeHandler>
-void RepeatedPtrFieldBase::Destroy() {
-  for (int i = 0; i < allocated_size_; i++) {
-    TypeHandler::Delete(cast<TypeHandler>(elements_[i]));
-  }
-  delete [] elements_;
-}
-
-inline int RepeatedPtrFieldBase::size() const {
-  return current_size_;
-}
-
-template <typename TypeHandler>
-inline const typename TypeHandler::Type&
-RepeatedPtrFieldBase::Get(int index) const {
-  GOOGLE_DCHECK_LT(index, size());
-  return *cast<TypeHandler>(elements_[index]);
-}
-
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type*
-RepeatedPtrFieldBase::Mutable(int index) {
-  GOOGLE_DCHECK_LT(index, size());
-  return cast<TypeHandler>(elements_[index]);
-}
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type* RepeatedPtrFieldBase::Add() {
-  if (current_size_ < allocated_size_) {
-    return cast<TypeHandler>(elements_[current_size_++]);
-  }
-  if (allocated_size_ == total_size_) Reserve(total_size_ + 1);
-  ++allocated_size_;
-  typename TypeHandler::Type* result = TypeHandler::New();
-  elements_[current_size_++] = result;
-  return result;
-}
-
-template <typename TypeHandler>
-inline void RepeatedPtrFieldBase::RemoveLast() {
-  GOOGLE_DCHECK_GT(current_size_, 0);
-  TypeHandler::Clear(cast<TypeHandler>(elements_[--current_size_]));
-}
-
-template <typename TypeHandler>
-void RepeatedPtrFieldBase::Clear() {
-  for (int i = 0; i < current_size_; i++) {
-    TypeHandler::Clear(cast<TypeHandler>(elements_[i]));
-  }
-  current_size_ = 0;
-}
-
-template <typename TypeHandler>
-inline void RepeatedPtrFieldBase::MergeFrom(const RepeatedPtrFieldBase& other) {
-  Reserve(current_size_ + other.current_size_);
-  for (int i = 0; i < other.current_size_; i++) {
-    TypeHandler::Merge(other.template Get<TypeHandler>(i), Add<TypeHandler>());
-  }
-}
-
-template <typename TypeHandler>
-inline void RepeatedPtrFieldBase::CopyFrom(const RepeatedPtrFieldBase& other) {
-  RepeatedPtrFieldBase::Clear<TypeHandler>();
-  RepeatedPtrFieldBase::MergeFrom<TypeHandler>(other);
-}
-
-inline int RepeatedPtrFieldBase::Capacity() const {
-  return total_size_;
-}
-
-inline void* const* RepeatedPtrFieldBase::raw_data() const {
-  return elements_;
-}
-
-inline void** RepeatedPtrFieldBase::raw_mutable_data() const {
-  return elements_;
-}
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type** RepeatedPtrFieldBase::mutable_data() {
-  // TODO(kenton):  Breaks C++ aliasing rules.  We should probably remove this
-  //   method entirely.
-  return reinterpret_cast<typename TypeHandler::Type**>(elements_);
-}
-
-template <typename TypeHandler>
-inline const typename TypeHandler::Type* const*
-RepeatedPtrFieldBase::data() const {
-  // TODO(kenton):  Breaks C++ aliasing rules.  We should probably remove this
-  //   method entirely.
-  return reinterpret_cast<const typename TypeHandler::Type* const*>(elements_);
-}
-
-inline void RepeatedPtrFieldBase::SwapElements(int index1, int index2) {
-  std::swap(elements_[index1], elements_[index2]);
-}
-
-template <typename TypeHandler>
-inline int RepeatedPtrFieldBase::SpaceUsedExcludingSelf() const {
-  int allocated_bytes =
-      (elements_ != NULL) ? total_size_ * sizeof(elements_[0]) : 0;
-  for (int i = 0; i < allocated_size_; ++i) {
-    allocated_bytes += TypeHandler::SpaceUsed(*cast<TypeHandler>(elements_[i]));
-  }
-  return allocated_bytes;
-}
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type* RepeatedPtrFieldBase::AddFromCleared() {
-  if (current_size_ < allocated_size_) {
-    return cast<TypeHandler>(elements_[current_size_++]);
-  } else {
-    return NULL;
-  }
-}
-
-template <typename TypeHandler>
-void RepeatedPtrFieldBase::AddAllocated(
-    typename TypeHandler::Type* value) {
-  // Make room for the new pointer.
-  if (current_size_ == total_size_) {
-    // The array is completely full with no cleared objects, so grow it.
-    Reserve(total_size_ + 1);
-    ++allocated_size_;
-  } else if (allocated_size_ == total_size_) {
-    // There is no more space in the pointer array because it contains some
-    // cleared objects awaiting reuse.  We don't want to grow the array in this
-    // case because otherwise a loop calling AddAllocated() followed by Clear()
-    // would leak memory.
-    TypeHandler::Delete(cast<TypeHandler>(elements_[current_size_]));
-  } else if (current_size_ < allocated_size_) {
-    // We have some cleared objects.  We don't care about their order, so we
-    // can just move the first one to the end to make space.
-    elements_[allocated_size_] = elements_[current_size_];
-    ++allocated_size_;
-  } else {
-    // There are no cleared objects.
-    ++allocated_size_;
-  }
-
-  elements_[current_size_++] = value;
-}
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseLast() {
-  GOOGLE_DCHECK_GT(current_size_, 0);
-  typename TypeHandler::Type* result =
-      cast<TypeHandler>(elements_[--current_size_]);
-  --allocated_size_;
-  if (current_size_ < allocated_size_) {
-    // There are cleared elements on the end; replace the removed element
-    // with the last allocated element.
-    elements_[current_size_] = elements_[allocated_size_];
-  }
-  return result;
-}
-
-inline int RepeatedPtrFieldBase::ClearedCount() const {
-  return allocated_size_ - current_size_;
-}
-
-template <typename TypeHandler>
-inline void RepeatedPtrFieldBase::AddCleared(
-    typename TypeHandler::Type* value) {
-  if (allocated_size_ == total_size_) Reserve(total_size_ + 1);
-  elements_[allocated_size_++] = value;
-}
-
-template <typename TypeHandler>
-inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseCleared() {
-  GOOGLE_DCHECK_GT(allocated_size_, current_size_);
-  return cast<TypeHandler>(elements_[--allocated_size_]);
-}
-
-}  // namespace internal
-
-// -------------------------------------------------------------------
-
-template <typename Element>
-class RepeatedPtrField<Element>::TypeHandler
-    : public internal::GenericTypeHandler<Element> {
-};
-
-template <>
-class RepeatedPtrField<string>::TypeHandler
-    : public internal::StringTypeHandler {
-};
-
-
-template <typename Element>
-inline RepeatedPtrField<Element>::RepeatedPtrField() {}
-
-template <typename Element>
-inline RepeatedPtrField<Element>::RepeatedPtrField(
-    const RepeatedPtrField& other) {
-  CopyFrom(other);
-}
-
-template <typename Element>
-template <typename Iter>
-inline RepeatedPtrField<Element>::RepeatedPtrField(
-    Iter begin, const Iter& end) {
-  for (; begin != end; ++begin) {
-    *Add() = *begin;
-  }
-}
-
-template <typename Element>
-RepeatedPtrField<Element>::~RepeatedPtrField() {
-  Destroy<TypeHandler>();
-}
-
-template <typename Element>
-inline RepeatedPtrField<Element>& RepeatedPtrField<Element>::operator=(
-    const RepeatedPtrField& other) {
-  if (this != &other)
-    CopyFrom(other);
-  return *this;
-}
-
-template <typename Element>
-inline int RepeatedPtrField<Element>::size() const {
-  return RepeatedPtrFieldBase::size();
-}
-
-template <typename Element>
-inline const Element& RepeatedPtrField<Element>::Get(int index) const {
-  return RepeatedPtrFieldBase::Get<TypeHandler>(index);
-}
-
-
-template <typename Element>
-inline Element* RepeatedPtrField<Element>::Mutable(int index) {
-  return RepeatedPtrFieldBase::Mutable<TypeHandler>(index);
-}
-
-template <typename Element>
-inline Element* RepeatedPtrField<Element>::Add() {
-  return RepeatedPtrFieldBase::Add<TypeHandler>();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::RemoveLast() {
-  RepeatedPtrFieldBase::RemoveLast<TypeHandler>();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::DeleteSubrange(int start, int num) {
-  GOOGLE_DCHECK_GE(start, 0);
-  GOOGLE_DCHECK_GE(num, 0);
-  GOOGLE_DCHECK_LE(start + num, size());
-  for (int i = 0; i < num; ++i)
-    delete RepeatedPtrFieldBase::Mutable<TypeHandler>(start + i);
-  ExtractSubrange(start, num, NULL);
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::ExtractSubrange(
-    int start, int num, Element** elements) {
-  GOOGLE_DCHECK_GE(start, 0);
-  GOOGLE_DCHECK_GE(num, 0);
-  GOOGLE_DCHECK_LE(start + num, size());
-
-  if (num > 0) {
-    // Save the values of the removed elements if requested.
-    if (elements != NULL) {
-      for (int i = 0; i < num; ++i)
-        elements[i] = RepeatedPtrFieldBase::Mutable<TypeHandler>(i + start);
-    }
-    CloseGap(start, num);
-  }
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::Clear() {
-  RepeatedPtrFieldBase::Clear<TypeHandler>();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::MergeFrom(
-    const RepeatedPtrField& other) {
-  RepeatedPtrFieldBase::MergeFrom<TypeHandler>(other);
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::CopyFrom(
-    const RepeatedPtrField& other) {
-  RepeatedPtrFieldBase::CopyFrom<TypeHandler>(other);
-}
-
-template <typename Element>
-inline Element** RepeatedPtrField<Element>::mutable_data() {
-  return RepeatedPtrFieldBase::mutable_data<TypeHandler>();
-}
-
-template <typename Element>
-inline const Element* const* RepeatedPtrField<Element>::data() const {
-  return RepeatedPtrFieldBase::data<TypeHandler>();
-}
-
-template <typename Element>
-void RepeatedPtrField<Element>::Swap(RepeatedPtrField* other) {
-  RepeatedPtrFieldBase::Swap(other);
-}
-
-template <typename Element>
-void RepeatedPtrField<Element>::SwapElements(int index1, int index2) {
-  RepeatedPtrFieldBase::SwapElements(index1, index2);
-}
-
-template <typename Element>
-inline int RepeatedPtrField<Element>::SpaceUsedExcludingSelf() const {
-  return RepeatedPtrFieldBase::SpaceUsedExcludingSelf<TypeHandler>();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::AddAllocated(Element* value) {
-  RepeatedPtrFieldBase::AddAllocated<TypeHandler>(value);
-}
-
-template <typename Element>
-inline Element* RepeatedPtrField<Element>::ReleaseLast() {
-  return RepeatedPtrFieldBase::ReleaseLast<TypeHandler>();
-}
-
-
-template <typename Element>
-inline int RepeatedPtrField<Element>::ClearedCount() const {
-  return RepeatedPtrFieldBase::ClearedCount();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::AddCleared(Element* value) {
-  return RepeatedPtrFieldBase::AddCleared<TypeHandler>(value);
-}
-
-template <typename Element>
-inline Element* RepeatedPtrField<Element>::ReleaseCleared() {
-  return RepeatedPtrFieldBase::ReleaseCleared<TypeHandler>();
-}
-
-template <typename Element>
-inline void RepeatedPtrField<Element>::Reserve(int new_size) {
-  return RepeatedPtrFieldBase::Reserve(new_size);
-}
-
-template <typename Element>
-inline int RepeatedPtrField<Element>::Capacity() const {
-  return RepeatedPtrFieldBase::Capacity();
-}
-
-// -------------------------------------------------------------------
-
-namespace internal {
-
-// STL-like iterator implementation for RepeatedPtrField.  You should not
-// refer to this class directly; use RepeatedPtrField<T>::iterator instead.
-//
-// The iterator for RepeatedPtrField<T>, RepeatedPtrIterator<T>, is
-// very similar to iterator_ptr<T**> in util/gtl/iterator_adaptors.h,
-// but adds random-access operators and is modified to wrap a void** base
-// iterator (since RepeatedPtrField stores its array as a void* array and
-// casting void** to T** would violate C++ aliasing rules).
-//
-// This code based on net/proto/proto-array-internal.h by Jeffrey Yasskin
-// (jyasskin@google.com).
-template<typename Element>
-class RepeatedPtrIterator
-    : public std::iterator<
-          std::random_access_iterator_tag, Element> {
- public:
-  typedef RepeatedPtrIterator<Element> iterator;
-  typedef std::iterator<
-          std::random_access_iterator_tag, Element> superclass;
-
-  // Let the compiler know that these are type names, so we don't have to
-  // write "typename" in front of them everywhere.
-  typedef typename superclass::reference reference;
-  typedef typename superclass::pointer pointer;
-  typedef typename superclass::difference_type difference_type;
-
-  RepeatedPtrIterator() : it_(NULL) {}
-  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}
-
-  // Allow "upcasting" from RepeatedPtrIterator<T**> to
-  // RepeatedPtrIterator<const T*const*>.
-  template<typename OtherElement>
-  RepeatedPtrIterator(const RepeatedPtrIterator<OtherElement>& other)
-      : it_(other.it_) {
-    // Force a compiler error if the other type is not convertible to ours.
-    if (false) {
-      implicit_cast<Element*, OtherElement*>(0);
-    }
-  }
-
-  // dereferenceable
-  reference operator*() const { return *reinterpret_cast<Element*>(*it_); }
-  pointer   operator->() const { return &(operator*()); }
-
-  // {inc,dec}rementable
-  iterator& operator++() { ++it_; return *this; }
-  iterator  operator++(int) { return iterator(it_++); }
-  iterator& operator--() { --it_; return *this; }
-  iterator  operator--(int) { return iterator(it_--); }
-
-  // equality_comparable
-  bool operator==(const iterator& x) const { return it_ == x.it_; }
-  bool operator!=(const iterator& x) const { return it_ != x.it_; }
-
-  // less_than_comparable
-  bool operator<(const iterator& x) const { return it_ < x.it_; }
-  bool operator<=(const iterator& x) const { return it_ <= x.it_; }
-  bool operator>(const iterator& x) const { return it_ > x.it_; }
-  bool operator>=(const iterator& x) const { return it_ >= x.it_; }
-
-  // addable, subtractable
-  iterator& operator+=(difference_type d) {
-    it_ += d;
-    return *this;
-  }
-  friend iterator operator+(iterator it, difference_type d) {
-    it += d;
-    return it;
-  }
-  friend iterator operator+(difference_type d, iterator it) {
-    it += d;
-    return it;
-  }
-  iterator& operator-=(difference_type d) {
-    it_ -= d;
-    return *this;
-  }
-  friend iterator operator-(iterator it, difference_type d) {
-    it -= d;
-    return it;
-  }
-
-  // indexable
-  reference operator[](difference_type d) const { return *(*this + d); }
-
-  // random access iterator
-  difference_type operator-(const iterator& x) const { return it_ - x.it_; }
-
- private:
-  template<typename OtherElement>
-  friend class RepeatedPtrIterator;
-
-  // The internal iterator.
-  void* const* it_;
-};
-
-// Provide an iterator that operates on pointers to the underlying objects
-// rather than the objects themselves as RepeatedPtrIterator does.
-// Consider using this when working with stl algorithms that change
-// the array.
-// The VoidPtr template parameter holds the type-agnostic pointer value
-// referenced by the iterator.  It should either be "void *" for a mutable
-// iterator, or "const void *" for a constant iterator.
-template<typename Element, typename VoidPtr>
-class RepeatedPtrOverPtrsIterator
-    : public std::iterator<std::random_access_iterator_tag, Element*> {
- public:
-  typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator;
-  typedef std::iterator<
-          std::random_access_iterator_tag, Element*> superclass;
-
-  // Let the compiler know that these are type names, so we don't have to
-  // write "typename" in front of them everywhere.
-  typedef typename superclass::reference reference;
-  typedef typename superclass::pointer pointer;
-  typedef typename superclass::difference_type difference_type;
-
-  RepeatedPtrOverPtrsIterator() : it_(NULL) {}
-  explicit RepeatedPtrOverPtrsIterator(VoidPtr* it) : it_(it) {}
-
-  // dereferenceable
-  reference operator*() const { return *reinterpret_cast<Element**>(it_); }
-  pointer   operator->() const { return &(operator*()); }
-
-  // {inc,dec}rementable
-  iterator& operator++() { ++it_; return *this; }
-  iterator  operator++(int) { return iterator(it_++); }
-  iterator& operator--() { --it_; return *this; }
-  iterator  operator--(int) { return iterator(it_--); }
-
-  // equality_comparable
-  bool operator==(const iterator& x) const { return it_ == x.it_; }
-  bool operator!=(const iterator& x) const { return it_ != x.it_; }
-
-  // less_than_comparable
-  bool operator<(const iterator& x) const { return it_ < x.it_; }
-  bool operator<=(const iterator& x) const { return it_ <= x.it_; }
-  bool operator>(const iterator& x) const { return it_ > x.it_; }
-  bool operator>=(const iterator& x) const { return it_ >= x.it_; }
-
-  // addable, subtractable
-  iterator& operator+=(difference_type d) {
-    it_ += d;
-    return *this;
-  }
-  friend iterator operator+(iterator it, difference_type d) {
-    it += d;
-    return it;
-  }
-  friend iterator operator+(difference_type d, iterator it) {
-    it += d;
-    return it;
-  }
-  iterator& operator-=(difference_type d) {
-    it_ -= d;
-    return *this;
-  }
-  friend iterator operator-(iterator it, difference_type d) {
-    it -= d;
-    return it;
-  }
-
-  // indexable
-  reference operator[](difference_type d) const { return *(*this + d); }
-
-  // random access iterator
-  difference_type operator-(const iterator& x) const { return it_ - x.it_; }
-
- private:
-  template<typename OtherElement>
-  friend class RepeatedPtrIterator;
-
-  // The internal iterator.
-  VoidPtr* it_;
-};
-
-}  // namespace internal
-
-template <typename Element>
-inline typename RepeatedPtrField<Element>::iterator
-RepeatedPtrField<Element>::begin() {
-  return iterator(raw_data());
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::const_iterator
-RepeatedPtrField<Element>::begin() const {
-  return iterator(raw_data());
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::iterator
-RepeatedPtrField<Element>::end() {
-  return iterator(raw_data() + size());
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::const_iterator
-RepeatedPtrField<Element>::end() const {
-  return iterator(raw_data() + size());
-}
-
-template <typename Element>
-inline typename RepeatedPtrField<Element>::pointer_iterator
-RepeatedPtrField<Element>::pointer_begin() {
-  return pointer_iterator(raw_mutable_data());
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::const_pointer_iterator
-RepeatedPtrField<Element>::pointer_begin() const {
-  return const_pointer_iterator(const_cast<const void**>(raw_mutable_data()));
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::pointer_iterator
-RepeatedPtrField<Element>::pointer_end() {
-  return pointer_iterator(raw_mutable_data() + size());
-}
-template <typename Element>
-inline typename RepeatedPtrField<Element>::const_pointer_iterator
-RepeatedPtrField<Element>::pointer_end() const {
-  return const_pointer_iterator(
-      const_cast<const void**>(raw_mutable_data() + size()));
-}
-
-
-// Iterators and helper functions that follow the spirit of the STL
-// std::back_insert_iterator and std::back_inserter but are tailor-made
-// for RepeatedField and RepatedPtrField. Typical usage would be:
-//
-//   std::copy(some_sequence.begin(), some_sequence.end(),
-//             google::protobuf::RepeatedFieldBackInserter(proto.mutable_sequence()));
-//
-// Ported by johannes from util/gtl/proto-array-iterators.h
-
-namespace internal {
-// A back inserter for RepeatedField objects.
-template<typename T> class RepeatedFieldBackInsertIterator
-    : public std::iterator<std::output_iterator_tag, T> {
- public:
-  explicit RepeatedFieldBackInsertIterator(
-      RepeatedField<T>* const mutable_field)
-      : field_(mutable_field) {
-  }
-  RepeatedFieldBackInsertIterator<T>& operator=(const T& value) {
-    field_->Add(value);
-    return *this;
-  }
-  RepeatedFieldBackInsertIterator<T>& operator*() {
-    return *this;
-  }
-  RepeatedFieldBackInsertIterator<T>& operator++() {
-    return *this;
-  }
-  RepeatedFieldBackInsertIterator<T>& operator++(int /* unused */) {
-    return *this;
-  }
-
- private:
-  RepeatedField<T>* field_;
-};
-
-// A back inserter for RepeatedPtrField objects.
-template<typename T> class RepeatedPtrFieldBackInsertIterator
-    : public std::iterator<std::output_iterator_tag, T> {
- public:
-  RepeatedPtrFieldBackInsertIterator(
-      RepeatedPtrField<T>* const mutable_field)
-      : field_(mutable_field) {
-  }
-  RepeatedPtrFieldBackInsertIterator<T>& operator=(const T& value) {
-    *field_->Add() = value;
-    return *this;
-  }
-  RepeatedPtrFieldBackInsertIterator<T>& operator=(
-      const T* const ptr_to_value) {
-    *field_->Add() = *ptr_to_value;
-    return *this;
-  }
-  RepeatedPtrFieldBackInsertIterator<T>& operator*() {
-    return *this;
-  }
-  RepeatedPtrFieldBackInsertIterator<T>& operator++() {
-    return *this;
-  }
-  RepeatedPtrFieldBackInsertIterator<T>& operator++(int /* unused */) {
-    return *this;
-  }
-
- private:
-  RepeatedPtrField<T>* field_;
-};
-
-// A back inserter for RepeatedPtrFields that inserts by transfering ownership
-// of a pointer.
-template<typename T> class AllocatedRepeatedPtrFieldBackInsertIterator
-    : public std::iterator<std::output_iterator_tag, T> {
- public:
-  explicit AllocatedRepeatedPtrFieldBackInsertIterator(
-      RepeatedPtrField<T>* const mutable_field)
-      : field_(mutable_field) {
-  }
-  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator=(
-      T* const ptr_to_value) {
-    field_->AddAllocated(ptr_to_value);
-    return *this;
-  }
-  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator*() {
-    return *this;
-  }
-  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++() {
-    return *this;
-  }
-  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++(
-      int /* unused */) {
-    return *this;
-  }
-
- private:
-  RepeatedPtrField<T>* field_;
-};
-}  // namespace internal
-
-// Provides a back insert iterator for RepeatedField instances,
-// similar to std::back_inserter().
-template<typename T> internal::RepeatedFieldBackInsertIterator<T>
-RepeatedFieldBackInserter(RepeatedField<T>* const mutable_field) {
-  return internal::RepeatedFieldBackInsertIterator<T>(mutable_field);
-}
-
-// Provides a back insert iterator for RepeatedPtrField instances,
-// similar to std::back_inserter().
-template<typename T> internal::RepeatedPtrFieldBackInsertIterator<T>
-RepeatedPtrFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {
-  return internal::RepeatedPtrFieldBackInsertIterator<T>(mutable_field);
-}
-
-// Special back insert iterator for RepeatedPtrField instances, just in
-// case someone wants to write generic template code that can access both
-// RepeatedFields and RepeatedPtrFields using a common name.
-template<typename T> internal::RepeatedPtrFieldBackInsertIterator<T>
-RepeatedFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {
-  return internal::RepeatedPtrFieldBackInsertIterator<T>(mutable_field);
-}
-
-// Provides a back insert iterator for RepeatedPtrField instances
-// similar to std::back_inserter() which transfers the ownership while
-// copying elements.
-template<typename T> internal::AllocatedRepeatedPtrFieldBackInsertIterator<T>
-AllocatedRepeatedPtrFieldBackInserter(
-    RepeatedPtrField<T>* const mutable_field) {
-  return internal::AllocatedRepeatedPtrFieldBackInsertIterator<T>(
-      mutable_field);
-}
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_REPEATED_FIELD_H__
diff --git a/ps-lite/deps/include/google/protobuf/service.h b/ps-lite/deps/include/google/protobuf/service.h
deleted file mode 100644
index a6a7d16d..00000000
--- a/ps-lite/deps/include/google/protobuf/service.h
+++ /dev/null
@@ -1,291 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// DEPRECATED:  This module declares the abstract interfaces underlying proto2
-// RPC services.  These are intented to be independent of any particular RPC
-// implementation, so that proto2 services can be used on top of a variety
-// of implementations.  Starting with version 2.3.0, RPC implementations should
-// not try to build on these, but should instead provide code generator plugins
-// which generate code specific to the particular RPC implementation.  This way
-// the generated code can be more appropriate for the implementation in use
-// and can avoid unnecessary layers of indirection.
-//
-//
-// When you use the protocol compiler to compile a service definition, it
-// generates two classes:  An abstract interface for the service (with
-// methods matching the service definition) and a "stub" implementation.
-// A stub is just a type-safe wrapper around an RpcChannel which emulates a
-// local implementation of the service.
-//
-// For example, the service definition:
-//   service MyService {
-//     rpc Foo(MyRequest) returns(MyResponse);
-//   }
-// will generate abstract interface "MyService" and class "MyService::Stub".
-// You could implement a MyService as follows:
-//   class MyServiceImpl : public MyService {
-//    public:
-//     MyServiceImpl() {}
-//     ~MyServiceImpl() {}
-//
-//     // implements MyService ---------------------------------------
-//
-//     void Foo(google::protobuf::RpcController* controller,
-//              const MyRequest* request,
-//              MyResponse* response,
-//              Closure* done) {
-//       // ... read request and fill in response ...
-//       done->Run();
-//     }
-//   };
-// You would then register an instance of MyServiceImpl with your RPC server
-// implementation.  (How to do that depends on the implementation.)
-//
-// To call a remote MyServiceImpl, first you need an RpcChannel connected to it.
-// How to construct a channel depends, again, on your RPC implementation.
-// Here we use a hypothentical "MyRpcChannel" as an example:
-//   MyRpcChannel channel("rpc:hostname:1234/myservice");
-//   MyRpcController controller;
-//   MyServiceImpl::Stub stub(&channel);
-//   FooRequest request;
-//   FooRespnose response;
-//
-//   // ... fill in request ...
-//
-//   stub.Foo(&controller, request, &response, NewCallback(HandleResponse));
-//
-// On Thread-Safety:
-//
-// Different RPC implementations may make different guarantees about what
-// threads they may run callbacks on, and what threads the application is
-// allowed to use to call the RPC system.  Portable software should be ready
-// for callbacks to be called on any thread, but should not try to call the
-// RPC system from any thread except for the ones on which it received the
-// callbacks.  Realistically, though, simple software will probably want to
-// use a single-threaded RPC system while high-end software will want to
-// use multiple threads.  RPC implementations should provide multiple
-// choices.
-
-#ifndef GOOGLE_PROTOBUF_SERVICE_H__
-#define GOOGLE_PROTOBUF_SERVICE_H__
-
-#include <string>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-
-// Defined in this file.
-class Service;
-class RpcController;
-class RpcChannel;
-
-// Defined in other files.
-class Descriptor;            // descriptor.h
-class ServiceDescriptor;     // descriptor.h
-class MethodDescriptor;      // descriptor.h
-class Message;               // message.h
-
-// Abstract base interface for protocol-buffer-based RPC services.  Services
-// themselves are abstract interfaces (implemented either by servers or as
-// stubs), but they subclass this base interface.  The methods of this
-// interface can be used to call the methods of the Service without knowing
-// its exact type at compile time (analogous to Reflection).
-class LIBPROTOBUF_EXPORT Service {
- public:
-  inline Service() {}
-  virtual ~Service();
-
-  // When constructing a stub, you may pass STUB_OWNS_CHANNEL as the second
-  // parameter to the constructor to tell it to delete its RpcChannel when
-  // destroyed.
-  enum ChannelOwnership {
-    STUB_OWNS_CHANNEL,
-    STUB_DOESNT_OWN_CHANNEL
-  };
-
-  // Get the ServiceDescriptor describing this service and its methods.
-  virtual const ServiceDescriptor* GetDescriptor() = 0;
-
-  // Call a method of the service specified by MethodDescriptor.  This is
-  // normally implemented as a simple switch() that calls the standard
-  // definitions of the service's methods.
-  //
-  // Preconditions:
-  // * method->service() == GetDescriptor()
-  // * request and response are of the exact same classes as the objects
-  //   returned by GetRequestPrototype(method) and
-  //   GetResponsePrototype(method).
-  // * After the call has started, the request must not be modified and the
-  //   response must not be accessed at all until "done" is called.
-  // * "controller" is of the correct type for the RPC implementation being
-  //   used by this Service.  For stubs, the "correct type" depends on the
-  //   RpcChannel which the stub is using.  Server-side Service
-  //   implementations are expected to accept whatever type of RpcController
-  //   the server-side RPC implementation uses.
-  //
-  // Postconditions:
-  // * "done" will be called when the method is complete.  This may be
-  //   before CallMethod() returns or it may be at some point in the future.
-  // * If the RPC succeeded, "response" contains the response returned by
-  //   the server.
-  // * If the RPC failed, "response"'s contents are undefined.  The
-  //   RpcController can be queried to determine if an error occurred and
-  //   possibly to get more information about the error.
-  virtual void CallMethod(const MethodDescriptor* method,
-                          RpcController* controller,
-                          const Message* request,
-                          Message* response,
-                          Closure* done) = 0;
-
-  // CallMethod() requires that the request and response passed in are of a
-  // particular subclass of Message.  GetRequestPrototype() and
-  // GetResponsePrototype() get the default instances of these required types.
-  // You can then call Message::New() on these instances to construct mutable
-  // objects which you can then pass to CallMethod().
-  //
-  // Example:
-  //   const MethodDescriptor* method =
-  //     service->GetDescriptor()->FindMethodByName("Foo");
-  //   Message* request  = stub->GetRequestPrototype (method)->New();
-  //   Message* response = stub->GetResponsePrototype(method)->New();
-  //   request->ParseFromString(input);
-  //   service->CallMethod(method, *request, response, callback);
-  virtual const Message& GetRequestPrototype(
-    const MethodDescriptor* method) const = 0;
-  virtual const Message& GetResponsePrototype(
-    const MethodDescriptor* method) const = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Service);
-};
-
-// An RpcController mediates a single method call.  The primary purpose of
-// the controller is to provide a way to manipulate settings specific to the
-// RPC implementation and to find out about RPC-level errors.
-//
-// The methods provided by the RpcController interface are intended to be a
-// "least common denominator" set of features which we expect all
-// implementations to support.  Specific implementations may provide more
-// advanced features (e.g. deadline propagation).
-class LIBPROTOBUF_EXPORT RpcController {
- public:
-  inline RpcController() {}
-  virtual ~RpcController();
-
-  // Client-side methods ---------------------------------------------
-  // These calls may be made from the client side only.  Their results
-  // are undefined on the server side (may crash).
-
-  // Resets the RpcController to its initial state so that it may be reused in
-  // a new call.  Must not be called while an RPC is in progress.
-  virtual void Reset() = 0;
-
-  // After a call has finished, returns true if the call failed.  The possible
-  // reasons for failure depend on the RPC implementation.  Failed() must not
-  // be called before a call has finished.  If Failed() returns true, the
-  // contents of the response message are undefined.
-  virtual bool Failed() const = 0;
-
-  // If Failed() is true, returns a human-readable description of the error.
-  virtual string ErrorText() const = 0;
-
-  // Advises the RPC system that the caller desires that the RPC call be
-  // canceled.  The RPC system may cancel it immediately, may wait awhile and
-  // then cancel it, or may not even cancel the call at all.  If the call is
-  // canceled, the "done" callback will still be called and the RpcController
-  // will indicate that the call failed at that time.
-  virtual void StartCancel() = 0;
-
-  // Server-side methods ---------------------------------------------
-  // These calls may be made from the server side only.  Their results
-  // are undefined on the client side (may crash).
-
-  // Causes Failed() to return true on the client side.  "reason" will be
-  // incorporated into the message returned by ErrorText().  If you find
-  // you need to return machine-readable information about failures, you
-  // should incorporate it into your response protocol buffer and should
-  // NOT call SetFailed().
-  virtual void SetFailed(const string& reason) = 0;
-
-  // If true, indicates that the client canceled the RPC, so the server may
-  // as well give up on replying to it.  The server should still call the
-  // final "done" callback.
-  virtual bool IsCanceled() const = 0;
-
-  // Asks that the given callback be called when the RPC is canceled.  The
-  // callback will always be called exactly once.  If the RPC completes without
-  // being canceled, the callback will be called after completion.  If the RPC
-  // has already been canceled when NotifyOnCancel() is called, the callback
-  // will be called immediately.
-  //
-  // NotifyOnCancel() must be called no more than once per request.
-  virtual void NotifyOnCancel(Closure* callback) = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RpcController);
-};
-
-// Abstract interface for an RPC channel.  An RpcChannel represents a
-// communication line to a Service which can be used to call that Service's
-// methods.  The Service may be running on another machine.  Normally, you
-// should not call an RpcChannel directly, but instead construct a stub Service
-// wrapping it.  Example:
-//   RpcChannel* channel = new MyRpcChannel("remotehost.example.com:1234");
-//   MyService* service = new MyService::Stub(channel);
-//   service->MyMethod(request, &response, callback);
-class LIBPROTOBUF_EXPORT RpcChannel {
- public:
-  inline RpcChannel() {}
-  virtual ~RpcChannel();
-
-  // Call the given method of the remote service.  The signature of this
-  // procedure looks the same as Service::CallMethod(), but the requirements
-  // are less strict in one important way:  the request and response objects
-  // need not be of any specific class as long as their descriptors are
-  // method->input_type() and method->output_type().
-  virtual void CallMethod(const MethodDescriptor* method,
-                          RpcController* controller,
-                          const Message* request,
-                          Message* response,
-                          Closure* done) = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(RpcChannel);
-};
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_SERVICE_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops.h
deleted file mode 100644
index b8581fa2..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops.h
+++ /dev/null
@@ -1,206 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// The routines exported by this module are subtle.  If you use them, even if
-// you get the code right, it will depend on careful reasoning about atomicity
-// and memory ordering; it will be less readable, and harder to maintain.  If
-// you plan to use these routines, you should have a good reason, such as solid
-// evidence that performance would otherwise suffer, or there being no
-// alternative.  You should assume only properties explicitly guaranteed by the
-// specifications in this file.  You are almost certainly _not_ writing code
-// just for the x86; if you assume x86 semantics, x86 hardware bugs and
-// implementations on other archtectures will cause your code to break.  If you
-// do not know what you are doing, avoid these routines, and use a Mutex.
-//
-// It is incorrect to make direct assignments to/from an atomic variable.
-// You should use one of the Load or Store routines.  The NoBarrier
-// versions are provided when no barriers are needed:
-//   NoBarrier_Store()
-//   NoBarrier_Load()
-// Although there are currently no compiler enforcement, you are encouraged
-// to use these.
-
-// This header and the implementations for each platform (located in
-// atomicops_internals_*) must be kept in sync with the upstream code (V8).
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_H_
-
-// Don't include this file for people not concerned about thread safety.
-#ifndef GOOGLE_PROTOBUF_NO_THREAD_SAFETY
-
-#include <google/protobuf/stubs/platform_macros.h>
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-typedef int32 Atomic32;
-#ifdef GOOGLE_PROTOBUF_ARCH_64_BIT
-// We need to be able to go between Atomic64 and AtomicWord implicitly.  This
-// means Atomic64 and AtomicWord should be the same type on 64-bit.
-#if defined(GOOGLE_PROTOBUF_OS_NACL)
-// NaCl's intptr_t is not actually 64-bits on 64-bit!
-// http://code.google.com/p/nativeclient/issues/detail?id=1162
-typedef int64 Atomic64;
-#else
-typedef intptr_t Atomic64;
-#endif
-#endif
-
-// Use AtomicWord for a machine-sized pointer.  It will use the Atomic32 or
-// Atomic64 routines below, depending on your architecture.
-typedef intptr_t AtomicWord;
-
-// Atomically execute:
-//      result = *ptr;
-//      if (*ptr == old_value)
-//        *ptr = new_value;
-//      return result;
-//
-// I.e., replace "*ptr" with "new_value" if "*ptr" used to be "old_value".
-// Always return the old value of "*ptr"
-//
-// This routine implies no memory barriers.
-Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                  Atomic32 old_value,
-                                  Atomic32 new_value);
-
-// Atomically store new_value into *ptr, returning the previous value held in
-// *ptr.  This routine implies no memory barriers.
-Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr, Atomic32 new_value);
-
-// Atomically increment *ptr by "increment".  Returns the new value of
-// *ptr with the increment applied.  This routine implies no memory barriers.
-Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr, Atomic32 increment);
-
-Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                 Atomic32 increment);
-
-// These following lower-level operations are typically useful only to people
-// implementing higher-level synchronization operations like spinlocks,
-// mutexes, and condition-variables.  They combine CompareAndSwap(), a load, or
-// a store with appropriate memory-ordering instructions.  "Acquire" operations
-// ensure that no later memory access can be reordered ahead of the operation.
-// "Release" operations ensure that no previous memory access can be reordered
-// after the operation.  "Barrier" operations have both "Acquire" and "Release"
-// semantics.   A MemoryBarrier() has "Barrier" semantics, but does no memory
-// access.
-Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                Atomic32 old_value,
-                                Atomic32 new_value);
-Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                Atomic32 old_value,
-                                Atomic32 new_value);
-
-void MemoryBarrier();
-void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value);
-void Acquire_Store(volatile Atomic32* ptr, Atomic32 value);
-void Release_Store(volatile Atomic32* ptr, Atomic32 value);
-
-Atomic32 NoBarrier_Load(volatile const Atomic32* ptr);
-Atomic32 Acquire_Load(volatile const Atomic32* ptr);
-Atomic32 Release_Load(volatile const Atomic32* ptr);
-
-// 64-bit atomic operations (only available on 64-bit processors).
-#ifdef GOOGLE_PROTOBUF_ARCH_64_BIT
-Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
-                                  Atomic64 old_value,
-                                  Atomic64 new_value);
-Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr, Atomic64 new_value);
-Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr, Atomic64 increment);
-Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr, Atomic64 increment);
-
-Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
-                                Atomic64 old_value,
-                                Atomic64 new_value);
-Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
-                                Atomic64 old_value,
-                                Atomic64 new_value);
-void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value);
-void Acquire_Store(volatile Atomic64* ptr, Atomic64 value);
-void Release_Store(volatile Atomic64* ptr, Atomic64 value);
-Atomic64 NoBarrier_Load(volatile const Atomic64* ptr);
-Atomic64 Acquire_Load(volatile const Atomic64* ptr);
-Atomic64 Release_Load(volatile const Atomic64* ptr);
-#endif  // GOOGLE_PROTOBUF_ARCH_64_BIT
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-// Include our platform specific implementation.
-#define GOOGLE_PROTOBUF_ATOMICOPS_ERROR \
-#error "Atomic operations are not supported on your platform"
-
-// MSVC.
-#if defined(_MSC_VER)
-#if defined(GOOGLE_PROTOBUF_ARCH_IA32) || defined(GOOGLE_PROTOBUF_ARCH_X64)
-#include <google/protobuf/stubs/atomicops_internals_x86_msvc.h>
-#else
-GOOGLE_PROTOBUF_ATOMICOPS_ERROR
-#endif
-
-// Apple.
-#elif defined(GOOGLE_PROTOBUF_OS_APPLE)
-#include <google/protobuf/stubs/atomicops_internals_macosx.h>
-
-// GCC.
-#elif defined(__GNUC__)
-#if defined(GOOGLE_PROTOBUF_ARCH_IA32) || defined(GOOGLE_PROTOBUF_ARCH_X64)
-#include <google/protobuf/stubs/atomicops_internals_x86_gcc.h>
-#elif defined(GOOGLE_PROTOBUF_ARCH_ARM)
-#include <google/protobuf/stubs/atomicops_internals_arm_gcc.h>
-#elif defined(GOOGLE_PROTOBUF_ARCH_ARM_QNX)
-#include <google/protobuf/stubs/atomicops_internals_arm_qnx.h>
-#elif defined(GOOGLE_PROTOBUF_ARCH_MIPS)
-#include <google/protobuf/stubs/atomicops_internals_mips_gcc.h>
-#elif defined(__pnacl__)
-#include <google/protobuf/stubs/atomicops_internals_pnacl.h>
-#else
-GOOGLE_PROTOBUF_ATOMICOPS_ERROR
-#endif
-
-// Unknown.
-#else
-GOOGLE_PROTOBUF_ATOMICOPS_ERROR
-#endif
-
-// On some platforms we need additional declarations to make AtomicWord
-// compatible with our other Atomic* types.
-#if defined(GOOGLE_PROTOBUF_OS_APPLE)
-#include <google/protobuf/stubs/atomicops_internals_atomicword_compat.h>
-#endif
-
-#undef GOOGLE_PROTOBUF_ATOMICOPS_ERROR
-
-#endif  // GOOGLE_PROTOBUF_NO_THREAD_SAFETY
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
deleted file mode 100644
index 1f4dedc0..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h
+++ /dev/null
@@ -1,151 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-//
-// LinuxKernelCmpxchg and Barrier_AtomicIncrement are from Google Gears.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// 0xffff0fc0 is the hard coded address of a function provided by
-// the kernel which implements an atomic compare-exchange. On older
-// ARM architecture revisions (pre-v6) this may be implemented using
-// a syscall. This address is stable, and in active use (hard coded)
-// by at least glibc-2.7 and the Android C library.
-typedef Atomic32 (*LinuxKernelCmpxchgFunc)(Atomic32 old_value,
-                                           Atomic32 new_value,
-                                           volatile Atomic32* ptr);
-LinuxKernelCmpxchgFunc pLinuxKernelCmpxchg __attribute__((weak)) =
-    (LinuxKernelCmpxchgFunc) 0xffff0fc0;
-
-typedef void (*LinuxKernelMemoryBarrierFunc)(void);
-LinuxKernelMemoryBarrierFunc pLinuxKernelMemoryBarrier __attribute__((weak)) =
-    (LinuxKernelMemoryBarrierFunc) 0xffff0fa0;
-
-
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  Atomic32 prev_value = *ptr;
-  do {
-    if (!pLinuxKernelCmpxchg(old_value, new_value,
-                             const_cast<Atomic32*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
-                                         Atomic32 new_value) {
-  Atomic32 old_value;
-  do {
-    old_value = *ptr;
-  } while (pLinuxKernelCmpxchg(old_value, new_value,
-                               const_cast<Atomic32*>(ptr)));
-  return old_value;
-}
-
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  return Barrier_AtomicIncrement(ptr, increment);
-}
-
-inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                        Atomic32 increment) {
-  for (;;) {
-    // Atomic exchange the old value with an incremented one.
-    Atomic32 old_value = *ptr;
-    Atomic32 new_value = old_value + increment;
-    if (pLinuxKernelCmpxchg(old_value, new_value,
-                            const_cast<Atomic32*>(ptr)) == 0) {
-      // The exchange took place as expected.
-      return new_value;
-    }
-    // Otherwise, *ptr changed mid-loop and we need to retry.
-  }
-}
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-inline void MemoryBarrier() {
-  pLinuxKernelMemoryBarrier();
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
deleted file mode 100644
index f0507697..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h
+++ /dev/null
@@ -1,146 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
-
-// For _smp_cmpxchg()
-#include <pthread.h>
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-inline Atomic32 QNXCmpxchg(Atomic32 old_value,
-                           Atomic32 new_value,
-                           volatile Atomic32* ptr) {
-  return static_cast<Atomic32>(
-      _smp_cmpxchg((volatile unsigned *)ptr,
-                   (unsigned)old_value,
-                   (unsigned)new_value));
-}
-
-
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  Atomic32 prev_value = *ptr;
-  do {
-    if (!QNXCmpxchg(old_value, new_value,
-                    const_cast<Atomic32*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
-                                         Atomic32 new_value) {
-  Atomic32 old_value;
-  do {
-    old_value = *ptr;
-  } while (QNXCmpxchg(old_value, new_value,
-                      const_cast<Atomic32*>(ptr)));
-  return old_value;
-}
-
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  return Barrier_AtomicIncrement(ptr, increment);
-}
-
-inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                        Atomic32 increment) {
-  for (;;) {
-    // Atomic exchange the old value with an incremented one.
-    Atomic32 old_value = *ptr;
-    Atomic32 new_value = old_value + increment;
-    if (QNXCmpxchg(old_value, new_value,
-                   const_cast<Atomic32*>(ptr)) == 0) {
-      // The exchange took place as expected.
-      return new_value;
-    }
-    // Otherwise, *ptr changed mid-loop and we need to retry.
-  }
-}
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-inline void MemoryBarrier() {
-  __sync_synchronize();
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
deleted file mode 100644
index e9d86797..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h
+++ /dev/null
@@ -1,122 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
-
-// AtomicWord is a synonym for intptr_t, and Atomic32 is a synonym for int32,
-// which in turn means int. On some LP32 platforms, intptr_t is an int, but
-// on others, it's a long. When AtomicWord and Atomic32 are based on different
-// fundamental types, their pointers are incompatible.
-//
-// This file defines function overloads to allow both AtomicWord and Atomic32
-// data to be used with this interface.
-//
-// On LP64 platforms, AtomicWord and Atomic64 are both always long,
-// so this problem doesn't occur.
-
-#if !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,
-                                           AtomicWord old_value,
-                                           AtomicWord new_value) {
-  return NoBarrier_CompareAndSwap(
-      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
-}
-
-inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,
-                                           AtomicWord new_value) {
-  return NoBarrier_AtomicExchange(
-      reinterpret_cast<volatile Atomic32*>(ptr), new_value);
-}
-
-inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,
-                                            AtomicWord increment) {
-  return NoBarrier_AtomicIncrement(
-      reinterpret_cast<volatile Atomic32*>(ptr), increment);
-}
-
-inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,
-                                          AtomicWord increment) {
-  return Barrier_AtomicIncrement(
-      reinterpret_cast<volatile Atomic32*>(ptr), increment);
-}
-
-inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,
-                                         AtomicWord old_value,
-                                         AtomicWord new_value) {
-  return Acquire_CompareAndSwap(
-      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
-}
-
-inline AtomicWord Release_CompareAndSwap(volatile AtomicWord* ptr,
-                                         AtomicWord old_value,
-                                         AtomicWord new_value) {
-  return Release_CompareAndSwap(
-      reinterpret_cast<volatile Atomic32*>(ptr), old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile AtomicWord *ptr, AtomicWord value) {
-  NoBarrier_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
-}
-
-inline void Acquire_Store(volatile AtomicWord* ptr, AtomicWord value) {
-  return Acquire_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
-}
-
-inline void Release_Store(volatile AtomicWord* ptr, AtomicWord value) {
-  return Release_Store(reinterpret_cast<volatile Atomic32*>(ptr), value);
-}
-
-inline AtomicWord NoBarrier_Load(volatile const AtomicWord *ptr) {
-  return NoBarrier_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
-}
-
-inline AtomicWord Acquire_Load(volatile const AtomicWord* ptr) {
-  return Acquire_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
-}
-
-inline AtomicWord Release_Load(volatile const AtomicWord* ptr) {
-  return Release_Load(reinterpret_cast<volatile const Atomic32*>(ptr));
-}
-
-}   // namespace internal
-}   // namespace protobuf
-}   // namespace google
-
-#endif  // !defined(GOOGLE_PROTOBUF_ARCH_64_BIT)
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
deleted file mode 100644
index f9b7581a..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_macosx.h
+++ /dev/null
@@ -1,225 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
-
-#include <libkern/OSAtomic.h>
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  Atomic32 prev_value;
-  do {
-    if (OSAtomicCompareAndSwap32(old_value, new_value,
-                                 const_cast<Atomic32*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
-                                         Atomic32 new_value) {
-  Atomic32 old_value;
-  do {
-    old_value = *ptr;
-  } while (!OSAtomicCompareAndSwap32(old_value, new_value,
-                                     const_cast<Atomic32*>(ptr)));
-  return old_value;
-}
-
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  return OSAtomicAdd32(increment, const_cast<Atomic32*>(ptr));
-}
-
-inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  return OSAtomicAdd32Barrier(increment, const_cast<Atomic32*>(ptr));
-}
-
-inline void MemoryBarrier() {
-  OSMemoryBarrier();
-}
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  Atomic32 prev_value;
-  do {
-    if (OSAtomicCompareAndSwap32Barrier(old_value, new_value,
-                                        const_cast<Atomic32*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return Acquire_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-#ifdef __LP64__
-
-// 64-bit implementation on 64-bit platform
-
-inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
-                                         Atomic64 old_value,
-                                         Atomic64 new_value) {
-  Atomic64 prev_value;
-  do {
-    if (OSAtomicCompareAndSwap64(old_value, new_value,
-                                 reinterpret_cast<volatile int64_t*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,
-                                         Atomic64 new_value) {
-  Atomic64 old_value;
-  do {
-    old_value = *ptr;
-  } while (!OSAtomicCompareAndSwap64(old_value, new_value,
-                                     reinterpret_cast<volatile int64_t*>(ptr)));
-  return old_value;
-}
-
-inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
-                                          Atomic64 increment) {
-  return OSAtomicAdd64(increment, reinterpret_cast<volatile int64_t*>(ptr));
-}
-
-inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,
-                                        Atomic64 increment) {
-  return OSAtomicAdd64Barrier(increment,
-                              reinterpret_cast<volatile int64_t*>(ptr));
-}
-
-inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  Atomic64 prev_value;
-  do {
-    if (OSAtomicCompareAndSwap64Barrier(
-        old_value, new_value, reinterpret_cast<volatile int64_t*>(ptr))) {
-      return old_value;
-    }
-    prev_value = *ptr;
-  } while (prev_value == old_value);
-  return prev_value;
-}
-
-inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  // The lib kern interface does not distinguish between
-  // Acquire and Release memory barriers; they are equivalent.
-  return Acquire_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;
-}
-
-inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
-  return *ptr;
-}
-
-inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
-  Atomic64 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-#endif  // defined(__LP64__)
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
deleted file mode 100644
index dc468517..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h
+++ /dev/null
@@ -1,187 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
-
-#define ATOMICOPS_COMPILER_BARRIER() __asm__ __volatile__("" : : : "memory")
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// Atomically execute:
-//      result = *ptr;
-//      if (*ptr == old_value)
-//        *ptr = new_value;
-//      return result;
-//
-// I.e., replace "*ptr" with "new_value" if "*ptr" used to be "old_value".
-// Always return the old value of "*ptr"
-//
-// This routine implies no memory barriers.
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  Atomic32 prev, tmp;
-  __asm__ __volatile__(".set push\n"
-                       ".set noreorder\n"
-                       "1:\n"
-                       "ll %0, %5\n"  // prev = *ptr
-                       "bne %0, %3, 2f\n"  // if (prev != old_value) goto 2
-                       "move %2, %4\n"  // tmp = new_value
-                       "sc %2, %1\n"  // *ptr = tmp (with atomic check)
-                       "beqz %2, 1b\n"  // start again on atomic error
-                       "nop\n"  // delay slot nop
-                       "2:\n"
-                       ".set pop\n"
-                       : "=&r" (prev), "=m" (*ptr), "=&r" (tmp)
-                       : "Ir" (old_value), "r" (new_value), "m" (*ptr)
-                       : "memory");
-  return prev;
-}
-
-// Atomically store new_value into *ptr, returning the previous value held in
-// *ptr.  This routine implies no memory barriers.
-inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
-                                         Atomic32 new_value) {
-  Atomic32 temp, old;
-  __asm__ __volatile__(".set push\n"
-                       ".set noreorder\n"
-                       "1:\n"
-                       "ll %1, %2\n"  // old = *ptr
-                       "move %0, %3\n"  // temp = new_value
-                       "sc %0, %2\n"  // *ptr = temp (with atomic check)
-                       "beqz %0, 1b\n"  // start again on atomic error
-                       "nop\n"  // delay slot nop
-                       ".set pop\n"
-                       : "=&r" (temp), "=&r" (old), "=m" (*ptr)
-                       : "r" (new_value), "m" (*ptr)
-                       : "memory");
-
-  return old;
-}
-
-// Atomically increment *ptr by "increment".  Returns the new value of
-// *ptr with the increment applied.  This routine implies no memory barriers.
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  Atomic32 temp, temp2;
-
-  __asm__ __volatile__(".set push\n"
-                       ".set noreorder\n"
-                       "1:\n"
-                       "ll %0, %2\n"  // temp = *ptr
-                       "addu %1, %0, %3\n"  // temp2 = temp + increment
-                       "sc %1, %2\n"  // *ptr = temp2 (with atomic check)
-                       "beqz %1, 1b\n"  // start again on atomic error
-                       "addu %1, %0, %3\n"  // temp2 = temp + increment
-                       ".set pop\n"
-                       : "=&r" (temp), "=&r" (temp2), "=m" (*ptr)
-                       : "Ir" (increment), "m" (*ptr)
-                       : "memory");
-  // temp2 now holds the final value.
-  return temp2;
-}
-
-inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                        Atomic32 increment) {
-  ATOMICOPS_COMPILER_BARRIER();
-  Atomic32 res = NoBarrier_AtomicIncrement(ptr, increment);
-  ATOMICOPS_COMPILER_BARRIER();
-  return res;
-}
-
-// "Acquire" operations
-// ensure that no later memory access can be reordered ahead of the operation.
-// "Release" operations ensure that no previous memory access can be reordered
-// after the operation.  "Barrier" operations have both "Acquire" and "Release"
-// semantics.   A MemoryBarrier() has "Barrier" semantics, but does no memory
-// access.
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  ATOMICOPS_COMPILER_BARRIER();
-  Atomic32 res = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-  ATOMICOPS_COMPILER_BARRIER();
-  return res;
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  ATOMICOPS_COMPILER_BARRIER();
-  Atomic32 res = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-  ATOMICOPS_COMPILER_BARRIER();
-  return res;
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-inline void MemoryBarrier() {
-  __asm__ __volatile__("sync" : : : "memory");
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#undef ATOMICOPS_COMPILER_BARRIER
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
deleted file mode 100644
index 04a91a83..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h
+++ /dev/null
@@ -1,73 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  return __sync_val_compare_and_swap(ptr, old_value, new_value);
-}
-
-inline void MemoryBarrier() {
-  __sync_synchronize();
-}
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  Atomic32 ret = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-  MemoryBarrier();
-  return ret;
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  MemoryBarrier();
-  *ptr = value;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  MemoryBarrier();
-  return value;
-}
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
deleted file mode 100644
index 5324dfbc..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h
+++ /dev/null
@@ -1,293 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// This struct is not part of the public API of this module; clients may not
-// use it.
-// Features of this x86.  Values may not be correct before main() is run,
-// but are set conservatively.
-struct AtomicOps_x86CPUFeatureStruct {
-  bool has_amd_lock_mb_bug;  // Processor has AMD memory-barrier bug; do lfence
-                             // after acquire compare-and-swap.
-  bool has_sse2;             // Processor has SSE2.
-};
-extern struct AtomicOps_x86CPUFeatureStruct AtomicOps_Internalx86CPUFeatures;
-
-#define ATOMICOPS_COMPILER_BARRIER() __asm__ __volatile__("" : : : "memory")
-
-// 32-bit low-level operations on any platform.
-
-inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,
-                                         Atomic32 old_value,
-                                         Atomic32 new_value) {
-  Atomic32 prev;
-  __asm__ __volatile__("lock; cmpxchgl %1,%2"
-                       : "=a" (prev)
-                       : "q" (new_value), "m" (*ptr), "0" (old_value)
-                       : "memory");
-  return prev;
-}
-
-inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,
-                                         Atomic32 new_value) {
-  __asm__ __volatile__("xchgl %1,%0"  // The lock prefix is implicit for xchg.
-                       : "=r" (new_value)
-                       : "m" (*ptr), "0" (new_value)
-                       : "memory");
-  return new_value;  // Now it's the previous value.
-}
-
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  Atomic32 temp = increment;
-  __asm__ __volatile__("lock; xaddl %0,%1"
-                       : "+r" (temp), "+m" (*ptr)
-                       : : "memory");
-  // temp now holds the old value of *ptr
-  return temp + increment;
-}
-
-inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,
-                                        Atomic32 increment) {
-  Atomic32 temp = increment;
-  __asm__ __volatile__("lock; xaddl %0,%1"
-                       : "+r" (temp), "+m" (*ptr)
-                       : : "memory");
-  // temp now holds the old value of *ptr
-  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
-    __asm__ __volatile__("lfence" : : : "memory");
-  }
-  return temp + increment;
-}
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  Atomic32 x = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
-    __asm__ __volatile__("lfence" : : : "memory");
-  }
-  return x;
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-#if defined(__x86_64__)
-
-// 64-bit implementations of memory barrier can be simpler, because it
-// "mfence" is guaranteed to exist.
-inline void MemoryBarrier() {
-  __asm__ __volatile__("mfence" : : : "memory");
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-#else
-
-inline void MemoryBarrier() {
-  if (AtomicOps_Internalx86CPUFeatures.has_sse2) {
-    __asm__ __volatile__("mfence" : : : "memory");
-  } else {  // mfence is faster but not present on PIII
-    Atomic32 x = 0;
-    NoBarrier_AtomicExchange(&x, 0);  // acts as a barrier on PIII
-  }
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  if (AtomicOps_Internalx86CPUFeatures.has_sse2) {
-    *ptr = value;
-    __asm__ __volatile__("mfence" : : : "memory");
-  } else {
-    NoBarrier_AtomicExchange(ptr, value);
-                          // acts as a barrier on PIII
-  }
-}
-#endif
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  ATOMICOPS_COMPILER_BARRIER();
-  *ptr = value;  // An x86 store acts as a release barrier.
-  // See comments in Atomic64 version of Release_Store(), below.
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;  // An x86 load acts as a acquire barrier.
-  // See comments in Atomic64 version of Release_Store(), below.
-  ATOMICOPS_COMPILER_BARRIER();
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-#if defined(__x86_64__)
-
-// 64-bit low-level operations on 64-bit platform.
-
-inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,
-                                         Atomic64 old_value,
-                                         Atomic64 new_value) {
-  Atomic64 prev;
-  __asm__ __volatile__("lock; cmpxchgq %1,%2"
-                       : "=a" (prev)
-                       : "q" (new_value), "m" (*ptr), "0" (old_value)
-                       : "memory");
-  return prev;
-}
-
-inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,
-                                         Atomic64 new_value) {
-  __asm__ __volatile__("xchgq %1,%0"  // The lock prefix is implicit for xchg.
-                       : "=r" (new_value)
-                       : "m" (*ptr), "0" (new_value)
-                       : "memory");
-  return new_value;  // Now it's the previous value.
-}
-
-inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
-                                          Atomic64 increment) {
-  Atomic64 temp = increment;
-  __asm__ __volatile__("lock; xaddq %0,%1"
-                       : "+r" (temp), "+m" (*ptr)
-                       : : "memory");
-  // temp now contains the previous value of *ptr
-  return temp + increment;
-}
-
-inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,
-                                        Atomic64 increment) {
-  Atomic64 temp = increment;
-  __asm__ __volatile__("lock; xaddq %0,%1"
-                       : "+r" (temp), "+m" (*ptr)
-                       : : "memory");
-  // temp now contains the previous value of *ptr
-  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
-    __asm__ __volatile__("lfence" : : : "memory");
-  }
-  return temp + increment;
-}
-
-inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;
-}
-
-inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;
-  MemoryBarrier();
-}
-
-inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
-  ATOMICOPS_COMPILER_BARRIER();
-
-  *ptr = value;  // An x86 store acts as a release barrier
-                 // for current AMD/Intel chips as of Jan 2008.
-                 // See also Acquire_Load(), below.
-
-  // When new chips come out, check:
-  //  IA-32 Intel Architecture Software Developer's Manual, Volume 3:
-  //  System Programming Guide, Chatper 7: Multiple-processor management,
-  //  Section 7.2, Memory Ordering.
-  // Last seen at:
-  //   http://developer.intel.com/design/pentium4/manuals/index_new.htm
-  //
-  // x86 stores/loads fail to act as barriers for a few instructions (clflush
-  // maskmovdqu maskmovq movntdq movnti movntpd movntps movntq) but these are
-  // not generated by the compiler, and are rare.  Users of these instructions
-  // need to know about cache behaviour in any case since all of these involve
-  // either flushing cache lines or non-temporal cache hints.
-}
-
-inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
-  return *ptr;
-}
-
-inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
-  Atomic64 value = *ptr;  // An x86 load acts as a acquire barrier,
-                          // for current AMD/Intel chips as of Jan 2008.
-                          // See also Release_Store(), above.
-  ATOMICOPS_COMPILER_BARRIER();
-  return value;
-}
-
-inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  Atomic64 x = NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-  if (AtomicOps_Internalx86CPUFeatures.has_amd_lock_mb_bug) {
-    __asm__ __volatile__("lfence" : : : "memory");
-  }
-  return x;
-}
-
-inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-#endif  // defined(__x86_64__)
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#undef ATOMICOPS_COMPILER_BARRIER
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h b/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
deleted file mode 100644
index 6f9869d1..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h
+++ /dev/null
@@ -1,150 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// This file is an internal atomic implementation, use atomicops.h instead.
-
-#ifndef GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
-#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,
-                                          Atomic32 increment) {
-  return Barrier_AtomicIncrement(ptr, increment);
-}
-
-#if !(defined(_MSC_VER) && _MSC_VER >= 1400)
-#error "We require at least vs2005 for MemoryBarrier"
-#endif
-
-inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,
-                                       Atomic32 old_value,
-                                       Atomic32 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;
-}
-
-inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {
-  NoBarrier_AtomicExchange(ptr, value);
-              // acts as a barrier in this implementation
-}
-
-inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {
-  *ptr = value;  // works w/o barrier for current Intel chips as of June 2005
-  // See comments in Atomic64 version of Release_Store() below.
-}
-
-inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {
-  return *ptr;
-}
-
-inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {
-  Atomic32 value = *ptr;
-  return value;
-}
-
-inline Atomic32 Release_Load(volatile const Atomic32* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-#if defined(_WIN64)
-
-// 64-bit low-level operations on 64-bit platform.
-
-inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,
-                                          Atomic64 increment) {
-  return Barrier_AtomicIncrement(ptr, increment);
-}
-
-inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;
-}
-
-inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {
-  NoBarrier_AtomicExchange(ptr, value);
-              // acts as a barrier in this implementation
-}
-
-inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {
-  *ptr = value;  // works w/o barrier for current Intel chips as of June 2005
-
-  // When new chips come out, check:
-  //  IA-32 Intel Architecture Software Developer's Manual, Volume 3:
-  //  System Programming Guide, Chatper 7: Multiple-processor management,
-  //  Section 7.2, Memory Ordering.
-  // Last seen at:
-  //   http://developer.intel.com/design/pentium4/manuals/index_new.htm
-}
-
-inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {
-  return *ptr;
-}
-
-inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {
-  Atomic64 value = *ptr;
-  return value;
-}
-
-inline Atomic64 Release_Load(volatile const Atomic64* ptr) {
-  MemoryBarrier();
-  return *ptr;
-}
-
-inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,
-                                       Atomic64 old_value,
-                                       Atomic64 new_value) {
-  return NoBarrier_CompareAndSwap(ptr, old_value, new_value);
-}
-
-#endif  // defined(_WIN64)
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/common.h b/ps-lite/deps/include/google/protobuf/stubs/common.h
deleted file mode 100644
index f287ddfb..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/common.h
+++ /dev/null
@@ -1,1223 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda) and others
-//
-// Contains basic types and utilities used by the rest of the library.
-
-#ifndef GOOGLE_PROTOBUF_COMMON_H__
-#define GOOGLE_PROTOBUF_COMMON_H__
-
-#include <assert.h>
-#include <stdlib.h>
-#include <cstddef>
-#include <string>
-#include <string.h>
-#if defined(__osf__)
-// Tru64 lacks stdint.h, but has inttypes.h which defines a superset of
-// what stdint.h would define.
-#include <inttypes.h>
-#elif !defined(_MSC_VER)
-#include <stdint.h>
-#endif
-
-#ifndef PROTOBUF_USE_EXCEPTIONS
-#if defined(_MSC_VER) && defined(_CPPUNWIND)
-  #define PROTOBUF_USE_EXCEPTIONS 1
-#elif defined(__EXCEPTIONS)
-  #define PROTOBUF_USE_EXCEPTIONS 1
-#else
-  #define PROTOBUF_USE_EXCEPTIONS 0
-#endif
-#endif
-
-#if PROTOBUF_USE_EXCEPTIONS
-#include <exception>
-#endif
-
-#if defined(_WIN32) && defined(GetMessage)
-// Allow GetMessage to be used as a valid method name in protobuf classes.
-// windows.h defines GetMessage() as a macro.  Let's re-define it as an inline
-// function.  The inline function should be equivalent for C++ users.
-inline BOOL GetMessage_Win32(
-    LPMSG lpMsg, HWND hWnd,
-    UINT wMsgFilterMin, UINT wMsgFilterMax) {
-  return GetMessage(lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax);
-}
-#undef GetMessage
-inline BOOL GetMessage(
-    LPMSG lpMsg, HWND hWnd,
-    UINT wMsgFilterMin, UINT wMsgFilterMax) {
-  return GetMessage_Win32(lpMsg, hWnd, wMsgFilterMin, wMsgFilterMax);
-}
-#endif
-
-
-namespace std {}
-
-namespace google {
-namespace protobuf {
-
-#undef GOOGLE_DISALLOW_EVIL_CONSTRUCTORS
-#define GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(TypeName)    \
-  TypeName(const TypeName&);                           \
-  void operator=(const TypeName&)
-
-#if defined(_MSC_VER) && defined(PROTOBUF_USE_DLLS)
-  #ifdef LIBPROTOBUF_EXPORTS
-    #define LIBPROTOBUF_EXPORT __declspec(dllexport)
-  #else
-    #define LIBPROTOBUF_EXPORT __declspec(dllimport)
-  #endif
-  #ifdef LIBPROTOC_EXPORTS
-    #define LIBPROTOC_EXPORT   __declspec(dllexport)
-  #else
-    #define LIBPROTOC_EXPORT   __declspec(dllimport)
-  #endif
-#else
-  #define LIBPROTOBUF_EXPORT
-  #define LIBPROTOC_EXPORT
-#endif
-
-namespace internal {
-
-// Some of these constants are macros rather than const ints so that they can
-// be used in #if directives.
-
-// The current version, represented as a single integer to make comparison
-// easier:  major * 10^6 + minor * 10^3 + micro
-#define GOOGLE_PROTOBUF_VERSION 2005000
-
-// The minimum library version which works with the current version of the
-// headers.
-#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION 2005000
-
-// The minimum header version which works with the current version of
-// the library.  This constant should only be used by protoc's C++ code
-// generator.
-static const int kMinHeaderVersionForLibrary = 2005000;
-
-// The minimum protoc version which works with the current version of the
-// headers.
-#define GOOGLE_PROTOBUF_MIN_PROTOC_VERSION 2005000
-
-// The minimum header version which works with the current version of
-// protoc.  This constant should only be used in VerifyVersion().
-static const int kMinHeaderVersionForProtoc = 2005000;
-
-// Verifies that the headers and libraries are compatible.  Use the macro
-// below to call this.
-void LIBPROTOBUF_EXPORT VerifyVersion(int headerVersion, int minLibraryVersion,
-                                      const char* filename);
-
-// Converts a numeric version number to a string.
-std::string LIBPROTOBUF_EXPORT VersionString(int version);
-
-}  // namespace internal
-
-// Place this macro in your main() function (or somewhere before you attempt
-// to use the protobuf library) to verify that the version you link against
-// matches the headers you compiled against.  If a version mismatch is
-// detected, the process will abort.
-#define GOOGLE_PROTOBUF_VERIFY_VERSION                                    \
-  ::google::protobuf::internal::VerifyVersion(                            \
-    GOOGLE_PROTOBUF_VERSION, GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION,         \
-    __FILE__)
-
-// ===================================================================
-// from google3/base/port.h
-
-typedef unsigned int uint;
-
-#ifdef _MSC_VER
-typedef __int8  int8;
-typedef __int16 int16;
-typedef __int32 int32;
-typedef __int64 int64;
-
-typedef unsigned __int8  uint8;
-typedef unsigned __int16 uint16;
-typedef unsigned __int32 uint32;
-typedef unsigned __int64 uint64;
-#else
-typedef int8_t  int8;
-typedef int16_t int16;
-typedef int32_t int32;
-typedef int64_t int64;
-
-typedef uint8_t  uint8;
-typedef uint16_t uint16;
-typedef uint32_t uint32;
-typedef uint64_t uint64;
-#endif
-
-// long long macros to be used because gcc and vc++ use different suffixes,
-// and different size specifiers in format strings
-#undef GOOGLE_LONGLONG
-#undef GOOGLE_ULONGLONG
-#undef GOOGLE_LL_FORMAT
-
-#ifdef _MSC_VER
-#define GOOGLE_LONGLONG(x) x##I64
-#define GOOGLE_ULONGLONG(x) x##UI64
-#define GOOGLE_LL_FORMAT "I64"  // As in printf("%I64d", ...)
-#else
-#define GOOGLE_LONGLONG(x) x##LL
-#define GOOGLE_ULONGLONG(x) x##ULL
-#define GOOGLE_LL_FORMAT "ll"  // As in "%lld". Note that "q" is poor form also.
-#endif
-
-static const int32 kint32max = 0x7FFFFFFF;
-static const int32 kint32min = -kint32max - 1;
-static const int64 kint64max = GOOGLE_LONGLONG(0x7FFFFFFFFFFFFFFF);
-static const int64 kint64min = -kint64max - 1;
-static const uint32 kuint32max = 0xFFFFFFFFu;
-static const uint64 kuint64max = GOOGLE_ULONGLONG(0xFFFFFFFFFFFFFFFF);
-
-// -------------------------------------------------------------------
-// Annotations:  Some parts of the code have been annotated in ways that might
-//   be useful to some compilers or tools, but are not supported universally.
-//   You can #define these annotations yourself if the default implementation
-//   is not right for you.
-
-#ifndef GOOGLE_ATTRIBUTE_ALWAYS_INLINE
-#if defined(__GNUC__) && (__GNUC__ > 3 ||(__GNUC__ == 3 && __GNUC_MINOR__ >= 1))
-// For functions we want to force inline.
-// Introduced in gcc 3.1.
-#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE __attribute__ ((always_inline))
-#else
-// Other compilers will have to figure it out for themselves.
-#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE
-#endif
-#endif
-
-#ifndef GOOGLE_ATTRIBUTE_DEPRECATED
-#ifdef __GNUC__
-// If the method/variable/type is used anywhere, produce a warning.
-#define GOOGLE_ATTRIBUTE_DEPRECATED __attribute__((deprecated))
-#else
-#define GOOGLE_ATTRIBUTE_DEPRECATED
-#endif
-#endif
-
-#ifndef GOOGLE_PREDICT_TRUE
-#ifdef __GNUC__
-// Provided at least since GCC 3.0.
-#define GOOGLE_PREDICT_TRUE(x) (__builtin_expect(!!(x), 1))
-#else
-#define GOOGLE_PREDICT_TRUE
-#endif
-#endif
-
-// Delimits a block of code which may write to memory which is simultaneously
-// written by other threads, but which has been determined to be thread-safe
-// (e.g. because it is an idempotent write).
-#ifndef GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN
-#define GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN()
-#endif
-#ifndef GOOGLE_SAFE_CONCURRENT_WRITES_END
-#define GOOGLE_SAFE_CONCURRENT_WRITES_END()
-#endif
-
-// ===================================================================
-// from google3/base/basictypes.h
-
-// The GOOGLE_ARRAYSIZE(arr) macro returns the # of elements in an array arr.
-// The expression is a compile-time constant, and therefore can be
-// used in defining new arrays, for example.
-//
-// GOOGLE_ARRAYSIZE catches a few type errors.  If you see a compiler error
-//
-//   "warning: division by zero in ..."
-//
-// when using GOOGLE_ARRAYSIZE, you are (wrongfully) giving it a pointer.
-// You should only use GOOGLE_ARRAYSIZE on statically allocated arrays.
-//
-// The following comments are on the implementation details, and can
-// be ignored by the users.
-//
-// ARRAYSIZE(arr) works by inspecting sizeof(arr) (the # of bytes in
-// the array) and sizeof(*(arr)) (the # of bytes in one array
-// element).  If the former is divisible by the latter, perhaps arr is
-// indeed an array, in which case the division result is the # of
-// elements in the array.  Otherwise, arr cannot possibly be an array,
-// and we generate a compiler error to prevent the code from
-// compiling.
-//
-// Since the size of bool is implementation-defined, we need to cast
-// !(sizeof(a) & sizeof(*(a))) to size_t in order to ensure the final
-// result has type size_t.
-//
-// This macro is not perfect as it wrongfully accepts certain
-// pointers, namely where the pointer size is divisible by the pointee
-// size.  Since all our code has to go through a 32-bit compiler,
-// where a pointer is 4 bytes, this means all pointers to a type whose
-// size is 3 or greater than 4 will be (righteously) rejected.
-//
-// Kudos to Jorg Brown for this simple and elegant implementation.
-
-#undef GOOGLE_ARRAYSIZE
-#define GOOGLE_ARRAYSIZE(a) \
-  ((sizeof(a) / sizeof(*(a))) / \
-   static_cast<size_t>(!(sizeof(a) % sizeof(*(a)))))
-
-namespace internal {
-
-// Use implicit_cast as a safe version of static_cast or const_cast
-// for upcasting in the type hierarchy (i.e. casting a pointer to Foo
-// to a pointer to SuperclassOfFoo or casting a pointer to Foo to
-// a const pointer to Foo).
-// When you use implicit_cast, the compiler checks that the cast is safe.
-// Such explicit implicit_casts are necessary in surprisingly many
-// situations where C++ demands an exact type match instead of an
-// argument type convertable to a target type.
-//
-// The From type can be inferred, so the preferred syntax for using
-// implicit_cast is the same as for static_cast etc.:
-//
-//   implicit_cast<ToType>(expr)
-//
-// implicit_cast would have been part of the C++ standard library,
-// but the proposal was submitted too late.  It will probably make
-// its way into the language in the future.
-template<typename To, typename From>
-inline To implicit_cast(From const &f) {
-  return f;
-}
-
-// When you upcast (that is, cast a pointer from type Foo to type
-// SuperclassOfFoo), it's fine to use implicit_cast<>, since upcasts
-// always succeed.  When you downcast (that is, cast a pointer from
-// type Foo to type SubclassOfFoo), static_cast<> isn't safe, because
-// how do you know the pointer is really of type SubclassOfFoo?  It
-// could be a bare Foo, or of type DifferentSubclassOfFoo.  Thus,
-// when you downcast, you should use this macro.  In debug mode, we
-// use dynamic_cast<> to double-check the downcast is legal (we die
-// if it's not).  In normal mode, we do the efficient static_cast<>
-// instead.  Thus, it's important to test in debug mode to make sure
-// the cast is legal!
-//    This is the only place in the code we should use dynamic_cast<>.
-// In particular, you SHOULDN'T be using dynamic_cast<> in order to
-// do RTTI (eg code like this:
-//    if (dynamic_cast<Subclass1>(foo)) HandleASubclass1Object(foo);
-//    if (dynamic_cast<Subclass2>(foo)) HandleASubclass2Object(foo);
-// You should design the code some other way not to need this.
-
-template<typename To, typename From>     // use like this: down_cast<T*>(foo);
-inline To down_cast(From* f) {                   // so we only accept pointers
-  // Ensures that To is a sub-type of From *.  This test is here only
-  // for compile-time type checking, and has no overhead in an
-  // optimized build at run-time, as it will be optimized away
-  // completely.
-  if (false) {
-    implicit_cast<From*, To>(0);
-  }
-
-#if !defined(NDEBUG) && !defined(GOOGLE_PROTOBUF_NO_RTTI)
-  assert(f == NULL || dynamic_cast<To>(f) != NULL);  // RTTI: debug mode only!
-#endif
-  return static_cast<To>(f);
-}
-
-}  // namespace internal
-
-// We made these internal so that they would show up as such in the docs,
-// but we don't want to stick "internal::" in front of them everywhere.
-using internal::implicit_cast;
-using internal::down_cast;
-
-// The COMPILE_ASSERT macro can be used to verify that a compile time
-// expression is true. For example, you could use it to verify the
-// size of a static array:
-//
-//   COMPILE_ASSERT(ARRAYSIZE(content_type_names) == CONTENT_NUM_TYPES,
-//                  content_type_names_incorrect_size);
-//
-// or to make sure a struct is smaller than a certain size:
-//
-//   COMPILE_ASSERT(sizeof(foo) < 128, foo_too_large);
-//
-// The second argument to the macro is the name of the variable. If
-// the expression is false, most compilers will issue a warning/error
-// containing the name of the variable.
-
-namespace internal {
-
-template <bool>
-struct CompileAssert {
-};
-
-}  // namespace internal
-
-#undef GOOGLE_COMPILE_ASSERT
-#define GOOGLE_COMPILE_ASSERT(expr, msg) \
-  typedef ::google::protobuf::internal::CompileAssert<(bool(expr))> \
-          msg[bool(expr) ? 1 : -1]
-
-
-// Implementation details of COMPILE_ASSERT:
-//
-// - COMPILE_ASSERT works by defining an array type that has -1
-//   elements (and thus is invalid) when the expression is false.
-//
-// - The simpler definition
-//
-//     #define COMPILE_ASSERT(expr, msg) typedef char msg[(expr) ? 1 : -1]
-//
-//   does not work, as gcc supports variable-length arrays whose sizes
-//   are determined at run-time (this is gcc's extension and not part
-//   of the C++ standard).  As a result, gcc fails to reject the
-//   following code with the simple definition:
-//
-//     int foo;
-//     COMPILE_ASSERT(foo, msg); // not supposed to compile as foo is
-//                               // not a compile-time constant.
-//
-// - By using the type CompileAssert<(bool(expr))>, we ensures that
-//   expr is a compile-time constant.  (Template arguments must be
-//   determined at compile-time.)
-//
-// - The outter parentheses in CompileAssert<(bool(expr))> are necessary
-//   to work around a bug in gcc 3.4.4 and 4.0.1.  If we had written
-//
-//     CompileAssert<bool(expr)>
-//
-//   instead, these compilers will refuse to compile
-//
-//     COMPILE_ASSERT(5 > 0, some_message);
-//
-//   (They seem to think the ">" in "5 > 0" marks the end of the
-//   template argument list.)
-//
-// - The array size is (bool(expr) ? 1 : -1), instead of simply
-//
-//     ((expr) ? 1 : -1).
-//
-//   This is to avoid running into a bug in MS VC 7.1, which
-//   causes ((0.0) ? 1 : -1) to incorrectly evaluate to 1.
-
-// ===================================================================
-// from google3/base/scoped_ptr.h
-
-namespace internal {
-
-//  This is an implementation designed to match the anticipated future TR2
-//  implementation of the scoped_ptr class, and its closely-related brethren,
-//  scoped_array, scoped_ptr_malloc, and make_scoped_ptr.
-
-template <class C> class scoped_ptr;
-template <class C> class scoped_array;
-
-// A scoped_ptr<T> is like a T*, except that the destructor of scoped_ptr<T>
-// automatically deletes the pointer it holds (if any).
-// That is, scoped_ptr<T> owns the T object that it points to.
-// Like a T*, a scoped_ptr<T> may hold either NULL or a pointer to a T object.
-//
-// The size of a scoped_ptr is small:
-// sizeof(scoped_ptr<C>) == sizeof(C*)
-template <class C>
-class scoped_ptr {
- public:
-
-  // The element type
-  typedef C element_type;
-
-  // Constructor.  Defaults to intializing with NULL.
-  // There is no way to create an uninitialized scoped_ptr.
-  // The input parameter must be allocated with new.
-  explicit scoped_ptr(C* p = NULL) : ptr_(p) { }
-
-  // Destructor.  If there is a C object, delete it.
-  // We don't need to test ptr_ == NULL because C++ does that for us.
-  ~scoped_ptr() {
-    enum { type_must_be_complete = sizeof(C) };
-    delete ptr_;
-  }
-
-  // Reset.  Deletes the current owned object, if any.
-  // Then takes ownership of a new object, if given.
-  // this->reset(this->get()) works.
-  void reset(C* p = NULL) {
-    if (p != ptr_) {
-      enum { type_must_be_complete = sizeof(C) };
-      delete ptr_;
-      ptr_ = p;
-    }
-  }
-
-  // Accessors to get the owned object.
-  // operator* and operator-> will assert() if there is no current object.
-  C& operator*() const {
-    assert(ptr_ != NULL);
-    return *ptr_;
-  }
-  C* operator->() const  {
-    assert(ptr_ != NULL);
-    return ptr_;
-  }
-  C* get() const { return ptr_; }
-
-  // Comparison operators.
-  // These return whether two scoped_ptr refer to the same object, not just to
-  // two different but equal objects.
-  bool operator==(C* p) const { return ptr_ == p; }
-  bool operator!=(C* p) const { return ptr_ != p; }
-
-  // Swap two scoped pointers.
-  void swap(scoped_ptr& p2) {
-    C* tmp = ptr_;
-    ptr_ = p2.ptr_;
-    p2.ptr_ = tmp;
-  }
-
-  // Release a pointer.
-  // The return value is the current pointer held by this object.
-  // If this object holds a NULL pointer, the return value is NULL.
-  // After this operation, this object will hold a NULL pointer,
-  // and will not own the object any more.
-  C* release() {
-    C* retVal = ptr_;
-    ptr_ = NULL;
-    return retVal;
-  }
-
- private:
-  C* ptr_;
-
-  // Forbid comparison of scoped_ptr types.  If C2 != C, it totally doesn't
-  // make sense, and if C2 == C, it still doesn't make sense because you should
-  // never have the same object owned by two different scoped_ptrs.
-  template <class C2> bool operator==(scoped_ptr<C2> const& p2) const;
-  template <class C2> bool operator!=(scoped_ptr<C2> const& p2) const;
-
-  // Disallow evil constructors
-  scoped_ptr(const scoped_ptr&);
-  void operator=(const scoped_ptr&);
-};
-
-// scoped_array<C> is like scoped_ptr<C>, except that the caller must allocate
-// with new [] and the destructor deletes objects with delete [].
-//
-// As with scoped_ptr<C>, a scoped_array<C> either points to an object
-// or is NULL.  A scoped_array<C> owns the object that it points to.
-//
-// Size: sizeof(scoped_array<C>) == sizeof(C*)
-template <class C>
-class scoped_array {
- public:
-
-  // The element type
-  typedef C element_type;
-
-  // Constructor.  Defaults to intializing with NULL.
-  // There is no way to create an uninitialized scoped_array.
-  // The input parameter must be allocated with new [].
-  explicit scoped_array(C* p = NULL) : array_(p) { }
-
-  // Destructor.  If there is a C object, delete it.
-  // We don't need to test ptr_ == NULL because C++ does that for us.
-  ~scoped_array() {
-    enum { type_must_be_complete = sizeof(C) };
-    delete[] array_;
-  }
-
-  // Reset.  Deletes the current owned object, if any.
-  // Then takes ownership of a new object, if given.
-  // this->reset(this->get()) works.
-  void reset(C* p = NULL) {
-    if (p != array_) {
-      enum { type_must_be_complete = sizeof(C) };
-      delete[] array_;
-      array_ = p;
-    }
-  }
-
-  // Get one element of the current object.
-  // Will assert() if there is no current object, or index i is negative.
-  C& operator[](std::ptrdiff_t i) const {
-    assert(i >= 0);
-    assert(array_ != NULL);
-    return array_[i];
-  }
-
-  // Get a pointer to the zeroth element of the current object.
-  // If there is no current object, return NULL.
-  C* get() const {
-    return array_;
-  }
-
-  // Comparison operators.
-  // These return whether two scoped_array refer to the same object, not just to
-  // two different but equal objects.
-  bool operator==(C* p) const { return array_ == p; }
-  bool operator!=(C* p) const { return array_ != p; }
-
-  // Swap two scoped arrays.
-  void swap(scoped_array& p2) {
-    C* tmp = array_;
-    array_ = p2.array_;
-    p2.array_ = tmp;
-  }
-
-  // Release an array.
-  // The return value is the current pointer held by this object.
-  // If this object holds a NULL pointer, the return value is NULL.
-  // After this operation, this object will hold a NULL pointer,
-  // and will not own the object any more.
-  C* release() {
-    C* retVal = array_;
-    array_ = NULL;
-    return retVal;
-  }
-
- private:
-  C* array_;
-
-  // Forbid comparison of different scoped_array types.
-  template <class C2> bool operator==(scoped_array<C2> const& p2) const;
-  template <class C2> bool operator!=(scoped_array<C2> const& p2) const;
-
-  // Disallow evil constructors
-  scoped_array(const scoped_array&);
-  void operator=(const scoped_array&);
-};
-
-}  // namespace internal
-
-// We made these internal so that they would show up as such in the docs,
-// but we don't want to stick "internal::" in front of them everywhere.
-using internal::scoped_ptr;
-using internal::scoped_array;
-
-// ===================================================================
-// emulates google3/base/logging.h
-
-enum LogLevel {
-  LOGLEVEL_INFO,     // Informational.  This is never actually used by
-                     // libprotobuf.
-  LOGLEVEL_WARNING,  // Warns about issues that, although not technically a
-                     // problem now, could cause problems in the future.  For
-                     // example, a // warning will be printed when parsing a
-                     // message that is near the message size limit.
-  LOGLEVEL_ERROR,    // An error occurred which should never happen during
-                     // normal use.
-  LOGLEVEL_FATAL,    // An error occurred from which the library cannot
-                     // recover.  This usually indicates a programming error
-                     // in the code which calls the library, especially when
-                     // compiled in debug mode.
-
-#ifdef NDEBUG
-  LOGLEVEL_DFATAL = LOGLEVEL_ERROR
-#else
-  LOGLEVEL_DFATAL = LOGLEVEL_FATAL
-#endif
-};
-
-namespace internal {
-
-class LogFinisher;
-
-class LIBPROTOBUF_EXPORT LogMessage {
- public:
-  LogMessage(LogLevel level, const char* filename, int line);
-  ~LogMessage();
-
-  LogMessage& operator<<(const std::string& value);
-  LogMessage& operator<<(const char* value);
-  LogMessage& operator<<(char value);
-  LogMessage& operator<<(int value);
-  LogMessage& operator<<(uint value);
-  LogMessage& operator<<(long value);
-  LogMessage& operator<<(unsigned long value);
-  LogMessage& operator<<(double value);
-
- private:
-  friend class LogFinisher;
-  void Finish();
-
-  LogLevel level_;
-  const char* filename_;
-  int line_;
-  std::string message_;
-};
-
-// Used to make the entire "LOG(BLAH) << etc." expression have a void return
-// type and print a newline after each message.
-class LIBPROTOBUF_EXPORT LogFinisher {
- public:
-  void operator=(LogMessage& other);
-};
-
-}  // namespace internal
-
-// Undef everything in case we're being mixed with some other Google library
-// which already defined them itself.  Presumably all Google libraries will
-// support the same syntax for these so it should not be a big deal if they
-// end up using our definitions instead.
-#undef GOOGLE_LOG
-#undef GOOGLE_LOG_IF
-
-#undef GOOGLE_CHECK
-#undef GOOGLE_CHECK_EQ
-#undef GOOGLE_CHECK_NE
-#undef GOOGLE_CHECK_LT
-#undef GOOGLE_CHECK_LE
-#undef GOOGLE_CHECK_GT
-#undef GOOGLE_CHECK_GE
-#undef GOOGLE_CHECK_NOTNULL
-
-#undef GOOGLE_DLOG
-#undef GOOGLE_DCHECK
-#undef GOOGLE_DCHECK_EQ
-#undef GOOGLE_DCHECK_NE
-#undef GOOGLE_DCHECK_LT
-#undef GOOGLE_DCHECK_LE
-#undef GOOGLE_DCHECK_GT
-#undef GOOGLE_DCHECK_GE
-
-#define GOOGLE_LOG(LEVEL)                                                 \
-  ::google::protobuf::internal::LogFinisher() =                           \
-    ::google::protobuf::internal::LogMessage(                             \
-      ::google::protobuf::LOGLEVEL_##LEVEL, __FILE__, __LINE__)
-#define GOOGLE_LOG_IF(LEVEL, CONDITION) \
-  !(CONDITION) ? (void)0 : GOOGLE_LOG(LEVEL)
-
-#define GOOGLE_CHECK(EXPRESSION) \
-  GOOGLE_LOG_IF(FATAL, !(EXPRESSION)) << "CHECK failed: " #EXPRESSION ": "
-#define GOOGLE_CHECK_EQ(A, B) GOOGLE_CHECK((A) == (B))
-#define GOOGLE_CHECK_NE(A, B) GOOGLE_CHECK((A) != (B))
-#define GOOGLE_CHECK_LT(A, B) GOOGLE_CHECK((A) <  (B))
-#define GOOGLE_CHECK_LE(A, B) GOOGLE_CHECK((A) <= (B))
-#define GOOGLE_CHECK_GT(A, B) GOOGLE_CHECK((A) >  (B))
-#define GOOGLE_CHECK_GE(A, B) GOOGLE_CHECK((A) >= (B))
-
-namespace internal {
-template<typename T>
-T* CheckNotNull(const char *file, int line, const char *name, T* val) {
-  if (val == NULL) {
-    GOOGLE_LOG(FATAL) << name;
-  }
-  return val;
-}
-}  // namespace internal
-#define GOOGLE_CHECK_NOTNULL(A) \
-  internal::CheckNotNull(__FILE__, __LINE__, "'" #A "' must not be NULL", (A))
-
-#ifdef NDEBUG
-
-#define GOOGLE_DLOG GOOGLE_LOG_IF(INFO, false)
-
-#define GOOGLE_DCHECK(EXPRESSION) while(false) GOOGLE_CHECK(EXPRESSION)
-#define GOOGLE_DCHECK_EQ(A, B) GOOGLE_DCHECK((A) == (B))
-#define GOOGLE_DCHECK_NE(A, B) GOOGLE_DCHECK((A) != (B))
-#define GOOGLE_DCHECK_LT(A, B) GOOGLE_DCHECK((A) <  (B))
-#define GOOGLE_DCHECK_LE(A, B) GOOGLE_DCHECK((A) <= (B))
-#define GOOGLE_DCHECK_GT(A, B) GOOGLE_DCHECK((A) >  (B))
-#define GOOGLE_DCHECK_GE(A, B) GOOGLE_DCHECK((A) >= (B))
-
-#else  // NDEBUG
-
-#define GOOGLE_DLOG GOOGLE_LOG
-
-#define GOOGLE_DCHECK    GOOGLE_CHECK
-#define GOOGLE_DCHECK_EQ GOOGLE_CHECK_EQ
-#define GOOGLE_DCHECK_NE GOOGLE_CHECK_NE
-#define GOOGLE_DCHECK_LT GOOGLE_CHECK_LT
-#define GOOGLE_DCHECK_LE GOOGLE_CHECK_LE
-#define GOOGLE_DCHECK_GT GOOGLE_CHECK_GT
-#define GOOGLE_DCHECK_GE GOOGLE_CHECK_GE
-
-#endif  // !NDEBUG
-
-typedef void LogHandler(LogLevel level, const char* filename, int line,
-                        const std::string& message);
-
-// The protobuf library sometimes writes warning and error messages to
-// stderr.  These messages are primarily useful for developers, but may
-// also help end users figure out a problem.  If you would prefer that
-// these messages be sent somewhere other than stderr, call SetLogHandler()
-// to set your own handler.  This returns the old handler.  Set the handler
-// to NULL to ignore log messages (but see also LogSilencer, below).
-//
-// Obviously, SetLogHandler is not thread-safe.  You should only call it
-// at initialization time, and probably not from library code.  If you
-// simply want to suppress log messages temporarily (e.g. because you
-// have some code that tends to trigger them frequently and you know
-// the warnings are not important to you), use the LogSilencer class
-// below.
-LIBPROTOBUF_EXPORT LogHandler* SetLogHandler(LogHandler* new_func);
-
-// Create a LogSilencer if you want to temporarily suppress all log
-// messages.  As long as any LogSilencer objects exist, non-fatal
-// log messages will be discarded (the current LogHandler will *not*
-// be called).  Constructing a LogSilencer is thread-safe.  You may
-// accidentally suppress log messages occurring in another thread, but
-// since messages are generally for debugging purposes only, this isn't
-// a big deal.  If you want to intercept log messages, use SetLogHandler().
-class LIBPROTOBUF_EXPORT LogSilencer {
- public:
-  LogSilencer();
-  ~LogSilencer();
-};
-
-// ===================================================================
-// emulates google3/base/callback.h
-
-// Abstract interface for a callback.  When calling an RPC, you must provide
-// a Closure to call when the procedure completes.  See the Service interface
-// in service.h.
-//
-// To automatically construct a Closure which calls a particular function or
-// method with a particular set of parameters, use the NewCallback() function.
-// Example:
-//   void FooDone(const FooResponse* response) {
-//     ...
-//   }
-//
-//   void CallFoo() {
-//     ...
-//     // When done, call FooDone() and pass it a pointer to the response.
-//     Closure* callback = NewCallback(&FooDone, response);
-//     // Make the call.
-//     service->Foo(controller, request, response, callback);
-//   }
-//
-// Example that calls a method:
-//   class Handler {
-//    public:
-//     ...
-//
-//     void FooDone(const FooResponse* response) {
-//       ...
-//     }
-//
-//     void CallFoo() {
-//       ...
-//       // When done, call FooDone() and pass it a pointer to the response.
-//       Closure* callback = NewCallback(this, &Handler::FooDone, response);
-//       // Make the call.
-//       service->Foo(controller, request, response, callback);
-//     }
-//   };
-//
-// Currently NewCallback() supports binding zero, one, or two arguments.
-//
-// Callbacks created with NewCallback() automatically delete themselves when
-// executed.  They should be used when a callback is to be called exactly
-// once (usually the case with RPC callbacks).  If a callback may be called
-// a different number of times (including zero), create it with
-// NewPermanentCallback() instead.  You are then responsible for deleting the
-// callback (using the "delete" keyword as normal).
-//
-// Note that NewCallback() is a bit touchy regarding argument types.  Generally,
-// the values you provide for the parameter bindings must exactly match the
-// types accepted by the callback function.  For example:
-//   void Foo(string s);
-//   NewCallback(&Foo, "foo");          // WON'T WORK:  const char* != string
-//   NewCallback(&Foo, string("foo"));  // WORKS
-// Also note that the arguments cannot be references:
-//   void Foo(const string& s);
-//   string my_str;
-//   NewCallback(&Foo, my_str);  // WON'T WORK:  Can't use referecnes.
-// However, correctly-typed pointers will work just fine.
-class LIBPROTOBUF_EXPORT Closure {
- public:
-  Closure() {}
-  virtual ~Closure();
-
-  virtual void Run() = 0;
-
- private:
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Closure);
-};
-
-namespace internal {
-
-class LIBPROTOBUF_EXPORT FunctionClosure0 : public Closure {
- public:
-  typedef void (*FunctionType)();
-
-  FunctionClosure0(FunctionType function, bool self_deleting)
-    : function_(function), self_deleting_(self_deleting) {}
-  ~FunctionClosure0();
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    function_();
-    if (needs_delete) delete this;
-  }
-
- private:
-  FunctionType function_;
-  bool self_deleting_;
-};
-
-template <typename Class>
-class MethodClosure0 : public Closure {
- public:
-  typedef void (Class::*MethodType)();
-
-  MethodClosure0(Class* object, MethodType method, bool self_deleting)
-    : object_(object), method_(method), self_deleting_(self_deleting) {}
-  ~MethodClosure0() {}
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    (object_->*method_)();
-    if (needs_delete) delete this;
-  }
-
- private:
-  Class* object_;
-  MethodType method_;
-  bool self_deleting_;
-};
-
-template <typename Arg1>
-class FunctionClosure1 : public Closure {
- public:
-  typedef void (*FunctionType)(Arg1 arg1);
-
-  FunctionClosure1(FunctionType function, bool self_deleting,
-                   Arg1 arg1)
-    : function_(function), self_deleting_(self_deleting),
-      arg1_(arg1) {}
-  ~FunctionClosure1() {}
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    function_(arg1_);
-    if (needs_delete) delete this;
-  }
-
- private:
-  FunctionType function_;
-  bool self_deleting_;
-  Arg1 arg1_;
-};
-
-template <typename Class, typename Arg1>
-class MethodClosure1 : public Closure {
- public:
-  typedef void (Class::*MethodType)(Arg1 arg1);
-
-  MethodClosure1(Class* object, MethodType method, bool self_deleting,
-                 Arg1 arg1)
-    : object_(object), method_(method), self_deleting_(self_deleting),
-      arg1_(arg1) {}
-  ~MethodClosure1() {}
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    (object_->*method_)(arg1_);
-    if (needs_delete) delete this;
-  }
-
- private:
-  Class* object_;
-  MethodType method_;
-  bool self_deleting_;
-  Arg1 arg1_;
-};
-
-template <typename Arg1, typename Arg2>
-class FunctionClosure2 : public Closure {
- public:
-  typedef void (*FunctionType)(Arg1 arg1, Arg2 arg2);
-
-  FunctionClosure2(FunctionType function, bool self_deleting,
-                   Arg1 arg1, Arg2 arg2)
-    : function_(function), self_deleting_(self_deleting),
-      arg1_(arg1), arg2_(arg2) {}
-  ~FunctionClosure2() {}
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    function_(arg1_, arg2_);
-    if (needs_delete) delete this;
-  }
-
- private:
-  FunctionType function_;
-  bool self_deleting_;
-  Arg1 arg1_;
-  Arg2 arg2_;
-};
-
-template <typename Class, typename Arg1, typename Arg2>
-class MethodClosure2 : public Closure {
- public:
-  typedef void (Class::*MethodType)(Arg1 arg1, Arg2 arg2);
-
-  MethodClosure2(Class* object, MethodType method, bool self_deleting,
-                 Arg1 arg1, Arg2 arg2)
-    : object_(object), method_(method), self_deleting_(self_deleting),
-      arg1_(arg1), arg2_(arg2) {}
-  ~MethodClosure2() {}
-
-  void Run() {
-    bool needs_delete = self_deleting_;  // read in case callback deletes
-    (object_->*method_)(arg1_, arg2_);
-    if (needs_delete) delete this;
-  }
-
- private:
-  Class* object_;
-  MethodType method_;
-  bool self_deleting_;
-  Arg1 arg1_;
-  Arg2 arg2_;
-};
-
-}  // namespace internal
-
-// See Closure.
-inline Closure* NewCallback(void (*function)()) {
-  return new internal::FunctionClosure0(function, true);
-}
-
-// See Closure.
-inline Closure* NewPermanentCallback(void (*function)()) {
-  return new internal::FunctionClosure0(function, false);
-}
-
-// See Closure.
-template <typename Class>
-inline Closure* NewCallback(Class* object, void (Class::*method)()) {
-  return new internal::MethodClosure0<Class>(object, method, true);
-}
-
-// See Closure.
-template <typename Class>
-inline Closure* NewPermanentCallback(Class* object, void (Class::*method)()) {
-  return new internal::MethodClosure0<Class>(object, method, false);
-}
-
-// See Closure.
-template <typename Arg1>
-inline Closure* NewCallback(void (*function)(Arg1),
-                            Arg1 arg1) {
-  return new internal::FunctionClosure1<Arg1>(function, true, arg1);
-}
-
-// See Closure.
-template <typename Arg1>
-inline Closure* NewPermanentCallback(void (*function)(Arg1),
-                                     Arg1 arg1) {
-  return new internal::FunctionClosure1<Arg1>(function, false, arg1);
-}
-
-// See Closure.
-template <typename Class, typename Arg1>
-inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1),
-                            Arg1 arg1) {
-  return new internal::MethodClosure1<Class, Arg1>(object, method, true, arg1);
-}
-
-// See Closure.
-template <typename Class, typename Arg1>
-inline Closure* NewPermanentCallback(Class* object, void (Class::*method)(Arg1),
-                                     Arg1 arg1) {
-  return new internal::MethodClosure1<Class, Arg1>(object, method, false, arg1);
-}
-
-// See Closure.
-template <typename Arg1, typename Arg2>
-inline Closure* NewCallback(void (*function)(Arg1, Arg2),
-                            Arg1 arg1, Arg2 arg2) {
-  return new internal::FunctionClosure2<Arg1, Arg2>(
-    function, true, arg1, arg2);
-}
-
-// See Closure.
-template <typename Arg1, typename Arg2>
-inline Closure* NewPermanentCallback(void (*function)(Arg1, Arg2),
-                                     Arg1 arg1, Arg2 arg2) {
-  return new internal::FunctionClosure2<Arg1, Arg2>(
-    function, false, arg1, arg2);
-}
-
-// See Closure.
-template <typename Class, typename Arg1, typename Arg2>
-inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1, Arg2),
-                            Arg1 arg1, Arg2 arg2) {
-  return new internal::MethodClosure2<Class, Arg1, Arg2>(
-    object, method, true, arg1, arg2);
-}
-
-// See Closure.
-template <typename Class, typename Arg1, typename Arg2>
-inline Closure* NewPermanentCallback(
-    Class* object, void (Class::*method)(Arg1, Arg2),
-    Arg1 arg1, Arg2 arg2) {
-  return new internal::MethodClosure2<Class, Arg1, Arg2>(
-    object, method, false, arg1, arg2);
-}
-
-// A function which does nothing.  Useful for creating no-op callbacks, e.g.:
-//   Closure* nothing = NewCallback(&DoNothing);
-void LIBPROTOBUF_EXPORT DoNothing();
-
-// ===================================================================
-// emulates google3/base/mutex.h
-
-namespace internal {
-
-// A Mutex is a non-reentrant (aka non-recursive) mutex.  At most one thread T
-// may hold a mutex at a given time.  If T attempts to Lock() the same Mutex
-// while holding it, T will deadlock.
-class LIBPROTOBUF_EXPORT Mutex {
- public:
-  // Create a Mutex that is not held by anybody.
-  Mutex();
-
-  // Destructor
-  ~Mutex();
-
-  // Block if necessary until this Mutex is free, then acquire it exclusively.
-  void Lock();
-
-  // Release this Mutex.  Caller must hold it exclusively.
-  void Unlock();
-
-  // Crash if this Mutex is not held exclusively by this thread.
-  // May fail to crash when it should; will never crash when it should not.
-  void AssertHeld();
-
- private:
-  struct Internal;
-  Internal* mInternal;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Mutex);
-};
-
-// MutexLock(mu) acquires mu when constructed and releases it when destroyed.
-class LIBPROTOBUF_EXPORT MutexLock {
- public:
-  explicit MutexLock(Mutex *mu) : mu_(mu) { this->mu_->Lock(); }
-  ~MutexLock() { this->mu_->Unlock(); }
- private:
-  Mutex *const mu_;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MutexLock);
-};
-
-// TODO(kenton):  Implement these?  Hard to implement portably.
-typedef MutexLock ReaderMutexLock;
-typedef MutexLock WriterMutexLock;
-
-// MutexLockMaybe is like MutexLock, but is a no-op when mu is NULL.
-class LIBPROTOBUF_EXPORT MutexLockMaybe {
- public:
-  explicit MutexLockMaybe(Mutex *mu) :
-    mu_(mu) { if (this->mu_ != NULL) { this->mu_->Lock(); } }
-  ~MutexLockMaybe() { if (this->mu_ != NULL) { this->mu_->Unlock(); } }
- private:
-  Mutex *const mu_;
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(MutexLockMaybe);
-};
-
-}  // namespace internal
-
-// We made these internal so that they would show up as such in the docs,
-// but we don't want to stick "internal::" in front of them everywhere.
-using internal::Mutex;
-using internal::MutexLock;
-using internal::ReaderMutexLock;
-using internal::WriterMutexLock;
-using internal::MutexLockMaybe;
-
-// ===================================================================
-// from google3/util/utf8/public/unilib.h
-
-namespace internal {
-
-// Checks if the buffer contains structurally-valid UTF-8.  Implemented in
-// structurally_valid.cc.
-LIBPROTOBUF_EXPORT bool IsStructurallyValidUTF8(const char* buf, int len);
-
-}  // namespace internal
-
-// ===================================================================
-// from google3/util/endian/endian.h
-LIBPROTOBUF_EXPORT uint32 ghtonl(uint32 x);
-
-// ===================================================================
-// Shutdown support.
-
-// Shut down the entire protocol buffers library, deleting all static-duration
-// objects allocated by the library or by generated .pb.cc files.
-//
-// There are two reasons you might want to call this:
-// * You use a draconian definition of "memory leak" in which you expect
-//   every single malloc() to have a corresponding free(), even for objects
-//   which live until program exit.
-// * You are writing a dynamically-loaded library which needs to clean up
-//   after itself when the library is unloaded.
-//
-// It is safe to call this multiple times.  However, it is not safe to use
-// any other part of the protocol buffers library after
-// ShutdownProtobufLibrary() has been called.
-LIBPROTOBUF_EXPORT void ShutdownProtobufLibrary();
-
-namespace internal {
-
-// Register a function to be called when ShutdownProtocolBuffers() is called.
-LIBPROTOBUF_EXPORT void OnShutdown(void (*func)());
-
-}  // namespace internal
-
-#if PROTOBUF_USE_EXCEPTIONS
-class FatalException : public std::exception {
- public:
-  FatalException(const char* filename, int line, const std::string& message)
-      : filename_(filename), line_(line), message_(message) {}
-  virtual ~FatalException() throw();
-
-  virtual const char* what() const throw();
-
-  const char* filename() const { return filename_; }
-  int line() const { return line_; }
-  const std::string& message() const { return message_; }
-
- private:
-  const char* filename_;
-  const int line_;
-  const std::string message_;
-};
-#endif
-
-// This is at the end of the file instead of the beginning to work around a bug
-// in some versions of MSVC.
-using namespace std;  // Don't do this at home, kids.
-
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_COMMON_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/once.h b/ps-lite/deps/include/google/protobuf/stubs/once.h
deleted file mode 100644
index 7fbc117f..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/once.h
+++ /dev/null
@@ -1,148 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//
-// emulates google3/base/once.h
-//
-// This header is intended to be included only by internal .cc files and
-// generated .pb.cc files.  Users should not use this directly.
-//
-// This is basically a portable version of pthread_once().
-//
-// This header declares:
-// * A type called ProtobufOnceType.
-// * A macro GOOGLE_PROTOBUF_DECLARE_ONCE() which declares a variable of type
-//   ProtobufOnceType.  This is the only legal way to declare such a variable.
-//   The macro may only be used at the global scope (you cannot create local or
-//   class member variables of this type).
-// * A function GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()).
-//   This function, when invoked multiple times given the same ProtobufOnceType
-//   object, will invoke init_func on the first call only, and will make sure
-//   none of the calls return before that first call to init_func has finished.
-// * The user can provide a parameter which GoogleOnceInit() forwards to the
-//   user-provided function when it is called. Usage example:
-//     int a = 10;
-//     GoogleOnceInit(&my_once, &MyFunctionExpectingIntArgument, &a);
-// * This implementation guarantees that ProtobufOnceType is a POD (i.e. no
-//   static initializer generated).
-//
-// This implements a way to perform lazy initialization.  It's more efficient
-// than using mutexes as no lock is needed if initialization has already
-// happened.
-//
-// Example usage:
-//   void Init();
-//   GOOGLE_PROTOBUF_DECLARE_ONCE(once_init);
-//
-//   // Calls Init() exactly once.
-//   void InitOnce() {
-//     GoogleOnceInit(&once_init, &Init);
-//   }
-//
-// Note that if GoogleOnceInit() is called before main() has begun, it must
-// only be called by the thread that will eventually call main() -- that is,
-// the thread that performs dynamic initialization.  In general this is a safe
-// assumption since people don't usually construct threads before main() starts,
-// but it is technically not guaranteed.  Unfortunately, Win32 provides no way
-// whatsoever to statically-initialize its synchronization primitives, so our
-// only choice is to assume that dynamic initialization is single-threaded.
-
-#ifndef GOOGLE_PROTOBUF_STUBS_ONCE_H__
-#define GOOGLE_PROTOBUF_STUBS_ONCE_H__
-
-#include <google/protobuf/stubs/atomicops.h>
-#include <google/protobuf/stubs/common.h>
-
-namespace google {
-namespace protobuf {
-
-#ifdef GOOGLE_PROTOBUF_NO_THREAD_SAFETY
-
-typedef bool ProtobufOnceType;
-
-#define GOOGLE_PROTOBUF_ONCE_INIT false
-
-inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {
-  if (!*once) {
-    *once = true;
-    init_func();
-  }
-}
-
-template <typename Arg>
-inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg),
-    Arg arg) {
-  if (!*once) {
-    *once = true;
-    init_func(arg);
-  }
-}
-
-#else
-
-enum {
-  ONCE_STATE_UNINITIALIZED = 0,
-  ONCE_STATE_EXECUTING_CLOSURE = 1,
-  ONCE_STATE_DONE = 2
-};
-
-typedef internal::AtomicWord ProtobufOnceType;
-
-#define GOOGLE_PROTOBUF_ONCE_INIT ::google::protobuf::ONCE_STATE_UNINITIALIZED
-
-LIBPROTOBUF_EXPORT
-void GoogleOnceInitImpl(ProtobufOnceType* once, Closure* closure);
-
-inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {
-  if (internal::Acquire_Load(once) != ONCE_STATE_DONE) {
-    internal::FunctionClosure0 func(init_func, false);
-    GoogleOnceInitImpl(once, &func);
-  }
-}
-
-template <typename Arg>
-inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg*),
-    Arg* arg) {
-  if (internal::Acquire_Load(once) != ONCE_STATE_DONE) {
-    internal::FunctionClosure1<Arg*> func(init_func, false, arg);
-    GoogleOnceInitImpl(once, &func);
-  }
-}
-
-#endif  // GOOGLE_PROTOBUF_NO_THREAD_SAFETY
-
-#define GOOGLE_PROTOBUF_DECLARE_ONCE(NAME) \
-  ::google::protobuf::ProtobufOnceType NAME = GOOGLE_PROTOBUF_ONCE_INIT
-
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_STUBS_ONCE_H__
diff --git a/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h b/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
deleted file mode 100644
index b1df60e4..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/platform_macros.h
+++ /dev/null
@@ -1,70 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2012 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-#ifndef GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
-#define GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
-
-#include <google/protobuf/stubs/common.h>
-
-// Processor architecture detection.  For more info on what's defined, see:
-//   http://msdn.microsoft.com/en-us/library/b0084kay.aspx
-//   http://www.agner.org/optimize/calling_conventions.pdf
-//   or with gcc, run: "echo | gcc -E -dM -"
-#if defined(_M_X64) || defined(__x86_64__)
-#define GOOGLE_PROTOBUF_ARCH_X64 1
-#define GOOGLE_PROTOBUF_ARCH_64_BIT 1
-#elif defined(_M_IX86) || defined(__i386__)
-#define GOOGLE_PROTOBUF_ARCH_IA32 1
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#elif defined(__QNX__)
-#define GOOGLE_PROTOBUF_ARCH_ARM_QNX 1
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#elif defined(__ARMEL__)
-#define GOOGLE_PROTOBUF_ARCH_ARM 1
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#elif defined(__MIPSEL__)
-#define GOOGLE_PROTOBUF_ARCH_MIPS 1
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#elif defined(__pnacl__)
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#elif defined(__ppc__)
-#define GOOGLE_PROTOBUF_ARCH_PPC 1
-#define GOOGLE_PROTOBUF_ARCH_32_BIT 1
-#else
-#error Host architecture was not detected as supported by protobuf
-#endif
-
-#if defined(__APPLE__)
-#define GOOGLE_PROTOBUF_OS_APPLE
-#elif defined(__native_client__)
-#define GOOGLE_PROTOBUF_OS_NACL
-#endif
-
-#endif  // GOOGLE_PROTOBUF_PLATFORM_MACROS_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/template_util.h b/ps-lite/deps/include/google/protobuf/stubs/template_util.h
deleted file mode 100644
index 4f30ffa3..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/template_util.h
+++ /dev/null
@@ -1,138 +0,0 @@
-// Copyright 2005 Google Inc.
-// All rights reserved.
-//
-// 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.
-
-// ----
-// Author: lar@google.com (Laramie Leavitt)
-//
-// Template metaprogramming utility functions.
-//
-// This code is compiled directly on many platforms, including client
-// platforms like Windows, Mac, and embedded systems.  Before making
-// any changes here, make sure that you're not breaking any platforms.
-//
-//
-// The names choosen here reflect those used in tr1 and the boost::mpl
-// library, there are similar operations used in the Loki library as
-// well.  I prefer the boost names for 2 reasons:
-// 1.  I think that portions of the Boost libraries are more likely to
-// be included in the c++ standard.
-// 2.  It is not impossible that some of the boost libraries will be
-// included in our own build in the future.
-// Both of these outcomes means that we may be able to directly replace
-// some of these with boost equivalents.
-//
-#ifndef GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
-#define GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// Types small_ and big_ are guaranteed such that sizeof(small_) <
-// sizeof(big_)
-typedef char small_;
-
-struct big_ {
-  char dummy[2];
-};
-
-// Identity metafunction.
-template <class T>
-struct identity_ {
-  typedef T type;
-};
-
-// integral_constant, defined in tr1, is a wrapper for an integer
-// value. We don't really need this generality; we could get away
-// with hardcoding the integer type to bool. We use the fully
-// general integer_constant for compatibility with tr1.
-
-template<class T, T v>
-struct integral_constant {
-  static const T value = v;
-  typedef T value_type;
-  typedef integral_constant<T, v> type;
-};
-
-template <class T, T v> const T integral_constant<T, v>::value;
-
-
-// Abbreviations: true_type and false_type are structs that represent boolean
-// true and false values. Also define the boost::mpl versions of those names,
-// true_ and false_.
-typedef integral_constant<bool, true>  true_type;
-typedef integral_constant<bool, false> false_type;
-typedef true_type  true_;
-typedef false_type false_;
-
-// if_ is a templatized conditional statement.
-// if_<cond, A, B> is a compile time evaluation of cond.
-// if_<>::type contains A if cond is true, B otherwise.
-template<bool cond, typename A, typename B>
-struct if_{
-  typedef A type;
-};
-
-template<typename A, typename B>
-struct if_<false, A, B> {
-  typedef B type;
-};
-
-
-// type_equals_ is a template type comparator, similar to Loki IsSameType.
-// type_equals_<A, B>::value is true iff "A" is the same type as "B".
-//
-// New code should prefer base::is_same, defined in base/type_traits.h.
-// It is functionally identical, but is_same is the standard spelling.
-template<typename A, typename B>
-struct type_equals_ : public false_ {
-};
-
-template<typename A>
-struct type_equals_<A, A> : public true_ {
-};
-
-// and_ is a template && operator.
-// and_<A, B>::value evaluates "A::value && B::value".
-template<typename A, typename B>
-struct and_ : public integral_constant<bool, (A::value && B::value)> {
-};
-
-// or_ is a template || operator.
-// or_<A, B>::value evaluates "A::value || B::value".
-template<typename A, typename B>
-struct or_ : public integral_constant<bool, (A::value || B::value)> {
-};
-
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_
diff --git a/ps-lite/deps/include/google/protobuf/stubs/type_traits.h b/ps-lite/deps/include/google/protobuf/stubs/type_traits.h
deleted file mode 100644
index e41f5e6f..00000000
--- a/ps-lite/deps/include/google/protobuf/stubs/type_traits.h
+++ /dev/null
@@ -1,336 +0,0 @@
-// Copyright (c) 2006, Google Inc.
-// All rights reserved.
-//
-// 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.
-
-// ----
-// Author: Matt Austern
-//
-// This code is compiled directly on many platforms, including client
-// platforms like Windows, Mac, and embedded systems.  Before making
-// any changes here, make sure that you're not breaking any platforms.
-//
-// Define a small subset of tr1 type traits. The traits we define are:
-//   is_integral
-//   is_floating_point
-//   is_pointer
-//   is_enum
-//   is_reference
-//   is_pod
-//   has_trivial_constructor
-//   has_trivial_copy
-//   has_trivial_assign
-//   has_trivial_destructor
-//   remove_const
-//   remove_volatile
-//   remove_cv
-//   remove_reference
-//   add_reference
-//   remove_pointer
-//   is_same
-//   is_convertible
-// We can add more type traits as required.
-
-#ifndef GOOGLE_PROTOBUF_TYPE_TRAITS_H_
-#define GOOGLE_PROTOBUF_TYPE_TRAITS_H_
-
-#include <utility>                  // For pair
-
-#include <google/protobuf/stubs/template_util.h>  // For true_type and false_type
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-template <class T> struct is_integral;
-template <class T> struct is_floating_point;
-template <class T> struct is_pointer;
-// MSVC can't compile this correctly, and neither can gcc 3.3.5 (at least)
-#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
-// is_enum uses is_convertible, which is not available on MSVC.
-template <class T> struct is_enum;
-#endif
-template <class T> struct is_reference;
-template <class T> struct is_pod;
-template <class T> struct has_trivial_constructor;
-template <class T> struct has_trivial_copy;
-template <class T> struct has_trivial_assign;
-template <class T> struct has_trivial_destructor;
-template <class T> struct remove_const;
-template <class T> struct remove_volatile;
-template <class T> struct remove_cv;
-template <class T> struct remove_reference;
-template <class T> struct add_reference;
-template <class T> struct remove_pointer;
-template <class T, class U> struct is_same;
-#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
-template <class From, class To> struct is_convertible;
-#endif
-
-// is_integral is false except for the built-in integer types. A
-// cv-qualified type is integral if and only if the underlying type is.
-template <class T> struct is_integral : false_type { };
-template<> struct is_integral<bool> : true_type { };
-template<> struct is_integral<char> : true_type { };
-template<> struct is_integral<unsigned char> : true_type { };
-template<> struct is_integral<signed char> : true_type { };
-#if defined(_MSC_VER)
-// wchar_t is not by default a distinct type from unsigned short in
-// Microsoft C.
-// See http://msdn2.microsoft.com/en-us/library/dh8che7s(VS.80).aspx
-template<> struct is_integral<__wchar_t> : true_type { };
-#else
-template<> struct is_integral<wchar_t> : true_type { };
-#endif
-template<> struct is_integral<short> : true_type { };
-template<> struct is_integral<unsigned short> : true_type { };
-template<> struct is_integral<int> : true_type { };
-template<> struct is_integral<unsigned int> : true_type { };
-template<> struct is_integral<long> : true_type { };
-template<> struct is_integral<unsigned long> : true_type { };
-#ifdef HAVE_LONG_LONG
-template<> struct is_integral<long long> : true_type { };
-template<> struct is_integral<unsigned long long> : true_type { };
-#endif
-template <class T> struct is_integral<const T> : is_integral<T> { };
-template <class T> struct is_integral<volatile T> : is_integral<T> { };
-template <class T> struct is_integral<const volatile T> : is_integral<T> { };
-
-// is_floating_point is false except for the built-in floating-point types.
-// A cv-qualified type is integral if and only if the underlying type is.
-template <class T> struct is_floating_point : false_type { };
-template<> struct is_floating_point<float> : true_type { };
-template<> struct is_floating_point<double> : true_type { };
-template<> struct is_floating_point<long double> : true_type { };
-template <class T> struct is_floating_point<const T>
-    : is_floating_point<T> { };
-template <class T> struct is_floating_point<volatile T>
-    : is_floating_point<T> { };
-template <class T> struct is_floating_point<const volatile T>
-    : is_floating_point<T> { };
-
-// is_pointer is false except for pointer types. A cv-qualified type (e.g.
-// "int* const", as opposed to "int const*") is cv-qualified if and only if
-// the underlying type is.
-template <class T> struct is_pointer : false_type { };
-template <class T> struct is_pointer<T*> : true_type { };
-template <class T> struct is_pointer<const T> : is_pointer<T> { };
-template <class T> struct is_pointer<volatile T> : is_pointer<T> { };
-template <class T> struct is_pointer<const volatile T> : is_pointer<T> { };
-
-#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
-
-namespace internal {
-
-template <class T> struct is_class_or_union {
-  template <class U> static small_ tester(void (U::*)());
-  template <class U> static big_ tester(...);
-  static const bool value = sizeof(tester<T>(0)) == sizeof(small_);
-};
-
-// is_convertible chokes if the first argument is an array. That's why
-// we use add_reference here.
-template <bool NotUnum, class T> struct is_enum_impl
-    : is_convertible<typename add_reference<T>::type, int> { };
-
-template <class T> struct is_enum_impl<true, T> : false_type { };
-
-}  // namespace internal
-
-// Specified by TR1 [4.5.1] primary type categories.
-
-// Implementation note:
-//
-// Each type is either void, integral, floating point, array, pointer,
-// reference, member object pointer, member function pointer, enum,
-// union or class. Out of these, only integral, floating point, reference,
-// class and enum types are potentially convertible to int. Therefore,
-// if a type is not a reference, integral, floating point or class and
-// is convertible to int, it's a enum. Adding cv-qualification to a type
-// does not change whether it's an enum.
-//
-// Is-convertible-to-int check is done only if all other checks pass,
-// because it can't be used with some types (e.g. void or classes with
-// inaccessible conversion operators).
-template <class T> struct is_enum
-    : internal::is_enum_impl<
-          is_same<T, void>::value ||
-              is_integral<T>::value ||
-              is_floating_point<T>::value ||
-              is_reference<T>::value ||
-              internal::is_class_or_union<T>::value,
-          T> { };
-
-template <class T> struct is_enum<const T> : is_enum<T> { };
-template <class T> struct is_enum<volatile T> : is_enum<T> { };
-template <class T> struct is_enum<const volatile T> : is_enum<T> { };
-
-#endif
-
-// is_reference is false except for reference types.
-template<typename T> struct is_reference : false_type {};
-template<typename T> struct is_reference<T&> : true_type {};
-
-
-// We can't get is_pod right without compiler help, so fail conservatively.
-// We will assume it's false except for arithmetic types, enumerations,
-// pointers and cv-qualified versions thereof. Note that std::pair<T,U>
-// is not a POD even if T and U are PODs.
-template <class T> struct is_pod
- : integral_constant<bool, (is_integral<T>::value ||
-                            is_floating_point<T>::value ||
-#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
-                            // is_enum is not available on MSVC.
-                            is_enum<T>::value ||
-#endif
-                            is_pointer<T>::value)> { };
-template <class T> struct is_pod<const T> : is_pod<T> { };
-template <class T> struct is_pod<volatile T> : is_pod<T> { };
-template <class T> struct is_pod<const volatile T> : is_pod<T> { };
-
-
-// We can't get has_trivial_constructor right without compiler help, so
-// fail conservatively. We will assume it's false except for: (1) types
-// for which is_pod is true. (2) std::pair of types with trivial
-// constructors. (3) array of a type with a trivial constructor.
-// (4) const versions thereof.
-template <class T> struct has_trivial_constructor : is_pod<T> { };
-template <class T, class U> struct has_trivial_constructor<std::pair<T, U> >
-  : integral_constant<bool,
-                      (has_trivial_constructor<T>::value &&
-                       has_trivial_constructor<U>::value)> { };
-template <class A, int N> struct has_trivial_constructor<A[N]>
-  : has_trivial_constructor<A> { };
-template <class T> struct has_trivial_constructor<const T>
-  : has_trivial_constructor<T> { };
-
-// We can't get has_trivial_copy right without compiler help, so fail
-// conservatively. We will assume it's false except for: (1) types
-// for which is_pod is true. (2) std::pair of types with trivial copy
-// constructors. (3) array of a type with a trivial copy constructor.
-// (4) const versions thereof.
-template <class T> struct has_trivial_copy : is_pod<T> { };
-template <class T, class U> struct has_trivial_copy<std::pair<T, U> >
-  : integral_constant<bool,
-                      (has_trivial_copy<T>::value &&
-                       has_trivial_copy<U>::value)> { };
-template <class A, int N> struct has_trivial_copy<A[N]>
-  : has_trivial_copy<A> { };
-template <class T> struct has_trivial_copy<const T> : has_trivial_copy<T> { };
-
-// We can't get has_trivial_assign right without compiler help, so fail
-// conservatively. We will assume it's false except for: (1) types
-// for which is_pod is true. (2) std::pair of types with trivial copy
-// constructors. (3) array of a type with a trivial assign constructor.
-template <class T> struct has_trivial_assign : is_pod<T> { };
-template <class T, class U> struct has_trivial_assign<std::pair<T, U> >
-  : integral_constant<bool,
-                      (has_trivial_assign<T>::value &&
-                       has_trivial_assign<U>::value)> { };
-template <class A, int N> struct has_trivial_assign<A[N]>
-  : has_trivial_assign<A> { };
-
-// We can't get has_trivial_destructor right without compiler help, so
-// fail conservatively. We will assume it's false except for: (1) types
-// for which is_pod is true. (2) std::pair of types with trivial
-// destructors. (3) array of a type with a trivial destructor.
-// (4) const versions thereof.
-template <class T> struct has_trivial_destructor : is_pod<T> { };
-template <class T, class U> struct has_trivial_destructor<std::pair<T, U> >
-  : integral_constant<bool,
-                      (has_trivial_destructor<T>::value &&
-                       has_trivial_destructor<U>::value)> { };
-template <class A, int N> struct has_trivial_destructor<A[N]>
-  : has_trivial_destructor<A> { };
-template <class T> struct has_trivial_destructor<const T>
-  : has_trivial_destructor<T> { };
-
-// Specified by TR1 [4.7.1]
-template<typename T> struct remove_const { typedef T type; };
-template<typename T> struct remove_const<T const> { typedef T type; };
-template<typename T> struct remove_volatile { typedef T type; };
-template<typename T> struct remove_volatile<T volatile> { typedef T type; };
-template<typename T> struct remove_cv {
-  typedef typename remove_const<typename remove_volatile<T>::type>::type type;
-};
-
-
-// Specified by TR1 [4.7.2] Reference modifications.
-template<typename T> struct remove_reference { typedef T type; };
-template<typename T> struct remove_reference<T&> { typedef T type; };
-
-template <typename T> struct add_reference { typedef T& type; };
-template <typename T> struct add_reference<T&> { typedef T& type; };
-
-// Specified by TR1 [4.7.4] Pointer modifications.
-template<typename T> struct remove_pointer { typedef T type; };
-template<typename T> struct remove_pointer<T*> { typedef T type; };
-template<typename T> struct remove_pointer<T* const> { typedef T type; };
-template<typename T> struct remove_pointer<T* volatile> { typedef T type; };
-template<typename T> struct remove_pointer<T* const volatile> {
-  typedef T type; };
-
-// Specified by TR1 [4.6] Relationships between types
-template<typename T, typename U> struct is_same : public false_type { };
-template<typename T> struct is_same<T, T> : public true_type { };
-
-// Specified by TR1 [4.6] Relationships between types
-#if !defined(_MSC_VER) && !(defined(__GNUC__) && __GNUC__ <= 3)
-namespace internal {
-
-// This class is an implementation detail for is_convertible, and you
-// don't need to know how it works to use is_convertible. For those
-// who care: we declare two different functions, one whose argument is
-// of type To and one with a variadic argument list. We give them
-// return types of different size, so we can use sizeof to trick the
-// compiler into telling us which function it would have chosen if we
-// had called it with an argument of type From.  See Alexandrescu's
-// _Modern C++ Design_ for more details on this sort of trick.
-
-template <typename From, typename To>
-struct ConvertHelper {
-  static small_ Test(To);
-  static big_ Test(...);
-  static From Create();
-};
-}  // namespace internal
-
-// Inherits from true_type if From is convertible to To, false_type otherwise.
-template <typename From, typename To>
-struct is_convertible
-    : integral_constant<bool,
-                        sizeof(internal::ConvertHelper<From, To>::Test(
-                                  internal::ConvertHelper<From, To>::Create()))
-                        == sizeof(small_)> {
-};
-#endif
-
-}  // namespace internal
-}  // namespace protobuf
-}  // namespace google
-
-#endif  // GOOGLE_PROTOBUF_TYPE_TRAITS_H_
diff --git a/ps-lite/deps/include/google/protobuf/text_format.h b/ps-lite/deps/include/google/protobuf/text_format.h
deleted file mode 100644
index 01f3ffb0..00000000
--- a/ps-lite/deps/include/google/protobuf/text_format.h
+++ /dev/null
@@ -1,369 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: jschorr@google.com (Joseph Schorr)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Utilities for printing and parsing protocol messages in a human-readable,
-// text-based format.
-
-#ifndef GOOGLE_PROTOBUF_TEXT_FORMAT_H__
-#define GOOGLE_PROTOBUF_TEXT_FORMAT_H__
-
-#include <map>
-#include <string>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/message.h>
-#include <google/protobuf/descriptor.h>
-
-namespace google {
-namespace protobuf {
-
-namespace io {
-  class ErrorCollector;      // tokenizer.h
-}
-
-// This class implements protocol buffer text format.  Printing and parsing
-// protocol messages in text format is useful for debugging and human editing
-// of messages.
-//
-// This class is really a namespace that contains only static methods.
-class LIBPROTOBUF_EXPORT TextFormat {
- public:
-  // Outputs a textual representation of the given message to the given
-  // output stream.
-  static bool Print(const Message& message, io::ZeroCopyOutputStream* output);
-
-  // Print the fields in an UnknownFieldSet.  They are printed by tag number
-  // only.  Embedded messages are heuristically identified by attempting to
-  // parse them.
-  static bool PrintUnknownFields(const UnknownFieldSet& unknown_fields,
-                                 io::ZeroCopyOutputStream* output);
-
-  // Like Print(), but outputs directly to a string.
-  static bool PrintToString(const Message& message, string* output);
-
-  // Like PrintUnknownFields(), but outputs directly to a string.
-  static bool PrintUnknownFieldsToString(const UnknownFieldSet& unknown_fields,
-                                         string* output);
-
-  // Outputs a textual representation of the value of the field supplied on
-  // the message supplied. For non-repeated fields, an index of -1 must
-  // be supplied. Note that this method will print the default value for a
-  // field if it is not set.
-  static void PrintFieldValueToString(const Message& message,
-                                      const FieldDescriptor* field,
-                                      int index,
-                                      string* output);
-
-  // Class for those users which require more fine-grained control over how
-  // a protobuffer message is printed out.
-  class LIBPROTOBUF_EXPORT Printer {
-   public:
-    Printer();
-    ~Printer();
-
-    // Like TextFormat::Print
-    bool Print(const Message& message, io::ZeroCopyOutputStream* output) const;
-    // Like TextFormat::PrintUnknownFields
-    bool PrintUnknownFields(const UnknownFieldSet& unknown_fields,
-                            io::ZeroCopyOutputStream* output) const;
-    // Like TextFormat::PrintToString
-    bool PrintToString(const Message& message, string* output) const;
-    // Like TextFormat::PrintUnknownFieldsToString
-    bool PrintUnknownFieldsToString(const UnknownFieldSet& unknown_fields,
-                                    string* output) const;
-    // Like TextFormat::PrintFieldValueToString
-    void PrintFieldValueToString(const Message& message,
-                                 const FieldDescriptor* field,
-                                 int index,
-                                 string* output) const;
-
-    // Adjust the initial indent level of all output.  Each indent level is
-    // equal to two spaces.
-    void SetInitialIndentLevel(int indent_level) {
-      initial_indent_level_ = indent_level;
-    }
-
-    // If printing in single line mode, then the entire message will be output
-    // on a single line with no line breaks.
-    void SetSingleLineMode(bool single_line_mode) {
-      single_line_mode_ = single_line_mode;
-    }
-
-    // Set true to print repeated primitives in a format like:
-    //   field_name: [1, 2, 3, 4]
-    // instead of printing each value on its own line.  Short format applies
-    // only to primitive values -- i.e. everything except strings and
-    // sub-messages/groups.
-    void SetUseShortRepeatedPrimitives(bool use_short_repeated_primitives) {
-      use_short_repeated_primitives_ = use_short_repeated_primitives;
-    }
-
-    // Set true to output UTF-8 instead of ASCII.  The only difference
-    // is that bytes >= 0x80 in string fields will not be escaped,
-    // because they are assumed to be part of UTF-8 multi-byte
-    // sequences.
-    void SetUseUtf8StringEscaping(bool as_utf8) {
-      utf8_string_escaping_ = as_utf8;
-    }
-
-   private:
-    // Forward declaration of an internal class used to print the text
-    // output to the OutputStream (see text_format.cc for implementation).
-    class TextGenerator;
-
-    // Internal Print method, used for writing to the OutputStream via
-    // the TextGenerator class.
-    void Print(const Message& message,
-               TextGenerator& generator) const;
-
-    // Print a single field.
-    void PrintField(const Message& message,
-                    const Reflection* reflection,
-                    const FieldDescriptor* field,
-                    TextGenerator& generator) const;
-
-    // Print a repeated primitive field in short form.
-    void PrintShortRepeatedField(const Message& message,
-                                 const Reflection* reflection,
-                                 const FieldDescriptor* field,
-                                 TextGenerator& generator) const;
-
-    // Print the name of a field -- i.e. everything that comes before the
-    // ':' for a single name/value pair.
-    void PrintFieldName(const Message& message,
-                        const Reflection* reflection,
-                        const FieldDescriptor* field,
-                        TextGenerator& generator) const;
-
-    // Outputs a textual representation of the value of the field supplied on
-    // the message supplied or the default value if not set.
-    void PrintFieldValue(const Message& message,
-                         const Reflection* reflection,
-                         const FieldDescriptor* field,
-                         int index,
-                         TextGenerator& generator) const;
-
-    // Print the fields in an UnknownFieldSet.  They are printed by tag number
-    // only.  Embedded messages are heuristically identified by attempting to
-    // parse them.
-    void PrintUnknownFields(const UnknownFieldSet& unknown_fields,
-                            TextGenerator& generator) const;
-
-    int initial_indent_level_;
-
-    bool single_line_mode_;
-
-    bool use_short_repeated_primitives_;
-
-    bool utf8_string_escaping_;
-  };
-
-  // Parses a text-format protocol message from the given input stream to
-  // the given message object.  This function parses the format written
-  // by Print().
-  static bool Parse(io::ZeroCopyInputStream* input, Message* output);
-  // Like Parse(), but reads directly from a string.
-  static bool ParseFromString(const string& input, Message* output);
-
-  // Like Parse(), but the data is merged into the given message, as if
-  // using Message::MergeFrom().
-  static bool Merge(io::ZeroCopyInputStream* input, Message* output);
-  // Like Merge(), but reads directly from a string.
-  static bool MergeFromString(const string& input, Message* output);
-
-  // Parse the given text as a single field value and store it into the
-  // given field of the given message. If the field is a repeated field,
-  // the new value will be added to the end
-  static bool ParseFieldValueFromString(const string& input,
-                                        const FieldDescriptor* field,
-                                        Message* message);
-
-  // Interface that TextFormat::Parser can use to find extensions.
-  // This class may be extended in the future to find more information
-  // like fields, etc.
-  class LIBPROTOBUF_EXPORT Finder {
-   public:
-    virtual ~Finder();
-
-    // Try to find an extension of *message by fully-qualified field
-    // name.  Returns NULL if no extension is known for this name or number.
-    virtual const FieldDescriptor* FindExtension(
-        Message* message,
-        const string& name) const = 0;
-  };
-
-  // A location in the parsed text.
-  struct ParseLocation {
-    int line;
-    int column;
-
-    ParseLocation() : line(-1), column(-1) {}
-    ParseLocation(int line_param, int column_param)
-        : line(line_param), column(column_param) {}
-  };
-
-  // Data structure which is populated with the locations of each field
-  // value parsed from the text.
-  class LIBPROTOBUF_EXPORT ParseInfoTree {
-   public:
-    ParseInfoTree();
-    ~ParseInfoTree();
-
-    // Returns the parse location for index-th value of the field in the parsed
-    // text. If none exists, returns a location with line = -1. Index should be
-    // -1 for not-repeated fields.
-    ParseLocation GetLocation(const FieldDescriptor* field, int index) const;
-
-    // Returns the parse info tree for the given field, which must be a message
-    // type. The nested information tree is owned by the root tree and will be
-    // deleted when it is deleted.
-    ParseInfoTree* GetTreeForNested(const FieldDescriptor* field,
-                                    int index) const;
-
-   private:
-    // Allow the text format parser to record information into the tree.
-    friend class TextFormat;
-
-    // Records the starting location of a single value for a field.
-    void RecordLocation(const FieldDescriptor* field, ParseLocation location);
-
-    // Create and records a nested tree for a nested message field.
-    ParseInfoTree* CreateNested(const FieldDescriptor* field);
-
-    // Defines the map from the index-th field descriptor to its parse location.
-    typedef map<const FieldDescriptor*, vector<ParseLocation> > LocationMap;
-
-    // Defines the map from the index-th field descriptor to the nested parse
-    // info tree.
-    typedef map<const FieldDescriptor*, vector<ParseInfoTree*> > NestedMap;
-
-    LocationMap locations_;
-    NestedMap nested_;
-
-    GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(ParseInfoTree);
-  };
-
-  // For more control over parsing, use this class.
-  class LIBPROTOBUF_EXPORT Parser {
-   public:
-    Parser();
-    ~Parser();
-
-    // Like TextFormat::Parse().
-    bool Parse(io::ZeroCopyInputStream* input, Message* output);
-    // Like TextFormat::ParseFromString().
-    bool ParseFromString(const string& input, Message* output);
-    // Like TextFormat::Merge().
-    bool Merge(io::ZeroCopyInputStream* input, Message* output);
-    // Like TextFormat::MergeFromString().
-    bool MergeFromString(const string& input, Message* output);
-
-    // Set where to report parse errors.  If NULL (the default), errors will
-    // be printed to stderr.
-    void RecordErrorsTo(io::ErrorCollector* error_collector) {
-      error_collector_ = error_collector;
-    }
-
-    // Set how parser finds extensions.  If NULL (the default), the
-    // parser will use the standard Reflection object associated with
-    // the message being parsed.
-    void SetFinder(Finder* finder) {
-      finder_ = finder;
-    }
-
-    // Sets where location information about the parse will be written. If NULL
-    // (the default), then no location will be written.
-    void WriteLocationsTo(ParseInfoTree* tree) {
-      parse_info_tree_ = tree;
-    }
-
-    // Normally parsing fails if, after parsing, output->IsInitialized()
-    // returns false.  Call AllowPartialMessage(true) to skip this check.
-    void AllowPartialMessage(bool allow) {
-      allow_partial_ = allow;
-    }
-
-    // Like TextFormat::ParseFieldValueFromString
-    bool ParseFieldValueFromString(const string& input,
-                                   const FieldDescriptor* field,
-                                   Message* output);
-
-
-   private:
-    // Forward declaration of an internal class used to parse text
-    // representations (see text_format.cc for implementation).
-    class ParserImpl;
-
-    // Like TextFormat::Merge().  The provided implementation is used
-    // to do the parsing.
-    bool MergeUsingImpl(io::ZeroCopyInputStream* input,
-                        Message* output,
-                        ParserImpl* parser_impl);
-
-    io::ErrorCollector* error_collector_;
-    Finder* finder_;
-    ParseInfoTree* parse_info_tree_;
-    bool allow_partial_;
-    bool allow_unknown_field_;
-  };
-
- private:
-  // Hack: ParseInfoTree declares TextFormat as a friend which should extend
-  // the friendship to TextFormat::Parser::ParserImpl, but unfortunately some
-  // old compilers (e.g. GCC 3.4.6) don't implement this correctly. We provide
-  // helpers for ParserImpl to call methods of ParseInfoTree.
-  static inline void RecordLocation(ParseInfoTree* info_tree,
-                                    const FieldDescriptor* field,
-                                    ParseLocation location);
-  static inline ParseInfoTree* CreateNested(ParseInfoTree* info_tree,
-                                            const FieldDescriptor* field);
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(TextFormat);
-};
-
-inline void TextFormat::RecordLocation(ParseInfoTree* info_tree,
-                                       const FieldDescriptor* field,
-                                       ParseLocation location) {
-  info_tree->RecordLocation(field, location);
-}
-
-inline TextFormat::ParseInfoTree* TextFormat::CreateNested(
-    ParseInfoTree* info_tree, const FieldDescriptor* field) {
-  return info_tree->CreateNested(field);
-}
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_TEXT_FORMAT_H__
diff --git a/ps-lite/deps/include/google/protobuf/unknown_field_set.h b/ps-lite/deps/include/google/protobuf/unknown_field_set.h
deleted file mode 100644
index 825bba83..00000000
--- a/ps-lite/deps/include/google/protobuf/unknown_field_set.h
+++ /dev/null
@@ -1,311 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// Contains classes used to keep track of unrecognized fields seen while
-// parsing a protocol message.
-
-#ifndef GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
-#define GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
-
-#include <assert.h>
-#include <string>
-#include <vector>
-#include <google/protobuf/stubs/common.h>
-// TODO(jasonh): some people seem to rely on protobufs to include this for them!
-
-namespace google {
-namespace protobuf {
-  namespace io {
-    class CodedInputStream;         // coded_stream.h
-    class CodedOutputStream;        // coded_stream.h
-    class ZeroCopyInputStream;      // zero_copy_stream.h
-  }
-  namespace internal {
-    class WireFormat;               // wire_format.h
-    class UnknownFieldSetFieldSkipperUsingCord;
-                                    // extension_set_heavy.cc
-  }
-
-class Message;                      // message.h
-class UnknownField;                 // below
-
-// An UnknownFieldSet contains fields that were encountered while parsing a
-// message but were not defined by its type.  Keeping track of these can be
-// useful, especially in that they may be written if the message is serialized
-// again without being cleared in between.  This means that software which
-// simply receives messages and forwards them to other servers does not need
-// to be updated every time a new field is added to the message definition.
-//
-// To get the UnknownFieldSet attached to any message, call
-// Reflection::GetUnknownFields().
-//
-// This class is necessarily tied to the protocol buffer wire format, unlike
-// the Reflection interface which is independent of any serialization scheme.
-class LIBPROTOBUF_EXPORT UnknownFieldSet {
- public:
-  UnknownFieldSet();
-  ~UnknownFieldSet();
-
-  // Remove all fields.
-  inline void Clear();
-
-  // Remove all fields and deallocate internal data objects
-  void ClearAndFreeMemory();
-
-  // Is this set empty?
-  inline bool empty() const;
-
-  // Merge the contents of some other UnknownFieldSet with this one.
-  void MergeFrom(const UnknownFieldSet& other);
-
-  // Swaps the contents of some other UnknownFieldSet with this one.
-  inline void Swap(UnknownFieldSet* x);
-
-  // Computes (an estimate of) the total number of bytes currently used for
-  // storing the unknown fields in memory. Does NOT include
-  // sizeof(*this) in the calculation.
-  int SpaceUsedExcludingSelf() const;
-
-  // Version of SpaceUsed() including sizeof(*this).
-  int SpaceUsed() const;
-
-  // Returns the number of fields present in the UnknownFieldSet.
-  inline int field_count() const;
-  // Get a field in the set, where 0 <= index < field_count().  The fields
-  // appear in the order in which they were added.
-  inline const UnknownField& field(int index) const;
-  // Get a mutable pointer to a field in the set, where
-  // 0 <= index < field_count().  The fields appear in the order in which
-  // they were added.
-  inline UnknownField* mutable_field(int index);
-
-  // Adding fields ---------------------------------------------------
-
-  void AddVarint(int number, uint64 value);
-  void AddFixed32(int number, uint32 value);
-  void AddFixed64(int number, uint64 value);
-  void AddLengthDelimited(int number, const string& value);
-  string* AddLengthDelimited(int number);
-  UnknownFieldSet* AddGroup(int number);
-
-  // Adds an unknown field from another set.
-  void AddField(const UnknownField& field);
-
-  // Delete fields with indices in the range [start .. start+num-1].
-  // Caution: implementation moves all fields with indices [start+num .. ].
-  void DeleteSubrange(int start, int num);
-
-  // Delete all fields with a specific field number. The order of left fields
-  // is preserved.
-  // Caution: implementation moves all fields after the first deleted field.
-  void DeleteByNumber(int number);
-
-  // Parsing helpers -------------------------------------------------
-  // These work exactly like the similarly-named methods of Message.
-
-  bool MergeFromCodedStream(io::CodedInputStream* input);
-  bool ParseFromCodedStream(io::CodedInputStream* input);
-  bool ParseFromZeroCopyStream(io::ZeroCopyInputStream* input);
-  bool ParseFromArray(const void* data, int size);
-  inline bool ParseFromString(const string& data) {
-    return ParseFromArray(data.data(), data.size());
-  }
-
- private:
-
-  void ClearFallback();
-
-  vector<UnknownField>* fields_;
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(UnknownFieldSet);
-};
-
-// Represents one field in an UnknownFieldSet.
-class LIBPROTOBUF_EXPORT UnknownField {
- public:
-  enum Type {
-    TYPE_VARINT,
-    TYPE_FIXED32,
-    TYPE_FIXED64,
-    TYPE_LENGTH_DELIMITED,
-    TYPE_GROUP
-  };
-
-  // The field's tag number, as seen on the wire.
-  inline int number() const;
-
-  // The field type.
-  inline Type type() const;
-
-  // Accessors -------------------------------------------------------
-  // Each method works only for UnknownFields of the corresponding type.
-
-  inline uint64 varint() const;
-  inline uint32 fixed32() const;
-  inline uint64 fixed64() const;
-  inline const string& length_delimited() const;
-  inline const UnknownFieldSet& group() const;
-
-  inline void set_varint(uint64 value);
-  inline void set_fixed32(uint32 value);
-  inline void set_fixed64(uint64 value);
-  inline void set_length_delimited(const string& value);
-  inline string* mutable_length_delimited();
-  inline UnknownFieldSet* mutable_group();
-
-  // Serialization API.
-  // These methods can take advantage of the underlying implementation and may
-  // archieve a better performance than using getters to retrieve the data and
-  // do the serialization yourself.
-  void SerializeLengthDelimitedNoTag(io::CodedOutputStream* output) const;
-  uint8* SerializeLengthDelimitedNoTagToArray(uint8* target) const;
-
-  inline int GetLengthDelimitedSize() const;
-
- private:
-  friend class UnknownFieldSet;
-
-  // If this UnknownField contains a pointer, delete it.
-  void Delete();
-
-  // Make a deep copy of any pointers in this UnknownField.
-  void DeepCopy();
-
-
-  unsigned int number_ : 29;
-  unsigned int type_   : 3;
-  union {
-    uint64 varint_;
-    uint32 fixed32_;
-    uint64 fixed64_;
-    mutable union {
-      string* string_value_;
-    } length_delimited_;
-    UnknownFieldSet* group_;
-  };
-};
-
-// ===================================================================
-// inline implementations
-
-inline void UnknownFieldSet::Clear() {
-  if (fields_ != NULL) {
-    ClearFallback();
-  }
-}
-
-inline bool UnknownFieldSet::empty() const {
-  return fields_ == NULL || fields_->empty();
-}
-
-inline void UnknownFieldSet::Swap(UnknownFieldSet* x) {
-  std::swap(fields_, x->fields_);
-}
-
-inline int UnknownFieldSet::field_count() const {
-  return (fields_ == NULL) ? 0 : fields_->size();
-}
-inline const UnknownField& UnknownFieldSet::field(int index) const {
-  return (*fields_)[index];
-}
-inline UnknownField* UnknownFieldSet::mutable_field(int index) {
-  return &(*fields_)[index];
-}
-
-inline void UnknownFieldSet::AddLengthDelimited(
-    int number, const string& value) {
-  AddLengthDelimited(number)->assign(value);
-}
-
-
-inline int UnknownField::number() const { return number_; }
-inline UnknownField::Type UnknownField::type() const {
-  return static_cast<Type>(type_);
-}
-
-inline uint64 UnknownField::varint () const {
-  assert(type_ == TYPE_VARINT);
-  return varint_;
-}
-inline uint32 UnknownField::fixed32() const {
-  assert(type_ == TYPE_FIXED32);
-  return fixed32_;
-}
-inline uint64 UnknownField::fixed64() const {
-  assert(type_ == TYPE_FIXED64);
-  return fixed64_;
-}
-inline const string& UnknownField::length_delimited() const {
-  assert(type_ == TYPE_LENGTH_DELIMITED);
-  return *length_delimited_.string_value_;
-}
-inline const UnknownFieldSet& UnknownField::group() const {
-  assert(type_ == TYPE_GROUP);
-  return *group_;
-}
-
-inline void UnknownField::set_varint(uint64 value) {
-  assert(type_ == TYPE_VARINT);
-  varint_ = value;
-}
-inline void UnknownField::set_fixed32(uint32 value) {
-  assert(type_ == TYPE_FIXED32);
-  fixed32_ = value;
-}
-inline void UnknownField::set_fixed64(uint64 value) {
-  assert(type_ == TYPE_FIXED64);
-  fixed64_ = value;
-}
-inline void UnknownField::set_length_delimited(const string& value) {
-  assert(type_ == TYPE_LENGTH_DELIMITED);
-  length_delimited_.string_value_->assign(value);
-}
-inline string* UnknownField::mutable_length_delimited() {
-  assert(type_ == TYPE_LENGTH_DELIMITED);
-  return length_delimited_.string_value_;
-}
-inline UnknownFieldSet* UnknownField::mutable_group() {
-  assert(type_ == TYPE_GROUP);
-  return group_;
-}
-
-inline int UnknownField::GetLengthDelimitedSize() const {
-  GOOGLE_DCHECK_EQ(TYPE_LENGTH_DELIMITED, type_);
-  return length_delimited_.string_value_->size();
-}
-
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format.h b/ps-lite/deps/include/google/protobuf/wire_format.h
deleted file mode 100644
index 6cc90029..00000000
--- a/ps-lite/deps/include/google/protobuf/wire_format.h
+++ /dev/null
@@ -1,308 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//         atenasio@google.com (Chris Atenasio) (ZigZag transform)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-
-#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_H__
-#define GOOGLE_PROTOBUF_WIRE_FORMAT_H__
-
-#include <string>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/descriptor.pb.h>
-#include <google/protobuf/descriptor.h>
-#include <google/protobuf/message.h>
-#include <google/protobuf/wire_format_lite.h>
-
-// Do UTF-8 validation on string type in Debug build only
-#ifndef NDEBUG
-#define GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED
-#endif
-
-namespace google {
-namespace protobuf {
-  namespace io {
-    class CodedInputStream;      // coded_stream.h
-    class CodedOutputStream;     // coded_stream.h
-  }
-  class UnknownFieldSet;         // unknown_field_set.h
-}
-
-namespace protobuf {
-namespace internal {
-
-// This class is for internal use by the protocol buffer library and by
-// protocol-complier-generated message classes.  It must not be called
-// directly by clients.
-//
-// This class contains code for implementing the binary protocol buffer
-// wire format via reflection.  The WireFormatLite class implements the
-// non-reflection based routines.
-//
-// This class is really a namespace that contains only static methods
-class LIBPROTOBUF_EXPORT WireFormat {
- public:
-
-  // Given a field return its WireType
-  static inline WireFormatLite::WireType WireTypeForField(
-      const FieldDescriptor* field);
-
-  // Given a FieldSescriptor::Type return its WireType
-  static inline WireFormatLite::WireType WireTypeForFieldType(
-      FieldDescriptor::Type type);
-
-  // Compute the byte size of a tag.  For groups, this includes both the start
-  // and end tags.
-  static inline int TagSize(int field_number, FieldDescriptor::Type type);
-
-  // These procedures can be used to implement the methods of Message which
-  // handle parsing and serialization of the protocol buffer wire format
-  // using only the Reflection interface.  When you ask the protocol
-  // compiler to optimize for code size rather than speed, it will implement
-  // those methods in terms of these procedures.  Of course, these are much
-  // slower than the specialized implementations which the protocol compiler
-  // generates when told to optimize for speed.
-
-  // Read a message in protocol buffer wire format.
-  //
-  // This procedure reads either to the end of the input stream or through
-  // a WIRETYPE_END_GROUP tag ending the message, whichever comes first.
-  // It returns false if the input is invalid.
-  //
-  // Required fields are NOT checked by this method.  You must call
-  // IsInitialized() on the resulting message yourself.
-  static bool ParseAndMergePartial(io::CodedInputStream* input,
-                                   Message* message);
-
-  // Serialize a message in protocol buffer wire format.
-  //
-  // Any embedded messages within the message must have their correct sizes
-  // cached.  However, the top-level message need not; its size is passed as
-  // a parameter to this procedure.
-  //
-  // These return false iff the underlying stream returns a write error.
-  static void SerializeWithCachedSizes(
-      const Message& message,
-      int size, io::CodedOutputStream* output);
-
-  // Implements Message::ByteSize() via reflection.  WARNING:  The result
-  // of this method is *not* cached anywhere.  However, all embedded messages
-  // will have their ByteSize() methods called, so their sizes will be cached.
-  // Therefore, calling this method is sufficient to allow you to call
-  // WireFormat::SerializeWithCachedSizes() on the same object.
-  static int ByteSize(const Message& message);
-
-  // -----------------------------------------------------------------
-  // Helpers for dealing with unknown fields
-
-  // Skips a field value of the given WireType.  The input should start
-  // positioned immediately after the tag.  If unknown_fields is non-NULL,
-  // the contents of the field will be added to it.
-  static bool SkipField(io::CodedInputStream* input, uint32 tag,
-                        UnknownFieldSet* unknown_fields);
-
-  // Reads and ignores a message from the input.  If unknown_fields is non-NULL,
-  // the contents will be added to it.
-  static bool SkipMessage(io::CodedInputStream* input,
-                          UnknownFieldSet* unknown_fields);
-
-  // Write the contents of an UnknownFieldSet to the output.
-  static void SerializeUnknownFields(const UnknownFieldSet& unknown_fields,
-                                     io::CodedOutputStream* output);
-  // Same as above, except writing directly to the provided buffer.
-  // Requires that the buffer have sufficient capacity for
-  // ComputeUnknownFieldsSize(unknown_fields).
-  //
-  // Returns a pointer past the last written byte.
-  static uint8* SerializeUnknownFieldsToArray(
-      const UnknownFieldSet& unknown_fields,
-      uint8* target);
-
-  // Same thing except for messages that have the message_set_wire_format
-  // option.
-  static void SerializeUnknownMessageSetItems(
-      const UnknownFieldSet& unknown_fields,
-      io::CodedOutputStream* output);
-  // Same as above, except writing directly to the provided buffer.
-  // Requires that the buffer have sufficient capacity for
-  // ComputeUnknownMessageSetItemsSize(unknown_fields).
-  //
-  // Returns a pointer past the last written byte.
-  static uint8* SerializeUnknownMessageSetItemsToArray(
-      const UnknownFieldSet& unknown_fields,
-      uint8* target);
-
-  // Compute the size of the UnknownFieldSet on the wire.
-  static int ComputeUnknownFieldsSize(const UnknownFieldSet& unknown_fields);
-
-  // Same thing except for messages that have the message_set_wire_format
-  // option.
-  static int ComputeUnknownMessageSetItemsSize(
-      const UnknownFieldSet& unknown_fields);
-
-
-  // Helper functions for encoding and decoding tags.  (Inlined below and in
-  // _inl.h)
-  //
-  // This is different from MakeTag(field->number(), field->type()) in the case
-  // of packed repeated fields.
-  static uint32 MakeTag(const FieldDescriptor* field);
-
-  // Parse a single field.  The input should start out positioned immidately
-  // after the tag.
-  static bool ParseAndMergeField(
-      uint32 tag,
-      const FieldDescriptor* field,        // May be NULL for unknown
-      Message* message,
-      io::CodedInputStream* input);
-
-  // Serialize a single field.
-  static void SerializeFieldWithCachedSizes(
-      const FieldDescriptor* field,        // Cannot be NULL
-      const Message& message,
-      io::CodedOutputStream* output);
-
-  // Compute size of a single field.  If the field is a message type, this
-  // will call ByteSize() for the embedded message, insuring that it caches
-  // its size.
-  static int FieldByteSize(
-      const FieldDescriptor* field,        // Cannot be NULL
-      const Message& message);
-
-  // Parse/serialize a MessageSet::Item group.  Used with messages that use
-  // opion message_set_wire_format = true.
-  static bool ParseAndMergeMessageSetItem(
-      io::CodedInputStream* input,
-      Message* message);
-  static void SerializeMessageSetItemWithCachedSizes(
-      const FieldDescriptor* field,
-      const Message& message,
-      io::CodedOutputStream* output);
-  static int MessageSetItemByteSize(
-      const FieldDescriptor* field,
-      const Message& message);
-
-  // Computes the byte size of a field, excluding tags. For packed fields, it
-  // only includes the size of the raw data, and not the size of the total
-  // length, but for other length-delimited types, the size of the length is
-  // included.
-  static int FieldDataOnlyByteSize(
-      const FieldDescriptor* field,        // Cannot be NULL
-      const Message& message);
-
-  enum Operation {
-    PARSE,
-    SERIALIZE,
-  };
-
-  // Verifies that a string field is valid UTF8, logging an error if not.
-  static void VerifyUTF8String(const char* data, int size, Operation op);
-
- private:
-  // Verifies that a string field is valid UTF8, logging an error if not.
-  static void VerifyUTF8StringFallback(
-      const char* data,
-      int size,
-      Operation op);
-
-
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(WireFormat);
-};
-
-// Subclass of FieldSkipper which saves skipped fields to an UnknownFieldSet.
-class LIBPROTOBUF_EXPORT UnknownFieldSetFieldSkipper : public FieldSkipper {
- public:
-  UnknownFieldSetFieldSkipper(UnknownFieldSet* unknown_fields)
-      : unknown_fields_(unknown_fields) {}
-  virtual ~UnknownFieldSetFieldSkipper() {}
-
-  // implements FieldSkipper -----------------------------------------
-  virtual bool SkipField(io::CodedInputStream* input, uint32 tag);
-  virtual bool SkipMessage(io::CodedInputStream* input);
-  virtual void SkipUnknownEnum(int field_number, int value);
-
- protected:
-  UnknownFieldSet* unknown_fields_;
-};
-
-// inline methods ====================================================
-
-inline WireFormatLite::WireType WireFormat::WireTypeForField(
-    const FieldDescriptor* field) {
-  if (field->options().packed()) {
-    return WireFormatLite::WIRETYPE_LENGTH_DELIMITED;
-  } else {
-    return WireTypeForFieldType(field->type());
-  }
-}
-
-inline WireFormatLite::WireType WireFormat::WireTypeForFieldType(
-    FieldDescriptor::Type type) {
-  // Some compilers don't like enum -> enum casts, so we implicit_cast to
-  // int first.
-  return WireFormatLite::WireTypeForFieldType(
-      static_cast<WireFormatLite::FieldType>(
-        implicit_cast<int>(type)));
-}
-
-inline uint32 WireFormat::MakeTag(const FieldDescriptor* field) {
-  return WireFormatLite::MakeTag(field->number(), WireTypeForField(field));
-}
-
-inline int WireFormat::TagSize(int field_number, FieldDescriptor::Type type) {
-  // Some compilers don't like enum -> enum casts, so we implicit_cast to
-  // int first.
-  return WireFormatLite::TagSize(field_number,
-      static_cast<WireFormatLite::FieldType>(
-        implicit_cast<int>(type)));
-}
-
-inline void WireFormat::VerifyUTF8String(const char* data, int size,
-    WireFormat::Operation op) {
-#ifdef GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED
-  WireFormat::VerifyUTF8StringFallback(data, size, op);
-#else
-  // Avoid the compiler warning about unsued variables.
-  (void)data; (void)size; (void)op;
-#endif
-}
-
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format_lite.h b/ps-lite/deps/include/google/protobuf/wire_format_lite.h
deleted file mode 100644
index cb4fc918..00000000
--- a/ps-lite/deps/include/google/protobuf/wire_format_lite.h
+++ /dev/null
@@ -1,622 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//         atenasio@google.com (Chris Atenasio) (ZigZag transform)
-//         wink@google.com (Wink Saville) (refactored from wire_format.h)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-//
-// This header is logically internal, but is made public because it is used
-// from protocol-compiler-generated code, which may reside in other components.
-
-#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
-#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
-
-#include <string>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/message_lite.h>
-#include <google/protobuf/io/coded_stream.h>  // for CodedOutputStream::Varint32Size
-
-namespace google {
-
-namespace protobuf {
-  template <typename T> class RepeatedField;  // repeated_field.h
-}
-
-namespace protobuf {
-namespace internal {
-
-class StringPieceField;
-
-// This class is for internal use by the protocol buffer library and by
-// protocol-complier-generated message classes.  It must not be called
-// directly by clients.
-//
-// This class contains helpers for implementing the binary protocol buffer
-// wire format without the need for reflection. Use WireFormat when using
-// reflection.
-//
-// This class is really a namespace that contains only static methods.
-class LIBPROTOBUF_EXPORT WireFormatLite {
- public:
-
-  // -----------------------------------------------------------------
-  // Helper constants and functions related to the format.  These are
-  // mostly meant for internal and generated code to use.
-
-  // The wire format is composed of a sequence of tag/value pairs, each
-  // of which contains the value of one field (or one element of a repeated
-  // field).  Each tag is encoded as a varint.  The lower bits of the tag
-  // identify its wire type, which specifies the format of the data to follow.
-  // The rest of the bits contain the field number.  Each type of field (as
-  // declared by FieldDescriptor::Type, in descriptor.h) maps to one of
-  // these wire types.  Immediately following each tag is the field's value,
-  // encoded in the format specified by the wire type.  Because the tag
-  // identifies the encoding of this data, it is possible to skip
-  // unrecognized fields for forwards compatibility.
-
-  enum WireType {
-    WIRETYPE_VARINT           = 0,
-    WIRETYPE_FIXED64          = 1,
-    WIRETYPE_LENGTH_DELIMITED = 2,
-    WIRETYPE_START_GROUP      = 3,
-    WIRETYPE_END_GROUP        = 4,
-    WIRETYPE_FIXED32          = 5,
-  };
-
-  // Lite alternative to FieldDescriptor::Type.  Must be kept in sync.
-  enum FieldType {
-    TYPE_DOUBLE         = 1,
-    TYPE_FLOAT          = 2,
-    TYPE_INT64          = 3,
-    TYPE_UINT64         = 4,
-    TYPE_INT32          = 5,
-    TYPE_FIXED64        = 6,
-    TYPE_FIXED32        = 7,
-    TYPE_BOOL           = 8,
-    TYPE_STRING         = 9,
-    TYPE_GROUP          = 10,
-    TYPE_MESSAGE        = 11,
-    TYPE_BYTES          = 12,
-    TYPE_UINT32         = 13,
-    TYPE_ENUM           = 14,
-    TYPE_SFIXED32       = 15,
-    TYPE_SFIXED64       = 16,
-    TYPE_SINT32         = 17,
-    TYPE_SINT64         = 18,
-    MAX_FIELD_TYPE      = 18,
-  };
-
-  // Lite alternative to FieldDescriptor::CppType.  Must be kept in sync.
-  enum CppType {
-    CPPTYPE_INT32       = 1,
-    CPPTYPE_INT64       = 2,
-    CPPTYPE_UINT32      = 3,
-    CPPTYPE_UINT64      = 4,
-    CPPTYPE_DOUBLE      = 5,
-    CPPTYPE_FLOAT       = 6,
-    CPPTYPE_BOOL        = 7,
-    CPPTYPE_ENUM        = 8,
-    CPPTYPE_STRING      = 9,
-    CPPTYPE_MESSAGE     = 10,
-    MAX_CPPTYPE         = 10,
-  };
-
-  // Helper method to get the CppType for a particular Type.
-  static CppType FieldTypeToCppType(FieldType type);
-
-  // Given a FieldSescriptor::Type return its WireType
-  static inline WireFormatLite::WireType WireTypeForFieldType(
-      WireFormatLite::FieldType type) {
-    return kWireTypeForFieldType[type];
-  }
-
-  // Number of bits in a tag which identify the wire type.
-  static const int kTagTypeBits = 3;
-  // Mask for those bits.
-  static const uint32 kTagTypeMask = (1 << kTagTypeBits) - 1;
-
-  // Helper functions for encoding and decoding tags.  (Inlined below and in
-  // _inl.h)
-  //
-  // This is different from MakeTag(field->number(), field->type()) in the case
-  // of packed repeated fields.
-  static uint32 MakeTag(int field_number, WireType type);
-  static WireType GetTagWireType(uint32 tag);
-  static int GetTagFieldNumber(uint32 tag);
-
-  // Compute the byte size of a tag.  For groups, this includes both the start
-  // and end tags.
-  static inline int TagSize(int field_number, WireFormatLite::FieldType type);
-
-  // Skips a field value with the given tag.  The input should start
-  // positioned immediately after the tag.  Skipped values are simply discarded,
-  // not recorded anywhere.  See WireFormat::SkipField() for a version that
-  // records to an UnknownFieldSet.
-  static bool SkipField(io::CodedInputStream* input, uint32 tag);
-
-  // Reads and ignores a message from the input.  Skipped values are simply
-  // discarded, not recorded anywhere.  See WireFormat::SkipMessage() for a
-  // version that records to an UnknownFieldSet.
-  static bool SkipMessage(io::CodedInputStream* input);
-
-// This macro does the same thing as WireFormatLite::MakeTag(), but the
-// result is usable as a compile-time constant, which makes it usable
-// as a switch case or a template input.  WireFormatLite::MakeTag() is more
-// type-safe, though, so prefer it if possible.
-#define GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(FIELD_NUMBER, TYPE)                  \
-  static_cast<uint32>(                                                   \
-    ((FIELD_NUMBER) << ::google::protobuf::internal::WireFormatLite::kTagTypeBits) \
-      | (TYPE))
-
-  // These are the tags for the old MessageSet format, which was defined as:
-  //   message MessageSet {
-  //     repeated group Item = 1 {
-  //       required int32 type_id = 2;
-  //       required string message = 3;
-  //     }
-  //   }
-  static const int kMessageSetItemNumber = 1;
-  static const int kMessageSetTypeIdNumber = 2;
-  static const int kMessageSetMessageNumber = 3;
-  static const int kMessageSetItemStartTag =
-    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetItemNumber,
-                                WireFormatLite::WIRETYPE_START_GROUP);
-  static const int kMessageSetItemEndTag =
-    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetItemNumber,
-                                WireFormatLite::WIRETYPE_END_GROUP);
-  static const int kMessageSetTypeIdTag =
-    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetTypeIdNumber,
-                                WireFormatLite::WIRETYPE_VARINT);
-  static const int kMessageSetMessageTag =
-    GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(kMessageSetMessageNumber,
-                                WireFormatLite::WIRETYPE_LENGTH_DELIMITED);
-
-  // Byte size of all tags of a MessageSet::Item combined.
-  static const int kMessageSetItemTagsSize;
-
-  // Helper functions for converting between floats/doubles and IEEE-754
-  // uint32s/uint64s so that they can be written.  (Assumes your platform
-  // uses IEEE-754 floats.)
-  static uint32 EncodeFloat(float value);
-  static float DecodeFloat(uint32 value);
-  static uint64 EncodeDouble(double value);
-  static double DecodeDouble(uint64 value);
-
-  // Helper functions for mapping signed integers to unsigned integers in
-  // such a way that numbers with small magnitudes will encode to smaller
-  // varints.  If you simply static_cast a negative number to an unsigned
-  // number and varint-encode it, it will always take 10 bytes, defeating
-  // the purpose of varint.  So, for the "sint32" and "sint64" field types,
-  // we ZigZag-encode the values.
-  static uint32 ZigZagEncode32(int32 n);
-  static int32  ZigZagDecode32(uint32 n);
-  static uint64 ZigZagEncode64(int64 n);
-  static int64  ZigZagDecode64(uint64 n);
-
-  // =================================================================
-  // Methods for reading/writing individual field.  The implementations
-  // of these methods are defined in wire_format_lite_inl.h; you must #include
-  // that file to use these.
-
-// Avoid ugly line wrapping
-#define input  io::CodedInputStream*  input
-#define output io::CodedOutputStream* output
-#define field_number int field_number
-#define INL GOOGLE_ATTRIBUTE_ALWAYS_INLINE
-
-  // Read fields, not including tags.  The assumption is that you already
-  // read the tag to determine what field to read.
-
-  // For primitive fields, we just use a templatized routine parameterized by
-  // the represented type and the FieldType. These are specialized with the
-  // appropriate definition for each declared type.
-  template <typename CType, enum FieldType DeclaredType>
-  static inline bool ReadPrimitive(input, CType* value) INL;
-
-  // Reads repeated primitive values, with optimizations for repeats.
-  // tag_size and tag should both be compile-time constants provided by the
-  // protocol compiler.
-  template <typename CType, enum FieldType DeclaredType>
-  static inline bool ReadRepeatedPrimitive(int tag_size,
-                                           uint32 tag,
-                                           input,
-                                           RepeatedField<CType>* value) INL;
-
-  // Identical to ReadRepeatedPrimitive, except will not inline the
-  // implementation.
-  template <typename CType, enum FieldType DeclaredType>
-  static bool ReadRepeatedPrimitiveNoInline(int tag_size,
-                                            uint32 tag,
-                                            input,
-                                            RepeatedField<CType>* value);
-
-  // Reads a primitive value directly from the provided buffer. It returns a
-  // pointer past the segment of data that was read.
-  //
-  // This is only implemented for the types with fixed wire size, e.g.
-  // float, double, and the (s)fixed* types.
-  template <typename CType, enum FieldType DeclaredType>
-  static inline const uint8* ReadPrimitiveFromArray(const uint8* buffer,
-                                                    CType* value) INL;
-
-  // Reads a primitive packed field.
-  //
-  // This is only implemented for packable types.
-  template <typename CType, enum FieldType DeclaredType>
-  static inline bool ReadPackedPrimitive(input,
-                                         RepeatedField<CType>* value) INL;
-
-  // Identical to ReadPackedPrimitive, except will not inline the
-  // implementation.
-  template <typename CType, enum FieldType DeclaredType>
-  static bool ReadPackedPrimitiveNoInline(input, RepeatedField<CType>* value);
-
-  // Read a packed enum field. Values for which is_valid() returns false are
-  // dropped.
-  static bool ReadPackedEnumNoInline(input,
-                                     bool (*is_valid)(int),
-                                     RepeatedField<int>* value);
-
-  static bool ReadString(input, string* value);
-  static bool ReadBytes (input, string* value);
-
-  static inline bool ReadGroup  (field_number, input, MessageLite* value);
-  static inline bool ReadMessage(input, MessageLite* value);
-
-  // Like above, but de-virtualize the call to MergePartialFromCodedStream().
-  // The pointer must point at an instance of MessageType, *not* a subclass (or
-  // the subclass must not override MergePartialFromCodedStream()).
-  template<typename MessageType>
-  static inline bool ReadGroupNoVirtual(field_number, input,
-                                        MessageType* value);
-  template<typename MessageType>
-  static inline bool ReadMessageNoVirtual(input, MessageType* value);
-
-  // Write a tag.  The Write*() functions typically include the tag, so
-  // normally there's no need to call this unless using the Write*NoTag()
-  // variants.
-  static inline void WriteTag(field_number, WireType type, output) INL;
-
-  // Write fields, without tags.
-  static inline void WriteInt32NoTag   (int32 value, output) INL;
-  static inline void WriteInt64NoTag   (int64 value, output) INL;
-  static inline void WriteUInt32NoTag  (uint32 value, output) INL;
-  static inline void WriteUInt64NoTag  (uint64 value, output) INL;
-  static inline void WriteSInt32NoTag  (int32 value, output) INL;
-  static inline void WriteSInt64NoTag  (int64 value, output) INL;
-  static inline void WriteFixed32NoTag (uint32 value, output) INL;
-  static inline void WriteFixed64NoTag (uint64 value, output) INL;
-  static inline void WriteSFixed32NoTag(int32 value, output) INL;
-  static inline void WriteSFixed64NoTag(int64 value, output) INL;
-  static inline void WriteFloatNoTag   (float value, output) INL;
-  static inline void WriteDoubleNoTag  (double value, output) INL;
-  static inline void WriteBoolNoTag    (bool value, output) INL;
-  static inline void WriteEnumNoTag    (int value, output) INL;
-
-  // Write fields, including tags.
-  static void WriteInt32   (field_number,  int32 value, output);
-  static void WriteInt64   (field_number,  int64 value, output);
-  static void WriteUInt32  (field_number, uint32 value, output);
-  static void WriteUInt64  (field_number, uint64 value, output);
-  static void WriteSInt32  (field_number,  int32 value, output);
-  static void WriteSInt64  (field_number,  int64 value, output);
-  static void WriteFixed32 (field_number, uint32 value, output);
-  static void WriteFixed64 (field_number, uint64 value, output);
-  static void WriteSFixed32(field_number,  int32 value, output);
-  static void WriteSFixed64(field_number,  int64 value, output);
-  static void WriteFloat   (field_number,  float value, output);
-  static void WriteDouble  (field_number, double value, output);
-  static void WriteBool    (field_number,   bool value, output);
-  static void WriteEnum    (field_number,    int value, output);
-
-  static void WriteString(field_number, const string& value, output);
-  static void WriteBytes (field_number, const string& value, output);
-
-  static void WriteGroup(
-    field_number, const MessageLite& value, output);
-  static void WriteMessage(
-    field_number, const MessageLite& value, output);
-  // Like above, but these will check if the output stream has enough
-  // space to write directly to a flat array.
-  static void WriteGroupMaybeToArray(
-    field_number, const MessageLite& value, output);
-  static void WriteMessageMaybeToArray(
-    field_number, const MessageLite& value, output);
-
-  // Like above, but de-virtualize the call to SerializeWithCachedSizes().  The
-  // pointer must point at an instance of MessageType, *not* a subclass (or
-  // the subclass must not override SerializeWithCachedSizes()).
-  template<typename MessageType>
-  static inline void WriteGroupNoVirtual(
-    field_number, const MessageType& value, output);
-  template<typename MessageType>
-  static inline void WriteMessageNoVirtual(
-    field_number, const MessageType& value, output);
-
-#undef output
-#define output uint8* target
-
-  // Like above, but use only *ToArray methods of CodedOutputStream.
-  static inline uint8* WriteTagToArray(field_number, WireType type, output) INL;
-
-  // Write fields, without tags.
-  static inline uint8* WriteInt32NoTagToArray   (int32 value, output) INL;
-  static inline uint8* WriteInt64NoTagToArray   (int64 value, output) INL;
-  static inline uint8* WriteUInt32NoTagToArray  (uint32 value, output) INL;
-  static inline uint8* WriteUInt64NoTagToArray  (uint64 value, output) INL;
-  static inline uint8* WriteSInt32NoTagToArray  (int32 value, output) INL;
-  static inline uint8* WriteSInt64NoTagToArray  (int64 value, output) INL;
-  static inline uint8* WriteFixed32NoTagToArray (uint32 value, output) INL;
-  static inline uint8* WriteFixed64NoTagToArray (uint64 value, output) INL;
-  static inline uint8* WriteSFixed32NoTagToArray(int32 value, output) INL;
-  static inline uint8* WriteSFixed64NoTagToArray(int64 value, output) INL;
-  static inline uint8* WriteFloatNoTagToArray   (float value, output) INL;
-  static inline uint8* WriteDoubleNoTagToArray  (double value, output) INL;
-  static inline uint8* WriteBoolNoTagToArray    (bool value, output) INL;
-  static inline uint8* WriteEnumNoTagToArray    (int value, output) INL;
-
-  // Write fields, including tags.
-  static inline uint8* WriteInt32ToArray(
-    field_number, int32 value, output) INL;
-  static inline uint8* WriteInt64ToArray(
-    field_number, int64 value, output) INL;
-  static inline uint8* WriteUInt32ToArray(
-    field_number, uint32 value, output) INL;
-  static inline uint8* WriteUInt64ToArray(
-    field_number, uint64 value, output) INL;
-  static inline uint8* WriteSInt32ToArray(
-    field_number, int32 value, output) INL;
-  static inline uint8* WriteSInt64ToArray(
-    field_number, int64 value, output) INL;
-  static inline uint8* WriteFixed32ToArray(
-    field_number, uint32 value, output) INL;
-  static inline uint8* WriteFixed64ToArray(
-    field_number, uint64 value, output) INL;
-  static inline uint8* WriteSFixed32ToArray(
-    field_number, int32 value, output) INL;
-  static inline uint8* WriteSFixed64ToArray(
-    field_number, int64 value, output) INL;
-  static inline uint8* WriteFloatToArray(
-    field_number, float value, output) INL;
-  static inline uint8* WriteDoubleToArray(
-    field_number, double value, output) INL;
-  static inline uint8* WriteBoolToArray(
-    field_number, bool value, output) INL;
-  static inline uint8* WriteEnumToArray(
-    field_number, int value, output) INL;
-
-  static inline uint8* WriteStringToArray(
-    field_number, const string& value, output) INL;
-  static inline uint8* WriteBytesToArray(
-    field_number, const string& value, output) INL;
-
-  static inline uint8* WriteGroupToArray(
-      field_number, const MessageLite& value, output) INL;
-  static inline uint8* WriteMessageToArray(
-      field_number, const MessageLite& value, output) INL;
-
-  // Like above, but de-virtualize the call to SerializeWithCachedSizes().  The
-  // pointer must point at an instance of MessageType, *not* a subclass (or
-  // the subclass must not override SerializeWithCachedSizes()).
-  template<typename MessageType>
-  static inline uint8* WriteGroupNoVirtualToArray(
-    field_number, const MessageType& value, output) INL;
-  template<typename MessageType>
-  static inline uint8* WriteMessageNoVirtualToArray(
-    field_number, const MessageType& value, output) INL;
-
-#undef output
-#undef input
-#undef INL
-
-#undef field_number
-
-  // Compute the byte size of a field.  The XxSize() functions do NOT include
-  // the tag, so you must also call TagSize().  (This is because, for repeated
-  // fields, you should only call TagSize() once and multiply it by the element
-  // count, but you may have to call XxSize() for each individual element.)
-  static inline int Int32Size   ( int32 value);
-  static inline int Int64Size   ( int64 value);
-  static inline int UInt32Size  (uint32 value);
-  static inline int UInt64Size  (uint64 value);
-  static inline int SInt32Size  ( int32 value);
-  static inline int SInt64Size  ( int64 value);
-  static inline int EnumSize    (   int value);
-
-  // These types always have the same size.
-  static const int kFixed32Size  = 4;
-  static const int kFixed64Size  = 8;
-  static const int kSFixed32Size = 4;
-  static const int kSFixed64Size = 8;
-  static const int kFloatSize    = 4;
-  static const int kDoubleSize   = 8;
-  static const int kBoolSize     = 1;
-
-  static inline int StringSize(const string& value);
-  static inline int BytesSize (const string& value);
-
-  static inline int GroupSize  (const MessageLite& value);
-  static inline int MessageSize(const MessageLite& value);
-
-  // Like above, but de-virtualize the call to ByteSize().  The
-  // pointer must point at an instance of MessageType, *not* a subclass (or
-  // the subclass must not override ByteSize()).
-  template<typename MessageType>
-  static inline int GroupSizeNoVirtual  (const MessageType& value);
-  template<typename MessageType>
-  static inline int MessageSizeNoVirtual(const MessageType& value);
-
-  // Given the length of data, calculate the byte size of the data on the
-  // wire if we encode the data as a length delimited field.
-  static inline int LengthDelimitedSize(int length);
-
- private:
-  // A helper method for the repeated primitive reader. This method has
-  // optimizations for primitive types that have fixed size on the wire, and
-  // can be read using potentially faster paths.
-  template <typename CType, enum FieldType DeclaredType>
-  static inline bool ReadRepeatedFixedSizePrimitive(
-      int tag_size,
-      uint32 tag,
-      google::protobuf::io::CodedInputStream* input,
-      RepeatedField<CType>* value) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;
-
-  static const CppType kFieldTypeToCppTypeMap[];
-  static const WireFormatLite::WireType kWireTypeForFieldType[];
-
-  GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(WireFormatLite);
-};
-
-// A class which deals with unknown values.  The default implementation just
-// discards them.  WireFormat defines a subclass which writes to an
-// UnknownFieldSet.  This class is used by ExtensionSet::ParseField(), since
-// ExtensionSet is part of the lite library but UnknownFieldSet is not.
-class LIBPROTOBUF_EXPORT FieldSkipper {
- public:
-  FieldSkipper() {}
-  virtual ~FieldSkipper() {}
-
-  // Skip a field whose tag has already been consumed.
-  virtual bool SkipField(io::CodedInputStream* input, uint32 tag);
-
-  // Skip an entire message or group, up to an end-group tag (which is consumed)
-  // or end-of-stream.
-  virtual bool SkipMessage(io::CodedInputStream* input);
-
-  // Deal with an already-parsed unrecognized enum value.  The default
-  // implementation does nothing, but the UnknownFieldSet-based implementation
-  // saves it as an unknown varint.
-  virtual void SkipUnknownEnum(int field_number, int value);
-};
-
-// inline methods ====================================================
-
-inline WireFormatLite::CppType
-WireFormatLite::FieldTypeToCppType(FieldType type) {
-  return kFieldTypeToCppTypeMap[type];
-}
-
-inline uint32 WireFormatLite::MakeTag(int field_number, WireType type) {
-  return GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(field_number, type);
-}
-
-inline WireFormatLite::WireType WireFormatLite::GetTagWireType(uint32 tag) {
-  return static_cast<WireType>(tag & kTagTypeMask);
-}
-
-inline int WireFormatLite::GetTagFieldNumber(uint32 tag) {
-  return static_cast<int>(tag >> kTagTypeBits);
-}
-
-inline int WireFormatLite::TagSize(int field_number,
-                                   WireFormatLite::FieldType type) {
-  int result = io::CodedOutputStream::VarintSize32(
-    field_number << kTagTypeBits);
-  if (type == TYPE_GROUP) {
-    // Groups have both a start and an end tag.
-    return result * 2;
-  } else {
-    return result;
-  }
-}
-
-inline uint32 WireFormatLite::EncodeFloat(float value) {
-  union {float f; uint32 i;};
-  f = value;
-  return i;
-}
-
-inline float WireFormatLite::DecodeFloat(uint32 value) {
-  union {float f; uint32 i;};
-  i = value;
-  return f;
-}
-
-inline uint64 WireFormatLite::EncodeDouble(double value) {
-  union {double f; uint64 i;};
-  f = value;
-  return i;
-}
-
-inline double WireFormatLite::DecodeDouble(uint64 value) {
-  union {double f; uint64 i;};
-  i = value;
-  return f;
-}
-
-// ZigZag Transform:  Encodes signed integers so that they can be
-// effectively used with varint encoding.
-//
-// varint operates on unsigned integers, encoding smaller numbers into
-// fewer bytes.  If you try to use it on a signed integer, it will treat
-// this number as a very large unsigned integer, which means that even
-// small signed numbers like -1 will take the maximum number of bytes
-// (10) to encode.  ZigZagEncode() maps signed integers to unsigned
-// in such a way that those with a small absolute value will have smaller
-// encoded values, making them appropriate for encoding using varint.
-//
-//       int32 ->     uint32
-// -------------------------
-//           0 ->          0
-//          -1 ->          1
-//           1 ->          2
-//          -2 ->          3
-//         ... ->        ...
-//  2147483647 -> 4294967294
-// -2147483648 -> 4294967295
-//
-//        >> encode >>
-//        << decode <<
-
-inline uint32 WireFormatLite::ZigZagEncode32(int32 n) {
-  // Note:  the right-shift must be arithmetic
-  return (n << 1) ^ (n >> 31);
-}
-
-inline int32 WireFormatLite::ZigZagDecode32(uint32 n) {
-  return (n >> 1) ^ -static_cast<int32>(n & 1);
-}
-
-inline uint64 WireFormatLite::ZigZagEncode64(int64 n) {
-  // Note:  the right-shift must be arithmetic
-  return (n << 1) ^ (n >> 63);
-}
-
-inline int64 WireFormatLite::ZigZagDecode64(uint64 n) {
-  return (n >> 1) ^ -static_cast<int64>(n & 1);
-}
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__
diff --git a/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h b/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
deleted file mode 100644
index 641cc92f..00000000
--- a/ps-lite/deps/include/google/protobuf/wire_format_lite_inl.h
+++ /dev/null
@@ -1,776 +0,0 @@
-// Protocol Buffers - Google's data interchange format
-// Copyright 2008 Google Inc.  All rights reserved.
-// http://code.google.com/p/protobuf/
-//
-// 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.
-
-// Author: kenton@google.com (Kenton Varda)
-//         wink@google.com (Wink Saville) (refactored from wire_format.h)
-//  Based on original Protocol Buffers design by
-//  Sanjay Ghemawat, Jeff Dean, and others.
-
-#ifndef GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
-#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
-
-#include <string>
-#include <google/protobuf/stubs/common.h>
-#include <google/protobuf/message_lite.h>
-#include <google/protobuf/repeated_field.h>
-#include <google/protobuf/wire_format_lite.h>
-#include <google/protobuf/io/coded_stream.h>
-
-
-namespace google {
-namespace protobuf {
-namespace internal {
-
-// Implementation details of ReadPrimitive.
-
-template <>
-inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_INT32>(
-    io::CodedInputStream* input,
-    int32* value) {
-  uint32 temp;
-  if (!input->ReadVarint32(&temp)) return false;
-  *value = static_cast<int32>(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_INT64>(
-    io::CodedInputStream* input,
-    int64* value) {
-  uint64 temp;
-  if (!input->ReadVarint64(&temp)) return false;
-  *value = static_cast<int64>(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_UINT32>(
-    io::CodedInputStream* input,
-    uint32* value) {
-  return input->ReadVarint32(value);
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_UINT64>(
-    io::CodedInputStream* input,
-    uint64* value) {
-  return input->ReadVarint64(value);
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SINT32>(
-    io::CodedInputStream* input,
-    int32* value) {
-  uint32 temp;
-  if (!input->ReadVarint32(&temp)) return false;
-  *value = ZigZagDecode32(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SINT64>(
-    io::CodedInputStream* input,
-    int64* value) {
-  uint64 temp;
-  if (!input->ReadVarint64(&temp)) return false;
-  *value = ZigZagDecode64(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_FIXED32>(
-    io::CodedInputStream* input,
-    uint32* value) {
-  return input->ReadLittleEndian32(value);
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_FIXED64>(
-    io::CodedInputStream* input,
-    uint64* value) {
-  return input->ReadLittleEndian64(value);
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SFIXED32>(
-    io::CodedInputStream* input,
-    int32* value) {
-  uint32 temp;
-  if (!input->ReadLittleEndian32(&temp)) return false;
-  *value = static_cast<int32>(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SFIXED64>(
-    io::CodedInputStream* input,
-    int64* value) {
-  uint64 temp;
-  if (!input->ReadLittleEndian64(&temp)) return false;
-  *value = static_cast<int64>(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<float, WireFormatLite::TYPE_FLOAT>(
-    io::CodedInputStream* input,
-    float* value) {
-  uint32 temp;
-  if (!input->ReadLittleEndian32(&temp)) return false;
-  *value = DecodeFloat(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<double, WireFormatLite::TYPE_DOUBLE>(
-    io::CodedInputStream* input,
-    double* value) {
-  uint64 temp;
-  if (!input->ReadLittleEndian64(&temp)) return false;
-  *value = DecodeDouble(temp);
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<bool, WireFormatLite::TYPE_BOOL>(
-    io::CodedInputStream* input,
-    bool* value) {
-  uint32 temp;
-  if (!input->ReadVarint32(&temp)) return false;
-  *value = temp != 0;
-  return true;
-}
-template <>
-inline bool WireFormatLite::ReadPrimitive<int, WireFormatLite::TYPE_ENUM>(
-    io::CodedInputStream* input,
-    int* value) {
-  uint32 temp;
-  if (!input->ReadVarint32(&temp)) return false;
-  *value = static_cast<int>(temp);
-  return true;
-}
-
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  uint32, WireFormatLite::TYPE_FIXED32>(
-    const uint8* buffer,
-    uint32* value) {
-  return io::CodedInputStream::ReadLittleEndian32FromArray(buffer, value);
-}
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  uint64, WireFormatLite::TYPE_FIXED64>(
-    const uint8* buffer,
-    uint64* value) {
-  return io::CodedInputStream::ReadLittleEndian64FromArray(buffer, value);
-}
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  int32, WireFormatLite::TYPE_SFIXED32>(
-    const uint8* buffer,
-    int32* value) {
-  uint32 temp;
-  buffer = io::CodedInputStream::ReadLittleEndian32FromArray(buffer, &temp);
-  *value = static_cast<int32>(temp);
-  return buffer;
-}
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  int64, WireFormatLite::TYPE_SFIXED64>(
-    const uint8* buffer,
-    int64* value) {
-  uint64 temp;
-  buffer = io::CodedInputStream::ReadLittleEndian64FromArray(buffer, &temp);
-  *value = static_cast<int64>(temp);
-  return buffer;
-}
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  float, WireFormatLite::TYPE_FLOAT>(
-    const uint8* buffer,
-    float* value) {
-  uint32 temp;
-  buffer = io::CodedInputStream::ReadLittleEndian32FromArray(buffer, &temp);
-  *value = DecodeFloat(temp);
-  return buffer;
-}
-template <>
-inline const uint8* WireFormatLite::ReadPrimitiveFromArray<
-  double, WireFormatLite::TYPE_DOUBLE>(
-    const uint8* buffer,
-    double* value) {
-  uint64 temp;
-  buffer = io::CodedInputStream::ReadLittleEndian64FromArray(buffer, &temp);
-  *value = DecodeDouble(temp);
-  return buffer;
-}
-
-template <typename CType, enum WireFormatLite::FieldType DeclaredType>
-inline bool WireFormatLite::ReadRepeatedPrimitive(int, // tag_size, unused.
-                                               uint32 tag,
-                                               io::CodedInputStream* input,
-                                               RepeatedField<CType>* values) {
-  CType value;
-  if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
-  values->Add(value);
-  int elements_already_reserved = values->Capacity() - values->size();
-  while (elements_already_reserved > 0 && input->ExpectTag(tag)) {
-    if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
-    values->AddAlreadyReserved(value);
-    elements_already_reserved--;
-  }
-  return true;
-}
-
-template <typename CType, enum WireFormatLite::FieldType DeclaredType>
-inline bool WireFormatLite::ReadRepeatedFixedSizePrimitive(
-    int tag_size,
-    uint32 tag,
-    io::CodedInputStream* input,
-    RepeatedField<CType>* values) {
-  GOOGLE_DCHECK_EQ(UInt32Size(tag), tag_size);
-  CType value;
-  if (!ReadPrimitive<CType, DeclaredType>(input, &value))
-    return false;
-  values->Add(value);
-
-  // For fixed size values, repeated values can be read more quickly by
-  // reading directly from a raw array.
-  //
-  // We can get a tight loop by only reading as many elements as can be
-  // added to the RepeatedField without having to do any resizing. Additionally,
-  // we only try to read as many elements as are available from the current
-  // buffer space. Doing so avoids having to perform boundary checks when
-  // reading the value: the maximum number of elements that can be read is
-  // known outside of the loop.
-  const void* void_pointer;
-  int size;
-  input->GetDirectBufferPointerInline(&void_pointer, &size);
-  if (size > 0) {
-    const uint8* buffer = reinterpret_cast<const uint8*>(void_pointer);
-    // The number of bytes each type occupies on the wire.
-    const int per_value_size = tag_size + sizeof(value);
-
-    int elements_available = min(values->Capacity() - values->size(),
-                                 size / per_value_size);
-    int num_read = 0;
-    while (num_read < elements_available &&
-           (buffer = io::CodedInputStream::ExpectTagFromArray(
-               buffer, tag)) != NULL) {
-      buffer = ReadPrimitiveFromArray<CType, DeclaredType>(buffer, &value);
-      values->AddAlreadyReserved(value);
-      ++num_read;
-    }
-    const int read_bytes = num_read * per_value_size;
-    if (read_bytes > 0) {
-      input->Skip(read_bytes);
-    }
-  }
-  return true;
-}
-
-// Specializations of ReadRepeatedPrimitive for the fixed size types, which use 
-// the optimized code path.
-#define READ_REPEATED_FIXED_SIZE_PRIMITIVE(CPPTYPE, DECLARED_TYPE)             \
-template <>                                                                    \
-inline bool WireFormatLite::ReadRepeatedPrimitive<                             \
-  CPPTYPE, WireFormatLite::DECLARED_TYPE>(                                     \
-    int tag_size,                                                              \
-    uint32 tag,                                                                \
-    io::CodedInputStream* input,                                               \
-    RepeatedField<CPPTYPE>* values) {                                          \
-  return ReadRepeatedFixedSizePrimitive<                                       \
-    CPPTYPE, WireFormatLite::DECLARED_TYPE>(                                   \
-      tag_size, tag, input, values);                                           \
-}
-
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(uint32, TYPE_FIXED32)
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(uint64, TYPE_FIXED64)
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(int32, TYPE_SFIXED32)
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(int64, TYPE_SFIXED64)
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(float, TYPE_FLOAT)
-READ_REPEATED_FIXED_SIZE_PRIMITIVE(double, TYPE_DOUBLE)
-
-#undef READ_REPEATED_FIXED_SIZE_PRIMITIVE
-
-template <typename CType, enum WireFormatLite::FieldType DeclaredType>
-bool WireFormatLite::ReadRepeatedPrimitiveNoInline(
-    int tag_size,
-    uint32 tag,
-    io::CodedInputStream* input,
-    RepeatedField<CType>* value) {
-  return ReadRepeatedPrimitive<CType, DeclaredType>(
-      tag_size, tag, input, value);
-}
-
-template <typename CType, enum WireFormatLite::FieldType DeclaredType>
-inline bool WireFormatLite::ReadPackedPrimitive(io::CodedInputStream* input,
-                                                RepeatedField<CType>* values) {
-  uint32 length;
-  if (!input->ReadVarint32(&length)) return false;
-  io::CodedInputStream::Limit limit = input->PushLimit(length);
-  while (input->BytesUntilLimit() > 0) {
-    CType value;
-    if (!ReadPrimitive<CType, DeclaredType>(input, &value)) return false;
-    values->Add(value);
-  }
-  input->PopLimit(limit);
-  return true;
-}
-
-template <typename CType, enum WireFormatLite::FieldType DeclaredType>
-bool WireFormatLite::ReadPackedPrimitiveNoInline(io::CodedInputStream* input,
-                                                 RepeatedField<CType>* values) {
-  return ReadPackedPrimitive<CType, DeclaredType>(input, values);
-}
-
-
-inline bool WireFormatLite::ReadGroup(int field_number,
-                                      io::CodedInputStream* input,
-                                      MessageLite* value) {
-  if (!input->IncrementRecursionDepth()) return false;
-  if (!value->MergePartialFromCodedStream(input)) return false;
-  input->DecrementRecursionDepth();
-  // Make sure the last thing read was an end tag for this group.
-  if (!input->LastTagWas(MakeTag(field_number, WIRETYPE_END_GROUP))) {
-    return false;
-  }
-  return true;
-}
-inline bool WireFormatLite::ReadMessage(io::CodedInputStream* input,
-                                        MessageLite* value) {
-  uint32 length;
-  if (!input->ReadVarint32(&length)) return false;
-  if (!input->IncrementRecursionDepth()) return false;
-  io::CodedInputStream::Limit limit = input->PushLimit(length);
-  if (!value->MergePartialFromCodedStream(input)) return false;
-  // Make sure that parsing stopped when the limit was hit, not at an endgroup
-  // tag.
-  if (!input->ConsumedEntireMessage()) return false;
-  input->PopLimit(limit);
-  input->DecrementRecursionDepth();
-  return true;
-}
-
-// We name the template parameter something long and extremely unlikely to occur
-// elsewhere because a *qualified* member access expression designed to avoid
-// virtual dispatch, C++03 [basic.lookup.classref] 3.4.5/4 requires that the
-// name of the qualifying class to be looked up both in the context of the full
-// expression (finding the template parameter) and in the context of the object
-// whose member we are accessing. This could potentially find a nested type
-// within that object. The standard goes on to require these names to refer to
-// the same entity, which this collision would violate. The lack of a safe way
-// to avoid this collision appears to be a defect in the standard, but until it
-// is corrected, we choose the name to avoid accidental collisions.
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline bool WireFormatLite::ReadGroupNoVirtual(
-    int field_number, io::CodedInputStream* input,
-    MessageType_WorkAroundCppLookupDefect* value) {
-  if (!input->IncrementRecursionDepth()) return false;
-  if (!value->
-      MessageType_WorkAroundCppLookupDefect::MergePartialFromCodedStream(input))
-    return false;
-  input->DecrementRecursionDepth();
-  // Make sure the last thing read was an end tag for this group.
-  if (!input->LastTagWas(MakeTag(field_number, WIRETYPE_END_GROUP))) {
-    return false;
-  }
-  return true;
-}
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline bool WireFormatLite::ReadMessageNoVirtual(
-    io::CodedInputStream* input, MessageType_WorkAroundCppLookupDefect* value) {
-  uint32 length;
-  if (!input->ReadVarint32(&length)) return false;
-  if (!input->IncrementRecursionDepth()) return false;
-  io::CodedInputStream::Limit limit = input->PushLimit(length);
-  if (!value->
-      MessageType_WorkAroundCppLookupDefect::MergePartialFromCodedStream(input))
-    return false;
-  // Make sure that parsing stopped when the limit was hit, not at an endgroup
-  // tag.
-  if (!input->ConsumedEntireMessage()) return false;
-  input->PopLimit(limit);
-  input->DecrementRecursionDepth();
-  return true;
-}
-
-// ===================================================================
-
-inline void WireFormatLite::WriteTag(int field_number, WireType type,
-                                     io::CodedOutputStream* output) {
-  output->WriteTag(MakeTag(field_number, type));
-}
-
-inline void WireFormatLite::WriteInt32NoTag(int32 value,
-                                            io::CodedOutputStream* output) {
-  output->WriteVarint32SignExtended(value);
-}
-inline void WireFormatLite::WriteInt64NoTag(int64 value,
-                                            io::CodedOutputStream* output) {
-  output->WriteVarint64(static_cast<uint64>(value));
-}
-inline void WireFormatLite::WriteUInt32NoTag(uint32 value,
-                                             io::CodedOutputStream* output) {
-  output->WriteVarint32(value);
-}
-inline void WireFormatLite::WriteUInt64NoTag(uint64 value,
-                                             io::CodedOutputStream* output) {
-  output->WriteVarint64(value);
-}
-inline void WireFormatLite::WriteSInt32NoTag(int32 value,
-                                             io::CodedOutputStream* output) {
-  output->WriteVarint32(ZigZagEncode32(value));
-}
-inline void WireFormatLite::WriteSInt64NoTag(int64 value,
-                                             io::CodedOutputStream* output) {
-  output->WriteVarint64(ZigZagEncode64(value));
-}
-inline void WireFormatLite::WriteFixed32NoTag(uint32 value,
-                                              io::CodedOutputStream* output) {
-  output->WriteLittleEndian32(value);
-}
-inline void WireFormatLite::WriteFixed64NoTag(uint64 value,
-                                              io::CodedOutputStream* output) {
-  output->WriteLittleEndian64(value);
-}
-inline void WireFormatLite::WriteSFixed32NoTag(int32 value,
-                                               io::CodedOutputStream* output) {
-  output->WriteLittleEndian32(static_cast<uint32>(value));
-}
-inline void WireFormatLite::WriteSFixed64NoTag(int64 value,
-                                               io::CodedOutputStream* output) {
-  output->WriteLittleEndian64(static_cast<uint64>(value));
-}
-inline void WireFormatLite::WriteFloatNoTag(float value,
-                                            io::CodedOutputStream* output) {
-  output->WriteLittleEndian32(EncodeFloat(value));
-}
-inline void WireFormatLite::WriteDoubleNoTag(double value,
-                                             io::CodedOutputStream* output) {
-  output->WriteLittleEndian64(EncodeDouble(value));
-}
-inline void WireFormatLite::WriteBoolNoTag(bool value,
-                                           io::CodedOutputStream* output) {
-  output->WriteVarint32(value ? 1 : 0);
-}
-inline void WireFormatLite::WriteEnumNoTag(int value,
-                                           io::CodedOutputStream* output) {
-  output->WriteVarint32SignExtended(value);
-}
-
-// See comment on ReadGroupNoVirtual to understand the need for this template
-// parameter name.
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline void WireFormatLite::WriteGroupNoVirtual(
-    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
-    io::CodedOutputStream* output) {
-  WriteTag(field_number, WIRETYPE_START_GROUP, output);
-  value.MessageType_WorkAroundCppLookupDefect::SerializeWithCachedSizes(output);
-  WriteTag(field_number, WIRETYPE_END_GROUP, output);
-}
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline void WireFormatLite::WriteMessageNoVirtual(
-    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
-    io::CodedOutputStream* output) {
-  WriteTag(field_number, WIRETYPE_LENGTH_DELIMITED, output);
-  output->WriteVarint32(
-      value.MessageType_WorkAroundCppLookupDefect::GetCachedSize());
-  value.MessageType_WorkAroundCppLookupDefect::SerializeWithCachedSizes(output);
-}
-
-// ===================================================================
-
-inline uint8* WireFormatLite::WriteTagToArray(int field_number,
-                                              WireType type,
-                                              uint8* target) {
-  return io::CodedOutputStream::WriteTagToArray(MakeTag(field_number, type),
-                                                target);
-}
-
-inline uint8* WireFormatLite::WriteInt32NoTagToArray(int32 value,
-                                                     uint8* target) {
-  return io::CodedOutputStream::WriteVarint32SignExtendedToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteInt64NoTagToArray(int64 value,
-                                                     uint8* target) {
-  return io::CodedOutputStream::WriteVarint64ToArray(
-      static_cast<uint64>(value), target);
-}
-inline uint8* WireFormatLite::WriteUInt32NoTagToArray(uint32 value,
-                                                      uint8* target) {
-  return io::CodedOutputStream::WriteVarint32ToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteUInt64NoTagToArray(uint64 value,
-                                                      uint8* target) {
-  return io::CodedOutputStream::WriteVarint64ToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSInt32NoTagToArray(int32 value,
-                                                      uint8* target) {
-  return io::CodedOutputStream::WriteVarint32ToArray(ZigZagEncode32(value),
-                                                     target);
-}
-inline uint8* WireFormatLite::WriteSInt64NoTagToArray(int64 value,
-                                                      uint8* target) {
-  return io::CodedOutputStream::WriteVarint64ToArray(ZigZagEncode64(value),
-                                                     target);
-}
-inline uint8* WireFormatLite::WriteFixed32NoTagToArray(uint32 value,
-                                                       uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian32ToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteFixed64NoTagToArray(uint64 value,
-                                                       uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian64ToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSFixed32NoTagToArray(int32 value,
-                                                        uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian32ToArray(
-      static_cast<uint32>(value), target);
-}
-inline uint8* WireFormatLite::WriteSFixed64NoTagToArray(int64 value,
-                                                        uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian64ToArray(
-      static_cast<uint64>(value), target);
-}
-inline uint8* WireFormatLite::WriteFloatNoTagToArray(float value,
-                                                     uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian32ToArray(EncodeFloat(value),
-                                                           target);
-}
-inline uint8* WireFormatLite::WriteDoubleNoTagToArray(double value,
-                                                      uint8* target) {
-  return io::CodedOutputStream::WriteLittleEndian64ToArray(EncodeDouble(value),
-                                                           target);
-}
-inline uint8* WireFormatLite::WriteBoolNoTagToArray(bool value,
-                                                    uint8* target) {
-  return io::CodedOutputStream::WriteVarint32ToArray(value ? 1 : 0, target);
-}
-inline uint8* WireFormatLite::WriteEnumNoTagToArray(int value,
-                                                    uint8* target) {
-  return io::CodedOutputStream::WriteVarint32SignExtendedToArray(value, target);
-}
-
-inline uint8* WireFormatLite::WriteInt32ToArray(int field_number,
-                                                int32 value,
-                                                uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteInt32NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteInt64ToArray(int field_number,
-                                                int64 value,
-                                                uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteInt64NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteUInt32ToArray(int field_number,
-                                                 uint32 value,
-                                                 uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteUInt32NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteUInt64ToArray(int field_number,
-                                                 uint64 value,
-                                                 uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteUInt64NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSInt32ToArray(int field_number,
-                                                 int32 value,
-                                                 uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteSInt32NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSInt64ToArray(int field_number,
-                                                 int64 value,
-                                                 uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteSInt64NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteFixed32ToArray(int field_number,
-                                                  uint32 value,
-                                                  uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
-  return WriteFixed32NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteFixed64ToArray(int field_number,
-                                                  uint64 value,
-                                                  uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
-  return WriteFixed64NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSFixed32ToArray(int field_number,
-                                                   int32 value,
-                                                   uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
-  return WriteSFixed32NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteSFixed64ToArray(int field_number,
-                                                   int64 value,
-                                                   uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
-  return WriteSFixed64NoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteFloatToArray(int field_number,
-                                                float value,
-                                                uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED32, target);
-  return WriteFloatNoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteDoubleToArray(int field_number,
-                                                 double value,
-                                                 uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_FIXED64, target);
-  return WriteDoubleNoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteBoolToArray(int field_number,
-                                               bool value,
-                                               uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteBoolNoTagToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteEnumToArray(int field_number,
-                                               int value,
-                                               uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_VARINT, target);
-  return WriteEnumNoTagToArray(value, target);
-}
-
-inline uint8* WireFormatLite::WriteStringToArray(int field_number,
-                                                 const string& value,
-                                                 uint8* target) {
-  // String is for UTF-8 text only
-  // WARNING:  In wire_format.cc, both strings and bytes are handled by
-  //   WriteString() to avoid code duplication.  If the implementations become
-  //   different, you will need to update that usage.
-  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
-  target = io::CodedOutputStream::WriteVarint32ToArray(value.size(), target);
-  return io::CodedOutputStream::WriteStringToArray(value, target);
-}
-inline uint8* WireFormatLite::WriteBytesToArray(int field_number,
-                                                const string& value,
-                                                uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
-  target = io::CodedOutputStream::WriteVarint32ToArray(value.size(), target);
-  return io::CodedOutputStream::WriteStringToArray(value, target);
-}
-
-
-inline uint8* WireFormatLite::WriteGroupToArray(int field_number,
-                                                const MessageLite& value,
-                                                uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_START_GROUP, target);
-  target = value.SerializeWithCachedSizesToArray(target);
-  return WriteTagToArray(field_number, WIRETYPE_END_GROUP, target);
-}
-inline uint8* WireFormatLite::WriteMessageToArray(int field_number,
-                                                  const MessageLite& value,
-                                                  uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
-  target = io::CodedOutputStream::WriteVarint32ToArray(
-    value.GetCachedSize(), target);
-  return value.SerializeWithCachedSizesToArray(target);
-}
-
-// See comment on ReadGroupNoVirtual to understand the need for this template
-// parameter name.
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline uint8* WireFormatLite::WriteGroupNoVirtualToArray(
-    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
-    uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_START_GROUP, target);
-  target = value.MessageType_WorkAroundCppLookupDefect
-      ::SerializeWithCachedSizesToArray(target);
-  return WriteTagToArray(field_number, WIRETYPE_END_GROUP, target);
-}
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline uint8* WireFormatLite::WriteMessageNoVirtualToArray(
-    int field_number, const MessageType_WorkAroundCppLookupDefect& value,
-    uint8* target) {
-  target = WriteTagToArray(field_number, WIRETYPE_LENGTH_DELIMITED, target);
-  target = io::CodedOutputStream::WriteVarint32ToArray(
-    value.MessageType_WorkAroundCppLookupDefect::GetCachedSize(), target);
-  return value.MessageType_WorkAroundCppLookupDefect
-      ::SerializeWithCachedSizesToArray(target);
-}
-
-// ===================================================================
-
-inline int WireFormatLite::Int32Size(int32 value) {
-  return io::CodedOutputStream::VarintSize32SignExtended(value);
-}
-inline int WireFormatLite::Int64Size(int64 value) {
-  return io::CodedOutputStream::VarintSize64(static_cast<uint64>(value));
-}
-inline int WireFormatLite::UInt32Size(uint32 value) {
-  return io::CodedOutputStream::VarintSize32(value);
-}
-inline int WireFormatLite::UInt64Size(uint64 value) {
-  return io::CodedOutputStream::VarintSize64(value);
-}
-inline int WireFormatLite::SInt32Size(int32 value) {
-  return io::CodedOutputStream::VarintSize32(ZigZagEncode32(value));
-}
-inline int WireFormatLite::SInt64Size(int64 value) {
-  return io::CodedOutputStream::VarintSize64(ZigZagEncode64(value));
-}
-inline int WireFormatLite::EnumSize(int value) {
-  return io::CodedOutputStream::VarintSize32SignExtended(value);
-}
-
-inline int WireFormatLite::StringSize(const string& value) {
-  return io::CodedOutputStream::VarintSize32(value.size()) +
-         value.size();
-}
-inline int WireFormatLite::BytesSize(const string& value) {
-  return io::CodedOutputStream::VarintSize32(value.size()) +
-         value.size();
-}
-
-
-inline int WireFormatLite::GroupSize(const MessageLite& value) {
-  return value.ByteSize();
-}
-inline int WireFormatLite::MessageSize(const MessageLite& value) {
-  return LengthDelimitedSize(value.ByteSize());
-}
-
-// See comment on ReadGroupNoVirtual to understand the need for this template
-// parameter name.
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline int WireFormatLite::GroupSizeNoVirtual(
-    const MessageType_WorkAroundCppLookupDefect& value) {
-  return value.MessageType_WorkAroundCppLookupDefect::ByteSize();
-}
-template<typename MessageType_WorkAroundCppLookupDefect>
-inline int WireFormatLite::MessageSizeNoVirtual(
-    const MessageType_WorkAroundCppLookupDefect& value) {
-  return LengthDelimitedSize(
-      value.MessageType_WorkAroundCppLookupDefect::ByteSize());
-}
-
-inline int WireFormatLite::LengthDelimitedSize(int length) {
-  return io::CodedOutputStream::VarintSize32(length) + length;
-}
-
-}  // namespace internal
-}  // namespace protobuf
-
-}  // namespace google
-#endif  // GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__
diff --git a/ps-lite/deps/include/zmq.h b/ps-lite/deps/include/zmq.h
deleted file mode 100644
index c58885b4..00000000
--- a/ps-lite/deps/include/zmq.h
+++ /dev/null
@@ -1,463 +0,0 @@
-/*
-    Copyright (c) 2007-2015 Contributors as noted in the AUTHORS file
-
-    This file is part of 0MQ.
-
-    0MQ is free software; you can redistribute it and/or modify it under
-    the terms of the GNU Lesser General Public License as published by
-    the Free Software Foundation; either version 3 of the License, or
-    (at your option) any later version.
-
-    0MQ is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-
-    *************************************************************************
-    NOTE to contributors. This file comprises the principal public contract
-    for ZeroMQ API users (along with zmq_utils.h). Any change to this file
-    supplied in a stable release SHOULD not break existing applications.
-    In practice this means that the value of constants must not change, and
-    that old values may not be reused for new constants.
-    *************************************************************************
-*/
-
-#ifndef __ZMQ_H_INCLUDED__
-#define __ZMQ_H_INCLUDED__
-
-/*  Version macros for compile-time API version detection                     */
-#define ZMQ_VERSION_MAJOR 4
-#define ZMQ_VERSION_MINOR 1
-#define ZMQ_VERSION_PATCH 4
-
-#define ZMQ_MAKE_VERSION(major, minor, patch) \
-    ((major) * 10000 + (minor) * 100 + (patch))
-#define ZMQ_VERSION \
-    ZMQ_MAKE_VERSION(ZMQ_VERSION_MAJOR, ZMQ_VERSION_MINOR, ZMQ_VERSION_PATCH)
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-#if !defined _WIN32_WCE
-#include <errno.h>
-#endif
-#include <stddef.h>
-#include <stdio.h>
-#if defined _WIN32
-#include <winsock2.h>
-#endif
-
-/*  Handle DSO symbol visibility                                             */
-#if defined _WIN32
-#   if defined ZMQ_STATIC
-#       define ZMQ_EXPORT
-#   elif defined DLL_EXPORT
-#       define ZMQ_EXPORT __declspec(dllexport)
-#   else
-#       define ZMQ_EXPORT __declspec(dllimport)
-#   endif
-#else
-#   if defined __SUNPRO_C  || defined __SUNPRO_CC
-#       define ZMQ_EXPORT __global
-#   elif (defined __GNUC__ && __GNUC__ >= 4) || defined __INTEL_COMPILER
-#       define ZMQ_EXPORT __attribute__ ((visibility("default")))
-#   else
-#       define ZMQ_EXPORT
-#   endif
-#endif
-
-/*  Define integer types needed for event interface                          */
-#define ZMQ_DEFINED_STDINT 1
-#if defined ZMQ_HAVE_SOLARIS || defined ZMQ_HAVE_OPENVMS
-#   include <inttypes.h>
-#else
-#   include <stdint.h>
-#endif
-
-
-/******************************************************************************/
-/*  0MQ errors.                                                               */
-/******************************************************************************/
-
-/*  A number random enough not to collide with different errno ranges on      */
-/*  different OSes. The assumption is that error_t is at least 32-bit type.   */
-#define ZMQ_HAUSNUMERO 156384712
-
-/*  On Windows platform some of the standard POSIX errnos are not defined.    */
-#ifndef ENOTSUP
-#define ENOTSUP (ZMQ_HAUSNUMERO + 1)
-#endif
-#ifndef EPROTONOSUPPORT
-#define EPROTONOSUPPORT (ZMQ_HAUSNUMERO + 2)
-#endif
-#ifndef ENOBUFS
-#define ENOBUFS (ZMQ_HAUSNUMERO + 3)
-#endif
-#ifndef ENETDOWN
-#define ENETDOWN (ZMQ_HAUSNUMERO + 4)
-#endif
-#ifndef EADDRINUSE
-#define EADDRINUSE (ZMQ_HAUSNUMERO + 5)
-#endif
-#ifndef EADDRNOTAVAIL
-#define EADDRNOTAVAIL (ZMQ_HAUSNUMERO + 6)
-#endif
-#ifndef ECONNREFUSED
-#define ECONNREFUSED (ZMQ_HAUSNUMERO + 7)
-#endif
-#ifndef EINPROGRESS
-#define EINPROGRESS (ZMQ_HAUSNUMERO + 8)
-#endif
-#ifndef ENOTSOCK
-#define ENOTSOCK (ZMQ_HAUSNUMERO + 9)
-#endif
-#ifndef EMSGSIZE
-#define EMSGSIZE (ZMQ_HAUSNUMERO + 10)
-#endif
-#ifndef EAFNOSUPPORT
-#define EAFNOSUPPORT (ZMQ_HAUSNUMERO + 11)
-#endif
-#ifndef ENETUNREACH
-#define ENETUNREACH (ZMQ_HAUSNUMERO + 12)
-#endif
-#ifndef ECONNABORTED
-#define ECONNABORTED (ZMQ_HAUSNUMERO + 13)
-#endif
-#ifndef ECONNRESET
-#define ECONNRESET (ZMQ_HAUSNUMERO + 14)
-#endif
-#ifndef ENOTCONN
-#define ENOTCONN (ZMQ_HAUSNUMERO + 15)
-#endif
-#ifndef ETIMEDOUT
-#define ETIMEDOUT (ZMQ_HAUSNUMERO + 16)
-#endif
-#ifndef EHOSTUNREACH
-#define EHOSTUNREACH (ZMQ_HAUSNUMERO + 17)
-#endif
-#ifndef ENETRESET
-#define ENETRESET (ZMQ_HAUSNUMERO + 18)
-#endif
-
-/*  Native 0MQ error codes.                                                   */
-#define EFSM (ZMQ_HAUSNUMERO + 51)
-#define ENOCOMPATPROTO (ZMQ_HAUSNUMERO + 52)
-#define ETERM (ZMQ_HAUSNUMERO + 53)
-#define EMTHREAD (ZMQ_HAUSNUMERO + 54)
-
-/*  This function retrieves the errno as it is known to 0MQ library. The goal */
-/*  of this function is to make the code 100% portable, including where 0MQ   */
-/*  compiled with certain CRT library (on Windows) is linked to an            */
-/*  application that uses different CRT library.                              */
-ZMQ_EXPORT int zmq_errno (void);
-
-/*  Resolves system errors and 0MQ errors to human-readable string.           */
-ZMQ_EXPORT const char *zmq_strerror (int errnum);
-
-/*  Run-time API version detection                                            */
-ZMQ_EXPORT void zmq_version (int *major, int *minor, int *patch);
-
-/******************************************************************************/
-/*  0MQ infrastructure (a.k.a. context) initialisation & termination.         */
-/******************************************************************************/
-
-/*  New API                                                                   */
-/*  Context options                                                           */
-#define ZMQ_IO_THREADS  1
-#define ZMQ_MAX_SOCKETS 2
-#define ZMQ_SOCKET_LIMIT 3
-#define ZMQ_THREAD_PRIORITY 3
-#define ZMQ_THREAD_SCHED_POLICY 4
-
-/*  Default for new contexts                                                  */
-#define ZMQ_IO_THREADS_DFLT  1
-#define ZMQ_MAX_SOCKETS_DFLT 1023
-#define ZMQ_THREAD_PRIORITY_DFLT -1
-#define ZMQ_THREAD_SCHED_POLICY_DFLT -1
-
-ZMQ_EXPORT void *zmq_ctx_new (void);
-ZMQ_EXPORT int zmq_ctx_term (void *context);
-ZMQ_EXPORT int zmq_ctx_shutdown (void *ctx_);
-ZMQ_EXPORT int zmq_ctx_set (void *context, int option, int optval);
-ZMQ_EXPORT int zmq_ctx_get (void *context, int option);
-
-/*  Old (legacy) API                                                          */
-ZMQ_EXPORT void *zmq_init (int io_threads);
-ZMQ_EXPORT int zmq_term (void *context);
-ZMQ_EXPORT int zmq_ctx_destroy (void *context);
-
-
-/******************************************************************************/
-/*  0MQ message definition.                                                   */
-/******************************************************************************/
-
-typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;
-
-typedef void (zmq_free_fn) (void *data, void *hint);
-
-ZMQ_EXPORT int zmq_msg_init (zmq_msg_t *msg);
-ZMQ_EXPORT int zmq_msg_init_size (zmq_msg_t *msg, size_t size);
-ZMQ_EXPORT int zmq_msg_init_data (zmq_msg_t *msg, void *data,
-    size_t size, zmq_free_fn *ffn, void *hint);
-ZMQ_EXPORT int zmq_msg_send (zmq_msg_t *msg, void *s, int flags);
-ZMQ_EXPORT int zmq_msg_recv (zmq_msg_t *msg, void *s, int flags);
-ZMQ_EXPORT int zmq_msg_close (zmq_msg_t *msg);
-ZMQ_EXPORT int zmq_msg_move (zmq_msg_t *dest, zmq_msg_t *src);
-ZMQ_EXPORT int zmq_msg_copy (zmq_msg_t *dest, zmq_msg_t *src);
-ZMQ_EXPORT void *zmq_msg_data (zmq_msg_t *msg);
-ZMQ_EXPORT size_t zmq_msg_size (zmq_msg_t *msg);
-ZMQ_EXPORT int zmq_msg_more (zmq_msg_t *msg);
-ZMQ_EXPORT int zmq_msg_get (zmq_msg_t *msg, int property);
-ZMQ_EXPORT int zmq_msg_set (zmq_msg_t *msg, int property, int optval);
-ZMQ_EXPORT const char *zmq_msg_gets (zmq_msg_t *msg, const char *property);
-
-
-/******************************************************************************/
-/*  0MQ socket definition.                                                    */
-/******************************************************************************/
-
-/*  Socket types.                                                             */
-#define ZMQ_PAIR 0
-#define ZMQ_PUB 1
-#define ZMQ_SUB 2
-#define ZMQ_REQ 3
-#define ZMQ_REP 4
-#define ZMQ_DEALER 5
-#define ZMQ_ROUTER 6
-#define ZMQ_PULL 7
-#define ZMQ_PUSH 8
-#define ZMQ_XPUB 9
-#define ZMQ_XSUB 10
-#define ZMQ_STREAM 11
-
-/*  Deprecated aliases                                                        */
-#define ZMQ_XREQ ZMQ_DEALER
-#define ZMQ_XREP ZMQ_ROUTER
-
-/*  Socket options.                                                           */
-#define ZMQ_AFFINITY 4
-#define ZMQ_IDENTITY 5
-#define ZMQ_SUBSCRIBE 6
-#define ZMQ_UNSUBSCRIBE 7
-#define ZMQ_RATE 8
-#define ZMQ_RECOVERY_IVL 9
-#define ZMQ_SNDBUF 11
-#define ZMQ_RCVBUF 12
-#define ZMQ_RCVMORE 13
-#define ZMQ_FD 14
-#define ZMQ_EVENTS 15
-#define ZMQ_TYPE 16
-#define ZMQ_LINGER 17
-#define ZMQ_RECONNECT_IVL 18
-#define ZMQ_BACKLOG 19
-#define ZMQ_RECONNECT_IVL_MAX 21
-#define ZMQ_MAXMSGSIZE 22
-#define ZMQ_SNDHWM 23
-#define ZMQ_RCVHWM 24
-#define ZMQ_MULTICAST_HOPS 25
-#define ZMQ_RCVTIMEO 27
-#define ZMQ_SNDTIMEO 28
-#define ZMQ_LAST_ENDPOINT 32
-#define ZMQ_ROUTER_MANDATORY 33
-#define ZMQ_TCP_KEEPALIVE 34
-#define ZMQ_TCP_KEEPALIVE_CNT 35
-#define ZMQ_TCP_KEEPALIVE_IDLE 36
-#define ZMQ_TCP_KEEPALIVE_INTVL 37
-#define ZMQ_IMMEDIATE 39
-#define ZMQ_XPUB_VERBOSE 40
-#define ZMQ_ROUTER_RAW 41
-#define ZMQ_IPV6 42
-#define ZMQ_MECHANISM 43
-#define ZMQ_PLAIN_SERVER 44
-#define ZMQ_PLAIN_USERNAME 45
-#define ZMQ_PLAIN_PASSWORD 46
-#define ZMQ_CURVE_SERVER 47
-#define ZMQ_CURVE_PUBLICKEY 48
-#define ZMQ_CURVE_SECRETKEY 49
-#define ZMQ_CURVE_SERVERKEY 50
-#define ZMQ_PROBE_ROUTER 51
-#define ZMQ_REQ_CORRELATE 52
-#define ZMQ_REQ_RELAXED 53
-#define ZMQ_CONFLATE 54
-#define ZMQ_ZAP_DOMAIN 55
-#define ZMQ_ROUTER_HANDOVER 56
-#define ZMQ_TOS 57
-#define ZMQ_CONNECT_RID 61
-#define ZMQ_GSSAPI_SERVER 62
-#define ZMQ_GSSAPI_PRINCIPAL 63
-#define ZMQ_GSSAPI_SERVICE_PRINCIPAL 64
-#define ZMQ_GSSAPI_PLAINTEXT 65
-#define ZMQ_HANDSHAKE_IVL 66
-#define ZMQ_SOCKS_PROXY 68
-#define ZMQ_XPUB_NODROP 69
-
-/*  Message options                                                           */
-#define ZMQ_MORE 1
-#define ZMQ_SRCFD 2
-#define ZMQ_SHARED 3
-
-/*  Send/recv options.                                                        */
-#define ZMQ_DONTWAIT 1
-#define ZMQ_SNDMORE 2
-
-/*  Security mechanisms                                                       */
-#define ZMQ_NULL 0
-#define ZMQ_PLAIN 1
-#define ZMQ_CURVE 2
-#define ZMQ_GSSAPI 3
-
-/*  Deprecated options and aliases                                            */
-#define ZMQ_TCP_ACCEPT_FILTER       38
-#define ZMQ_IPC_FILTER_PID          58
-#define ZMQ_IPC_FILTER_UID          59
-#define ZMQ_IPC_FILTER_GID          60
-#define ZMQ_IPV4ONLY                31
-#define ZMQ_DELAY_ATTACH_ON_CONNECT ZMQ_IMMEDIATE
-#define ZMQ_NOBLOCK                 ZMQ_DONTWAIT
-#define ZMQ_FAIL_UNROUTABLE         ZMQ_ROUTER_MANDATORY
-#define ZMQ_ROUTER_BEHAVIOR         ZMQ_ROUTER_MANDATORY
-
-/******************************************************************************/
-/*  0MQ socket events and monitoring                                          */
-/******************************************************************************/
-
-/*  Socket transport events (TCP and IPC only)                                */
-
-#define ZMQ_EVENT_CONNECTED         0x0001
-#define ZMQ_EVENT_CONNECT_DELAYED   0x0002
-#define ZMQ_EVENT_CONNECT_RETRIED   0x0004
-#define ZMQ_EVENT_LISTENING         0x0008
-#define ZMQ_EVENT_BIND_FAILED       0x0010
-#define ZMQ_EVENT_ACCEPTED          0x0020
-#define ZMQ_EVENT_ACCEPT_FAILED     0x0040
-#define ZMQ_EVENT_CLOSED            0x0080
-#define ZMQ_EVENT_CLOSE_FAILED      0x0100
-#define ZMQ_EVENT_DISCONNECTED      0x0200
-#define ZMQ_EVENT_MONITOR_STOPPED   0x0400
-#define ZMQ_EVENT_ALL               0xFFFF
-
-ZMQ_EXPORT void *zmq_socket (void *, int type);
-ZMQ_EXPORT int zmq_close (void *s);
-ZMQ_EXPORT int zmq_setsockopt (void *s, int option, const void *optval,
-    size_t optvallen);
-ZMQ_EXPORT int zmq_getsockopt (void *s, int option, void *optval,
-    size_t *optvallen);
-ZMQ_EXPORT int zmq_bind (void *s, const char *addr);
-ZMQ_EXPORT int zmq_connect (void *s, const char *addr);
-ZMQ_EXPORT int zmq_unbind (void *s, const char *addr);
-ZMQ_EXPORT int zmq_disconnect (void *s, const char *addr);
-ZMQ_EXPORT int zmq_send (void *s, const void *buf, size_t len, int flags);
-ZMQ_EXPORT int zmq_send_const (void *s, const void *buf, size_t len, int flags);
-ZMQ_EXPORT int zmq_recv (void *s, void *buf, size_t len, int flags);
-ZMQ_EXPORT int zmq_socket_monitor (void *s, const char *addr, int events);
-
-
-/******************************************************************************/
-/*  I/O multiplexing.                                                         */
-/******************************************************************************/
-
-#define ZMQ_POLLIN 1
-#define ZMQ_POLLOUT 2
-#define ZMQ_POLLERR 4
-
-typedef struct zmq_pollitem_t
-{
-    void *socket;
-#if defined _WIN32
-    SOCKET fd;
-#else
-    int fd;
-#endif
-    short events;
-    short revents;
-} zmq_pollitem_t;
-
-#define ZMQ_POLLITEMS_DFLT 16
-
-ZMQ_EXPORT int zmq_poll (zmq_pollitem_t *items, int nitems, long timeout);
-
-/******************************************************************************/
-/*  Message proxying                                                          */
-/******************************************************************************/
-
-ZMQ_EXPORT int zmq_proxy (void *frontend, void *backend, void *capture);
-ZMQ_EXPORT int zmq_proxy_steerable (void *frontend, void *backend, void *capture, void *control);
-
-/******************************************************************************/
-/*  Probe library capabilities                                                */
-/******************************************************************************/
-
-#define ZMQ_HAS_CAPABILITIES 1
-ZMQ_EXPORT int zmq_has (const char *capability);
-
-/*  Deprecated aliases */
-#define ZMQ_STREAMER 1
-#define ZMQ_FORWARDER 2
-#define ZMQ_QUEUE 3
-
-/*  Deprecated methods */
-ZMQ_EXPORT int zmq_device (int type, void *frontend, void *backend);
-ZMQ_EXPORT int zmq_sendmsg (void *s, zmq_msg_t *msg, int flags);
-ZMQ_EXPORT int zmq_recvmsg (void *s, zmq_msg_t *msg, int flags);
-
-
-/******************************************************************************/
-/*  Encryption functions                                                      */
-/******************************************************************************/
-
-/*  Encode data with Z85 encoding. Returns encoded data                       */
-ZMQ_EXPORT char *zmq_z85_encode (char *dest, const uint8_t *data, size_t size);
-
-/*  Decode data with Z85 encoding. Returns decoded data                       */
-ZMQ_EXPORT uint8_t *zmq_z85_decode (uint8_t *dest, const char *string);
-
-/*  Generate z85-encoded public and private keypair with libsodium.           */
-/*  Returns 0 on success.                                                     */
-ZMQ_EXPORT int zmq_curve_keypair (char *z85_public_key, char *z85_secret_key);
-
-
-/******************************************************************************/
-/*  These functions are not documented by man pages -- use at your own risk.  */
-/*  If you need these to be part of the formal ZMQ API, then (a) write a man  */
-/*  page, and (b) write a test case in tests.                                 */
-/******************************************************************************/
-
-struct iovec;
-
-ZMQ_EXPORT int zmq_sendiov (void *s, struct iovec *iov, size_t count, int flags);
-ZMQ_EXPORT int zmq_recviov (void *s, struct iovec *iov, size_t *count, int flags);
-
-/*  Helper functions are used by perf tests so that they don't have to care   */
-/*  about minutiae of time-related functions on different OS platforms.       */
-
-/*  Starts the stopwatch. Returns the handle to the watch.                    */
-ZMQ_EXPORT void *zmq_stopwatch_start (void);
-
-/*  Stops the stopwatch. Returns the number of microseconds elapsed since     */
-/*  the stopwatch was started.                                                */
-ZMQ_EXPORT unsigned long zmq_stopwatch_stop (void *watch_);
-
-/*  Sleeps for specified number of seconds.                                   */
-ZMQ_EXPORT void zmq_sleep (int seconds_);
-
-typedef void (zmq_thread_fn) (void*);
-
-/* Start a thread. Returns a handle to the thread.                            */
-ZMQ_EXPORT void *zmq_threadstart (zmq_thread_fn* func, void* arg);
-
-/* Wait for thread to complete then free up resources.                        */
-ZMQ_EXPORT void zmq_threadclose (void* thread);
-
-
-#undef ZMQ_EXPORT
-
-#ifdef __cplusplus
-}
-#endif
-
-#endif
-
diff --git a/ps-lite/deps/include/zmq_utils.h b/ps-lite/deps/include/zmq_utils.h
deleted file mode 100644
index 3392a8e0..00000000
--- a/ps-lite/deps/include/zmq_utils.h
+++ /dev/null
@@ -1,20 +0,0 @@
-/*
-    Copyright (c) 2007-2015 Contributors as noted in the AUTHORS file
-
-    This file is part of 0MQ.
-
-    0MQ is free software; you can redistribute it and/or modify it under
-    the terms of the GNU Lesser General Public License as published by
-    the Free Software Foundation; either version 3 of the License, or
-    (at your option) any later version.
-
-    0MQ is distributed in the hope that it will be useful,
-    but WITHOUT ANY WARRANTY; without even the implied warranty of
-    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-    GNU Lesser General Public License for more details.
-
-    You should have received a copy of the GNU Lesser General Public License
-    along with this program.  If not, see <http://www.gnu.org/licenses/>.
-*/
-
-/*  This file is deprecated, and all its functionality provided by zmq.h     */
diff --git a/ps-lite/deps/lib/pkgconfig/libzmq.pc b/ps-lite/deps/lib/pkgconfig/libzmq.pc
deleted file mode 100644
index e47aa331..00000000
--- a/ps-lite/deps/lib/pkgconfig/libzmq.pc
+++ /dev/null
@@ -1,10 +0,0 @@
-prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
-exec_prefix=${prefix}
-libdir=${exec_prefix}/lib
-includedir=${prefix}/include
-
-Name: libzmq
-Description: 0MQ c++ library
-Version: 4.1.4
-Libs: -L${libdir} -lzmq
-Cflags: -I${includedir}
diff --git a/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc b/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
deleted file mode 100644
index 588e80d5..00000000
--- a/ps-lite/deps/lib/pkgconfig/protobuf-lite.pc
+++ /dev/null
@@ -1,13 +0,0 @@
-prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
-exec_prefix=${prefix}
-libdir=${exec_prefix}/lib
-includedir=${prefix}/include
-
-Name: Protocol Buffers
-Description: Google's Data Interchange Format
-Version: 2.5.0
-Libs: -L${libdir} -lprotobuf-lite -D_THREAD_SAFE  
-Cflags: -I${includedir} -D_THREAD_SAFE 
-# Commented out because it crashes pkg-config *sigh*:
-#   http://bugs.freedesktop.org/show_bug.cgi?id=13265
-# Conflicts: protobuf
diff --git a/ps-lite/deps/lib/pkgconfig/protobuf.pc b/ps-lite/deps/lib/pkgconfig/protobuf.pc
deleted file mode 100644
index 3e2f57b2..00000000
--- a/ps-lite/deps/lib/pkgconfig/protobuf.pc
+++ /dev/null
@@ -1,14 +0,0 @@
-prefix=/Users/xiaoshuwang/documents/oneflow/opensource/logistic_regression_ps/ps-lite/deps
-exec_prefix=${prefix}
-libdir=${exec_prefix}/lib
-includedir=${prefix}/include
-
-Name: Protocol Buffers
-Description: Google's Data Interchange Format
-Version: 2.5.0
-Libs: -L${libdir} -lprotobuf -D_THREAD_SAFE  
-Libs.private: -lz 
-Cflags: -I${includedir} -D_THREAD_SAFE 
-# Commented out because it crashes pkg-config *sigh*:
-#   http://bugs.freedesktop.org/show_bug.cgi?id=13265
-# Conflicts: protobuf-lite
diff --git a/ps-lite/deps/share/man/man3/zmq_bind.3 b/ps-lite/deps/share/man/man3/zmq_bind.3
deleted file mode 100644
index d9a9df8a..00000000
--- a/ps-lite/deps/share/man/man3/zmq_bind.3
+++ /dev/null
@@ -1,194 +0,0 @@
-'\" t
-.\"     Title: zmq_bind
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_BIND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_bind \- accept incoming connections on a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_bind (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_bind()\fR function binds the \fIsocket\fR to a local \fIendpoint\fR and then accepts incoming connections on that endpoint\&.
-.sp
-The \fIendpoint\fR is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to bind to\&.
-.sp
-0MQ provides the the following transports:
-.PP
-\fItcp\fR
-.RS 4
-unicast transport using TCP, see
-\fBzmq_tcp\fR(7)
-.RE
-.PP
-\fIipc\fR
-.RS 4
-local inter\-process communication transport, see
-\fBzmq_ipc\fR(7)
-.RE
-.PP
-\fIinproc\fR
-.RS 4
-local in\-process (inter\-thread) communication transport, see
-\fBzmq_inproc\fR(7)
-.RE
-.PP
-\fIpgm\fR, \fIepgm\fR
-.RS 4
-reliable multicast transport using PGM, see
-\fBzmq_pgm\fR(7)
-.RE
-.sp
-Every 0MQ socket type except \fIZMQ_PAIR\fR supports one\-to\-many and many\-to\-one semantics\&. The precise semantics depend on the socket type and are defined in \fBzmq_socket\fR(3)\&.
-.sp
-The \fIipc\fR and \fItcp\fR transports accept wildcard addresses: see \fBzmq_ipc\fR(7) and \fBzmq_tcp\fR(7) for details\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-the address syntax may be different for \fIzmq_bind()\fR and \fIzmq_connect()\fR especially for the \fItcp\fR, \fIpgm\fR and \fIepgm\fR transports\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-following a \fIzmq_bind()\fR, the socket enters a \fImute\fR state unless or until at least one incoming or outgoing connection is made, at which point the socket enters a \fIready\fR state\&. In the mute state, the socket blocks or drops messages according to the socket type, as defined in \fBzmq_socket\fR(3)\&. By contrast, following a libzmq:zmq_connect[3], the socket enters the \fIready\fR state\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_bind()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The endpoint supplied is invalid\&.
-.RE
-.PP
-\fBEPROTONOSUPPORT\fR
-.RS 4
-The requested
-\fItransport\fR
-protocol is not supported\&.
-.RE
-.PP
-\fBENOCOMPATPROTO\fR
-.RS 4
-The requested
-\fItransport\fR
-protocol is not compatible with the socket type\&.
-.RE
-.PP
-\fBEADDRINUSE\fR
-.RS 4
-The requested
-\fIaddress\fR
-is already in use\&.
-.RE
-.PP
-\fBEADDRNOTAVAIL\fR
-.RS 4
-The requested
-\fIaddress\fR
-was not local\&.
-.RE
-.PP
-\fBENODEV\fR
-.RS 4
-The requested
-\fIaddress\fR
-specifies a nonexistent interface\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEMTHREAD\fR
-.RS 4
-No I/O thread is available to accomplish the task\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBBinding a publisher socket to an in-process and a TCP transport\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a ZMQ_PUB socket */
-void *socket = zmq_socket (context, ZMQ_PUB);
-assert (socket);
-/* Bind it to a in\-process transport with the address \*(Aqmy_publisher\*(Aq */
-int rc = zmq_bind (socket, "inproc://my_publisher");
-assert (rc == 0);
-/* Bind it to a TCP transport on port 5555 of the \*(Aqeth0\*(Aq interface */
-rc = zmq_bind (socket, "tcp://eth0:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_close.3 b/ps-lite/deps/share/man/man3/zmq_close.3
deleted file mode 100644
index f84f8ad1..00000000
--- a/ps-lite/deps/share/man/man3/zmq_close.3
+++ /dev/null
@@ -1,70 +0,0 @@
-'\" t
-.\"     Title: zmq_close
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CLOSE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_close \- close 0MQ socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_close (void \fR\fB\fI*socket\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_close()\fR function shall destroy the socket referenced by the \fIsocket\fR argument\&. Any outstanding messages physically received from the network but not yet received by the application with \fIzmq_recv()\fR shall be discarded\&. The behaviour for discarding messages sent by the application with \fIzmq_send()\fR but not yet physically transferred to the network depends on the value of the \fIZMQ_LINGER\fR socket option for the specified \fIsocket\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The default setting of \fIZMQ_LINGER\fR does not discard unsent messages; this behaviour may cause the application to block when calling \fIzmq_term()\fR\&. For details refer to \fBzmq_setsockopt\fR(3) and \fBzmq_term\fR(3)\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_close()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq_socket\fR(3) \fBzmq_term\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_connect.3 b/ps-lite/deps/share/man/man3/zmq_connect.3
deleted file mode 100644
index df140001..00000000
--- a/ps-lite/deps/share/man/man3/zmq_connect.3
+++ /dev/null
@@ -1,171 +0,0 @@
-'\" t
-.\"     Title: zmq_connect
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CONNECT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_connect \- create outgoing connection from socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_connect (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_connect()\fR function connects the \fIsocket\fR to an \fIendpoint\fR and then accepts incoming connections on that endpoint\&.
-.sp
-The \fIendpoint\fR is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-0MQ provides the the following transports:
-.PP
-\fItcp\fR
-.RS 4
-unicast transport using TCP, see
-\fBzmq_tcp\fR(7)
-.RE
-.PP
-\fIipc\fR
-.RS 4
-local inter\-process communication transport, see
-\fBzmq_ipc\fR(7)
-.RE
-.PP
-\fIinproc\fR
-.RS 4
-local in\-process (inter\-thread) communication transport, see
-\fBzmq_inproc\fR(7)
-.RE
-.PP
-\fIpgm\fR, \fIepgm\fR
-.RS 4
-reliable multicast transport using PGM, see
-\fBzmq_pgm\fR(7)
-.RE
-.sp
-Every 0MQ socket type except \fIZMQ_PAIR\fR supports one\-to\-many and many\-to\-one semantics\&. The precise semantics depend on the socket type and are defined in \fBzmq_socket\fR(3)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-for most transports and socket types the connection is not performed immediately but as needed by 0MQ\&. Thus a successful call to \fIzmq_connect()\fR does not mean that the connection was or could actually be established\&. Because of this, for most transports and socket types the order in which a \fIserver\fR socket is bound and a \fIclient\fR socket is connected to it does not matter\&. The first exception is when using the inproc:// transport: you must call \fIzmq_bind()\fR before calling \fIzmq_connect()\fR\&. The second exception are \fIZMQ_PAIR\fR sockets, which do not automatically reconnect to endpoints\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-following a \fIzmq_connect()\fR, for socket types except for ZMQ_ROUTER, the socket enters its normal \fIready\fR state\&. By contrast, following a \fIzmq_bind()\fR alone, the socket enters a \fImute\fR state in which the socket blocks or drops messages according to the socket type, as defined in \fBzmq_socket\fR(3)\&. A ZMQ_ROUTER socket enters its normal \fIready\fR state for a specific peer only when handshaking is complete for that peer, which may take an arbitrary time\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_connect()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The endpoint supplied is invalid\&.
-.RE
-.PP
-\fBEPROTONOSUPPORT\fR
-.RS 4
-The requested
-\fItransport\fR
-protocol is not supported\&.
-.RE
-.PP
-\fBENOCOMPATPROTO\fR
-.RS 4
-The requested
-\fItransport\fR
-protocol is not compatible with the socket type\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEMTHREAD\fR
-.RS 4
-No I/O thread is available to accomplish the task\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBConnecting a subscriber socket to an in-process and a TCP transport\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a ZMQ_SUB socket */
-void *socket = zmq_socket (context, ZMQ_SUB);
-assert (socket);
-/* Connect it to an in\-process transport with the address \*(Aqmy_publisher\*(Aq */
-int rc = zmq_connect (socket, "inproc://my_publisher");
-assert (rc == 0);
-/* Connect it to the host server001, port 5555 using a TCP transport */
-rc = zmq_connect (socket, "tcp://server001:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_get.3 b/ps-lite/deps/share/man/man3/zmq_ctx_get.3
deleted file mode 100644
index 04e0482b..00000000
--- a/ps-lite/deps/share/man/man3/zmq_ctx_get.3
+++ /dev/null
@@ -1,85 +0,0 @@
-'\" t
-.\"     Title: zmq_ctx_get
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CTX_GET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ctx_get \- get context options
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_ctx_get (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_ctx_get()\fR function shall return the option specified by the \fIoption_name\fR argument\&.
-.sp
-The \fIzmq_ctx_get()\fR function accepts the following option names:
-.SS "ZMQ_IO_THREADS: Get number of I/O threads"
-.sp
-The \fIZMQ_IO_THREADS\fR argument returns the size of the 0MQ thread pool for this context\&.
-.SS "ZMQ_MAX_SOCKETS: Get maximum number of sockets"
-.sp
-The \fIZMQ_MAX_SOCKETS\fR argument returns the maximum number of sockets allowed for this context\&.
-.SS "ZMQ_SOCKET_LIMIT: Get largest configurable number of sockets"
-.sp
-The \fIZMQ_SOCKET_LIMIT\fR argument returns the largest number of sockets that \fBzmq_ctx_set\fR(3) will accept\&.
-.SS "ZMQ_IPV6: Set IPv6 option"
-.sp
-The \fIZMQ_IPV6\fR argument returns the IPv6 option for the context\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_ctx_get()\fR function returns a value of 0 or greater if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested option
-\fIoption_name\fR
-is unknown\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBSetting a limit on the number of sockets\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void *context = zmq_ctx_new ();
-zmq_ctx_set (context, ZMQ_MAX_SOCKETS, 256);
-int max_sockets = zmq_ctx_get (context, ZMQ_MAX_SOCKETS);
-assert (max_sockets == 256);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_ctx_set\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_new.3 b/ps-lite/deps/share/man/man3/zmq_ctx_new.3
deleted file mode 100644
index 82c309b2..00000000
--- a/ps-lite/deps/share/man/man3/zmq_ctx_new.3
+++ /dev/null
@@ -1,55 +0,0 @@
-'\" t
-.\"     Title: zmq_ctx_new
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CTX_NEW" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ctx_new \- create new 0MQ context
-.SH "SYNOPSIS"
-.sp
-\fBvoid *zmq_ctx_new ();\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_ctx_new()\fR function creates a new 0MQ \fIcontext\fR\&.
-.sp
-This function replaces the deprecated function \fBzmq_init\fR(3)\&.
-.PP
-\fBThread safety\fR. A 0MQ
-\fIcontext\fR
-is thread safe and may be shared among as many application threads as necessary, without any additional locking required on the part of the caller\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_ctx_new()\fR function shall return an opaque handle to the newly created \fIcontext\fR if successful\&. Otherwise it shall return NULL and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.sp
-No error values are defined for this function\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7) \fBzmq_ctx_set\fR(3) \fBzmq_ctx_get\fR(3) \fBzmq_ctx_term\fR(3)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_set.3 b/ps-lite/deps/share/man/man3/zmq_ctx_set.3
deleted file mode 100644
index d6441874..00000000
--- a/ps-lite/deps/share/man/man3/zmq_ctx_set.3
+++ /dev/null
@@ -1,148 +0,0 @@
-'\" t
-.\"     Title: zmq_ctx_set
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CTX_SET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ctx_set \- set context options
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_ctx_set (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, int \fR\fB\fIoption_value\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_ctx_set()\fR function shall set the option specified by the \fIoption_name\fR argument to the value of the \fIoption_value\fR argument\&.
-.sp
-The \fIzmq_ctx_set()\fR function accepts the following options:
-.SS "ZMQ_IO_THREADS: Set number of I/O threads"
-.sp
-The \fIZMQ_IO_THREADS\fR argument specifies the size of the 0MQ thread pool to handle I/O operations\&. If your application is using only the \fIinproc\fR transport for messaging you may set this to zero, otherwise set it to at least one\&. This option only applies before creating any sockets on the context\&.
-.TS
-tab(:);
-lt lt.
-T{
-.sp
-Default value
-T}:T{
-.sp
-1
-T}
-.TE
-.sp 1
-.SS "ZMQ_THREAD_SCHED_POLICY: Set scheduling policy for I/O threads"
-.sp
-The \fIZMQ_THREAD_SCHED_POLICY\fR argument sets the scheduling policy for internal context\(cqs thread pool\&. This option is not available on windows\&. Supported values for this option can be found in sched\&.h file, or at \m[blue]\fBhttp://man7\&.org/linux/man\-pages/man2/sched_setscheduler\&.2\&.html\fR\m[]\&. This option only applies before creating any sockets on the context\&.
-.TS
-tab(:);
-lt lt.
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1
-T}
-.TE
-.sp 1
-.SS "ZMQ_THREAD_PRIORITY: Set scheduling priority for I/O threads"
-.sp
-The \fIZMQ_THREAD_PRIORITY\fR argument sets scheduling priority for internal context\(cqs thread pool\&. This option is not available on windows\&. Supported values for this option depend on chosen scheduling policy\&. Details can be found in sched\&.h file, or at \m[blue]\fBhttp://man7\&.org/linux/man\-pages/man2/sched_setscheduler\&.2\&.html\fR\m[]\&. This option only applies before creating any sockets on the context\&.
-.TS
-tab(:);
-lt lt.
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1
-T}
-.TE
-.sp 1
-.SS "ZMQ_MAX_SOCKETS: Set maximum number of sockets"
-.sp
-The \fIZMQ_MAX_SOCKETS\fR argument sets the maximum number of sockets allowed on the context\&. You can query the maximal allowed value with \fBzmq_ctx_get\fR(3) using the \fIZMQ_SOCKET_LIMIT\fR option\&.
-.TS
-tab(:);
-lt lt.
-T{
-.sp
-Default value
-T}:T{
-.sp
-1024
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPV6: Set IPv6 option"
-.sp
-The \fIZMQ_IPV6\fR argument sets the IPv6 value for all sockets created in the context from this point onwards\&. A value of 1 means IPv6 is enabled, while 0 means the socket will use only IPv4\&. When IPv6 is enabled, a socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
-.TS
-tab(:);
-lt lt.
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-.TE
-.sp 1
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_ctx_set()\fR function returns zero if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested option
-\fIoption_name\fR
-is unknown\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBSetting a limit on the number of sockets\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void *context = zmq_ctx_new ();
-zmq_ctx_set (context, ZMQ_MAX_SOCKETS, 256);
-int max_sockets = zmq_ctx_get (context, ZMQ_MAX_SOCKETS);
-assert (max_sockets == 256);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_ctx_get\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3 b/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
deleted file mode 100644
index ff9bf008..00000000
--- a/ps-lite/deps/share/man/man3/zmq_ctx_shutdown.3
+++ /dev/null
@@ -1,58 +0,0 @@
-'\" t
-.\"     Title: zmq_ctx_shutdown
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CTX_SHUTDOWN" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ctx_shutdown \- shutdown a 0MQ context
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_ctx_shutdown (void \fR\fB\fI*context\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_ctx_shutdown()\fR function shall shutdown the 0MQ context \fIcontext\fR\&.
-.sp
-Context shutdown will cause any blocking operations currently in progress on sockets open within \fIcontext\fR to return immediately with an error code of ETERM\&. With the exception of \fIzmq_close()\fR, any further operations on sockets open within \fIcontext\fR shall fail with an error code of ETERM\&.
-.sp
-This function is optional, client code is still required to call the \fBzmq_ctx_term\fR(3) function to free all resources allocated by zeromq\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_ctx_shutdown()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEFAULT\fR
-.RS 4
-The provided
-\fIcontext\fR
-was invalid\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7) \fBzmq_init\fR(3) \fBzmq_ctx_term\fR(3) \fBzmq_close\fR(3) \fBzmq_setsockopt\fR(3)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_ctx_term.3 b/ps-lite/deps/share/man/man3/zmq_ctx_term.3
deleted file mode 100644
index ab0fcbed..00000000
--- a/ps-lite/deps/share/man/man3/zmq_ctx_term.3
+++ /dev/null
@@ -1,129 +0,0 @@
-'\" t
-.\"     Title: zmq_ctx_term
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CTX_TERM" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ctx_term \- destroy a 0MQ context
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_ctx_term (void \fR\fB\fI*context\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_ctx_term()\fR function shall destroy the 0MQ context \fIcontext\fR\&.
-.sp
-Context termination is performed in the following steps:
-.sp
-.RS 4
-.ie n \{\
-\h'-04' 1.\h'+01'\c
-.\}
-.el \{\
-.sp -1
-.IP "  1." 4.2
-.\}
-Any blocking operations currently in progress on sockets open within
-\fIcontext\fR
-shall return immediately with an error code of ETERM\&. With the exception of
-\fIzmq_close()\fR, any further operations on sockets open within
-\fIcontext\fR
-shall fail with an error code of ETERM\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04' 2.\h'+01'\c
-.\}
-.el \{\
-.sp -1
-.IP "  2." 4.2
-.\}
-After interrupting all blocking calls,
-\fIzmq_ctx_term()\fR
-shall
-\fIblock\fR
-until the following conditions are satisfied:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-All sockets open within
-\fIcontext\fR
-have been closed with
-\fIzmq_close()\fR\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-For each socket within
-\fIcontext\fR, all messages sent by the application with
-\fIzmq_send()\fR
-have either been physically transferred to a network peer, or the socket\(cqs linger period set with the
-\fIZMQ_LINGER\fR
-socket option has expired\&.
-.RE
-.RE
-.sp
-For further details regarding socket linger behavior refer to the \fIZMQ_LINGER\fR option in \fBzmq_setsockopt\fR(3)\&.
-.sp
-This function replaces the deprecated function \fBzmq_term\fR(3)\&.
-.SH "WARNING"
-.sp
-As \fIZMQ_LINGER\fR defaults to "infinite", by default this function will block indefinitely if there are any pending connects or sends\&. We strongly recommend to (a) set \fIZMQ_LINGER\fR to zero on all sockets and (b) close all sockets, before calling this function\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_ctx_term()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEFAULT\fR
-.RS 4
-The provided
-\fIcontext\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-Termination was interrupted by a signal\&. It can be restarted if needed\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7) \fBzmq_init\fR(3) \fBzmq_close\fR(3) \fBzmq_setsockopt\fR(3)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_curve_keypair.3 b/ps-lite/deps/share/man/man3/zmq_curve_keypair.3
deleted file mode 100644
index 0920d423..00000000
--- a/ps-lite/deps/share/man/man3/zmq_curve_keypair.3
+++ /dev/null
@@ -1,69 +0,0 @@
-'\" t
-.\"     Title: zmq_curve_keypair
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CURVE_KEYPAIR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_curve_keypair \- generate a new CURVE keypair
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_curve_keypair (char *z85_public_key, char *z85_secret_key);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_curve_keypair()\fR function shall return a newly generated random keypair consisting of a public key and a secret key\&. The caller provides two buffers, each at least 41 octets large, in which this method will store the keys\&. The keys are encoded using \fBzmq_z85_encode\fR(3)\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_curve_keypair()\fR function shall return 0 if successful, else it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBENOTSUP\fR
-.RS 4
-The libzmq library was not built with cryptographic support (libsodium)\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBGenerating a new CURVE keypair\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-char public_key [41];
-char secret_key [41];
-int rc = zmq_curve_keypair (public_key, secret_key);
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_z85_decode\fR(3) \fBzmq_z85_encode\fR(3) \fBzmq_curve\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_disconnect.3 b/ps-lite/deps/share/man/man3/zmq_disconnect.3
deleted file mode 100644
index 8f704e02..00000000
--- a/ps-lite/deps/share/man/man3/zmq_disconnect.3
+++ /dev/null
@@ -1,113 +0,0 @@
-'\" t
-.\"     Title: zmq_disconnect
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_DISCONNECT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_disconnect \- Disconnect a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_disconnect (void \fR\fB\fI*socket\fR\fR\fB, const char \fR\fB\fI*endpoint\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_disconnect()\fR function shall disconnect a socket specified by the \fIsocket\fR argument from the endpoint specified by the \fIendpoint\fR argument\&. Any outstanding messages physically received from the network but not yet received by the application with \fIzmq_recv()\fR shall be discarded\&. The behaviour for discarding messages sent by the application with \fIzmq_send()\fR but not yet physically transferred to the network depends on the value of the \fIZMQ_LINGER\fR socket option for the specified \fIsocket\fR\&.
-.sp
-The \fIendpoint\fR argument is as described in \fBzmq_connect\fR(3)
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The default setting of \fIZMQ_LINGER\fR does not discard unsent messages; this behaviour may cause the application to block when calling \fIzmq_term()\fR\&. For details refer to \fBzmq_setsockopt\fR(3) and \fBzmq_term\fR(3)\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_disconnect()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The endpoint supplied is invalid\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBENOENT\fR
-.RS 4
-The provided endpoint is not connected\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBConnecting a subscriber socket to an in-process and a TCP transport\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a ZMQ_SUB socket */
-void *socket = zmq_socket (context, ZMQ_SUB);
-assert (socket);
-/* Connect it to the host server001, port 5555 using a TCP transport */
-rc = zmq_connect (socket, "tcp://server001:5555");
-assert (rc == 0);
-/* Disconnect from the previously connected endpoint */
-rc = zmq_disconnect (socket, "tcp://server001:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_errno.3 b/ps-lite/deps/share/man/man3/zmq_errno.3
deleted file mode 100644
index e66b435a..00000000
--- a/ps-lite/deps/share/man/man3/zmq_errno.3
+++ /dev/null
@@ -1,67 +0,0 @@
-'\" t
-.\"     Title: zmq_errno
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_ERRNO" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_errno \- retrieve value of errno for the calling thread
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_errno (void);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_errno()\fR function shall retrieve the value of the \fIerrno\fR variable for the calling thread\&.
-.sp
-The \fIzmq_errno()\fR function is provided to assist users on non\-POSIX systems who are experiencing issues with retrieving the correct value of \fIerrno\fR directly\&. Specifically, users on Win32 systems whose application is using a different C run\-time library from the C run\-time library in use by 0MQ will need to use \fIzmq_errno()\fR for correct operation\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBImportant\fR
-.ps -1
-.br
-.sp
-Users not experiencing issues with retrieving the correct value of \fIerrno\fR should not use this function and should instead access the \fIerrno\fR variable directly\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_errno()\fR function shall return the value of the \fIerrno\fR variable for the calling thread\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_getsockopt.3 b/ps-lite/deps/share/man/man3/zmq_getsockopt.3
deleted file mode 100644
index 31646c30..00000000
--- a/ps-lite/deps/share/man/man3/zmq_getsockopt.3
+++ /dev/null
@@ -1,1879 +0,0 @@
-'\" t
-.\"     Title: zmq_getsockopt
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_GETSOCKOPT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_getsockopt \- get 0MQ socket options
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_getsockopt (void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, void \fR\fB\fI*option_value\fR\fR\fB, size_t \fR\fB\fI*option_len\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_getsockopt()\fR function shall retrieve the value for the option specified by the \fIoption_name\fR argument for the 0MQ socket pointed to by the \fIsocket\fR argument, and store it in the buffer pointed to by the \fIoption_value\fR argument\&. The \fIoption_len\fR argument is the size in bytes of the buffer pointed to by \fIoption_value\fR; upon successful completion \fIzmq_getsockopt()\fR shall modify the \fIoption_len\fR argument to indicate the actual size of the option value stored in the buffer\&.
-.sp
-The following options can be retrieved with the \fIzmq_getsockopt()\fR function:
-.SS "ZMQ_AFFINITY: Retrieve I/O thread affinity"
-.sp
-The \fIZMQ_AFFINITY\fR option shall retrieve the I/O thread affinity for newly created connections on the specified \fIsocket\fR\&.
-.sp
-Affinity determines which threads from the 0MQ I/O thread pool associated with the socket\(cqs \fIcontext\fR shall handle newly created connections\&. A value of zero specifies no affinity, meaning that work shall be distributed fairly among all 0MQ I/O threads in the thread pool\&. For non\-zero values, the lowest bit corresponds to thread 1, second lowest bit to thread 2 and so on\&. For example, a value of 3 specifies that subsequent connections on \fIsocket\fR shall be handled exclusively by I/O threads 1 and 2\&.
-.sp
-See also \fBzmq_init\fR(3) for details on allocating the number of I/O threads for a specific \fIcontext\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-uint64_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A (bitmap)
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-N/A
-T}
-.TE
-.sp 1
-.SS "ZMQ_BACKLOG: Retrieve maximum length of the queue of outstanding connections"
-.sp
-The \fIZMQ_BACKLOG\fR option shall retrieve the maximum length of the queue of outstanding peer connections for the specified \fIsocket\fR; this only applies to connection\-oriented transports\&. For details refer to your operating system documentation for the \fIlisten\fR function\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-connections
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_PUBLICKEY: Retrieve current CURVE public key"
-.sp
-Retrieves the current long term public key for the socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41 byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_SECRETKEY: Retrieve current CURVE secret key"
-.sp
-Retrieves the current long term secret key for the socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41 byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_SERVERKEY: Retrieve current CURVE server key"
-.sp
-Retrieves the current server key for the client socket\&. You can provide either a 32 byte buffer, to retrieve the binary key value, or a 41\-byte buffer, to retrieve the key in a printable Z85 format\&. NOTE: to fetch a printable key, the buffer must be 41 bytes large to hold the 40\-char key value and one null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_EVENTS: Retrieve socket event state"
-.sp
-The \fIZMQ_EVENTS\fR option shall retrieve the event state for the specified \fIsocket\fR\&. The returned value is a bit mask constructed by OR\(cqing a combination of the following event flags:
-.PP
-\fBZMQ_POLLIN\fR
-.RS 4
-Indicates that at least one message may be received from the specified socket without blocking\&.
-.RE
-.PP
-\fBZMQ_POLLOUT\fR
-.RS 4
-Indicates that at least one message may be sent to the specified socket without blocking\&.
-.RE
-.sp
-The combination of a file descriptor returned by the \fIZMQ_FD\fR option being ready for reading but no actual events returned by a subsequent retrieval of the \fIZMQ_EVENTS\fR option is valid; applications should simply ignore this case and restart their polling operation/event loop\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A (flags)
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_FD: Retrieve file descriptor associated with the socket"
-.sp
-The \fIZMQ_FD\fR option shall retrieve the file descriptor associated with the specified \fIsocket\fR\&. The returned file descriptor can be used to integrate the socket into an existing event loop; the 0MQ library shall signal any pending events on the socket in an \fIedge\-triggered\fR fashion by making the file descriptor become ready for reading\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The ability to read from the returned file descriptor does not necessarily indicate that messages are available to be read from, or can be written to, the underlying socket; applications must retrieve the actual event state with a subsequent retrieval of the \fIZMQ_EVENTS\fR option\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The returned file descriptor is also used internally by the \fIzmq_send\fR and \fIzmq_recv\fR functions\&. As the descriptor is edge triggered, applications must update the state of \fIZMQ_EVENTS\fR after each invocation of \fIzmq_send\fR or \fIzmq_recv\fR\&.To be more explicit: after calling \fIzmq_send\fR the socket may become readable (and vice versa) without triggering a read event on the file descriptor\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The returned file descriptor is intended for use with a \fIpoll\fR or similar system call only\&. Applications must never attempt to read or write data to it directly, neither should they try to close it\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int on POSIX systems, SOCKET on Windows
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_PLAINTEXT: Retrieve GSSAPI plaintext or encrypted status"
-.sp
-Returns the \fIZMQ_GSSAPI_PLAINTEXT\fR option, if any, previously set on the socket\&. A value of \fI1\fR means that communications will be plaintext\&. A value of \fI0\fR means communications will be encrypted\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_PRINCIPAL: Retrieve the name of the GSSAPI principal"
-.sp
-The \fIZMQ_GSSAPI_PRINCIPAL\fR option shall retrieve the principal name set for the GSSAPI security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-NULL\-terminated character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null string
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_SERVER: Retrieve current GSSAPI server role"
-.sp
-Returns the \fIZMQ_GSSAPI_SERVER\fR option, if any, previously set on the socket\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_SERVICE_PRINCIPAL: Retrieve the name of the GSSAPI service principal"
-.sp
-The \fIZMQ_GSSAPI_SERVICE_PRINCIPAL\fR option shall retrieve the principal name of the GSSAPI server to which a GSSAPI client socket intends to connect\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-NULL\-terminated character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null string
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_HANDSHAKE_IVL: Retrieve maximum handshake interval"
-.sp
-The \fIZMQ_HANDSHAKE_IVL\fR option shall retrieve the maximum handshake interval for the specified \fIsocket\fR\&. Handshaking is the exchange of socket configuration information (socket type, identity, security) that occurs when a connection is first opened, only for connection\-oriented transports\&. If handshaking does not complete within the configured time, the connection shall be closed\&. The value 0 means no handshake time limit\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-30000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all but ZMQ_STREAM, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_IDENTITY: Retrieve socket identity"
-.sp
-The \fIZMQ_IDENTITY\fR option shall retrieve the identity of the specified \fIsocket\fR\&. Socket identity is used only by request/reply pattern\&. Namely, it can be used in tandem with ROUTER socket to route messages to the peer with specific identity\&.
-.sp
-Identity should be at least one byte and at most 255 bytes long\&. Identities starting with binary zero are reserved for use by 0MQ infrastructure\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_REP, ZMQ_REQ, ZMQ_ROUTER, ZMQ_DEALER\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IMMEDIATE: Retrieve attach\-on\-connect value"
-.sp
-Retrieve the state of the attach on connect value\&. If set to 1, will delay the attachment of a pipe on connect until the underlying connection has completed\&. This will cause the socket to block if there are no other connections, but will prevent queues from filling on pipes awaiting connection\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, primarily when using TCP/IPC transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPV4ONLY: Retrieve IPv4\-only socket override status"
-.sp
-Retrieve the IPv4\-only option for the socket\&. This option is deprecated\&. Please use the ZMQ_IPV6 option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1 (true)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPV6: Retrieve IPv6 socket status"
-.sp
-Retrieve the IPv6 option for the socket\&. A value of 1 means IPv6 is enabled on the socket, while 0 means the socket will use only IPv4\&. When IPv6 is enabled the socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_LAST_ENDPOINT: Retrieve the last endpoint set"
-.sp
-The \fIZMQ_LAST_ENDPOINT\fR option shall retrieve the last endpoint bound for TCP and IPC transports\&. The returned value will be a string in the form of a ZMQ DSN\&. Note that if the TCP host is INADDR_ANY, indicated by a *, then the returned address will be 0\&.0\&.0\&.0 (for IPv4)\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-NULL\-terminated character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when binding TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_LINGER: Retrieve linger period for socket shutdown"
-.sp
-The \fIZMQ_LINGER\fR option shall retrieve the linger period for the specified \fIsocket\fR\&. The linger period determines how long pending messages which have yet to be sent to a peer shall linger in memory after a socket is closed with \fBzmq_close\fR(3), and further affects the termination of the socket\(cqs context with \fBzmq_term\fR(3)\&. The following outlines the different behaviours:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The default value of
-\fI\-1\fR
-specifies an infinite linger period\&. Pending messages shall not be discarded after a call to
-\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
-\fIzmq_term()\fR
-shall block until all pending messages have been sent to a peer\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The value of
-\fI0\fR
-specifies no linger period\&. Pending messages shall be discarded immediately when the socket is closed with
-\fIzmq_close()\fR\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-Positive values specify an upper bound for the linger period in milliseconds\&. Pending messages shall not be discarded after a call to
-\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
-\fIzmq_term()\fR
-shall block until either all pending messages have been sent to a peer, or the linger period expires, after which any pending messages shall be discarded\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-Option value type
-T}:T{
-int
-T}
-T{
-Option value unit
-T}:T{
-milliseconds
-T}
-T{
-Default value
-T}:T{
-\-1 (infinite)
-T}
-T{
-Applicable socket types
-T}:T{
-all
-T}
-.TE
-.sp 1
-.RE
-.SS "ZMQ_MAXMSGSIZE: Maximum acceptable inbound message size"
-.sp
-The option shall retrieve limit for the inbound messages\&. If a peer sends a message larger than ZMQ_MAXMSGSIZE it is disconnected\&. Value of \-1 means \fIno limit\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int64_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_MECHANISM: Retrieve current security mechanism"
-.sp
-The \fIZMQ_MECHANISM\fR option shall retrieve the current security mechanism for the socket\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-ZMQ_NULL, ZMQ_PLAIN, ZMQ_CURVE, or ZMQ_GSSAPI
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-ZMQ_NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_MULTICAST_HOPS: Maximum network hops for multicast packets"
-.sp
-The option shall retrieve time\-to\-live used for outbound multicast packets\&. The default of 1 means that the multicast packets don\(cqt leave the local network\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-network hops
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_PASSWORD: Retrieve current password"
-.sp
-The \fIZMQ_PLAIN_PASSWORD\fR option shall retrieve the last password set for the PLAIN security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-NULL\-terminated character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null string
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_SERVER: Retrieve current PLAIN server role"
-.sp
-Returns the \fIZMQ_PLAIN_SERVER\fR option, if any, previously set on the socket\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_USERNAME: Retrieve current PLAIN username"
-.sp
-The \fIZMQ_PLAIN_USERNAME\fR option shall retrieve the last username set for the PLAIN security mechanism\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-NULL\-terminated character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-null string
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP or IPC transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RATE: Retrieve multicast data rate"
-.sp
-The \fIZMQ_RATE\fR option shall retrieve the maximum send or receive data rate for multicast transports using the specified \fIsocket\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-kilobits per second
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVBUF: Retrieve kernel receive buffer size"
-.sp
-The \fIZMQ_RCVBUF\fR option shall retrieve the underlying kernel receive buffer size for the specified \fIsocket\fR\&. A value of zero means that the OS default is in effect\&. For details refer to your operating system documentation for the \fISO_RCVBUF\fR socket option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVHWM: Retrieve high water mark for inbound messages"
-.sp
-The \fIZMQ_RCVHWM\fR option shall return the high water mark for inbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
-.sp
-If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-messages
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVMORE: More message data parts to follow"
-.sp
-The \fIZMQ_RCVMORE\fR option shall return True (1) if the message part last received from the \fIsocket\fR was a data part with more parts to follow\&. If there are no data parts to follow, this option shall return False (0)\&.
-.sp
-Refer to \fBzmq_send\fR(3) and \fBzmq_recv\fR(3) for a detailed description of multi\-part messages\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVTIMEO: Maximum time before a socket operation returns with EAGAIN"
-.sp
-Retrieve the timeout for recv operation on the socket\&. If the value is 0, \fIzmq_recv(3)\fR will return immediately, with a EAGAIN error if there is no message to receive\&. If the value is \-1, it will block until a message is available\&. For all other values, it will wait for a message for that amount of time before returning with an EAGAIN error\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (infinite)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECONNECT_IVL: Retrieve reconnection interval"
-.sp
-The \fIZMQ_RECONNECT_IVL\fR option shall retrieve the initial reconnection interval for the specified \fIsocket\fR\&. The reconnection interval is the period 0MQ shall wait between attempts to reconnect disconnected peers when using connection\-oriented transports\&. The value \-1 means no reconnection\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The reconnection interval may be randomized by 0MQ to prevent reconnection storms in topologies with a large number of peers per socket\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECONNECT_IVL_MAX: Retrieve maximum reconnection interval"
-.sp
-The \fIZMQ_RECONNECT_IVL_MAX\fR option shall retrieve the maximum reconnection interval for the specified \fIsocket\fR\&. This is the maximum period 0MQ shall wait between attempts to reconnect\&. On each reconnect attempt, the previous interval shall be doubled untill ZMQ_RECONNECT_IVL_MAX is reached\&. This allows for exponential backoff strategy\&. Default value means no exponential backoff is performed and reconnect interval calculations are only based on ZMQ_RECONNECT_IVL\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-Values less than ZMQ_RECONNECT_IVL will be ignored\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (only use ZMQ_RECONNECT_IVL)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECOVERY_IVL: Get multicast recovery interval"
-.sp
-The \fIZMQ_RECOVERY_IVL\fR option shall retrieve the recovery interval for multicast transports using the specified \fIsocket\fR\&. The recovery interval determines the maximum time in milliseconds that a receiver can be absent from a multicast group before unrecoverable data loss will occur\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-10000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDBUF: Retrieve kernel transmit buffer size"
-.sp
-The \fIZMQ_SNDBUF\fR option shall retrieve the underlying kernel transmit buffer size for the specified \fIsocket\fR\&. A value of zero means that the OS default is in effect\&. For details refer to your operating system documentation for the \fISO_SNDBUF\fR socket option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDHWM: Retrieves high water mark for outbound messages"
-.sp
-The \fIZMQ_SNDHWM\fR option shall return the high water mark for outbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
-.sp
-If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-messages
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDTIMEO: Maximum time before a socket operation returns with EAGAIN"
-.sp
-Retrieve the timeout for send operation on the socket\&. If the value is 0, \fIzmq_send(3)\fR will return immediately, with a EAGAIN error if the message cannot be sent\&. If the value is \-1, it will block until the message is sent\&. For all other values, it will try to send the message for that amount of time before returning with an EAGAIN error\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (infinite)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE: Override SO_KEEPALIVE socket option"
-.sp
-Override \fISO_KEEPALIVE\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,0,1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_CNT: Override TCP_KEEPCNT socket option"
-.sp
-Override \fITCP_KEEPCNT\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_IDLE: Override TCP_KEEPCNT(or TCP_KEEPALIVE on some OS)"
-.sp
-Override \fITCP_KEEPCNT\fR(or \fITCP_KEEPALIVE\fR on some OS) socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_INTVL: Override TCP_KEEPINTVL socket option"
-.sp
-Override \fITCP_KEEPINTVL\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TOS: Retrieve the Type\-of\-Service socket override status"
-.sp
-Retrieve the IP_TOS option for the socket\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
->0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_TYPE: Retrieve socket type"
-.sp
-The \fIZMQ_TYPE\fR option shall retrieve the socket type for the specified \fIsocket\fR\&. The socket type is specified at socket creation time and cannot be modified afterwards\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_ZAP_DOMAIN: Retrieve RFC 27 authentication domain"
-.sp
-The \fIZMQ_ZAP_DOMAIN\fR option shall retrieve the last ZAP domain set for the socket\&. The returned value shall be a NULL\-terminated string and MAY be empty\&. The returned size SHALL include the terminating null byte\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_getsockopt()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested option
-\fIoption_name\fR
-is unknown, or the requested
-\fIoption_len\fR
-or
-\fIoption_value\fR
-is invalid, or the size of the buffer pointed to by
-\fIoption_value\fR, as specified by
-\fIoption_len\fR, is insufficient for storing the option value\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBRetrieving the high water mark for outgoing messages\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Retrieve high water mark into sndhwm */
-int sndhwm;
-size_t sndhwm_size = sizeof (sndhwm);
-rc = zmq_getsockopt (socket, ZMQ_SNDHWM, &sndhwm, &sndhwm_size);
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_setsockopt\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_has.3 b/ps-lite/deps/share/man/man3/zmq_has.3
deleted file mode 100644
index d3f7f1d4..00000000
--- a/ps-lite/deps/share/man/man3/zmq_has.3
+++ /dev/null
@@ -1,113 +0,0 @@
-'\" t
-.\"     Title: zmq_has
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_HAS" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_has \- check a ZMQ capability
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_has (const char *capability);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_has()\fR function shall report whether a specified capability is available in the library\&. This allows bindings and applications to probe a library directly, for transport and security options\&.
-.sp
-Capabilities shall be lowercase strings\&. The following capabilities are defined:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-ipc \- the library supports the ipc:// protocol
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-pgm \- the library supports the pgm:// protocol
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-tipc \- the library supports the tipc:// protocol
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-norm \- the library supports the norm:// protocol
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-curve \- the library supports the CURVE security mechanism
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-gssapi \- the library supports the GSSAPI security mechanism
-.RE
-.sp
-When this method is provided, the zmq\&.h header file will define ZMQ_HAS_CAPABILITIES\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_has()\fR function shall return 1 if the specified capability is provided\&. Otherwise it shall return 0\&.
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_close.3 b/ps-lite/deps/share/man/man3/zmq_msg_close.3
deleted file mode 100644
index 4209a6be..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_close.3
+++ /dev/null
@@ -1,70 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_close
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_CLOSE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_close \- release 0MQ message
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_close (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_close()\fR function shall inform the 0MQ infrastructure that any resources associated with the message object referenced by \fImsg\fR are no longer required and may be released\&. Actual release of resources associated with the message object shall be postponed by 0MQ until all users of the message or underlying data buffer have indicated it is no longer required\&.
-.sp
-Applications should ensure that \fIzmq_msg_close()\fR is called once a message is no longer required, otherwise memory leaks may occur\&. Note that this is NOT necessary after a successful \fIzmq_msg_send()\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_close()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEFAULT\fR
-.RS 4
-Invalid message\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_copy.3 b/ps-lite/deps/share/man/man3/zmq_msg_copy.3
deleted file mode 100644
index 5a2496f1..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_copy.3
+++ /dev/null
@@ -1,106 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_copy
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_COPY" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_copy \- copy content of a message to another message
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_copy (zmq_msg_t \fR\fB\fI*dest\fR\fR\fB, zmq_msg_t \fR\fB\fI*src\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_copy()\fR function shall copy the message object referenced by \fIsrc\fR to the message object referenced by \fIdest\fR\&. The original content of \fIdest\fR, if any, shall be released\&. You must initialize \fIdest\fR before copying to it\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The implementation may choose not to physically copy the message content, rather to share the underlying buffer between \fIsrc\fR and \fIdest\fR\&. Avoid modifying message content after a message has been copied with \fIzmq_msg_copy()\fR, doing so can result in undefined behaviour\&. If what you need is an actual hard copy, allocate a new message using \fIzmq_msg_init_size()\fR and copy the message content using \fImemcpy()\fR\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_copy()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEFAULT\fR
-.RS 4
-Invalid message\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBCopying a message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_msg_t msg;
-zmq_msg_init_size (&msg, 255);
-memcpy (zmq_msg_data (&msg, "Hello, World", 12);
-zmq_msg_t copy;
-zmq_msg_init (&copy);
-zmq_msg_copy (&copy, &msg);
-\&.\&.\&.
-zmq_msg_close (&copy);
-zmq_msg_close (&msg);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_move\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_data.3 b/ps-lite/deps/share/man/man3/zmq_msg_data.3
deleted file mode 100644
index 61c53495..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_data.3
+++ /dev/null
@@ -1,65 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_data
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_DATA" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_data \- retrieve pointer to message content
-.SH "SYNOPSIS"
-.sp
-\fBvoid *zmq_msg_data (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_data()\fR function shall return a pointer to the message content of the message object referenced by \fImsg\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-Upon successful completion, \fIzmq_msg_data()\fR shall return a pointer to the message content\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_size\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_get.3 b/ps-lite/deps/share/man/man3/zmq_msg_get.3
deleted file mode 100644
index 87a8baee..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_get.3
+++ /dev/null
@@ -1,104 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_get
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_GET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_get \- get message property
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_get (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, int \fR\fB\fIproperty\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_get()\fR function shall return the value for the property specified by the \fIproperty\fR argument for the message pointed to by the \fImessage\fR argument\&.
-.sp
-The following properties can be retrieved with the \fIzmq_msg_get()\fR function:
-.PP
-\fBZMQ_MORE\fR
-.RS 4
-Indicates that there are more message frames to follow after the
-\fImessage\fR\&.
-.RE
-.PP
-\fBZMQ_SRCFD\fR
-.RS 4
-Returns the file descriptor of the socket the
-\fImessage\fR
-was read from\&. This allows application to retrieve the remote endpoint via
-\fIgetpeername(2)\fR\&. Be aware that the respective socket might be closed already, reused even\&. Currently only implemented for TCP sockets\&.
-.RE
-.PP
-\fBZMQ_SHARED\fR
-.RS 4
-Indicates that a message MAY share underlying storage with another copy of this message\&.
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_get()\fR function shall return the value for the property if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested
-\fIproperty\fR
-is unknown\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBReceiving a multi-frame message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_msg_t frame;
-while (true) {
-    //  Create an empty 0MQ message to hold the message frame
-    int rc = zmq_msg_init (&frame);
-    assert (rc == 0);
-    //  Block until a message is available to be received from socket
-    rc = zmq_msg_recv (socket, &frame, 0);
-    assert (rc != \-1);
-    if (zmq_msg_get (&frame, ZMQ_MORE))
-        fprintf (stderr, "more\en");
-    else {
-        fprintf (stderr, "end\en");
-        break;
-    }
-    zmq_msg_close (&frame);
-}
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_set\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_gets.3 b/ps-lite/deps/share/man/man3/zmq_msg_gets.3
deleted file mode 100644
index df257e05..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_gets.3
+++ /dev/null
@@ -1,93 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_gets
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_GETS" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_gets \- get message metadata property
-.SH "SYNOPSIS"
-.sp
-\fBconst char *zmq_msg_gets (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, const char *\fR\fB\fIproperty\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_gets()\fR function shall return the string value for the metadata property specified by the \fIproperty\fR argument for the message pointed to by the \fImessage\fR argument\&. Both the \fIproperty\fR argument and the \fIvalue\fR shall be NULL\-terminated UTF8\-encoded strings\&.
-.sp
-Metadata is defined on a per\-connection basis during the ZeroMQ connection handshake as specified in <rfc\&.zeromq\&.org/spec:37>\&.
-.sp
-The following ZMTP properties can be retrieved with the \fIzmq_msg_gets()\fR function:
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-Socket\-Type
-Identity
-Resource
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-Additionally, when available for the underlying transport, the \fBPeer\-Address\fR property will return the IP address of the remote endpoint as returned by getnameinfo(2)\&.
-.sp
-Other properties may be defined based on the underlying security mechanism, see ZAP authenticated connection sample below\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_gets()\fR function shall return the string value for the property if successful\&. Otherwise it shall return NULL and set \fIerrno\fR to one of the values defined below\&. The caller shall not modify or free the returned value, which shall be owned by the message\&. The encoding of the property and value shall be UTF8\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested
-\fIproperty\fR
-is unknown\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBGetting the ZAP authenticated user id for a message:\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_msg_t msg;
-zmq_msg_init (&msg);
-rc = zmq_msg_recv (&msg, dealer, 0);
-assert (rc != \-1);
-const char *user_id = zmq_msg_gets (&msg, "User\-Id");
-zmq_msg_close (&msg);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init.3 b/ps-lite/deps/share/man/man3/zmq_msg_init.3
deleted file mode 100644
index d1f7aa7e..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_init.3
+++ /dev/null
@@ -1,99 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_init
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_INIT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_init \- initialise empty 0MQ message
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_init (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_init()\fR function shall initialise the message object referenced by \fImsg\fR to represent an empty message\&. This function is most useful when called before receiving a message with \fIzmq_recv()\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_init()\fR function always returns zero\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "EXAMPLE"
-.PP
-\fBReceiving a message from a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_msg_t msg;
-rc = zmq_msg_init (&msg);
-assert (rc == 0);
-int nbytes = zmq_recv (socket, &msg, 0);
-assert (nbytes != \-1);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init_data.3 b/ps-lite/deps/share/man/man3/zmq_msg_init_data.3
deleted file mode 100644
index 60ed5ce3..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_init_data.3
+++ /dev/null
@@ -1,146 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_init_data
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_INIT_DATA" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_init_data \- initialise 0MQ message from a supplied buffer
-.SH "SYNOPSIS"
-.sp
-\fBtypedef void (zmq_free_fn) (void \fR\fB\fI*data\fR\fR\fB, void \fR\fB\fI*hint\fR\fR\fB);\fR
-.sp
-\fBint zmq_msg_init_data (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*data\fR\fR\fB, size_t \fR\fB\fIsize\fR\fR\fB, zmq_free_fn \fR\fB\fI*ffn\fR\fR\fB, void \fR\fB\fI*hint\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_init_data()\fR function shall initialise the message object referenced by \fImsg\fR to represent the content referenced by the buffer located at address \fIdata\fR, \fIsize\fR bytes long\&. No copy of \fIdata\fR shall be performed and 0MQ shall take ownership of the supplied buffer\&.
-.sp
-If provided, the deallocation function \fIffn\fR shall be called once the data buffer is no longer required by 0MQ, with the \fIdata\fR and \fIhint\fR arguments supplied to \fIzmq_msg_init_data()\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The deallocation function \fIffn\fR needs to be thread\-safe, since it will be called from an arbitrary thread\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-If the deallocation function is not provided, the allocated memory will not be freed, and this may cause a memory leak\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_init_data()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBENOMEM\fR
-.RS 4
-Insufficient storage space is available\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBInitialising a message from a supplied buffer\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void my_free (void *data, void *hint)
-{
-    free (data);
-}
-
-    /*  \&.\&.\&.  */
-
-void *data = malloc (6);
-assert (data);
-memcpy (data, "ABCDEF", 6);
-zmq_msg_t msg;
-rc = zmq_msg_init_data (&msg, data, 6, my_free, NULL);
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_init_size\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_init_size.3 b/ps-lite/deps/share/man/man3/zmq_msg_init_size.3
deleted file mode 100644
index b374f52c..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_init_size.3
+++ /dev/null
@@ -1,86 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_init_size
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_INIT_SIZE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_init_size \- initialise 0MQ message of a specified size
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_init_size (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, size_t \fR\fB\fIsize\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_init_size()\fR function shall allocate any resources required to store a message \fIsize\fR bytes long and initialise the message object referenced by \fImsg\fR to represent the newly allocated message\&.
-.sp
-The implementation shall choose whether to store message content on the stack (small messages) or on the heap (large messages)\&. For performance reasons \fIzmq_msg_init_size()\fR shall not clear the message data\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The functions \fIzmq_msg_init()\fR, \fIzmq_msg_init_data()\fR and \fIzmq_msg_init_size()\fR are mutually exclusive\&. Never initialize the same \fIzmq_msg_t\fR twice\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_init_size()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBENOMEM\fR
-.RS 4
-Insufficient storage space is available\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_init_data\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq_msg_data\fR(3) \fBzmq_msg_size\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_more.3 b/ps-lite/deps/share/man/man3/zmq_msg_more.3
deleted file mode 100644
index ee44c3f4..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_more.3
+++ /dev/null
@@ -1,75 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_more
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_MORE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_more \- indicate if there are more message parts to receive
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_more (zmq_msg_t \fR\fB\fI*message\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_more()\fR function indicates whether this is part of a multi\-part message, and there are further parts to receive\&. This method can safely be called after \fIzmq_msg_close()\fR\&. This method is identical to \fIzmq_msg_get()\fR with an argument of ZMQ_MORE\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_more()\fR function shall return zero if this is the final part of a multi\-part message, or the only part of a single\-part message\&. It shall return 1 if there are further parts to receive\&.
-.SH "EXAMPLE"
-.PP
-\fBReceiving a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_msg_t part;
-while (true) {
-    //  Create an empty 0MQ message to hold the message part
-    int rc = zmq_msg_init (&part);
-    assert (rc == 0);
-    //  Block until a message is available to be received from socket
-    rc = zmq_msg_recv (socket, &part, 0);
-    assert (rc != \-1);
-    if (zmq_msg_more (&part))
-        fprintf (stderr, "more\en");
-    else {
-        fprintf (stderr, "end\en");
-        break;
-    }
-    zmq_msg_close (&part);
-}
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_get\fR(3) \fBzmq_msg_set\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_move.3 b/ps-lite/deps/share/man/man3/zmq_msg_move.3
deleted file mode 100644
index 2807f0cb..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_move.3
+++ /dev/null
@@ -1,68 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_move
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_MOVE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_move \- move content of a message to another message
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_move (zmq_msg_t \fR\fB\fI*dest\fR\fR\fB, zmq_msg_t \fR\fB\fI*src\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_move()\fR function shall move the content of the message object referenced by \fIsrc\fR to the message object referenced by \fIdest\fR\&. No actual copying of message content is performed, \fIdest\fR is simply updated to reference the new content\&. \fIsrc\fR becomes an empty message after calling \fIzmq_msg_move()\fR\&. The original content of \fIdest\fR, if any, shall be released\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_move()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEFAULT\fR
-.RS 4
-Invalid message\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_copy\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_recv.3 b/ps-lite/deps/share/man/man3/zmq_msg_recv.3
deleted file mode 100644
index ec7beae8..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_recv.3
+++ /dev/null
@@ -1,161 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_recv
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_RECV" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_recv \- receive a message part from a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_recv (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_recv()\fR function is identical to \fBzmq_recvmsg\fR(3), which shall be deprecated in future versions\&. \fIzmq_msg_recv()\fR is more consistent with other message manipulation functions\&.
-.sp
-The \fIzmq_msg_recv()\fR function shall receive a message part from the socket referenced by the \fIsocket\fR argument and store it in the message referenced by the \fImsg\fR argument\&. Any content previously stored in \fImsg\fR shall be properly deallocated\&. If there are no message parts available on the specified \fIsocket\fR the \fIzmq_msg_recv()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
-\fIsocket\fR, the
-\fIzmq_msg_recv()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_msg_recv()\fR to determine if there are further parts to receive\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_recv()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and no messages are available at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_msg_recv()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_msg_recv()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before a message was available\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-The message passed to the function was invalid\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBReceiving a message from a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create an empty 0MQ message */
-zmq_msg_t msg;
-int rc = zmq_msg_init (&msg);
-assert (rc == 0);
-/* Block until a message is available to be received from socket */
-rc = zmq_msg_recv (&msg, socket, 0);
-assert (rc != \-1);
-/* Release message */
-zmq_msg_close (&msg);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBReceiving a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-int more;
-size_t more_size = sizeof (more);
-do {
-    /* Create an empty 0MQ message to hold the message part */
-    zmq_msg_t part;
-    int rc = zmq_msg_init (&part);
-    assert (rc == 0);
-    /* Block until a message is available to be received from socket */
-    rc = zmq_msg_recv (&part, socket, 0);
-    assert (rc != \-1);
-    /* Determine if more message parts are to follow */
-    rc = zmq_getsockopt (socket, ZMQ_RCVMORE, &more, &more_size);
-    assert (rc == 0);
-    zmq_msg_close (&part);
-} while (more);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_msg_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_send.3 b/ps-lite/deps/share/man/man3/zmq_msg_send.3
deleted file mode 100644
index 6ec16029..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_send.3
+++ /dev/null
@@ -1,179 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_send
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_SEND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_send \- send a message part on a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_send (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_send()\fR function is identical to \fBzmq_sendmsg\fR(3), which shall be deprecated in future versions\&. \fIzmq_msg_send()\fR is more consistent with other message manipulation functions\&.
-.sp
-The \fIzmq_msg_send()\fR function shall queue the message referenced by the \fImsg\fR argument to be sent to the socket referenced by the \fIsocket\fR argument\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
-\fIsocket\fR, the
-\fIzmq_msg_send()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.PP
-\fBZMQ_SNDMORE\fR
-.RS 4
-Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
-.RE
-.sp
-The \fIzmq_msg_t\fR structure passed to \fIzmq_msg_send()\fR is nullified during the call\&. If you want to send the same message to multiple sockets you have to copy it using (e\&.g\&. using \fIzmq_msg_copy()\fR)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-A successful invocation of \fIzmq_msg_send()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&. You do not need to call \fIzmq_msg_close()\fR after a successful \fIzmq_msg_send()\fR\&.
-.sp .5v
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_send()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and the message cannot be sent at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_msg_send()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_msg_send()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before the message was sent\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-Invalid message\&.
-.RE
-.PP
-\fBEHOSTUNREACH\fR
-.RS 4
-The message cannot be routed\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBFilling in a message and sending it to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a new message, allocating 6 bytes for message content */
-zmq_msg_t msg;
-int rc = zmq_msg_init_size (&msg, 6);
-assert (rc == 0);
-/* Fill in message content with \*(AqAAAAAA\*(Aq */
-memset (zmq_msg_data (&msg), \*(AqA\*(Aq, 6);
-/* Send the message to the socket */
-rc = zmq_msg_send (&msg, socket, 0);
-assert (rc == 6);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBSending a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Send a multi\-part message consisting of three parts to socket */
-rc = zmq_msg_send (&part1, socket, ZMQ_SNDMORE);
-rc = zmq_msg_send (&part2, socket, ZMQ_SNDMORE);
-/* Final part; no more parts to follow */
-rc = zmq_msg_send (&part3, socket, 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_msg_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_set.3 b/ps-lite/deps/share/man/man3/zmq_msg_set.3
deleted file mode 100644
index c775065a..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_set.3
+++ /dev/null
@@ -1,56 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_set
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_SET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_set \- set message property
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_msg_set (zmq_msg_t \fR\fB\fI*message\fR\fR\fB, int \fR\fB\fIproperty\fR\fR\fB, int \fR\fB\fIvalue\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_set()\fR function shall set the property specified by the \fIproperty\fR argument to the value of the \fIvalue\fR argument for the 0MQ message fragment pointed to by the \fImessage\fR argument\&.
-.sp
-Currently the \fIzmq_msg_set()\fR function does not support any property names\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_msg_set()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested property
-\fIproperty\fR
-is unknown\&.
-.RE
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_get\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_msg_size.3 b/ps-lite/deps/share/man/man3/zmq_msg_size.3
deleted file mode 100644
index bfb1e79a..00000000
--- a/ps-lite/deps/share/man/man3/zmq_msg_size.3
+++ /dev/null
@@ -1,65 +0,0 @@
-'\" t
-.\"     Title: zmq_msg_size
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_MSG_SIZE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_msg_size \- retrieve message content size in bytes
-.SH "SYNOPSIS"
-.sp
-\fBsize_t zmq_msg_size (zmq_msg_t \fR\fB\fI*msg\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_msg_size()\fR function shall return the size in bytes of the content of the message object referenced by \fImsg\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Never access \fIzmq_msg_t\fR members directly, instead always use the \fIzmq_msg\fR family of functions\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-Upon successful completion, \fIzmq_msg_size()\fR shall return the size of the message content in bytes\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq_msg_data\fR(3) \fBzmq_msg_init\fR(3) \fBzmq_msg_init_size\fR(3) \fBzmq_msg_init_data\fR(3) \fBzmq_msg_close\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_poll.3 b/ps-lite/deps/share/man/man3/zmq_poll.3
deleted file mode 100644
index a09e5f85..00000000
--- a/ps-lite/deps/share/man/man3/zmq_poll.3
+++ /dev/null
@@ -1,177 +0,0 @@
-'\" t
-.\"     Title: zmq_poll
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_POLL" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_poll \- input/output multiplexing
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_poll (zmq_pollitem_t \fR\fB\fI*items\fR\fR\fB, int \fR\fB\fInitems\fR\fR\fB, long \fR\fB\fItimeout\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_poll()\fR function provides a mechanism for applications to multiplex input/output events in a level\-triggered fashion over a set of sockets\&. Each member of the array pointed to by the \fIitems\fR argument is a \fBzmq_pollitem_t\fR structure\&. The \fInitems\fR argument specifies the number of items in the \fIitems\fR array\&. The \fBzmq_pollitem_t\fR structure is defined as follows:
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-typedef struct
-{
-    void \fI*socket\fR;
-    int \fIfd\fR;
-    short \fIevents\fR;
-    short \fIrevents\fR;
-} zmq_pollitem_t;
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-For each \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall examine either the 0MQ socket referenced by \fIsocket\fR \fBor\fR the standard socket specified by the file descriptor \fIfd\fR, for the event(s) specified in \fIevents\fR\&. If both \fIsocket\fR and \fIfd\fR are set in a single \fBzmq_pollitem_t\fR, the 0MQ socket referenced by \fIsocket\fR shall take precedence and the value of \fIfd\fR shall be ignored\&.
-.sp
-For each \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall first clear the \fIrevents\fR member, and then indicate any requested events that have occurred by setting the bit corresponding to the event condition in the \fIrevents\fR member\&.
-.sp
-If none of the requested events have occurred on any \fBzmq_pollitem_t\fR item, \fIzmq_poll()\fR shall wait \fItimeout\fR milliseconds for an event to occur on any of the requested items\&. If the value of \fItimeout\fR is 0, \fIzmq_poll()\fR shall return immediately\&. If the value of \fItimeout\fR is \-1, \fIzmq_poll()\fR shall block indefinitely until a requested event has occurred on at least one \fBzmq_pollitem_t\fR\&.
-.sp
-The \fIevents\fR and \fIrevents\fR members of \fBzmq_pollitem_t\fR are bit masks constructed by OR\(cqing a combination of the following event flags:
-.PP
-\fBZMQ_POLLIN\fR
-.RS 4
-For 0MQ sockets, at least one message may be received from the
-\fIsocket\fR
-without blocking\&. For standard sockets this is equivalent to the
-\fIPOLLIN\fR
-flag of the
-\fIpoll()\fR
-system call and generally means that at least one byte of data may be read from
-\fIfd\fR
-without blocking\&.
-.RE
-.PP
-\fBZMQ_POLLOUT\fR
-.RS 4
-For 0MQ sockets, at least one message may be sent to the
-\fIsocket\fR
-without blocking\&. For standard sockets this is equivalent to the
-\fIPOLLOUT\fR
-flag of the
-\fIpoll()\fR
-system call and generally means that at least one byte of data may be written to
-\fIfd\fR
-without blocking\&.
-.RE
-.PP
-\fBZMQ_POLLERR\fR
-.RS 4
-For standard sockets, this flag is passed through
-\fIzmq_poll()\fR
-to the underlying
-\fIpoll()\fR
-system call and generally means that some sort of error condition is present on the socket specified by
-\fIfd\fR\&. For 0MQ sockets this flag has no effect if set in
-\fIevents\fR, and shall never be returned in
-\fIrevents\fR
-by
-\fIzmq_poll()\fR\&.
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The \fIzmq_poll()\fR function may be implemented or emulated using operating system interfaces other than \fIpoll()\fR, and as such may be subject to the limits of those interfaces in ways not defined in this documentation\&.
-.sp .5v
-.RE
-.SH "RETURN VALUE"
-.sp
-Upon successful completion, the \fIzmq_poll()\fR function shall return the number of \fBzmq_pollitem_t\fR structures with events signaled in \fIrevents\fR or 0 if no events have been signaled\&. Upon failure, \fIzmq_poll()\fR shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBETERM\fR
-.RS 4
-At least one of the members of the
-\fIitems\fR
-array refers to a
-\fIsocket\fR
-whose associated 0MQ
-\fIcontext\fR
-was terminated\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-The provided
-\fIitems\fR
-was not valid (NULL)\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before any events were available\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBPolling indefinitely for input events on both a 0MQ socket and a standard socket.\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-zmq_pollitem_t items [2];
-/* First item refers to 0MQ socket \*(Aqsocket\*(Aq */
-items[0]\&.socket = socket;
-items[0]\&.events = ZMQ_POLLIN;
-/* Second item refers to standard socket \*(Aqfd\*(Aq */
-items[1]\&.socket = NULL;
-items[1]\&.fd = fd;
-items[1]\&.events = ZMQ_POLLIN;
-/* Poll for events indefinitely */
-int rc = zmq_poll (items, 2, \-1);
-assert (rc >= 0);
-/* Returned events will be stored in items[]\&.revents */
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_socket\fR(3) \fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq\fR(7)
-.sp
-Your operating system documentation for the \fIpoll()\fR system call\&.
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_proxy.3 b/ps-lite/deps/share/man/man3/zmq_proxy.3
deleted file mode 100644
index ada64c92..00000000
--- a/ps-lite/deps/share/man/man3/zmq_proxy.3
+++ /dev/null
@@ -1,89 +0,0 @@
-'\" t
-.\"     Title: zmq_proxy
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_PROXY" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_proxy \- start built\-in 0MQ proxy
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_proxy (const void \fR\fB\fI*frontend\fR\fR\fB, const void \fR\fB\fI*backend\fR\fR\fB, const void \fR\fB\fI*capture\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_proxy()\fR function starts the built\-in 0MQ proxy in the current application thread\&.
-.sp
-The proxy connects a frontend socket to a backend socket\&. Conceptually, data flows from frontend to backend\&. Depending on the socket types, replies may flow in the opposite direction\&. The direction is conceptual only; the proxy is fully symmetric and there is no technical difference between frontend and backend\&.
-.sp
-Before calling \fIzmq_proxy()\fR you must set any socket options, and connect or bind both frontend and backend sockets\&. The two conventional proxy models are:
-.sp
-\fIzmq_proxy()\fR runs in the current thread and returns only if/when the current context is closed\&.
-.sp
-If the capture socket is not NULL, the proxy shall send all messages, received on both frontend and backend, to the capture socket\&. The capture socket should be a \fIZMQ_PUB\fR, \fIZMQ_DEALER\fR, \fIZMQ_PUSH\fR, or \fIZMQ_PAIR\fR socket\&.
-.sp
-Refer to \fBzmq_socket\fR(3) for a description of the available socket types\&.
-.SH "EXAMPLE USAGE"
-.SS "Shared Queue"
-.sp
-When the frontend is a ZMQ_ROUTER socket, and the backend is a ZMQ_DEALER socket, the proxy shall act as a shared queue that collects requests from a set of clients, and distributes these fairly among a set of services\&. Requests shall be fair\-queued from frontend connections and distributed evenly across backend connections\&. Replies shall automatically return to the client that made the original request\&.
-.SS "Forwarder"
-.sp
-When the frontend is a ZMQ_XSUB socket, and the backend is a ZMQ_XPUB socket, the proxy shall act as a message forwarder that collects messages from a set of publishers and forwards these to a set of subscribers\&. This may be used to bridge networks transports, e\&.g\&. read on tcp:// and forward on pgm://\&.
-.SS "Streamer"
-.sp
-When the frontend is a ZMQ_PULL socket, and the backend is a ZMQ_PUSH socket, the proxy shall collect tasks from a set of clients and forwards these to a set of workers using the pipeline pattern\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_proxy()\fR function always returns \-1 and \fIerrno\fR set to \fBETERM\fR (the 0MQ \fIcontext\fR associated with either of the specified sockets was terminated)\&.
-.SH "EXAMPLE"
-.PP
-\fBCreating a shared queue proxy\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Create frontend and backend sockets
-void *frontend = zmq_socket (context, ZMQ_ROUTER);
-assert (backend);
-void *backend = zmq_socket (context, ZMQ_DEALER);
-assert (frontend);
-//  Bind both sockets to TCP ports
-assert (zmq_bind (frontend, "tcp://*:5555") == 0);
-assert (zmq_bind (backend, "tcp://*:5556") == 0);
-//  Start the queue proxy, which runs until ETERM
-zmq_proxy (frontend, backend, NULL);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3 b/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
deleted file mode 100644
index 4835a93f..00000000
--- a/ps-lite/deps/share/man/man3/zmq_proxy_steerable.3
+++ /dev/null
@@ -1,112 +0,0 @@
-'\" t
-.\"     Title: zmq_proxy_steerable
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_PROXY_STEERABLE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_proxy_steerable \- built\-in 0MQ proxy with control flow
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_proxy_steerable (const void \fR\fB\fI*frontend\fR\fR\fB, const void \fR\fB\fI*backend\fR\fR\fB, const void \fR\fB\fI*capture\fR\fR\fB, const void \fR\fB\fI*control\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_proxy_steerable()\fR function starts the built\-in 0MQ proxy in the current application thread, as \fIzmq_proxy()\fR do\&. Please, refer to this function for the general description and usage\&. We describe here only the additional control flow provided by the socket passed as the fourth argument "control"\&.
-.sp
-If the control socket is not NULL, the proxy supports control flow\&. If \fIPAUSE\fR is received on this socket, the proxy suspends its activities\&. If \fIRESUME\fR is received, it goes on\&. If \fITERMINATE\fR is received, it terminates smoothly\&. At start, the proxy runs normally as if zmq_proxy was used\&.
-.sp
-If the control socket is NULL, the function behave exactly as if zmq_proxy had been called\&.
-.sp
-Refer to \fBzmq_socket\fR(3) for a description of the available socket types\&. Refer to \fBzmq_proxy\fR(3) for a description of the zmq_proxy\&.
-.SH "EXAMPLE USAGE"
-.sp
-cf zmq_proxy
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_proxy_steerable()\fR function returns 0 if TERMINATE is sent to its control socket\&. Otherwise, it returns \-1 and \fIerrno\fR set to \fBETERM\fR (the 0MQ \fIcontext\fR associated with either of the specified sockets was terminated)\&.
-.SH "EXAMPLE"
-.PP
-\fBCreating a shared queue proxy\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Create frontend, backend and control sockets
-void *frontend = zmq_socket (context, ZMQ_ROUTER);
-assert (backend);
-void *backend = zmq_socket (context, ZMQ_DEALER);
-assert (frontend);
-void *control = zmq_socket (context, ZMQ_SUB);
-assert (control);
-
-//  Bind sockets to TCP ports
-assert (zmq_bind (frontend, "tcp://*:5555") == 0);
-assert (zmq_bind (backend, "tcp://*:5556") == 0);
-assert (zmq_connect (control, "tcp://*:5557") == 0);
-
-// Subscribe to the control socket since we have chosen SUB here
-assert (zmq_setsockopt (control, ZMQ_SUBSCRIBE, "", 0));
-
-//  Start the queue proxy, which runs until ETERM or "TERMINATE"
-//  received on the control socket
-zmq_proxy_steerable (frontend, backend, NULL, control);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBSet up a controller in another node, process or whatever\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void *control = zmq_socket (context, ZMQ_PUB);
-assert (control);
-assert (zmq_bind (control, "tcp://*:5557") == 0);
-
-// pause the proxy
-assert (zmq_send (control, "PAUSE", 5, 0) == 0);
-
-// resume the proxy
-assert (zmq_send (control, "RESUME", 6, 0) == 0);
-
-// terminate the proxy
-assert (zmq_send (control, "TERMINATE", 9, 0) == 0);
-\-\-\-
-
-
-SEE ALSO
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-\fBzmq_proxy\fR(3) \fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_recv.3 b/ps-lite/deps/share/man/man3/zmq_recv.3
deleted file mode 100644
index 5d1b69a9..00000000
--- a/ps-lite/deps/share/man/man3/zmq_recv.3
+++ /dev/null
@@ -1,122 +0,0 @@
-'\" t
-.\"     Title: zmq_recv
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_RECV" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_recv \- receive a message part from a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_recv (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_recv()\fR function shall receive a message from the socket referenced by the \fIsocket\fR argument and store it in the buffer referenced by the \fIbuf\fR argument\&. Any bytes exceeding the length specified by the \fIlen\fR argument shall be truncated\&. If there are no messages available on the specified \fIsocket\fR the \fIzmq_recv()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
-\fIsocket\fR, the
-\fIzmq_recv()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_recv()\fR to determine if there are further parts to receive\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_recv()\fR function shall return number of bytes in the message if successful\&. Note that the value can exceed the value of the \fIlen\fR parameter in case the message was truncated\&. If not successful the function shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and no messages are available at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_recv()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_recv()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before a message was available\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBReceiving a message from a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-char buf [256];
-nbytes = zmq_recv (socket, buf, 256, 0);
-assert (nbytes != \-1);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_recvmsg.3 b/ps-lite/deps/share/man/man3/zmq_recvmsg.3
deleted file mode 100644
index daaff648..00000000
--- a/ps-lite/deps/share/man/man3/zmq_recvmsg.3
+++ /dev/null
@@ -1,175 +0,0 @@
-'\" t
-.\"     Title: zmq_recvmsg
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_RECVMSG" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_recvmsg \- receive a message part from a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_recvmsg (void \fR\fB\fI*socket\fR\fR\fB, zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_recvmsg()\fR function shall receive a message part from the socket referenced by the \fIsocket\fR argument and store it in the message referenced by the \fImsg\fR argument\&. Any content previously stored in \fImsg\fR shall be properly deallocated\&. If there are no message parts available on the specified \fIsocket\fR the \fIzmq_recvmsg()\fR function shall block until the request can be satisfied\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-Specifies that the operation should be performed in non\-blocking mode\&. If there are no messages available on the specified
-\fIsocket\fR, the
-\fIzmq_recvmsg()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-this API method is deprecated in favor of zmq_msg_recv(3)\&.
-.sp .5v
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that processes multi\-part messages must use the \fIZMQ_RCVMORE\fR \fBzmq_getsockopt\fR(3) option after calling \fIzmq_recvmsg()\fR to determine if there are further parts to receive\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_recvmsg()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and no messages are available at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_recvmsg()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_recvmsg()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before a message was available\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-The message passed to the function was invalid\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBReceiving a message from a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create an empty 0MQ message */
-zmq_msg_t msg;
-int rc = zmq_msg_init (&msg);
-assert (rc == 0);
-/* Block until a message is available to be received from socket */
-rc = zmq_recvmsg (socket, &msg, 0);
-assert (rc != \-1);
-/* Release message */
-zmq_msg_close (&msg);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBReceiving a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-int more;
-size_t more_size = sizeof (more);
-do {
-    /* Create an empty 0MQ message to hold the message part */
-    zmq_msg_t part;
-    int rc = zmq_msg_init (&part);
-    assert (rc == 0);
-    /* Block until a message is available to be received from socket */
-    rc = zmq_recvmsg (socket, &part, 0);
-    assert (rc != \-1);
-    /* Determine if more message parts are to follow */
-    rc = zmq_getsockopt (socket, ZMQ_RCVMORE, &more, &more_size);
-    assert (rc == 0);
-    zmq_msg_close (&part);
-} while (more);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_recv\fR(3) \fBzmq_send\fR(3) \fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_send.3 b/ps-lite/deps/share/man/man3/zmq_send.3
deleted file mode 100644
index 87e52bfc..00000000
--- a/ps-lite/deps/share/man/man3/zmq_send.3
+++ /dev/null
@@ -1,153 +0,0 @@
-'\" t
-.\"     Title: zmq_send
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SEND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_send \- send a message part on a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_send (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_send()\fR function shall queue a message created from the buffer referenced by the \fIbuf\fR and \fIlen\fR arguments\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
-\fIsocket\fR, the
-\fIzmq_send()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.PP
-\fBZMQ_SNDMORE\fR
-.RS 4
-Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-A successful invocation of \fIzmq_send()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
-.sp .5v
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_send()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and the message cannot be sent at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_send()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_send()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before the message was sent\&.
-.RE
-.PP
-\fBEHOSTUNREACH\fR
-.RS 4
-The message cannot be routed\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBSending a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Send a multi\-part message consisting of three parts to socket */
-rc = zmq_send (socket, "ABC", 3, ZMQ_SNDMORE);
-assert (rc == 3);
-rc = zmq_send (socket, "DEFGH", 5, ZMQ_SNDMORE);
-assert (rc == 5);
-/* Final part; no more parts to follow */
-rc = zmq_send (socket, "JK", 2, 0);
-assert (rc == 2);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_send_const\fR(3) \fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_send_const.3 b/ps-lite/deps/share/man/man3/zmq_send_const.3
deleted file mode 100644
index d512fed3..00000000
--- a/ps-lite/deps/share/man/man3/zmq_send_const.3
+++ /dev/null
@@ -1,153 +0,0 @@
-'\" t
-.\"     Title: zmq_send_const
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SEND_CONST" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_send_const \- send a constant\-memory message part on a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_send_const (void \fR\fB\fI*socket\fR\fR\fB, void \fR\fB\fI*buf\fR\fR\fB, size_t \fR\fB\fIlen\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_send_const()\fR function shall queue a message created from the buffer referenced by the \fIbuf\fR and \fIlen\fR arguments\&. The message buffer is assumed to be constant\-memory and will therefore not be copied or deallocated in any way\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
-\fIsocket\fR, the
-\fIzmq_send_const()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.PP
-\fBZMQ_SNDMORE\fR
-.RS 4
-Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-A successful invocation of \fIzmq_send_const()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
-.sp .5v
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_send_const()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and the message cannot be sent at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_send_const()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_send_const()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before the message was sent\&.
-.RE
-.PP
-\fBEHOSTUNREACH\fR
-.RS 4
-The message cannot be routed\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBSending a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Send a multi\-part message consisting of three parts to socket */
-rc = zmq_send_const (socket, "ABC", 3, ZMQ_SNDMORE);
-assert (rc == 3);
-rc = zmq_send_const (socket, "DEFGH", 5, ZMQ_SNDMORE);
-assert (rc == 5);
-/* Final part; no more parts to follow */
-rc = zmq_send_const (socket, "JK", 2, 0);
-assert (rc == 2);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_sendmsg.3 b/ps-lite/deps/share/man/man3/zmq_sendmsg.3
deleted file mode 100644
index d3a5c469..00000000
--- a/ps-lite/deps/share/man/man3/zmq_sendmsg.3
+++ /dev/null
@@ -1,193 +0,0 @@
-'\" t
-.\"     Title: zmq_sendmsg
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SENDMSG" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_sendmsg \- send a message part on a socket
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_sendmsg (void \fR\fB\fI*socket\fR\fR\fB, zmq_msg_t \fR\fB\fI*msg\fR\fR\fB, int \fR\fB\fIflags\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_sendmsg()\fR function shall queue the message referenced by the \fImsg\fR argument to be sent to the socket referenced by the \fIsocket\fR argument\&. The \fIflags\fR argument is a combination of the flags defined below:
-.PP
-\fBZMQ_DONTWAIT\fR
-.RS 4
-For socket types (DEALER, PUSH) that block when there are no available peers (or all peers have full high\-water mark), specifies that the operation should be performed in non\-blocking mode\&. If the message cannot be queued on the
-\fIsocket\fR, the
-\fIzmq_sendmsg()\fR
-function shall fail with
-\fIerrno\fR
-set to EAGAIN\&.
-.RE
-.PP
-\fBZMQ_SNDMORE\fR
-.RS 4
-Specifies that the message being sent is a multi\-part message, and that further message parts are to follow\&. Refer to the section regarding multi\-part messages below for a detailed description\&.
-.RE
-.sp
-The \fIzmq_msg_t\fR structure passed to \fIzmq_sendmsg()\fR is nullified during the call\&. If you want to send the same message to multiple sockets you have to copy it using (e\&.g\&. using \fIzmq_msg_copy()\fR)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-A successful invocation of \fIzmq_sendmsg()\fR does not indicate that the message has been transmitted to the network, only that it has been queued on the \fIsocket\fR and 0MQ has assumed responsibility for the message\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-this API method is deprecated in favor of zmq_msg_send(3)\&.
-.sp .5v
-.RE
-.SS "Multi\-part messages"
-.sp
-A 0MQ message is composed of 1 or more message parts\&. Each message part is an independent \fIzmq_msg_t\fR in its own right\&. 0MQ ensures atomic delivery of messages: peers shall receive either all \fImessage parts\fR of a message or none at all\&. The total number of message parts is unlimited except by available memory\&.
-.sp
-An application that sends multi\-part messages must use the \fIZMQ_SNDMORE\fR flag when sending each message part except the final one\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_sendmsg()\fR function shall return number of bytes in the message if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEAGAIN\fR
-.RS 4
-Non\-blocking mode was requested and the message cannot be sent at the moment\&.
-.RE
-.PP
-\fBENOTSUP\fR
-.RS 4
-The
-\fIzmq_sendmsg()\fR
-operation is not supported by this socket type\&.
-.RE
-.PP
-\fBEFSM\fR
-.RS 4
-The
-\fIzmq_sendmsg()\fR
-operation cannot be performed on this socket at the moment due to the socket not being in the appropriate state\&. This error may occur with socket types that switch between several states, such as ZMQ_REP\&. See the
-\fImessaging patterns\fR
-section of
-\fBzmq_socket\fR(3)
-for more information\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal before the message was sent\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-Invalid message\&.
-.RE
-.PP
-\fBEHOSTUNREACH\fR
-.RS 4
-The message cannot be routed\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBFilling in a message and sending it to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a new message, allocating 6 bytes for message content */
-zmq_msg_t msg;
-int rc = zmq_msg_init_size (&msg, 6);
-assert (rc == 0);
-/* Fill in message content with \*(AqAAAAAA\*(Aq */
-memset (zmq_msg_data (&msg), \*(AqA\*(Aq, 6);
-/* Send the message to the socket */
-rc = zmq_sendmsg (socket, &msg, 0);
-assert (rc == 6);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBSending a multi-part message\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Send a multi\-part message consisting of three parts to socket */
-rc = zmq_sendmsg (socket, &part1, ZMQ_SNDMORE);
-rc = zmq_sendmsg (socket, &part2, ZMQ_SNDMORE);
-/* Final part; no more parts to follow */
-rc = zmq_sendmsg (socket, &part3, 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_recv\fR(3) \fBzmq_socket\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_setsockopt.3 b/ps-lite/deps/share/man/man3/zmq_setsockopt.3
deleted file mode 100644
index f1d5d6d1..00000000
--- a/ps-lite/deps/share/man/man3/zmq_setsockopt.3
+++ /dev/null
@@ -1,2473 +0,0 @@
-'\" t
-.\"     Title: zmq_setsockopt
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SETSOCKOPT" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_setsockopt \- set 0MQ socket options
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_setsockopt (void \fR\fB\fI*socket\fR\fR\fB, int \fR\fB\fIoption_name\fR\fR\fB, const void \fR\fB\fI*option_value\fR\fR\fB, size_t \fR\fB\fIoption_len\fR\fR\fB);\fR
-.sp
-Caution: All options, with the exception of ZMQ_SUBSCRIBE, ZMQ_UNSUBSCRIBE, ZMQ_LINGER, ZMQ_ROUTER_HANDOVER, ZMQ_ROUTER_MANDATORY, ZMQ_PROBE_ROUTER, ZMQ_XPUB_VERBOSE, ZMQ_REQ_CORRELATE, and ZMQ_REQ_RELAXED, only take effect for subsequent socket bind/connects\&.
-.sp
-Specifically, security options take effect for subsequent bind/connect calls, and can be changed at any time to affect subsequent binds and/or connects\&.
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_setsockopt()\fR function shall set the option specified by the \fIoption_name\fR argument to the value pointed to by the \fIoption_value\fR argument for the 0MQ socket pointed to by the \fIsocket\fR argument\&. The \fIoption_len\fR argument is the size of the option value in bytes\&.
-.sp
-The following socket options can be set with the \fIzmq_setsockopt()\fR function:
-.SS "ZMQ_AFFINITY: Set I/O thread affinity"
-.sp
-The \fIZMQ_AFFINITY\fR option shall set the I/O thread affinity for newly created connections on the specified \fIsocket\fR\&.
-.sp
-Affinity determines which threads from the 0MQ I/O thread pool associated with the socket\(cqs \fIcontext\fR shall handle newly created connections\&. A value of zero specifies no affinity, meaning that work shall be distributed fairly among all 0MQ I/O threads in the thread pool\&. For non\-zero values, the lowest bit corresponds to thread 1, second lowest bit to thread 2 and so on\&. For example, a value of 3 specifies that subsequent connections on \fIsocket\fR shall be handled exclusively by I/O threads 1 and 2\&.
-.sp
-See also \fBzmq_init\fR(3) for details on allocating the number of I/O threads for a specific \fIcontext\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-uint64_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A (bitmap)
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-N/A
-T}
-.TE
-.sp 1
-.SS "ZMQ_BACKLOG: Set maximum length of the queue of outstanding connections"
-.sp
-The \fIZMQ_BACKLOG\fR option shall set the maximum length of the queue of outstanding peer connections for the specified \fIsocket\fR; this only applies to connection\-oriented transports\&. For details refer to your operating system documentation for the \fIlisten\fR function\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-connections
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_CONNECT_RID: Assign the next outbound connection id"
-.sp
-The \fIZMQ_CONNECT_RID\fR option sets the peer id of the next host connected via the zmq_connect() call, and immediately readies that connection for data transfer with the named id\&. This option applies only to the first subsequent call to zmq_connect(), calls thereafter use default connection behavior\&.
-.sp
-Typical use is to set this socket option ahead of each zmq_connect() attempt to a new host\&. Each connection MUST be assigned a unique name\&. Assigning a name that is already in use is not allowed\&.
-.sp
-Useful when connecting ROUTER to ROUTER, or STREAM to STREAM, as it allows for immediate sending to peers\&. Outbound id framing requirements for ROUTER and STREAM sockets apply\&.
-.sp
-The peer id should be from 1 to 255 bytes long and MAY NOT start with binary zero\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_ROUTER, ZMQ_STREAM
-T}
-.TE
-.sp 1
-.SS "ZMQ_CONFLATE: Keep only last message"
-.sp
-If set, a socket shall keep only one message in its inbound/outbound queue, this message being the last message received/the last message to be sent\&. Ignores \fIZMQ_RCVHWM\fR and \fIZMQ_SNDHWM\fR options\&. Does not support multi\-part messages, in particular, only one part of it is kept in the socket internal queue\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_PULL, ZMQ_PUSH, ZMQ_SUB, ZMQ_PUB, ZMQ_DEALER
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_PUBLICKEY: Set CURVE public key"
-.sp
-Sets the socket\(cqs long term public key\&. You must set this on CURVE client sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. The public key must always be used with the matching secret key\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_SECRETKEY: Set CURVE secret key"
-.sp
-Sets the socket\(cqs long term secret key\&. You must set this on both CURVE client and server sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_SERVER: Set CURVE server role"
-.sp
-Defines whether the socket will act as server for CURVE security, see \fBzmq_curve\fR(7)\&. A value of \fI1\fR means the socket will act as CURVE server\&. A value of \fI0\fR means the socket will not act as CURVE server, and its security role then depends on other option settings\&. Setting this to \fI0\fR shall reset the socket security to NULL\&. When you set this you must also set the server\(cqs secret key using the ZMQ_CURVE_SECRETKEY option\&. A server socket does not need to know its own public key\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_CURVE_SERVERKEY: Set CURVE server key"
-.sp
-Sets the socket\(cqs long term server key\&. You must set this on CURVE client sockets, see \fBzmq_curve\fR(7)\&. You can provide the key as 32 binary bytes, or as a 40\-character string encoded in the Z85 encoding format and terminated in a null byte\&. This key must have been generated together with the server\(cqs secret key\&. To generate a public/secret key pair, use \fBzmq_curve_keypair\fR(3)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-an option value size of 40 is supported for backwards compatibility, though is deprecated\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data or Z85 text string
-T}
-T{
-.sp
-Option value size
-T}:T{
-.sp
-32 or 41
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_PLAINTEXT: Disable GSSAPI encryption"
-.sp
-Defines whether communications on the socket will encrypted, see \fBzmq_gssapi\fR(7)\&. A value of \fI1\fR means that communications will be plaintext\&. A value of \fI0\fR means communications will be encrypted\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_PRINCIPAL: Set name of GSSAPI principal"
-.sp
-Sets the name of the pricipal for whom GSSAPI credentials should be acquired\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_SERVER: Set GSSAPI server role"
-.sp
-Defines whether the socket will act as server for GSSAPI security, see \fBzmq_gssapi\fR(7)\&. A value of \fI1\fR means the socket will act as GSSAPI server\&. A value of \fI0\fR means the socket will act as GSSAPI client\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_GSSAPI_SERVICE_PRINCIPAL: Set name of GSSAPI service principal"
-.sp
-Sets the name of the pricipal of the GSSAPI server to which a GSSAPI client intends to connect\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_HANDSHAKE_IVL: Set maximum handshake interval"
-.sp
-The \fIZMQ_HANDSHAKE_IVL\fR option shall set the maximum handshake interval for the specified \fIsocket\fR\&. Handshaking is the exchange of socket configuration information (socket type, identity, security) that occurs when a connection is first opened, only for connection\-oriented transports\&. If handshaking does not complete within the configured time, the connection shall be closed\&. The value 0 means no handshake time limit\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-30000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all but ZMQ_STREAM, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_IDENTITY: Set socket identity"
-.sp
-The \fIZMQ_IDENTITY\fR option shall set the identity of the specified \fIsocket\fR when connecting to a ROUTER socket\&. The identity should be from 1 to 255 bytes long and may contain any values\&.
-.sp
-If two clients use the same identity when connecting to a ROUTER, the results shall depend on the ZMQ_ROUTER_HANDOVER option setting\&. If that is not set (or set to the default of zero), the ROUTER socket shall reject clients trying to connect with an already\-used identity\&. If that option is set to 1, the ROUTER socket shall hand\-over the connection to the new client and disconnect the existing one\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-NULL
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_REQ, ZMQ_REP, ZMQ_ROUTER, ZMQ_DEALER\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IMMEDIATE: Queue messages only to completed connections"
-.sp
-By default queues will fill on outgoing connections even if the connection has not completed\&. This can lead to "lost" messages on sockets with round\-robin routing (REQ, PUSH, DEALER)\&. If this option is set to 1, messages shall be queued only to completed connections\&. This will cause the socket to block if there are no other connections, but will prevent queues from filling on pipes awaiting connection\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPV6: Enable IPv6 on socket"
-.sp
-Set the IPv6 option for the socket\&. A value of 1 means IPv6 is enabled on the socket, while 0 means the socket will use only IPv4\&. When IPv6 is enabled the socket will connect to, or accept connections from, both IPv4 and IPv6 hosts\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (false)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_LINGER: Set linger period for socket shutdown"
-.sp
-The \fIZMQ_LINGER\fR option shall set the linger period for the specified \fIsocket\fR\&. The linger period determines how long pending messages which have yet to be sent to a peer shall linger in memory after a socket is disconnected with \fBzmq_disconnect\fR(3) or closed with \fBzmq_close\fR(3), and further affects the termination of the socket\(cqs context with \fBzmq_term\fR(3)\&. The following outlines the different behaviours:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The default value of
-\fI\-1\fR
-specifies an infinite linger period\&. Pending messages shall not be discarded after a call to
-\fIzmq_disconnect()\fR
-or
-\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
-\fIzmq_term()\fR
-shall block until all pending messages have been sent to a peer\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The value of
-\fI0\fR
-specifies no linger period\&. Pending messages shall be discarded immediately after a call to
-\fIzmq_disconnect()\fR
-or
-\fIzmq_close()\fR\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-Positive values specify an upper bound for the linger period in milliseconds\&. Pending messages shall not be discarded after a call to
-\fIzmq_disconnect()\fR
-or
-\fIzmq_close()\fR; attempting to terminate the socket\(cqs context with
-\fIzmq_term()\fR
-shall block until either all pending messages have been sent to a peer, or the linger period expires, after which any pending messages shall be discarded\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-Option value type
-T}:T{
-int
-T}
-T{
-Option value unit
-T}:T{
-milliseconds
-T}
-T{
-Default value
-T}:T{
-\-1 (infinite)
-T}
-T{
-Applicable socket types
-T}:T{
-all
-T}
-.TE
-.sp 1
-.RE
-.SS "ZMQ_MAXMSGSIZE: Maximum acceptable inbound message size"
-.sp
-Limits the size of the inbound message\&. If a peer sends a message larger than ZMQ_MAXMSGSIZE it is disconnected\&. Value of \-1 means \fIno limit\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int64_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_MULTICAST_HOPS: Maximum network hops for multicast packets"
-.sp
-Sets the time\-to\-live field in every multicast packet sent from this socket\&. The default is 1 which means that the multicast packets don\(cqt leave the local network\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-network hops
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_PASSWORD: Set PLAIN security password"
-.sp
-Sets the password for outgoing connections over TCP or IPC\&. If you set this to a non\-null value, the security mechanism used for connections shall be PLAIN, see \fBzmq_plain\fR(7)\&. If you set this to a null value, the security mechanism used for connections shall be NULL, see \fBzmq_null\fR(3)\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_SERVER: Set PLAIN server role"
-.sp
-Defines whether the socket will act as server for PLAIN security, see \fBzmq_plain\fR(7)\&. A value of \fI1\fR means the socket will act as PLAIN server\&. A value of \fI0\fR means the socket will not act as PLAIN server, and its security role then depends on other option settings\&. Setting this to \fI0\fR shall reset the socket security to NULL\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_PLAIN_USERNAME: Set PLAIN security username"
-.sp
-Sets the username for outgoing connections over TCP or IPC\&. If you set this to a non\-null value, the security mechanism used for connections shall be PLAIN, see \fBzmq_plain\fR(7)\&. If you set this to a null value, the security mechanism used for connections shall be NULL, see \fBzmq_null\fR(3)\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_PROBE_ROUTER: bootstrap connections to ROUTER sockets"
-.sp
-When set to 1, the socket will automatically send an empty message when a new connection is made or accepted\&. You may set this on REQ, DEALER, or ROUTER sockets connected to a ROUTER socket\&. The application must filter such empty messages\&. The ZMQ_PROBE_ROUTER option in effect provides the ROUTER application with an event signaling the arrival of a new peer\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-do not set this option on a socket that talks to any other socket types: the results are undefined\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_ROUTER, ZMQ_DEALER, ZMQ_REQ
-T}
-.TE
-.sp 1
-.SS "ZMQ_RATE: Set multicast data rate"
-.sp
-The \fIZMQ_RATE\fR option shall set the maximum send or receive data rate for multicast transports such as \fBzmq_pgm\fR(7) using the specified \fIsocket\fR\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-kilobits per second
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVBUF: Set kernel receive buffer size"
-.sp
-The \fIZMQ_RCVBUF\fR option shall set the underlying kernel receive buffer size for the \fIsocket\fR to the specified size in bytes\&. A value of zero means leave the OS default unchanged\&. For details refer to your operating system documentation for the \fISO_RCVBUF\fR socket option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVHWM: Set high water mark for inbound messages"
-.sp
-The \fIZMQ_RCVHWM\fR option shall set the high water mark for inbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
-.sp
-If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-messages
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RCVTIMEO: Maximum time before a recv operation returns with EAGAIN"
-.sp
-Sets the timeout for receive operation on the socket\&. If the value is 0, \fIzmq_recv(3)\fR will return immediately, with a EAGAIN error if there is no message to receive\&. If the value is \-1, it will block until a message is available\&. For all other values, it will wait for a message for that amount of time before returning with an EAGAIN error\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (infinite)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECONNECT_IVL: Set reconnection interval"
-.sp
-The \fIZMQ_RECONNECT_IVL\fR option shall set the initial reconnection interval for the specified \fIsocket\fR\&. The reconnection interval is the period 0MQ shall wait between attempts to reconnect disconnected peers when using connection\-oriented transports\&. The value \-1 means no reconnection\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The reconnection interval may be randomized by 0MQ to prevent reconnection storms in topologies with a large number of peers per socket\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-100
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECONNECT_IVL_MAX: Set maximum reconnection interval"
-.sp
-The \fIZMQ_RECONNECT_IVL_MAX\fR option shall set the maximum reconnection interval for the specified \fIsocket\fR\&. This is the maximum period 0MQ shall wait between attempts to reconnect\&. On each reconnect attempt, the previous interval shall be doubled untill ZMQ_RECONNECT_IVL_MAX is reached\&. This allows for exponential backoff strategy\&. Default value means no exponential backoff is performed and reconnect interval calculations are only based on ZMQ_RECONNECT_IVL\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-Values less than ZMQ_RECONNECT_IVL will be ignored\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0 (only use ZMQ_RECONNECT_IVL)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_RECOVERY_IVL: Set multicast recovery interval"
-.sp
-The \fIZMQ_RECOVERY_IVL\fR option shall set the recovery interval for multicast transports using the specified \fIsocket\fR\&. The recovery interval determines the maximum time in milliseconds that a receiver can be absent from a multicast group before unrecoverable data loss will occur\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-Exercise care when setting large recovery intervals as the data needed for recovery will be held in memory\&. For example, a 1 minute recovery interval at a data rate of 1Gbps requires a 7GB in\-memory buffer\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-10000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using multicast transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_REQ_CORRELATE: match replies with requests"
-.sp
-The default behavior of REQ sockets is to rely on the ordering of messages to match requests and responses and that is usually sufficient\&. When this option is set to 1, the REQ socket will prefix outgoing messages with an extra frame containing a request id\&. That means the full message is (request id, identity, 0, user frames\&...)\&. The REQ socket will discard all incoming messages that don\(cqt begin with these two frames\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_REQ
-T}
-.TE
-.sp 1
-.SS "ZMQ_REQ_RELAXED: relax strict alternation between request and reply"
-.sp
-By default, a REQ socket does not allow initiating a new request with \fIzmq_send(3)\fR until the reply to the previous one has been received\&. When set to 1, sending another message is allowed and has the effect of disconnecting the underlying connection to the peer from which the reply was expected, triggering a reconnection attempt on transports that support it\&. The request\-reply state machine is reset and a new request is sent to the next available peer\&.
-.sp
-If set to 1, also enable ZMQ_REQ_CORRELATE to ensure correct matching of requests and replies\&. Otherwise a late reply to an aborted request can be reported as the reply to the superseding request\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_REQ
-T}
-.TE
-.sp 1
-.SS "ZMQ_ROUTER_HANDOVER: handle duplicate client identities on ROUTER sockets"
-.sp
-If two clients use the same identity when connecting to a ROUTER, the results shall depend on the ZMQ_ROUTER_HANDOVER option setting\&. If that is not set (or set to the default of zero), the ROUTER socket shall reject clients trying to connect with an already\-used identity\&. If that option is set to 1, the ROUTER socket shall hand\-over the connection to the new client and disconnect the existing one\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_ROUTER
-T}
-.TE
-.sp 1
-.SS "ZMQ_ROUTER_MANDATORY: accept only routable messages on ROUTER sockets"
-.sp
-Sets the ROUTER socket behavior when an unroutable message is encountered\&. A value of 0 is the default and discards the message silently when it cannot be routed or the peers SNDHWM is reached\&. A value of 1 returns an \fIEHOSTUNREACH\fR error code if the message cannot be routed or \fIEAGAIN\fR error code if the SNDHWM is reached and ZMQ_DONTWAIT was used\&. Without ZMQ_DONTWAIT it will block until the SNDTIMEO is reached or a spot in the send queue opens up\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_ROUTER
-T}
-.TE
-.sp 1
-.SS "ZMQ_ROUTER_RAW: switch ROUTER socket to raw mode"
-.sp
-Sets the raw mode on the ROUTER, when set to 1\&. When the ROUTER socket is in raw mode, and when using the tcp:// transport, it will read and write TCP data without 0MQ framing\&. This lets 0MQ applications talk to non\-0MQ applications\&. When using raw mode, you cannot set explicit identities, and the ZMQ_SNDMORE flag is ignored when sending data messages\&. In raw mode you can close a specific connection by sending it a zero\-length message (following the identity frame)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-This option is deprecated, please use ZMQ_STREAM sockets instead\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_ROUTER
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDBUF: Set kernel transmit buffer size"
-.sp
-The \fIZMQ_SNDBUF\fR option shall set the underlying kernel transmit buffer size for the \fIsocket\fR to the specified size in bytes\&. A value of zero means leave the OS default unchanged\&. For details please refer to your operating system documentation for the \fISO_SNDBUF\fR socket option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-bytes
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDHWM: Set high water mark for outbound messages"
-.sp
-The \fIZMQ_SNDHWM\fR option shall set the high water mark for outbound messages on the specified \fIsocket\fR\&. The high water mark is a hard limit on the maximum number of outstanding messages 0MQ shall queue in memory for any single peer that the specified \fIsocket\fR is communicating with\&. A value of zero means no limit\&.
-.sp
-If this limit has been reached the socket shall enter an exceptional state and depending on the socket type, 0MQ shall take appropriate action such as blocking or dropping sent messages\&. Refer to the individual socket descriptions in \fBzmq_socket\fR(3) for details on the exact action taken for each socket type\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-0MQ does not guarantee that the socket will accept as many as ZMQ_SNDHWM messages, and the actual limit may be as much as 60\-70% lower depending on the flow of messages on the socket\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-messages
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1000
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_SNDTIMEO: Maximum time before a send operation returns with EAGAIN"
-.sp
-Sets the timeout for send operation on the socket\&. If the value is 0, \fIzmq_send(3)\fR will return immediately, with a EAGAIN error if the message cannot be sent\&. If the value is \-1, it will block until the message is sent\&. For all other values, it will try to send the message for that amount of time before returning with an EAGAIN error\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-milliseconds
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (infinite)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all
-T}
-.TE
-.sp 1
-.SS "ZMQ_SUBSCRIBE: Establish message filter"
-.sp
-The \fIZMQ_SUBSCRIBE\fR option shall establish a new message filter on a \fIZMQ_SUB\fR socket\&. Newly created \fIZMQ_SUB\fR sockets shall filter out all incoming messages, therefore you should call this option to establish an initial message filter\&.
-.sp
-An empty \fIoption_value\fR of length zero shall subscribe to all incoming messages\&. A non\-empty \fIoption_value\fR shall subscribe to all messages beginning with the specified prefix\&. Multiple filters may be attached to a single \fIZMQ_SUB\fR socket, in which case a message shall be accepted if it matches at least one filter\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_SUB
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE: Override SO_KEEPALIVE socket option"
-.sp
-Override \fISO_KEEPALIVE\fR socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,0,1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_CNT: Override TCP_KEEPCNT socket option"
-.sp
-Override \fITCP_KEEPCNT\fR socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_IDLE: Override TCP_KEEPCNT (or TCP_KEEPALIVE on some OS)"
-.sp
-Override \fITCP_KEEPCNT\fR (or \fITCP_KEEPALIVE\fR on some OS) socket option (where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_KEEPALIVE_INTVL: Override TCP_KEEPINTVL socket option"
-.sp
-Override \fITCP_KEEPINTVL\fR socket option(where supported by OS)\&. The default value of \-1 means to skip any overrides and leave it to OS default\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-\-1,>0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-\-1 (leave to OS default)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_TOS: Set the Type\-of\-Service on socket"
-.sp
-Sets the ToS fields (Differentiated services (DS) and Explicit Congestion Notification (ECN) field of the IP header\&. The ToS field is typically used to specify a packets priority\&. The availability of this option is dependent on intermediate network equipment that inspect the ToS field andprovide a path for low\-delay, high\-throughput, highly\-reliable service, etc\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
->0
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, only for connection\-oriented transports
-T}
-.TE
-.sp 1
-.SS "ZMQ_UNSUBSCRIBE: Remove message filter"
-.sp
-The \fIZMQ_UNSUBSCRIBE\fR option shall remove an existing message filter on a \fIZMQ_SUB\fR socket\&. The filter specified must match an existing filter previously established with the \fIZMQ_SUBSCRIBE\fR option\&. If the socket has several instances of the same filter attached the \fIZMQ_UNSUBSCRIBE\fR option shall remove only one instance, leaving the rest in place and functional\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_SUB
-T}
-.TE
-.sp 1
-.SS "ZMQ_XPUB_VERBOSE: provide all subscription messages on XPUB sockets"
-.sp
-Sets the \fIXPUB\fR socket behavior on new subscriptions and unsubscriptions\&. A value of \fI0\fR is the default and passes only new subscription messages to upstream\&. A value of \fI1\fR passes all subscription messages upstream\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-0, 1
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-0
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-ZMQ_XPUB
-T}
-.TE
-.sp 1
-.SS "ZMQ_ZAP_DOMAIN: Set RFC 27 authentication domain"
-.sp
-Sets the domain for ZAP (ZMQ RFC 27) authentication\&. For NULL security (the default on all tcp:// connections), ZAP authentication only happens if you set a non\-empty domain\&. For PLAIN and CURVE security, ZAP requests are always made, if there is a ZAP handler present\&. See \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:27\fR\m[] for more details\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-character string
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-not set
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transport
-T}
-.TE
-.sp 1
-.SS "ZMQ_TCP_ACCEPT_FILTER: Assign filters to allow new TCP connections"
-.sp
-Assign an arbitrary number of filters that will be applied for each new TCP transport connection on a listening socket\&. If no filters are applied, then the TCP transport allows connections from any IP address\&. If at least one filter is applied then new connection source ip should be matched\&. To clear all filters call zmq_setsockopt(socket, ZMQ_TCP_ACCEPT_FILTER, NULL, 0)\&. Filter is a null\-terminated string with ipv6 or ipv4 CIDR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-This option is deprecated, please use authentication via the ZAP API and IP address whitelisting / blacklisting\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-binary data
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-no filters (allow from all)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all listening sockets, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPC_FILTER_GID: Assign group ID filters to allow new IPC connections"
-.sp
-Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all GID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_GID, NULL, 0)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-GID filters are only available on platforms supporting SO_PEERCRED or LOCAL_PEERCRED socket options (currently only Linux and later versions of OS X)\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-gid_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-no filters (allow from all)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all listening sockets, when using IPC transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPC_FILTER_PID: Assign process ID filters to allow new IPC connections"
-.sp
-Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all PID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_PID, NULL, 0)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-PID filters are only available on platforms supporting the SO_PEERCRED socket option (currently only Linux)\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-pid_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-no filters (allow from all)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all listening sockets, when using IPC transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPC_FILTER_UID: Assign user ID filters to allow new IPC connections"
-.sp
-Assign an arbitrary number of filters that will be applied for each new IPC transport connection on a listening socket\&. If no IPC filters are applied, then the IPC transport allows connections from any process\&. If at least one UID, GID, or PID filter is applied then new connection credentials should be matched\&. To clear all UID filters call zmq_setsockopt(socket, ZMQ_IPC_FILTER_UID, NULL, 0)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-UID filters are only available on platforms supporting SO_PEERCRED or LOCAL_PEERCRED socket options (currently only Linux and later versions of OS X)\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-This option is deprecated, please use authentication via the ZAP API and IPC whitelisting / blacklisting\&.
-.sp .5v
-.RE
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-uid_t
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-no filters (allow from all)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all listening sockets, when using IPC transports\&.
-T}
-.TE
-.sp 1
-.SS "ZMQ_IPV4ONLY: Use IPv4\-only on socket"
-.sp
-Set the IPv4\-only option for the socket\&. This option is deprecated\&. Please use the ZMQ_IPV6 option\&.
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Option value type
-T}:T{
-.sp
-int
-T}
-T{
-.sp
-Option value unit
-T}:T{
-.sp
-boolean
-T}
-T{
-.sp
-Default value
-T}:T{
-.sp
-1 (true)
-T}
-T{
-.sp
-Applicable socket types
-T}:T{
-.sp
-all, when using TCP transports\&.
-T}
-.TE
-.sp 1
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_setsockopt()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested option
-\fIoption_name\fR
-is unknown, or the requested
-\fIoption_len\fR
-or
-\fIoption_value\fR
-is invalid\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.PP
-\fBEINTR\fR
-.RS 4
-The operation was interrupted by delivery of a signal\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBSubscribing to messages on a ZMQ_SUB socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Subscribe to all messages */
-rc = zmq_setsockopt (socket, ZMQ_SUBSCRIBE, "", 0);
-assert (rc == 0);
-/* Subscribe to messages prefixed with "ANIMALS\&.CATS" */
-rc = zmq_setsockopt (socket, ZMQ_SUBSCRIBE, "ANIMALS\&.CATS", 12);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBSetting I/O thread affinity\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-int64_t affinity;
-/* Incoming connections on TCP port 5555 shall be handled by I/O thread 1 */
-affinity = 1;
-rc = zmq_setsockopt (socket, ZMQ_AFFINITY, &affinity, sizeof (affinity));
-assert (rc);
-rc = zmq_bind (socket, "tcp://lo:5555");
-assert (rc);
-/* Incoming connections on TCP port 5556 shall be handled by I/O thread 2 */
-affinity = 2;
-rc = zmq_setsockopt (socket, ZMQ_AFFINITY, &affinity, sizeof (affinity));
-assert (rc);
-rc = zmq_bind (socket, "tcp://lo:5556");
-assert (rc);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_getsockopt\fR(3) \fBzmq_socket\fR(3) \fBzmq_plain\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_socket.3 b/ps-lite/deps/share/man/man3/zmq_socket.3
deleted file mode 100644
index 59f0f46a..00000000
--- a/ps-lite/deps/share/man/man3/zmq_socket.3
+++ /dev/null
@@ -1,1025 +0,0 @@
-'\" t
-.\"     Title: zmq_socket
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SOCKET" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_socket \- create 0MQ socket
-.SH "SYNOPSIS"
-.sp
-\fBvoid *zmq_socket (void \fR\fB\fI*context\fR\fR\fB, int \fR\fB\fItype\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_socket()\fR function shall create a 0MQ socket within the specified \fIcontext\fR and return an opaque handle to the newly created socket\&. The \fItype\fR argument specifies the socket type, which determines the semantics of communication over the socket\&.
-.sp
-The newly created socket is initially unbound, and not associated with any endpoints\&. In order to establish a message flow a socket must first be connected to at least one endpoint with \fBzmq_connect\fR(3), or at least one endpoint must be created for accepting incoming connections with \fBzmq_bind\fR(3)\&.
-.PP
-\fBKey differences to conventional sockets\fR. Generally speaking, conventional sockets present a
-\fIsynchronous\fR
-interface to either connection\-oriented reliable byte streams (SOCK_STREAM), or connection\-less unreliable datagrams (SOCK_DGRAM)\&. In comparison, 0MQ sockets present an abstraction of an asynchronous
-\fImessage queue\fR, with the exact queueing semantics depending on the socket type in use\&. Where conventional sockets transfer streams of bytes or discrete datagrams, 0MQ sockets transfer discrete
-\fImessages\fR\&.
-.sp
-0MQ sockets being \fIasynchronous\fR means that the timings of the physical connection setup and tear down, reconnect and effective delivery are transparent to the user and organized by 0MQ itself\&. Further, messages may be \fIqueued\fR in the event that a peer is unavailable to receive them\&.
-.sp
-Conventional sockets allow only strict one\-to\-one (two peers), many\-to\-one (many clients, one server), or in some cases one\-to\-many (multicast) relationships\&. With the exception of \fIZMQ_PAIR\fR, 0MQ sockets may be connected \fBto multiple endpoints\fR using \fIzmq_connect()\fR, while simultaneously accepting incoming connections \fBfrom multiple endpoints\fR bound to the socket using \fIzmq_bind()\fR, thus allowing many\-to\-many relationships\&.
-.PP
-\fBThread safety\fR. 0MQ
-\fIsockets\fR
-are
-\fInot\fR
-thread safe\&. Applications MUST NOT use a socket from multiple threads except after migrating a socket from one thread to another with a "full fence" memory barrier\&.
-.PP
-\fBSocket types\fR. The following sections present the socket types defined by 0MQ, grouped by the general
-\fImessaging pattern\fR
-which is built from related socket types\&.
-.SS "Request\-reply pattern"
-.sp
-The request\-reply pattern is used for sending requests from a ZMQ_REQ \fIclient\fR to one or more ZMQ_REP \fIservices\fR, and receiving subsequent replies to each request sent\&.
-.sp
-The request\-reply pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:28\fR\m[]\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_REQ\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_REQ\fR is used by a \fIclient\fR to send requests to and receive replies from a \fIservice\fR\&. This socket type allows only an alternating sequence of \fIzmq_send(request)\fR and subsequent \fIzmq_recv(reply)\fR calls\&. Each request sent is round\-robined among all \fIservices\fR, and each reply received is matched with the last issued request\&.
-.sp
-If no services are available, then any send operation on the socket shall block until at least one \fIservice\fR becomes available\&. The REQ socket shall not discard messages\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&1.\ \&Summary of ZMQ_REQ characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_REP\fR, \fIZMQ_ROUTER\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Send, Receive, Send, Receive, \&...
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Round\-robin
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Last peer
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Block
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_REP\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_REP\fR is used by a \fIservice\fR to receive requests from and send replies to a \fIclient\fR\&. This socket type allows only an alternating sequence of \fIzmq_recv(request)\fR and subsequent \fIzmq_send(reply)\fR calls\&. Each request received is fair\-queued from among all \fIclients\fR, and each reply sent is routed to the \fIclient\fR that issued the last request\&. If the original requester does not exist any more the reply is silently discarded\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&2.\ \&Summary of ZMQ_REP characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_REQ\fR, \fIZMQ_DEALER\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Receive, Send, Receive, Send, \&...
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Last peer
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_DEALER\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_DEALER\fR is an advanced pattern used for extending request/reply sockets\&. Each message sent is round\-robined among all connected peers, and each message received is fair\-queued from all connected peers\&.
-.sp
-When a \fIZMQ_DEALER\fR socket enters the \fImute\fR state due to having reached the high water mark for all peers, or if there are no peers at all, then any \fBzmq_send\fR(3) operations on the socket shall block until the mute state ends or at least one peer becomes available for sending; messages are not discarded\&.
-.sp
-When a \fIZMQ_DEALER\fR socket is connected to a \fIZMQ_REP\fR socket each message sent must consist of an empty message part, the \fIdelimiter\fR, followed by one or more \fIbody parts\fR\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&3.\ \&Summary of ZMQ_DEALER characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_ROUTER\fR, \fIZMQ_REP\fR, \fIZMQ_DEALER\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Unrestricted
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Round\-robin
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Block
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_ROUTER\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_ROUTER\fR is an advanced socket type used for extending request/reply sockets\&. When receiving messages a \fIZMQ_ROUTER\fR socket shall prepend a message part containing the \fIidentity\fR of the originating peer to the message before passing it to the application\&. Messages received are fair\-queued from among all connected peers\&. When sending messages a \fIZMQ_ROUTER\fR socket shall remove the first part of the message and use it to determine the \fIidentity\fR of the peer the message shall be routed to\&. If the peer does not exist anymore the message shall be silently discarded by default, unless \fIZMQ_ROUTER_MANDATORY\fR socket option is set to \fI1\fR\&.
-.sp
-When a \fIZMQ_ROUTER\fR socket enters the \fImute\fR state due to having reached the high water mark for all peers, then any messages sent to the socket shall be dropped until the mute state ends\&. Likewise, any messages routed to a peer for which the individual high water mark has been reached shall also be dropped\&.
-.sp
-When a \fIZMQ_REQ\fR socket is connected to a \fIZMQ_ROUTER\fR socket, in addition to the \fIidentity\fR of the originating peer each message received shall contain an empty \fIdelimiter\fR message part\&. Hence, the entire structure of each received message as seen by the application becomes: one or more \fIidentity\fR parts, \fIdelimiter\fR part, one or more \fIbody parts\fR\&. When sending replies to a \fIZMQ_REQ\fR socket the application must include the \fIdelimiter\fR part\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&4.\ \&Summary of ZMQ_ROUTER characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_DEALER\fR, \fIZMQ_REQ\fR, \fIZMQ_ROUTER\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Unrestricted
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-See text
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Drop
-T}
-.TE
-.sp 1
-.RE
-.SS "Publish\-subscribe pattern"
-.sp
-The publish\-subscribe pattern is used for one\-to\-many distribution of data from a single \fIpublisher\fR to multiple \fIsubscribers\fR in a fan out fashion\&.
-.sp
-The publish\-subscribe pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:29\fR\m[]\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_PUB\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_PUB\fR is used by a \fIpublisher\fR to distribute data\&. Messages sent are distributed in a fan out fashion to all connected peers\&. The \fBzmq_recv\fR(3) function is not implemented for this socket type\&.
-.sp
-When a \fIZMQ_PUB\fR socket enters the \fImute\fR state due to having reached the high water mark for a \fIsubscriber\fR, then any messages that would be sent to the \fIsubscriber\fR in question shall instead be dropped until the mute state ends\&. The \fIzmq_send()\fR function shall never block for this socket type\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&5.\ \&Summary of ZMQ_PUB characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_SUB\fR, \fIZMQ_XSUB\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Send only
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Fan out
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Drop
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_SUB\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_SUB\fR is used by a \fIsubscriber\fR to subscribe to data distributed by a \fIpublisher\fR\&. Initially a \fIZMQ_SUB\fR socket is not subscribed to any messages, use the \fIZMQ_SUBSCRIBE\fR option of \fBzmq_setsockopt\fR(3) to specify which messages to subscribe to\&. The \fIzmq_send()\fR function is not implemented for this socket type\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&6.\ \&Summary of ZMQ_SUB characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_PUB\fR, \fIZMQ_XPUB\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Receive only
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-N/A
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_XPUB\fR
-.RS 4
-.sp
-Same as ZMQ_PUB except that you can receive subscriptions from the peers in form of incoming messages\&. Subscription message is a byte 1 (for subscriptions) or byte 0 (for unsubscriptions) followed by the subscription body\&. Messages without a sub/unsub prefix are also received, but have no effect on subscription status\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&7.\ \&Summary of ZMQ_XPUB characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_SUB\fR, \fIZMQ_XSUB\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Send messages, receive subscriptions
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Fan out
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Drop
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_XSUB\fR
-.RS 4
-.sp
-Same as ZMQ_SUB except that you subscribe by sending subscription messages to the socket\&. Subscription message is a byte 1 (for subscriptions) or byte 0 (for unsubscriptions) followed by the subscription body\&. Messages without a sub/unsub prefix may also be sent, but have no effect on subscription status\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&8.\ \&Summary of ZMQ_XSUB characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_PUB\fR, \fIZMQ_XPUB\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Receive messages, send subscriptions
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Drop
-T}
-.TE
-.sp 1
-.RE
-.SS "Pipeline pattern"
-.sp
-The pipeline pattern is used for distributing data to \fInodes\fR arranged in a pipeline\&. Data always flows down the pipeline, and each stage of the pipeline is connected to at least one \fInode\fR\&. When a pipeline stage is connected to multiple \fInodes\fR data is round\-robined among all connected \fInodes\fR\&.
-.sp
-The pipeline pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:30\fR\m[]\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_PUSH\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_PUSH\fR is used by a pipeline \fInode\fR to send messages to downstream pipeline \fInodes\fR\&. Messages are round\-robined to all connected downstream \fInodes\fR\&. The \fIzmq_recv()\fR function is not implemented for this socket type\&.
-.sp
-When a \fIZMQ_PUSH\fR socket enters the \fImute\fR state due to having reached the high water mark for all downstream \fInodes\fR, or if there are no downstream \fInodes\fR at all, then any \fBzmq_send\fR(3) operations on the socket shall block until the mute state ends or at least one downstream \fInode\fR becomes available for sending; messages are not discarded\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&9.\ \&Summary of ZMQ_PUSH characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_PULL\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Send only
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-Round\-robin
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Block
-T}
-.TE
-.sp 1
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_PULL\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_PULL\fR is used by a pipeline \fInode\fR to receive messages from upstream pipeline \fInodes\fR\&. Messages are fair\-queued from among all connected upstream \fInodes\fR\&. The \fIzmq_send()\fR function is not implemented for this socket type\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&10.\ \&Summary of ZMQ_PULL characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_PUSH\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Unidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Receive only
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Block
-T}
-.TE
-.sp 1
-.RE
-.SS "Exclusive pair pattern"
-.sp
-The exclusive pair pattern is used to connect a peer to precisely one other peer\&. This pattern is used for inter\-thread communication across the inproc transport\&.
-.sp
-The exclusive pair pattern is formally defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:31\fR\m[]\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_PAIR\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_PAIR\fR can only be connected to a single peer at any one time\&. No message routing or filtering is performed on messages sent over a \fIZMQ_PAIR\fR socket\&.
-.sp
-When a \fIZMQ_PAIR\fR socket enters the \fImute\fR state due to having reached the high water mark for the connected peer, or if no peer is connected, then any \fBzmq_send\fR(3) operations on the socket shall block until the peer becomes available for sending; messages are not discarded\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-\fIZMQ_PAIR\fR sockets are designed for inter\-thread communication across the \fBzmq_inproc\fR(7) transport and do not implement functionality such as auto\-reconnection\&. \fIZMQ_PAIR\fR sockets are considered experimental and may have other missing or broken aspects\&.
-.sp .5v
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&11.\ \&Summary of ZMQ_PAIR characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-\fIZMQ_PAIR\fR
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Unrestricted
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-N/A
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-Block
-T}
-.TE
-.sp 1
-.RE
-.SS "Native Pattern"
-.sp
-The native pattern is used for communicating with TCP peers and allows asynchronous requests and replies in either direction\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBZMQ_STREAM\fR
-.RS 4
-.sp
-A socket of type \fIZMQ_STREAM\fR is used to send and receive TCP data from a non\-0MQ peer, when using the tcp:// transport\&. A \fIZMQ_STREAM\fR socket can act as client and/or server, sending and/or receiving TCP data asynchronously\&.
-.sp
-When receiving TCP data, a \fIZMQ_STREAM\fR socket shall prepend a message part containing the \fIidentity\fR of the originating peer to the message before passing it to the application\&. Messages received are fair\-queued from among all connected peers\&.
-.sp
-When sending TCP data, a \fIZMQ_STREAM\fR socket shall remove the first part of the message and use it to determine the \fIidentity\fR of the peer the message shall be routed to, and unroutable messages shall cause an EHOSTUNREACH or EAGAIN error\&.
-.sp
-To open a connection to a server, use the zmq_connect call, and then fetch the socket identity using the ZMQ_IDENTITY zmq_getsockopt call\&.
-.sp
-To close a specific connection, send the identity frame followed by a zero\-length message (see EXAMPLE section)\&.
-.sp
-When a connection is made, a zero\-length message will be received by the application\&. Similarly, when the peer disconnects (or the connection is lost), a zero\-length message will be received by the application\&.
-.sp
-The ZMQ_SNDMORE flag is ignored on data frames\&. You must send one identity frame followed by one data frame\&.
-.sp
-Also, please note that omitting the ZMQ_SNDMORE flag will prevent sending further data (from any client) on the same socket\&.
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.B Table\ \&12.\ \&Summary of ZMQ_STREAM characteristics
-.TS
-tab(:);
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt
-lt lt.
-T{
-.sp
-Compatible peer sockets
-T}:T{
-.sp
-none\&.
-T}
-T{
-.sp
-Direction
-T}:T{
-.sp
-Bidirectional
-T}
-T{
-.sp
-Send/receive pattern
-T}:T{
-.sp
-Unrestricted
-T}
-T{
-.sp
-Outgoing routing strategy
-T}:T{
-.sp
-See text
-T}
-T{
-.sp
-Incoming routing strategy
-T}:T{
-.sp
-Fair\-queued
-T}
-T{
-.sp
-Action in mute state
-T}:T{
-.sp
-EAGAIN
-T}
-.TE
-.sp 1
-.RE
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_socket()\fR function shall return an opaque handle to the newly created socket if successful\&. Otherwise, it shall return NULL and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The requested socket
-\fItype\fR
-is invalid\&.
-.RE
-.PP
-\fBEFAULT\fR
-.RS 4
-The provided
-\fIcontext\fR
-is invalid\&.
-.RE
-.PP
-\fBEMFILE\fR
-.RS 4
-The limit on the total number of open 0MQ sockets has been reached\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The context specified was terminated\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBCreating a simple HTTP server using ZMQ_STREAM\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void *ctx = zmq_ctx_new ();
-assert (ctx);
-/* Create ZMQ_STREAM socket */
-void *socket = zmq_socket (ctx, ZMQ_STREAM);
-assert (socket);
-int rc = zmq_bind (socket, "tcp://*:8080");
-assert (rc == 0);
-/* Data structure to hold the ZMQ_STREAM ID */
-uint8_t id [256];
-size_t id_size = 256;
-/* Data structure to hold the ZMQ_STREAM received data */
-uint8_t raw [256];
-size_t raw_size = 256;
-while (1) {
-        /*  Get HTTP request; ID frame and then request */
-        id_size = zmq_recv (socket, id, 256, 0);
-        assert (id_size > 0);
-        do {
-                raw_size = zmq_recv (socket, raw, 256, 0);
-                assert (raw_size >= 0);
-        } while (raw_size == 256);
-        /* Prepares the response */
-        char http_response [] =
-                "HTTP/1\&.0 200 OK\er\en"
-                "Content\-Type: text/plain\er\en"
-                "\er\en"
-                "Hello, World!";
-        /* Sends the ID frame followed by the response */
-        zmq_send (socket, id, id_size, ZMQ_SNDMORE);
-        zmq_send (socket, http_response, strlen (http_response), ZMQ_SNDMORE);
-        /* Closes the connection by sending the ID frame followed by a zero response */
-        zmq_send (socket, id, id_size, ZMQ_SNDMORE);
-        zmq_send (socket, 0, 0, ZMQ_SNDMORE);
-        /* NOTE: If we don\*(Aqt use ZMQ_SNDMORE, then we won\*(Aqt be able to send more */
-        /* message to any client */
-}
-zmq_close (socket);
-zmq_ctx_destroy (ctx);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_init\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_send\fR(3) \fBzmq_recv\fR(3) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_socket_monitor.3 b/ps-lite/deps/share/man/man3/zmq_socket_monitor.3
deleted file mode 100644
index 29fcd82f..00000000
--- a/ps-lite/deps/share/man/man3/zmq_socket_monitor.3
+++ /dev/null
@@ -1,235 +0,0 @@
-'\" t
-.\"     Title: zmq_socket_monitor
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_SOCKET_MONITOR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_socket_monitor \- monitor socket events
-.SH "SYNOPSIS"
-.sp
-\fBint zmq_socket_monitor (void \fR\fB\fI*socket\fR\fR\fB, char \fR\fB\fI*endpoint\fR\fR\fB, int \fR\fB\fIevents\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_socket_monitor()\fR method lets an application thread track socket events (like connects) on a ZeroMQ socket\&. Each call to this method creates a \fIZMQ_PAIR\fR socket and binds that to the specified inproc:// \fIendpoint\fR\&. To collect the socket events, you must create your own \fIZMQ_PAIR\fR socket, and connect that to the endpoint\&.
-.sp
-The \fIevents\fR argument is a bitmask of the socket events you wish to monitor, see \fISupported events\fR below\&. To monitor all events, use the event value ZMQ_EVENT_ALL\&.
-.sp
-Each event is sent as two frames\&. The first frame contains an event number (16 bits), and an event value (32 bits) that provides additional data according to the event number\&. The second frame contains a string that specifies the affected TCP or IPC endpoint\&.
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-The _zmq_socket_monitor()_ method supports only connection\-oriented
-transports, that is, TCP, IPC, and TIPC\&.
-.fi
-.if n \{\
-.RE
-.\}
-.SH "SUPPORTED EVENTS"
-.SS "ZMQ_EVENT_CONNECTED"
-.sp
-The socket has successfully connected to a remote peer\&. The event value is the file descriptor (FD) of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
-.SS "ZMQ_EVENT_CONNECT_DELAYED"
-.sp
-A connect request on the socket is pending\&. The event value is unspecified\&.
-.SS "ZMQ_EVENT_CONNECT_RETRIED"
-.sp
-A connect request failed, and is now being retried\&. The event value is the reconnect interval in milliseconds\&. Note that the reconnect interval is recalculated at each retry\&.
-.SS "ZMQ_EVENT_LISTENING"
-.sp
-The socket was successfully bound to a network interface\&. The event value is the FD of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
-.SS "ZMQ_EVENT_BIND_FAILED"
-.sp
-The socket could not bind to a given interface\&. The event value is the errno generated by the system bind call\&.
-.SS "ZMQ_EVENT_ACCEPTED"
-.sp
-The socket has accepted a connection from a remote peer\&. The event value is the FD of the underlying network socket\&. Warning: there is no guarantee that the FD is still valid by the time your code receives this event\&.
-.SS "ZMQ_EVENT_ACCEPT_FAILED"
-.sp
-The socket has rejected a connection from a remote peer\&. The event value is the errno generated by the accept call\&.
-.SS "ZMQ_EVENT_CLOSED"
-.sp
-The socket was closed\&. The event value is the FD of the (now closed) network socket\&.
-.SS "ZMQ_EVENT_CLOSE_FAILED"
-.sp
-The socket close failed\&. The event value is the errno returned by the system call\&. Note that this event occurs only on IPC transports\&.
-.SS "ZMQ_EVENT_DISCONNECTED"
-.sp
-The socket was disconnected unexpectedly\&. The event value is the FD of the underlying network socket\&. Warning: this socket will be closed\&.
-.SS "ZMQ_EVENT_MONITOR_STOPPED"
-.sp
-Monitoring on this socket ended\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_socket_monitor()\fR function returns a value of 0 or greater if successful\&. Otherwise it returns \-1 and sets \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBEPROTONOSUPPORT\fR
-.RS 4
-The requested
-\fItransport\fR
-protocol is not supported\&. Monitor sockets are required to use the inproc:// transport\&.
-.RE
-.PP
-\fBEINVAL\fR
-.RS 4
-The endpoint supplied is invalid\&.
-.RE
-.SH "EXAMPLE"
-.PP
-\fBMonitoring client and server sockets\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Read one event off the monitor socket; return value and address
-//  by reference, if not null, and event number by value\&. Returns \-1
-//  in case of error\&.
-
-static int
-get_monitor_event (void *monitor, int *value, char **address)
-{
-    //  First frame in message contains event number and value
-    zmq_msg_t msg;
-    zmq_msg_init (&msg);
-    if (zmq_msg_recv (&msg, monitor, 0) == \-1)
-        return \-1;              //  Interruped, presumably
-    assert (zmq_msg_more (&msg));
-
-    uint8_t *data = (uint8_t *) zmq_msg_data (&msg);
-    uint16_t event = *(uint16_t *) (data);
-    if (value)
-        *value = *(uint32_t *) (data + 2);
-
-    //  Second frame in message contains event address
-    zmq_msg_init (&msg);
-    if (zmq_msg_recv (&msg, monitor, 0) == \-1)
-        return \-1;              //  Interruped, presumably
-    assert (!zmq_msg_more (&msg));
-
-    if (address) {
-        uint8_t *data = (uint8_t *) zmq_msg_data (&msg);
-        size_t size = zmq_msg_size (&msg);
-        *address = (char *) malloc (size + 1);
-        memcpy (*address, data, size);
-        *address [size] = 0;
-    }
-    return event;
-}
-
-int main (void)
-{
-    void *ctx = zmq_ctx_new ();
-    assert (ctx);
-
-    //  We\*(Aqll monitor these two sockets
-    void *client = zmq_socket (ctx, ZMQ_DEALER);
-    assert (client);
-    void *server = zmq_socket (ctx, ZMQ_DEALER);
-    assert (server);
-
-    //  Socket monitoring only works over inproc://
-    int rc = zmq_socket_monitor (client, "tcp://127\&.0\&.0\&.1:9999", 0);
-    assert (rc == \-1);
-    assert (zmq_errno () == EPROTONOSUPPORT);
-
-    //  Monitor all events on client and server sockets
-    rc = zmq_socket_monitor (client, "inproc://monitor\-client", ZMQ_EVENT_ALL);
-    assert (rc == 0);
-    rc = zmq_socket_monitor (server, "inproc://monitor\-server", ZMQ_EVENT_ALL);
-    assert (rc == 0);
-
-    //  Create two sockets for collecting monitor events
-    void *client_mon = zmq_socket (ctx, ZMQ_PAIR);
-    assert (client_mon);
-    void *server_mon = zmq_socket (ctx, ZMQ_PAIR);
-    assert (server_mon);
-
-    //  Connect these to the inproc endpoints so they\*(Aqll get events
-    rc = zmq_connect (client_mon, "inproc://monitor\-client");
-    assert (rc == 0);
-    rc = zmq_connect (server_mon, "inproc://monitor\-server");
-    assert (rc == 0);
-
-    //  Now do a basic ping test
-    rc = zmq_bind (server, "tcp://127\&.0\&.0\&.1:9998");
-    assert (rc == 0);
-    rc = zmq_connect (client, "tcp://127\&.0\&.0\&.1:9998");
-    assert (rc == 0);
-    bounce (client, server);
-
-    //  Close client and server
-    close_zero_linger (client);
-    close_zero_linger (server);
-
-    //  Now collect and check events from both sockets
-    int event = get_monitor_event (client_mon, NULL, NULL);
-    if (event == ZMQ_EVENT_CONNECT_DELAYED)
-        event = get_monitor_event (client_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_CONNECTED);
-    event = get_monitor_event (client_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_MONITOR_STOPPED);
-
-    //  This is the flow of server events
-    event = get_monitor_event (server_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_LISTENING);
-    event = get_monitor_event (server_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_ACCEPTED);
-    event = get_monitor_event (server_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_CLOSED);
-    event = get_monitor_event (server_mon, NULL, NULL);
-    assert (event == ZMQ_EVENT_MONITOR_STOPPED);
-
-    //  Close down the sockets
-    close_zero_linger (client_mon);
-    close_zero_linger (server_mon);
-    zmq_ctx_term (ctx);
-
-    return 0 ;
-}
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_strerror.3 b/ps-lite/deps/share/man/man3/zmq_strerror.3
deleted file mode 100644
index c3065acf..00000000
--- a/ps-lite/deps/share/man/man3/zmq_strerror.3
+++ /dev/null
@@ -1,67 +0,0 @@
-'\" t
-.\"     Title: zmq_strerror
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_STRERROR" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_strerror \- get 0MQ error message string
-.SH "SYNOPSIS"
-.sp
-\fBconst char *zmq_strerror (int \fR\fB\fIerrnum\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_strerror()\fR function shall return a pointer to an error message string corresponding to the error number specified by the \fIerrnum\fR argument\&. As 0MQ defines additional error numbers over and above those defined by the operating system, applications should use \fIzmq_strerror()\fR in preference to the standard \fIstrerror()\fR function\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_strerror()\fR function shall return a pointer to an error message string\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "EXAMPLE"
-.PP
-\fBDisplaying an error message when a 0MQ context cannot be initialised\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-void *ctx = zmq_init (1, 1, 0);
-if (!ctx) {
-    printf ("Error occurred during zmq_init(): %s\en", zmq_strerror (errno));
-    abort ();
-}
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_unbind.3 b/ps-lite/deps/share/man/man3/zmq_unbind.3
deleted file mode 100644
index f6c866d1..00000000
--- a/ps-lite/deps/share/man/man3/zmq_unbind.3
+++ /dev/null
@@ -1,120 +0,0 @@
-'\" t
-.\"     Title: zmq_unbind
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_UNBIND" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_unbind \- Stop accepting connections on a socket
-.SH "SYNOPSIS"
-.sp
-int zmq_unbind (void \fI*socket\fR, const char \fI*endpoint\fR);
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_unbind()\fR function shall unbind a socket specified by the \fIsocket\fR argument from the endpoint specified by the \fIendpoint\fR argument\&.
-.sp
-The \fIendpoint\fR argument is as described in \fBzmq_bind\fR(3)
-.SS "Unbinding wild\-card addres from a socket"
-.sp
-When wild\-card * \fIendpoint\fR (described in \fBzmq_tcp\fR(7) and \fBzmq_ipc\fR(7)) was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_unbind()\fR function shall return zero if successful\&. Otherwise it shall return \-1 and set \fIerrno\fR to one of the values defined below\&.
-.SH "ERRORS"
-.PP
-\fBEINVAL\fR
-.RS 4
-The endpoint supplied is invalid\&.
-.RE
-.PP
-\fBETERM\fR
-.RS 4
-The 0MQ
-\fIcontext\fR
-associated with the specified
-\fIsocket\fR
-was terminated\&.
-.RE
-.PP
-\fBENOTSOCK\fR
-.RS 4
-The provided
-\fIsocket\fR
-was invalid\&.
-.RE
-.SH "EXAMPLES"
-.PP
-\fBUnbind a subscriber socket from a TCP transport\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a ZMQ_SUB socket */
-void *socket = zmq_socket (context, ZMQ_SUB);
-assert (socket);
-/* Connect it to the host server001, port 5555 using a TCP transport */
-rc = zmq_bind (socket, "tcp://127\&.0\&.0\&.1:5555");
-assert (rc == 0);
-/* Disconnect from the previously connected endpoint */
-rc = zmq_unbind (socket, "tcp://127\&.0\&.0\&.1:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBUnbind wild-card * binded socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-/* Create a ZMQ_SUB socket */
-void *socket = zmq_socket (context, ZMQ_SUB);
-assert (socket);
-/* Bind it to the system\-assigned ephemeral port using a TCP transport */
-rc = zmq_bind (socket, "tcp://127\&.0\&.0\&.1:*");
-assert (rc == 0);
-/* Obtain real endpoint */
-const size_t buf_size = 32;
-char buf[buf_size];
-rc = zmq_getsockopt (socket, ZMQ_LAST_ENDPOINT, buf, (size_t *)&buf_size);
-assert (rc == 0);
-/* Unbind socket by real endpoint */
-rc = zmq_unbind (socket, buf);
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_socket\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_version.3 b/ps-lite/deps/share/man/man3/zmq_version.3
deleted file mode 100644
index 3a1ad9dc..00000000
--- a/ps-lite/deps/share/man/man3/zmq_version.3
+++ /dev/null
@@ -1,67 +0,0 @@
-'\" t
-.\"     Title: zmq_version
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_VERSION" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_version \- report 0MQ library version
-.SH "SYNOPSIS"
-.sp
-\fBvoid zmq_version (int \fR\fB\fI*major\fR\fR\fB, int \fR\fB\fI*minor\fR\fR\fB, int \fR\fB\fI*patch\fR\fR\fB);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_version()\fR function shall fill in the integer variables pointed to by the \fImajor\fR, \fIminor\fR and \fIpatch\fR arguments with the major, minor and patch level components of the 0MQ library version\&.
-.sp
-This functionality is intended for applications or language bindings dynamically linking to the 0MQ library that wish to determine the actual version of the 0MQ library they are using\&.
-.SH "RETURN VALUE"
-.sp
-There is no return value\&.
-.SH "ERRORS"
-.sp
-No errors are defined\&.
-.SH "EXAMPLE"
-.PP
-\fBPrinting out the version of the 0MQ library\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-int major, minor, patch;
-zmq_version (&major, &minor, &patch);
-printf ("Current 0MQ version is %d\&.%d\&.%d\en", major, minor, patch);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_z85_decode.3 b/ps-lite/deps/share/man/man3/zmq_z85_decode.3
deleted file mode 100644
index a891ca21..00000000
--- a/ps-lite/deps/share/man/man3/zmq_z85_decode.3
+++ /dev/null
@@ -1,64 +0,0 @@
-'\" t
-.\"     Title: zmq_z85_decode
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_Z85_DECODE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_z85_decode \- decode a binary key from Z85 printable text
-.SH "SYNOPSIS"
-.sp
-\fBuint8_t *zmq_z85_decode (uint8_t *dest, const char *string);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_z85_decode()\fR function shall decode \fIstring\fR into \fIdest\fR\&. The length of \fIstring\fR shall be divisible by 5\&. \fIdest\fR must be large enough for the decoded value (0\&.8 x strlen (string))\&.
-.sp
-The encoding shall follow the ZMQ RFC 32 specification\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_z85_decode()\fR function shall return \fIdest\fR if successful, else it shall return NULL\&.
-.SH "EXAMPLE"
-.PP
-\fBDecoding a CURVE key\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-const char decoded [] = "rq:rM>}U?@Lns47E1%kR\&.o@n%FcmmsL/@{H8]yf7";
-uint8_t public_key [32];
-zmq_z85_decode (public_key, decoded);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_z85_decode\fR(3) \fBzmq_curve_keypair\fR(3) \fBzmq_curve\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man3/zmq_z85_encode.3 b/ps-lite/deps/share/man/man3/zmq_z85_encode.3
deleted file mode 100644
index 2e0cac6b..00000000
--- a/ps-lite/deps/share/man/man3/zmq_z85_encode.3
+++ /dev/null
@@ -1,69 +0,0 @@
-'\" t
-.\"     Title: zmq_z85_encode
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_Z85_ENCODE" "3" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_z85_encode \- encode a binary key as Z85 printable text
-.SH "SYNOPSIS"
-.sp
-\fBchar *zmq_z85_encode (char *dest, const uint8_t *data, size_t size);\fR
-.SH "DESCRIPTION"
-.sp
-The \fIzmq_z85_encode()\fR function shall encode the binary block specified by \fIdata\fR and \fIsize\fR into a string in \fIdest\fR\&. The size of the binary block must be divisible by 4\&. The \fIdest\fR must have sufficient space for size * 1\&.25 plus 1 for a null terminator\&. A 32\-byte CURVE key is encoded as 40 ASCII characters plus a null terminator\&.
-.sp
-The encoding shall follow the ZMQ RFC 32 specification\&.
-.SH "RETURN VALUE"
-.sp
-The \fIzmq_z85_encode()\fR function shall return \fIdest\fR if successful, else it shall return NULL\&.
-.SH "EXAMPLE"
-.PP
-\fBEncoding a CURVE key\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-#include <sodium\&.h>
-uint8_t public_key [32];
-uint8_t secret_key [32];
-int rc = crypto_box_keypair (public_key, secret_key);
-assert (rc == 0);
-char encoded [41];
-zmq_z85_encode (encoded, public_key, 32);
-puts (encoded);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_z85_decode\fR(3) \fBzmq_curve_keypair\fR(3) \fBzmq_curve\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq.7 b/ps-lite/deps/share/man/man7/zmq.7
deleted file mode 100644
index 5d9a5c89..00000000
--- a/ps-lite/deps/share/man/man7/zmq.7
+++ /dev/null
@@ -1,246 +0,0 @@
-'\" t
-.\"     Title: zmq
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq \- 0MQ lightweight messaging kernel
-.SH "SYNOPSIS"
-.sp
-\fB#include <zmq\&.h>\fR
-.sp
-\fBcc\fR [\fIflags\fR] \fIfiles\fR \fB\-lzmq\fR [\fIlibraries\fR]
-.SH "DESCRIPTION"
-.sp
-The 0MQ lightweight messaging kernel is a library which extends the standard socket interfaces with features traditionally provided by specialised \fImessaging middleware\fR products\&. 0MQ sockets provide an abstraction of asynchronous \fImessage queues\fR, multiple \fImessaging patterns\fR, message filtering (\fIsubscriptions\fR), seamless access to multiple \fItransport protocols\fR and more\&.
-.sp
-This documentation presents an overview of 0MQ concepts, describes how 0MQ abstracts standard sockets and provides a reference manual for the functions provided by the 0MQ library\&.
-.SS "Context"
-.sp
-Before using any 0MQ library functions you must create a 0MQ \fIcontext\fR\&. When you exit your application you must destroy the \fIcontext\fR\&. These functions let you work with \fIcontexts\fR:
-.PP
-Create a new 0MQ context
-.RS 4
-\fBzmq_ctx_new\fR(3)
-.RE
-.PP
-Work with context properties
-.RS 4
-\fBzmq_ctx_set\fR(3)\fBzmq_ctx_get\fR(3)
-.RE
-.PP
-Destroy a 0MQ context
-.RS 4
-\fBzmq_ctx_shutdown\fR(3)\fBzmq_ctx_term\fR(3)
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBThread safety\fR
-.RS 4
-.sp
-A 0MQ \fIcontext\fR is thread safe and may be shared among as many application threads as necessary, without any additional locking required on the part of the caller\&.
-.sp
-Individual 0MQ \fIsockets\fR are \fInot\fR thread safe except in the case where full memory barriers are issued when migrating a socket from one thread to another\&. In practice this means applications can create a socket in one thread with \fIzmq_socket()\fR and then pass it to a \fInewly created\fR thread as part of thread initialization, for example via a structure passed as an argument to \fIpthread_create()\fR\&.
-.RE
-.sp
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBMultiple contexts\fR
-.RS 4
-.sp
-Multiple \fIcontexts\fR may coexist within a single application\&. Thus, an application can use 0MQ directly and at the same time make use of any number of additional libraries or components which themselves make use of 0MQ as long as the above guidelines regarding thread safety are adhered to\&.
-.RE
-.SS "Messages"
-.sp
-A 0MQ message is a discrete unit of data passed between applications or components of the same application\&. 0MQ messages have no internal structure and from the point of view of 0MQ itself they are considered to be opaque binary data\&.
-.sp
-The following functions are provided to work with messages:
-.PP
-Initialise a message
-.RS 4
-\fBzmq_msg_init\fR(3)\fBzmq_msg_init_size\fR(3)\fBzmq_msg_init_data\fR(3)
-.RE
-.PP
-Sending and receiving a message
-.RS 4
-\fBzmq_msg_send\fR(3)\fBzmq_msg_recv\fR(3)
-.RE
-.PP
-Release a message
-.RS 4
-\fBzmq_msg_close\fR(3)
-.RE
-.PP
-Access message content
-.RS 4
-\fBzmq_msg_data\fR(3)\fBzmq_msg_size\fR(3)\fBzmq_msg_more\fR(3)
-.RE
-.PP
-Work with message properties
-.RS 4
-\fBzmq_msg_gets\fR(3)\fBzmq_msg_get\fR(3)\fBzmq_msg_set\fR(3)
-.RE
-.PP
-Message manipulation
-.RS 4
-\fBzmq_msg_copy\fR(3)\fBzmq_msg_move\fR(3)
-.RE
-.SS "Sockets"
-.sp
-0MQ sockets present an abstraction of a asynchronous \fImessage queue\fR, with the exact queueing semantics depending on the socket type in use\&. See \fBzmq_socket\fR(3) for the socket types provided\&.
-.sp
-The following functions are provided to work with sockets:
-.PP
-Creating a socket
-.RS 4
-\fBzmq_socket\fR(3)
-.RE
-.PP
-Closing a socket
-.RS 4
-\fBzmq_close\fR(3)
-.RE
-.PP
-Manipulating socket options
-.RS 4
-\fBzmq_getsockopt\fR(3)\fBzmq_setsockopt\fR(3)
-.RE
-.PP
-Establishing a message flow
-.RS 4
-\fBzmq_bind\fR(3)\fBzmq_connect\fR(3)
-.RE
-.PP
-Sending and receiving messages
-.RS 4
-\fBzmq_msg_send\fR(3)\fBzmq_msg_recv\fR(3)\fBzmq_send\fR(3)\fBzmq_recv\fR(3)\fBzmq_send_const\fR(3)
-.RE
-.sp
-Monitoring socket events: \fBzmq_socket_monitor\fR(3)
-.PP
-\fBInput/output multiplexing\fR. 0MQ provides a mechanism for applications to multiplex input/output events over a set containing both 0MQ sockets and standard sockets\&. This mechanism mirrors the standard
-\fIpoll()\fR
-system call, and is described in detail in
-\fBzmq_poll\fR(3)\&.
-.SS "Transports"
-.sp
-A 0MQ socket can use multiple different underlying transport mechanisms\&. Each transport mechanism is suited to a particular purpose and has its own advantages and drawbacks\&.
-.sp
-The following transport mechanisms are provided:
-.PP
-Unicast transport using TCP
-.RS 4
-\fBzmq_tcp\fR(7)
-.RE
-.PP
-Reliable multicast transport using PGM
-.RS 4
-\fBzmq_pgm\fR(7)
-.RE
-.PP
-Local inter\-process communication transport
-.RS 4
-\fBzmq_ipc\fR(7)
-.RE
-.PP
-Local in\-process (inter\-thread) communication transport
-.RS 4
-\fBzmq_inproc\fR(7)
-.RE
-.SS "Proxies"
-.sp
-0MQ provides \fIproxies\fR to create fanout and fan\-in topologies\&. A proxy connects a \fIfrontend\fR socket to a \fIbackend\fR socket and switches all messages between the two sockets, opaquely\&. A proxy may optionally capture all traffic to a third socket\&. To start a proxy in an application thread, use \fBzmq_proxy\fR(3)\&.
-.SS "Security"
-.sp
-A 0MQ socket can select a security mechanism\&. Both peers must use the same security mechanism\&.
-.sp
-The following security mechanisms are provided for IPC and TCP connections:
-.PP
-Null security
-.RS 4
-\fBzmq_null\fR(7)
-.RE
-.PP
-Plain\-text authentication using username and password
-.RS 4
-\fBzmq_plain\fR(7)
-.RE
-.PP
-Elliptic curve authentication and encryption
-.RS 4
-\fBzmq_curve\fR(7)
-.RE
-.sp
-Generate a CURVE keypair in armored text format: \fBzmq_curve_keypair\fR(3)
-.sp
-Convert an armored key into a 32\-byte binary key: \fBzmq_z85_decode\fR(3)
-.sp
-Convert a 32\-byte binary CURVE key to an armored text string: \fBzmq_z85_encode\fR(3)
-.SH "ERROR HANDLING"
-.sp
-The 0MQ library functions handle errors using the standard conventions found on POSIX systems\&. Generally, this means that upon failure a 0MQ library function shall return either a NULL value (if returning a pointer) or a negative value (if returning an integer), and the actual error code shall be stored in the \fIerrno\fR variable\&.
-.sp
-On non\-POSIX systems some users may experience issues with retrieving the correct value of the \fIerrno\fR variable\&. The \fIzmq_errno()\fR function is provided to assist in these cases; for details refer to \fBzmq_errno\fR(3)\&.
-.sp
-The \fIzmq_strerror()\fR function is provided to translate 0MQ\-specific error codes into error message strings; for details refer to \fBzmq_strerror\fR(3)\&.
-.SH "MISCELLANEOUS"
-.sp
-The following miscellaneous functions are provided:
-.PP
-Report 0MQ library version
-.RS 4
-\fBzmq_version\fR(3)
-.RE
-.SH "LANGUAGE BINDINGS"
-.sp
-The 0MQ library provides interfaces suitable for calling from programs in any language; this documentation documents those interfaces as they would be used by C programmers\&. The intent is that programmers using 0MQ from other languages shall refer to this documentation alongside any documentation provided by the vendor of their language binding\&.
-.sp
-Language bindings (C++, Python, PHP, Ruby, Java and more) are provided by members of the 0MQ community and pointers can be found on the 0MQ website\&.
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
-.SH "RESOURCES"
-.sp
-Main web site: \m[blue]\fBhttp://www\&.zeromq\&.org/\fR\m[]
-.sp
-Report bugs to the 0MQ development mailing list: <\m[blue]\fBzeromq\-dev@lists\&.zeromq\&.org\fR\m[]\&\s-2\u[1]\d\s+2>
-.SH "COPYING"
-.sp
-Free use of this software is granted under the terms of the GNU Lesser General Public License (LGPL)\&. For details see the files COPYING and COPYING\&.LESSER included with the 0MQ distribution\&.
-.SH "NOTES"
-.IP " 1." 4
-zeromq-dev@lists.zeromq.org
-.RS 4
-\%mailto:zeromq-dev@lists.zeromq.org
-.RE
diff --git a/ps-lite/deps/share/man/man7/zmq_curve.7 b/ps-lite/deps/share/man/man7/zmq_curve.7
deleted file mode 100644
index 86af9fc1..00000000
--- a/ps-lite/deps/share/man/man7/zmq_curve.7
+++ /dev/null
@@ -1,93 +0,0 @@
-'\" t
-.\"     Title: zmq_curve
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_CURVE" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_curve \- secure authentication and confidentiality
-.SH "SYNOPSIS"
-.sp
-The CURVE mechanism defines a mechanism for secure authentication and confidentiality for communications between a client and a server\&. CURVE is intended for use on public networks\&. The CURVE mechanism is defined by this document: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:25\fR\m[]\&.
-.SH "CLIENT AND SERVER ROLES"
-.sp
-A socket using CURVE can be either client or server, at any moment, but not both\&. The role is independent of bind/connect direction\&.
-.sp
-A socket can change roles at any point by setting new options\&. The role affects all zmq_connect and zmq_bind calls that follow it\&.
-.sp
-To become a CURVE server, the application sets the ZMQ_CURVE_SERVER option on the socket, and then sets the ZMQ_CURVE_SECRETKEY option to provide the socket with its long\-term secret key\&. The application does not provide the socket with its long\-term public key, which is used only by clients\&.
-.sp
-To become a CURVE client, the application sets the ZMQ_CURVE_SERVERKEY option with the long\-term public key of the server it intends to connect to, or accept connections from, next\&. The application then sets the ZMQ_CURVE_PUBLICKEY and ZMQ_CURVE_SECRETKEY options with its client long\-term key pair\&.
-.sp
-If the server does authentication it will be based on the client\(cqs long term public key\&.
-.SH "KEY ENCODING"
-.sp
-The standard representation for keys in source code is either 32 bytes of base 256 (binary) data, or 40 characters of base 85 data encoded using the Z85 algorithm defined by \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:32\fR\m[]\&.
-.sp
-The Z85 algorithm is designed to produce printable key strings for use in configuration files, the command line, and code\&. There is a reference implementation in C at \m[blue]\fBhttps://github\&.com/zeromq/rfc/tree/master/src\fR\m[]\&.
-.SH "TEST KEY VALUES"
-.sp
-For test cases, the client shall use this long\-term key pair (specified as hexadecimal and in Z85):
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-public:
-    BB88471D65E2659B30C55A5321CEBB5AAB2B70A398645C26DCA2B2FCB43FC518
-    Yne@$w\-vo<fVvi]a<NY6T1ed:M$fCG*[IaLV{hID
-
-secret:
-    7BB864B489AFA3671FBE69101F94B38972F24816DFB01B51656B3FEC8DFD0888
-    D:)Q[IlAW!ahhC2ac:9*A}h:p?([4%wOTJ%JR%cs
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-And the server shall use this long\-term key pair (specified as hexadecimal and in Z85):
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-public:
-    54FCBA24E93249969316FB617C872BB0C1D1FF14800427C594CBFACF1BC2D652
-    rq:rM>}U?@Lns47E1%kR\&.o@n%FcmmsL/@{H8]yf7
-
-secret:
-    8E0BDD697628B91D8F245587EE95C5B04D48963F79259877B49CD9063AEAD3B7
-    JTKVSB%%)wK0E\&.X)V>+}o?pNmC{O&4W4b!Ni{Lh6
-.fi
-.if n \{\
-.RE
-.\}
-.SH "SEE ALSO"
-.sp
-\fBzmq_z85_encode\fR(3) \fBzmq_z85_decode\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_null\fR(7) \fBzmq_plain\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_inproc.7 b/ps-lite/deps/share/man/man7/zmq_inproc.7
deleted file mode 100644
index 19035e01..00000000
--- a/ps-lite/deps/share/man/man7/zmq_inproc.7
+++ /dev/null
@@ -1,103 +0,0 @@
-'\" t
-.\"     Title: zmq_inproc
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_INPROC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_inproc \- 0MQ local in\-process (inter\-thread) communication transport
-.SH "SYNOPSIS"
-.sp
-The in\-process transport passes messages via memory directly between threads sharing a single 0MQ \fIcontext\fR\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-No I/O threads are involved in passing messages using the \fIinproc\fR transport\&. Therefore, if you are using a 0MQ \fIcontext\fR for in\-process messaging only you can initialise the \fIcontext\fR with zero I/O threads\&. See \fBzmq_init\fR(3) for details\&.
-.sp .5v
-.RE
-.SH "ADDRESSING"
-.sp
-A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-For the in\-process transport, the transport is inproc, and the meaning of the \fIaddress\fR part is defined below\&.
-.SS "Assigning a local address to a socket"
-.sp
-When assigning a local address to a \fIsocket\fR using \fIzmq_bind()\fR with the \fIinproc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIname\fR to create\&. The \fIname\fR must be unique within the 0MQ \fIcontext\fR associated with the \fIsocket\fR and may be up to 256 characters in length\&. No other restrictions are placed on the format of the \fIname\fR\&.
-.SS "Connecting a socket"
-.sp
-When connecting a \fIsocket\fR to a peer address using \fIzmq_connect()\fR with the \fIinproc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIname\fR to connect to\&. The \fIname\fR must have been previously created by assigning it to at least one \fIsocket\fR within the same 0MQ \fIcontext\fR as the \fIsocket\fR being connected\&.
-.SH "EXAMPLES"
-.PP
-\fBAssigning a local address to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Assign the in\-process name "#1"
-rc = zmq_bind(socket, "inproc://#1");
-assert (rc == 0);
-//  Assign the in\-process name "my\-endpoint"
-rc = zmq_bind(socket, "inproc://my\-endpoint");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBConnecting a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Connect to the in\-process name "#1"
-rc = zmq_connect(socket, "inproc://#1");
-assert (rc == 0);
-//  Connect to the in\-process name "my\-endpoint"
-rc = zmq_connect(socket, "inproc://my\-endpoint");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_ipc\fR(7) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_ipc.7 b/ps-lite/deps/share/man/man7/zmq_ipc.7
deleted file mode 100644
index 9cbc2aee..00000000
--- a/ps-lite/deps/share/man/man7/zmq_ipc.7
+++ /dev/null
@@ -1,166 +0,0 @@
-'\" t
-.\"     Title: zmq_ipc
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_IPC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_ipc \- 0MQ local inter\-process communication transport
-.SH "SYNOPSIS"
-.sp
-The inter\-process transport passes messages between local processes using a system\-dependent IPC mechanism\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-The inter\-process transport is currently only implemented on operating systems that provide UNIX domain sockets\&.
-.sp .5v
-.RE
-.SH "ADDRESSING"
-.sp
-A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-For the inter\-process transport, the transport is ipc, and the meaning of the \fIaddress\fR part is defined below\&.
-.SS "Binding a socket"
-.sp
-When binding a \fIsocket\fR to a local address using \fIzmq_bind()\fR with the \fIipc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIpathname\fR to create\&. The \fIpathname\fR must be unique within the operating system namespace used by the \fIipc\fR implementation, and must fulfill any restrictions placed by the operating system on the format and length of a \fIpathname\fR\&.
-.sp
-When the address is *, \fIzmq_bind()\fR shall generate a unique temporary pathname\&. The caller should retrieve this pathname using the ZMQ_LAST_ENDPOINT socket option\&. See \fBzmq_getsockopt\fR(3) for details\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-any existing binding to the same endpoint shall be overridden\&. That is, if a second process binds to an endpoint already bound by a process, this will succeed and the first process will lose its binding\&. In this behavior, the \fIipc\fR transport is not consistent with the \fItcp\fR or \fIinproc\fR transports\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-the endpoint pathname must be writable by the process\&. When the endpoint starts with \fI/\fR, e\&.g\&., ipc:///pathname, this will be an \fIabsolute\fR pathname\&. If the endpoint specifies a directory that does not exist, the bind shall fail\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-on Linux only, when the endpoint pathname starts with @, the abstract namespace shall be used\&. The abstract namespace is independent of the filesystem and if a process attempts to bind an endpoint already bound by a process, it will fail\&. See unix(7) for details\&.
-.sp .5v
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-IPC pathnames have a maximum size that depends on the operating system\&. On Linux, the maximum is 113 characters including the "ipc://" prefix (107 characters for the real path name)\&.
-.sp .5v
-.RE
-.SS "Unbinding wild\-card address from a socket"
-.sp
-When wild\-card * \fIendpoint\fR was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket using \fIzmq_unbind()\fR\&.
-.SS "Connecting a socket"
-.sp
-When connecting a \fIsocket\fR to a peer address using \fIzmq_connect()\fR with the \fIipc\fR transport, the \fIendpoint\fR shall be interpreted as an arbitrary string identifying the \fIpathname\fR to connect to\&. The \fIpathname\fR must have been previously created within the operating system namespace by assigning it to a \fIsocket\fR with \fIzmq_bind()\fR\&.
-.SH "EXAMPLES"
-.PP
-\fBAssigning a local address to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Assign the pathname "/tmp/feeds/0"
-rc = zmq_bind(socket, "ipc:///tmp/feeds/0");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBConnecting a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Connect to the pathname "/tmp/feeds/0"
-rc = zmq_connect(socket, "ipc:///tmp/feeds/0");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_inproc\fR(7) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq_getsockopt\fR(3) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_null.7 b/ps-lite/deps/share/man/man7/zmq_null.7
deleted file mode 100644
index b69b6372..00000000
--- a/ps-lite/deps/share/man/man7/zmq_null.7
+++ /dev/null
@@ -1,40 +0,0 @@
-'\" t
-.\"     Title: zmq_null
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_NULL" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_null \- no security or confidentiality
-.SH "SYNOPSIS"
-.sp
-The NULL mechanism is defined by the ZMTP 3\&.0 specification: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:23\fR\m[]\&. This is the default security mechanism for ZeroMQ sockets\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq_plain\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_pgm.7 b/ps-lite/deps/share/man/man7/zmq_pgm.7
deleted file mode 100644
index 40e6d523..00000000
--- a/ps-lite/deps/share/man/man7/zmq_pgm.7
+++ /dev/null
@@ -1,200 +0,0 @@
-'\" t
-.\"     Title: zmq_pgm
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_PGM" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_pgm \- 0MQ reliable multicast transport using PGM
-.SH "SYNOPSIS"
-.sp
-PGM (Pragmatic General Multicast) is a protocol for reliable multicast transport of data over IP networks\&.
-.SH "DESCRIPTION"
-.sp
-0MQ implements two variants of PGM, the standard protocol where PGM datagrams are layered directly on top of IP datagrams as defined by RFC 3208 (the \fIpgm\fR transport) and "Encapsulated PGM" or EPGM where PGM datagrams are encapsulated inside UDP datagrams (the \fIepgm\fR transport)\&.
-.sp
-The \fIpgm\fR and \fIepgm\fR transports can only be used with the \fIZMQ_PUB\fR and \fIZMQ_SUB\fR socket types\&.
-.sp
-Further, PGM sockets are rate limited by default\&. For details, refer to the \fIZMQ_RATE\fR, and \fIZMQ_RECOVERY_IVL\fR options documented in \fBzmq_setsockopt\fR(3)\&.
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBCaution\fR
-.ps -1
-.br
-.sp
-The \fIpgm\fR transport implementation requires access to raw IP sockets\&. Additional privileges may be required on some operating systems for this operation\&. Applications not requiring direct interoperability with other PGM implementations are encouraged to use the \fIepgm\fR transport instead which does not require any special privileges\&.
-.sp .5v
-.RE
-.SH "ADDRESSING"
-.sp
-A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-For the PGM transport, the transport is pgm, and for the EPGM protocol the transport is epgm\&. The meaning of the \fIaddress\fR part is defined below\&.
-.SS "Connecting a socket"
-.sp
-When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fIpgm\fR or \fIepgm\fR transport, the \fIendpoint\fR shall be interpreted as an \fIinterface\fR followed by a semicolon, followed by a \fImulticast address\fR, followed by a colon and a port number\&.
-.sp
-An \fIinterface\fR may be specified by either of the following:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The interface name as defined by the operating system\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The primary IPv4 address assigned to the interface, in its numeric representation\&.
-.RE
-.if n \{\
-.sp
-.\}
-.RS 4
-.it 1 an-trap
-.nr an-no-space-flag 1
-.nr an-break-flag 1
-.br
-.ps +1
-\fBNote\fR
-.ps -1
-.br
-.sp
-Interface names are not standardised in any way and should be assumed to be arbitrary and platform dependent\&. On Win32 platforms no short interface names exist, thus only the primary IPv4 address may be used to specify an \fIinterface\fR\&. The \fIinterface\fR part can be omitted, in that case the default one will be selected\&.
-.sp .5v
-.RE
-.sp
-A \fImulticast address\fR is specified by an IPv4 multicast address in its numeric representation\&.
-.SH "WIRE FORMAT"
-.sp
-Consecutive PGM datagrams are interpreted by 0MQ as a single continuous stream of data where 0MQ messages are not necessarily aligned with PGM datagram boundaries and a single 0MQ message may span several PGM datagrams\&. This stream of data consists of 0MQ messages encapsulated in \fIframes\fR as described in \fBzmq_tcp\fR(7)\&.
-.SS "PGM datagram payload"
-.sp
-The following ABNF grammar represents the payload of a single PGM datagram as used by 0MQ:
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-datagram               = (offset data)
-offset                 = 2OCTET
-data                   = *OCTET
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-In order for late joining consumers to be able to identify message boundaries, each PGM datagram payload starts with a 16\-bit unsigned integer in network byte order specifying either the offset of the first message \fIframe\fR in the datagram or containing the value 0xFFFF if the datagram contains solely an intermediate part of a larger message\&.
-.sp
-Note that offset specifies where the first message begins rather than the first message part\&. Thus, if there are trailing message parts at the beginning of the packet the offset ignores them and points to first initial message part in the packet\&.
-.sp
-The following diagram illustrates the layout of a single PGM datagram payload:
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-| offset (16 bits) |         data         |
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-The following diagram further illustrates how three example 0MQ frames are laid out in consecutive PGM datagram payloads:
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-First datagram payload
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-| Frame offset |   Frame 1   |   Frame 2, part 1   |
-|    0x0000    | (Message 1) | (Message 2, part 1) |
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-
-Second datagram payload
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-| Frame offset |   Frame 2, part 2   |
-| 0xFFFF       | (Message 2, part 2) |
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+
-
-Third datagram payload
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+
-| Frame offset |   Frame 2, final 8 bytes   |   Frame 3   |
-| 0x0008       | (Message 2, final 8 bytes) | (Message 3) |
-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-\-+\-\-\-\-\-\-\-\-\-\-\-\-\-+
-.fi
-.if n \{\
-.RE
-.\}
-.SH "EXAMPLE"
-.PP
-\fBConnecting a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Connecting to the multicast address 239\&.192\&.1\&.1, port 5555,
-//  using the first Ethernet network interface on Linux
-//  and the Encapsulated PGM protocol
-rc = zmq_connect(socket, "epgm://eth0;239\&.192\&.1\&.1:5555");
-assert (rc == 0);
-//  Connecting to the multicast address 239\&.192\&.1\&.1, port 5555,
-//  using the network interface with the address 192\&.168\&.1\&.1
-//  and the standard PGM protocol
-rc = zmq_connect(socket, "pgm://192\&.168\&.1\&.1;239\&.192\&.1\&.1:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_connect\fR(3) \fBzmq_setsockopt\fR(3) \fBzmq_tcp\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_plain.7 b/ps-lite/deps/share/man/man7/zmq_plain.7
deleted file mode 100644
index e5bfa7b4..00000000
--- a/ps-lite/deps/share/man/man7/zmq_plain.7
+++ /dev/null
@@ -1,43 +0,0 @@
-'\" t
-.\"     Title: zmq_plain
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_PLAIN" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_plain \- clear\-text authentication
-.SH "SYNOPSIS"
-.sp
-The PLAIN mechanism defines a simple username/password mechanism that lets a server authenticate a client\&. PLAIN makes no attempt at security or confidentiality\&. It is intended for use on internal networks where security requirements are low\&. The PLAIN mechanism is defined by this document: \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:24\fR\m[]\&.
-.SH "USAGE"
-.sp
-To use PLAIN, the server shall set the ZMQ_PLAIN_SERVER option, and the client shall set the ZMQ_PLAIN_USERNAME and ZMQ_PLAIN_PASSWORD socket options\&. Which peer binds, and which connects, is not relevant\&.
-.SH "SEE ALSO"
-.sp
-\fBzmq_setsockopt\fR(3) \fBzmq_null\fR(7) \fBzmq_curve\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_tcp.7 b/ps-lite/deps/share/man/man7/zmq_tcp.7
deleted file mode 100644
index df256cde..00000000
--- a/ps-lite/deps/share/man/man7/zmq_tcp.7
+++ /dev/null
@@ -1,188 +0,0 @@
-'\" t
-.\"     Title: zmq_tcp
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_TCP" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_tcp \- 0MQ unicast transport using TCP
-.SH "SYNOPSIS"
-.sp
-TCP is an ubiquitous, reliable, unicast transport\&. When connecting distributed applications over a network with 0MQ, using the TCP transport will likely be your first choice\&.
-.SH "ADDRESSING"
-.sp
-A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-For the TCP transport, the transport is tcp, and the meaning of the \fIaddress\fR part is defined below\&.
-.SS "Assigning a local address to a socket"
-.sp
-When assigning a local address to a socket using \fIzmq_bind()\fR with the \fItcp\fR transport, the \fIendpoint\fR shall be interpreted as an \fIinterface\fR followed by a colon and the TCP port number to use\&.
-.sp
-An \fIinterface\fR may be specified by either of the following:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The wild\-card
-*, meaning all available interfaces\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The primary IPv4 or IPv6 address assigned to the interface, in its numeric representation\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The non\-portable interface name as defined by the operating system\&.
-.RE
-.sp
-The TCP port number may be specified by:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-A numeric value, usually above 1024 on POSIX systems\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The wild\-card
-*, meaning a system\-assigned ephemeral port\&.
-.RE
-.sp
-When using ephemeral ports, the caller should retrieve the actual assigned port using the ZMQ_LAST_ENDPOINT socket option\&. See \fBzmq_getsockopt\fR(3) for details\&.
-.SS "Unbinding wild\-card addres from a socket"
-.sp
-When wild\-card * \fIendpoint\fR was used in \fIzmq_bind()\fR, the caller should use real \fIendpoind\fR obtained from the ZMQ_LAST_ENDPOINT socket option to unbind this \fIendpoint\fR from a socket using \fIzmq_unbind()\fR\&.
-.SS "Connecting a socket"
-.sp
-When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fItcp\fR transport, the \fIendpoint\fR shall be interpreted as a \fIpeer address\fR followed by a colon and the TCP port number to use\&. You can optionally specify a \fIsource_endpoint\fR which will be used as the source address for your connection; tcp://\fIsource_endpoint\fR;\*(Aqendpoint\*(Aq, see the \fIinterface\fR description above for details\&.
-.sp
-A \fIpeer address\fR may be specified by either of the following:
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The DNS name of the peer\&.
-.RE
-.sp
-.RS 4
-.ie n \{\
-\h'-04'\(bu\h'+03'\c
-.\}
-.el \{\
-.sp -1
-.IP \(bu 2.3
-.\}
-The IPv4 or IPv6 address of the peer, in its numeric representation\&.
-.RE
-.sp
-Note: A description of the ZeroMQ Message Transport Protocol (ZMTP) which is used by the TCP transport can be found at \m[blue]\fBhttp://rfc\&.zeromq\&.org/spec:15\fR\m[]
-.SH "EXAMPLES"
-.PP
-\fBAssigning a local address to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  TCP port 5555 on all available interfaces
-rc = zmq_bind(socket, "tcp://*:5555");
-assert (rc == 0);
-//  TCP port 5555 on the local loop\-back interface on all platforms
-rc = zmq_bind(socket, "tcp://127\&.0\&.0\&.1:5555");
-assert (rc == 0);
-//  TCP port 5555 on the first Ethernet network interface on Linux
-rc = zmq_bind(socket, "tcp://eth0:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBConnecting a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Connecting using an IP address
-rc = zmq_connect(socket, "tcp://192\&.168\&.1\&.1:5555");
-assert (rc == 0);
-//  Connecting using a DNS name
-rc = zmq_connect(socket, "tcp://server1:5555");
-assert (rc == 0);
-//  Connecting using a DNS name and bind to eth1
-rc = zmq_connect(socket, "tcp://eth1:0;server1:5555");
-assert (rc == 0);
-//  Connecting using a IP address and bind to an IP address
-rc = zmq_connect(socket, "tcp://192\&.168\&.1\&.17:5555;192\&.168\&.1\&.1:5555");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_pgm\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/deps/share/man/man7/zmq_tipc.7 b/ps-lite/deps/share/man/man7/zmq_tipc.7
deleted file mode 100644
index 44f6c5c5..00000000
--- a/ps-lite/deps/share/man/man7/zmq_tipc.7
+++ /dev/null
@@ -1,106 +0,0 @@
-'\" t
-.\"     Title: zmq_tipc
-.\"    Author: [see the "AUTHORS" section]
-.\" Generator: DocBook XSL Stylesheets v1.78.1 <http://docbook.sf.net/>
-.\"      Date: 12/18/2015
-.\"    Manual: 0MQ Manual
-.\"    Source: 0MQ 4.1.4
-.\"  Language: English
-.\"
-.TH "ZMQ_TIPC" "7" "12/18/2015" "0MQ 4\&.1\&.4" "0MQ Manual"
-.\" -----------------------------------------------------------------
-.\" * Define some portability stuff
-.\" -----------------------------------------------------------------
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.\" http://bugs.debian.org/507673
-.\" http://lists.gnu.org/archive/html/groff/2009-02/msg00013.html
-.\" ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
-.ie \n(.g .ds Aq \(aq
-.el       .ds Aq '
-.\" -----------------------------------------------------------------
-.\" * set default formatting
-.\" -----------------------------------------------------------------
-.\" disable hyphenation
-.nh
-.\" disable justification (adjust text to left margin only)
-.ad l
-.\" -----------------------------------------------------------------
-.\" * MAIN CONTENT STARTS HERE *
-.\" -----------------------------------------------------------------
-.SH "NAME"
-zmq_tipc \- 0MQ unicast transport using TIPC
-.SH "SYNOPSIS"
-.sp
-TIPC is a cluster IPC protocol with a location transparent addressing scheme\&.
-.SH "ADDRESSING"
-.sp
-A 0MQ endpoint is a string consisting of a \fItransport\fR:// followed by an \fIaddress\fR\&. The \fItransport\fR specifies the underlying protocol to use\&. The \fIaddress\fR specifies the transport\-specific address to connect to\&.
-.sp
-For the TIPC transport, the transport is tipc, and the meaning of the \fIaddress\fR part is defined below\&.
-.sp
-Assigning a port name to a socket
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-When assigning a port name to a socket using _zmq_bind()_ with the \*(Aqtipc\*(Aq
-transport, the \*(Aqendpoint\*(Aq is defined in the form:
-{type, lower, upper}
-
-* Type is the numerical (u32) ID of your service\&.
-* Lower and Upper specify a range for your service\&.
-
-Publishing the same service with overlapping lower/upper ID\*(Aqs will
-cause connection requests to be distributed over these in a round\-robin
-manner\&.
-
-
-Connecting a socket
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-When connecting a socket to a peer address using \fIzmq_connect()\fR with the \fItipc\fR transport, the \fIendpoint\fR shall be interpreted as a service ID, followed by a comma and the instance ID\&.
-.sp
-The instance ID must be within the lower/upper range of a published port name for the endpoint to be valid\&.
-.SH "EXAMPLES"
-.PP
-\fBAssigning a local address to a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Publish TIPC service ID 5555
-rc = zmq_bind(socket, "tipc://{5555,0,0}");
-assert (rc == 0);
-//  Publish TIPC service ID 5555 with a service range of 0\-100
-rc = zmq_bind(socket, "tipc://{5555,0,100}");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.PP
-\fBConnecting a socket\fR. 
-.sp
-.if n \{\
-.RS 4
-.\}
-.nf
-//  Connect to service 5555 instance id 50
-rc = zmq_connect(socket, "tipc://{5555,50}");
-assert (rc == 0);
-.fi
-.if n \{\
-.RE
-.\}
-.sp
-.SH "SEE ALSO"
-.sp
-\fBzmq_bind\fR(3) \fBzmq_connect\fR(3) \fBzmq_tcp\fR(7) \fBzmq_pgm\fR(7) \fBzmq_ipc\fR(7) \fBzmq_inproc\fR(7) \fBzmq\fR(7)
-.SH "AUTHORS"
-.sp
-This page was written by the 0MQ community\&. To make a change please read the 0MQ Contribution Policy at \m[blue]\fBhttp://www\&.zeromq\&.org/docs:contributing\fR\m[]\&.
diff --git a/ps-lite/docs/Doxyfile b/ps-lite/docs/Doxyfile
deleted file mode 100644
index c150c7f1..00000000
--- a/ps-lite/docs/Doxyfile
+++ /dev/null
@@ -1,2310 +0,0 @@
-# Doxyfile 1.8.7
-
-# This file describes the settings to be used by the documentation system
-# doxygen (www.doxygen.org) for a project.
-#
-# All text after a double hash (##) is considered a comment and is placed in
-# front of the TAG it is preceding.
-#
-# All text after a single hash (#) is considered a comment and will be ignored.
-# The format is:
-# TAG = value [value, ...]
-# For lists, items can also be appended using:
-# TAG += value [value, ...]
-# Values that contain spaces should be placed between quotes (\" \").
-
-#---------------------------------------------------------------------------
-# Project related configuration options
-#---------------------------------------------------------------------------
-
-# This tag specifies the encoding used for all characters in the config file
-# that follow. The default is UTF-8 which is also the encoding used for all text
-# before the first occurrence of this tag. Doxygen uses libiconv (or the iconv
-# built into libc) for the transcoding. See http://www.gnu.org/software/libiconv
-# for the list of possible encodings.
-# The default value is: UTF-8.
-
-DOXYFILE_ENCODING      = UTF-8
-
-# The PROJECT_NAME tag is a single word (or a sequence of words surrounded by
-# double-quotes, unless you are using Doxywizard) that should identify the
-# project for which the documentation is generated. This name is used in the
-# title of most generated pages and in a few other places.
-# The default value is: My Project.
-
-PROJECT_NAME           = ps-lite
-
-# The PROJECT_NUMBER tag can be used to enter a project or revision number. This
-# could be handy for archiving the generated documentation or if some version
-# control system is used.
-
-PROJECT_NUMBER         =
-
-# Using the PROJECT_BRIEF tag one can provide an optional one line description
-# for a project that appears at the top of each page and should give viewer a
-# quick idea about the purpose of the project. Keep the description short.
-
-PROJECT_BRIEF          = "Lightweight Pparameter Server"
-
-# With the PROJECT_LOGO tag one can specify an logo or icon that is included in
-# the documentation. The maximum height of the logo should not exceed 55 pixels
-# and the maximum width should not exceed 200 pixels. Doxygen will copy the logo
-# to the output directory.
-
-PROJECT_LOGO           =
-
-# The OUTPUT_DIRECTORY tag is used to specify the (relative or absolute) path
-# into which the generated documentation will be written. If a relative path is
-# entered, it will be relative to the location where doxygen was started. If
-# left blank the current directory will be used.
-
-OUTPUT_DIRECTORY       =
-
-# If the CREATE_SUBDIRS tag is set to YES, then doxygen will create 4096 sub-
-# directories (in 2 levels) under the output directory of each output format and
-# will distribute the generated files over these directories. Enabling this
-# option can be useful when feeding doxygen a huge amount of source files, where
-# putting all generated files in the same directory would otherwise causes
-# performance problems for the file system.
-# The default value is: NO.
-
-CREATE_SUBDIRS         = NO
-
-# If the ALLOW_UNICODE_NAMES tag is set to YES, doxygen will allow non-ASCII
-# characters to appear in the names of generated files. If set to NO, non-ASCII
-# characters will be escaped, for example _xE3_x81_x84 will be used for Unicode
-# U+3044.
-# The default value is: NO.
-
-ALLOW_UNICODE_NAMES    = NO
-
-# The OUTPUT_LANGUAGE tag is used to specify the language in which all
-# documentation generated by doxygen is written. Doxygen will use this
-# information to generate all constant output in the proper language.
-# Possible values are: Afrikaans, Arabic, Armenian, Brazilian, Catalan, Chinese,
-# Chinese-Traditional, Croatian, Czech, Danish, Dutch, English (United States),
-# Esperanto, Farsi (Persian), Finnish, French, German, Greek, Hungarian,
-# Indonesian, Italian, Japanese, Japanese-en (Japanese with English messages),
-# Korean, Korean-en (Korean with English messages), Latvian, Lithuanian,
-# Macedonian, Norwegian, Persian (Farsi), Polish, Portuguese, Romanian, Russian,
-# Serbian, Serbian-Cyrillic, Slovak, Slovene, Spanish, Swedish, Turkish,
-# Ukrainian and Vietnamese.
-# The default value is: English.
-
-OUTPUT_LANGUAGE        = English
-
-# If the BRIEF_MEMBER_DESC tag is set to YES doxygen will include brief member
-# descriptions after the members that are listed in the file and class
-# documentation (similar to Javadoc). Set to NO to disable this.
-# The default value is: YES.
-
-BRIEF_MEMBER_DESC      = YES
-
-# If the REPEAT_BRIEF tag is set to YES doxygen will prepend the brief
-# description of a member or function before the detailed description
-#
-# Note: If both HIDE_UNDOC_MEMBERS and BRIEF_MEMBER_DESC are set to NO, the
-# brief descriptions will be completely suppressed.
-# The default value is: YES.
-
-REPEAT_BRIEF           = YES
-
-# This tag implements a quasi-intelligent brief description abbreviator that is
-# used to form the text in various listings. Each string in this list, if found
-# as the leading text of the brief description, will be stripped from the text
-# and the result, after processing the whole list, is used as the annotated
-# text. Otherwise, the brief description is used as-is. If left blank, the
-# following values are used ($name is automatically replaced with the name of
-# the entity):The $name class, The $name widget, The $name file, is, provides,
-# specifies, contains, represents, a, an and the.
-
-ABBREVIATE_BRIEF       =
-
-# If the ALWAYS_DETAILED_SEC and REPEAT_BRIEF tags are both set to YES then
-# doxygen will generate a detailed section even if there is only a brief
-# description.
-# The default value is: NO.
-
-ALWAYS_DETAILED_SEC    = NO
-
-# If the INLINE_INHERITED_MEMB tag is set to YES, doxygen will show all
-# inherited members of a class in the documentation of that class as if those
-# members were ordinary class members. Constructors, destructors and assignment
-# operators of the base classes will not be shown.
-# The default value is: NO.
-
-INLINE_INHERITED_MEMB  = NO
-
-# If the FULL_PATH_NAMES tag is set to YES doxygen will prepend the full path
-# before files name in the file list and in the header files. If set to NO the
-# shortest path that makes the file name unique will be used
-# The default value is: YES.
-
-FULL_PATH_NAMES        = YES
-
-# The STRIP_FROM_PATH tag can be used to strip a user-defined part of the path.
-# Stripping is only done if one of the specified strings matches the left-hand
-# part of the path. The tag can be used to show relative paths in the file list.
-# If left blank the directory from which doxygen is run is used as the path to
-# strip.
-#
-# Note that you can specify absolute paths here, but also relative paths, which
-# will be relative from the directory where doxygen is started.
-# This tag requires that the tag FULL_PATH_NAMES is set to YES.
-
-STRIP_FROM_PATH        =
-
-# The STRIP_FROM_INC_PATH tag can be used to strip a user-defined part of the
-# path mentioned in the documentation of a class, which tells the reader which
-# header file to include in order to use a class. If left blank only the name of
-# the header file containing the class definition is used. Otherwise one should
-# specify the list of include paths that are normally passed to the compiler
-# using the -I flag.
-
-STRIP_FROM_INC_PATH    =
-
-# If the SHORT_NAMES tag is set to YES, doxygen will generate much shorter (but
-# less readable) file names. This can be useful is your file systems doesn't
-# support long names like on DOS, Mac, or CD-ROM.
-# The default value is: NO.
-
-SHORT_NAMES            = NO
-
-# If the JAVADOC_AUTOBRIEF tag is set to YES then doxygen will interpret the
-# first line (until the first dot) of a Javadoc-style comment as the brief
-# description. If set to NO, the Javadoc-style will behave just like regular Qt-
-# style comments (thus requiring an explicit @brief command for a brief
-# description.)
-# The default value is: NO.
-
-JAVADOC_AUTOBRIEF      = NO
-
-# If the QT_AUTOBRIEF tag is set to YES then doxygen will interpret the first
-# line (until the first dot) of a Qt-style comment as the brief description. If
-# set to NO, the Qt-style will behave just like regular Qt-style comments (thus
-# requiring an explicit \brief command for a brief description.)
-# The default value is: NO.
-
-QT_AUTOBRIEF           = NO
-
-# The MULTILINE_CPP_IS_BRIEF tag can be set to YES to make doxygen treat a
-# multi-line C++ special comment block (i.e. a block of //! or /// comments) as
-# a brief description. This used to be the default behavior. The new default is
-# to treat a multi-line C++ comment block as a detailed description. Set this
-# tag to YES if you prefer the old behavior instead.
-#
-# Note that setting this tag to YES also means that rational rose comments are
-# not recognized any more.
-# The default value is: NO.
-
-MULTILINE_CPP_IS_BRIEF = NO
-
-# If the INHERIT_DOCS tag is set to YES then an undocumented member inherits the
-# documentation from any documented member that it re-implements.
-# The default value is: YES.
-
-INHERIT_DOCS           = YES
-
-# If the SEPARATE_MEMBER_PAGES tag is set to YES, then doxygen will produce a
-# new page for each member. If set to NO, the documentation of a member will be
-# part of the file/class/namespace that contains it.
-# The default value is: NO.
-
-SEPARATE_MEMBER_PAGES  = NO
-
-# The TAB_SIZE tag can be used to set the number of spaces in a tab. Doxygen
-# uses this value to replace tabs by spaces in code fragments.
-# Minimum value: 1, maximum value: 16, default value: 4.
-
-TAB_SIZE               = 4
-
-# This tag can be used to specify a number of aliases that act as commands in
-# the documentation. An alias has the form:
-# name=value
-# For example adding
-# "sideeffect=@par Side Effects:\n"
-# will allow you to put the command \sideeffect (or @sideeffect) in the
-# documentation, which will result in a user-defined paragraph with heading
-# "Side Effects:". You can put \n's in the value part of an alias to insert
-# newlines.
-
-ALIASES                =
-
-# This tag can be used to specify a number of word-keyword mappings (TCL only).
-# A mapping has the form "name=value". For example adding "class=itcl::class"
-# will allow you to use the command class in the itcl::class meaning.
-
-TCL_SUBST              =
-
-# Set the OPTIMIZE_OUTPUT_FOR_C tag to YES if your project consists of C sources
-# only. Doxygen will then generate output that is more tailored for C. For
-# instance, some of the names that are used will be different. The list of all
-# members will be omitted, etc.
-# The default value is: NO.
-
-OPTIMIZE_OUTPUT_FOR_C  = NO
-
-# Set the OPTIMIZE_OUTPUT_JAVA tag to YES if your project consists of Java or
-# Python sources only. Doxygen will then generate output that is more tailored
-# for that language. For instance, namespaces will be presented as packages,
-# qualified scopes will look different, etc.
-# The default value is: NO.
-
-OPTIMIZE_OUTPUT_JAVA   = NO
-
-# Set the OPTIMIZE_FOR_FORTRAN tag to YES if your project consists of Fortran
-# sources. Doxygen will then generate output that is tailored for Fortran.
-# The default value is: NO.
-
-OPTIMIZE_FOR_FORTRAN   = NO
-
-# Set the OPTIMIZE_OUTPUT_VHDL tag to YES if your project consists of VHDL
-# sources. Doxygen will then generate output that is tailored for VHDL.
-# The default value is: NO.
-
-OPTIMIZE_OUTPUT_VHDL   = NO
-
-# Doxygen selects the parser to use depending on the extension of the files it
-# parses. With this tag you can assign which parser to use for a given
-# extension. Doxygen has a built-in mapping, but you can override or extend it
-# using this tag. The format is ext=language, where ext is a file extension, and
-# language is one of the parsers supported by doxygen: IDL, Java, Javascript,
-# C#, C, C++, D, PHP, Objective-C, Python, Fortran (fixed format Fortran:
-# FortranFixed, free formatted Fortran: FortranFree, unknown formatted Fortran:
-# Fortran. In the later case the parser tries to guess whether the code is fixed
-# or free formatted code, this is the default for Fortran type files), VHDL. For
-# instance to make doxygen treat .inc files as Fortran files (default is PHP),
-# and .f files as C (default is Fortran), use: inc=Fortran f=C.
-#
-# Note For files without extension you can use no_extension as a placeholder.
-#
-# Note that for custom extensions you also need to set FILE_PATTERNS otherwise
-# the files are not read by doxygen.
-
-EXTENSION_MAPPING      =
-
-# If the MARKDOWN_SUPPORT tag is enabled then doxygen pre-processes all comments
-# according to the Markdown format, which allows for more readable
-# documentation. See http://daringfireball.net/projects/markdown/ for details.
-# The output of markdown processing is further processed by doxygen, so you can
-# mix doxygen, HTML, and XML commands with Markdown formatting. Disable only in
-# case of backward compatibilities issues.
-# The default value is: YES.
-
-MARKDOWN_SUPPORT       = YES
-
-# When enabled doxygen tries to link words that correspond to documented
-# classes, or namespaces to their corresponding documentation. Such a link can
-# be prevented in individual cases by by putting a % sign in front of the word
-# or globally by setting AUTOLINK_SUPPORT to NO.
-# The default value is: YES.
-
-AUTOLINK_SUPPORT       = YES
-
-# If you use STL classes (i.e. std::string, std::vector, etc.) but do not want
-# to include (a tag file for) the STL sources as input, then you should set this
-# tag to YES in order to let doxygen match functions declarations and
-# definitions whose arguments contain STL classes (e.g. func(std::string);
-# versus func(std::string) {}). This also make the inheritance and collaboration
-# diagrams that involve STL classes more complete and accurate.
-# The default value is: NO.
-
-BUILTIN_STL_SUPPORT    = NO
-
-# If you use Microsoft's C++/CLI language, you should set this option to YES to
-# enable parsing support.
-# The default value is: NO.
-
-CPP_CLI_SUPPORT        = NO
-
-# Set the SIP_SUPPORT tag to YES if your project consists of sip (see:
-# http://www.riverbankcomputing.co.uk/software/sip/intro) sources only. Doxygen
-# will parse them like normal C++ but will assume all classes use public instead
-# of private inheritance when no explicit protection keyword is present.
-# The default value is: NO.
-
-SIP_SUPPORT            = NO
-
-# For Microsoft's IDL there are propget and propput attributes to indicate
-# getter and setter methods for a property. Setting this option to YES will make
-# doxygen to replace the get and set methods by a property in the documentation.
-# This will only work if the methods are indeed getting or setting a simple
-# type. If this is not the case, or you want to show the methods anyway, you
-# should set this option to NO.
-# The default value is: YES.
-
-IDL_PROPERTY_SUPPORT   = YES
-
-# If member grouping is used in the documentation and the DISTRIBUTE_GROUP_DOC
-# tag is set to YES, then doxygen will reuse the documentation of the first
-# member in the group (if any) for the other members of the group. By default
-# all members of a group must be documented explicitly.
-# The default value is: NO.
-
-DISTRIBUTE_GROUP_DOC   = NO
-
-# Set the SUBGROUPING tag to YES to allow class member groups of the same type
-# (for instance a group of public functions) to be put as a subgroup of that
-# type (e.g. under the Public Functions section). Set it to NO to prevent
-# subgrouping. Alternatively, this can be done per class using the
-# \nosubgrouping command.
-# The default value is: YES.
-
-SUBGROUPING            = YES
-
-# When the INLINE_GROUPED_CLASSES tag is set to YES, classes, structs and unions
-# are shown inside the group in which they are included (e.g. using \ingroup)
-# instead of on a separate page (for HTML and Man pages) or section (for LaTeX
-# and RTF).
-#
-# Note that this feature does not work in combination with
-# SEPARATE_MEMBER_PAGES.
-# The default value is: NO.
-
-INLINE_GROUPED_CLASSES = NO
-
-# When the INLINE_SIMPLE_STRUCTS tag is set to YES, structs, classes, and unions
-# with only public data fields or simple typedef fields will be shown inline in
-# the documentation of the scope in which they are defined (i.e. file,
-# namespace, or group documentation), provided this scope is documented. If set
-# to NO, structs, classes, and unions are shown on a separate page (for HTML and
-# Man pages) or section (for LaTeX and RTF).
-# The default value is: NO.
-
-INLINE_SIMPLE_STRUCTS  = NO
-
-# When TYPEDEF_HIDES_STRUCT tag is enabled, a typedef of a struct, union, or
-# enum is documented as struct, union, or enum with the name of the typedef. So
-# typedef struct TypeS {} TypeT, will appear in the documentation as a struct
-# with name TypeT. When disabled the typedef will appear as a member of a file,
-# namespace, or class. And the struct will be named TypeS. This can typically be
-# useful for C code in case the coding convention dictates that all compound
-# types are typedef'ed and only the typedef is referenced, never the tag name.
-# The default value is: NO.
-
-TYPEDEF_HIDES_STRUCT   = NO
-
-# The size of the symbol lookup cache can be set using LOOKUP_CACHE_SIZE. This
-# cache is used to resolve symbols given their name and scope. Since this can be
-# an expensive process and often the same symbol appears multiple times in the
-# code, doxygen keeps a cache of pre-resolved symbols. If the cache is too small
-# doxygen will become slower. If the cache is too large, memory is wasted. The
-# cache size is given by this formula: 2^(16+LOOKUP_CACHE_SIZE). The valid range
-# is 0..9, the default is 0, corresponding to a cache size of 2^16=65536
-# symbols. At the end of a run doxygen will report the cache usage and suggest
-# the optimal cache size from a speed point of view.
-# Minimum value: 0, maximum value: 9, default value: 0.
-
-LOOKUP_CACHE_SIZE      = 0
-
-#---------------------------------------------------------------------------
-# Build related configuration options
-#---------------------------------------------------------------------------
-
-# If the EXTRACT_ALL tag is set to YES doxygen will assume all entities in
-# documentation are documented, even if no documentation was available. Private
-# class members and static file members will be hidden unless the
-# EXTRACT_PRIVATE respectively EXTRACT_STATIC tags are set to YES.
-# Note: This will also disable the warnings about undocumented members that are
-# normally produced when WARNINGS is set to YES.
-# The default value is: NO.
-
-EXTRACT_ALL            = NO
-
-# If the EXTRACT_PRIVATE tag is set to YES all private members of a class will
-# be included in the documentation.
-# The default value is: NO.
-
-EXTRACT_PRIVATE        = NO
-
-# If the EXTRACT_PACKAGE tag is set to YES all members with package or internal
-# scope will be included in the documentation.
-# The default value is: NO.
-
-EXTRACT_PACKAGE        = NO
-
-# If the EXTRACT_STATIC tag is set to YES all static members of a file will be
-# included in the documentation.
-# The default value is: NO.
-
-EXTRACT_STATIC         = NO
-
-# If the EXTRACT_LOCAL_CLASSES tag is set to YES classes (and structs) defined
-# locally in source files will be included in the documentation. If set to NO
-# only classes defined in header files are included. Does not have any effect
-# for Java sources.
-# The default value is: YES.
-
-EXTRACT_LOCAL_CLASSES  = YES
-
-# This flag is only useful for Objective-C code. When set to YES local methods,
-# which are defined in the implementation section but not in the interface are
-# included in the documentation. If set to NO only methods in the interface are
-# included.
-# The default value is: NO.
-
-EXTRACT_LOCAL_METHODS  = NO
-
-# If this flag is set to YES, the members of anonymous namespaces will be
-# extracted and appear in the documentation as a namespace called
-# 'anonymous_namespace{file}', where file will be replaced with the base name of
-# the file that contains the anonymous namespace. By default anonymous namespace
-# are hidden.
-# The default value is: NO.
-
-EXTRACT_ANON_NSPACES   = NO
-
-# If the HIDE_UNDOC_MEMBERS tag is set to YES, doxygen will hide all
-# undocumented members inside documented classes or files. If set to NO these
-# members will be included in the various overviews, but no documentation
-# section is generated. This option has no effect if EXTRACT_ALL is enabled.
-# The default value is: NO.
-
-HIDE_UNDOC_MEMBERS     = NO
-
-# If the HIDE_UNDOC_CLASSES tag is set to YES, doxygen will hide all
-# undocumented classes that are normally visible in the class hierarchy. If set
-# to NO these classes will be included in the various overviews. This option has
-# no effect if EXTRACT_ALL is enabled.
-# The default value is: NO.
-
-HIDE_UNDOC_CLASSES     = NO
-
-# If the HIDE_FRIEND_COMPOUNDS tag is set to YES, doxygen will hide all friend
-# (class|struct|union) declarations. If set to NO these declarations will be
-# included in the documentation.
-# The default value is: NO.
-
-HIDE_FRIEND_COMPOUNDS  = NO
-
-# If the HIDE_IN_BODY_DOCS tag is set to YES, doxygen will hide any
-# documentation blocks found inside the body of a function. If set to NO these
-# blocks will be appended to the function's detailed documentation block.
-# The default value is: NO.
-
-HIDE_IN_BODY_DOCS      = NO
-
-# The INTERNAL_DOCS tag determines if documentation that is typed after a
-# \internal command is included. If the tag is set to NO then the documentation
-# will be excluded. Set it to YES to include the internal documentation.
-# The default value is: NO.
-
-INTERNAL_DOCS          = NO
-
-# If the CASE_SENSE_NAMES tag is set to NO then doxygen will only generate file
-# names in lower-case letters. If set to YES upper-case letters are also
-# allowed. This is useful if you have classes or files whose names only differ
-# in case and if your file system supports case sensitive file names. Windows
-# and Mac users are advised to set this option to NO.
-# The default value is: system dependent.
-
-CASE_SENSE_NAMES       = NO
-
-# If the HIDE_SCOPE_NAMES tag is set to NO then doxygen will show members with
-# their full class and namespace scopes in the documentation. If set to YES the
-# scope will be hidden.
-# The default value is: NO.
-
-HIDE_SCOPE_NAMES       = NO
-
-# If the SHOW_INCLUDE_FILES tag is set to YES then doxygen will put a list of
-# the files that are included by a file in the documentation of that file.
-# The default value is: YES.
-
-SHOW_INCLUDE_FILES     = YES
-
-# If the SHOW_GROUPED_MEMB_INC tag is set to YES then Doxygen will add for each
-# grouped member an include statement to the documentation, telling the reader
-# which file to include in order to use the member.
-# The default value is: NO.
-
-SHOW_GROUPED_MEMB_INC  = NO
-
-# If the FORCE_LOCAL_INCLUDES tag is set to YES then doxygen will list include
-# files with double quotes in the documentation rather than with sharp brackets.
-# The default value is: NO.
-
-FORCE_LOCAL_INCLUDES   = NO
-
-# If the INLINE_INFO tag is set to YES then a tag [inline] is inserted in the
-# documentation for inline members.
-# The default value is: YES.
-
-INLINE_INFO            = YES
-
-# If the SORT_MEMBER_DOCS tag is set to YES then doxygen will sort the
-# (detailed) documentation of file and class members alphabetically by member
-# name. If set to NO the members will appear in declaration order.
-# The default value is: YES.
-
-SORT_MEMBER_DOCS       = YES
-
-# If the SORT_BRIEF_DOCS tag is set to YES then doxygen will sort the brief
-# descriptions of file, namespace and class members alphabetically by member
-# name. If set to NO the members will appear in declaration order. Note that
-# this will also influence the order of the classes in the class list.
-# The default value is: NO.
-
-SORT_BRIEF_DOCS        = NO
-
-# If the SORT_MEMBERS_CTORS_1ST tag is set to YES then doxygen will sort the
-# (brief and detailed) documentation of class members so that constructors and
-# destructors are listed first. If set to NO the constructors will appear in the
-# respective orders defined by SORT_BRIEF_DOCS and SORT_MEMBER_DOCS.
-# Note: If SORT_BRIEF_DOCS is set to NO this option is ignored for sorting brief
-# member documentation.
-# Note: If SORT_MEMBER_DOCS is set to NO this option is ignored for sorting
-# detailed member documentation.
-# The default value is: NO.
-
-SORT_MEMBERS_CTORS_1ST = NO
-
-# If the SORT_GROUP_NAMES tag is set to YES then doxygen will sort the hierarchy
-# of group names into alphabetical order. If set to NO the group names will
-# appear in their defined order.
-# The default value is: NO.
-
-SORT_GROUP_NAMES       = NO
-
-# If the SORT_BY_SCOPE_NAME tag is set to YES, the class list will be sorted by
-# fully-qualified names, including namespaces. If set to NO, the class list will
-# be sorted only by class name, not including the namespace part.
-# Note: This option is not very useful if HIDE_SCOPE_NAMES is set to YES.
-# Note: This option applies only to the class list, not to the alphabetical
-# list.
-# The default value is: NO.
-
-SORT_BY_SCOPE_NAME     = NO
-
-# If the STRICT_PROTO_MATCHING option is enabled and doxygen fails to do proper
-# type resolution of all parameters of a function it will reject a match between
-# the prototype and the implementation of a member function even if there is
-# only one candidate or it is obvious which candidate to choose by doing a
-# simple string match. By disabling STRICT_PROTO_MATCHING doxygen will still
-# accept a match between prototype and implementation in such cases.
-# The default value is: NO.
-
-STRICT_PROTO_MATCHING  = NO
-
-# The GENERATE_TODOLIST tag can be used to enable ( YES) or disable ( NO) the
-# todo list. This list is created by putting \todo commands in the
-# documentation.
-# The default value is: YES.
-
-GENERATE_TODOLIST      = YES
-
-# The GENERATE_TESTLIST tag can be used to enable ( YES) or disable ( NO) the
-# test list. This list is created by putting \test commands in the
-# documentation.
-# The default value is: YES.
-
-GENERATE_TESTLIST      = YES
-
-# The GENERATE_BUGLIST tag can be used to enable ( YES) or disable ( NO) the bug
-# list. This list is created by putting \bug commands in the documentation.
-# The default value is: YES.
-
-GENERATE_BUGLIST       = YES
-
-# The GENERATE_DEPRECATEDLIST tag can be used to enable ( YES) or disable ( NO)
-# the deprecated list. This list is created by putting \deprecated commands in
-# the documentation.
-# The default value is: YES.
-
-GENERATE_DEPRECATEDLIST= YES
-
-# The ENABLED_SECTIONS tag can be used to enable conditional documentation
-# sections, marked by \if <section_label> ... \endif and \cond <section_label>
-# ... \endcond blocks.
-
-ENABLED_SECTIONS       =
-
-# The MAX_INITIALIZER_LINES tag determines the maximum number of lines that the
-# initial value of a variable or macro / define can have for it to appear in the
-# documentation. If the initializer consists of more lines than specified here
-# it will be hidden. Use a value of 0 to hide initializers completely. The
-# appearance of the value of individual variables and macros / defines can be
-# controlled using \showinitializer or \hideinitializer command in the
-# documentation regardless of this setting.
-# Minimum value: 0, maximum value: 10000, default value: 30.
-
-MAX_INITIALIZER_LINES  = 30
-
-# Set the SHOW_USED_FILES tag to NO to disable the list of files generated at
-# the bottom of the documentation of classes and structs. If set to YES the list
-# will mention the files that were used to generate the documentation.
-# The default value is: YES.
-
-SHOW_USED_FILES        = YES
-
-# Set the SHOW_FILES tag to NO to disable the generation of the Files page. This
-# will remove the Files entry from the Quick Index and from the Folder Tree View
-# (if specified).
-# The default value is: YES.
-
-SHOW_FILES             = YES
-
-# Set the SHOW_NAMESPACES tag to NO to disable the generation of the Namespaces
-# page. This will remove the Namespaces entry from the Quick Index and from the
-# Folder Tree View (if specified).
-# The default value is: YES.
-
-SHOW_NAMESPACES        = YES
-
-# The FILE_VERSION_FILTER tag can be used to specify a program or script that
-# doxygen should invoke to get the current version for each file (typically from
-# the version control system). Doxygen will invoke the program by executing (via
-# popen()) the command command input-file, where command is the value of the
-# FILE_VERSION_FILTER tag, and input-file is the name of an input file provided
-# by doxygen. Whatever the program writes to standard output is used as the file
-# version. For an example see the documentation.
-
-FILE_VERSION_FILTER    =
-
-# The LAYOUT_FILE tag can be used to specify a layout file which will be parsed
-# by doxygen. The layout file controls the global structure of the generated
-# output files in an output format independent way. To create the layout file
-# that represents doxygen's defaults, run doxygen with the -l option. You can
-# optionally specify a file name after the option, if omitted DoxygenLayout.xml
-# will be used as the name of the layout file.
-#
-# Note that if you run doxygen from a directory containing a file called
-# DoxygenLayout.xml, doxygen will parse it automatically even if the LAYOUT_FILE
-# tag is left empty.
-
-LAYOUT_FILE            =
-
-# The CITE_BIB_FILES tag can be used to specify one or more bib files containing
-# the reference definitions. This must be a list of .bib files. The .bib
-# extension is automatically appended if omitted. This requires the bibtex tool
-# to be installed. See also http://en.wikipedia.org/wiki/BibTeX for more info.
-# For LaTeX the style of the bibliography can be controlled using
-# LATEX_BIB_STYLE. To use this feature you need bibtex and perl available in the
-# search path. Do not use file names with spaces, bibtex cannot handle them. See
-# also \cite for info how to create references.
-
-CITE_BIB_FILES         =
-
-#---------------------------------------------------------------------------
-# Configuration options related to warning and progress messages
-#---------------------------------------------------------------------------
-
-# The QUIET tag can be used to turn on/off the messages that are generated to
-# standard output by doxygen. If QUIET is set to YES this implies that the
-# messages are off.
-# The default value is: NO.
-
-QUIET                  = NO
-
-# The WARNINGS tag can be used to turn on/off the warning messages that are
-# generated to standard error ( stderr) by doxygen. If WARNINGS is set to YES
-# this implies that the warnings are on.
-#
-# Tip: Turn warnings on while writing the documentation.
-# The default value is: YES.
-
-WARNINGS               = YES
-
-# If the WARN_IF_UNDOCUMENTED tag is set to YES, then doxygen will generate
-# warnings for undocumented members. If EXTRACT_ALL is set to YES then this flag
-# will automatically be disabled.
-# The default value is: YES.
-
-WARN_IF_UNDOCUMENTED   = YES
-
-# If the WARN_IF_DOC_ERROR tag is set to YES, doxygen will generate warnings for
-# potential errors in the documentation, such as not documenting some parameters
-# in a documented function, or documenting parameters that don't exist or using
-# markup commands wrongly.
-# The default value is: YES.
-
-WARN_IF_DOC_ERROR      = YES
-
-# This WARN_NO_PARAMDOC option can be enabled to get warnings for functions that
-# are documented, but have no documentation for their parameters or return
-# value. If set to NO doxygen will only warn about wrong or incomplete parameter
-# documentation, but not about the absence of documentation.
-# The default value is: NO.
-
-WARN_NO_PARAMDOC       = NO
-
-# The WARN_FORMAT tag determines the format of the warning messages that doxygen
-# can produce. The string should contain the $file, $line, and $text tags, which
-# will be replaced by the file and line number from which the warning originated
-# and the warning text. Optionally the format may contain $version, which will
-# be replaced by the version of the file (if it could be obtained via
-# FILE_VERSION_FILTER)
-# The default value is: $file:$line: $text.
-
-WARN_FORMAT            = "$file:$line: $text"
-
-# The WARN_LOGFILE tag can be used to specify a file to which warning and error
-# messages should be written. If left blank the output is written to standard
-# error (stderr).
-
-WARN_LOGFILE           =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the input files
-#---------------------------------------------------------------------------
-
-# The INPUT tag is used to specify the files and/or directories that contain
-# documented source files. You may enter file names like myfile.cpp or
-# directories like /usr/src/myproject. Separate the files or directories with
-# spaces.
-# Note: If this tag is empty the current directory is searched.
-
-INPUT                  = ../include/ps ../include/ps/internal
-
-# This tag can be used to specify the character encoding of the source files
-# that doxygen parses. Internally doxygen uses the UTF-8 encoding. Doxygen uses
-# libiconv (or the iconv built into libc) for the transcoding. See the libiconv
-# documentation (see: http://www.gnu.org/software/libiconv) for the list of
-# possible encodings.
-# The default value is: UTF-8.
-
-INPUT_ENCODING         = UTF-8
-
-# If the value of the INPUT tag contains directories, you can use the
-# FILE_PATTERNS tag to specify one or more wildcard patterns (like *.cpp and
-# *.h) to filter out the source-files in the directories. If left blank the
-# following patterns are tested:*.c, *.cc, *.cxx, *.cpp, *.c++, *.java, *.ii,
-# *.ixx, *.ipp, *.i++, *.inl, *.idl, *.ddl, *.odl, *.h, *.hh, *.hxx, *.hpp,
-# *.h++, *.cs, *.d, *.php, *.php4, *.php5, *.phtml, *.inc, *.m, *.markdown,
-# *.md, *.mm, *.dox, *.py, *.f90, *.f, *.for, *.tcl, *.vhd, *.vhdl, *.ucf,
-# *.qsf, *.as and *.js.
-
-FILE_PATTERNS          = *.h *.md
-
-# The RECURSIVE tag can be used to specify whether or not subdirectories should
-# be searched for input files as well.
-# The default value is: NO.
-
-RECURSIVE              = NO
-
-# The EXCLUDE tag can be used to specify files and/or directories that should be
-# excluded from the INPUT source files. This way you can easily exclude a
-# subdirectory from a directory tree whose root is specified with the INPUT tag.
-#
-# Note that relative paths are relative to the directory from which doxygen is
-# run.
-
-EXCLUDE                =
-
-# The EXCLUDE_SYMLINKS tag can be used to select whether or not files or
-# directories that are symbolic links (a Unix file system feature) are excluded
-# from the input.
-# The default value is: NO.
-
-EXCLUDE_SYMLINKS       = NO
-
-# If the value of the INPUT tag contains directories, you can use the
-# EXCLUDE_PATTERNS tag to specify one or more wildcard patterns to exclude
-# certain files from those directories.
-#
-# Note that the wildcards are matched against the file with absolute path, so to
-# exclude all test directories for example use the pattern */test/*
-
-EXCLUDE_PATTERNS       =
-
-# The EXCLUDE_SYMBOLS tag can be used to specify one or more symbol names
-# (namespaces, classes, functions, etc.) that should be excluded from the
-# output. The symbol name can be a fully qualified name, a word, or if the
-# wildcard * is used, a substring. Examples: ANamespace, AClass,
-# AClass::ANamespace, ANamespace::*Test
-#
-# Note that the wildcards are matched against the file with absolute path, so to
-# exclude all test directories use the pattern */test/*
-
-EXCLUDE_SYMBOLS        =
-
-# The EXAMPLE_PATH tag can be used to specify one or more files or directories
-# that contain example code fragments that are included (see the \include
-# command).
-
-EXAMPLE_PATH           =
-
-# If the value of the EXAMPLE_PATH tag contains directories, you can use the
-# EXAMPLE_PATTERNS tag to specify one or more wildcard pattern (like *.cpp and
-# *.h) to filter out the source-files in the directories. If left blank all
-# files are included.
-
-EXAMPLE_PATTERNS       =
-
-# If the EXAMPLE_RECURSIVE tag is set to YES then subdirectories will be
-# searched for input files to be used with the \include or \dontinclude commands
-# irrespective of the value of the RECURSIVE tag.
-# The default value is: NO.
-
-EXAMPLE_RECURSIVE      = NO
-
-# The IMAGE_PATH tag can be used to specify one or more files or directories
-# that contain images that are to be included in the documentation (see the
-# \image command).
-
-IMAGE_PATH             =
-
-# The INPUT_FILTER tag can be used to specify a program that doxygen should
-# invoke to filter for each input file. Doxygen will invoke the filter program
-# by executing (via popen()) the command:
-#
-# <filter> <input-file>
-#
-# where <filter> is the value of the INPUT_FILTER tag, and <input-file> is the
-# name of an input file. Doxygen will then use the output that the filter
-# program writes to standard output. If FILTER_PATTERNS is specified, this tag
-# will be ignored.
-#
-# Note that the filter must not add or remove lines; it is applied before the
-# code is scanned, but not when the output code is generated. If lines are added
-# or removed, the anchors will not be placed correctly.
-
-INPUT_FILTER           =
-
-# The FILTER_PATTERNS tag can be used to specify filters on a per file pattern
-# basis. Doxygen will compare the file name with each pattern and apply the
-# filter if there is a match. The filters are a list of the form: pattern=filter
-# (like *.cpp=my_cpp_filter). See INPUT_FILTER for further information on how
-# filters are used. If the FILTER_PATTERNS tag is empty or if none of the
-# patterns match the file name, INPUT_FILTER is applied.
-
-FILTER_PATTERNS        =
-
-# If the FILTER_SOURCE_FILES tag is set to YES, the input filter (if set using
-# INPUT_FILTER ) will also be used to filter the input files that are used for
-# producing the source files to browse (i.e. when SOURCE_BROWSER is set to YES).
-# The default value is: NO.
-
-FILTER_SOURCE_FILES    = NO
-
-# The FILTER_SOURCE_PATTERNS tag can be used to specify source filters per file
-# pattern. A pattern will override the setting for FILTER_PATTERN (if any) and
-# it is also possible to disable source filtering for a specific pattern using
-# *.ext= (so without naming a filter).
-# This tag requires that the tag FILTER_SOURCE_FILES is set to YES.
-
-FILTER_SOURCE_PATTERNS =
-
-# If the USE_MDFILE_AS_MAINPAGE tag refers to the name of a markdown file that
-# is part of the input, its contents will be placed on the main page
-# (index.html). This can be useful if you have a project on for instance GitHub
-# and want to reuse the introduction page also for the doxygen output.
-
-USE_MDFILE_AS_MAINPAGE =
-
-#---------------------------------------------------------------------------
-# Configuration options related to source browsing
-#---------------------------------------------------------------------------
-
-# If the SOURCE_BROWSER tag is set to YES then a list of source files will be
-# generated. Documented entities will be cross-referenced with these sources.
-#
-# Note: To get rid of all source code in the generated output, make sure that
-# also VERBATIM_HEADERS is set to NO.
-# The default value is: NO.
-
-SOURCE_BROWSER         = YES
-
-# Setting the INLINE_SOURCES tag to YES will include the body of functions,
-# classes and enums directly into the documentation.
-# The default value is: NO.
-
-INLINE_SOURCES         = NO
-
-# Setting the STRIP_CODE_COMMENTS tag to YES will instruct doxygen to hide any
-# special comment blocks from generated source code fragments. Normal C, C++ and
-# Fortran comments will always remain visible.
-# The default value is: YES.
-
-STRIP_CODE_COMMENTS    = YES
-
-# If the REFERENCED_BY_RELATION tag is set to YES then for each documented
-# function all documented functions referencing it will be listed.
-# The default value is: NO.
-
-REFERENCED_BY_RELATION = NO
-
-# If the REFERENCES_RELATION tag is set to YES then for each documented function
-# all documented entities called/used by that function will be listed.
-# The default value is: NO.
-
-REFERENCES_RELATION    = NO
-
-# If the REFERENCES_LINK_SOURCE tag is set to YES and SOURCE_BROWSER tag is set
-# to YES, then the hyperlinks from functions in REFERENCES_RELATION and
-# REFERENCED_BY_RELATION lists will link to the source code. Otherwise they will
-# link to the documentation.
-# The default value is: YES.
-
-REFERENCES_LINK_SOURCE = YES
-
-# If SOURCE_TOOLTIPS is enabled (the default) then hovering a hyperlink in the
-# source code will show a tooltip with additional information such as prototype,
-# brief description and links to the definition and documentation. Since this
-# will make the HTML file larger and loading of large files a bit slower, you
-# can opt to disable this feature.
-# The default value is: YES.
-# This tag requires that the tag SOURCE_BROWSER is set to YES.
-
-SOURCE_TOOLTIPS        = YES
-
-# If the USE_HTAGS tag is set to YES then the references to source code will
-# point to the HTML generated by the htags(1) tool instead of doxygen built-in
-# source browser. The htags tool is part of GNU's global source tagging system
-# (see http://www.gnu.org/software/global/global.html). You will need version
-# 4.8.6 or higher.
-#
-# To use it do the following:
-# - Install the latest version of global
-# - Enable SOURCE_BROWSER and USE_HTAGS in the config file
-# - Make sure the INPUT points to the root of the source tree
-# - Run doxygen as normal
-#
-# Doxygen will invoke htags (and that will in turn invoke gtags), so these
-# tools must be available from the command line (i.e. in the search path).
-#
-# The result: instead of the source browser generated by doxygen, the links to
-# source code will now point to the output of htags.
-# The default value is: NO.
-# This tag requires that the tag SOURCE_BROWSER is set to YES.
-
-USE_HTAGS              = NO
-
-# If the VERBATIM_HEADERS tag is set the YES then doxygen will generate a
-# verbatim copy of the header file for each class for which an include is
-# specified. Set to NO to disable this.
-# See also: Section \class.
-# The default value is: YES.
-
-VERBATIM_HEADERS       = YES
-
-#---------------------------------------------------------------------------
-# Configuration options related to the alphabetical class index
-#---------------------------------------------------------------------------
-
-# If the ALPHABETICAL_INDEX tag is set to YES, an alphabetical index of all
-# compounds will be generated. Enable this if the project contains a lot of
-# classes, structs, unions or interfaces.
-# The default value is: YES.
-
-ALPHABETICAL_INDEX     = YES
-
-# The COLS_IN_ALPHA_INDEX tag can be used to specify the number of columns in
-# which the alphabetical index list will be split.
-# Minimum value: 1, maximum value: 20, default value: 5.
-# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
-
-COLS_IN_ALPHA_INDEX    = 5
-
-# In case all classes in a project start with a common prefix, all classes will
-# be put under the same header in the alphabetical index. The IGNORE_PREFIX tag
-# can be used to specify a prefix (or a list of prefixes) that should be ignored
-# while generating the index headers.
-# This tag requires that the tag ALPHABETICAL_INDEX is set to YES.
-
-IGNORE_PREFIX          =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the HTML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_HTML tag is set to YES doxygen will generate HTML output
-# The default value is: YES.
-
-GENERATE_HTML          = NO
-
-# The HTML_OUTPUT tag is used to specify where the HTML docs will be put. If a
-# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
-# it.
-# The default directory is: html.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_OUTPUT            = html
-
-# The HTML_FILE_EXTENSION tag can be used to specify the file extension for each
-# generated HTML page (for example: .htm, .php, .asp).
-# The default value is: .html.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_FILE_EXTENSION    = .html
-
-# The HTML_HEADER tag can be used to specify a user-defined HTML header file for
-# each generated HTML page. If the tag is left blank doxygen will generate a
-# standard header.
-#
-# To get valid HTML the header file that includes any scripts and style sheets
-# that doxygen needs, which is dependent on the configuration options used (e.g.
-# the setting GENERATE_TREEVIEW). It is highly recommended to start with a
-# default header using
-# doxygen -w html new_header.html new_footer.html new_stylesheet.css
-# YourConfigFile
-# and then modify the file new_header.html. See also section "Doxygen usage"
-# for information on how to generate the default header that doxygen normally
-# uses.
-# Note: The header is subject to change so you typically have to regenerate the
-# default header when upgrading to a newer version of doxygen. For a description
-# of the possible markers and block names see the documentation.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_HEADER            =
-
-# The HTML_FOOTER tag can be used to specify a user-defined HTML footer for each
-# generated HTML page. If the tag is left blank doxygen will generate a standard
-# footer. See HTML_HEADER for more information on how to generate a default
-# footer and what special commands can be used inside the footer. See also
-# section "Doxygen usage" for information on how to generate the default footer
-# that doxygen normally uses.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_FOOTER            =
-
-# The HTML_STYLESHEET tag can be used to specify a user-defined cascading style
-# sheet that is used by each HTML page. It can be used to fine-tune the look of
-# the HTML output. If left blank doxygen will generate a default style sheet.
-# See also section "Doxygen usage" for information on how to generate the style
-# sheet that doxygen normally uses.
-# Note: It is recommended to use HTML_EXTRA_STYLESHEET instead of this tag, as
-# it is more robust and this tag (HTML_STYLESHEET) will in the future become
-# obsolete.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_STYLESHEET        =
-
-# The HTML_EXTRA_STYLESHEET tag can be used to specify an additional user-
-# defined cascading style sheet that is included after the standard style sheets
-# created by doxygen. Using this option one can overrule certain style aspects.
-# This is preferred over using HTML_STYLESHEET since it does not replace the
-# standard style sheet and is therefor more robust against future updates.
-# Doxygen will copy the style sheet file to the output directory. For an example
-# see the documentation.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_EXTRA_STYLESHEET  =
-
-# The HTML_EXTRA_FILES tag can be used to specify one or more extra images or
-# other source files which should be copied to the HTML output directory. Note
-# that these files will be copied to the base HTML output directory. Use the
-# $relpath^ marker in the HTML_HEADER and/or HTML_FOOTER files to load these
-# files. In the HTML_STYLESHEET file, use the file name only. Also note that the
-# files will be copied as-is; there are no commands or markers available.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_EXTRA_FILES       =
-
-# The HTML_COLORSTYLE_HUE tag controls the color of the HTML output. Doxygen
-# will adjust the colors in the stylesheet and background images according to
-# this color. Hue is specified as an angle on a colorwheel, see
-# http://en.wikipedia.org/wiki/Hue for more information. For instance the value
-# 0 represents red, 60 is yellow, 120 is green, 180 is cyan, 240 is blue, 300
-# purple, and 360 is red again.
-# Minimum value: 0, maximum value: 359, default value: 220.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_COLORSTYLE_HUE    = 220
-
-# The HTML_COLORSTYLE_SAT tag controls the purity (or saturation) of the colors
-# in the HTML output. For a value of 0 the output will use grayscales only. A
-# value of 255 will produce the most vivid colors.
-# Minimum value: 0, maximum value: 255, default value: 100.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_COLORSTYLE_SAT    = 100
-
-# The HTML_COLORSTYLE_GAMMA tag controls the gamma correction applied to the
-# luminance component of the colors in the HTML output. Values below 100
-# gradually make the output lighter, whereas values above 100 make the output
-# darker. The value divided by 100 is the actual gamma applied, so 80 represents
-# a gamma of 0.8, The value 220 represents a gamma of 2.2, and 100 does not
-# change the gamma.
-# Minimum value: 40, maximum value: 240, default value: 80.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_COLORSTYLE_GAMMA  = 80
-
-# If the HTML_TIMESTAMP tag is set to YES then the footer of each generated HTML
-# page will contain the date and time when the page was generated. Setting this
-# to NO can help when comparing the output of multiple runs.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_TIMESTAMP         = YES
-
-# If the HTML_DYNAMIC_SECTIONS tag is set to YES then the generated HTML
-# documentation will contain sections that can be hidden and shown after the
-# page has loaded.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_DYNAMIC_SECTIONS  = NO
-
-# With HTML_INDEX_NUM_ENTRIES one can control the preferred number of entries
-# shown in the various tree structured indices initially; the user can expand
-# and collapse entries dynamically later on. Doxygen will expand the tree to
-# such a level that at most the specified number of entries are visible (unless
-# a fully collapsed tree already exceeds this amount). So setting the number of
-# entries 1 will produce a full collapsed tree by default. 0 is a special value
-# representing an infinite number of entries and will result in a full expanded
-# tree by default.
-# Minimum value: 0, maximum value: 9999, default value: 100.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-HTML_INDEX_NUM_ENTRIES = 100
-
-# If the GENERATE_DOCSET tag is set to YES, additional index files will be
-# generated that can be used as input for Apple's Xcode 3 integrated development
-# environment (see: http://developer.apple.com/tools/xcode/), introduced with
-# OSX 10.5 (Leopard). To create a documentation set, doxygen will generate a
-# Makefile in the HTML output directory. Running make will produce the docset in
-# that directory and running make install will install the docset in
-# ~/Library/Developer/Shared/Documentation/DocSets so that Xcode will find it at
-# startup. See http://developer.apple.com/tools/creatingdocsetswithdoxygen.html
-# for more information.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-GENERATE_DOCSET        = NO
-
-# This tag determines the name of the docset feed. A documentation feed provides
-# an umbrella under which multiple documentation sets from a single provider
-# (such as a company or product suite) can be grouped.
-# The default value is: Doxygen generated docs.
-# This tag requires that the tag GENERATE_DOCSET is set to YES.
-
-DOCSET_FEEDNAME        = "Doxygen generated docs"
-
-# This tag specifies a string that should uniquely identify the documentation
-# set bundle. This should be a reverse domain-name style string, e.g.
-# com.mycompany.MyDocSet. Doxygen will append .docset to the name.
-# The default value is: org.doxygen.Project.
-# This tag requires that the tag GENERATE_DOCSET is set to YES.
-
-DOCSET_BUNDLE_ID       = org.doxygen.Project
-
-# The DOCSET_PUBLISHER_ID tag specifies a string that should uniquely identify
-# the documentation publisher. This should be a reverse domain-name style
-# string, e.g. com.mycompany.MyDocSet.documentation.
-# The default value is: org.doxygen.Publisher.
-# This tag requires that the tag GENERATE_DOCSET is set to YES.
-
-DOCSET_PUBLISHER_ID    = org.doxygen.Publisher
-
-# The DOCSET_PUBLISHER_NAME tag identifies the documentation publisher.
-# The default value is: Publisher.
-# This tag requires that the tag GENERATE_DOCSET is set to YES.
-
-DOCSET_PUBLISHER_NAME  = Publisher
-
-# If the GENERATE_HTMLHELP tag is set to YES then doxygen generates three
-# additional HTML index files: index.hhp, index.hhc, and index.hhk. The
-# index.hhp is a project file that can be read by Microsoft's HTML Help Workshop
-# (see: http://www.microsoft.com/en-us/download/details.aspx?id=21138) on
-# Windows.
-#
-# The HTML Help Workshop contains a compiler that can convert all HTML output
-# generated by doxygen into a single compiled HTML file (.chm). Compiled HTML
-# files are now used as the Windows 98 help format, and will replace the old
-# Windows help format (.hlp) on all Windows platforms in the future. Compressed
-# HTML files also contain an index, a table of contents, and you can search for
-# words in the documentation. The HTML workshop also contains a viewer for
-# compressed HTML files.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-GENERATE_HTMLHELP      = NO
-
-# The CHM_FILE tag can be used to specify the file name of the resulting .chm
-# file. You can add a path in front of the file if the result should not be
-# written to the html output directory.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-CHM_FILE               =
-
-# The HHC_LOCATION tag can be used to specify the location (absolute path
-# including file name) of the HTML help compiler ( hhc.exe). If non-empty
-# doxygen will try to run the HTML help compiler on the generated index.hhp.
-# The file has to be specified with full path.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-HHC_LOCATION           =
-
-# The GENERATE_CHI flag controls if a separate .chi index file is generated (
-# YES) or that it should be included in the master .chm file ( NO).
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-GENERATE_CHI           = NO
-
-# The CHM_INDEX_ENCODING is used to encode HtmlHelp index ( hhk), content ( hhc)
-# and project file content.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-CHM_INDEX_ENCODING     =
-
-# The BINARY_TOC flag controls whether a binary table of contents is generated (
-# YES) or a normal table of contents ( NO) in the .chm file. Furthermore it
-# enables the Previous and Next buttons.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-BINARY_TOC             = NO
-
-# The TOC_EXPAND flag can be set to YES to add extra items for group members to
-# the table of contents of the HTML help documentation and to the tree view.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTMLHELP is set to YES.
-
-TOC_EXPAND             = NO
-
-# If the GENERATE_QHP tag is set to YES and both QHP_NAMESPACE and
-# QHP_VIRTUAL_FOLDER are set, an additional index file will be generated that
-# can be used as input for Qt's qhelpgenerator to generate a Qt Compressed Help
-# (.qch) of the generated HTML documentation.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-GENERATE_QHP           = NO
-
-# If the QHG_LOCATION tag is specified, the QCH_FILE tag can be used to specify
-# the file name of the resulting .qch file. The path specified is relative to
-# the HTML output folder.
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QCH_FILE               =
-
-# The QHP_NAMESPACE tag specifies the namespace to use when generating Qt Help
-# Project output. For more information please see Qt Help Project / Namespace
-# (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#namespace).
-# The default value is: org.doxygen.Project.
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHP_NAMESPACE          = org.doxygen.Project
-
-# The QHP_VIRTUAL_FOLDER tag specifies the namespace to use when generating Qt
-# Help Project output. For more information please see Qt Help Project / Virtual
-# Folders (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#virtual-
-# folders).
-# The default value is: doc.
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHP_VIRTUAL_FOLDER     = doc
-
-# If the QHP_CUST_FILTER_NAME tag is set, it specifies the name of a custom
-# filter to add. For more information please see Qt Help Project / Custom
-# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
-# filters).
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHP_CUST_FILTER_NAME   =
-
-# The QHP_CUST_FILTER_ATTRS tag specifies the list of the attributes of the
-# custom filter to add. For more information please see Qt Help Project / Custom
-# Filters (see: http://qt-project.org/doc/qt-4.8/qthelpproject.html#custom-
-# filters).
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHP_CUST_FILTER_ATTRS  =
-
-# The QHP_SECT_FILTER_ATTRS tag specifies the list of the attributes this
-# project's filter section matches. Qt Help Project / Filter Attributes (see:
-# http://qt-project.org/doc/qt-4.8/qthelpproject.html#filter-attributes).
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHP_SECT_FILTER_ATTRS  =
-
-# The QHG_LOCATION tag can be used to specify the location of Qt's
-# qhelpgenerator. If non-empty doxygen will try to run qhelpgenerator on the
-# generated .qhp file.
-# This tag requires that the tag GENERATE_QHP is set to YES.
-
-QHG_LOCATION           =
-
-# If the GENERATE_ECLIPSEHELP tag is set to YES, additional index files will be
-# generated, together with the HTML files, they form an Eclipse help plugin. To
-# install this plugin and make it available under the help contents menu in
-# Eclipse, the contents of the directory containing the HTML and XML files needs
-# to be copied into the plugins directory of eclipse. The name of the directory
-# within the plugins directory should be the same as the ECLIPSE_DOC_ID value.
-# After copying Eclipse needs to be restarted before the help appears.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-GENERATE_ECLIPSEHELP   = NO
-
-# A unique identifier for the Eclipse help plugin. When installing the plugin
-# the directory name containing the HTML and XML files should also have this
-# name. Each documentation set should have its own identifier.
-# The default value is: org.doxygen.Project.
-# This tag requires that the tag GENERATE_ECLIPSEHELP is set to YES.
-
-ECLIPSE_DOC_ID         = org.doxygen.Project
-
-# If you want full control over the layout of the generated HTML pages it might
-# be necessary to disable the index and replace it with your own. The
-# DISABLE_INDEX tag can be used to turn on/off the condensed index (tabs) at top
-# of each HTML page. A value of NO enables the index and the value YES disables
-# it. Since the tabs in the index contain the same information as the navigation
-# tree, you can set this option to YES if you also set GENERATE_TREEVIEW to YES.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-DISABLE_INDEX          = NO
-
-# The GENERATE_TREEVIEW tag is used to specify whether a tree-like index
-# structure should be generated to display hierarchical information. If the tag
-# value is set to YES, a side panel will be generated containing a tree-like
-# index structure (just like the one that is generated for HTML Help). For this
-# to work a browser that supports JavaScript, DHTML, CSS and frames is required
-# (i.e. any modern browser). Windows users are probably better off using the
-# HTML help feature. Via custom stylesheets (see HTML_EXTRA_STYLESHEET) one can
-# further fine-tune the look of the index. As an example, the default style
-# sheet generated by doxygen has an example that shows how to put an image at
-# the root of the tree instead of the PROJECT_NAME. Since the tree basically has
-# the same information as the tab index, you could consider setting
-# DISABLE_INDEX to YES when enabling this option.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-GENERATE_TREEVIEW      = NO
-
-# The ENUM_VALUES_PER_LINE tag can be used to set the number of enum values that
-# doxygen will group on one line in the generated HTML documentation.
-#
-# Note that a value of 0 will completely suppress the enum values from appearing
-# in the overview section.
-# Minimum value: 0, maximum value: 20, default value: 4.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-ENUM_VALUES_PER_LINE   = 4
-
-# If the treeview is enabled (see GENERATE_TREEVIEW) then this tag can be used
-# to set the initial width (in pixels) of the frame in which the tree is shown.
-# Minimum value: 0, maximum value: 1500, default value: 250.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-TREEVIEW_WIDTH         = 250
-
-# When the EXT_LINKS_IN_WINDOW option is set to YES doxygen will open links to
-# external symbols imported via tag files in a separate window.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-EXT_LINKS_IN_WINDOW    = NO
-
-# Use this tag to change the font size of LaTeX formulas included as images in
-# the HTML documentation. When you change the font size after a successful
-# doxygen run you need to manually remove any form_*.png images from the HTML
-# output directory to force them to be regenerated.
-# Minimum value: 8, maximum value: 50, default value: 10.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-FORMULA_FONTSIZE       = 10
-
-# Use the FORMULA_TRANPARENT tag to determine whether or not the images
-# generated for formulas are transparent PNGs. Transparent PNGs are not
-# supported properly for IE 6.0, but are supported on all modern browsers.
-#
-# Note that when changing this option you need to delete any form_*.png files in
-# the HTML output directory before the changes have effect.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-FORMULA_TRANSPARENT    = YES
-
-# Enable the USE_MATHJAX option to render LaTeX formulas using MathJax (see
-# http://www.mathjax.org) which uses client side Javascript for the rendering
-# instead of using prerendered bitmaps. Use this if you do not have LaTeX
-# installed or if you want to formulas look prettier in the HTML output. When
-# enabled you may also need to install MathJax separately and configure the path
-# to it using the MATHJAX_RELPATH option.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-USE_MATHJAX            = NO
-
-# When MathJax is enabled you can set the default output format to be used for
-# the MathJax output. See the MathJax site (see:
-# http://docs.mathjax.org/en/latest/output.html) for more details.
-# Possible values are: HTML-CSS (which is slower, but has the best
-# compatibility), NativeMML (i.e. MathML) and SVG.
-# The default value is: HTML-CSS.
-# This tag requires that the tag USE_MATHJAX is set to YES.
-
-MATHJAX_FORMAT         = HTML-CSS
-
-# When MathJax is enabled you need to specify the location relative to the HTML
-# output directory using the MATHJAX_RELPATH option. The destination directory
-# should contain the MathJax.js script. For instance, if the mathjax directory
-# is located at the same level as the HTML output directory, then
-# MATHJAX_RELPATH should be ../mathjax. The default value points to the MathJax
-# Content Delivery Network so you can quickly see the result without installing
-# MathJax. However, it is strongly recommended to install a local copy of
-# MathJax from http://www.mathjax.org before deployment.
-# The default value is: http://cdn.mathjax.org/mathjax/latest.
-# This tag requires that the tag USE_MATHJAX is set to YES.
-
-MATHJAX_RELPATH        = http://cdn.mathjax.org/mathjax/latest
-
-# The MATHJAX_EXTENSIONS tag can be used to specify one or more MathJax
-# extension names that should be enabled during MathJax rendering. For example
-# MATHJAX_EXTENSIONS = TeX/AMSmath TeX/AMSsymbols
-# This tag requires that the tag USE_MATHJAX is set to YES.
-
-MATHJAX_EXTENSIONS     =
-
-# The MATHJAX_CODEFILE tag can be used to specify a file with javascript pieces
-# of code that will be used on startup of the MathJax code. See the MathJax site
-# (see: http://docs.mathjax.org/en/latest/output.html) for more details. For an
-# example see the documentation.
-# This tag requires that the tag USE_MATHJAX is set to YES.
-
-MATHJAX_CODEFILE       =
-
-# When the SEARCHENGINE tag is enabled doxygen will generate a search box for
-# the HTML output. The underlying search engine uses javascript and DHTML and
-# should work on any modern browser. Note that when using HTML help
-# (GENERATE_HTMLHELP), Qt help (GENERATE_QHP), or docsets (GENERATE_DOCSET)
-# there is already a search function so this one should typically be disabled.
-# For large projects the javascript based search engine can be slow, then
-# enabling SERVER_BASED_SEARCH may provide a better solution. It is possible to
-# search using the keyboard; to jump to the search box use <access key> + S
-# (what the <access key> is depends on the OS and browser, but it is typically
-# <CTRL>, <ALT>/<option>, or both). Inside the search box use the <cursor down
-# key> to jump into the search results window, the results can be navigated
-# using the <cursor keys>. Press <Enter> to select an item or <escape> to cancel
-# the search. The filter options can be selected when the cursor is inside the
-# search box by pressing <Shift>+<cursor down>. Also here use the <cursor keys>
-# to select a filter and <Enter> or <escape> to activate or cancel the filter
-# option.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_HTML is set to YES.
-
-SEARCHENGINE           = YES
-
-# When the SERVER_BASED_SEARCH tag is enabled the search engine will be
-# implemented using a web server instead of a web client using Javascript. There
-# are two flavors of web server based searching depending on the EXTERNAL_SEARCH
-# setting. When disabled, doxygen will generate a PHP script for searching and
-# an index file used by the script. When EXTERNAL_SEARCH is enabled the indexing
-# and searching needs to be provided by external tools. See the section
-# "External Indexing and Searching" for details.
-# The default value is: NO.
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-SERVER_BASED_SEARCH    = NO
-
-# When EXTERNAL_SEARCH tag is enabled doxygen will no longer generate the PHP
-# script for searching. Instead the search results are written to an XML file
-# which needs to be processed by an external indexer. Doxygen will invoke an
-# external search engine pointed to by the SEARCHENGINE_URL option to obtain the
-# search results.
-#
-# Doxygen ships with an example indexer ( doxyindexer) and search engine
-# (doxysearch.cgi) which are based on the open source search engine library
-# Xapian (see: http://xapian.org/).
-#
-# See the section "External Indexing and Searching" for details.
-# The default value is: NO.
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-EXTERNAL_SEARCH        = NO
-
-# The SEARCHENGINE_URL should point to a search engine hosted by a web server
-# which will return the search results when EXTERNAL_SEARCH is enabled.
-#
-# Doxygen ships with an example indexer ( doxyindexer) and search engine
-# (doxysearch.cgi) which are based on the open source search engine library
-# Xapian (see: http://xapian.org/). See the section "External Indexing and
-# Searching" for details.
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-SEARCHENGINE_URL       =
-
-# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the unindexed
-# search data is written to a file for indexing by an external tool. With the
-# SEARCHDATA_FILE tag the name of this file can be specified.
-# The default file is: searchdata.xml.
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-SEARCHDATA_FILE        = searchdata.xml
-
-# When SERVER_BASED_SEARCH and EXTERNAL_SEARCH are both enabled the
-# EXTERNAL_SEARCH_ID tag can be used as an identifier for the project. This is
-# useful in combination with EXTRA_SEARCH_MAPPINGS to search through multiple
-# projects and redirect the results back to the right project.
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-EXTERNAL_SEARCH_ID     =
-
-# The EXTRA_SEARCH_MAPPINGS tag can be used to enable searching through doxygen
-# projects other than the one defined by this configuration file, but that are
-# all added to the same external search index. Each project needs to have a
-# unique id set via EXTERNAL_SEARCH_ID. The search mapping then maps the id of
-# to a relative location where the documentation can be found. The format is:
-# EXTRA_SEARCH_MAPPINGS = tagname1=loc1 tagname2=loc2 ...
-# This tag requires that the tag SEARCHENGINE is set to YES.
-
-EXTRA_SEARCH_MAPPINGS  =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the LaTeX output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_LATEX tag is set to YES doxygen will generate LaTeX output.
-# The default value is: YES.
-
-GENERATE_LATEX         = NO
-
-# The LATEX_OUTPUT tag is used to specify where the LaTeX docs will be put. If a
-# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
-# it.
-# The default directory is: latex.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_OUTPUT           = latex
-
-# The LATEX_CMD_NAME tag can be used to specify the LaTeX command name to be
-# invoked.
-#
-# Note that when enabling USE_PDFLATEX this option is only used for generating
-# bitmaps for formulas in the HTML output, but not in the Makefile that is
-# written to the output directory.
-# The default file is: latex.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_CMD_NAME         = latex
-
-# The MAKEINDEX_CMD_NAME tag can be used to specify the command name to generate
-# index for LaTeX.
-# The default file is: makeindex.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-MAKEINDEX_CMD_NAME     = makeindex
-
-# If the COMPACT_LATEX tag is set to YES doxygen generates more compact LaTeX
-# documents. This may be useful for small projects and may help to save some
-# trees in general.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-COMPACT_LATEX          = NO
-
-# The PAPER_TYPE tag can be used to set the paper type that is used by the
-# printer.
-# Possible values are: a4 (210 x 297 mm), letter (8.5 x 11 inches), legal (8.5 x
-# 14 inches) and executive (7.25 x 10.5 inches).
-# The default value is: a4.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-PAPER_TYPE             = a4
-
-# The EXTRA_PACKAGES tag can be used to specify one or more LaTeX package names
-# that should be included in the LaTeX output. To get the times font for
-# instance you can specify
-# EXTRA_PACKAGES=times
-# If left blank no extra packages will be included.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-EXTRA_PACKAGES         =
-
-# The LATEX_HEADER tag can be used to specify a personal LaTeX header for the
-# generated LaTeX document. The header should contain everything until the first
-# chapter. If it is left blank doxygen will generate a standard header. See
-# section "Doxygen usage" for information on how to let doxygen write the
-# default header to a separate file.
-#
-# Note: Only use a user-defined header if you know what you are doing! The
-# following commands have a special meaning inside the header: $title,
-# $datetime, $date, $doxygenversion, $projectname, $projectnumber. Doxygen will
-# replace them by respectively the title of the page, the current date and time,
-# only the current date, the version number of doxygen, the project name (see
-# PROJECT_NAME), or the project number (see PROJECT_NUMBER).
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_HEADER           =
-
-# The LATEX_FOOTER tag can be used to specify a personal LaTeX footer for the
-# generated LaTeX document. The footer should contain everything after the last
-# chapter. If it is left blank doxygen will generate a standard footer.
-#
-# Note: Only use a user-defined footer if you know what you are doing!
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_FOOTER           =
-
-# The LATEX_EXTRA_FILES tag can be used to specify one or more extra images or
-# other source files which should be copied to the LATEX_OUTPUT output
-# directory. Note that the files will be copied as-is; there are no commands or
-# markers available.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_EXTRA_FILES      =
-
-# If the PDF_HYPERLINKS tag is set to YES, the LaTeX that is generated is
-# prepared for conversion to PDF (using ps2pdf or pdflatex). The PDF file will
-# contain links (just like the HTML output) instead of page references. This
-# makes the output suitable for online browsing using a PDF viewer.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-PDF_HYPERLINKS         = YES
-
-# If the LATEX_PDFLATEX tag is set to YES, doxygen will use pdflatex to generate
-# the PDF file directly from the LaTeX files. Set this option to YES to get a
-# higher quality PDF documentation.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-USE_PDFLATEX           = YES
-
-# If the LATEX_BATCHMODE tag is set to YES, doxygen will add the \batchmode
-# command to the generated LaTeX files. This will instruct LaTeX to keep running
-# if errors occur, instead of asking the user for help. This option is also used
-# when generating formulas in HTML.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_BATCHMODE        = NO
-
-# If the LATEX_HIDE_INDICES tag is set to YES then doxygen will not include the
-# index chapters (such as File Index, Compound Index, etc.) in the output.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_HIDE_INDICES     = NO
-
-# If the LATEX_SOURCE_CODE tag is set to YES then doxygen will include source
-# code with syntax highlighting in the LaTeX output.
-#
-# Note that which sources are shown also depends on other settings such as
-# SOURCE_BROWSER.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_SOURCE_CODE      = NO
-
-# The LATEX_BIB_STYLE tag can be used to specify the style to use for the
-# bibliography, e.g. plainnat, or ieeetr. See
-# http://en.wikipedia.org/wiki/BibTeX and \cite for more info.
-# The default value is: plain.
-# This tag requires that the tag GENERATE_LATEX is set to YES.
-
-LATEX_BIB_STYLE        = plain
-
-#---------------------------------------------------------------------------
-# Configuration options related to the RTF output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_RTF tag is set to YES doxygen will generate RTF output. The
-# RTF output is optimized for Word 97 and may not look too pretty with other RTF
-# readers/editors.
-# The default value is: NO.
-
-GENERATE_RTF           = NO
-
-# The RTF_OUTPUT tag is used to specify where the RTF docs will be put. If a
-# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
-# it.
-# The default directory is: rtf.
-# This tag requires that the tag GENERATE_RTF is set to YES.
-
-RTF_OUTPUT             = rtf
-
-# If the COMPACT_RTF tag is set to YES doxygen generates more compact RTF
-# documents. This may be useful for small projects and may help to save some
-# trees in general.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_RTF is set to YES.
-
-COMPACT_RTF            = NO
-
-# If the RTF_HYPERLINKS tag is set to YES, the RTF that is generated will
-# contain hyperlink fields. The RTF file will contain links (just like the HTML
-# output) instead of page references. This makes the output suitable for online
-# browsing using Word or some other Word compatible readers that support those
-# fields.
-#
-# Note: WordPad (write) and others do not support links.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_RTF is set to YES.
-
-RTF_HYPERLINKS         = NO
-
-# Load stylesheet definitions from file. Syntax is similar to doxygen's config
-# file, i.e. a series of assignments. You only have to provide replacements,
-# missing definitions are set to their default value.
-#
-# See also section "Doxygen usage" for information on how to generate the
-# default style sheet that doxygen normally uses.
-# This tag requires that the tag GENERATE_RTF is set to YES.
-
-RTF_STYLESHEET_FILE    =
-
-# Set optional variables used in the generation of an RTF document. Syntax is
-# similar to doxygen's config file. A template extensions file can be generated
-# using doxygen -e rtf extensionFile.
-# This tag requires that the tag GENERATE_RTF is set to YES.
-
-RTF_EXTENSIONS_FILE    =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the man page output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_MAN tag is set to YES doxygen will generate man pages for
-# classes and files.
-# The default value is: NO.
-
-GENERATE_MAN           = NO
-
-# The MAN_OUTPUT tag is used to specify where the man pages will be put. If a
-# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
-# it. A directory man3 will be created inside the directory specified by
-# MAN_OUTPUT.
-# The default directory is: man.
-# This tag requires that the tag GENERATE_MAN is set to YES.
-
-MAN_OUTPUT             = man
-
-# The MAN_EXTENSION tag determines the extension that is added to the generated
-# man pages. In case the manual section does not start with a number, the number
-# 3 is prepended. The dot (.) at the beginning of the MAN_EXTENSION tag is
-# optional.
-# The default value is: .3.
-# This tag requires that the tag GENERATE_MAN is set to YES.
-
-MAN_EXTENSION          = .3
-
-# The MAN_SUBDIR tag determines the name of the directory created within
-# MAN_OUTPUT in which the man pages are placed. If defaults to man followed by
-# MAN_EXTENSION with the initial . removed.
-# This tag requires that the tag GENERATE_MAN is set to YES.
-
-MAN_SUBDIR             =
-
-# If the MAN_LINKS tag is set to YES and doxygen generates man output, then it
-# will generate one additional man file for each entity documented in the real
-# man page(s). These additional files only source the real man page, but without
-# them the man command would be unable to find the correct page.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_MAN is set to YES.
-
-MAN_LINKS              = NO
-
-#---------------------------------------------------------------------------
-# Configuration options related to the XML output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_XML tag is set to YES doxygen will generate an XML file that
-# captures the structure of the code including all documentation.
-# The default value is: NO.
-
-GENERATE_XML           = YES
-
-# The XML_OUTPUT tag is used to specify where the XML pages will be put. If a
-# relative path is entered the value of OUTPUT_DIRECTORY will be put in front of
-# it.
-# The default directory is: xml.
-# This tag requires that the tag GENERATE_XML is set to YES.
-
-XML_OUTPUT             = xml
-
-# If the XML_PROGRAMLISTING tag is set to YES doxygen will dump the program
-# listings (including syntax highlighting and cross-referencing information) to
-# the XML output. Note that enabling this will significantly increase the size
-# of the XML output.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_XML is set to YES.
-
-XML_PROGRAMLISTING     = YES
-
-#---------------------------------------------------------------------------
-# Configuration options related to the DOCBOOK output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_DOCBOOK tag is set to YES doxygen will generate Docbook files
-# that can be used to generate PDF.
-# The default value is: NO.
-
-GENERATE_DOCBOOK       = NO
-
-# The DOCBOOK_OUTPUT tag is used to specify where the Docbook pages will be put.
-# If a relative path is entered the value of OUTPUT_DIRECTORY will be put in
-# front of it.
-# The default directory is: docbook.
-# This tag requires that the tag GENERATE_DOCBOOK is set to YES.
-
-DOCBOOK_OUTPUT         = docbook
-
-#---------------------------------------------------------------------------
-# Configuration options for the AutoGen Definitions output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_AUTOGEN_DEF tag is set to YES doxygen will generate an AutoGen
-# Definitions (see http://autogen.sf.net) file that captures the structure of
-# the code including all documentation. Note that this feature is still
-# experimental and incomplete at the moment.
-# The default value is: NO.
-
-GENERATE_AUTOGEN_DEF   = NO
-
-#---------------------------------------------------------------------------
-# Configuration options related to the Perl module output
-#---------------------------------------------------------------------------
-
-# If the GENERATE_PERLMOD tag is set to YES doxygen will generate a Perl module
-# file that captures the structure of the code including all documentation.
-#
-# Note that this feature is still experimental and incomplete at the moment.
-# The default value is: NO.
-
-GENERATE_PERLMOD       = NO
-
-# If the PERLMOD_LATEX tag is set to YES doxygen will generate the necessary
-# Makefile rules, Perl scripts and LaTeX code to be able to generate PDF and DVI
-# output from the Perl module output.
-# The default value is: NO.
-# This tag requires that the tag GENERATE_PERLMOD is set to YES.
-
-PERLMOD_LATEX          = NO
-
-# If the PERLMOD_PRETTY tag is set to YES the Perl module output will be nicely
-# formatted so it can be parsed by a human reader. This is useful if you want to
-# understand what is going on. On the other hand, if this tag is set to NO the
-# size of the Perl module output will be much smaller and Perl will parse it
-# just the same.
-# The default value is: YES.
-# This tag requires that the tag GENERATE_PERLMOD is set to YES.
-
-PERLMOD_PRETTY         = YES
-
-# The names of the make variables in the generated doxyrules.make file are
-# prefixed with the string contained in PERLMOD_MAKEVAR_PREFIX. This is useful
-# so different doxyrules.make files included by the same Makefile don't
-# overwrite each other's variables.
-# This tag requires that the tag GENERATE_PERLMOD is set to YES.
-
-PERLMOD_MAKEVAR_PREFIX =
-
-#---------------------------------------------------------------------------
-# Configuration options related to the preprocessor
-#---------------------------------------------------------------------------
-
-# If the ENABLE_PREPROCESSING tag is set to YES doxygen will evaluate all
-# C-preprocessor directives found in the sources and include files.
-# The default value is: YES.
-
-ENABLE_PREPROCESSING   = YES
-
-# If the MACRO_EXPANSION tag is set to YES doxygen will expand all macro names
-# in the source code. If set to NO only conditional compilation will be
-# performed. Macro expansion can be done in a controlled way by setting
-# EXPAND_ONLY_PREDEF to YES.
-# The default value is: NO.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-MACRO_EXPANSION        = NO
-
-# If the EXPAND_ONLY_PREDEF and MACRO_EXPANSION tags are both set to YES then
-# the macro expansion is limited to the macros specified with the PREDEFINED and
-# EXPAND_AS_DEFINED tags.
-# The default value is: NO.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-EXPAND_ONLY_PREDEF     = NO
-
-# If the SEARCH_INCLUDES tag is set to YES the includes files in the
-# INCLUDE_PATH will be searched if a #include is found.
-# The default value is: YES.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-SEARCH_INCLUDES        = YES
-
-# The INCLUDE_PATH tag can be used to specify one or more directories that
-# contain include files that are not input files but should be processed by the
-# preprocessor.
-# This tag requires that the tag SEARCH_INCLUDES is set to YES.
-
-INCLUDE_PATH           =
-
-# You can use the INCLUDE_FILE_PATTERNS tag to specify one or more wildcard
-# patterns (like *.h and *.hpp) to filter out the header-files in the
-# directories. If left blank, the patterns specified with FILE_PATTERNS will be
-# used.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-INCLUDE_FILE_PATTERNS  =
-
-# The PREDEFINED tag can be used to specify one or more macro names that are
-# defined before the preprocessor is started (similar to the -D option of e.g.
-# gcc). The argument of the tag is a list of macros of the form: name or
-# name=definition (no spaces). If the definition and the "=" are omitted, "=1"
-# is assumed. To prevent a macro definition from being undefined via #undef or
-# recursively expanded use the := operator instead of the = operator.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-PREDEFINED             =
-
-# If the MACRO_EXPANSION and EXPAND_ONLY_PREDEF tags are set to YES then this
-# tag can be used to specify a list of macro names that should be expanded. The
-# macro definition that is found in the sources will be used. Use the PREDEFINED
-# tag if you want to use a different macro definition that overrules the
-# definition found in the source code.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-EXPAND_AS_DEFINED      =
-
-# If the SKIP_FUNCTION_MACROS tag is set to YES then doxygen's preprocessor will
-# remove all references to function-like macros that are alone on a line, have
-# an all uppercase name, and do not end with a semicolon. Such function macros
-# are typically used for boiler-plate code, and will confuse the parser if not
-# removed.
-# The default value is: YES.
-# This tag requires that the tag ENABLE_PREPROCESSING is set to YES.
-
-SKIP_FUNCTION_MACROS   = YES
-
-#---------------------------------------------------------------------------
-# Configuration options related to external references
-#---------------------------------------------------------------------------
-
-# The TAGFILES tag can be used to specify one or more tag files. For each tag
-# file the location of the external documentation should be added. The format of
-# a tag file without this location is as follows:
-# TAGFILES = file1 file2 ...
-# Adding location for the tag files is done as follows:
-# TAGFILES = file1=loc1 "file2 = loc2" ...
-# where loc1 and loc2 can be relative or absolute paths or URLs. See the
-# section "Linking to external documentation" for more information about the use
-# of tag files.
-# Note: Each tag file must have a unique name (where the name does NOT include
-# the path). If a tag file is not located in the directory in which doxygen is
-# run, you must also specify the path to the tagfile here.
-
-TAGFILES               =
-
-# When a file name is specified after GENERATE_TAGFILE, doxygen will create a
-# tag file that is based on the input files it reads. See section "Linking to
-# external documentation" for more information about the usage of tag files.
-
-GENERATE_TAGFILE       =
-
-# If the ALLEXTERNALS tag is set to YES all external class will be listed in the
-# class index. If set to NO only the inherited external classes will be listed.
-# The default value is: NO.
-
-ALLEXTERNALS           = NO
-
-# If the EXTERNAL_GROUPS tag is set to YES all external groups will be listed in
-# the modules index. If set to NO, only the current project's groups will be
-# listed.
-# The default value is: YES.
-
-EXTERNAL_GROUPS        = YES
-
-# If the EXTERNAL_PAGES tag is set to YES all external pages will be listed in
-# the related pages index. If set to NO, only the current project's pages will
-# be listed.
-# The default value is: YES.
-
-EXTERNAL_PAGES         = YES
-
-# The PERL_PATH should be the absolute path and name of the perl script
-# interpreter (i.e. the result of 'which perl').
-# The default file (with absolute path) is: /usr/bin/perl.
-
-PERL_PATH              = /usr/bin/perl
-
-#---------------------------------------------------------------------------
-# Configuration options related to the dot tool
-#---------------------------------------------------------------------------
-
-# If the CLASS_DIAGRAMS tag is set to YES doxygen will generate a class diagram
-# (in HTML and LaTeX) for classes with base or super classes. Setting the tag to
-# NO turns the diagrams off. Note that this option also works with HAVE_DOT
-# disabled, but it is recommended to install and use dot, since it yields more
-# powerful graphs.
-# The default value is: YES.
-
-CLASS_DIAGRAMS         = YES
-
-# You can define message sequence charts within doxygen comments using the \msc
-# command. Doxygen will then run the mscgen tool (see:
-# http://www.mcternan.me.uk/mscgen/)) to produce the chart and insert it in the
-# documentation. The MSCGEN_PATH tag allows you to specify the directory where
-# the mscgen tool resides. If left empty the tool is assumed to be found in the
-# default search path.
-
-MSCGEN_PATH            =
-
-# You can include diagrams made with dia in doxygen documentation. Doxygen will
-# then run dia to produce the diagram and insert it in the documentation. The
-# DIA_PATH tag allows you to specify the directory where the dia binary resides.
-# If left empty dia is assumed to be found in the default search path.
-
-DIA_PATH               =
-
-# If set to YES, the inheritance and collaboration graphs will hide inheritance
-# and usage relations if the target is undocumented or is not a class.
-# The default value is: YES.
-
-HIDE_UNDOC_RELATIONS   = YES
-
-# If you set the HAVE_DOT tag to YES then doxygen will assume the dot tool is
-# available from the path. This tool is part of Graphviz (see:
-# http://www.graphviz.org/), a graph visualization toolkit from AT&T and Lucent
-# Bell Labs. The other options in this section have no effect if this option is
-# set to NO
-# The default value is: NO.
-
-HAVE_DOT               = NO
-
-# The DOT_NUM_THREADS specifies the number of dot invocations doxygen is allowed
-# to run in parallel. When set to 0 doxygen will base this on the number of
-# processors available in the system. You can set it explicitly to a value
-# larger than 0 to get control over the balance between CPU load and processing
-# speed.
-# Minimum value: 0, maximum value: 32, default value: 0.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_NUM_THREADS        = 0
-
-# When you want a differently looking font n the dot files that doxygen
-# generates you can specify the font name using DOT_FONTNAME. You need to make
-# sure dot is able to find the font, which can be done by putting it in a
-# standard location or by setting the DOTFONTPATH environment variable or by
-# setting DOT_FONTPATH to the directory containing the font.
-# The default value is: Helvetica.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_FONTNAME           = Helvetica
-
-# The DOT_FONTSIZE tag can be used to set the size (in points) of the font of
-# dot graphs.
-# Minimum value: 4, maximum value: 24, default value: 10.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_FONTSIZE           = 10
-
-# By default doxygen will tell dot to use the default font as specified with
-# DOT_FONTNAME. If you specify a different font using DOT_FONTNAME you can set
-# the path where dot can find it using this tag.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_FONTPATH           =
-
-# If the CLASS_GRAPH tag is set to YES then doxygen will generate a graph for
-# each documented class showing the direct and indirect inheritance relations.
-# Setting this tag to YES will force the CLASS_DIAGRAMS tag to NO.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-CLASS_GRAPH            = YES
-
-# If the COLLABORATION_GRAPH tag is set to YES then doxygen will generate a
-# graph for each documented class showing the direct and indirect implementation
-# dependencies (inheritance, containment, and class references variables) of the
-# class with other documented classes.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-COLLABORATION_GRAPH    = YES
-
-# If the GROUP_GRAPHS tag is set to YES then doxygen will generate a graph for
-# groups, showing the direct groups dependencies.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-GROUP_GRAPHS           = YES
-
-# If the UML_LOOK tag is set to YES doxygen will generate inheritance and
-# collaboration diagrams in a style similar to the OMG's Unified Modeling
-# Language.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-UML_LOOK               = NO
-
-# If the UML_LOOK tag is enabled, the fields and methods are shown inside the
-# class node. If there are many fields or methods and many nodes the graph may
-# become too big to be useful. The UML_LIMIT_NUM_FIELDS threshold limits the
-# number of items for each type to make the size more manageable. Set this to 0
-# for no limit. Note that the threshold may be exceeded by 50% before the limit
-# is enforced. So when you set the threshold to 10, up to 15 fields may appear,
-# but if the number exceeds 15, the total amount of fields shown is limited to
-# 10.
-# Minimum value: 0, maximum value: 100, default value: 10.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-UML_LIMIT_NUM_FIELDS   = 10
-
-# If the TEMPLATE_RELATIONS tag is set to YES then the inheritance and
-# collaboration graphs will show the relations between templates and their
-# instances.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-TEMPLATE_RELATIONS     = NO
-
-# If the INCLUDE_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are set to
-# YES then doxygen will generate a graph for each documented file showing the
-# direct and indirect include dependencies of the file with other documented
-# files.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-INCLUDE_GRAPH          = YES
-
-# If the INCLUDED_BY_GRAPH, ENABLE_PREPROCESSING and SEARCH_INCLUDES tags are
-# set to YES then doxygen will generate a graph for each documented file showing
-# the direct and indirect include dependencies of the file with other documented
-# files.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-INCLUDED_BY_GRAPH      = YES
-
-# If the CALL_GRAPH tag is set to YES then doxygen will generate a call
-# dependency graph for every global function or class method.
-#
-# Note that enabling this option will significantly increase the time of a run.
-# So in most cases it will be better to enable call graphs for selected
-# functions only using the \callgraph command.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-CALL_GRAPH             = NO
-
-# If the CALLER_GRAPH tag is set to YES then doxygen will generate a caller
-# dependency graph for every global function or class method.
-#
-# Note that enabling this option will significantly increase the time of a run.
-# So in most cases it will be better to enable caller graphs for selected
-# functions only using the \callergraph command.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-CALLER_GRAPH           = NO
-
-# If the GRAPHICAL_HIERARCHY tag is set to YES then doxygen will graphical
-# hierarchy of all classes instead of a textual one.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-GRAPHICAL_HIERARCHY    = YES
-
-# If the DIRECTORY_GRAPH tag is set to YES then doxygen will show the
-# dependencies a directory has on other directories in a graphical way. The
-# dependency relations are determined by the #include relations between the
-# files in the directories.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DIRECTORY_GRAPH        = YES
-
-# The DOT_IMAGE_FORMAT tag can be used to set the image format of the images
-# generated by dot.
-# Note: If you choose svg you need to set HTML_FILE_EXTENSION to xhtml in order
-# to make the SVG files visible in IE 9+ (other browsers do not have this
-# requirement).
-# Possible values are: png, jpg, gif and svg.
-# The default value is: png.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_IMAGE_FORMAT       = png
-
-# If DOT_IMAGE_FORMAT is set to svg, then this option can be set to YES to
-# enable generation of interactive SVG images that allow zooming and panning.
-#
-# Note that this requires a modern browser other than Internet Explorer. Tested
-# and working are Firefox, Chrome, Safari, and Opera.
-# Note: For IE 9+ you need to set HTML_FILE_EXTENSION to xhtml in order to make
-# the SVG files visible. Older versions of IE do not have SVG support.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-INTERACTIVE_SVG        = NO
-
-# The DOT_PATH tag can be used to specify the path where the dot tool can be
-# found. If left blank, it is assumed the dot tool can be found in the path.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_PATH               =
-
-# The DOTFILE_DIRS tag can be used to specify one or more directories that
-# contain dot files that are included in the documentation (see the \dotfile
-# command).
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOTFILE_DIRS           =
-
-# The MSCFILE_DIRS tag can be used to specify one or more directories that
-# contain msc files that are included in the documentation (see the \mscfile
-# command).
-
-MSCFILE_DIRS           =
-
-# The DIAFILE_DIRS tag can be used to specify one or more directories that
-# contain dia files that are included in the documentation (see the \diafile
-# command).
-
-DIAFILE_DIRS           =
-
-# The DOT_GRAPH_MAX_NODES tag can be used to set the maximum number of nodes
-# that will be shown in the graph. If the number of nodes in a graph becomes
-# larger than this value, doxygen will truncate the graph, which is visualized
-# by representing a node as a red box. Note that doxygen if the number of direct
-# children of the root node in a graph is already larger than
-# DOT_GRAPH_MAX_NODES then the graph will not be shown at all. Also note that
-# the size of a graph can be further restricted by MAX_DOT_GRAPH_DEPTH.
-# Minimum value: 0, maximum value: 10000, default value: 50.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_GRAPH_MAX_NODES    = 50
-
-# The MAX_DOT_GRAPH_DEPTH tag can be used to set the maximum depth of the graphs
-# generated by dot. A depth value of 3 means that only nodes reachable from the
-# root by following a path via at most 3 edges will be shown. Nodes that lay
-# further from the root node will be omitted. Note that setting this option to 1
-# or 2 may greatly reduce the computation time needed for large code bases. Also
-# note that the size of a graph can be further restricted by
-# DOT_GRAPH_MAX_NODES. Using a depth of 0 means no depth restriction.
-# Minimum value: 0, maximum value: 1000, default value: 0.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-MAX_DOT_GRAPH_DEPTH    = 0
-
-# Set the DOT_TRANSPARENT tag to YES to generate images with a transparent
-# background. This is disabled by default, because dot on Windows does not seem
-# to support this out of the box.
-#
-# Warning: Depending on the platform used, enabling this option may lead to
-# badly anti-aliased labels on the edges of a graph (i.e. they become hard to
-# read).
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_TRANSPARENT        = NO
-
-# Set the DOT_MULTI_TARGETS tag to YES allow dot to generate multiple output
-# files in one run (i.e. multiple -o and -T options on the command line). This
-# makes dot run faster, but since only newer versions of dot (>1.8.10) support
-# this, this feature is disabled by default.
-# The default value is: NO.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_MULTI_TARGETS      = NO
-
-# If the GENERATE_LEGEND tag is set to YES doxygen will generate a legend page
-# explaining the meaning of the various boxes and arrows in the dot generated
-# graphs.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-GENERATE_LEGEND        = YES
-
-# If the DOT_CLEANUP tag is set to YES doxygen will remove the intermediate dot
-# files that are used to generate the various graphs.
-# The default value is: YES.
-# This tag requires that the tag HAVE_DOT is set to YES.
-
-DOT_CLEANUP            = YES
diff --git a/ps-lite/docs/Makefile b/ps-lite/docs/Makefile
deleted file mode 100644
index ee2cff1e..00000000
--- a/ps-lite/docs/Makefile
+++ /dev/null
@@ -1,216 +0,0 @@
-# Makefile for Sphinx documentation
-#
-
-# You can set these variables from the command line.
-SPHINXOPTS    =
-SPHINXBUILD   = sphinx-build
-PAPER         =
-BUILDDIR      = _build
-
-# User-friendly check for sphinx-build
-ifeq ($(shell which $(SPHINXBUILD) >/dev/null 2>&1; echo $$?), 1)
-$(error The '$(SPHINXBUILD)' command was not found. Make sure you have Sphinx installed, then set the SPHINXBUILD environment variable to point to the full path of the '$(SPHINXBUILD)' executable. Alternatively you can add the directory with the executable to your PATH. If you don't have Sphinx installed, grab it from http://sphinx-doc.org/)
-endif
-
-# Internal variables.
-PAPEROPT_a4     = -D latex_paper_size=a4
-PAPEROPT_letter = -D latex_paper_size=letter
-ALLSPHINXOPTS   = -d $(BUILDDIR)/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .
-# the i18n builder cannot share the environment and doctrees with the others
-I18NSPHINXOPTS  = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .
-
-.PHONY: help
-help:
-	@echo "Please use \`make <target>' where <target> is one of"
-	@echo "  html       to make standalone HTML files"
-	@echo "  dirhtml    to make HTML files named index.html in directories"
-	@echo "  singlehtml to make a single large HTML file"
-	@echo "  pickle     to make pickle files"
-	@echo "  json       to make JSON files"
-	@echo "  htmlhelp   to make HTML files and a HTML help project"
-	@echo "  qthelp     to make HTML files and a qthelp project"
-	@echo "  applehelp  to make an Apple Help Book"
-	@echo "  devhelp    to make HTML files and a Devhelp project"
-	@echo "  epub       to make an epub"
-	@echo "  latex      to make LaTeX files, you can set PAPER=a4 or PAPER=letter"
-	@echo "  latexpdf   to make LaTeX files and run them through pdflatex"
-	@echo "  latexpdfja to make LaTeX files and run them through platex/dvipdfmx"
-	@echo "  text       to make text files"
-	@echo "  man        to make manual pages"
-	@echo "  texinfo    to make Texinfo files"
-	@echo "  info       to make Texinfo files and run them through makeinfo"
-	@echo "  gettext    to make PO message catalogs"
-	@echo "  changes    to make an overview of all changed/added/deprecated items"
-	@echo "  xml        to make Docutils-native XML files"
-	@echo "  pseudoxml  to make pseudoxml-XML files for display purposes"
-	@echo "  linkcheck  to check all external links for integrity"
-	@echo "  doctest    to run all doctests embedded in the documentation (if enabled)"
-	@echo "  coverage   to run coverage check of the documentation (if enabled)"
-
-.PHONY: clean
-clean:
-	rm -rf $(BUILDDIR)/*
-
-.PHONY: html
-html:
-	$(SPHINXBUILD) -b html $(ALLSPHINXOPTS) $(BUILDDIR)/html
-	@echo
-	@echo "Build finished. The HTML pages are in $(BUILDDIR)/html."
-
-.PHONY: dirhtml
-dirhtml:
-	$(SPHINXBUILD) -b dirhtml $(ALLSPHINXOPTS) $(BUILDDIR)/dirhtml
-	@echo
-	@echo "Build finished. The HTML pages are in $(BUILDDIR)/dirhtml."
-
-.PHONY: singlehtml
-singlehtml:
-	$(SPHINXBUILD) -b singlehtml $(ALLSPHINXOPTS) $(BUILDDIR)/singlehtml
-	@echo
-	@echo "Build finished. The HTML page is in $(BUILDDIR)/singlehtml."
-
-.PHONY: pickle
-pickle:
-	$(SPHINXBUILD) -b pickle $(ALLSPHINXOPTS) $(BUILDDIR)/pickle
-	@echo
-	@echo "Build finished; now you can process the pickle files."
-
-.PHONY: json
-json:
-	$(SPHINXBUILD) -b json $(ALLSPHINXOPTS) $(BUILDDIR)/json
-	@echo
-	@echo "Build finished; now you can process the JSON files."
-
-.PHONY: htmlhelp
-htmlhelp:
-	$(SPHINXBUILD) -b htmlhelp $(ALLSPHINXOPTS) $(BUILDDIR)/htmlhelp
-	@echo
-	@echo "Build finished; now you can run HTML Help Workshop with the" \
-	      ".hhp project file in $(BUILDDIR)/htmlhelp."
-
-.PHONY: qthelp
-qthelp:
-	$(SPHINXBUILD) -b qthelp $(ALLSPHINXOPTS) $(BUILDDIR)/qthelp
-	@echo
-	@echo "Build finished; now you can run "qcollectiongenerator" with the" \
-	      ".qhcp project file in $(BUILDDIR)/qthelp, like this:"
-	@echo "# qcollectiongenerator $(BUILDDIR)/qthelp/ps-lite.qhcp"
-	@echo "To view the help file:"
-	@echo "# assistant -collectionFile $(BUILDDIR)/qthelp/ps-lite.qhc"
-
-.PHONY: applehelp
-applehelp:
-	$(SPHINXBUILD) -b applehelp $(ALLSPHINXOPTS) $(BUILDDIR)/applehelp
-	@echo
-	@echo "Build finished. The help book is in $(BUILDDIR)/applehelp."
-	@echo "N.B. You won't be able to view it unless you put it in" \
-	      "~/Library/Documentation/Help or install it in your application" \
-	      "bundle."
-
-.PHONY: devhelp
-devhelp:
-	$(SPHINXBUILD) -b devhelp $(ALLSPHINXOPTS) $(BUILDDIR)/devhelp
-	@echo
-	@echo "Build finished."
-	@echo "To view the help file:"
-	@echo "# mkdir -p $$HOME/.local/share/devhelp/ps-lite"
-	@echo "# ln -s $(BUILDDIR)/devhelp $$HOME/.local/share/devhelp/ps-lite"
-	@echo "# devhelp"
-
-.PHONY: epub
-epub:
-	$(SPHINXBUILD) -b epub $(ALLSPHINXOPTS) $(BUILDDIR)/epub
-	@echo
-	@echo "Build finished. The epub file is in $(BUILDDIR)/epub."
-
-.PHONY: latex
-latex:
-	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
-	@echo
-	@echo "Build finished; the LaTeX files are in $(BUILDDIR)/latex."
-	@echo "Run \`make' in that directory to run these through (pdf)latex" \
-	      "(use \`make latexpdf' here to do that automatically)."
-
-.PHONY: latexpdf
-latexpdf:
-	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
-	@echo "Running LaTeX files through pdflatex..."
-	$(MAKE) -C $(BUILDDIR)/latex all-pdf
-	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
-
-.PHONY: latexpdfja
-latexpdfja:
-	$(SPHINXBUILD) -b latex $(ALLSPHINXOPTS) $(BUILDDIR)/latex
-	@echo "Running LaTeX files through platex and dvipdfmx..."
-	$(MAKE) -C $(BUILDDIR)/latex all-pdf-ja
-	@echo "pdflatex finished; the PDF files are in $(BUILDDIR)/latex."
-
-.PHONY: text
-text:
-	$(SPHINXBUILD) -b text $(ALLSPHINXOPTS) $(BUILDDIR)/text
-	@echo
-	@echo "Build finished. The text files are in $(BUILDDIR)/text."
-
-.PHONY: man
-man:
-	$(SPHINXBUILD) -b man $(ALLSPHINXOPTS) $(BUILDDIR)/man
-	@echo
-	@echo "Build finished. The manual pages are in $(BUILDDIR)/man."
-
-.PHONY: texinfo
-texinfo:
-	$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo
-	@echo
-	@echo "Build finished. The Texinfo files are in $(BUILDDIR)/texinfo."
-	@echo "Run \`make' in that directory to run these through makeinfo" \
-	      "(use \`make info' here to do that automatically)."
-
-.PHONY: info
-info:
-	$(SPHINXBUILD) -b texinfo $(ALLSPHINXOPTS) $(BUILDDIR)/texinfo
-	@echo "Running Texinfo files through makeinfo..."
-	make -C $(BUILDDIR)/texinfo info
-	@echo "makeinfo finished; the Info files are in $(BUILDDIR)/texinfo."
-
-.PHONY: gettext
-gettext:
-	$(SPHINXBUILD) -b gettext $(I18NSPHINXOPTS) $(BUILDDIR)/locale
-	@echo
-	@echo "Build finished. The message catalogs are in $(BUILDDIR)/locale."
-
-.PHONY: changes
-changes:
-	$(SPHINXBUILD) -b changes $(ALLSPHINXOPTS) $(BUILDDIR)/changes
-	@echo
-	@echo "The overview file is in $(BUILDDIR)/changes."
-
-.PHONY: linkcheck
-linkcheck:
-	$(SPHINXBUILD) -b linkcheck $(ALLSPHINXOPTS) $(BUILDDIR)/linkcheck
-	@echo
-	@echo "Link check complete; look for any errors in the above output " \
-	      "or in $(BUILDDIR)/linkcheck/output.txt."
-
-.PHONY: doctest
-doctest:
-	$(SPHINXBUILD) -b doctest $(ALLSPHINXOPTS) $(BUILDDIR)/doctest
-	@echo "Testing of doctests in the sources finished, look at the " \
-	      "results in $(BUILDDIR)/doctest/output.txt."
-
-.PHONY: coverage
-coverage:
-	$(SPHINXBUILD) -b coverage $(ALLSPHINXOPTS) $(BUILDDIR)/coverage
-	@echo "Testing of coverage in the sources finished, look at the " \
-	      "results in $(BUILDDIR)/coverage/python.txt."
-
-.PHONY: xml
-xml:
-	$(SPHINXBUILD) -b xml $(ALLSPHINXOPTS) $(BUILDDIR)/xml
-	@echo
-	@echo "Build finished. The XML files are in $(BUILDDIR)/xml."
-
-.PHONY: pseudoxml
-pseudoxml:
-	$(SPHINXBUILD) -b pseudoxml $(ALLSPHINXOPTS) $(BUILDDIR)/pseudoxml
-	@echo
-	@echo "Build finished. The pseudo-XML files are in $(BUILDDIR)/pseudoxml."
diff --git a/ps-lite/docs/api.md b/ps-lite/docs/api.md
deleted file mode 100644
index 3744989e..00000000
--- a/ps-lite/docs/api.md
+++ /dev/null
@@ -1,40 +0,0 @@
-# APIs
-
-
-The data communicated are presented as key-value
-  pairs, where the key might be the `uint64_t` (defined by `ps::Key`) feature
-  index and the value might be the according `float` gradient.
-  1. Basic synchronization functions: \ref ps::KVWorker::Push, \ref
-  ps::KVWorker::Pull, and \ref ps::KVWorker::Wait
-  2. Dynamic length value push and pull: \ref ps::KVWorker::VPush and \ref
-     ps::KVWorker::VPull
-  3. Zero-copy versions: \ref ps::KVWorker::ZPush, \ref
-     ps::KVWorker::ZPull, \ref ps::KVWorker::ZVPush and \ref
-     ps::KVWorker::ZVPull
-
-
-often server *i* handles the keys (feature indices) within the i-th
-  segment of <em>[0, uint64_max]</em>. The server node allows user-defined handles to
-  process the `push` and `pull` requests from the workers.
-  1. Online key-value store \ref ps::OnlineServer
-  2. Example user-defined value: \ref ps::IVal
-  3. Example user-defined handle: \ref ps::IOnlineHandle
-
-
-
-  also We can
-  also implement
-
-, which is often used to monitor and control the
-  progress of the machine learning application. It also can be used to deal with node
-  failures. See an example in [asynchronous SGD](https://github.com/dmlc/wormhole/blob/master/learn/solver/async_sgd.h#L27).
-
-```eval_rst
-.. automodule:: ps::KVWorker
-    :members:
-```
-
-```eval_rst
-.. doxygenstruct:: ps::KVPairs
-   :members:
-```
diff --git a/ps-lite/docs/conf.py b/ps-lite/docs/conf.py
deleted file mode 100644
index 20c93f67..00000000
--- a/ps-lite/docs/conf.py
+++ /dev/null
@@ -1,315 +0,0 @@
-# -*- coding: utf-8 -*-
-#
-# ps-lite documentation build configuration file, created by
-# sphinx-quickstart on Sun Mar 20 20:12:23 2016.
-#
-# Mu: additional changes
-#   - add breathe into extensions
-#   - change html theme into sphinx_rtd_theme
-#   - add sphnix_util.py
-#   - add .md into source_suffix
-#   - add setup() at the end
-#
-# This file is execfile()d with the current directory set to its
-# containing dir.
-#
-# Note that not all possible configuration values are present in this
-# autogenerated file.
-#
-# All configuration values have a default; values that are commented out
-# serve to show the default.
-
-
-import sys
-import os
-
-# If extensions (or modules to document with autodoc) are in another directory,
-# add these directories to sys.path here. If the directory is relative to the
-# documentation root, use os.path.abspath to make it absolute, like shown here.
-#sys.path.insert(0, os.path.abspath('.'))
-
-# -- General configuration ------------------------------------------------
-
-# If your documentation needs a minimal Sphinx version, state it here.
-#needs_sphinx = '1.0'
-
-# Add any Sphinx extension module names here, as strings. They can be
-# extensions coming with Sphinx (named 'sphinx.ext.*') or your custom
-# ones.
-extensions = [
-    'sphinx.ext.mathjax',
-    'breathe',
-]
-
-# Add any paths that contain templates here, relative to this directory.
-templates_path = ['_templates']
-
-# The suffix(es) of source filenames.
-# You can specify multiple suffix as a list of string:
-source_suffix = ['.md']
-# source_suffix = '.rst'
-
-# The encoding of source files.
-#source_encoding = 'utf-8-sig'
-
-# The master toctree document.
-master_doc = 'index'
-
-# General information about the project.
-project = u'ps-lite'
-copyright = u'2016, ps-lite developers'
-author = u'ps-lite developers'
-
-# The version info for the project you're documenting, acts as replacement for
-# |version| and |release|, also used in various other places throughout the
-# built documents.
-#
-# The short X.Y version.
-version = u'1.0'
-# The full version, including alpha/beta/rc tags.
-release = u'1.0'
-
-# The language for content autogenerated by Sphinx. Refer to documentation
-# for a list of supported languages.
-#
-# This is also used if you do content translation via gettext catalogs.
-# Usually you set "language" from the command line for these cases.
-language = None
-
-# There are two options for replacing |today|: either, you set today to some
-# non-false value, then it is used:
-#today = ''
-# Else, today_fmt is used as the format for a strftime call.
-#today_fmt = '%B %d, %Y'
-
-# List of patterns, relative to source directory, that match files and
-# directories to ignore when looking for source files.
-exclude_patterns = ['_build']
-
-# The reST default role (used for this markup: `text`) to use for all
-# documents.
-#default_role = None
-
-# If true, '()' will be appended to :func: etc. cross-reference text.
-#add_function_parentheses = True
-
-# If true, the current module name will be prepended to all description
-# unit titles (such as .. function::).
-#add_module_names = True
-
-# If true, sectionauthor and moduleauthor directives will be shown in the
-# output. They are ignored by default.
-#show_authors = False
-
-# The name of the Pygments (syntax highlighting) style to use.
-pygments_style = 'sphinx'
-
-# A list of ignored prefixes for module index sorting.
-#modindex_common_prefix = []
-
-# If true, keep warnings as "system message" paragraphs in the built documents.
-#keep_warnings = False
-
-# If true, `todo` and `todoList` produce output, else they produce nothing.
-todo_include_todos = False
-
-
-# -- Options for HTML output ----------------------------------------------
-
-# The theme to use for HTML and HTML Help pages.  See the documentation for
-# a list of builtin themes.
-html_theme = 'sphinx_rtd_theme'
-
-# Theme options are theme-specific and customize the look and feel of a theme
-# further.  For a list of options available for each theme, see the
-# documentation.
-#html_theme_options = {}
-
-# Add any paths that contain custom themes here, relative to this directory.
-#html_theme_path = []
-
-# The name for this set of Sphinx documents.  If None, it defaults to
-# "<project> v<release> documentation".
-#html_title = None
-
-# A shorter title for the navigation bar.  Default is the same as html_title.
-#html_short_title = None
-
-# The name of an image file (relative to this directory) to place at the top
-# of the sidebar.
-#html_logo = None
-
-# The name of an image file (relative to this directory) to use as a favicon of
-# the docs.  This file should be a Windows icon file (.ico) being 16x16 or 32x32
-# pixels large.
-#html_favicon = None
-
-# Add any paths that contain custom static files (such as style sheets) here,
-# relative to this directory. They are copied after the builtin static files,
-# so a file named "default.css" will overwrite the builtin "default.css".
-html_static_path = ['_static']
-
-# Add any extra paths that contain custom files (such as robots.txt or
-# .htaccess) here, relative to this directory. These files are copied
-# directly to the root of the documentation.
-#html_extra_path = []
-
-# If not '', a 'Last updated on:' timestamp is inserted at every page bottom,
-# using the given strftime format.
-#html_last_updated_fmt = '%b %d, %Y'
-
-# If true, SmartyPants will be used to convert quotes and dashes to
-# typographically correct entities.
-#html_use_smartypants = True
-
-# Custom sidebar templates, maps document names to template names.
-#html_sidebars = {}
-
-# Additional templates that should be rendered to pages, maps page names to
-# template names.
-#html_additional_pages = {}
-
-# If false, no module index is generated.
-#html_domain_indices = True
-
-# If false, no index is generated.
-#html_use_index = True
-
-# If true, the index is split into individual pages for each letter.
-#html_split_index = False
-
-# If true, links to the reST sources are added to the pages.
-#html_show_sourcelink = True
-
-# If true, "Created using Sphinx" is shown in the HTML footer. Default is True.
-#html_show_sphinx = True
-
-# If true, "(C) Copyright ..." is shown in the HTML footer. Default is True.
-#html_show_copyright = True
-
-# If true, an OpenSearch description file will be output, and all pages will
-# contain a <link> tag referring to it.  The value of this option must be the
-# base URL from which the finished HTML is served.
-#html_use_opensearch = ''
-
-# This is the file name suffix for HTML files (e.g. ".xhtml").
-#html_file_suffix = None
-
-# Language to be used for generating the HTML full-text search index.
-# Sphinx supports the following languages:
-#   'da', 'de', 'en', 'es', 'fi', 'fr', 'hu', 'it', 'ja'
-#   'nl', 'no', 'pt', 'ro', 'ru', 'sv', 'tr'
-#html_search_language = 'en'
-
-# A dictionary with options for the search language support, empty by default.
-# Now only 'ja' uses this config value
-#html_search_options = {'type': 'default'}
-
-# The name of a javascript file (relative to the configuration directory) that
-# implements a search results scorer. If empty, the default will be used.
-#html_search_scorer = 'scorer.js'
-
-# Output file base name for HTML help builder.
-htmlhelp_basename = 'ps-litedoc'
-
-# -- Options for LaTeX output ---------------------------------------------
-
-latex_elements = {
-# The paper size ('letterpaper' or 'a4paper').
-#'papersize': 'letterpaper',
-
-# The font size ('10pt', '11pt' or '12pt').
-#'pointsize': '10pt',
-
-# Additional stuff for the LaTeX preamble.
-#'preamble': '',
-
-# Latex figure (float) alignment
-#'figure_align': 'htbp',
-}
-
-# Grouping the document tree into LaTeX files. List of tuples
-# (source start file, target name, title,
-#  author, documentclass [howto, manual, or own class]).
-latex_documents = [
-    (master_doc, 'ps-lite.tex', u'ps-lite Documentation',
-     u'ps-lite developers', 'manual'),
-]
-
-# The name of an image file (relative to this directory) to place at the top of
-# the title page.
-#latex_logo = None
-
-# For "manual" documents, if this is true, then toplevel headings are parts,
-# not chapters.
-#latex_use_parts = False
-
-# If true, show page references after internal links.
-#latex_show_pagerefs = False
-
-# If true, show URL addresses after external links.
-#latex_show_urls = False
-
-# Documents to append as an appendix to all manuals.
-#latex_appendices = []
-
-# If false, no module index is generated.
-#latex_domain_indices = True
-
-
-# -- Options for manual page output ---------------------------------------
-
-# One entry per manual page. List of tuples
-# (source start file, name, description, authors, manual section).
-man_pages = [
-    (master_doc, 'ps-lite', u'ps-lite Documentation',
-     [author], 1)
-]
-
-# If true, show URL addresses after external links.
-#man_show_urls = False
-
-
-# -- Options for Texinfo output -------------------------------------------
-
-# Grouping the document tree into Texinfo files. List of tuples
-# (source start file, target name, title, author,
-#  dir menu entry, description, category)
-texinfo_documents = [
-    (master_doc, 'ps-lite', u'ps-lite Documentation',
-     author, 'ps-lite', 'One line description of project.',
-     'Miscellaneous'),
-]
-
-# Documents to append as an appendix to all manuals.
-#texinfo_appendices = []
-
-# If false, no module index is generated.
-#texinfo_domain_indices = True
-
-# How to display URL addresses: 'footnote', 'no', or 'inline'.
-#texinfo_show_urls = 'footnote'
-
-# If true, do not generate a @detailmenu in the "Top" node's menu.
-#texinfo_no_detailmenu = False
-
-curr_path = os.path.dirname(os.path.abspath(os.path.expanduser(__file__)))
-sys.path.insert(0, curr_path)
-from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml
-
-MarkdownParser.github_doc_root = 'https://github.com/dmlc/ps-lite/tree/master/'
-source_parsers = {
-    '.md': MarkdownParser,
-    '.Rmd': MarkdownParser,
-}
-
-breathe_projects = {'ps-lite' : 'xml/'}
-breathe_default_project = 'ps-lite'
-
-doc_root = 'http://dmlc.ml'
-def setup(app):
-    app.connect("builder-inited", generate_doxygen_xml)
-    app.add_config_value('recommonmark_config', {
-            'url_resolver': lambda url: doc_root + url,
-            }, True)
-    app.add_transform(AutoStructify)
diff --git a/ps-lite/docs/env.md b/ps-lite/docs/env.md
deleted file mode 100644
index 758c77b6..00000000
--- a/ps-lite/docs/env.md
+++ /dev/null
@@ -1,15 +0,0 @@
-# environment variables
-
-The variables must be set for starting
-
-- `DMLC_NUM_WORKER` : the number of workers
-- `DMLC_NUM_SERVER` : the number of servers
-- `DMLC_ROLE` : the role of the current node, can be `worker`, `server`, or `scheduler`
-- `DMLC_PS_ROOT_URI` : the ip or hostname of the scheduler node
-- `DMLC_PS_ROOT_PORT` : the port that the scheduler node is listening
-
-additional variables:
-
-- `DMLC_INTERFACE` : the network interface a node should use. in default choose
-  automatically
-- `DMLC_LOCAL` : runs in local machines, no network is needed
diff --git a/ps-lite/docs/get_started.md b/ps-lite/docs/get_started.md
deleted file mode 100644
index 7e0bdcaa..00000000
--- a/ps-lite/docs/get_started.md
+++ /dev/null
@@ -1 +0,0 @@
-# Get Started
diff --git a/ps-lite/docs/how_to.md b/ps-lite/docs/how_to.md
deleted file mode 100644
index f5f7e435..00000000
--- a/ps-lite/docs/how_to.md
+++ /dev/null
@@ -1,74 +0,0 @@
-# How To
-
-## Debug PS-Lite
-
-One way to debug is loggining all communications. We can do it by specifying
-the environment variable `PS_VERBOSE`:
-- `PS_VERBOSE=1`: logging connection information
-- `PS_VERBOSE=2`: logging all data communication information
-
-For example, first run `make test; cd tests` in the root directory. Then
-```bash
-export PS_VERBOSE=1; ./local.sh 1 1 ./test_connection
-```
-Possible outputs are
-```bash
-[19:57:18] src/van.cc:72: Node Info: role=schedulerid=1, ip=127.0.0.1, port=8000
-[19:57:18] src/van.cc:72: Node Info: role=worker, ip=128.2.211.110, port=58442
-[19:57:18] src/van.cc:72: Node Info: role=server, ip=128.2.211.110, port=40112
-[19:57:18] src/van.cc:336: assign rank=8 to node role=server, ip=128.2.211.110, port=40112
-[19:57:18] src/van.cc:336: assign rank=9 to node role=worker, ip=128.2.211.110, port=58442
-[19:57:18] src/van.cc:347: the scheduler is connected to 1 workers and 1 servers
-[19:57:18] src/van.cc:354: S[8] is connected to others
-[19:57:18] src/van.cc:354: W[9] is connected to others
-[19:57:18] src/van.cc:296: H[1] is stopped
-[19:57:18] src/van.cc:296: S[8] is stopped
-[19:57:18] src/van.cc:296: W[9] is stopped
-```
-where `H`, `S` and `W` stand for scheduler, server, and worker respectively.
-
-## Use a Particular Network Interface
-
-In default PS-Lite automatically chooses an available network interface. But for
-machines have multiple interfaces, we can specify the network interface to use
-by the environment variable `DMLC_INTERFACE`. For example, to use the
-infinite-band interface `ib0`, we can
-```bash
-export DMLC_INTERFACE=ib0; commands_to_run
-```
-
-If all PS-Lite nodes run in the same machine, we can set `DMLC_LOCAL` to use
-memory copy rather than the local network interface, which may improve the
-performance:
-```bash
-export DMLC_LOCAL=1; commands_to_run
-```
-
-## Environment Variables to Start PS-Lite
-
-This section is useful if we want to port PS-Lite to other cluster resource
-managers besides the provided ones such as `ssh`, `mpirun`, `yarn` and `sge`.
-
-To start a PS-Lite node, we need to give proper values to the following
-environment variables.
-- `DMLC_NUM_WORKER` : the number of workers
-- `DMLC_NUM_SERVER` : the number of servers
-- `DMLC_ROLE` : the role of the current node, can be `worker`, `server`, or `scheduler`
-- `DMLC_PS_ROOT_URI` : the ip or hostname of the scheduler node
-- `DMLC_PS_ROOT_PORT` : the port that the scheduler node is listening
-
-## Retransmission for Unreliable Network
-
-It's not uncommon that a message disappear when sending from one node to another
-node. The program hangs when a critical message is not delivered
-successfully. In that case, we can let PS-Lite send an additional ACK for each
-message, and resend that message if the ACK is not received within a given
-time. To enable this feature, we can set the environment variables
-
-- `PS_RESEND` : if or not enable retransmission. Default is 0.
-- `PS_RESEND_TIMEOUT` : timeout in millisecond if an ACK message if not
-  received. PS-Lite then will resend that message. Default is 1000.
-
-We can set `PS_DROP_MSG`, the percent of probability to drop a received
-message, for testing. For example, `PS_DROP_MSG=10` will let a node drop a
-received message with 10% probability.
diff --git a/ps-lite/docs/index.md b/ps-lite/docs/index.md
deleted file mode 100644
index d0ac46ed..00000000
--- a/ps-lite/docs/index.md
+++ /dev/null
@@ -1,16 +0,0 @@
-# PS-Lite Documents
-
-PS-Lite is a lightweight implementation of the parameter server.  It provides
-asynchronous and zero-copy key-value pair communications between machines.
-
-
-```eval_rst
-.. toctree::
-   :numbered:
-
-   overview
-   get_started
-   tutorials
-   how_to
-   api
-```
diff --git a/ps-lite/docs/overview.md b/ps-lite/docs/overview.md
deleted file mode 100644
index 28b79e37..00000000
--- a/ps-lite/docs/overview.md
+++ /dev/null
@@ -1,184 +0,0 @@
-# Overview
-
-The parameter server aims for high-performance distributed machine learning
-applications. In this framework, multiple nodes runs over multiple machines to
-solve machine learning problems.
-There are often a single schedule node, and several worker and servers nodes.
-
-![ps arch](https://raw.githubusercontent.com/dmlc/dmlc.github.io/master/img/ps-arch.png)
-
-- **Worker**. A worker node performs the main computations such as reading the data and
-  computing the gradient. It communicates with the server nodes via `push` and
-  `pull`. For example, it pushes the computed gradient to the servers, or pulls
-  the recent model from them.
-
-- **Server.** A server node maintains and updates the model weights. Each node maintains only a part
-  of the model.
-
-- **Scheduler.** The scheduler node monitors the aliveness of other nodes. It can
-  be also used to send control signals to other nodes and collect their
-  progress.
-
-
-## Distributed Optimization
-
-Assume we are going to solve the following
-```eval_rst
-.. math::
-  \min_w \sum_{i=1}^n f(x_i, y_i, w)
-```
-where *(y<sub>i</sub>, x<sub>i</sub>)* are example pairs and *w* is the weight.
-
-We consider solve the above problem by minibatch stochastic gradient descent
-(SGD) with batch size *b*. At time *t*, this algorithm first randomly picks up
-*b* examples, and then updates the weight *w* by
-```eval_rst
-.. math::
-  w = w - \eta_t \sum_{i=1}^b \nabla f(x_{k_i}, y_{k_i}, w)
-```
-
-We give two examples to illusrate the basic idea of how to implement a
-distributed optimization algorithm in ps-lite.
-
-### Asynchronous SGD
-
-In the first example, we extend SGD into asynchronous SGD.  We let the servers
-maintain *w*, where server *k* gets the *k*-th segment of *w*, denoted by
-*w<sub>k<\sub>*. Once received gradient from a worker, the server *k* will
-update the weight it maintained:
-
-```c++
-t = 0;
-while (Received(&grad)) {
-  w_k -= eta(t) * grad;
-  t++;
-}
-```
-where the function `received` returns if received gradient from any worker
-node, and `eta` returns the learning rate at time *t*.
-
-While for a worker, each time it dose four things
-
-```c++
-Read(&X, &Y);  // read a minibatch X and Y
-Pull(&w);      // pull the recent weight from the servers
-ComputeGrad(X, Y, w, &grad);  // compute the gradient
-Push(grad);    // push the gradients to the servers
-```
-where ps-lite will provide function `push` and `pull` which will communicate
-with servers with the right part of data.
-
-Note that asynchronous SGD is semantically different the single machine
-version. Since there is no communication between workers, so it is possible that
-the weight is updated while one worker is calculating the gradients. In other
-words, each worker may used the **delayed** weights. The following figure
-shows the communication with 2 server nodes and 3 worker nodes.
-
-<img src="https://raw.githubusercontent.com/dmlc/web-data/master/ps-lite/async_sgd.png"  width=500 />
-
-
-### Synchronized SGD
-
-Different to the asynchronous version, now we consider a synchronized version,
-which is semantically identical to the single machine algorithm. We use the
-scheduler to manage the data synchronization
-
-```c++
-for (t = 0, t < num_iteration; ++t) {
-  for (i = 0; i < num_worker; ++i) {
-     IssueComputeGrad(i, t);
-  }
-  for (i = 0; i < num_server; ++i) {
-     IssueUpdateWeight(i, t);
-  }
-  WaitAllFinished();
-}
-```
-
-where `IssueComputeGrad` and `IssueUpdateWeight` issue commands to worker and
-servers, while `WaitAllFinished` wait until all issued commands are finished.
-
-When worker received a command, it executes the following function,
-```c++
-ExecComputeGrad(i, t) {
-   Read(&X, &Y);  // read minibatch with b / num_workers examples
-   Pull(&w);      // pull the recent weight from the servers
-   ComputeGrad(X, Y, w, &grad);  // compute the gradient
-   Push(grad);    // push the gradients to the servers
-}
-```
-which is almost identical to asynchronous SGD but only *b/num_workers* examples
-are processed each time.
-
-While for a server node, it has an additional aggregation step comparing to
-asynchronous SGD
-
-```c++
-ExecUpdateWeight(i, t) {
-   for (j = 0; j < num_workers; ++j) {
-      Receive(&grad);
-      aggregated_grad += grad;
-   }
-   w_i -= eta(t) * aggregated_grad;
-}
-```
-
-### Which one to use?
-
-Comparing to a single machine algorithm, the distributed algorithms have two
-additional costs, one is the data communication cost, namely sending data over
-the network; the other one is synchronization cost due to the imperfect load
-balance and performance variance cross machines. These two costs may dominate
-the performance for large scale applications with hundreds of machines and
-terabytes of data.
-
-Assume denotations:
-```eval_rst
-======================== ===
-:math:`{f}`              convex function
-:math:`{n}`              number of examples
-:math:`{m}`              number of workers
-:math:`{b}`              minibatch size
-:math:`{\tau}`           maximal delay
-:math:`T_{\text{comm}}`  data communication overhead of one minibatch
-:math:`T_{\text{sync}}`  synchronization overhead
-======================== ===
-```
-
-The trade-offs are summarized by
-```eval_rst
-============ ========================= ===================
-SGD          slowdown of convergence   additional overhead
-============ ========================= ===================
-synchronized  :math:`\sqrt{b}`         :math:`\frac {n}b (T_{\text{comm}} + T_{\textrm{sync}})`
-asynchronous  :math:`\sqrt{b\tau}`     :math:`\frac n{mb} T_{\textrm{comm}}`
-============ ========================= ===================
-```
-
-What we can see are
-- the minibatch size trade-offs the convergence and communication cost
-- the maximal allowed delay trade-offs the convergence and synchronization
-  cost. In synchronized SGD, we have *τ=0* and therefore it suffers a large
-  synchronization cost. While asynchronous SGD uses an infinite *τ* to eliminate
-  this cost. In practice, an infinite *τ* is unlikely happens. But we also place
-  a upper bound of *τ* to guarantee the convergence with some synchronization
-  costs.
-
-## Further Reads
-
-Distributed optimization algorithm is an active research topic these years. To
-name some of them
-
-- [Dean, NIPS'13](), [Li, OSDI'14]() The parameter server architecture
-- [Langford, NIPS'09](https://papers.nips.cc/paper/3888-slow-learners-are-fast.pdf),
-  [Agarwal, NIPS'11](http://arxiv.org/pdf/1104.5525.pdf) theoretical convergence
-  of asynchronous SGD
-- [Li, NIPS'14](http://www.cs.cmu.edu/~muli/file/parameter_server_nips14.pdf)
-  trade-offs with bounded maximal delays *τ*
-- [Li, KDD'14](http://www.cs.cmu.edu/~muli/file/minibatch_sgd.pdf) improves the
-  convergence rate with large minibatch size *b*
-- [Sra, AISTATS'16](http://arxiv.org/abs/1508.05003) asynchronous SGD adaptive
-  to the actually delay rather than the worst maximal delay
-- [Li, WSDM'16](http://www.cs.cmu.edu/~yuxiangw/docs/fm.pdf) practical
-  considerations for asynchronous SGD with the parameter server
-- [Chen, LearningSys'16]() synchronized SGD for deep learning.
diff --git a/ps-lite/docs/requirements.txt b/ps-lite/docs/requirements.txt
deleted file mode 100644
index cd6467ed..00000000
--- a/ps-lite/docs/requirements.txt
+++ /dev/null
@@ -1 +0,0 @@
-breathe
diff --git a/ps-lite/docs/sphinx_util.py b/ps-lite/docs/sphinx_util.py
deleted file mode 100644
index 414dc594..00000000
--- a/ps-lite/docs/sphinx_util.py
+++ /dev/null
@@ -1,19 +0,0 @@
-import sys, os, subprocess
-
-
-if not os.path.exists('../recommonmark'):
-    subprocess.call('cd ..; git clone https://github.com/tqchen/recommonmark', shell = True)
-else:
-    subprocess.call('cd ../recommonmark; git pull', shell=True)
-
-sys.path.insert(0, os.path.abspath('../recommonmark/'))
-
-from recommonmark import parser, transform
-MarkdownParser = parser.CommonMarkParser
-AutoStructify = transform.AutoStructify
-
-# MarkdownParser.github_doc_root = github_doc_root
-
-def generate_doxygen_xml(app):
-    """Run the doxygen make commands"""
-    subprocess.call('doxygen')
diff --git a/ps-lite/docs/tutorials.md b/ps-lite/docs/tutorials.md
deleted file mode 100644
index 81c8590f..00000000
--- a/ps-lite/docs/tutorials.md
+++ /dev/null
@@ -1 +0,0 @@
-# Tutorials
diff --git a/ps-lite/include/dmlc/base.h b/ps-lite/include/dmlc/base.h
deleted file mode 100644
index f3ae0fe8..00000000
--- a/ps-lite/include/dmlc/base.h
+++ /dev/null
@@ -1,178 +0,0 @@
-/*!
- *  Copyright (c) 2015 by Contributors
- * \file base.h
- * \brief defines configuration macros
- */
-#ifndef DMLC_BASE_H_
-#define DMLC_BASE_H_
-
-/*! \brief whether use glog for logging */
-#ifndef DMLC_USE_GLOG
-#define DMLC_USE_GLOG 0
-#endif
-
-/*!
- * \brief whether throw dmlc::Error instead of
- *  directly calling abort when FATAL error occured
- *  NOTE: this may still not be perfect.
- *  do not use FATAL and CHECK in destructors
- */
-#ifndef DMLC_LOG_FATAL_THROW
-#define DMLC_LOG_FATAL_THROW 1
-#endif
-
-/*! \brief whether compile with hdfs support */
-#ifndef DMLC_USE_HDFS
-#define DMLC_USE_HDFS 0
-#endif
-
-/*! \brief whether compile with s3 support */
-#ifndef DMLC_USE_S3
-#define DMLC_USE_S3 0
-#endif
-
-/*! \brief whether or not use parameter server */
-#ifndef DMLC_USE_PS
-#define DMLC_USE_PS 0
-#endif
-
-/*! \brief whether or not use c++11 support */
-#ifndef DMLC_USE_CXX11
-#define DMLC_USE_CXX11 (defined(__GXX_EXPERIMENTAL_CXX0X__) ||\
-                        __cplusplus >= 201103L || defined(_MSC_VER))
-#endif
-
-/// check if g++ is before 4.6
-#if DMLC_USE_CXX11 && defined(__GNUC__) && !defined(__clang_version__)
-#if __GNUC__ == 4 && __GNUC_MINOR__ < 6
-#pragma message("Will need g++-4.6 or higher to compile all"           \
-                "the features in dmlc-core, "                           \
-                "compile without c++0x, some features may be disabled")
-#undef DMLC_USE_CXX11
-#define DMLC_USE_CXX11 0
-#endif
-#endif
-
-/*!
- * \brief Disable copy constructor and assignment operator.
- *
- * If C++11 is supported, both copy and move constructors and
- * assignment operators are deleted explicitly. Otherwise, they are
- * only declared but not implemented. Place this macro in private
- * section if C++11 is not available.
- */
-#ifndef DISALLOW_COPY_AND_ASSIGN
-#  if DMLC_USE_CXX11
-#    define DISALLOW_COPY_AND_ASSIGN(T) \
-       T(T const&) = delete; \
-       T(T&&) = delete; \
-       T& operator=(T const&) = delete; \
-       T& operator=(T&&) = delete
-#  else
-#    define DISALLOW_COPY_AND_ASSIGN(T) \
-       T(T const&); \
-       T& operator=(T const&)
-#  endif
-#endif
-
-///
-/// code block to handle optionally loading
-///
-#if !defined(__GNUC__)
-#define fopen64 std::fopen
-#endif
-#ifdef _MSC_VER
-#if _MSC_VER < 1900
-// NOTE: sprintf_s is not equivalent to snprintf,
-// they are equivalent when success, which is sufficient for our case
-#define snprintf sprintf_s
-#define vsnprintf vsprintf_s
-#endif
-#else
-#ifdef _FILE_OFFSET_BITS
-#if _FILE_OFFSET_BITS == 32
-#pragma message("Warning: FILE OFFSET BITS defined to be 32 bit")
-#endif
-#endif
-
-#ifdef __APPLE__
-#define off64_t off_t
-#define fopen64 std::fopen
-#endif
-
-extern "C" {
-#include <sys/types.h>
-}
-#endif
-
-#ifdef _MSC_VER
-//! \cond Doxygen_Suppress
-typedef signed char int8_t;
-typedef __int16 int16_t;
-typedef __int32 int32_t;
-typedef __int64 int64_t;
-typedef unsigned char uint8_t;
-typedef unsigned __int16 uint16_t;
-typedef unsigned __int32 uint32_t;
-typedef unsigned __int64 uint64_t;
-//! \endcond
-#else
-#include <inttypes.h>
-#endif
-#include <string>
-#include <vector>
-
-/*! \brief namespace for dmlc */
-namespace dmlc {
-/*!
- * \brief safely get the beginning address of a vector
- * \param vec input vector
- * \return beginning address of a vector
- */
-template<typename T>
-inline T *BeginPtr(std::vector<T> &vec) {  // NOLINT(*)
-  if (vec.size() == 0) {
-    return NULL;
-  } else {
-    return &vec[0];
-  }
-}
-/*!
- * \brief get the beginning address of a vector
- * \param vec input vector
- * \return beginning address of a vector
- */
-template<typename T>
-inline const T *BeginPtr(const std::vector<T> &vec) {
-  if (vec.size() == 0) {
-    return NULL;
-  } else {
-    return &vec[0];
-  }
-}
-/*!
- * \brief get the beginning address of a vector
- * \param str input string
- * \return beginning address of a string
- */
-inline char* BeginPtr(std::string &str) {  // NOLINT(*)
-  if (str.length() == 0) return NULL;
-  return &str[0];
-}
-/*!
- * \brief get the beginning address of a vector
- * \param str input string
- * \return beginning address of a string
- */
-inline const char* BeginPtr(const std::string &str) {
-  if (str.length() == 0) return NULL;
-  return &str[0];
-}
-}  // namespace dmlc
-
-#if defined(_MSC_VER) && _MSC_VER < 1900
-#define constexpr const
-#define alignof __alignof
-#endif
-
-#endif  // DMLC_BASE_H_
diff --git a/ps-lite/include/dmlc/logging.h b/ps-lite/include/dmlc/logging.h
deleted file mode 100644
index 2ad530ff..00000000
--- a/ps-lite/include/dmlc/logging.h
+++ /dev/null
@@ -1,234 +0,0 @@
-/*!
- *  Copyright (c) 2015 by Contributors
- * \file logging.h
- * \brief defines logging macros of dmlc
- *  allows use of GLOG, fall back to internal
- *  implementation when disabled
- */
-#ifndef DMLC_LOGGING_H_
-#define DMLC_LOGGING_H_
-#include <cstdio>
-#include <cstdlib>
-#include <string>
-#include <vector>
-#include <stdexcept>
-#include "./base.h"
-
-namespace dmlc {
-/*!
- * \brief exception class that will be thrown by
- *  default logger if DMLC_LOG_FATAL_THROW == 1
- */
-struct Error : public std::runtime_error {
-  /*!
-   * \brief constructor
-   * \param s the error message
-   */
-  explicit Error(const std::string &s) : std::runtime_error(s) {}
-};
-}  // namespace dmlc
-
-#if defined(_MSC_VER) && _MSC_VER < 1900
-#define noexcept(a)
-#endif
-
-#if DMLC_USE_CXX11
-#define DMLC_THROW_EXCEPTION noexcept(false)
-#else
-#define DMLC_THROW_EXCEPTION
-#endif
-
-#if DMLC_USE_GLOG
-#include <glog/logging.h>
-
-namespace dmlc {
-inline void InitLogging(const char* argv0) {
-  google::InitGoogleLogging(argv0);
-}
-}  // namespace dmlc
-
-#else
-// use a light version of glog
-#include <assert.h>
-#include <iostream>
-#include <sstream>
-#include <ctime>
-
-#if defined(_MSC_VER)
-#pragma warning(disable : 4722)
-#endif
-
-namespace dmlc {
-inline void InitLogging(const char* argv0) {
-  // DO NOTHING
-}
-
-// Always-on checking
-#define CHECK(x)                                           \
-  if (!(x))                                                \
-    dmlc::LogMessageFatal(__FILE__, __LINE__).stream() << "Check "  \
-      "failed: " #x << ' '
-#define CHECK_LT(x, y) CHECK((x) < (y))
-#define CHECK_GT(x, y) CHECK((x) > (y))
-#define CHECK_LE(x, y) CHECK((x) <= (y))
-#define CHECK_GE(x, y) CHECK((x) >= (y))
-#define CHECK_EQ(x, y) CHECK((x) == (y))
-#define CHECK_NE(x, y) CHECK((x) != (y))
-#define CHECK_NOTNULL(x) \
-  ((x) == NULL ? dmlc::LogMessageFatal(__FILE__, __LINE__).stream() << "Check  notnull: "  #x << ' ', (x) : (x)) // NOLINT(*)
-// Debug-only checking.
-#ifdef NDEBUG
-#define DCHECK(x) \
-  while (false) CHECK(x)
-#define DCHECK_LT(x, y) \
-  while (false) CHECK((x) < (y))
-#define DCHECK_GT(x, y) \
-  while (false) CHECK((x) > (y))
-#define DCHECK_LE(x, y) \
-  while (false) CHECK((x) <= (y))
-#define DCHECK_GE(x, y) \
-  while (false) CHECK((x) >= (y))
-#define DCHECK_EQ(x, y) \
-  while (false) CHECK((x) == (y))
-#define DCHECK_NE(x, y) \
-  while (false) CHECK((x) != (y))
-#else
-#define DCHECK(x) CHECK(x)
-#define DCHECK_LT(x, y) CHECK((x) < (y))
-#define DCHECK_GT(x, y) CHECK((x) > (y))
-#define DCHECK_LE(x, y) CHECK((x) <= (y))
-#define DCHECK_GE(x, y) CHECK((x) >= (y))
-#define DCHECK_EQ(x, y) CHECK((x) == (y))
-#define DCHECK_NE(x, y) CHECK((x) != (y))
-#endif  // NDEBUG
-
-#define LOG_INFO dmlc::LogMessage(__FILE__, __LINE__)
-#define LOG_ERROR LOG_INFO
-#define LOG_WARNING LOG_INFO
-#define LOG_FATAL dmlc::LogMessageFatal(__FILE__, __LINE__)
-#define LOG_QFATAL LOG_FATAL
-
-// Poor man version of VLOG
-#define VLOG(x) LOG_INFO.stream()
-
-#define LOG(severity) LOG_##severity.stream()
-#define LG LOG_INFO.stream()
-#define LOG_IF(severity, condition) \
-  !(condition) ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
-
-#ifdef NDEBUG
-#define LOG_DFATAL LOG_ERROR
-#define DFATAL ERROR
-#define DLOG(severity) true ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
-#define DLOG_IF(severity, condition) \
-  (true || !(condition)) ? (void)0 : dmlc::LogMessageVoidify() & LOG(severity)
-#else
-#define LOG_DFATAL LOG_FATAL
-#define DFATAL FATAL
-#define DLOG(severity) LOG(severity)
-#define DLOG_IF(severity, condition) LOG_IF(severity, condition)
-#endif
-
-// Poor man version of LOG_EVERY_N
-#define LOG_EVERY_N(severity, n) LOG(severity)
-
-class DateLogger {
- public:
-  DateLogger() {
-#if defined(_MSC_VER)
-    _tzset();
-#endif
-  }
-  const char* HumanDate() {
-#if defined(_MSC_VER)
-    _strtime_s(buffer_, sizeof(buffer_));
-#else
-    time_t time_value = time(NULL);
-    struct tm now;
-    localtime_r(&time_value, &now);
-    snprintf(buffer_, sizeof(buffer_), "%02d:%02d:%02d", now.tm_hour,
-             now.tm_min, now.tm_sec);
-#endif
-    return buffer_;
-  }
- private:
-  char buffer_[9];
-};
-
-class LogMessage {
- public:
-  LogMessage(const char* file, int line)
-      :
-#ifdef __ANDROID__
-        log_stream_(std::cout)
-#else
-        log_stream_(std::cerr)
-#endif
-  {
-    log_stream_ << "[" << pretty_date_.HumanDate() << "] " << file << ":"
-                << line << ": ";
-  }
-  ~LogMessage() { log_stream_ << "\n"; }
-  std::ostream& stream() { return log_stream_; }
-
- protected:
-  std::ostream& log_stream_;
-
- private:
-  DateLogger pretty_date_;
-  LogMessage(const LogMessage&);
-  void operator=(const LogMessage&);
-};
-
-#if DMLC_LOG_FATAL_THROW == 0
-class LogMessageFatal : public LogMessage {
- public:
-  LogMessageFatal(const char* file, int line) : LogMessage(file, line) {}
-  ~LogMessageFatal() {
-    log_stream_ << "\n";
-    abort();
-  }
-
- private:
-  LogMessageFatal(const LogMessageFatal&);
-  void operator=(const LogMessageFatal&);
-};
-#else
-class LogMessageFatal {
- public:
-  LogMessageFatal(const char* file, int line) {
-    log_stream_ << "[" << pretty_date_.HumanDate() << "] " << file << ":"
-                << line << ": ";
-  }
-  std::ostringstream &stream() { return log_stream_; }
-  ~LogMessageFatal() DMLC_THROW_EXCEPTION {
-    // throwing out of destructor is evil
-    // hopefully we can do it here
-    // also log the message before throw
-    LOG(ERROR) << log_stream_.str();
-    throw Error(log_stream_.str());
-  }
-
- private:
-  std::ostringstream log_stream_;
-  DateLogger pretty_date_;
-  LogMessageFatal(const LogMessageFatal&);
-  void operator=(const LogMessageFatal&);
-};
-#endif
-
-// This class is used to explicitly ignore values in the conditional
-// logging macros.  This avoids compiler warnings like "value computed
-// is not used" and "statement has no effect".
-class LogMessageVoidify {
- public:
-  LogMessageVoidify() {}
-  // This has to be an operator with a precedence lower than << but
-  // higher than "?:". See its usage.
-  void operator&(std::ostream&) {}
-};
-
-}  // namespace dmlc
-
-#endif
-#endif  // DMLC_LOGGING_H_
diff --git a/ps-lite/include/ps/base.h b/ps-lite/include/ps/base.h
deleted file mode 100644
index a18b62ce..00000000
--- a/ps-lite/include/ps/base.h
+++ /dev/null
@@ -1,33 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_BASE_H_
-#define PS_BASE_H_
-#include <limits>
-#include "ps/internal/utils.h"
-namespace ps {
-
-#if USE_KEY32
-/*! \brief Use unsigned 32-bit int as the key type */
-using Key = uint32_t;
-#else
-/*! \brief Use unsigned 64-bit int as the key type */
-using Key = uint64_t;
-#endif
-/*! \brief The maximal allowed key value */
-static const Key kMaxKey = std::numeric_limits<Key>::max();
-/** \brief node ID for the scheduler */
-static const int kScheduler = 1;
-/**
- * \brief the server node group ID
- *
- * group id can be combined:
- * - kServerGroup + kScheduler means all server nodes and the scheuduler
- * - kServerGroup + kWorkerGroup means all server and worker nodes
- */
-static const int kServerGroup = 2;
-/** \brief the worker node group ID */
-static const int kWorkerGroup = 4;
-
-}  // namespace ps
-#endif  // PS_BASE_H_
diff --git a/ps-lite/include/ps/internal/assign_op.h b/ps-lite/include/ps/internal/assign_op.h
deleted file mode 100644
index 834f523e..00000000
--- a/ps-lite/include/ps/internal/assign_op.h
+++ /dev/null
@@ -1,72 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- * \file   assign_op.h
- * \brief  assignment operator
- * http://en.cppreference.com/w/cpp/language/operator_assignment
- */
-#ifndef PS_INTERNAL_ASSIGN_OP_H_
-#define PS_INTERNAL_ASSIGN_OP_H_
-#include "ps/internal/utils.h"
-namespace ps {
-
-enum AssignOp {
-  ASSIGN,  // a = b
-  PLUS,    // a += b
-  MINUS,   // a -= b
-  TIMES,   // a *= b
-  DIVIDE,  // a -= b
-  AND,     // a &= b
-  OR,      // a |= b
-  XOR      // a ^= b
-};
-
-/**
- * \brief return an assignment function: right op= left
- */
-template<typename T>
-inline void AssignFunc(const T& lhs, AssignOp op, T* rhs) {
-  switch (op) {
-    case ASSIGN:
-      *right = left; break;
-    case PLUS:
-      *right += left; break;
-    case MINUS:
-      *right -= left; break;
-    case TIMES:
-      *right *= left; break;
-    case DIVIDE:
-      *right /= left; break;
-    default:
-      LOG(FATAL) << "use AssignOpInt..";
-  }
-}
-
-/**
- * \brief return an assignment function including bit operations, only
- * works for integers
- */
-template<typename T>
-inline void AssignFuncInt(const T& lhs, AssignOp op, T* rhs) {
-  switch (op) {
-    case ASSIGN:
-      *right = left; break;
-    case PLUS:
-      *right += left; break;
-    case MINUS:
-      *right -= left; break;
-    case TIMES:
-      *right *= left; break;
-    case DIVIDE:
-      *right /= left; break;
-    case AND:
-      *right &= left; break;
-    case OR:
-      *right |= left; break;
-    case XOR:
-      *right ^= left; break;
-  }
-}
-
-
-}  // namespace ps
-#endif  // PS_INTERNAL_ASSIGN_OP_H_
diff --git a/ps-lite/include/ps/internal/customer.h b/ps-lite/include/ps/internal/customer.h
deleted file mode 100644
index c87c288a..00000000
--- a/ps-lite/include/ps/internal/customer.h
+++ /dev/null
@@ -1,102 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_CUSTOMER_H_
-#define PS_INTERNAL_CUSTOMER_H_
-#include <mutex>
-#include <vector>
-#include <utility>
-#include <atomic>
-#include <condition_variable>
-#include <functional>
-#include <thread>
-#include <memory>
-#include "ps/internal/message.h"
-#include "ps/internal/threadsafe_queue.h"
-namespace ps {
-
-/**
- * \brief The object for communication.
- *
- * As a sender, a customer tracks the responses for each request sent.
- *
- * It has its own receiving thread which is able to process any message received
- * from a remote node with `msg.meta.customer_id` equal to this customer's id
- */
-class Customer {
- public:
-  /**
-   * \brief the handle for a received message
-   * \param recved the received message
-   */
-  using RecvHandle = std::function<void(const Message& recved)>;
-
-  /**
-   * \brief constructor
-   * \param id the unique id, any received message with
-   * \param recv_handle the functino for processing a received message
-   */
-  Customer(int id, const RecvHandle& recv_handle);
-
-  /**
-   * \brief desconstructor
-   */
-  ~Customer();
-
-  /**
-   * \brief return the unique id
-   */
-  int id() { return id_; }
-
-  /**
-   * \brief get a timestamp for a new request. threadsafe
-   * \param recver the receive node id of this request
-   * \return the timestamp of this request
-   */
-  int NewRequest(int recver);
-
-
-  /**
-   * \brief wait until the request is finished. threadsafe
-   * \param timestamp the timestamp of the request
-   */
-  void WaitRequest(int timestamp);
-
-  /**
-   * \brief return the number of responses received for the request. threadsafe
-   * \param timestamp the timestamp of the request
-   */
-  int NumResponse(int timestamp);
-
-  /**
-   * \brief add a number of responses to timestamp
-   */
-  void AddResponse(int timestamp, int num = 1);
-
-  /**
-   * \brief accept a received message from \ref Van. threadsafe
-   * \param recved the received the message
-   */
-  void Accept(const Message& recved) { recv_queue_.Push(recved); }
-
- private:
-  /**
-   * \brief the thread function
-   */
-  void Receiving();
-
-  int id_;
-
-  RecvHandle recv_handle_;
-  ThreadsafeQueue<Message> recv_queue_;
-  std::unique_ptr<std::thread> recv_thread_;
-
-  std::mutex tracker_mu_;
-  std::condition_variable tracker_cond_;
-  std::vector<std::pair<int, int>> tracker_;
-
-  DISALLOW_COPY_AND_ASSIGN(Customer);
-};
-
-}  // namespace ps
-#endif  // PS_INTERNAL_CUSTOMER_H_
diff --git a/ps-lite/include/ps/internal/env.h b/ps-lite/include/ps/internal/env.h
deleted file mode 100644
index ea7952d4..00000000
--- a/ps-lite/include/ps/internal/env.h
+++ /dev/null
@@ -1,63 +0,0 @@
-/**
- * Copyright (c) 2016 by Contributors
- */
-#ifndef PS_INTERNAL_ENV_H_
-#define PS_INTERNAL_ENV_H_
-#include <cstdlib>
-#include <unordered_map>
-#include <memory>
-#include <string>
-namespace ps {
-
-/**
- * \brief Environment configurations
- */
-class Environment {
- public:
-  /**
-   * \brief return the singleton instance
-   */
-  static inline Environment* Get() {
-    return _GetSharedRef(nullptr).get();
-  }
-  /**
-   * \brief return a shared ptr of the singleton instance
-   */
-  static inline std::shared_ptr<Environment> _GetSharedRef() {
-    return _GetSharedRef(nullptr);
-  }
-  /**
-   * \brief initialize the environment
-   * \param envs key-value environment variables
-   * \return the initialized singleton instance
-   */
-  static inline Environment* Init(const std::unordered_map<std::string, std::string>& envs) {
-    return _GetSharedRef(&envs).get();
-  }
-  /**
-   * \brief find the env value.
-   *  User-defined env vars first. If not found, check system's environment
-   * \param k the environment key
-   * \return the related environment value, nullptr when not found
-   */
-  const char* find(const char* k) {
-    std::string key(k);
-    return kvs.find(key) == kvs.end() ? getenv(k) : kvs[key].c_str();
-  }
-
- private:
-  explicit Environment(const std::unordered_map<std::string, std::string>* envs) {
-    if (envs) kvs = *envs;
-  }
-
-  static std::shared_ptr<Environment> _GetSharedRef(
-      const std::unordered_map<std::string, std::string>* envs) {
-    static std::shared_ptr<Environment> inst_ptr(new Environment(envs));
-    return inst_ptr;
-  }
-
-  std::unordered_map<std::string, std::string> kvs;
-};
-
-}  // namespace ps
-#endif  // PS_INTERNAL_ENV_H_
diff --git a/ps-lite/include/ps/internal/message.h b/ps-lite/include/ps/internal/message.h
deleted file mode 100644
index d14c47fd..00000000
--- a/ps-lite/include/ps/internal/message.h
+++ /dev/null
@@ -1,218 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_MESSAGE_H_
-#define PS_INTERNAL_MESSAGE_H_
-#include <vector>
-#include <limits>
-#include <string>
-#include <sstream>
-#include "ps/sarray.h"
-namespace ps {
-/** \brief data type */
-enum DataType {
-  CHAR, INT8, INT16, INT32, INT64,
-  UINT8, UINT16, UINT32, UINT64,
-  FLOAT, DOUBLE, OTHER
-};
-/** \brief data type name */
-static const char* DataTypeName[] = {
-  "CHAR", "INT8", "INT16", "INT32", "INT64",
-  "UINT8", "UINT16", "UINT32", "UINT64",
-  "FLOAT", "DOUBLE", "OTHER"
-};
-/**
- * \brief compare if V and W are the same type
- */
-template<typename V, typename W>
-inline bool SameType() {
-  return std::is_same<typename std::remove_cv<V>::type, W>::value;
-}
-/**
- * \brief return the DataType of V
- */
-template<typename V>
-DataType GetDataType() {
-  if (SameType<V, int8_t>()) {
-    return INT8;
-  } else if (SameType<V, int16_t>()) {
-    return INT16;
-  } else if (SameType<V, int32_t>()) {
-    return INT32;
-  } else if (SameType<V, int64_t>()) {
-    return INT64;
-  } else if (SameType<V, uint8_t>()) {
-    return UINT8;
-  } else if (SameType<V, uint16_t>()) {
-    return UINT16;
-  } else if (SameType<V, uint32_t>()) {
-    return UINT32;
-  } else if (SameType<V, uint64_t>()) {
-    return UINT64;
-  } else if (SameType<V, float>()) {
-    return FLOAT;
-  } else if (SameType<V, double>()) {
-    return DOUBLE;
-  } else {
-    return OTHER;
-  }
-}
-/**
- * \brief information about a node
- */
-struct Node {
-  /** \brief the empty value */
-  static const int kEmpty;
-  /** \brief default constructor */
-  Node() : id(kEmpty), port(kEmpty), is_recovery(false) {}
-  /** \brief node roles */
-  enum Role { SERVER, WORKER, SCHEDULER };
-  /** \brief get debug string */
-  std::string DebugString() const {
-    std::stringstream ss;
-    ss << "role=" << (role == SERVER ? "server" : (role == WORKER ? "worker" : "scheduler"))
-       << (id != kEmpty ? ", id=" + std::to_string(id) : "")
-       << ", ip=" << hostname << ", port=" << port << ", is_recovery=" << is_recovery;
-
-    return ss.str();
-  }
-  /** \brief get short debug string */
-  std::string ShortDebugString() const {
-    std::string str = role == SERVER ? "S" : (role == WORKER ? "W" : "H");
-    if (id != kEmpty) str += "[" + std::to_string(id) + "]";
-    return str;
-  }
-  /** \brief the role of this node */
-  Role role;
-  /** \brief node id */
-  int id;
-  /** \brief hostname or ip */
-  std::string hostname;
-  /** \brief the port this node is binding */
-  int port;
-  /** \brief whether this node is created by failover */
-  bool is_recovery;
-};
-/**
- * \brief meta info of a system control message
- */
-struct Control {
-  /** \brief empty constructor */
-  Control() : cmd(EMPTY) { }
-  /** \brief return true is empty */
-  inline bool empty() const { return cmd == EMPTY; }
-  /** \brief get debug string */
-  std::string DebugString() const {
-    if (empty()) return "";
-    std::vector<std::string> cmds = {
-      "EMPTY", "TERMINATE", "ADD_NODE", "BARRIER", "ACK", "HEARTBEAT"};
-    std::stringstream ss;
-    ss << "cmd=" << cmds[cmd];
-    if (node.size()) {
-      ss << ", node={";
-      for (const Node& n : node) ss << " " << n.DebugString();
-      ss << " }";
-    }
-    if (cmd == BARRIER) ss << ", barrier_group=" << barrier_group;
-    if (cmd == ACK) ss << ", msg_sig=" << msg_sig;
-    return ss.str();
-  }
-  /** \brief all commands */
-  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };
-  /** \brief the command */
-  Command cmd;
-  /** \brief node infos */
-  std::vector<Node> node;
-  /** \brief the node group for a barrier, such as kWorkerGroup */
-  int barrier_group;
-  /** message signature */
-  uint64_t msg_sig;
-};
-/**
- * \brief meta info of a message
- */
-struct Meta {
-  /** \brief the empty value */
-  static const int kEmpty;
-  /** \brief default constructor */
-  Meta() : head(kEmpty), customer_id(kEmpty), timestamp(kEmpty),
-           sender(kEmpty), recver(kEmpty),
-           request(false), push(false), simple_app(false) {}
-  std::string DebugString() const {
-    std::stringstream ss;
-    if (sender == Node::kEmpty) {
-      ss << "?";
-    } else {
-      ss << sender;
-    }
-    ss <<  " => " << recver;
-    ss << ". Meta: request=" << request;
-    if (timestamp != kEmpty) ss << ", timestamp=" << timestamp;
-    if (!control.empty()) {
-      ss << ", control={ " << control.DebugString() << " }";
-    } else {
-      ss << ", customer_id=" << customer_id
-         << ", simple_app=" << simple_app
-         << ", push=" << push;
-    }
-    if (head != kEmpty) ss << ", head=" << head;
-    if (body.size()) ss << ", body=" << body;
-    if (data_type.size()) {
-      ss << ", data_type={";
-      for (auto d : data_type) ss << " " << DataTypeName[static_cast<int>(d)];
-      ss << " }";
-    }
-    return ss.str();
-  }
-  /** \brief an int head */
-  int head;
-  /** \brief the unique id of the customer is messsage is for*/
-  int customer_id;
-  /** \brief the timestamp of this message */
-  int timestamp;
-  /** \brief the node id of the sender of this message */
-  int sender;
-  /** \brief the node id of the receiver of this message */
-  int recver;
-  /** \brief whether or not this is a request message*/
-  bool request;
-  /** \brief whether or not a push message */
-  bool push;
-  /** \brief whether or not it's for SimpleApp */
-  bool simple_app;
-  /** \brief an string body */
-  std::string body;
-  /** \brief data type of message.data[i] */
-  std::vector<DataType> data_type;
-  /** \brief system control message */
-  Control control;
-};
-/**
- * \brief messages that communicated amaong nodes.
- */
-struct Message {
-  /** \brief the meta info of this message */
-  Meta meta;
-  /** \brief the large chunk of data of this message */
-  std::vector<SArray<char> > data;
-  /**
-   * \brief push array into data, and add the data type
-   */
-  template <typename V>
-  void AddData(const SArray<V>& val) {
-    CHECK_EQ(data.size(), meta.data_type.size());
-    meta.data_type.push_back(GetDataType<V>());
-    data.push_back(SArray<char>(val));
-  }
-  std::string DebugString() const {
-    std::stringstream ss;
-    ss << meta.DebugString();
-    if (data.size()) {
-      ss << " Body:";
-      for (const auto& d : data) ss << " data_size=" << d.size();
-    }
-    return ss.str();
-  }
-};
-}  // namespace ps
-#endif  // PS_INTERNAL_MESSAGE_H_
diff --git a/ps-lite/include/ps/internal/parallel_kv_match.h b/ps-lite/include/ps/internal/parallel_kv_match.h
deleted file mode 100644
index bf5ab0b7..00000000
--- a/ps-lite/include/ps/internal/parallel_kv_match.h
+++ /dev/null
@@ -1,123 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- * \file   parallel_kv_match.h
- * \brief  paralle key-value pairs matching
- */
-#ifndef PS_INTERNAL_PARALLEL_KV_MATCH_H_
-#define PS_INTERNAL_PARALLEL_KV_MATCH_H_
-#include <thread>
-#include <algorithm>
-#include "ps/sarray.h"
-#include "ps/internal/assign_op.h"
-
-namespace ps {
-namespace  {
-/**
- * \brief thread function, internal use
- *
- * \param src_key start of source key
- * \param src_key_end end of source key
- * \param src_val start of source val
- * \param dst_key start of destination key
- * \param dst_key_end end of denstination key
- * \param dst_val start of destination val
- * \param k length of a single value
- * \param op assignment operator
- * \param grainsize thread grainsize size
- * \param n number of matched kv pairs
- */
-template <typename K, typename V>
-void ParallelOrderedMatch(
-    const K* src_key, const K* src_key_end, const V* src_val,
-    const K* dst_key, const K* dst_key_end, V* dst_val,
-    int k, AsOp op, size_t grainsize, size_t* n) {
-  size_t src_len = std::distance(src_key, src_key_end);
-  size_t dst_len = std::distance(dst_key, dst_key_end);
-  if (dst_len == 0 || src_len == 0) return;
-
-  // drop the unmatched tail of src
-  src_key = std::lower_bound(src_key, src_key_end, *dst_key);
-  src_val += (src_key - (src_key_end - src_len)) * k;
-
-  if (dst_len <= grainsize) {
-    while (dst_key != dst_key_end && src_key != src_key_end) {
-      if (*src_key < *dst_key) {
-        ++src_key; src_val += k;
-      } else {
-        if (!(*dst_key < *src_key)) {
-          for (int i = 0; i < k; ++i) {
-            AssignOp(dst_val[i], src_val[i], op);
-          }
-          ++src_key; src_val += k;
-          *n += k;
-        }
-        ++dst_key; dst_val += k;
-      }
-    }
-  } else {
-    std::thread thr(
-        ParallelOrderedMatch<K, V>, src_key, src_key_end, src_val,
-        dst_key, dst_key + dst_len / 2, dst_val,
-        k, op, grainsize, n);
-    size_t m = 0;
-    ParallelOrderedMatch<K, V>(
-        src_key, src_key_end, src_val,
-        dst_key + dst_len / 2, dst_key_end, dst_val + (dst_len / 2) * k,
-        k, op, grainsize, &m);
-    thr.join();
-    *n += m;
-  }
-}
-}  // namespace
-
-
-/**
- * \brief Merge \a src_val into \a dst_val by matching keys. Keys must be unique
- * and sorted.
- *
- * \code
- * if (dst_key[i] == src_key[j]) {
- *    dst_val[i] op= src_val[j]
- * }
- * \endcode
- *
- * When finished, \a dst_val will have length `k * dst_key.size()` and filled
- * with matched value. Umatched value will be untouched if exists or filled with 0.
- *
- * \tparam K type of key
- * \tparam V type of value
- * \tparam C type of the container such as \ref SArray or \ref std::vector
- * \param src_key the source keys
- * \param src_val the source values
- * \param dst_key the destination keys
- * \param dst_val the destination values.
- * \param k the length of a single value (default is 1)
- * \param op the assignment operator (default is ASSIGN)
- * \param num_threads number of thread (default is 1)
- * \return the number of matched kv pairs
- */
-template <typename K, typename V, typename C>
-size_t ParallelOrderedMatch(
-    const SArray<K>& src_key, const SArray<V>& src_val,
-    const SArray<K>& dst_key, C* dst_val,
-    int k = 1, AssignOp op = ASSIGN, int num_threads = 1) {
-  // do check
-  CHECK_GT(num_threads, 0);
-  CHECK_EQ(src_key.size() * k, src_val.size());
-  CHECK_NOTNULL(dst_val->resize(dst_key.size() * k));
-  if (dst_key.empty()) return 0;
-
-  // shorten the matching range
-  Range range = FindRange(dst_key, src_key.begin(), src_key.end());
-  size_t grainsize = std::max(range.size() * k / num_threads + 5,
-                              static_cast<size_t>(1024*1024));
-  size_t n = 0;
-  ParallelOrderedMatch<K, V>(
-      src_key.begin(), src_key.end(), src_val.begin(),
-      dst_key.begin() + range.begin(), dst_key.begin() + range.end(),
-      dst_val->begin() + range.begin()*k, k, op, grainsize, &n);
-  return n;
-}
-
-}  // namespace ps
-#endif  // PS_INTERNAL_PARALLEL_KV_MATCH_H_
diff --git a/ps-lite/include/ps/internal/parallel_sort.h b/ps-lite/include/ps/internal/parallel_sort.h
deleted file mode 100644
index e3920e76..00000000
--- a/ps-lite/include/ps/internal/parallel_sort.h
+++ /dev/null
@@ -1,58 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- * @file   parallel_sort.h
- * @brief  Parallel sort
- */
-#ifndef PS_INTERNAL_PARALLEL_SORT_H_
-#define PS_INTERNAL_PARALLEL_SORT_H_
-#include <functional>
-#include <thread>
-#include <algorithm>
-#include "ps/sarray.h"
-namespace ps {
-
-namespace  {
-/**
- * \brief the thread function
- *
- * \param data start pointer of data
- * \param len  length of data
- * \param grainsize max data length of one thread
- * \param cmp comparison function
- */
-template<typename T, class Fn>
-void ParallelSort(T* data, size_t len, size_t grainsize, const Fn& cmp) {
-  if (len <= grainsize) {
-    std::sort(data, data + len, cmp);
-  } else {
-    std::thread thr(ParallelSort<T, Fn>, data, len/2, grainsize, cmp);
-    ParallelSort(data + len/2, len - len/2, grainsize, cmp);
-    thr.join();
-
-    std::inplace_merge(data, data + len/2, data + len, cmp);
-  }
-}
-}  // namespace
-
-/**
- * \brief Parallel Sort
- *
- * \param arr the array for sorting
- * \param num_threads number of thread
- * \param cmp the comparision function such as
- * [](const T& a, const T& b) {* return a < b; }
- * or an even simplier version:
- * std::less<T>()
- */
-template<typename T, class Fn>
-void ParallelSort(SArray<T>* arr,
-                  int num_threads = 2,
-                  const Fn& cmp = std::less<T>()) {
-  CHECK_GT(num_threads, 0);
-  CHECK(cmp);
-  size_t grainsize = std::max(arr->size() / num_threads + 5, (size_t)1024*16);
-  ParallelSort(arr->data(), arr->size(), grainsize, cmp);
-}
-
-}  // namespace ps
-#endif  // PS_INTERNAL_PARALLEL_SORT_H_
diff --git a/ps-lite/include/ps/internal/postoffice.h b/ps-lite/include/ps/internal/postoffice.h
deleted file mode 100644
index 4745f335..00000000
--- a/ps-lite/include/ps/internal/postoffice.h
+++ /dev/null
@@ -1,189 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_POSTOFFICE_H_
-#define PS_INTERNAL_POSTOFFICE_H_
-#include <mutex>
-#include <algorithm>
-#include <vector>
-#include "ps/range.h"
-#include "ps/internal/env.h"
-#include "ps/internal/customer.h"
-#include "ps/internal/van.h"
-namespace ps {
-/**
- * \brief the center of the system
- */
-class Postoffice {
- public:
-  /**
-   * \brief return the singleton object
-   */
-  static Postoffice* Get() {
-    static Postoffice e; return &e;
-  }
-  /** \brief get the van */
-  Van* van() { return van_; }
-  /**
-   * \brief start the system
-   *
-   * This function will block until every nodes are started.
-   * \param argv0 the program name, used for logging.
-   * \param do_barrier whether to block until every nodes are started.
-   */
-  void Start(const char* argv0, const bool do_barrier);
-  /**
-   * \brief terminate the system
-   *
-   * All nodes should call this function before existing. 
-   * \param do_barrier whether to do block until every node is finalized, default true.
-   */
-  void Finalize(const bool do_barrier = true);
-  /**
-   * \brief add an customer to the system. threadsafe
-   */
-  void AddCustomer(Customer* customer);
-  /**
-   * \brief remove a customer by given it's id. threasafe
-   */
-  void RemoveCustomer(Customer* customer);
-  /**
-   * \brief get the customer by id, threadsafe
-   * \param id the customer id
-   * \param timeout timeout in sec
-   * \return return nullptr if doesn't exist and timeout
-   */
-  Customer* GetCustomer(int id, int timeout = 0) const;
-  /**
-   * \brief get the id of a node (group), threadsafe
-   *
-   * if it is a  node group, return the list of node ids in this
-   * group. otherwise, return {node_id}
-   */
-  const std::vector<int>& GetNodeIDs(int node_id) const {
-    const auto it = node_ids_.find(node_id);
-    CHECK(it != node_ids_.cend()) << "node " << node_id << " doesn't exist";
-    return it->second;
-  }
-  /**
-   * \brief return the key ranges of all server nodes
-   */
-  const std::vector<Range>& GetServerKeyRanges();
-  /**
-   * \brief the template of a callback
-   */
-  using Callback = std::function<void()>;
-  /**
-   * \brief Register a callback to the system which is called after Finalize()
-   *
-   * The following codes are equal
-   * \code {cpp}
-   * RegisterExitCallback(cb);
-   * Finalize();
-   * \endcode
-   *
-   * \code {cpp}
-   * Finalize();
-   * cb();
-   * \endcode
-   * \param cb the callback function
-   */
-  void RegisterExitCallback(const Callback& cb) {
-    exit_callback_ = cb;
-  }
-  /**
-   * \brief convert from a worker rank into a node id
-   * \param rank the worker rank
-   */
-  static inline int WorkerRankToID(int rank) {
-    return rank * 2 + 9;
-  }
-  /**
-   * \brief convert from a server rank into a node id
-   * \param rank the server rank
-   */
-  static inline int ServerRankToID(int rank) {
-    return rank * 2 + 8;
-  }
-  /**
-   * \brief convert from a node id into a server or worker rank
-   * \param id the node id
-   */
-  static inline int IDtoRank(int id) {
-#ifdef _MSC_VER
-#undef max
-#endif
-    return std::max((id - 8) / 2, 0);
-  }
-  /** \brief Returns the number of worker nodes */
-  int num_workers() const { return num_workers_; }
-  /** \brief Returns the number of server nodes */
-  int num_servers() const { return num_servers_; }
-  /** \brief Returns the rank of this node in its group
-   *
-   * Each worker will have a unique rank within [0, NumWorkers()). So are
-   * servers. This function is available only after \ref Start has been called.
-   */
-  int my_rank() const { return IDtoRank(van_->my_node().id); }
-  /** \brief Returns true if this node is a worker node */
-  int is_worker() const { return is_worker_; }
-  /** \brief Returns true if this node is a server node. */
-  int is_server() const { return is_server_; }
-  /** \brief Returns true if this node is a scheduler node. */
-  int is_scheduler() const { return is_scheduler_; }
-  /** \brief Returns the verbose level. */
-  int verbose() const { return verbose_; }
-  /** \brief Return whether this node is a recovery node */
-  bool is_recovery() const { return van_->my_node().is_recovery; }
-  /**
-   * \brief barrier
-   * \param node_id the barrier group id
-   */
-  void Barrier(int node_id);
-  /**
-   * \brief process a control message, called by van
-   * \param the received message
-   */
-  void Manage(const Message& recv);
-  /**
-   * \brief update the heartbeat record map
-   * \param node_id the \ref Node id
-   * \param t the last received heartbeat time
-   */
-  void UpdateHeartbeat(int node_id, time_t t) {
-    std::lock_guard<std::mutex> lk(heartbeat_mu_);
-    heartbeats_[node_id] = t;
-  }
-  /**
-   * \brief get node ids that haven't reported heartbeats for over t seconds
-   * \param t timeout in sec
-   */
-  std::vector<int> GetDeadNodes(int t = 60);
-
- private:
-  Postoffice();
-  ~Postoffice() { delete van_; }
-  Van* van_;
-  mutable std::mutex mu_;
-  std::unordered_map<int, Customer*> customers_;
-  std::unordered_map<int, std::vector<int>> node_ids_;
-  std::vector<Range> server_key_ranges_;
-  bool is_worker_, is_server_, is_scheduler_;
-  int num_servers_, num_workers_;
-  bool barrier_done_;
-  int verbose_;
-  std::mutex barrier_mu_;
-  std::condition_variable barrier_cond_;
-  std::mutex heartbeat_mu_;
-  std::unordered_map<int, time_t> heartbeats_;
-  Callback exit_callback_;
-  /** \brief Holding a shared_ptr to prevent it from being destructed too early */
-  std::shared_ptr<Environment> env_ref_;
-  time_t start_time_;
-  DISALLOW_COPY_AND_ASSIGN(Postoffice);
-};
-
-/** \brief verbose log */
-#define PS_VLOG(x) LOG_IF(INFO, x <= Postoffice::Get()->verbose())
-}  // namespace ps
-#endif  // PS_INTERNAL_POSTOFFICE_H_
diff --git a/ps-lite/include/ps/internal/threadsafe_queue.h b/ps-lite/include/ps/internal/threadsafe_queue.h
deleted file mode 100644
index 93169dcd..00000000
--- a/ps-lite/include/ps/internal/threadsafe_queue.h
+++ /dev/null
@@ -1,59 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_THREADSAFE_QUEUE_H_
-#define PS_INTERNAL_THREADSAFE_QUEUE_H_
-#include <queue>
-#include <mutex>
-#include <condition_variable>
-#include <memory>
-#include "ps/base.h"
-namespace ps {
-
-/**
- * \brief thread-safe queue allowing push and waited pop
- */
-template<typename T> class ThreadsafeQueue {
- public:
-  ThreadsafeQueue() { }
-  ~ThreadsafeQueue() { }
-
-  /**
-   * \brief push an value into the end. threadsafe.
-   * \param new_value the value
-   */
-  void Push(T new_value) {
-    mu_.lock();
-    queue_.push(std::move(new_value));
-    mu_.unlock();
-    cond_.notify_all();
-  }
-
-  /**
-   * \brief wait until pop an element from the beginning, threadsafe
-   * \param value the poped value
-   */
-  void WaitAndPop(T* value) {
-    std::unique_lock<std::mutex> lk(mu_);
-    cond_.wait(lk, [this]{return !queue_.empty();});
-    *value = std::move(queue_.front());
-    queue_.pop();
-  }
-
- private:
-  mutable std::mutex mu_;
-  std::queue<T> queue_;
-  std::condition_variable cond_;
-};
-
-}  // namespace ps
-
-// bool TryPop(T& value) {
-//   std::lock_guard<std::mutex> lk(mut);
-//   if(data_queue.empty())
-//     return false;
-//   value=std::move(data_queue.front());
-//   data_queue.pop();
-//   return true;
-// }
-#endif  // PS_INTERNAL_THREADSAFE_QUEUE_H_
diff --git a/ps-lite/include/ps/internal/utils.h b/ps-lite/include/ps/internal/utils.h
deleted file mode 100644
index 4f4c7c31..00000000
--- a/ps-lite/include/ps/internal/utils.h
+++ /dev/null
@@ -1,48 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_UTILS_H_
-#define PS_INTERNAL_UTILS_H_
-#include "dmlc/logging.h"
-#include "ps/internal/env.h"
-namespace ps {
-
-#ifdef _MSC_VER
-typedef signed char      int8_t;
-typedef __int16          int16_t;
-typedef __int32          int32_t;
-typedef __int64          int64_t;
-typedef unsigned char    uint8_t;
-typedef unsigned __int16 uint16_t;
-typedef unsigned __int32 uint32_t;
-typedef unsigned __int64 uint64_t;
-#else
-#include <inttypes.h>
-#endif
-
-/*!
- * \brief Get environment variable as int with default.
- * \param key the name of environment variable.
- * \param default_val the default value of environment vriable.
- * \return The value received
- */
-template<typename V>
-inline V GetEnv(const char *key, V default_val) {
-  const char *val = Environment::Get()->find(key);
-  if (val == nullptr) {
-    return default_val;
-  } else {
-    return atoi(val);
-  }
-}
-
-#ifndef DISALLOW_COPY_AND_ASSIGN
-#define DISALLOW_COPY_AND_ASSIGN(TypeName) \
-  TypeName(const TypeName&);               \
-  void operator=(const TypeName&)
-#endif
-
-#define LL LOG(ERROR)
-
-}  // namespace ps
-#endif  // PS_INTERNAL_UTILS_H_
diff --git a/ps-lite/include/ps/internal/van.h b/ps-lite/include/ps/internal/van.h
deleted file mode 100644
index 8c5518cd..00000000
--- a/ps-lite/include/ps/internal/van.h
+++ /dev/null
@@ -1,130 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_INTERNAL_VAN_H_
-#define PS_INTERNAL_VAN_H_
-#include <unordered_map>
-#include <mutex>
-#include <string>
-#include <vector>
-#include <thread>
-#include <memory>
-#include <atomic>
-#include <ctime>
-#include "ps/base.h"
-#include "ps/internal/message.h"
-namespace ps {
-class Resender;
-/**
- * \brief Van sends messages to remote nodes
- *
- * If environment variable PS_RESEND is set to be 1, then van will resend a
- * message if it no ACK messsage is received within PS_RESEND_TIMEOUT millisecond
- */
-class Van {
- public:
-  /**
-   * \brief create Van
-   * \param type zmq, socket, ...
-   */
-  static Van* Create(const std::string& type);
-  /** \brief constructer, do nothing. use \ref Start for real start */
-  Van() { }
-  /**\brief deconstructer, do nothing. use \ref Stop for real stop */
-  virtual ~Van() { }
-  /**
-   * \brief start van
-   *
-   * must call it before calling Send
-   *
-   * it initalizes all connections to other nodes.  start the receiving
-   * threads, which keeps receiving messages. if it is a system
-   * control message, give it to postoffice::manager, otherwise, give it to the
-   * accoding app.
-   */
-  virtual void Start();
-  /**
-   * \brief send a message, It is thread-safe
-   * \return the number of bytes sent. -1 if failed
-   */
-  int Send(const Message& msg);
-  /**
-   * \brief return my node
-   */
-  const Node& my_node() const {
-    CHECK(ready_) << "call Start() first";
-    return my_node_;
-  }
-  /**
-   * \brief stop van
-   * stop receiving threads
-   */
-  virtual void Stop();
-  /**
-   * \brief get next available timestamp. thread safe
-   */
-  int GetTimestamp() { return timestamp_++; }
-  /**
-   * \brief whether it is ready for sending. thread safe
-   */
-  bool IsReady() { return ready_; }
-
- protected:
-  /**
-   * \brief connect to a node
-   */
-  virtual void Connect(const Node& node) = 0;
-  /**
-   * \brief bind to my node
-   * do multiple retries on binding the port. since it's possible that
-   * different nodes on the same machine picked the same port
-   * \return return the port binded, -1 if failed.
-   */
-  virtual int Bind(const Node& node, int max_retry) = 0;
-  /**
-   * \brief block until received a message
-   * \return the number of bytes received. -1 if failed or timeout
-   */
-  virtual int RecvMsg(Message* msg) = 0;
-  /**
-   * \brief send a mesage
-   * \return the number of bytes sent
-   */
-  virtual int SendMsg(const Message& msg) = 0;
-  /**
-   * \brief pack meta into a string
-   */
-  void PackMeta(const Meta& meta, char** meta_buf, int* buf_size);
-  /**
-   * \brief unpack meta from a string
-   */
-  void UnpackMeta(const char* meta_buf, int buf_size, Meta* meta);
-
-  Node scheduler_;
-  Node my_node_;
-  bool is_scheduler_;
-
- private:
-  /** thread function for receving */
-  void Receiving();
-  /** thread function for heartbeat */
-  void Heartbeat();
-  /** whether it is ready for sending */
-  std::atomic<bool> ready_{false};
-  std::atomic<size_t> send_bytes_{0};
-  size_t recv_bytes_ = 0;
-  int num_servers_ = 0;
-  int num_workers_ = 0;
-  /** the thread for receiving messages */
-  std::unique_ptr<std::thread> receiver_thread_;
-  /** the thread for sending heartbeat */
-  std::unique_ptr<std::thread> heartbeat_thread_;
-  std::vector<int> barrier_count_;
-  /** msg resender */
-  Resender* resender_ = nullptr;
-  int drop_rate_ = 0;
-  std::atomic<int> timestamp_{0};
-  DISALLOW_COPY_AND_ASSIGN(Van);
-};
-}  // namespace ps
-#endif  // PS_INTERNAL_VAN_H_
diff --git a/ps-lite/include/ps/kv_app.h b/ps-lite/include/ps/kv_app.h
deleted file mode 100644
index 830f24db..00000000
--- a/ps-lite/include/ps/kv_app.h
+++ /dev/null
@@ -1,607 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_KV_APP_H_
-#define PS_KV_APP_H_
-#include <algorithm>
-#include <utility>
-#include <vector>
-#include "ps/base.h"
-#include "ps/simple_app.h"
-namespace ps {
-
-/**
- * \brief the structure for a list of key-value pairs
- *
- * The keys must be unique and sorted in an increasing order.  The length of a
- * value can be more than one. If \a lens is empty, then the length
- * of a value is determined by `k=vals.size()/keys.size()`.  The \a i-th KV pair
- * is then
- *
- * \verbatim {keys[i], (vals[i*k], ..., vals[(i+1)*k-1])} \endverbatim
- *
- * If \a lens is given, then `lens[i]` is the length of the \a i-th
- * value. Let
- *
- * \verbatim n = lens[0] + .. + lens[i-1]  \endverbatim
- *
- * then the \a i-th KV pair is presented as
- *
- * \verbatim {keys[i], (vals[n], ..., vals[lens[i]+n-1])} \endverbatim
- */
-template <typename Val>
-struct KVPairs {
-  // /** \brief empty constructor */
-  // KVPairs() {}
-  /** \brief the list of keys */
-  SArray<Key> keys;
-  /** \brief the according values */
-  SArray<Val> vals;
-  /** \brief the according value lengths (could be empty) */
-  SArray<int> lens;
-};
-
-/**
- * \brief A worker node that can \ref Push (\ref Pull) key-value pairs to (from) server
- * nodes
- *
- * \tparam Val the type of value, which should be primitive types such as
- * int32_t and float
- */
-template<typename Val>
-class KVWorker : public SimpleApp {
- public:
-  /** avoid too many this-> */
-  using SimpleApp::obj_;
-  /**
-   * \brief callback function for \ref Push and \ref Pull
-   *
-   * It is called by the data receiving thread of this instance when the push or
-   * pull is actually finished. Namely the kv pairs have already written into
-   * servers' data structure or the kv pairs have already pulled back.
-   */
-  using Callback = std::function<void()>;
-
-  /**
-   * \brief constructor
-   *
-   * \param app_id the app id, should match with \ref KVServer's id
-   */
-  explicit KVWorker(int app_id) : SimpleApp() {
-    using namespace std::placeholders;
-    slicer_ = std::bind(&KVWorker<Val>::DefaultSlicer, this, _1, _2, _3);
-    obj_ = new Customer(app_id, std::bind(&KVWorker<Val>::Process, this, _1));
-  }
-
-  /** \brief deconstructor */
-  virtual ~KVWorker() { delete obj_; obj_ = nullptr; }
-
-  /**
-   * \brief Pushes a list of key-value pairs to all server nodes.
-   *
-   * This function pushes a KV list specified by \a keys and \a vals to all
-   * server nodes.
-   *
-   * Sample usage: the following codes push two KV pairs `{1, (1.1, 1.2)}` and `{3,
-   * (3.1,3.2)}` to server nodes, where the value is a length-2 float vector
-   * \code
-   *   KVWorker<float> w;
-   *   std::vector<Key> keys = {1, 3};
-   *   std::vector<float> vals = {1.1, 1.2, 3.1, 3.2};
-   *   w.Push(keys, vals);
-   * \endcode
-   *
-   * If \a lens is given, then the value can be various length. See
-   * \ref KVPairs for more information.
-   *
-   * The KV list is partitioned and sent based on the key range each server
-   * maintaining. This function returns without waiting the data are sent
-   * actually. Instead, use either \ref Wait or the callback to know when
-   * finished. This function is thread-safe.
-   *
-   * @param keys a list of keys, must be unique and sorted in increasing order
-   * @param vals the according values
-   * @param lens optional, lens[i] stores the value length of the \a
-   * i-th KV pair
-   * @param cmd an optional command sent to the servers
-   * @param cb the callback which is called when the push is finished.
-   * @return the timestamp of this request
-   */
-  int Push(const std::vector<Key>& keys,
-           const std::vector<Val>& vals,
-           const std::vector<int>& lens = {},
-           int cmd = 0,
-           const Callback& cb = nullptr) {
-    return ZPush(
-        SArray<Key>(keys), SArray<Val>(vals), SArray<int>(lens), cmd, cb);
-  }
-
-  /**
-   * \brief Pulls the values associated with the keys from the server nodes
-   *
-   * This function pulls the values of the keys specified in \a keys from the
-   * server nodes. The format is same to \ref KVPairs
-   *
-   * Sample usage: the following codes pull the values of keys \a 1 and \a 3
-   * from the server nodes.
-   * \code
-   *   KVWorker<float> w;
-   *   std::vector<Key> keys = {1, 3};
-   *   std::vector<float> vals;
-   *   ps.Pull(keys, &vals);
-   * \endcode
-   *
-   * It's a non-blocking call. The actual pulling is finished,
-   * namely \a vals (and \a lens) is filled with pulled values, only
-   * if \ref Wait returns or the callback is called.
-   *
-   * @param keys a list of keys, must be unique and sorted in increasing order
-   * @param vals the buffer for the pulled values. It can be 0 size.
-   * @param lens optional buffer for the value length. If set, it can be 0 size.
-   * @param cmd an optional command sent to the servers
-   * @param cb the callback which is called when the pull is finished.
-   * @return the timestamp of this request
-   */
-  int Pull(const std::vector<Key>& keys,
-           std::vector<Val>* vals,
-           std::vector<int>* lens = nullptr,
-           int cmd = 0,
-           const Callback& cb = nullptr) {
-    return Pull_(SArray<Key>(keys), vals, lens, cmd, cb);
-  }
-
-  /**
-   * \brief Waits until a push or pull has been finished
-   *
-   * Sample usage:
-   * \code
-   *   int ts = w.Pull(keys, &vals);
-   *   Wait(ts);
-   *   // now vals is ready for use
-   * \endcode
-   *
-   * \param timestamp the timestamp returned by the push or pull
-   */
-  void Wait(int timestamp) { obj_->WaitRequest(timestamp); }
-
-  /**
-   * \brief zero-copy Push
-   *
-   * This function is similar to \ref Push except that all data
-   * will not be copied into system for better performance. It is the caller's
-   * responsibility to keep the content to be not changed before actually
-   * finished.
-   */
-  int ZPush(const SArray<Key>& keys,
-            const SArray<Val>& vals,
-            const SArray<int>& lens = {},
-            int cmd = 0,
-            const Callback& cb = nullptr) {
-    int ts = obj_->NewRequest(kServerGroup);
-    AddCallback(ts, cb);
-    KVPairs<Val> kvs;
-    kvs.keys = keys;
-    kvs.vals = vals;
-    kvs.lens = lens;
-    Send(ts, true, cmd, kvs);
-    return ts;
-  }
-
-  /**
-   * \brief zero-copy Pull
-   *
-   * This function is similar to \ref Pull except that all data
-   * will not be copied into system for better performance. It is the caller's
-   * responsibility to keep the content to be not changed before actually
-   * finished.
-   */
-  int ZPull(const SArray<Key>& keys,
-            SArray<Val>* vals,
-            SArray<int>* lens = nullptr,
-            int cmd = 0,
-            const Callback& cb = nullptr) {
-    return Pull_(keys, vals, lens, cmd, cb);
-  }
-  using SlicedKVs = std::vector<std::pair<bool, KVPairs<Val>>>;
-  /**
-   * \brief a slicer partitions a key-value list according to the key ranges
-   * \param send the kv list for partitioning
-   * \param ranges the key ranges, ranges[i] is the key range of server i
-   * \param sliced the sliced lists. slices[i] should only contains keys in
-   * ranges[i] and the according values
-   */
-  using Slicer = std::function<void(
-      const KVPairs<Val>& send, const std::vector<Range>& ranges,
-      SlicedKVs* sliced)>;
-
-  /**
-   * \brief set a user-defined slicer
-   */
-  void set_slicer(const Slicer& slicer) {
-    CHECK(slicer); slicer_ = slicer;
-  }
-
- private:
-  /**
-   * \brief internal pull, C/D can be either SArray or std::vector
-   */
-  template <typename C, typename D>
-  int Pull_(const SArray<Key>& keys, C* vals, D* lens,
-            int cmd, const Callback& cb);
-  /**
-   * \brief add a callback for a request. threadsafe.
-   * @param cb callback
-   * @param timestamp the timestamp of the request
-   */
-  void AddCallback(int timestamp, const Callback& cb) {
-    if (!cb) return;
-    std::lock_guard<std::mutex> lk(mu_);
-    callbacks_[timestamp] = cb;
-  }
-
-  /**
-   * \brief run and delete the callback
-   * \param timestamp the timestamp of the callback
-   */
-  void RunCallback(int timestamp);
-  /**
-   * \brief send the kv list to all servers
-   * @param timestamp the timestamp of the request
-   * @param push whether or not it is a push request
-   * @param cmd command
-   */
-  void Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs);
-  /** \brief internal receive handle */
-  void Process(const Message& msg);
-  /** \brief default kv slicer */
-  void DefaultSlicer(const KVPairs<Val>& send,
-                     const std::vector<Range>& ranges,
-                     SlicedKVs* sliced);
-
-  /** \brief data buffer for received kvs for each timestamp */
-  std::unordered_map<int, std::vector<KVPairs<Val>>> recv_kvs_;
-  /** \brief callbacks for each timestamp */
-  std::unordered_map<int, Callback> callbacks_;
-  /** \brief lock */
-  std::mutex mu_;
-  /** \brief kv list slicer */
-  Slicer slicer_;
-};
-
-/** \brief meta information about a kv request */
-struct KVMeta {
-  /** \brief the int cmd */
-  int cmd;
-  /** \brief whether or not this is a push request */
-  bool push;
-  /** \brief sender's node id */
-  int sender;
-  /** \brief the associated timestamp */
-  int timestamp;
-};
-
-/**
- * \brief A server node for maintaining key-value pairs
- */
-template <typename Val>
-class KVServer : public SimpleApp {
- public:
-  /**
-   * \brief constructor
-   * \param app_id the app id, should match with \ref KVWorker's id
-   */
-  explicit KVServer(int app_id) : SimpleApp() {
-    using namespace std::placeholders;
-    obj_ = new Customer(app_id, std::bind(&KVServer<Val>::Process, this, _1));
-  }
-
-  /** \brief deconstructor */
-  virtual ~KVServer() { delete obj_; obj_ = nullptr; }
-
-  /**
-   * \brief the handle to process a push/pull request from a worker
-   * \param req_meta meta-info of this request
-   * \param req_data kv pairs of this request
-   * \param server this pointer
-   */
-  using ReqHandle = std::function<void(const KVMeta& req_meta,
-                                       const KVPairs<Val>& req_data,
-                                       KVServer* server)>;
-  void set_request_handle(const ReqHandle& request_handle) {
-    CHECK(request_handle) << "invalid request handle";
-    request_handle_ = request_handle;
-  }
-
-  /**
-   * \brief response to the push/pull request
-   * \param req the meta-info of the request
-   * \param res the kv pairs that will send back to the worker
-   */
-  void Response(const KVMeta& req, const KVPairs<Val>& res = KVPairs<Val>());
-
- private:
-  /** \brief internal receive handle */
-  void Process(const Message& msg);
-  /** \brief request handle */
-  ReqHandle request_handle_;
-};
-
-
-/**
- * \brief an example handle adding pushed kv into store
- */
-template <typename Val>
-struct KVServerDefaultHandle {
-  void operator()(
-      const KVMeta& req_meta, const KVPairs<Val>& req_data, KVServer<Val>* server) {
-    size_t n = req_data.keys.size();
-    KVPairs<Val> res;
-    if (req_meta.push) {
-      CHECK_EQ(n, req_data.vals.size());
-    } else {
-      res.keys = req_data.keys; res.vals.resize(n);
-    }
-    for (size_t i = 0; i < n; ++i) {
-      Key key = req_data.keys[i];
-      if (req_meta.push) {
-        store[key] += req_data.vals[i];
-      } else {
-        res.vals[i] = store[key];
-      }
-    }
-    server->Response(req_meta, res);
-  }
-  std::unordered_map<Key, Val> store;
-};
-
-
-///////////////////////////////////////////////////////////////////////////////
-
-template <typename Val>
-void KVServer<Val>::Process(const Message& msg) {
-  if (msg.meta.simple_app) {
-    SimpleApp::Process(msg); return;
-  }
-  KVMeta meta;
-  meta.cmd       = msg.meta.head;
-  meta.push      = msg.meta.push;
-  meta.sender    = msg.meta.sender;
-  meta.timestamp = msg.meta.timestamp;
-  KVPairs<Val> data;
-  int n = msg.data.size();
-  if (n) {
-    CHECK_GE(n, 2);
-    data.keys = msg.data[0];
-    data.vals = msg.data[1];
-    if (n > 2) {
-      CHECK_EQ(n, 3);
-      data.lens = msg.data[2];
-      CHECK_EQ(data.lens.size(), data.keys.size());
-    }
-  }
-  CHECK(request_handle_);
-  request_handle_(meta, data, this);
-}
-
-template <typename Val>
-void KVServer<Val>::Response(const KVMeta& req, const KVPairs<Val>& res) {
-  Message msg;
-  msg.meta.customer_id = obj_->id();
-  msg.meta.request     = false;
-  msg.meta.push        = req.push;
-  msg.meta.head        = req.cmd;
-  msg.meta.timestamp   = req.timestamp;
-  msg.meta.recver      = req.sender;
-  if (res.keys.size()) {
-    msg.AddData(res.keys);
-    msg.AddData(res.vals);
-    if (res.lens.size()) {
-      msg.AddData(res.lens);
-    }
-  }
-  Postoffice::Get()->van()->Send(msg);
-}
-
-template <typename Val>
-void KVWorker<Val>::DefaultSlicer(
-    const KVPairs<Val>& send, const std::vector<Range>& ranges,
-    typename KVWorker<Val>::SlicedKVs* sliced) {
-  sliced->resize(ranges.size());
-
-  // find the positions in msg.key
-  size_t n = ranges.size();
-  std::vector<size_t> pos(n+1);
-  const Key* begin = send.keys.begin();
-  const Key* end = send.keys.end();
-  for (size_t i = 0; i < n; ++i) {
-    if (i == 0) {
-      pos[0] = std::lower_bound(begin, end, ranges[0].begin()) - begin;
-      begin += pos[0];
-    } else {
-      CHECK_EQ(ranges[i-1].end(), ranges[i].begin());
-    }
-    size_t len = std::lower_bound(begin, end, ranges[i].end()) - begin;
-    begin += len;
-    pos[i+1] = pos[i] + len;
-
-    // don't send it to severs for empty kv
-    sliced->at(i).first = (len != 0);
-  }
-  CHECK_EQ(pos[n], send.keys.size());
-  if (send.keys.empty()) return;
-
-  // the length of value
-  size_t k = 0, val_begin = 0, val_end = 0;
-  if (send.lens.empty()) {
-    k = send.vals.size() / send.keys.size();
-    CHECK_EQ(k * send.keys.size(), send.vals.size());
-  } else {
-    CHECK_EQ(send.keys.size(), send.lens.size());
-  }
-
-  // slice
-  for (size_t i = 0; i < n; ++i) {
-    if (pos[i+1] == pos[i]) {
-      sliced->at(i).first = false;
-      continue;
-    }
-    sliced->at(i).first = true;
-    auto& kv = sliced->at(i).second;
-    kv.keys = send.keys.segment(pos[i], pos[i+1]);
-    if (send.lens.size()) {
-      kv.lens = send.lens.segment(pos[i], pos[i+1]);
-      for (int l : kv.lens) val_end += l;
-      kv.vals = send.vals.segment(val_begin, val_end);
-      val_begin = val_end;
-    } else {
-      kv.vals = send.vals.segment(pos[i]*k, pos[i+1]*k);
-    }
-  }
-}
-
-template <typename Val>
-void KVWorker<Val>::Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs) {
-  // slice the message
-  SlicedKVs sliced;
-  slicer_(kvs, Postoffice::Get()->GetServerKeyRanges(), &sliced);
-
-  // need to add response first, since it will not always trigger the callback
-  int skipped = 0;
-  for (size_t i = 0; i < sliced.size(); ++i) {
-    if (!sliced[i].first) ++skipped;
-  }
-  obj_->AddResponse(timestamp, skipped);
-  if ((size_t)skipped == sliced.size()) {
-    RunCallback(timestamp);
-  }
-
-  for (size_t i = 0; i < sliced.size(); ++i) {
-    const auto& s = sliced[i];
-    if (!s.first) continue;
-    Message msg;
-    msg.meta.customer_id = obj_->id();
-    msg.meta.request     = true;
-    msg.meta.push        = push;
-    msg.meta.head        = cmd;
-    msg.meta.timestamp   = timestamp;
-    msg.meta.recver      = Postoffice::Get()->ServerRankToID(i);
-    const auto& kvs = s.second;
-    if (kvs.keys.size()) {
-      msg.AddData(kvs.keys);
-      msg.AddData(kvs.vals);
-      if (kvs.lens.size()) {
-        msg.AddData(kvs.lens);
-      }
-    }
-    Postoffice::Get()->van()->Send(msg);
-  }
-}
-
-
-template <typename Val>
-void KVWorker<Val>::Process(const Message& msg) {
-  if (msg.meta.simple_app) {
-    SimpleApp::Process(msg); return;
-  }
-
-  // store the data for pulling
-  int ts = msg.meta.timestamp;
-  if (!msg.meta.push && msg.data.size()) {
-    CHECK_GE(msg.data.size(), (size_t)2);
-    KVPairs<Val> kvs;
-    kvs.keys = msg.data[0];
-    kvs.vals = msg.data[1];
-    if (msg.data.size() > (size_t)2) {
-      kvs.lens = msg.data[2];
-    }
-    mu_.lock();
-    recv_kvs_[ts].push_back(kvs);
-    mu_.unlock();
-  }
-
-  // finished, run callbacks
-  if (obj_->NumResponse(ts) == Postoffice::Get()->num_servers() - 1)  {
-    RunCallback(ts);
-  }
-}
-template <typename Val>
-void KVWorker<Val>::RunCallback(int timestamp) {
-  mu_.lock();
-  auto it = callbacks_.find(timestamp);
-  if (it != callbacks_.end()) {
-    mu_.unlock();
-
-    CHECK(it->second);
-    it->second();
-
-    mu_.lock();
-    callbacks_.erase(it);
-  }
-  mu_.unlock();
-}
-
-template <typename Val>
-template <typename C, typename D>
-int KVWorker<Val>::Pull_(
-    const SArray<Key>& keys, C* vals, D* lens, int cmd, const Callback& cb) {
-  int ts = obj_->NewRequest(kServerGroup);
-  AddCallback(ts, [this, ts, keys, vals, lens, cb]() mutable {
-      mu_.lock();
-      auto& kvs = recv_kvs_[ts];
-      mu_.unlock();
-
-      // do check
-      size_t total_key = 0, total_val = 0;
-      for (const auto& s : kvs) {
-        Range range = FindRange(keys, s.keys.front(), s.keys.back()+1);
-        CHECK_EQ(range.size(), s.keys.size())
-            << "unmatched keys size from one server";
-        if (lens) CHECK_EQ(s.lens.size(), s.keys.size());
-        total_key += s.keys.size();
-        total_val += s.vals.size();
-      }
-      CHECK_EQ(total_key, keys.size()) << "lost some servers?";
-
-      // fill vals and lens
-      std::sort(kvs.begin(), kvs.end(), [](
-          const KVPairs<Val>& a, const KVPairs<Val>& b) {
-                  return a.keys.front() < b.keys.front();
-        });
-      CHECK_NOTNULL(vals);
-      if (vals->empty()) {
-        vals->resize(total_val);
-      } else {
-        CHECK_EQ(vals->size(), total_val);
-      }
-      Val* p_vals = vals->data();
-      int *p_lens = nullptr;
-      if (lens) {
-        if (lens->empty()) {
-          lens->resize(keys.size());
-        } else {
-          CHECK_EQ(lens->size(), keys.size());
-        }
-        p_lens = lens->data();
-      }
-      for (const auto& s : kvs) {
-        memcpy(p_vals, s.vals.data(), s.vals.size() * sizeof(Val));
-        p_vals += s.vals.size();
-        if (p_lens) {
-          memcpy(p_lens, s.lens.data(), s.lens.size() * sizeof(int));
-          p_lens += s.lens.size();
-        }
-      }
-
-      mu_.lock();
-      recv_kvs_.erase(ts);
-      mu_.unlock();
-      if (cb) cb();
-    });
-
-  KVPairs<Val> kvs; kvs.keys = keys;
-  Send(ts, false, cmd, kvs);
-  return ts;
-}
-
-}  // namespace ps
-#endif  // PS_KV_APP_H_
diff --git a/ps-lite/include/ps/ps.h b/ps-lite/include/ps/ps.h
deleted file mode 100644
index 7c76bfcc..00000000
--- a/ps-lite/include/ps/ps.h
+++ /dev/null
@@ -1,78 +0,0 @@
-/*!
- *  Copyright (c) 2015 by Contributors
- * @file   ps.h
- * \brief  The parameter server interface
- */
-#ifndef PS_PS_H_
-#define PS_PS_H_
-/** \brief basic setups in ps */
-#include "ps/base.h"
-/** \brief communicating with a pair of (int, string). */
-#include "ps/simple_app.h"
-/** \brief communcating with a list of key-value paris. */
-#include "ps/kv_app.h"
-namespace ps {
-/** \brief Returns the number of worker nodes */
-inline int NumWorkers() { return Postoffice::Get()->num_workers(); }
-/** \brief Returns the number of server nodes */
-inline int NumServers() { return Postoffice::Get()->num_servers(); }
-/** \brief Returns true if this node is a worker node */
-inline bool IsWorker() { return Postoffice::Get()->is_worker(); }
-/** \brief Returns true if this node is a server node. */
-inline bool IsServer() { return Postoffice::Get()->is_server(); }
-/** \brief Returns true if this node is a scheduler node. */
-inline bool IsScheduler() { return Postoffice::Get()->is_scheduler(); }
-/** \brief Returns the rank of this node in its group
- *
- * Each worker will have a unique rank within [0, NumWorkers()). So are
- * servers. This function is available only after \ref Start has been called.
- */
-inline int MyRank() { return Postoffice::Get()->my_rank(); }
-/**
- * \brief start the system
- *
- * This function will block until every nodes are started.
- * \param argv0 the program name, used for logging
- */
-inline void Start(const char* argv0 = nullptr) {
-  Postoffice::Get()->Start(argv0, true);
-}
-/**
- * \brief start the system
- *
- * This function will NOT block.
- * \param argv0 the program name, used for logging
- */
-inline void StartAsync(const char* argv0 = nullptr) {
-  Postoffice::Get()->Start(argv0, false);
-}
-/**
- * \brief terminate the system
- *
- * All nodes should call this function before existing. 
- * \param do_barrier whether to block until every node is finalized, default true.
- */
-inline void Finalize(const bool do_barrier = true) {
-  Postoffice::Get()->Finalize(do_barrier);
-}
-/**
- * \brief Register a callback to the system which is called after Finalize()
- *
- * The following codes are equal
- * \code {cpp}
- * RegisterExitCallback(cb);
- * Finalize();
- * \endcode
- *
- * \code {cpp}
- * Finalize();
- * cb();
- * \endcode
- * \param cb the callback function
- */
-inline void RegisterExitCallback(const std::function<void()>& cb) {
-  Postoffice::Get()->RegisterExitCallback(cb);
-}
-
-}  // namespace ps
-#endif  // PS_PS_H_
diff --git a/ps-lite/include/ps/range.h b/ps-lite/include/ps/range.h
deleted file mode 100644
index 7e5cc34a..00000000
--- a/ps-lite/include/ps/range.h
+++ /dev/null
@@ -1,26 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_RANGE_H_
-#define PS_RANGE_H_
-#include "ps/internal/utils.h"
-namespace ps {
-
-/**
- * \brief a range [begin, end)
- */
-class Range {
- public:
-  Range() : Range(0, 0) {}
-  Range(uint64_t begin, uint64_t end) : begin_(begin), end_(end) { }
-
-  uint64_t begin() const { return begin_; }
-  uint64_t end() const { return end_; }
-  uint64_t size() const { return end_ - begin_; }
- private:
-  uint64_t begin_;
-  uint64_t end_;
-};
-
-}  // namespace ps
-#endif  // PS_RANGE_H_
diff --git a/ps-lite/include/ps/sarray.h b/ps-lite/include/ps/sarray.h
deleted file mode 100644
index 4ad17dd9..00000000
--- a/ps-lite/include/ps/sarray.h
+++ /dev/null
@@ -1,315 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_SARRAY_H_
-#define PS_SARRAY_H_
-#include <string.h>
-#include <string>
-#include <vector>
-#include <memory>
-#include <sstream>
-#include "ps/internal/utils.h"
-#include "ps/range.h"
-namespace ps {
-
-/**
- * \brief Shared array
- *
- * A smart array that retains shared ownership. It provides similar
- * functionalities comparing to std::vector, including data(), size(),
- * operator[], resize(), clear(). SArray can be easily constructed from
- * std::vector, such as
- *
- * \code
- * std::vector<int> a(10); SArray<int> b(a);  // copying
- * std::shared_ptr<std::vector<int>> c(new std::vector<int>(10));
- * SArray<int> d(c);  // only pointer copying
- * \endcode
- *
- * SArray is also like a C pointer when copying and assigning, namely
- * both copy are assign are passing by pointers. The memory will be release only
- * if there is no copy exists. It is also can be cast without memory copy, such as
- *
- * \code
- * SArray<int> a(10);
- * SArray<char> b(a);  // now b.size() = 10 * sizeof(int);
- * \endcode
- *
- * \tparam V the value type
- */
-template<typename V>
-class SArray {
- public:
-  /** \brief empty constructor */
-  SArray() { }
-
-  /** \brief empty deconstrcutor */
-  ~SArray() { }
-
-  /**
-   * \brief Create an array with length n with initialized value
-   * \param size the length
-   * \param val the initial length (0 in default)
-   */
-  explicit SArray(size_t size, V val = 0) { resize(size, val); }
-
-
-  /**
-   * \brief construct from another SArray.
-   *
-   * Zero-copy constructor, namely just copy the pointer
-   *
-   * \tparam W the value type of the source array
-   * \param arr the source array
-   */
-  template <typename W>
-  explicit SArray(const SArray<W>& arr) { *this = arr; }
-
-  /**
-   * \brief construct from another SArray.
-   *
-   * Zero-copy constructor, namely just copy the pointer
-   *
-   * \tparam W the value type of the source array
-   * \param arr the source array
-   */
-  template <typename W> void operator=(const SArray<W>& arr) {
-    size_ = arr.size() * sizeof(W) / sizeof(V);
-    CHECK_EQ(size_ * sizeof(V), arr.size() * sizeof(W)) << "cannot be divided";
-    capacity_ = arr.capacity() * sizeof(W) / sizeof(V);
-    ptr_ = std::shared_ptr<V>(arr.ptr(), reinterpret_cast<V*>(arr.data()));
-  }
-
-  /**
-   * \brief construct from a c-array
-   *
-   * Zero-copy constructor, namely just copy the pointer
-   *
-   * \param data the source data
-   * \param size the length
-   * \param deletable whether or not can call `delete [] data` when the reference
-   * count goes 0
-   */
-
-  SArray(V* data, size_t size, bool deletable = false) {
-    if (deletable) {
-      reset(data, size, [](V* data){ delete [] data; });
-    } else {
-      reset(data, size, [](V* data) { });
-    }
-  }
-
-  /**
-   * \brief copy from a c-array
-   *
-   * \param data the source data
-   * \param size the length
-   */
-  void CopyFrom(const V* data, size_t size) {
-    resize(size);
-    memcpy(this->data(), data, size*sizeof(V));
-  }
-
-  /**
-   * \brief copy from another SArray
-   *
-   * \param other the source data
-   */
-  void CopyFrom(const SArray<V>& other) {
-    if (this == &other) return;
-    CopyFrom(other.data(), other.size());
-  }
-
-  /**
-   * \brief copy from an iterator
-   */
-  template <typename ForwardIt>
-  void CopyFrom(const ForwardIt& first, const ForwardIt& last) {
-    int size = static_cast<int>(std::distance(first, last));
-    V* data = new V[size];
-    reset(data, size, [](V* data){ delete [] data; });
-    auto it = first;
-    while (size-- > 0) { *data = *it; ++data; ++it; }
-  }
-
-  /**
-   * \brief construct from a std::vector, copy the data
-   */
-  explicit SArray(const std::vector<V>& vec) { CopyFrom(vec.data(), vec.size()); }
-
-  /**
-   * \brief construct from a shared std::vector pinter, no data copy
-   */
-  explicit SArray(const std::shared_ptr<std::vector<V>>& vec) {
-    ptr_ = std::shared_ptr<V>(vec, vec->data());
-    size_ = vec->size();
-    capacity_ = size_;
-  }
-
-  /** @brief Copy from a initializer_list */
-  template <typename W> SArray(const std::initializer_list<W>& list) {
-    CopyFrom(list.begin(), list.end());
-  }
-
-  /** @brief Copy from a initializer_list */
-  template <typename W> void operator=(const std::initializer_list<W>& list) {
-    CopyFrom(list.begin(), list.end());
-  }
-
-  /**
-   * @brief Reset the current data pointer with a deleter
-   */
-  template <typename Deleter>
-  void reset(V* data, size_t size, Deleter del) {
-    size_ = size; capacity_ = size; ptr_.reset(data, del);
-  }
-
-  /**
-   * @brief Resizes the array to size elements
-   *
-   * If size <= capacity_, then only change the size. otherwise, append size -
-   * current_size entries, and then set new value to val
-   */
-  void resize(size_t size, V val = 0) {
-    size_t cur_n = size_;
-    if (capacity_ >= size) {
-      size_ = size;
-    } else {
-      V* new_data = new V[size+5];
-      memcpy(new_data, data(), size_*sizeof(V));
-      reset(new_data, size, [](V* data){ delete [] data; });
-    }
-    if (size <= cur_n) return;
-    V* p = data() + cur_n;
-    if (val == 0) {
-      memset(p, 0, (size - cur_n)*sizeof(V));
-    } else {
-      for (size_t i = 0; i < size - cur_n; ++i) { *p = val; ++p; }
-    }
-  }
-
-  /**
-   * @brief Requests that the capacity be at least enough to contain n elements.
-   */
-  void reserve(size_t size) {
-    if (capacity_ >= size) { return; }
-    size_t old_size = size_;
-    resize(size);
-    size_ = old_size;
-  }
-
-  /** @brief release the memory */
-  void clear() { reset(nullptr, 0, [](V* data) {}); }
-
-
-  inline bool empty() const { return size() == 0; }
-  inline size_t size() const { return size_; }
-  inline size_t capacity() const { return capacity_; }
-
-  inline V* begin() { return data(); }
-  inline const V* begin() const { return data(); }
-  inline V* end() { return data() + size(); }
-  inline const V* end() const { return data() + size(); }
-
-  inline V* data() const { return ptr_.get(); }
-
-  /** \brief get the shared pointer */
-  inline std::shared_ptr<V>& ptr() { return ptr_; }
-  /** \brief get the const shared pointer */
-  inline const std::shared_ptr<V>& ptr() const { return ptr_; }
-
-  inline V back() const { CHECK(!empty()); return data()[size_-1]; }
-  inline V front() const { CHECK(!empty()); return data()[0]; }
-  inline V& operator[] (int i) { return data()[i]; }
-  inline const V& operator[] (int i) const { return data()[i]; }
-
-  inline void push_back(const V& val) {
-    if (size_ == capacity_) reserve(size_*2+5);
-    data()[size_++] = val;
-  }
-
-  void pop_back() { if (size_) --size_; }
-
-  void append(const SArray<V>& arr) {
-    if (arr.empty()) return;
-    auto orig_size = size_;
-    resize(size_ + arr.size());
-    memcpy(data()+orig_size, arr.data(), arr.size()*sizeof(V));
-  }
-
-
-  /**
-   * @brief Slice a segment, zero-copy
-   *
-   * @param begin the start index segment
-   * @param end the end index segment
-   * @return the segment [begin, end)
-   */
-  SArray<V> segment(size_t begin, size_t end) const {
-    CHECK_GE(end, begin); CHECK_LE(end, size());
-    SArray<V> ret;
-    ret.ptr_ = std::shared_ptr<V>(ptr_, data() + begin);
-    ret.size_ = end - begin;
-    ret.capacity_ = end - begin;
-    return ret;
-  }
-
- private:
-  size_t size_ = 0;
-  size_t capacity_ = 0;
-  std::shared_ptr<V> ptr_;
-};
-
-
-/**
- * \brief Find the index range of a segment of a sorted array such that the
- * entries in this segment is within [lower, upper). Assume
- * array values are ordered.
- *
- * An example
- * \code{cpp}
- * SArray<int> a{1 3 5 7 9};
- * CHECK_EQ(Range(1,3), FindRange(a, 2, 7);
- * \endcode
- *
- * \param arr the source array
- * \param lower the lower bound
- * \param upper the upper bound
- *
- * \return the index range
- */
-template<typename V>
-Range FindRange(const SArray<V>& arr, V lower, V upper) {
-  if (upper <= lower) return Range(0, 0);
-  auto lb = std::lower_bound(arr.begin(), arr.end(), lower);
-  auto ub = std::lower_bound(arr.begin(), arr.end(), upper);
-  return Range(lb - arr.begin(), ub - arr.begin());
-}
-
-
-/*! \brief returns a short debug string */
-template <typename V>
-inline std::string DebugStr(const V* data, int n, int m = 5) {
-  std::stringstream ss;
-  ss << "[" << n << "]: ";
-  if (n < 2 * m) {
-    for (int i = 0; i < n; ++i) ss << data[i] << " ";
-  } else {
-    for (int i = 0; i < m; ++i) ss << data[i] << " ";
-    ss << "... ";
-    for (int i = n-m; i < n; ++i) ss << data[i] << " ";
-  }
-  return ss.str();
-}
-
-/**
- * \brief print a debug string
- */
-template <typename V>
-std::ostream& operator<<(std::ostream& os, const SArray<V>& obj) {
-  os << DebugStr(obj.data(), obj.size());
-  return os;
-}
-
-}  // namespace ps
-#endif  // PS_SARRAY_H_
diff --git a/ps-lite/include/ps/simple_app.h b/ps-lite/include/ps/simple_app.h
deleted file mode 100644
index 70ce51bf..00000000
--- a/ps-lite/include/ps/simple_app.h
+++ /dev/null
@@ -1,179 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_SIMPLE_APP_H_
-#define PS_SIMPLE_APP_H_
-#include <string>
-#include "ps/internal/message.h"
-#include "ps/internal/postoffice.h"
-namespace ps {
-
-/**
- * \brief the format for a received request or reponse for \ref SimpleApp
- */
-struct SimpleData {
-  /** \brief the int head */
-  int head;
-  /** \brief the string body */
-  std::string body;
-  /** \brief sender's node id */
-  int sender;
-  /** \brief the associated timestamp */
-  int timestamp;
-};
-
-/**
- * \brief a simple app
- *
- * It provides basic communcation with a pair of int (head) and string (body)
- */
-class SimpleApp {
- public:
-  /**
-   * \brief constructor
-   * @param app_id the app id, should match with the remote node app with which this app
-   * is communicated
-   */
-  explicit SimpleApp(int app_id);
-
-  /** \brief deconstructor */
-  virtual ~SimpleApp() { delete obj_; obj_ = nullptr; }
-
-  /**
-   * \brief send a request to a remote node
-   *
-   * \param req_head request head
-   * \param req_body request body
-   * \param recv_id remote node id
-   *
-   * @return the timestamp of this request
-   */
-  virtual inline int Request(int req_head, const std::string& req_body, int recv_id);
-
-  /**
-   * \brief wait until a request is finished
-   *
-   * \param timestamp
-   */
-  virtual inline void Wait(int timestamp) { obj_->WaitRequest(timestamp); }
-
-
-  /**
-   * \brief send back a response for a request
-   * \param recv_req the received request
-   * \param the response body
-   */
-  virtual inline void Response(const SimpleData& recv_req, const std::string& res_body = "");
-
-  /**
-   * \brief the handle to proces a received request/respoonse
-   *
-   * \param recved the received request or response
-   * \param app this pointer
-   */
-  using Handle = std::function<void(const SimpleData& recved, SimpleApp* app)>;
-
-  /**
-   * \brief set the request handle
-   * \param request_handle the request handle
-   */
-  virtual inline void set_request_handle(const Handle& request_handle) {
-    CHECK(request_handle) << "invalid request handle";
-    request_handle_ = request_handle;
-  }
-
-  /**
-   * \brief set the response handle
-   * \param response_handle the response handle
-   */
-  virtual inline void set_response_handle(const Handle& response_handle) {
-    CHECK(response_handle) << "invalid response handle";
-    response_handle_ = response_handle;
-  }
-
-  /**
-   * \brief returns the customer
-   */
-  virtual inline Customer* get_customer() { return obj_; }
-
- protected:
-  /** \brief empty construct */
-  inline SimpleApp() : obj_(nullptr) {
-    request_handle_ = [](const SimpleData& recved, SimpleApp* app) {
-      app->Response(recved);
-    };
-    response_handle_ = [](const SimpleData& recved, SimpleApp* app) { };
-  }
-
-  /** \brief process a received message */
-  virtual inline void Process(const Message& msg);
-
-  /** \brief ps internal object */
-  Customer* obj_;
-
- private:
-  /** \brief request handle */
-  Handle request_handle_;
-  /** \brief request handle */
-  Handle response_handle_;
-};
-
-////////////////////////////////////////////////////////////////////////////////
-
-inline SimpleApp::SimpleApp(int app_id) : SimpleApp() {
-  using namespace std::placeholders;
-  obj_ = new Customer(app_id, std::bind(&SimpleApp::Process, this, _1));
-}
-
-inline int SimpleApp::Request(int req_head, const std::string& req_body, int recv_id) {
-  // setup message
-  Message msg;
-  msg.meta.head = req_head;
-  if (req_body.size()) msg.meta.body = req_body;
-  int ts = obj_->NewRequest(recv_id);
-  msg.meta.timestamp = ts;
-  msg.meta.request = true;
-  msg.meta.simple_app = true;
-  msg.meta.customer_id = obj_->id();
-
-  // send
-  for (int r : Postoffice::Get()->GetNodeIDs(recv_id)) {
-    msg.meta.recver = r;
-    Postoffice::Get()->van()->Send(msg);
-  }
-  return ts;
-}
-
-inline void SimpleApp::Response(const SimpleData& req, const std::string& res_body) {
-  // setup message
-  Message msg;
-  msg.meta.head = req.head;
-  if (res_body.size()) msg.meta.body = res_body;
-  msg.meta.timestamp = req.timestamp;
-  msg.meta.request = false;
-  msg.meta.simple_app = true;
-  msg.meta.customer_id = obj_->id();
-  msg.meta.recver = req.sender;
-
-  // send
-  Postoffice::Get()->van()->Send(msg);
-}
-
-
-inline void SimpleApp::Process(const Message& msg) {
-  SimpleData recv;
-  recv.sender    = msg.meta.sender;
-  recv.head      = msg.meta.head;
-  recv.body      = msg.meta.body;
-  recv.timestamp = msg.meta.timestamp;
-  if (msg.meta.request) {
-    CHECK(request_handle_);
-    request_handle_(recv, this);
-  } else {
-    CHECK(response_handle_);
-    response_handle_(recv, this);
-  }
-}
-
-}  // namespace ps
-#endif  // PS_SIMPLE_APP_H_
diff --git a/ps-lite/make/deps.mk b/ps-lite/make/deps.mk
deleted file mode 100644
index a76e18c1..00000000
--- a/ps-lite/make/deps.mk
+++ /dev/null
@@ -1,68 +0,0 @@
-# Install dependencies
-
-URL=https://raw.githubusercontent.com/mli/deps/master/build
-ifndef WGET
-WGET = wget
-endif
-
-# protobuf
-PROTOBUF = ${DEPS_PATH}/include/google/protobuf/message.h
-${PROTOBUF}:
-	$(eval FILE=protobuf-2.5.0.tar.gz)
-	$(eval DIR=protobuf-2.5.0)
-	rm -rf $(FILE) $(DIR)
-	$(WGET) $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
-	cd $(DIR) && export CFLAGS=-fPIC && export CXXFLAGS=-fPIC && ./configure -prefix=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
-	rm -rf $(FILE) $(DIR)
-
-# zmq
-ZMQ = ${DEPS_PATH}/include/zmq.h
-
-${ZMQ}:
-	$(eval FILE=zeromq-4.1.4.tar.gz)
-	$(eval DIR=zeromq-4.1.4)
-	rm -rf $(FILE) $(DIR)
-	$(WGET) $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
-	cd $(DIR) && export CFLAGS=-fPIC && export CXXFLAGS=-fPIC && ./configure -prefix=$(DEPS_PATH) --with-libsodium=no --with-libgssapi_krb5=no && $(MAKE) && $(MAKE) install
-	rm -rf $(FILE) $(DIR)
-
-# lz4
-LZ4 = ${DEPS_PATH}/include/lz4.h
-${LZ4}:
-	$(eval FILE=lz4-r129.tar.gz)
-	$(eval DIR=lz4-r129)
-	rm -rf $(FILE) $(DIR)
-	wget $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
-	cd $(DIR) && $(MAKE) && PREFIX=$(DEPS_PATH) $(MAKE) install
-	rm -rf $(FILE) $(DIR)
-
-# cityhash
-CITYHASH = ${DEPS_PATH}/include/city.h
-${CITYHASH}:
-	$(eval FILE=cityhash-1.1.1.tar.gz)
-	$(eval DIR=cityhash-1.1.1)
-	rm -rf $(FILE) $(DIR)
-	wget $(URL)/$(FILE) && tar --no-same-owner -zxf $(FILE)
-	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) --enable-sse4.2 && $(MAKE) CXXFLAGS="-g -O3 -msse4.2" && $(MAKE) install
-	rm -rf $(FILE) $(DIR)
-
-
-# # gflags
-# ${DEPS_PATH}/include/google/gflags.h:
-# 	$(eval FILE=gflags-2.0-no-svn-files.tar.gz)
-# 	$(eval DIR=gflags-2.0)
-# 	rm -rf $(FILE) $(DIR)
-# 	wget $(URL)/$(FILE) && tar -zxf $(FILE)
-# 	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
-# 	rm -rf $(FILE) $(DIR)
-# gflags: | ${DEPS_PATH}/include/google/gflags.h
-
-# # glog
-# ${DEPS_PATH}/include/glog/logging.h: | ${DEPS_PATH}/include/google/gflags.h
-# 	$(eval FILE=v0.3.4.tar.gz)
-# 	$(eval DIR=glog-0.3.4)
-# 	rm -rf $(FILE) $(DIR)
-# 	wget https://github.com/google/glog/archive/$(FILE) && tar -zxf $(FILE)
-# 	cd $(DIR) && ./configure -prefix=$(DEPS_PATH) --with-gflags=$(DEPS_PATH) && $(MAKE) && $(MAKE) install
-# 	rm -rf $(FILE) $(DIR)
-# glog: | ${DEPS_PATH}/include/glog/logging.h
diff --git a/ps-lite/make/ps.mk b/ps-lite/make/ps.mk
deleted file mode 100644
index 0b0f678d..00000000
--- a/ps-lite/make/ps.mk
+++ /dev/null
@@ -1,13 +0,0 @@
-#---------------------------------------------------------------------------------------
-#  parameter server configuration script
-#
-#  include ps.mk after the variables are set
-#
-#----------------------------------------------------------------------------------------
-
-ifeq ($(USE_KEY32), 1)
-ADD_CFLAGS += -DUSE_KEY32=1
-endif
-
-PS_LDFLAGS_SO = -L$(DEPS_PATH)/lib -lprotobuf-lite -lzmq
-PS_LDFLAGS_A = $(addprefix $(DEPS_PATH)/lib/, libprotobuf-lite.a libzmq.a)
diff --git a/ps-lite/src/customer.cc b/ps-lite/src/customer.cc
deleted file mode 100644
index e88e8ab2..00000000
--- a/ps-lite/src/customer.cc
+++ /dev/null
@@ -1,66 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#include "ps/internal/customer.h"
-#include "ps/internal/postoffice.h"
-namespace ps {
-
-const int Node::kEmpty = std::numeric_limits<int>::max();
-const int Meta::kEmpty = std::numeric_limits<int>::max();
-
-Customer::Customer(int id, const Customer::RecvHandle& recv_handle)
-    : id_(id), recv_handle_(recv_handle) {
-  Postoffice::Get()->AddCustomer(this);
-  recv_thread_ = std::unique_ptr<std::thread>(new std::thread(&Customer::Receiving, this));
-}
-
-Customer::~Customer() {
-  Postoffice::Get()->RemoveCustomer(this);
-  Message msg;
-  msg.meta.control.cmd = Control::TERMINATE;
-  recv_queue_.Push(msg);
-  recv_thread_->join();
-}
-
-int Customer::NewRequest(int recver) {
-  std::lock_guard<std::mutex> lk(tracker_mu_);
-  int num = Postoffice::Get()->GetNodeIDs(recver).size();
-  tracker_.push_back(std::make_pair(num, 0));
-  return tracker_.size() - 1;
-}
-
-void Customer::WaitRequest(int timestamp) {
-  std::unique_lock<std::mutex> lk(tracker_mu_);
-  tracker_cond_.wait(lk, [this, timestamp]{
-      return tracker_[timestamp].first == tracker_[timestamp].second;
-    });
-}
-
-int Customer::NumResponse(int timestamp) {
-  std::lock_guard<std::mutex> lk(tracker_mu_);
-  return tracker_[timestamp].second;
-}
-
-void Customer::AddResponse(int timestamp, int num) {
-  std::lock_guard<std::mutex> lk(tracker_mu_);
-  tracker_[timestamp].second += num;
-}
-
-void Customer::Receiving() {
-  while (true) {
-    Message recv;
-    recv_queue_.WaitAndPop(&recv);
-    if (!recv.meta.control.empty() &&
-        recv.meta.control.cmd == Control::TERMINATE) {
-      break;
-    }
-    recv_handle_(recv);
-    if (!recv.meta.request) {
-      std::lock_guard<std::mutex> lk(tracker_mu_);
-      tracker_[recv.meta.timestamp].second++;
-      tracker_cond_.notify_all();
-    }
-  }
-}
-
-}  // namespace ps
diff --git a/ps-lite/src/meta.proto b/ps-lite/src/meta.proto
deleted file mode 100644
index c23dd8c3..00000000
--- a/ps-lite/src/meta.proto
+++ /dev/null
@@ -1,49 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-package ps;
-option optimize_for = LITE_RUNTIME;
-
-message PBNode {
-  // the node role
-  required int32 role = 1;
-  // node id
-  optional int32 id = 2;
-  // hostname or ip
-  optional string hostname = 3;
-  // the port this node is binding
-  optional int32 port = 4;
-  // whether this node is created by failover
-  optional bool is_recovery = 5;
-}
-
-// system control info
-message PBControl {
-  required int32 cmd = 1;
-  repeated PBNode node = 2;
-  optional int32 barrier_group = 3;
-  optional uint64 msg_sig = 4;
-}
-
-// mete information about a message
-message PBMeta {
-  // message.head
-  optional int32 head = 1;
-  // message.body
-  optional bytes body = 2;
-  // if set, then it is system control task. otherwise, it is for app
-  optional PBControl control = 3;
-  // true: a request task
-  // false: the response task to the request task with the same *time*
-  optional bool request = 4 [default = false];
-  // the unique id of an customer
-  optional int32 customer_id = 7;
-  // the timestamp of this message
-  optional int32 timestamp = 8;
-  // data type of message.data[i]
-  repeated int32 data_type = 9 [packed=true];
-  // whether or not a push message
-  optional bool push = 5;
-  // whether or not it's for SimpleApp
-  optional bool simple_app = 6 [default = false];
-}
diff --git a/ps-lite/src/network_utils.h b/ps-lite/src/network_utils.h
deleted file mode 100644
index 534616c9..00000000
--- a/ps-lite/src/network_utils.h
+++ /dev/null
@@ -1,258 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- * @file   network_utils.h
- * @brief  network utilities
- */
-#ifndef PS_NETWORK_UTILS_H_
-#define PS_NETWORK_UTILS_H_
-#include <unistd.h>
-#ifdef _MSC_VER
-#include <tchar.h>
-#include <winsock2.h>
-#include <windows.h>
-#include <iphlpapi.h>
-#undef interface
-#else
-#include <net/if.h>
-#include <arpa/inet.h>
-#include <ifaddrs.h>
-#include <netinet/in.h>
-#endif
-#include <string>
-
-namespace ps {
-
-/**
- * \brief return the IP address for given interface eth0, eth1, ...
- */
-void GetIP(const std::string& interface, std::string* ip) {
-#ifdef _MSC_VER
-  typedef std::basic_string<TCHAR> tstring;
-  // Try to get the Adapters-info table, so we can given useful names to the IP
-  // addresses we are returning.  Gotta call GetAdaptersInfo() up to 5 times to handle
-  // the potential race condition between the size-query call and the get-data call.
-  // I love a well-designed API :^P
-  IP_ADAPTER_INFO * pAdapterInfo = NULL;
-  {
-    ULONG bufLen = 0;
-    for (int i = 0; i < 5; i++) {
-      DWORD apRet = GetAdaptersInfo(pAdapterInfo, &bufLen);
-      if (apRet == ERROR_BUFFER_OVERFLOW) {
-        free(pAdapterInfo);  // in case we had previously allocated it
-        pAdapterInfo = static_cast<IP_ADAPTER_INFO*>(malloc(bufLen));
-      } else if (apRet == ERROR_SUCCESS) {
-        break;
-      } else {
-        free(pAdapterInfo);
-        pAdapterInfo = NULL;
-        break;
-      }
-    }
-  }
-  if (pAdapterInfo) {
-    tstring keybase = _T(
-        "SYSTEM\\CurrentControlSet\\Control\\Network\\{4D36E972-E325-11CE-BFC1-08002BE10318}\\");
-    tstring connection = _T("\\Connection");
-
-    IP_ADAPTER_INFO *curpAdapterInfo = pAdapterInfo;
-    while (curpAdapterInfo) {
-      HKEY hKEY;
-      std::string AdapterName = curpAdapterInfo->AdapterName;
-      // GUID only ascii
-      tstring key_set = keybase + tstring(AdapterName.begin(), AdapterName.end()) + connection;
-      LPCTSTR data_Set = key_set.c_str();
-      LPCTSTR dwValue = NULL;
-      if (ERROR_SUCCESS ==
-          ::RegOpenKeyEx(HKEY_LOCAL_MACHINE, data_Set, 0, KEY_READ, &hKEY)) {
-        DWORD dwSize = 0;
-        DWORD dwType = REG_SZ;
-        if (ERROR_SUCCESS ==
-            ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
-          dwValue = new TCHAR[dwSize];
-          if (ERROR_SUCCESS ==
-              ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
-            // interface name must only ascii
-            tstring tstr = dwValue;
-            std::string s(tstr.begin(), tstr.end());
-            if (s == interface) {
-              *ip = curpAdapterInfo->IpAddressList.IpAddress.String;
-              break;
-            }
-          }
-        }
-        ::RegCloseKey(hKEY);
-      }
-      curpAdapterInfo = curpAdapterInfo->Next;
-    }
-    free(pAdapterInfo);
-  }
-#else
-  struct ifaddrs * ifAddrStruct = NULL;
-  struct ifaddrs * ifa = NULL;
-  void * tmpAddrPtr = NULL;
-
-  getifaddrs(&ifAddrStruct);
-  for (ifa = ifAddrStruct; ifa != NULL; ifa = ifa->ifa_next) {
-    if (ifa->ifa_addr == NULL) continue;
-    if (ifa->ifa_addr->sa_family == AF_INET) {
-      // is a valid IP4 Address
-      tmpAddrPtr = &(reinterpret_cast<struct sockaddr_in*>(ifa->ifa_addr))->sin_addr;
-      char addressBuffer[INET_ADDRSTRLEN];
-      inet_ntop(AF_INET, tmpAddrPtr, addressBuffer, INET_ADDRSTRLEN);
-      if (strncmp(ifa->ifa_name,
-                  interface.c_str(),
-                  interface.size()) == 0) {
-        *ip = addressBuffer;
-        break;
-      }
-    }
-  }
-  if (ifAddrStruct != NULL) freeifaddrs(ifAddrStruct);
-#endif
-}
-
-
-/**
- * \brief return the IP address and Interface the first interface which is not
- * loopback
- *
- * only support IPv4
- */
-void GetAvailableInterfaceAndIP(
-    std::string* interface, std::string* ip) {
-#ifdef _MSC_VER
-  typedef std::basic_string<TCHAR> tstring;
-  IP_ADAPTER_INFO * pAdapterInfo = NULL;
-  {
-    ULONG bufLen = 0;
-    for (int i = 0; i < 5; i++) {
-      DWORD apRet = GetAdaptersInfo(pAdapterInfo, &bufLen);
-      if (apRet == ERROR_BUFFER_OVERFLOW) {
-        free(pAdapterInfo);  // in case we had previously allocated it
-        pAdapterInfo = static_cast<IP_ADAPTER_INFO*>(malloc(bufLen));
-      } else if (apRet == ERROR_SUCCESS) {
-        break;
-      } else {
-        free(pAdapterInfo);
-        pAdapterInfo = NULL;
-        break;
-      }
-    }
-  }
-  if (pAdapterInfo) {
-    tstring keybase = _T(
-        "SYSTEM\\CurrentControlSet\\Control\\Network\\{4D36E972-E325-11CE-BFC1-08002BE10318}\\");
-    tstring connection = _T("\\Connection");
-
-    IP_ADAPTER_INFO *curpAdapterInfo = pAdapterInfo;
-    HKEY hKEY = NULL;
-    while (curpAdapterInfo) {
-      std::string curip(curpAdapterInfo->IpAddressList.IpAddress.String);
-      if (curip == "127.0.0.1") {
-        curpAdapterInfo = curpAdapterInfo->Next;
-        continue;
-      }
-      if (curip == "0.0.0.0") {
-        curpAdapterInfo = curpAdapterInfo->Next;
-        continue;
-      }
-
-      std::string AdapterName = curpAdapterInfo->AdapterName;
-      // GUID only ascii
-      tstring key_set = keybase + tstring(AdapterName.begin(), AdapterName.end()) + connection;
-      LPCTSTR data_Set = key_set.c_str();
-      LPCTSTR dwValue = NULL;
-      if (ERROR_SUCCESS ==
-          ::RegOpenKeyEx(HKEY_LOCAL_MACHINE, data_Set, 0, KEY_READ, &hKEY)) {
-        DWORD dwSize = 0;
-        DWORD dwType = REG_SZ;
-        if (ERROR_SUCCESS ==
-            ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
-          dwValue = new TCHAR[dwSize];
-          if (ERROR_SUCCESS ==
-              ::RegQueryValueEx(hKEY, _T("Name"), 0, &dwType, (LPBYTE)dwValue, &dwSize)) {
-            // interface name must only ascii
-            tstring tstr = dwValue;
-            std::string s(tstr.begin(), tstr.end());
-
-            *interface = s;
-            *ip = curip;
-            break;
-          }
-        }
-        ::RegCloseKey(hKEY);
-        hKEY = NULL;
-      }
-      curpAdapterInfo = curpAdapterInfo->Next;
-    }
-    if (hKEY != NULL) {
-      ::RegCloseKey(hKEY);
-    }
-    free(pAdapterInfo);
-  }
-#else
-  struct ifaddrs * ifAddrStruct = nullptr;
-  struct ifaddrs * ifa = nullptr;
-
-  interface->clear();
-  ip->clear();
-  getifaddrs(&ifAddrStruct);
-  for (ifa = ifAddrStruct; ifa != nullptr; ifa = ifa->ifa_next) {
-    if (nullptr == ifa->ifa_addr) continue;
-
-    if (AF_INET == ifa->ifa_addr->sa_family &&
-        0 == (ifa->ifa_flags & IFF_LOOPBACK)) {
-      char address_buffer[INET_ADDRSTRLEN];
-      void* sin_addr_ptr = &(reinterpret_cast<struct sockaddr_in*>(ifa->ifa_addr))->sin_addr;
-      inet_ntop(AF_INET, sin_addr_ptr, address_buffer, INET_ADDRSTRLEN);
-
-      *ip = address_buffer;
-      *interface = ifa->ifa_name;
-
-      break;
-    }
-  }
-  if (nullptr != ifAddrStruct) freeifaddrs(ifAddrStruct);
-  return;
-#endif
-}
-
-/**
- * \brief return an available port on local machine
- *
- * only support IPv4
- * \return 0 on failure
- */
-int GetAvailablePort() {
-  struct sockaddr_in addr;
-  addr.sin_port = htons(0);  // have system pick up a random port available for me
-  addr.sin_family = AF_INET;  // IPV4
-  addr.sin_addr.s_addr = htonl(INADDR_ANY);  // set our addr to any interface
-
-  int sock = socket(AF_INET, SOCK_STREAM, 0);
-  if (0 != bind(sock, (struct sockaddr*)&addr, sizeof(struct sockaddr_in))) {
-    perror("bind():");
-    return 0;
-  }
-#ifdef _MSC_VER
-  int addr_len = sizeof(struct sockaddr_in);
-#else
-  socklen_t addr_len = sizeof(struct sockaddr_in);
-#endif
-
-  if (0 != getsockname(sock, (struct sockaddr*)&addr, &addr_len)) {
-    perror("getsockname():");
-    return 0;
-  }
-
-  int ret_port = ntohs(addr.sin_port);
-#ifdef  _MSC_VER
-  closesocket(sock);
-#else
-  close(sock);
-#endif
-  return ret_port;
-}
-
-}  // namespace ps
-#endif  // PS_NETWORK_UTILS_H_
diff --git a/ps-lite/src/postoffice.cc b/ps-lite/src/postoffice.cc
deleted file mode 100644
index ddc25110..00000000
--- a/ps-lite/src/postoffice.cc
+++ /dev/null
@@ -1,176 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#include <unistd.h>
-#include <thread>
-#include <chrono>
-#include "ps/internal/postoffice.h"
-#include "ps/internal/message.h"
-#include "ps/base.h"
-
-namespace ps {
-Postoffice::Postoffice() {
-  van_ = Van::Create("zmq");
-  env_ref_ = Environment::_GetSharedRef();
-  const char* val = NULL;
-  val = CHECK_NOTNULL(Environment::Get()->find("DMLC_NUM_WORKER"));
-  num_workers_ = atoi(val);
-  val =  CHECK_NOTNULL(Environment::Get()->find("DMLC_NUM_SERVER"));
-  num_servers_ = atoi(val);
-  val = CHECK_NOTNULL(Environment::Get()->find("DMLC_ROLE"));
-  std::string role(val);
-  is_worker_ = role == "worker";
-  is_server_ = role == "server";
-  is_scheduler_ = role == "scheduler";
-  verbose_ = GetEnv("PS_VERBOSE", 0);
-}
-
-void Postoffice::Start(const char* argv0, const bool do_barrier) {
-  // init glog
-  if (argv0) {
-    dmlc::InitLogging(argv0);
-  } else {
-    dmlc::InitLogging("ps-lite\0");
-  }
-
-  // init node info.
-  for (int i = 0; i < num_workers_; ++i) {
-    int id = WorkerRankToID(i);
-    for (int g : {id, kWorkerGroup, kWorkerGroup + kServerGroup,
-            kWorkerGroup + kScheduler,
-            kWorkerGroup + kServerGroup + kScheduler}) {
-      node_ids_[g].push_back(id);
-    }
-  }
-
-  for (int i = 0; i < num_servers_; ++i) {
-    int id = ServerRankToID(i);
-    for (int g : {id, kServerGroup, kWorkerGroup + kServerGroup,
-            kServerGroup + kScheduler,
-            kWorkerGroup + kServerGroup + kScheduler}) {
-      node_ids_[g].push_back(id);
-    }
-  }
-
-  for (int g : {kScheduler, kScheduler + kServerGroup + kWorkerGroup,
-          kScheduler + kWorkerGroup, kScheduler + kServerGroup}) {
-    node_ids_[g].push_back(kScheduler);
-  }
-
-  // start van
-  van_->Start();
-
-  // record start time
-  start_time_ = time(NULL);
-
-  // do a barrier here
-  if (do_barrier) Barrier(kWorkerGroup + kServerGroup + kScheduler);
-}
-
-void Postoffice::Finalize(const bool do_barrier) {
-  if (do_barrier) Barrier(kWorkerGroup + kServerGroup + kScheduler);
-  van_->Stop();
-  if (exit_callback_) exit_callback_();
-}
-
-
-void Postoffice::AddCustomer(Customer* customer) {
-  std::lock_guard<std::mutex> lk(mu_);
-  int id = CHECK_NOTNULL(customer)->id();
-  CHECK_EQ(customers_.count(id), (size_t)0) << "id " << id << " already exists";
-  customers_[id] = customer;
-}
-
-
-void Postoffice::RemoveCustomer(Customer* customer) {
-  std::lock_guard<std::mutex> lk(mu_);
-  int id = CHECK_NOTNULL(customer)->id();
-  customers_.erase(id);
-}
-
-
-Customer* Postoffice::GetCustomer(int id, int timeout) const {
-  Customer* obj = nullptr;
-  for (int i = 0; i < timeout*1000+1; ++i) {
-    {
-      std::lock_guard<std::mutex> lk(mu_);
-      const auto it = customers_.find(id);
-      if (it != customers_.end()) {
-        obj = it->second;
-        break;
-      }
-    }
-    std::this_thread::sleep_for(std::chrono::milliseconds(1));
-  }
-  return obj;
-}
-
-void Postoffice::Barrier(int node_group) {
-  if (GetNodeIDs(node_group).size() <= 1) return;
-  auto role = van_->my_node().role;
-  if (role == Node::SCHEDULER) {
-    CHECK(node_group & kScheduler);
-  } else if (role == Node::WORKER) {
-    CHECK(node_group & kWorkerGroup);
-  } else if (role == Node::SERVER) {
-    CHECK(node_group & kServerGroup);
-  }
-
-  std::unique_lock<std::mutex> ulk(barrier_mu_);
-  barrier_done_ = false;
-  Message req;
-  req.meta.recver = kScheduler;
-  req.meta.request = true;
-  req.meta.control.cmd = Control::BARRIER;
-  req.meta.control.barrier_group = node_group;
-  req.meta.timestamp = van_->GetTimestamp();
-  CHECK_GT(van_->Send(req), 0);
-
-  barrier_cond_.wait(ulk, [this] {
-      return barrier_done_;
-    });
-}
-
-const std::vector<Range>& Postoffice::GetServerKeyRanges() {
-  if (server_key_ranges_.empty()) {
-    for (int i = 0; i < num_servers_; ++i) {
-      server_key_ranges_.push_back(Range(
-          kMaxKey / num_servers_ * i,
-          kMaxKey / num_servers_ * (i+1)));
-    }
-  }
-  return server_key_ranges_;
-}
-
-void Postoffice::Manage(const Message& recv) {
-  CHECK(!recv.meta.control.empty());
-  const auto& ctrl = recv.meta.control;
-  if (ctrl.cmd == Control::BARRIER && !recv.meta.request) {
-    barrier_mu_.lock();
-    barrier_done_ = true;
-    barrier_mu_.unlock();
-    barrier_cond_.notify_all();
-  }
-}
-
-std::vector<int> Postoffice::GetDeadNodes(int t) {
-  std::vector<int> dead_nodes;
-  if (!van_->IsReady() || t == 0) return dead_nodes;
-
-  time_t curr_time = time(NULL);
-  const auto& nodes = is_scheduler_
-    ? GetNodeIDs(kWorkerGroup + kServerGroup)
-    : GetNodeIDs(kScheduler);
-  {
-    std::lock_guard<std::mutex> lk(heartbeat_mu_);
-    for (int r : nodes) {
-      auto it = heartbeats_.find(r);
-      if ((it == heartbeats_.end() || it->second + t < curr_time)
-            && start_time_ + t < curr_time) {
-        dead_nodes.push_back(r);
-      }
-    }
-  }
-  return dead_nodes;
-}
-}  // namespace ps
diff --git a/ps-lite/src/resender.h b/ps-lite/src/resender.h
deleted file mode 100644
index 72bb827a..00000000
--- a/ps-lite/src/resender.h
+++ /dev/null
@@ -1,141 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_RESENDER_H_
-#define PS_RESENDER_H_
-#include <chrono>
-#include <vector>
-#include <unordered_set>
-#include <unordered_map>
-namespace ps {
-
-/**
- * \brief resend a messsage if no ack is received within a given time
- */
-class Resender {
- public:
-  /**
-   * \param timeout timeout in millisecond
-   */
-  Resender(int timeout, int max_num_retry, Van* van) {
-    timeout_ = timeout;
-    max_num_retry_ = max_num_retry;
-    van_ = van;
-    monitor_ = new std::thread(&Resender::Monitoring, this);
-  }
-  ~Resender() {
-    exit_ = true;
-    monitor_->join();
-    delete monitor_;
-  }
-
-  /**
-   * \brief add an outgoining message
-   *
-   */
-  void AddOutgoing(const Message& msg) {
-    if (msg.meta.control.cmd == Control::ACK) return;
-    CHECK_NE(msg.meta.timestamp, Meta::kEmpty) << msg.DebugString();
-    auto key = GetKey(msg);
-    std::lock_guard<std::mutex> lk(mu_);
-    // already buffered, which often due to call Send by the monitor thread
-    if (send_buff_.find(key) != send_buff_.end()) return;
-
-    auto& ent = send_buff_[key];
-    ent.msg = msg;
-    ent.send = Now();
-    ent.num_retry = 0;
-  }
-
-  /**
-   * \brief add an incomming message
-   * \brief return true if msg has been added before or a ACK message
-   */
-  bool AddIncomming(const Message& msg) {
-    // a message can be received by multiple times
-    if (msg.meta.control.cmd == Control::TERMINATE) {
-      return false;
-    } else if (msg.meta.control.cmd == Control::ACK) {
-      mu_.lock();
-      auto key = msg.meta.control.msg_sig;
-      auto it = send_buff_.find(key);
-      if (it != send_buff_.end()) send_buff_.erase(it);
-      mu_.unlock();
-      return true;
-    } else {
-      mu_.lock();
-      auto key = GetKey(msg);
-      auto it = acked_.find(key);
-      bool duplicated = it != acked_.end();
-      if (!duplicated) acked_.insert(key);
-      mu_.unlock();
-      // send back ack message (even if it is duplicated)
-      Message ack;
-      ack.meta.recver = msg.meta.sender;
-      ack.meta.sender = msg.meta.recver;
-      ack.meta.control.cmd = Control::ACK;
-      ack.meta.control.msg_sig = key;
-      van_->Send(ack);
-      // warning
-      if (duplicated) LOG(WARNING) << "Duplicated message: " << msg.DebugString();
-      return duplicated;
-    }
-  }
-
- private:
-  using Time = std::chrono::milliseconds;
-  // the buffer entry
-  struct Entry {
-    Message msg;
-    Time send;
-    int num_retry = 0;
-  };
-  std::unordered_map<uint64_t, Entry> send_buff_;
-
-  uint64_t GetKey(const Message& msg) {
-    CHECK_NE(msg.meta.timestamp, Meta::kEmpty) << msg.DebugString();
-    uint16_t id = msg.meta.customer_id;
-    uint8_t sender = msg.meta.sender == Node::kEmpty ?
-                     van_->my_node().id : msg.meta.sender;
-    uint8_t recver = msg.meta.recver;
-    return (static_cast<uint64_t>(id) << 48) |
-        (static_cast<uint64_t>(sender) << 40) |
-        (static_cast<uint64_t>(recver) << 32) |
-        (msg.meta.timestamp << 1) | msg.meta.request;
-  }
-  Time Now() {
-    return std::chrono::duration_cast<Time>(
-        std::chrono::high_resolution_clock::now().time_since_epoch());
-  }
-
-  void Monitoring() {
-    while (!exit_) {
-      std::this_thread::sleep_for(Time(timeout_));
-      std::vector<Message> resend;
-      Time now = Now();
-      mu_.lock();
-      for (auto& it : send_buff_) {
-        if (it.second.send + Time(timeout_) * (1+it.second.num_retry) < now) {
-          resend.push_back(it.second.msg);
-          ++it.second.num_retry;
-          LOG(WARNING) << van_->my_node().ShortDebugString()
-                       << ": Timeout to get the ACK message. Resend (retry="
-                       << it.second.num_retry << ") " << it.second.msg.DebugString();
-          CHECK_LT(it.second.num_retry, max_num_retry_);
-        }
-      }
-      mu_.unlock();
-
-      for (const auto& msg : resend) van_->Send(msg);
-    }
-  }
-  std::thread* monitor_;
-  std::unordered_set<uint64_t> acked_;
-  std::atomic<bool> exit_{false};
-  std::mutex mu_;
-  int timeout_;
-  int max_num_retry_;
-  Van* van_;
-};
-}  // namespace ps
-#endif  // PS_RESENDER_H_
diff --git a/ps-lite/src/van.cc b/ps-lite/src/van.cc
deleted file mode 100644
index 9b4e93a6..00000000
--- a/ps-lite/src/van.cc
+++ /dev/null
@@ -1,422 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#include "ps/internal/van.h"
-#include <thread>
-#include <chrono>
-#include "ps/base.h"
-#include "ps/sarray.h"
-#include "ps/internal/postoffice.h"
-#include "ps/internal/customer.h"
-#include "./network_utils.h"
-#include "./meta.pb.h"
-#include "./zmq_van.h"
-#include "./resender.h"
-namespace ps {
-
-// interval in second between to heartbeast signals. 0 means no heartbeat.
-// don't send heartbeast in default. because if the scheduler received a
-// heartbeart signal from a node before connected to that node, then it could be
-// problem.
-static const int kDefaultHeartbeatInterval = 0;
-
-Van* Van::Create(const std::string& type) {
-  if (type == "zmq") {
-    return new ZMQVan();
-  } else {
-    LOG(FATAL) << "unsupported van type: " << type;
-    return nullptr;
-  }
-}
-
-void Van::Start() {
-  // get scheduler info
-  scheduler_.hostname = std::string(CHECK_NOTNULL(Environment::Get()->find("DMLC_PS_ROOT_URI")));
-  scheduler_.port     = atoi(CHECK_NOTNULL(Environment::Get()->find("DMLC_PS_ROOT_PORT")));
-  scheduler_.role     = Node::SCHEDULER;
-  scheduler_.id       = kScheduler;
-  is_scheduler_       = Postoffice::Get()->is_scheduler();
-
-  // get my node info
-  if (is_scheduler_) {
-    my_node_ = scheduler_;
-  } else {
-    auto role = is_scheduler_ ? Node::SCHEDULER :
-                (Postoffice::Get()->is_worker() ? Node::WORKER : Node::SERVER);
-    const char* nhost = Environment::Get()->find("DMLC_NODE_HOST");
-    std::string ip;
-    if (nhost) ip = std::string(nhost);
-    if (ip.empty()) {
-      const char*  itf = Environment::Get()->find("DMLC_INTERFACE");
-      std::string interface;
-      if (itf) interface = std::string(itf);
-      if (interface.size()) {
-        GetIP(interface, &ip);
-      } else {
-        GetAvailableInterfaceAndIP(&interface, &ip);
-      }
-      CHECK(!interface.empty()) << "failed to get the interface";
-    }
-    int port = GetAvailablePort();
-    const char* pstr = Environment::Get()->find("PORT");
-    if (pstr) port = atoi(pstr);
-    CHECK(!ip.empty()) << "failed to get ip";
-    CHECK(port) << "failed to get a port";
-    my_node_.hostname = ip;
-    my_node_.role     = role;
-    my_node_.port     = port;
-    // cannot determine my id now, the scheduler will assign it later
-    // set it explicitly to make re-register within a same process possible
-    my_node_.id = Node::kEmpty;
-  }
-
-  // bind.
-  my_node_.port = Bind(my_node_, is_scheduler_ ? 0 : 40);
-  PS_VLOG(1) << "Bind to " << my_node_.DebugString();
-  CHECK_NE(my_node_.port, -1) << "bind failed";
-
-  // connect to the scheduler
-  Connect(scheduler_);
-
-  // for debug use
-  if (Environment::Get()->find("PS_DROP_MSG")) {
-    drop_rate_ = atoi(Environment::Get()->find("PS_DROP_MSG"));
-  }
-  // start receiver
-  receiver_thread_ = std::unique_ptr<std::thread>(
-      new std::thread(&Van::Receiving, this));
-
-  if (!is_scheduler_) {
-    // let the scheduler know myself
-    Message msg;
-    msg.meta.recver = kScheduler;
-    msg.meta.control.cmd = Control::ADD_NODE;
-    msg.meta.control.node.push_back(my_node_);
-    msg.meta.timestamp = timestamp_++;
-    Send(msg);
-  }
-  // wait until ready
-  while (!ready_) {
-    std::this_thread::sleep_for(std::chrono::milliseconds(1));
-  }
-
-  // resender
-  if (Environment::Get()->find("PS_RESEND") && atoi(Environment::Get()->find("PS_RESEND")) != 0) {
-    int timeout = 1000;
-    if (Environment::Get()->find("PS_RESEND_TIMEOUT")) {
-      timeout = atoi(Environment::Get()->find("PS_RESEND_TIMEOUT"));
-    }
-    resender_ = new Resender(timeout, 10, this);
-  }
-
-  if (!is_scheduler_) {
-    // start heartbeat thread
-    heartbeat_thread_ = std::unique_ptr<std::thread>(
-      new std::thread(&Van::Heartbeat, this));
-  }
-}
-
-void Van::Stop() {
-  // stop threads
-  Message exit;
-  exit.meta.control.cmd = Control::TERMINATE;
-  exit.meta.recver = my_node_.id;
-  SendMsg(exit);
-  receiver_thread_->join();
-  if (!is_scheduler_) heartbeat_thread_->join();
-  if (resender_) delete resender_;
-}
-
-int Van::Send(const Message& msg) {
-  int send_bytes = SendMsg(msg);
-  CHECK_NE(send_bytes, -1);
-  send_bytes_ += send_bytes;
-  if (resender_) resender_->AddOutgoing(msg);
-  if (Postoffice::Get()->verbose() >= 2) {
-    PS_VLOG(2) << msg.DebugString();
-  }
-  return send_bytes;
-}
-
-void Van::Receiving() {
-  const char* heartbeat_timeout_val = Environment::Get()->find("PS_HEARTBEAT_TIMEOUT");
-  const int heartbeat_timeout
-      = heartbeat_timeout_val ? atoi(heartbeat_timeout_val) : kDefaultHeartbeatInterval;
-  Meta nodes;  // for scheduler usage
-  while (true) {
-    Message msg;
-    int recv_bytes = RecvMsg(&msg);
-
-    // For debug, drop received message
-    if (ready_ && drop_rate_ > 0) {
-      unsigned seed = time(NULL) + my_node_.id;
-      if (rand_r(&seed) % 100 < drop_rate_) {
-        LOG(WARNING) << "Drop message " << msg.DebugString();
-        continue;
-      }
-    }
-
-    CHECK_NE(recv_bytes, -1);
-    recv_bytes_ += recv_bytes;
-    if (Postoffice::Get()->verbose() >= 2) {
-      PS_VLOG(2) << msg.DebugString();
-    }
-    // duplicated message
-    if (resender_ && resender_->AddIncomming(msg)) continue;
-
-    if (!msg.meta.control.empty()) {
-      // do some management
-      auto& ctrl = msg.meta.control;
-      if (ctrl.cmd == Control::TERMINATE) {
-        PS_VLOG(1) << my_node_.ShortDebugString() << " is stopped";
-        ready_ = false;
-        break;
-      } else if (ctrl.cmd == Control::ADD_NODE) {
-        size_t num_nodes = Postoffice::Get()->num_servers() +
-                           Postoffice::Get()->num_workers();
-        auto dead_nodes = Postoffice::Get()->GetDeadNodes(heartbeat_timeout);
-        std::unordered_set<int> dead_set(dead_nodes.begin(), dead_nodes.end());
-        Meta recovery_nodes;  // store recovery nodes
-        recovery_nodes.control.cmd = Control::ADD_NODE;
-        // assign an id
-        if (msg.meta.sender == Meta::kEmpty) {
-          CHECK(is_scheduler_);
-          CHECK_EQ(ctrl.node.size(), 1);
-          if (nodes.control.node.size() < num_nodes) {
-            nodes.control.node.push_back(ctrl.node[0]);
-          } else {
-            // some node dies and restarts
-            CHECK(ready_);
-            for (size_t i = 0; i < nodes.control.node.size() - 1; ++i) {
-              const auto& node = nodes.control.node[i];
-              if (dead_set.find(node.id) != dead_set.end() && node.role == ctrl.node[0].role) {
-                auto& recovery_node = ctrl.node[0];
-                // assign previous node id
-                recovery_node.id = node.id;
-                recovery_node.is_recovery = true;
-                PS_VLOG(1) << "replace dead node " << node.DebugString()
-                           << " by node " << recovery_node.DebugString();
-                nodes.control.node[i] = recovery_node;
-                recovery_nodes.control.node.push_back(recovery_node);
-                break;
-              }
-            }
-          }
-        }
-
-        // update my id
-        for (size_t i = 0; i < ctrl.node.size(); ++i) {
-          const auto& node = ctrl.node[i];
-          if (my_node_.hostname == node.hostname &&
-              my_node_.port == node.port) {
-            my_node_ = node;
-            std::string rank = std::to_string(Postoffice::IDtoRank(node.id));
-#ifdef _MSC_VER
-            _putenv_s("DMLC_RANK", rank.c_str());
-#else
-            setenv("DMLC_RANK", rank.c_str(), true);
-#endif
-          }
-        }
-
-        if (is_scheduler_) {
-          time_t t = time(NULL);
-          if (nodes.control.node.size() == num_nodes) {
-            // sort the nodes according their ip and port,
-            std::sort(nodes.control.node.begin(), nodes.control.node.end(),
-                      [](const Node& a, const Node& b) {
-                        return (a.hostname.compare(b.hostname) | (a.port < b.port)) > 0;
-                      });
-            // assign node rank
-            for (auto& node : nodes.control.node) {
-              CHECK_EQ(node.id, Node::kEmpty);
-              int id = node.role == Node::SERVER ?
-                       Postoffice::ServerRankToID(num_servers_) :
-                       Postoffice::WorkerRankToID(num_workers_);
-              PS_VLOG(1) << "assign rank=" << id << " to node " << node.DebugString();
-              node.id = id;
-              Connect(node);
-              if (node.role == Node::SERVER) ++num_servers_;
-              if (node.role == Node::WORKER) ++num_workers_;
-              Postoffice::Get()->UpdateHeartbeat(node.id, t);
-            }
-            nodes.control.node.push_back(my_node_);
-            nodes.control.cmd = Control::ADD_NODE;
-            Message back; back.meta = nodes;
-            for (int r : Postoffice::Get()->GetNodeIDs(
-                     kWorkerGroup + kServerGroup)) {
-              back.meta.recver = r;
-              back.meta.timestamp = timestamp_++;
-              Send(back);
-            }
-            PS_VLOG(1) << "the scheduler is connected to "
-                    << num_workers_ << " workers and " << num_servers_ << " servers";
-            ready_ = true;
-          } else if (recovery_nodes.control.node.size() > 0) {
-            // send back the recovery node
-            CHECK_EQ(recovery_nodes.control.node.size(), 1);
-            Connect(recovery_nodes.control.node[0]);
-            Postoffice::Get()->UpdateHeartbeat(recovery_nodes.control.node[0].id, t);
-            Message back;
-            for (int r : Postoffice::Get()->GetNodeIDs(
-                     kWorkerGroup + kServerGroup)) {
-              if (r != recovery_nodes.control.node[0].id
-                    && dead_set.find(r) != dead_set.end()) {
-                // do not try to send anything to dead node
-                continue;
-              }
-              // only send recovery_node to nodes already exist
-              // but send all nodes to the recovery_node
-              back.meta = (r == recovery_nodes.control.node[0].id) ? nodes : recovery_nodes;
-              back.meta.recver = r;
-              back.meta.timestamp = timestamp_++;
-              Send(back);
-            }
-          }
-        } else {
-          for (const auto& node : ctrl.node) {
-            Connect(node);
-            if (!node.is_recovery && node.role == Node::SERVER) ++num_servers_;
-            if (!node.is_recovery && node.role == Node::WORKER) ++num_workers_;
-          }
-          PS_VLOG(1) << my_node_.ShortDebugString() << " is connected to others";
-          ready_ = true;
-        }
-      } else if (ctrl.cmd == Control::BARRIER) {
-        if (msg.meta.request) {
-          if (barrier_count_.empty()) {
-            barrier_count_.resize(8, 0);
-          }
-          int group = ctrl.barrier_group;
-          ++barrier_count_[group];
-          PS_VLOG(1) << "Barrier count for " << group << " : " << barrier_count_[group];
-          if (barrier_count_[group] ==
-              static_cast<int>(Postoffice::Get()->GetNodeIDs(group).size())) {
-            barrier_count_[group] = 0;
-            Message res;
-            res.meta.request = false;
-            res.meta.control.cmd = Control::BARRIER;
-            for (int r : Postoffice::Get()->GetNodeIDs(group)) {
-              res.meta.recver = r;
-              res.meta.timestamp = timestamp_++;
-              CHECK_GT(Send(res), 0);
-            }
-          }
-        } else {
-          Postoffice::Get()->Manage(msg);
-        }
-      } else if (ctrl.cmd == Control::HEARTBEAT) {
-        time_t t = time(NULL);
-        for (auto &node : ctrl.node) {
-          Postoffice::Get()->UpdateHeartbeat(node.id, t);
-          if (is_scheduler_) {
-            Message heartbeat_ack;
-            heartbeat_ack.meta.recver = node.id;
-            heartbeat_ack.meta.control.cmd = Control::HEARTBEAT;
-            heartbeat_ack.meta.control.node.push_back(my_node_);
-            heartbeat_ack.meta.timestamp = timestamp_++;
-            // send back heartbeat
-            Send(heartbeat_ack);
-          }
-        }
-      }
-    } else {
-      CHECK_NE(msg.meta.sender, Meta::kEmpty);
-      CHECK_NE(msg.meta.recver, Meta::kEmpty);
-      CHECK_NE(msg.meta.customer_id, Meta::kEmpty);
-      int id = msg.meta.customer_id;
-      auto* obj = Postoffice::Get()->GetCustomer(id, 5);
-      CHECK(obj) << "timeout (5 sec) to wait App " << id << " ready";
-      obj->Accept(msg);
-    }
-  }
-}
-
-void Van::PackMeta(const Meta& meta, char** meta_buf, int* buf_size) {
-  // convert into protobuf
-  PBMeta pb;
-  pb.set_head(meta.head);
-  if (meta.customer_id != Meta::kEmpty) pb.set_customer_id(meta.customer_id);
-  if (meta.timestamp != Meta::kEmpty) pb.set_timestamp(meta.timestamp);
-  if (meta.body.size()) pb.set_body(meta.body);
-  pb.set_push(meta.push);
-  pb.set_request(meta.request);
-  pb.set_simple_app(meta.simple_app);
-  for (auto d : meta.data_type) pb.add_data_type(d);
-  if (!meta.control.empty()) {
-    auto ctrl = pb.mutable_control();
-    ctrl->set_cmd(meta.control.cmd);
-    if (meta.control.cmd == Control::BARRIER) {
-      ctrl->set_barrier_group(meta.control.barrier_group);
-    } else if (meta.control.cmd == Control::ACK) {
-      ctrl->set_msg_sig(meta.control.msg_sig);
-    }
-    for (const auto& n : meta.control.node) {
-      auto p = ctrl->add_node();
-      p->set_id(n.id);
-      p->set_role(n.role);
-      p->set_port(n.port);
-      p->set_hostname(n.hostname);
-      p->set_is_recovery(n.is_recovery);
-    }
-  }
-
-  // to string
-  *buf_size = pb.ByteSize();
-  *meta_buf = new char[*buf_size+1];
-  CHECK(pb.SerializeToArray(*meta_buf, *buf_size))
-      << "failed to serialize protbuf";
-}
-
-void Van::UnpackMeta(const char* meta_buf, int buf_size, Meta* meta) {
-  // to protobuf
-  PBMeta pb;
-  CHECK(pb.ParseFromArray(meta_buf, buf_size))
-      << "failed to parse string into protobuf";
-
-  // to meta
-  meta->head = pb.head();
-  meta->customer_id = pb.has_customer_id() ? pb.customer_id() : Meta::kEmpty;
-  meta->timestamp = pb.has_timestamp() ? pb.timestamp() : Meta::kEmpty;
-  meta->request = pb.request();
-  meta->push = pb.push();
-  meta->simple_app = pb.simple_app();
-  meta->body = pb.body();
-  meta->data_type.resize(pb.data_type_size());
-  for (int i = 0; i < pb.data_type_size(); ++i) {
-    meta->data_type[i] = static_cast<DataType>(pb.data_type(i));
-  }
-  if (pb.has_control()) {
-    const auto& ctrl = pb.control();
-    meta->control.cmd = static_cast<Control::Command>(ctrl.cmd());
-    meta->control.barrier_group = ctrl.barrier_group();
-    meta->control.msg_sig = ctrl.msg_sig();
-    for (int i = 0; i < ctrl.node_size(); ++i) {
-      const auto& p = ctrl.node(i);
-      Node n;
-      n.role = static_cast<Node::Role>(p.role());
-      n.port = p.port();
-      n.hostname = p.hostname();
-      n.id = p.has_id() ? p.id() : Node::kEmpty;
-      n.is_recovery = p.is_recovery();
-      meta->control.node.push_back(n);
-    }
-  } else {
-    meta->control.cmd = Control::EMPTY;
-  }
-}
-
-void Van::Heartbeat() {
-  const char* val = Environment::Get()->find("PS_HEARTBEAT_INTERVAL");
-  const int interval = val ? atoi(val) : kDefaultHeartbeatInterval;
-  while (interval > 0 && ready_) {
-    std::this_thread::sleep_for(std::chrono::seconds(interval));
-    Message msg;
-    msg.meta.recver = kScheduler;
-    msg.meta.control.cmd = Control::HEARTBEAT;
-    msg.meta.control.node.push_back(my_node_);
-    msg.meta.timestamp = timestamp_++;
-    Send(msg);
-  }
-}
-}  // namespace ps
diff --git a/ps-lite/src/windows/unistd.h b/ps-lite/src/windows/unistd.h
deleted file mode 100644
index 469b67d2..00000000
--- a/ps-lite/src/windows/unistd.h
+++ /dev/null
@@ -1,48 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- * @file   unistd.h
- * @brief  This file intended to serve as a drop-in replacement for
- * unistd.h on Windows Please add functionality as neeeded
- */
-#ifndef PS_WINDOWS_UNISTD_H_
-#define PS_WINDOWS_UNISTD_H_
-#include <stdlib.h>
-#include <io.h>
-// #include "getopt.h" /* getopt at: https://gist.github.com/ashelly/7776712 */
-#include <process.h> /* for getpid() and the exec..() family */
-#include <direct.h> /* for _getcwd() and _chdir() */
-
-#define srandom srand
-#define random rand
-
-/* Values for the second argument to access.
-   These may be OR'd together.  */
-#define R_OK    4       /* Test for read permission.  */
-#define W_OK    2       /* Test for write permission.  */
-// #define   X_OK    1       /* execute permission - unsupported in windows*/
-#define F_OK    0       /* Test for existence.  */
-
-#define access _access
-#define dup2 _dup2
-#define execve _execve
-#define ftruncate _chsize
-#define unlink _unlink
-#define fileno _fileno
-#define getcwd _getcwd
-#define chdir _chdir
-#define isatty _isatty
-#define lseek _lseek
-
-// read, write, and close are NOT being #defined here, because while there are
-// file handle specific versions for Windows, they probably don't work for
-// sockets. You need to look at your app and consider whether to call
-// e.g. closesocket().
-
-#define ssize_t int
-
-#define STDIN_FILENO 0
-#define STDOUT_FILENO 1
-#define STDERR_FILENO 2
-/* should be in some equivalent to <sys/types.h> */
-
-#endif  // PS_WINDOWS_UNISTD_H_
diff --git a/ps-lite/src/zmq_van.h b/ps-lite/src/zmq_van.h
deleted file mode 100644
index f6a14cc4..00000000
--- a/ps-lite/src/zmq_van.h
+++ /dev/null
@@ -1,287 +0,0 @@
-/**
- *  Copyright (c) 2015 by Contributors
- */
-#ifndef PS_ZMQ_VAN_H_
-#define PS_ZMQ_VAN_H_
-#include <zmq.h>
-#include <stdlib.h>
-#include <thread>
-#include <string>
-#include "ps/internal/van.h"
-#if _MSC_VER
-#define rand_r(x) rand()
-#endif
-
-namespace ps {
-/**
- * \brief be smart on freeing recved data
- */
-inline void FreeData(void *data, void *hint) {
-  if (hint == NULL) {
-    delete [] static_cast<char*>(data);
-  } else {
-    delete static_cast<SArray<char>*>(hint);
-  }
-}
-
-/**
- * \brief ZMQ based implementation
- */
-class ZMQVan : public Van {
- public:
-  ZMQVan() { }
-  virtual ~ZMQVan() { }
-
- protected:
-  void Start() override {
-    // start zmq
-    context_ = zmq_ctx_new();
-    CHECK(context_ != NULL) << "create 0mq context failed";
-    zmq_ctx_set(context_, ZMQ_MAX_SOCKETS, 65536);
-    // zmq_ctx_set(context_, ZMQ_IO_THREADS, 4);
-    Van::Start();
-  }
-
-  void Stop() override {
-    PS_VLOG(1) << my_node_.ShortDebugString() << " is stopping";
-    Van::Stop();
-    // close sockets
-    int linger = 0;
-    int rc = zmq_setsockopt(receiver_, ZMQ_LINGER, &linger, sizeof(linger));
-    CHECK(rc == 0 || errno == ETERM);
-    CHECK_EQ(zmq_close(receiver_), 0);
-    for (auto& it : senders_) {
-      int rc = zmq_setsockopt(it.second, ZMQ_LINGER, &linger, sizeof(linger));
-      CHECK(rc == 0 || errno == ETERM);
-      CHECK_EQ(zmq_close(it.second), 0);
-    }
-    zmq_ctx_destroy(context_);
-  }
-
-  int Bind(const Node& node, int max_retry) override {
-    receiver_ = zmq_socket(context_, ZMQ_ROUTER);
-    CHECK(receiver_ != NULL)
-        << "create receiver socket failed: " << zmq_strerror(errno);
-    int local = GetEnv("DMLC_LOCAL", 0);
-    std::string hostname = node.hostname.empty() ? "*" : node.hostname;
-    std::string addr = local ? "ipc:///tmp/" : "tcp://" + hostname + ":";
-    int port = node.port;
-    unsigned seed = static_cast<unsigned>(time(NULL)+port);
-    for (int i = 0; i < max_retry+1; ++i) {
-      auto address = addr + std::to_string(port);
-      if (zmq_bind(receiver_, address.c_str()) == 0) break;
-      if (i == max_retry) {
-        port = -1;
-      } else {
-        port = 10000 + rand_r(&seed) % 40000;
-      }
-    }
-    return port;
-  }
-
-  void Connect(const Node& node) override {
-    CHECK_NE(node.id, node.kEmpty);
-    CHECK_NE(node.port, node.kEmpty);
-    CHECK(node.hostname.size());
-    int id = node.id;
-    auto it = senders_.find(id);
-    if (it != senders_.end()) {
-      zmq_close(it->second);
-    }
-    // worker doesn't need to connect to the other workers. same for server
-    if ((node.role == my_node_.role) &&
-        (node.id != my_node_.id)) {
-      return;
-    }
-    void *sender = zmq_socket(context_, ZMQ_DEALER);
-    CHECK(sender != NULL)
-        << zmq_strerror(errno)
-        << ". it often can be solved by \"sudo ulimit -n 65536\""
-        << " or edit /etc/security/limits.conf";
-    if (my_node_.id != Node::kEmpty) {
-      std::string my_id = "ps" + std::to_string(my_node_.id);
-      zmq_setsockopt(sender, ZMQ_IDENTITY, my_id.data(), my_id.size());
-    }
-    // connect
-    std::string addr = "tcp://" + node.hostname + ":" + std::to_string(node.port);
-    if (GetEnv("DMLC_LOCAL", 0)) {
-      addr = "ipc:///tmp/" + std::to_string(node.port);
-    }
-    if (zmq_connect(sender, addr.c_str()) != 0) {
-      LOG(FATAL) <<  "connect to " + addr + " failed: " + zmq_strerror(errno);
-    }
-    senders_[id] = sender;
-  }
-
-  int SendMsg(const Message& msg) override {
-    std::lock_guard<std::mutex> lk(mu_);
-    // find the socket
-    int id = msg.meta.recver;
-    CHECK_NE(id, Meta::kEmpty);
-    auto it = senders_.find(id);
-    if (it == senders_.end()) {
-      LOG(WARNING) << "there is no socket to node " << id;
-      return -1;
-    }
-    void *socket = it->second;
-
-    // send meta
-    int meta_size; char* meta_buf;
-    PackMeta(msg.meta, &meta_buf, &meta_size);
-    int tag = ZMQ_SNDMORE;
-    int n = msg.data.size();
-    if (n == 0) tag = 0;
-    zmq_msg_t meta_msg;
-    zmq_msg_init_data(&meta_msg, meta_buf, meta_size, FreeData, NULL);
-    while (true) {
-      if (zmq_msg_send(&meta_msg, socket, tag) == meta_size) break;
-      if (errno == EINTR) continue;
-      LOG(WARNING) << "failed to send message to node [" << id
-                   << "] errno: " << errno << " " << zmq_strerror(errno);
-      return -1;
-    }
-    zmq_msg_close(&meta_msg);
-    int send_bytes = meta_size;
-
-    // send data
-    for (int i = 0; i < n; ++i) {
-      zmq_msg_t data_msg;
-      SArray<char>* data = new SArray<char>(msg.data[i]);
-      int data_size = data->size();
-      zmq_msg_init_data(&data_msg, data->data(), data->size(), FreeData, data);
-      if (i == n - 1) tag = 0;
-      while (true) {
-        if (zmq_msg_send(&data_msg, socket, tag) == data_size) break;
-        if (errno == EINTR) continue;
-        LOG(WARNING) << "failed to send message to node [" << id
-                     << "] errno: " << errno << " " << zmq_strerror(errno)
-                     << ". " << i << "/" << n;
-        return -1;
-      }
-      zmq_msg_close(&data_msg);
-      send_bytes += data_size;
-    }
-    return send_bytes;
-  }
-
-  int RecvMsg(Message* msg) override {
-    msg->data.clear();
-    size_t recv_bytes = 0;
-    for (int i = 0; ; ++i) {
-      zmq_msg_t* zmsg = new zmq_msg_t;
-      CHECK(zmq_msg_init(zmsg) == 0) << zmq_strerror(errno);
-      while (true) {
-        if (zmq_msg_recv(zmsg, receiver_, 0) != -1) break;
-        if (errno == EINTR) continue;
-        LOG(WARNING) << "failed to receive message. errno: "
-                     << errno << " " << zmq_strerror(errno);
-        return -1;
-      }
-      char* buf = CHECK_NOTNULL((char *)zmq_msg_data(zmsg));
-      size_t size = zmq_msg_size(zmsg);
-      recv_bytes += size;
-
-      if (i == 0) {
-        // identify
-        msg->meta.sender = GetNodeID(buf, size);
-        msg->meta.recver = my_node_.id;
-        CHECK(zmq_msg_more(zmsg));
-        zmq_msg_close(zmsg);
-        delete zmsg;
-      } else if (i == 1) {
-        // task
-        UnpackMeta(buf, size, &(msg->meta));
-        zmq_msg_close(zmsg);
-        bool more = zmq_msg_more(zmsg);
-        delete zmsg;
-        if (!more) break;
-      } else {
-        // zero-copy
-        SArray<char> data;
-        data.reset(buf, size, [zmsg, size](char* buf) {
-            zmq_msg_close(zmsg);
-            delete zmsg;
-          });
-        msg->data.push_back(data);
-        if (!zmq_msg_more(zmsg)) { break; }
-      }
-    }
-    return recv_bytes;
-  }
-
- private:
-  /**
-   * return the node id given the received identity
-   * \return -1 if not find
-   */
-  int GetNodeID(const char* buf, size_t size) {
-    if (size > 2 && buf[0] == 'p' && buf[1] == 's') {
-      int id = 0;
-      size_t i = 2;
-      for (; i < size; ++i) {
-        if (buf[i] >= '0' && buf[i] <= '9') {
-          id = id * 10 + buf[i] - '0';
-        } else {
-          break;
-        }
-      }
-      if (i == size) return id;
-    }
-    return Meta::kEmpty;
-  }
-
-  void *context_ = nullptr;
-  /**
-   * \brief node_id to the socket for sending data to this node
-   */
-  std::unordered_map<int, void*> senders_;
-  std::mutex mu_;
-  void *receiver_ = nullptr;
-};
-}  // namespace ps
-
-#endif  // PS_ZMQ_VAN_H_
-
-
-
-
-
-// monitors the liveness other nodes if this is
-// a schedule node, or monitors the liveness of the scheduler otherwise
-// aliveness monitor
-// CHECK(!zmq_socket_monitor(
-//     senders_[kScheduler], "inproc://monitor", ZMQ_EVENT_ALL));
-// monitor_thread_ = std::unique_ptr<std::thread>(
-//     new std::thread(&Van::Monitoring, this));
-// monitor_thread_->detach();
-
-// void Van::Monitoring() {
-//   void *s = CHECK_NOTNULL(zmq_socket(context_, ZMQ_PAIR));
-//   CHECK(!zmq_connect(s, "inproc://monitor"));
-//   while (true) {
-//     //  First frame in message contains event number and value
-//     zmq_msg_t msg;
-//     zmq_msg_init(&msg);
-//     if (zmq_msg_recv(&msg, s, 0) == -1) {
-//       if (errno == EINTR) continue;
-//       break;
-//     }
-//     uint8_t *data = static_cast<uint8_t*>(zmq_msg_data(&msg));
-//     int event = *reinterpret_cast<uint16_t*>(data);
-//     // int value = *(uint32_t *)(data + 2);
-
-//     // Second frame in message contains event address. it's just the router's
-//     // address. no help
-
-//     if (event == ZMQ_EVENT_DISCONNECTED) {
-//       if (!is_scheduler_) {
-//         PS_VLOG(1) << my_node_.ShortDebugString() << ": scheduler is dead. exit.";
-//         exit(-1);
-//       }
-//     }
-//     if (event == ZMQ_EVENT_MONITOR_STOPPED) {
-//       break;
-//     }
-//   }
-//   zmq_close(s);
-// }
diff --git a/ps-lite/tags b/ps-lite/tags
deleted file mode 100644
index 9e2e4503..00000000
--- a/ps-lite/tags
+++ /dev/null
@@ -1,4116 +0,0 @@
-!_TAG_FILE_FORMAT	2	/extended format; --format=1 will not append ;" to lines/
-!_TAG_FILE_SORTED	1	/0=unsorted, 1=sorted, 2=foldcase/
-!_TAG_PROGRAM_AUTHOR	Darren Hiebert	/dhiebert@users.sourceforge.net/
-!_TAG_PROGRAM_NAME	Exuberant Ctags	//
-!_TAG_PROGRAM_URL	http://ctags.sourceforge.net	/official site/
-!_TAG_PROGRAM_VERSION	5.8	//
-ACK	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-ADD_NODE	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-ALLSPHINXOPTS	docs/Makefile	/^ALLSPHINXOPTS   = -d $(BUILDDIR)\/doctrees $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .$/;"	m
-AND	include/ps/internal/assign_op.h	/^  AND,     \/\/ a &= b$/;"	e	enum:ps::AssignOp
-ASSIGN	include/ps/internal/assign_op.h	/^  ASSIGN,  \/\/ a = b$/;"	e	enum:ps::AssignOp
-ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#define ATOMICOPS_COMPILER_BARRIER(/;"	d
-ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#undef ATOMICOPS_COMPILER_BARRIER$/;"	d
-ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#define ATOMICOPS_COMPILER_BARRIER(/;"	d
-ATOMICOPS_COMPILER_BARRIER	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#undef ATOMICOPS_COMPILER_BARRIER$/;"	d
-AUTO	deps/include/google/protobuf/io/gzip_stream.h	/^    AUTO = 0,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
-Accept	include/ps/internal/customer.h	/^  void Accept(const Message& recved) { recv_queue_.Push(recved); }$/;"	f	class:ps::Customer
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Acquire_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Acquire_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Acquire_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Acquire_Load(volatile const AtomicWord* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Acquire_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Acquire_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void Acquire_Store(volatile AtomicWord* ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Acquire_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Acquire_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Acquire_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Add	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
-Add	deps/include/google/protobuf/extension_set.h	/^  static inline string* Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
-Add	deps/include/google/protobuf/extension_set.h	/^  static inline void Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
-Add	deps/include/google/protobuf/extension_set.h	/^  static inline void Add(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
-Add	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::Add() {$/;"	f	class:google::protobuf::RepeatedField
-Add	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::Add() {$/;"	f	class:google::protobuf::RepeatedPtrField
-Add	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::Add() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Add	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Add(const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
-AddAllocated	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::AddAllocated(Element* value) {$/;"	f	class:google::protobuf::RepeatedPtrField
-AddAllocated	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::AddAllocated($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-AddAlreadyReserved	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::AddAlreadyReserved() {$/;"	f	class:google::protobuf::RepeatedField
-AddAlreadyReserved	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::AddAlreadyReserved(const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
-AddCallback	include/ps/kv_app.h	/^  void AddCallback(int timestamp, const Callback& cb) {$/;"	f	class:ps::KVWorker
-AddCleared	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::AddCleared(Element* value) {$/;"	f	class:google::protobuf::RepeatedPtrField
-AddCleared	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::AddCleared($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-AddCustomer	src/postoffice.cc	/^void Postoffice::AddCustomer(Customer* customer) {$/;"	f	class:ps::Postoffice
-AddData	include/ps/internal/message.h	/^  void AddData(const SArray<V>& val) {$/;"	f	struct:ps::Message
-AddError	deps/include/google/protobuf/io/tokenizer.h	/^  void AddError(const string& message) {$/;"	f	class:google::protobuf::io::Tokenizer
-AddFromCleared	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::AddFromCleared() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-AddIncomming	src/resender.h	/^  bool AddIncomming(const Message& msg) {$/;"	f	class:ps::Resender
-AddLengthDelimited	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::AddLengthDelimited($/;"	f	class:google::protobuf::UnknownFieldSet
-AddOutgoing	src/resender.h	/^  void AddOutgoing(const Message& msg) {$/;"	f	class:ps::Resender
-AddResponse	src/customer.cc	/^void Customer::AddResponse(int timestamp, int num) {$/;"	f	class:ps::Customer
-AddString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::AddString(int number, FieldType type,$/;"	f	class:google::protobuf::internal::ExtensionSet
-AddWarning	deps/include/google/protobuf/io/tokenizer.h	/^  virtual void AddWarning(int line, int column, const string& message) { }$/;"	f	class:google::protobuf::io::ErrorCollector
-Advance	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::Advance(int amount) {$/;"	f	class:google::protobuf::io::CodedInputStream
-Advance	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::Advance(int amount) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-AllocatedRepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit AllocatedRepeatedPtrFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-AllocatedRepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class AllocatedRepeatedPtrFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
-AllocatedRepeatedPtrFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^AllocatedRepeatedPtrFieldBackInserter($/;"	f	namespace:google::protobuf
-AllowPartialMessage	deps/include/google/protobuf/text_format.h	/^    void AllowPartialMessage(bool allow) {$/;"	f	class:google::protobuf::TextFormat::Parser
-AllowUnknownDependencies	deps/include/google/protobuf/descriptor.h	/^  void AllowUnknownDependencies() { allow_unknown_ = true; }$/;"	f	class:google::protobuf::DescriptorPool
-ArrayInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT ArrayInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-ArrayOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT ArrayOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-AssignFunc	include/ps/internal/assign_op.h	/^inline void AssignFunc(const T& lhs, AssignOp op, T* rhs) {$/;"	f	namespace:ps
-AssignFuncInt	include/ps/internal/assign_op.h	/^inline void AssignFuncInt(const T& lhs, AssignOp op, T* rhs) {$/;"	f	namespace:ps
-AssignOp	include/ps/internal/assign_op.h	/^enum AssignOp {$/;"	g	namespace:ps
-Atomic32	deps/include/google/protobuf/stubs/atomicops.h	/^typedef int32 Atomic32;$/;"	t	namespace:google::protobuf::internal
-Atomic64	deps/include/google/protobuf/stubs/atomicops.h	/^typedef int64 Atomic64;$/;"	t	namespace:google::protobuf::internal
-Atomic64	deps/include/google/protobuf/stubs/atomicops.h	/^typedef intptr_t Atomic64;$/;"	t	namespace:google::protobuf::internal
-AtomicOps_x86CPUFeatureStruct	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^struct AtomicOps_x86CPUFeatureStruct {$/;"	s	namespace:google::protobuf::internal
-AtomicWord	deps/include/google/protobuf/stubs/atomicops.h	/^typedef intptr_t AtomicWord;$/;"	t	namespace:google::protobuf::internal
-AutoStructify	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
-AutoStructify	docs/sphinx_util.py	/^AutoStructify = transform.AutoStructify$/;"	v
-BARRIER	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-BLOCK_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    BLOCK_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
-BUILDDIR	docs/Makefile	/^BUILDDIR      = _build$/;"	m
-Barrier	src/postoffice.cc	/^void Postoffice::Barrier(int node_group) {$/;"	f	class:ps::Postoffice
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Barrier_AtomicIncrement(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Barrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Barrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Barrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-BeginPtr	include/dmlc/base.h	/^inline T *BeginPtr(std::vector<T> &vec) {  \/\/ NOLINT(*)$/;"	f	namespace:dmlc
-BeginPtr	include/dmlc/base.h	/^inline char* BeginPtr(std::string &str) {  \/\/ NOLINT(*)$/;"	f	namespace:dmlc
-BeginPtr	include/dmlc/base.h	/^inline const T *BeginPtr(const std::vector<T> &vec) {$/;"	f	namespace:dmlc
-BeginPtr	include/dmlc/base.h	/^inline const char* BeginPtr(const std::string &str) {$/;"	f	namespace:dmlc
-BufferSize	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedInputStream::BufferSize() const {$/;"	f	class:google::protobuf::io::CodedInputStream
-ByteCount	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::ByteCount() const {$/;"	f	class:google::protobuf::io::CodedOutputStream
-ByteSize	src/meta.pb.cc	/^int PBControl::ByteSize() const {$/;"	f	class:ps::PBControl
-ByteSize	src/meta.pb.cc	/^int PBMeta::ByteSize() const {$/;"	f	class:ps::PBMeta
-ByteSize	src/meta.pb.cc	/^int PBNode::ByteSize() const {$/;"	f	class:ps::PBNode
-BytesSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::BytesSize(const string& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-CANNOT_OPEN	deps/include/google/protobuf/compiler/importer.h	/^    CANNOT_OPEN,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
-CFLAGS	Makefile	/^CFLAGS = -std=c++11 -msse2 -fPIC -O3 -ggdb -Wall -finline-functions $(INCPATH) $(ADD_CFLAGS)$/;"	m
-CHAR	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
-CITYHASH	make/deps.mk	/^CITYHASH = ${DEPS_PATH}\/include\/city.h$/;"	m
-CODE_SIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode CODE_SIZE = FileOptions_OptimizeMode_CODE_SIZE;$/;"	m	class:google::protobuf::FileOptions
-CORD	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CORD = FieldOptions_CType_CORD;$/;"	m	class:google::protobuf::FieldOptions
-CPPTYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_BOOL        = 7,     \/\/ TYPE_BOOL$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_BOOL	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_BOOL        = 7,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_DOUBLE	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_DOUBLE      = 5,     \/\/ TYPE_DOUBLE$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_DOUBLE	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_DOUBLE      = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_ENUM	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_ENUM        = 8,     \/\/ TYPE_ENUM$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_ENUM	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_ENUM        = 8,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_FLOAT	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_FLOAT       = 6,     \/\/ TYPE_FLOAT$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_FLOAT	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_FLOAT       = 6,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_INT32	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_INT32       = 1,     \/\/ TYPE_INT32, TYPE_SINT32, TYPE_SFIXED32$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_INT32	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_INT32       = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_INT64	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_INT64       = 2,     \/\/ TYPE_INT64, TYPE_SINT64, TYPE_SFIXED64$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_INT64	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_INT64       = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_MESSAGE	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_MESSAGE     = 10,    \/\/ TYPE_MESSAGE, TYPE_GROUP$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_MESSAGE	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_MESSAGE     = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_STRING	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_STRING      = 9,     \/\/ TYPE_STRING, TYPE_BYTES$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_STRING	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_STRING      = 9,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_UINT32	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_UINT32      = 3,     \/\/ TYPE_UINT32, TYPE_FIXED32$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_UINT32	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_UINT32      = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPPTYPE_UINT64	deps/include/google/protobuf/descriptor.h	/^    CPPTYPE_UINT64      = 4,     \/\/ TYPE_UINT64, TYPE_FIXED64$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-CPPTYPE_UINT64	deps/include/google/protobuf/wire_format_lite.h	/^    CPPTYPE_UINT64      = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-CPP_COMMENT_STYLE	deps/include/google/protobuf/io/tokenizer.h	/^    CPP_COMMENT_STYLE,$/;"	e	enum:google::protobuf::io::Tokenizer::CommentStyle
-CType	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldOptions_CType CType;$/;"	t	class:google::protobuf::FieldOptions
-CType_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int CType_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldOptions
-CType_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool CType_IsValid(int value) {$/;"	f	class:google::protobuf::FieldOptions
-CType_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CType_MAX =$/;"	m	class:google::protobuf::FieldOptions
-CType_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType CType_MIN =$/;"	m	class:google::protobuf::FieldOptions
-CType_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& CType_Name(CType value) {$/;"	f	class:google::protobuf::FieldOptions
-CType_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool CType_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldOptions
-CType_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  CType_descriptor() {$/;"	f	class:google::protobuf::FieldOptions
-CXX	Makefile	/^CXX = g++$/;"	m
-CXX_SUFFIX	tests/lint.py	/^CXX_SUFFIX = set(['cc', 'c', 'cpp', 'h', 'cu', 'hpp'])$/;"	v
-Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::Capacity() const {$/;"	f	class:google::protobuf::RepeatedField
-Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::Capacity() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-Capacity	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::Capacity() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-ChannelOwnership	deps/include/google/protobuf/service.h	/^  enum ChannelOwnership {$/;"	g	class:google::protobuf::Service
-CheckNotNull	deps/include/google/protobuf/stubs/common.h	/^T* CheckNotNull(const char *file, int line, const char *name, T* val) {$/;"	f	namespace:google::protobuf::internal
-CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBControl::CheckTypeAndMergeFrom($/;"	f	class:ps::PBControl
-CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBMeta::CheckTypeAndMergeFrom($/;"	f	class:ps::PBMeta
-CheckTypeAndMergeFrom	src/meta.pb.cc	/^void PBNode::CheckTypeAndMergeFrom($/;"	f	class:ps::PBNode
-Clear	deps/include/google/protobuf/repeated_field.h	/^  static void Clear(GenericType* value) { value->Clear(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-Clear	deps/include/google/protobuf/repeated_field.h	/^  static void Clear(string* value) { value->clear(); }$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
-Clear	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Clear() {$/;"	f	class:google::protobuf::RepeatedField
-Clear	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::Clear() {$/;"	f	class:google::protobuf::RepeatedPtrField
-Clear	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::Clear() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Clear	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::Clear() {$/;"	f	class:google::protobuf::UnknownFieldSet
-Clear	src/meta.pb.cc	/^void PBControl::Clear() {$/;"	f	class:ps::PBControl
-Clear	src/meta.pb.cc	/^void PBMeta::Clear() {$/;"	f	class:ps::PBMeta
-Clear	src/meta.pb.cc	/^void PBNode::Clear() {$/;"	f	class:ps::PBNode
-ClearedCount	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::ClearedCount() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-ClearedCount	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::ClearedCount() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-CloseGap	deps/include/google/protobuf/repeated_field.h	/^  void CloseGap(int start, int num) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Closure	deps/include/google/protobuf/stubs/common.h	/^  Closure() {}$/;"	f	class:google::protobuf::Closure
-Closure	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT Closure {$/;"	c	namespace:google::protobuf
-CodeGenerator	deps/include/google/protobuf/compiler/code_generator.h	/^  inline CodeGenerator() {}$/;"	f	class:google::protobuf::compiler::CodeGenerator
-CodeGenerator	deps/include/google/protobuf/compiler/code_generator.h	/^class LIBPROTOC_EXPORT CodeGenerator {$/;"	c	namespace:google::protobuf::compiler
-CodeGeneratorRequest	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorRequest : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
-CodeGeneratorResponse	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorResponse : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
-CodeGeneratorResponse_File	deps/include/google/protobuf/compiler/plugin.pb.h	/^class LIBPROTOC_EXPORT CodeGeneratorResponse_File : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf::compiler
-CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^class LIBPROTOBUF_EXPORT CodedInputStream {$/;"	c	namespace:google::protobuf::io
-CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^inline CodedInputStream::CodedInputStream(ZeroCopyInputStream* input)$/;"	f	class:google::protobuf::io::CodedInputStream
-CodedInputStream	deps/include/google/protobuf/io/coded_stream.h	/^inline CodedInputStream::CodedInputStream(const uint8* buffer, int size)$/;"	f	class:google::protobuf::io::CodedInputStream
-CodedOutputStream	deps/include/google/protobuf/io/coded_stream.h	/^class LIBPROTOBUF_EXPORT CodedOutputStream {$/;"	c	namespace:google::protobuf::io
-Command	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	g	struct:ps::Control
-CommandLineInterface	deps/include/google/protobuf/compiler/command_line_interface.h	/^class LIBPROTOC_EXPORT CommandLineInterface {$/;"	c	namespace:google::protobuf::compiler
-CommentStyle	deps/include/google/protobuf/io/tokenizer.h	/^  enum CommentStyle {$/;"	g	class:google::protobuf::io::Tokenizer
-CompileAssert	deps/include/google/protobuf/stubs/common.h	/^struct CompileAssert {$/;"	s	namespace:google::protobuf::internal
-ConcatenatingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT ConcatenatingInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::EnumTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::PrimitiveTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::RepeatedEnumTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef Type ConstType;$/;"	t	class:google::protobuf::internal::RepeatedPrimitiveTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const Type& ConstType;$/;"	t	class:google::protobuf::internal::MessageTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const Type& ConstType;$/;"	t	class:google::protobuf::internal::RepeatedMessageTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const string& ConstType;$/;"	t	class:google::protobuf::internal::RepeatedStringTypeTraits
-ConstType	deps/include/google/protobuf/extension_set.h	/^  typedef const string& ConstType;$/;"	t	class:google::protobuf::internal::StringTypeTraits
-ConsumedEntireMessage	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ConsumedEntireMessage() {$/;"	f	class:google::protobuf::io::CodedInputStream
-Control	include/ps/internal/message.h	/^  Control() : cmd(EMPTY) { }$/;"	f	struct:ps::Control
-Control	include/ps/internal/message.h	/^struct Control {$/;"	s	namespace:ps
-ConvertHelper	deps/include/google/protobuf/stubs/type_traits.h	/^struct ConvertHelper {$/;"	s	namespace:google::protobuf::internal::internal
-CopyArray	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::CopyArray($/;"	f	class:google::protobuf::RepeatedField
-CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::CopyFrom(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
-CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::CopyFrom($/;"	f	class:google::protobuf::RepeatedPtrField
-CopyFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::CopyFrom(const RepeatedPtrFieldBase& other) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const ForwardIt& first, const ForwardIt& last) {$/;"	f	class:ps::SArray
-CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const SArray<V>& other) {$/;"	f	class:ps::SArray
-CopyFrom	include/ps/sarray.h	/^  void CopyFrom(const V* data, size_t size) {$/;"	f	class:ps::SArray
-CopyFrom	src/meta.pb.cc	/^void PBControl::CopyFrom(const PBControl& from) {$/;"	f	class:ps::PBControl
-CopyFrom	src/meta.pb.cc	/^void PBMeta::CopyFrom(const PBMeta& from) {$/;"	f	class:ps::PBMeta
-CopyFrom	src/meta.pb.cc	/^void PBNode::CopyFrom(const PBNode& from) {$/;"	f	class:ps::PBNode
-CopyingFileInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingFileInputStream : public CopyingInputStream {$/;"	c	class:google::protobuf::io::FileInputStream
-CopyingFileOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingFileOutputStream : public CopyingOutputStream {$/;"	c	class:google::protobuf::io::FileOutputStream
-CopyingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingInputStream {$/;"	c	namespace:google::protobuf::io
-CopyingInputStreamAdaptor	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingInputStreamAdaptor : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-CopyingIstreamInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingIstreamInputStream : public CopyingInputStream {$/;"	c	class:google::protobuf::io::IstreamInputStream
-CopyingOstreamOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  class LIBPROTOBUF_EXPORT CopyingOstreamOutputStream : public CopyingOutputStream {$/;"	c	class:google::protobuf::io::OstreamOutputStream
-CopyingOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingOutputStream {$/;"	c	namespace:google::protobuf::io
-CopyingOutputStreamAdaptor	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT CopyingOutputStreamAdaptor : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-CppGenerator	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^class LIBPROTOC_EXPORT CppGenerator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::cpp
-CppType	deps/include/google/protobuf/descriptor.h	/^  enum CppType {$/;"	g	class:google::protobuf::FieldDescriptor
-CppType	deps/include/google/protobuf/wire_format_lite.h	/^  enum CppType {$/;"	g	class:google::protobuf::internal::WireFormatLite
-Create	src/van.cc	/^Van* Van::Create(const std::string& type) {$/;"	f	class:ps::Van
-CreateNested	deps/include/google/protobuf/text_format.h	/^inline TextFormat::ParseInfoTree* TextFormat::CreateNested($/;"	f	class:google::protobuf::TextFormat
-CurrentPosition	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedInputStream::CurrentPosition() const {$/;"	f	class:google::protobuf::io::CodedInputStream
-Customer	include/ps/internal/customer.h	/^class Customer {$/;"	c	namespace:ps
-Customer	src/customer.cc	/^Customer::Customer(int id, const Customer::RecvHandle& recv_handle)$/;"	f	class:ps::Customer
-DECLARE_GET_REPEATED_FIELD	deps/include/google/protobuf/message.h	/^#define DECLARE_GET_REPEATED_FIELD(/;"	d
-DECLARE_GET_REPEATED_FIELD	deps/include/google/protobuf/message.h	/^#undef DECLARE_GET_REPEATED_FIELD$/;"	d
-DEFAULT_VALUE	deps/include/google/protobuf/descriptor.h	/^      DEFAULT_VALUE,     \/\/ field default value$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-DEPRECATED_PROTOBUF_FIELD	deps/include/google/protobuf/generated_message_util.h	/^#undef DEPRECATED_PROTOBUF_FIELD$/;"	d
-DEPS_PATH	Makefile	/^DEPS_PATH = $(shell pwd)\/deps$/;"	m
-DISALLOW_COPY_AND_ASSIGN	include/dmlc/base.h	/^#    define DISALLOW_COPY_AND_ASSIGN(/;"	d
-DISALLOW_COPY_AND_ASSIGN	include/ps/internal/utils.h	/^#define DISALLOW_COPY_AND_ASSIGN(/;"	d
-DIVIDE	include/ps/internal/assign_op.h	/^  DIVIDE,  \/\/ a -= b$/;"	e	enum:ps::AssignOp
-DMLC_BASE_H_	include/dmlc/base.h	/^#define DMLC_BASE_H_$/;"	d
-DMLC_LOGGING_H_	include/dmlc/logging.h	/^#define DMLC_LOGGING_H_$/;"	d
-DMLC_LOG_FATAL_THROW	include/dmlc/base.h	/^#define DMLC_LOG_FATAL_THROW /;"	d
-DMLC_THROW_EXCEPTION	include/dmlc/logging.h	/^#define DMLC_THROW_EXCEPTION /;"	d
-DMLC_USE_CXX11	include/dmlc/base.h	/^#define DMLC_USE_CXX11 /;"	d
-DMLC_USE_CXX11	include/dmlc/base.h	/^#undef DMLC_USE_CXX11$/;"	d
-DMLC_USE_GLOG	include/dmlc/base.h	/^#define DMLC_USE_GLOG /;"	d
-DMLC_USE_HDFS	include/dmlc/base.h	/^#define DMLC_USE_HDFS /;"	d
-DMLC_USE_PS	include/dmlc/base.h	/^#define DMLC_USE_PS /;"	d
-DMLC_USE_S3	include/dmlc/base.h	/^#define DMLC_USE_S3 /;"	d
-DOUBLE	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
-DO_	src/meta.pb.cc	/^#define DO_(/;"	d	file:
-DO_	src/meta.pb.cc	/^#undef DO_$/;"	d	file:
-DataType	include/ps/internal/message.h	/^enum DataType {$/;"	g	namespace:ps
-DataTypeName	include/ps/internal/message.h	/^static const char* DataTypeName[] = {$/;"	m	namespace:ps
-DebugStr	include/ps/sarray.h	/^inline std::string DebugStr(const V* data, int n, int m = 5) {$/;"	f	namespace:ps
-DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Control
-DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Message
-DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Meta
-DebugString	include/ps/internal/message.h	/^  std::string DebugString() const {$/;"	f	struct:ps::Node
-DecodeDouble	deps/include/google/protobuf/wire_format_lite.h	/^inline double WireFormatLite::DecodeDouble(uint64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-DecodeFloat	deps/include/google/protobuf/wire_format_lite.h	/^inline float WireFormatLite::DecodeFloat(uint32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-DecrementRecursionDepth	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::DecrementRecursionDepth() {$/;"	f	class:google::protobuf::io::CodedInputStream
-DefaultSlicer	include/ps/kv_app.h	/^void KVWorker<Val>::DefaultSlicer($/;"	f	class:ps::KVWorker
-Delete	deps/include/google/protobuf/repeated_field.h	/^  static void Delete(GenericType* value) { delete value; }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-DeleteSubrange	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::DeleteSubrange(int start, int num) {$/;"	f	class:google::protobuf::RepeatedPtrField
-Descriptor	deps/include/google/protobuf/descriptor.h	/^  Descriptor() {}$/;"	f	class:google::protobuf::Descriptor
-Descriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT Descriptor {$/;"	c	namespace:google::protobuf
-DescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^  inline DescriptorDatabase() {}$/;"	f	class:google::protobuf::DescriptorDatabase
-DescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT DescriptorDatabase {$/;"	c	namespace:google::protobuf
-DescriptorIndex	deps/include/google/protobuf/descriptor_database.h	/^  class DescriptorIndex {$/;"	c	class:google::protobuf::SimpleDescriptorDatabase
-DescriptorPool	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT DescriptorPool {$/;"	c	namespace:google::protobuf
-DescriptorPoolDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT DescriptorPoolDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
-DescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT DescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-DescriptorProto_ExtensionRange	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT DescriptorProto_ExtensionRange : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-Destroy	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrFieldBase::Destroy() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-DiskFileToVirtualFileResult	deps/include/google/protobuf/compiler/importer.h	/^  enum DiskFileToVirtualFileResult {$/;"	g	class:google::protobuf::compiler::DiskSourceTree
-DiskSourceTree	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT DiskSourceTree : public SourceTree {$/;"	c	namespace:google::protobuf::compiler
-DynamicMessageFactory	deps/include/google/protobuf/dynamic_message.h	/^class LIBPROTOBUF_EXPORT DynamicMessageFactory : public MessageFactory {$/;"	c	namespace:google::protobuf
-EADDRINUSE	deps/include/zmq.h	/^#define EADDRINUSE /;"	d
-EADDRNOTAVAIL	deps/include/zmq.h	/^#define EADDRNOTAVAIL /;"	d
-EAFNOSUPPORT	deps/include/zmq.h	/^#define EAFNOSUPPORT /;"	d
-ECONNABORTED	deps/include/zmq.h	/^#define ECONNABORTED /;"	d
-ECONNREFUSED	deps/include/zmq.h	/^#define ECONNREFUSED /;"	d
-ECONNRESET	deps/include/zmq.h	/^#define ECONNRESET /;"	d
-EFSM	deps/include/zmq.h	/^#define EFSM /;"	d
-EHOSTUNREACH	deps/include/zmq.h	/^#define EHOSTUNREACH /;"	d
-EINPROGRESS	deps/include/zmq.h	/^#define EINPROGRESS /;"	d
-EMPTY	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-EMSGSIZE	deps/include/zmq.h	/^#define EMSGSIZE /;"	d
-EMTHREAD	deps/include/zmq.h	/^#define EMTHREAD /;"	d
-ENETDOWN	deps/include/zmq.h	/^#define ENETDOWN /;"	d
-ENETRESET	deps/include/zmq.h	/^#define ENETRESET /;"	d
-ENETUNREACH	deps/include/zmq.h	/^#define ENETUNREACH /;"	d
-ENOBUFS	deps/include/zmq.h	/^#define ENOBUFS /;"	d
-ENOCOMPATPROTO	deps/include/zmq.h	/^#define ENOCOMPATPROTO /;"	d
-ENOTCONN	deps/include/zmq.h	/^#define ENOTCONN /;"	d
-ENOTSOCK	deps/include/zmq.h	/^#define ENOTSOCK /;"	d
-ENOTSUP	deps/include/zmq.h	/^#define ENOTSUP /;"	d
-EPROTONOSUPPORT	deps/include/zmq.h	/^#define EPROTONOSUPPORT /;"	d
-ERROR_FORMAT_GCC	deps/include/google/protobuf/compiler/command_line_interface.h	/^    ERROR_FORMAT_GCC,   \/\/ GCC error output format (default).$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ErrorFormat
-ERROR_FORMAT_MSVS	deps/include/google/protobuf/compiler/command_line_interface.h	/^    ERROR_FORMAT_MSVS   \/\/ Visual Studio output (--error_format=msvs).$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ErrorFormat
-ETERM	deps/include/zmq.h	/^#define ETERM /;"	d
-ETIMEDOUT	deps/include/zmq.h	/^#define ETIMEDOUT /;"	d
-EXTENDEE	deps/include/google/protobuf/descriptor.h	/^      EXTENDEE,          \/\/ field extendee$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-ElementCopier	deps/include/google/protobuf/repeated_field.h	/^struct ElementCopier {$/;"	s	namespace:google::protobuf::internal
-ElementCopier	deps/include/google/protobuf/repeated_field.h	/^struct ElementCopier<Element, true> {$/;"	s	namespace:google::protobuf::internal
-EncodeDouble	deps/include/google/protobuf/wire_format_lite.h	/^inline uint64 WireFormatLite::EncodeDouble(double value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-EncodeFloat	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::EncodeFloat(float value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-EncodedDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT EncodedDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
-Entry	src/resender.h	/^  struct Entry {$/;"	s	class:ps::Resender
-EnumDescriptor	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor() {}$/;"	f	class:google::protobuf::EnumDescriptor
-EnumDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT EnumDescriptor {$/;"	c	namespace:google::protobuf
-EnumDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-EnumOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-EnumSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::EnumSize(int value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-EnumTypeTraits	deps/include/google/protobuf/extension_set.h	/^class EnumTypeTraits {$/;"	c	namespace:google::protobuf::internal
-EnumValidityCheck	deps/include/google/protobuf/extension_set.h	/^  struct EnumValidityCheck {$/;"	s	struct:google::protobuf::internal::ExtensionInfo
-EnumValidityFunc	deps/include/google/protobuf/extension_set.h	/^typedef bool EnumValidityFunc(int number);$/;"	t	namespace:google::protobuf::internal
-EnumValidityFuncWithArg	deps/include/google/protobuf/extension_set.h	/^typedef bool EnumValidityFuncWithArg(const void* arg, int number);$/;"	t	namespace:google::protobuf::internal
-EnumValueDescriptor	deps/include/google/protobuf/descriptor.h	/^  EnumValueDescriptor() {}$/;"	f	class:google::protobuf::EnumValueDescriptor
-EnumValueDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT EnumValueDescriptor {$/;"	c	namespace:google::protobuf
-EnumValueDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumValueDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-EnumValueOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT EnumValueOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-Environment	include/ps/internal/env.h	/^  explicit Environment(const std::unordered_map<std::string, std::string>* envs) {$/;"	f	class:ps::Environment
-Environment	include/ps/internal/env.h	/^class Environment {$/;"	c	namespace:ps
-Error	include/dmlc/logging.h	/^  explicit Error(const std::string &s) : std::runtime_error(s) {}$/;"	f	struct:dmlc::Error
-Error	include/dmlc/logging.h	/^struct Error : public std::runtime_error {$/;"	s	namespace:dmlc
-ErrorCollector	deps/include/google/protobuf/descriptor.h	/^    inline ErrorCollector() {}$/;"	f	class:google::protobuf::DescriptorPool::ErrorCollector
-ErrorCollector	deps/include/google/protobuf/descriptor.h	/^  class LIBPROTOBUF_EXPORT ErrorCollector {$/;"	c	class:google::protobuf::DescriptorPool
-ErrorCollector	deps/include/google/protobuf/io/tokenizer.h	/^  inline ErrorCollector() {}$/;"	f	class:google::protobuf::io::ErrorCollector
-ErrorCollector	deps/include/google/protobuf/io/tokenizer.h	/^class LIBPROTOBUF_EXPORT ErrorCollector {$/;"	c	namespace:google::protobuf::io
-ErrorFormat	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum ErrorFormat {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
-ErrorLocation	deps/include/google/protobuf/descriptor.h	/^    enum ErrorLocation {$/;"	g	class:google::protobuf::DescriptorPool::ErrorCollector
-ExSocket	tracker/tracker.py	/^class ExSocket:$/;"	c
-ExpectAtEnd	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ExpectAtEnd() {$/;"	f	class:google::protobuf::io::CodedInputStream
-ExpectTag	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ExpectTag(uint32 expected) {$/;"	f	class:google::protobuf::io::CodedInputStream
-ExpectTagFromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ExpectTagFromArray($/;"	f	class:google::protobuf::io::CodedInputStream
-Extendee	deps/include/google/protobuf/extension_set.h	/^  typedef ExtendeeType Extendee;$/;"	t	class:google::protobuf::internal::ExtensionIdentifier
-Extension	deps/include/google/protobuf/extension_set.h	/^  struct Extension {$/;"	s	class:google::protobuf::internal::ExtensionSet
-ExtensionFinder	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT ExtensionFinder {$/;"	c	namespace:google::protobuf::internal
-ExtensionIdentifier	deps/include/google/protobuf/extension_set.h	/^  ExtensionIdentifier(int number, typename TypeTraits::ConstType default_value)$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
-ExtensionIdentifier	deps/include/google/protobuf/extension_set.h	/^class ExtensionIdentifier {$/;"	c	namespace:google::protobuf::internal
-ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^  inline ExtensionInfo() {}$/;"	f	struct:google::protobuf::internal::ExtensionInfo
-ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^  inline ExtensionInfo(FieldType type_param, bool isrepeated, bool ispacked)$/;"	f	struct:google::protobuf::internal::ExtensionInfo
-ExtensionInfo	deps/include/google/protobuf/extension_set.h	/^struct ExtensionInfo {$/;"	s	namespace:google::protobuf::internal
-ExtensionRange	deps/include/google/protobuf/descriptor.h	/^  struct ExtensionRange {$/;"	s	class:google::protobuf::Descriptor
-ExtensionRange	deps/include/google/protobuf/descriptor.pb.h	/^  typedef DescriptorProto_ExtensionRange ExtensionRange;$/;"	t	class:google::protobuf::DescriptorProto
-ExtensionSet	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT ExtensionSet {$/;"	c	namespace:google::protobuf::internal
-ExtractSubrange	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::ExtractSubrange($/;"	f	class:google::protobuf::RepeatedPtrField
-ExtractSubrange	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::ExtractSubrange($/;"	f	class:google::protobuf::RepeatedField
-FLOAT	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
-F_OK	src/windows/unistd.h	/^#define F_OK /;"	d
-FatalException	deps/include/google/protobuf/stubs/common.h	/^  FatalException(const char* filename, int line, const std::string& message)$/;"	f	class:google::protobuf::FatalException
-FatalException	deps/include/google/protobuf/stubs/common.h	/^class FatalException : public std::exception {$/;"	c	namespace:google::protobuf
-FieldDescriptor	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor() {}$/;"	f	class:google::protobuf::FieldDescriptor
-FieldDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT FieldDescriptor {$/;"	c	namespace:google::protobuf
-FieldDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FieldDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-FieldDescriptorProto_Label	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldDescriptorProto_Label {$/;"	g	namespace:google::protobuf
-FieldDescriptorProto_Label_LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_OPTIONAL = 1,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
-FieldDescriptorProto_Label_LABEL_REPEATED	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_REPEATED = 3$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
-FieldDescriptorProto_Label_LABEL_REQUIRED	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Label_LABEL_REQUIRED = 2,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Label
-FieldDescriptorProto_Label_Label_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldDescriptorProto_Label_Label_ARRAYSIZE = FieldDescriptorProto_Label_Label_MAX + 1;$/;"	m	namespace:google::protobuf
-FieldDescriptorProto_Label_Label_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MAX = FieldDescriptorProto_Label_LABEL_REPEATED;$/;"	m	namespace:google::protobuf
-FieldDescriptorProto_Label_Label_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Label FieldDescriptorProto_Label_Label_MIN = FieldDescriptorProto_Label_LABEL_OPTIONAL;$/;"	m	namespace:google::protobuf
-FieldDescriptorProto_Label_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto_Label_Name(FieldDescriptorProto_Label value) {$/;"	f	namespace:google::protobuf
-FieldDescriptorProto_Label_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto_Label_Parse($/;"	f	namespace:google::protobuf
-FieldDescriptorProto_Type	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldDescriptorProto_Type {$/;"	g	namespace:google::protobuf
-FieldDescriptorProto_Type_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto_Type_Name(FieldDescriptorProto_Type value) {$/;"	f	namespace:google::protobuf
-FieldDescriptorProto_Type_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto_Type_Parse($/;"	f	namespace:google::protobuf
-FieldDescriptorProto_Type_TYPE_BOOL	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_BOOL = 8,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_BYTES	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_BYTES = 12,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_DOUBLE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_DOUBLE = 1,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_ENUM	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_ENUM = 14,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_FIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FIXED32 = 7,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_FIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FIXED64 = 6,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_FLOAT	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_FLOAT = 2,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_GROUP	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_GROUP = 10,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_INT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_INT32 = 5,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_INT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_INT64 = 3,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_MESSAGE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_MESSAGE = 11,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_SFIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SFIXED32 = 15,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_SFIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SFIXED64 = 16,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_SINT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SINT32 = 17,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_SINT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_SINT64 = 18$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_STRING = 9,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_UINT32	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_UINT32 = 13,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_TYPE_UINT64	deps/include/google/protobuf/descriptor.pb.h	/^  FieldDescriptorProto_Type_TYPE_UINT64 = 4,$/;"	e	enum:google::protobuf::FieldDescriptorProto_Type
-FieldDescriptorProto_Type_Type_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldDescriptorProto_Type_Type_ARRAYSIZE = FieldDescriptorProto_Type_Type_MAX + 1;$/;"	m	namespace:google::protobuf
-FieldDescriptorProto_Type_Type_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MAX = FieldDescriptorProto_Type_TYPE_SINT64;$/;"	m	namespace:google::protobuf
-FieldDescriptorProto_Type_Type_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldDescriptorProto_Type FieldDescriptorProto_Type_Type_MIN = FieldDescriptorProto_Type_TYPE_DOUBLE;$/;"	m	namespace:google::protobuf
-FieldOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FieldOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-FieldOptions_CType	deps/include/google/protobuf/descriptor.pb.h	/^enum FieldOptions_CType {$/;"	g	namespace:google::protobuf
-FieldOptions_CType_CORD	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_CORD = 1,$/;"	e	enum:google::protobuf::FieldOptions_CType
-FieldOptions_CType_CType_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FieldOptions_CType_CType_ARRAYSIZE = FieldOptions_CType_CType_MAX + 1;$/;"	m	namespace:google::protobuf
-FieldOptions_CType_CType_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FieldOptions_CType FieldOptions_CType_CType_MAX = FieldOptions_CType_STRING_PIECE;$/;"	m	namespace:google::protobuf
-FieldOptions_CType_CType_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FieldOptions_CType FieldOptions_CType_CType_MIN = FieldOptions_CType_STRING;$/;"	m	namespace:google::protobuf
-FieldOptions_CType_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldOptions_CType_Name(FieldOptions_CType value) {$/;"	f	namespace:google::protobuf
-FieldOptions_CType_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions_CType_Parse($/;"	f	namespace:google::protobuf
-FieldOptions_CType_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_STRING = 0,$/;"	e	enum:google::protobuf::FieldOptions_CType
-FieldOptions_CType_STRING_PIECE	deps/include/google/protobuf/descriptor.pb.h	/^  FieldOptions_CType_STRING_PIECE = 2$/;"	e	enum:google::protobuf::FieldOptions_CType
-FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^  FieldSkipper() {}$/;"	f	class:google::protobuf::internal::FieldSkipper
-FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^class LIBPROTOBUF_EXPORT FieldSkipper {$/;"	c	namespace:google::protobuf::internal
-FieldType	deps/include/google/protobuf/extension_set.h	/^typedef uint8 FieldType;$/;"	t	namespace:google::protobuf::internal
-FieldType	deps/include/google/protobuf/wire_format_lite.h	/^  enum FieldType {$/;"	g	class:google::protobuf::internal::WireFormatLite
-FieldTypeToCppType	deps/include/google/protobuf/wire_format_lite.h	/^WireFormatLite::FieldTypeToCppType(FieldType type) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-File	deps/include/google/protobuf/compiler/plugin.pb.h	/^  typedef CodeGeneratorResponse_File File;$/;"	t	class:google::protobuf::compiler::CodeGeneratorResponse
-FileDescriptor	deps/include/google/protobuf/descriptor.h	/^  FileDescriptor() {}$/;"	f	class:google::protobuf::FileDescriptor
-FileDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT FileDescriptor {$/;"	c	namespace:google::protobuf
-FileDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-FileDescriptorSet	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileDescriptorSet : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-FileInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT FileInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-FileOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT FileOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-FileOptions_OptimizeMode	deps/include/google/protobuf/descriptor.pb.h	/^enum FileOptions_OptimizeMode {$/;"	g	namespace:google::protobuf
-FileOptions_OptimizeMode_CODE_SIZE	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_CODE_SIZE = 2,$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
-FileOptions_OptimizeMode_LITE_RUNTIME	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_LITE_RUNTIME = 3$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
-FileOptions_OptimizeMode_Name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions_OptimizeMode_Name(FileOptions_OptimizeMode value) {$/;"	f	namespace:google::protobuf
-FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^const int FileOptions_OptimizeMode_OptimizeMode_ARRAYSIZE = FileOptions_OptimizeMode_OptimizeMode_MAX + 1;$/;"	m	namespace:google::protobuf
-FileOptions_OptimizeMode_OptimizeMode_MAX	deps/include/google/protobuf/descriptor.pb.h	/^const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MAX = FileOptions_OptimizeMode_LITE_RUNTIME;$/;"	m	namespace:google::protobuf
-FileOptions_OptimizeMode_OptimizeMode_MIN	deps/include/google/protobuf/descriptor.pb.h	/^const FileOptions_OptimizeMode FileOptions_OptimizeMode_OptimizeMode_MIN = FileOptions_OptimizeMode_SPEED;$/;"	m	namespace:google::protobuf
-FileOptions_OptimizeMode_Parse	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions_OptimizeMode_Parse($/;"	f	namespace:google::protobuf
-FileOptions_OptimizeMode_SPEED	deps/include/google/protobuf/descriptor.pb.h	/^  FileOptions_OptimizeMode_SPEED = 1,$/;"	e	enum:google::protobuf::FileOptions_OptimizeMode
-FileOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT FileOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-Finalize	include/ps/ps.h	/^inline void Finalize(const bool do_barrier = true) {$/;"	f	namespace:ps
-Finalize	src/postoffice.cc	/^void Postoffice::Finalize(const bool do_barrier) {$/;"	f	class:ps::Postoffice
-FindAllExtensionNumbers	deps/include/google/protobuf/descriptor_database.h	/^  virtual bool FindAllExtensionNumbers(const string& extendee_type,$/;"	f	class:google::protobuf::DescriptorDatabase
-FindRange	include/ps/sarray.h	/^Range FindRange(const SArray<V>& arr, V lower, V upper) {$/;"	f	namespace:ps
-Finder	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Finder {$/;"	c	class:google::protobuf::TextFormat
-Format	deps/include/google/protobuf/io/gzip_stream.h	/^  enum Format {$/;"	g	class:google::protobuf::io::GzipInputStream
-Format	deps/include/google/protobuf/io/gzip_stream.h	/^  enum Format {$/;"	g	class:google::protobuf::io::GzipOutputStream
-FreeData	src/zmq_van.h	/^inline void FreeData(void *data, void *hint) {$/;"	f	namespace:ps
-FunctionClosure0	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure0(FunctionType function, bool self_deleting)$/;"	f	class:google::protobuf::internal::FunctionClosure0
-FunctionClosure0	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT FunctionClosure0 : public Closure {$/;"	c	namespace:google::protobuf::internal
-FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure1(FunctionType function, bool self_deleting,$/;"	f	class:google::protobuf::internal::FunctionClosure1
-FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^class FunctionClosure1 : public Closure {$/;"	c	namespace:google::protobuf::internal
-FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^  FunctionClosure2(FunctionType function, bool self_deleting,$/;"	f	class:google::protobuf::internal::FunctionClosure2
-FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^class FunctionClosure2 : public Closure {$/;"	c	namespace:google::protobuf::internal
-FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)();$/;"	t	class:google::protobuf::internal::FunctionClosure0
-FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)(Arg1 arg1);$/;"	t	class:google::protobuf::internal::FunctionClosure1
-FunctionType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (*FunctionType)(Arg1 arg1, Arg2 arg2);$/;"	t	class:google::protobuf::internal::FunctionClosure2
-GOOGLE_ARRAYSIZE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ARRAYSIZE(/;"	d
-GOOGLE_ARRAYSIZE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_ARRAYSIZE$/;"	d
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^                                           int* size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^                                       int size) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint32 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedOutputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^      uint64 value, uint8* target) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedOutputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^  bool ExpectTag(uint32 expected) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/io/coded_stream.h	/^  uint32 ReadTag() GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::io::CodedInputStream
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE /;"	d
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_ALWAYS_INLINE$/;"	d
-GOOGLE_ATTRIBUTE_ALWAYS_INLINE	deps/include/google/protobuf/wire_format_lite.h	/^      RepeatedField<CType>* value) GOOGLE_ATTRIBUTE_ALWAYS_INLINE;$/;"	m	class:google::protobuf::internal::WireFormatLite
-GOOGLE_ATTRIBUTE_DEPRECATED	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_DEPRECATED /;"	d
-GOOGLE_ATTRIBUTE_DEPRECATED	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ATTRIBUTE_DEPRECATED$/;"	d
-GOOGLE_CHECK	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK(/;"	d
-GOOGLE_CHECK	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK$/;"	d
-GOOGLE_CHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_EQ(/;"	d
-GOOGLE_CHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_EQ$/;"	d
-GOOGLE_CHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_GE(/;"	d
-GOOGLE_CHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_GE$/;"	d
-GOOGLE_CHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_GT(/;"	d
-GOOGLE_CHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_GT$/;"	d
-GOOGLE_CHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_LE(/;"	d
-GOOGLE_CHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_LE$/;"	d
-GOOGLE_CHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_LT(/;"	d
-GOOGLE_CHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_LT$/;"	d
-GOOGLE_CHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_NE(/;"	d
-GOOGLE_CHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_NE$/;"	d
-GOOGLE_CHECK_NOTNULL	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_CHECK_NOTNULL(/;"	d
-GOOGLE_CHECK_NOTNULL	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_CHECK_NOTNULL$/;"	d
-GOOGLE_COMPILE_ASSERT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_COMPILE_ASSERT(/;"	d
-GOOGLE_COMPILE_ASSERT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_COMPILE_ASSERT$/;"	d
-GOOGLE_DCHECK	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK(/;"	d
-GOOGLE_DCHECK	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK$/;"	d
-GOOGLE_DCHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_EQ(/;"	d
-GOOGLE_DCHECK_EQ	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_EQ$/;"	d
-GOOGLE_DCHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_GE(/;"	d
-GOOGLE_DCHECK_GE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_GE$/;"	d
-GOOGLE_DCHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_GT(/;"	d
-GOOGLE_DCHECK_GT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_GT$/;"	d
-GOOGLE_DCHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_LE(/;"	d
-GOOGLE_DCHECK_LE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_LE$/;"	d
-GOOGLE_DCHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_LT(/;"	d
-GOOGLE_DCHECK_LT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_LT$/;"	d
-GOOGLE_DCHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DCHECK_NE(/;"	d
-GOOGLE_DCHECK_NE	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DCHECK_NE$/;"	d
-GOOGLE_DISALLOW_EVIL_CONSTRUCTORS	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(/;"	d
-GOOGLE_DISALLOW_EVIL_CONSTRUCTORS	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DISALLOW_EVIL_CONSTRUCTORS$/;"	d
-GOOGLE_DLOG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_DLOG /;"	d
-GOOGLE_DLOG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_DLOG$/;"	d
-GOOGLE_LL_FORMAT	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LL_FORMAT /;"	d
-GOOGLE_LL_FORMAT	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LL_FORMAT$/;"	d
-GOOGLE_LOG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LOG(/;"	d
-GOOGLE_LOG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LOG$/;"	d
-GOOGLE_LOG_IF	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LOG_IF(/;"	d
-GOOGLE_LOG_IF	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LOG_IF$/;"	d
-GOOGLE_LONGLONG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_LONGLONG(/;"	d
-GOOGLE_LONGLONG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_LONGLONG$/;"	d
-GOOGLE_PREDICT_TRUE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PREDICT_TRUE$/;"	d
-GOOGLE_PREDICT_TRUE	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PREDICT_TRUE(/;"	d
-GOOGLE_PROTOBUF_ARCH_32_BIT	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_32_BIT /;"	d
-GOOGLE_PROTOBUF_ARCH_64_BIT	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_64_BIT /;"	d
-GOOGLE_PROTOBUF_ARCH_ARM	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_ARM /;"	d
-GOOGLE_PROTOBUF_ARCH_ARM_QNX	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_ARM_QNX /;"	d
-GOOGLE_PROTOBUF_ARCH_IA32	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_IA32 /;"	d
-GOOGLE_PROTOBUF_ARCH_MIPS	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_MIPS /;"	d
-GOOGLE_PROTOBUF_ARCH_PPC	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_PPC /;"	d
-GOOGLE_PROTOBUF_ARCH_X64	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_ARCH_X64 /;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_ERROR	deps/include/google/protobuf/stubs/atomicops.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_ERROR /;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_ERROR	deps/include/google/protobuf/stubs/atomicops.h	/^#undef GOOGLE_PROTOBUF_ATOMICOPS_ERROR$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_H_	deps/include/google/protobuf/stubs/atomicops.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_GCC_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ARM_QNX_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_ATOMICWORD_COMPAT_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MACOSX_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_MIPS_GCC_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_PNACL_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_GCC_H_$/;"	d
-GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^#define GOOGLE_PROTOBUF_ATOMICOPS_INTERNALS_X86_MSVC_H_$/;"	d
-GOOGLE_PROTOBUF_COMMON_H__	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_COMMON_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__	deps/include/google/protobuf/compiler/code_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_CODE_GENERATOR_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__	deps/include/google/protobuf/compiler/command_line_interface.h	/^#define GOOGLE_PROTOBUF_COMPILER_COMMAND_LINE_INTERFACE_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_CPP_GENERATOR_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__	deps/include/google/protobuf/compiler/importer.h	/^#define GOOGLE_PROTOBUF_COMPILER_IMPORTER_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__	deps/include/google/protobuf/compiler/java/java_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_JAVA_GENERATOR_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_PARSER_H__	deps/include/google/protobuf/compiler/parser.h	/^#define GOOGLE_PROTOBUF_COMPILER_PARSER_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__	deps/include/google/protobuf/compiler/plugin.h	/^#define GOOGLE_PROTOBUF_COMPILER_PLUGIN_H__$/;"	d
-GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__	deps/include/google/protobuf/compiler/python/python_generator.h	/^#define GOOGLE_PROTOBUF_COMPILER_PYTHON_GENERATOR_H__$/;"	d
-GOOGLE_PROTOBUF_DECLARE_ONCE	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_DECLARE_ONCE(/;"	d
-GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__	deps/include/google/protobuf/descriptor_database.h	/^#define GOOGLE_PROTOBUF_DESCRIPTOR_DATABASE_H__$/;"	d
-GOOGLE_PROTOBUF_DESCRIPTOR_H__	deps/include/google/protobuf/descriptor.h	/^#define GOOGLE_PROTOBUF_DESCRIPTOR_H__$/;"	d
-GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__	deps/include/google/protobuf/dynamic_message.h	/^#define GOOGLE_PROTOBUF_DYNAMIC_MESSAGE_H__$/;"	d
-GOOGLE_PROTOBUF_EXTENSION_ACCESSORS	deps/include/google/protobuf/extension_set.h	/^#define GOOGLE_PROTOBUF_EXTENSION_ACCESSORS(/;"	d
-GOOGLE_PROTOBUF_EXTENSION_SET_H__	deps/include/google/protobuf/extension_set.h	/^#define GOOGLE_PROTOBUF_EXTENSION_SET_H__$/;"	d
-GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__	deps/include/google/protobuf/generated_enum_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_ENUM_REFLECTION_H__$/;"	d
-GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET	deps/include/google/protobuf/generated_message_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_FIELD_OFFSET(/;"	d
-GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__	deps/include/google/protobuf/generated_message_reflection.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_REFLECTION_H__$/;"	d
-GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__	deps/include/google/protobuf/generated_message_util.h	/^#define GOOGLE_PROTOBUF_GENERATED_MESSAGE_UTIL_H__$/;"	d
-GOOGLE_PROTOBUF_IO_CODED_STREAM_H__	deps/include/google/protobuf/io/coded_stream.h	/^#define GOOGLE_PROTOBUF_IO_CODED_STREAM_H__$/;"	d
-GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__	deps/include/google/protobuf/io/gzip_stream.h	/^#define GOOGLE_PROTOBUF_IO_GZIP_STREAM_H__$/;"	d
-GOOGLE_PROTOBUF_IO_PRINTER_H__	deps/include/google/protobuf/io/printer.h	/^#define GOOGLE_PROTOBUF_IO_PRINTER_H__$/;"	d
-GOOGLE_PROTOBUF_IO_TOKENIZER_H__	deps/include/google/protobuf/io/tokenizer.h	/^#define GOOGLE_PROTOBUF_IO_TOKENIZER_H__$/;"	d
-GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__	deps/include/google/protobuf/io/zero_copy_stream.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_H__$/;"	d
-GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_H__$/;"	d
-GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^#define GOOGLE_PROTOBUF_IO_ZERO_COPY_STREAM_IMPL_LITE_H__$/;"	d
-GOOGLE_PROTOBUF_MESSAGE_H__	deps/include/google/protobuf/message.h	/^#define GOOGLE_PROTOBUF_MESSAGE_H__$/;"	d
-GOOGLE_PROTOBUF_MESSAGE_LITE_H__	deps/include/google/protobuf/message_lite.h	/^#define GOOGLE_PROTOBUF_MESSAGE_LITE_H__$/;"	d
-GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_MIN_LIBRARY_VERSION /;"	d
-GOOGLE_PROTOBUF_MIN_PROTOC_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_MIN_PROTOC_VERSION /;"	d
-GOOGLE_PROTOBUF_ONCE_INIT	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_ONCE_INIT /;"	d
-GOOGLE_PROTOBUF_OS_APPLE	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_OS_APPLE$/;"	d
-GOOGLE_PROTOBUF_OS_NACL	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_OS_NACL$/;"	d
-GOOGLE_PROTOBUF_PLATFORM_MACROS_H_	deps/include/google/protobuf/stubs/platform_macros.h	/^#define GOOGLE_PROTOBUF_PLATFORM_MACROS_H_$/;"	d
-GOOGLE_PROTOBUF_REFLECTION_OPS_H__	deps/include/google/protobuf/reflection_ops.h	/^#define GOOGLE_PROTOBUF_REFLECTION_OPS_H__$/;"	d
-GOOGLE_PROTOBUF_REPEATED_FIELD_H__	deps/include/google/protobuf/repeated_field.h	/^#define GOOGLE_PROTOBUF_REPEATED_FIELD_H__$/;"	d
-GOOGLE_PROTOBUF_SERVICE_H__	deps/include/google/protobuf/service.h	/^#define GOOGLE_PROTOBUF_SERVICE_H__$/;"	d
-GOOGLE_PROTOBUF_STUBS_ONCE_H__	deps/include/google/protobuf/stubs/once.h	/^#define GOOGLE_PROTOBUF_STUBS_ONCE_H__$/;"	d
-GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_	deps/include/google/protobuf/stubs/template_util.h	/^#define GOOGLE_PROTOBUF_TEMPLATE_UTIL_H_$/;"	d
-GOOGLE_PROTOBUF_TEXT_FORMAT_H__	deps/include/google/protobuf/text_format.h	/^#define GOOGLE_PROTOBUF_TEXT_FORMAT_H__$/;"	d
-GOOGLE_PROTOBUF_TYPE_TRAITS_H_	deps/include/google/protobuf/stubs/type_traits.h	/^#define GOOGLE_PROTOBUF_TYPE_TRAITS_H_$/;"	d
-GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__	deps/include/google/protobuf/unknown_field_set.h	/^#define GOOGLE_PROTOBUF_UNKNOWN_FIELD_SET_H__$/;"	d
-GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED	deps/include/google/protobuf/wire_format.h	/^#define GOOGLE_PROTOBUF_UTF8_VALIDATION_ENABLED$/;"	d
-GOOGLE_PROTOBUF_VERIFY_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_VERIFY_VERSION /;"	d
-GOOGLE_PROTOBUF_VERSION	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_PROTOBUF_VERSION /;"	d
-GOOGLE_PROTOBUF_WIRE_FORMAT_H__	deps/include/google/protobuf/wire_format.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_H__$/;"	d
-GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__	deps/include/google/protobuf/wire_format_lite.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_H__$/;"	d
-GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__	deps/include/google/protobuf/wire_format_lite_inl.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_LITE_INL_H__$/;"	d
-GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG	deps/include/google/protobuf/wire_format_lite.h	/^#define GOOGLE_PROTOBUF_WIRE_FORMAT_MAKE_TAG(/;"	d
-GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_SAFE_CONCURRENT_WRITES_BEGIN(/;"	d
-GOOGLE_SAFE_CONCURRENT_WRITES_END	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_SAFE_CONCURRENT_WRITES_END(/;"	d
-GOOGLE_ULONGLONG	deps/include/google/protobuf/stubs/common.h	/^#define GOOGLE_ULONGLONG(/;"	d
-GOOGLE_ULONGLONG	deps/include/google/protobuf/stubs/common.h	/^#undef GOOGLE_ULONGLONG$/;"	d
-GZIP	deps/include/google/protobuf/io/gzip_stream.h	/^    GZIP = 1,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
-GZIP	deps/include/google/protobuf/io/gzip_stream.h	/^    GZIP = 1,$/;"	e	enum:google::protobuf::io::GzipOutputStream::Format
-GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^  GeneratedExtensionFinder(const MessageLite* containing_type)$/;"	f	class:google::protobuf::internal::GeneratedExtensionFinder
-GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT GeneratedExtensionFinder : public ExtensionFinder {$/;"	c	namespace:google::protobuf::internal
-GeneratedMessageReflection	deps/include/google/protobuf/generated_message_reflection.h	/^class LIBPROTOBUF_EXPORT GeneratedMessageReflection : public Reflection {$/;"	c	namespace:google::protobuf::internal
-Generator	deps/include/google/protobuf/compiler/python/python_generator.h	/^class LIBPROTOC_EXPORT Generator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::python
-GeneratorContext	deps/include/google/protobuf/compiler/code_generator.h	/^  inline GeneratorContext() {}$/;"	f	class:google::protobuf::compiler::GeneratorContext
-GeneratorContext	deps/include/google/protobuf/compiler/code_generator.h	/^class LIBPROTOC_EXPORT GeneratorContext {$/;"	c	namespace:google::protobuf::compiler
-GeneratorInfo	deps/include/google/protobuf/compiler/command_line_interface.h	/^  struct GeneratorInfo {$/;"	s	class:google::protobuf::compiler::CommandLineInterface
-GeneratorMap	deps/include/google/protobuf/compiler/command_line_interface.h	/^  typedef map<string, GeneratorInfo> GeneratorMap;$/;"	t	class:google::protobuf::compiler::CommandLineInterface
-GenericTypeHandler	deps/include/google/protobuf/repeated_field.h	/^class GenericTypeHandler {$/;"	c	namespace:google::protobuf::internal
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set, int index) {$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set, int index) {$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::EnumTypeTraits
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline ConstType Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline const string& Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
-Get	deps/include/google/protobuf/extension_set.h	/^  static inline const string& Get(int number, const ExtensionSet& set,$/;"	f	class:google::protobuf::internal::StringTypeTraits
-Get	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::Get(int index) const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Get	deps/include/google/protobuf/repeated_field.h	/^inline const Element& RepeatedField<Element>::Get(int index) const {$/;"	f	class:google::protobuf::RepeatedField
-Get	deps/include/google/protobuf/repeated_field.h	/^inline const Element& RepeatedPtrField<Element>::Get(int index) const {$/;"	f	class:google::protobuf::RepeatedPtrField
-Get	include/ps/internal/env.h	/^  static inline Environment* Get() {$/;"	f	class:ps::Environment
-Get	include/ps/internal/postoffice.h	/^  static Postoffice* Get() {$/;"	f	class:ps::Postoffice
-GetAvailableInterfaceAndIP	src/network_utils.h	/^void GetAvailableInterfaceAndIP($/;"	f	namespace:ps
-GetAvailablePort	src/network_utils.h	/^int GetAvailablePort() {$/;"	f	namespace:ps
-GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-GetCachedSize	deps/include/google/protobuf/compiler/plugin.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::DescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::EnumValueOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FieldDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FieldOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileDescriptorSet
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::FileOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MessageOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MethodDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::MethodOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::ServiceDescriptorProto
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::ServiceOptions
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::SourceCodeInfo
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::UninterpretedOption
-GetCachedSize	deps/include/google/protobuf/descriptor.pb.h	/^  int GetCachedSize() const { return _cached_size_; }$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-GetCustomer	src/postoffice.cc	/^Customer* Postoffice::GetCustomer(int id, int timeout) const {$/;"	f	class:ps::Postoffice
-GetDataType	include/ps/internal/message.h	/^DataType GetDataType() {$/;"	f	namespace:ps
-GetDeadNodes	src/postoffice.cc	/^std::vector<int> Postoffice::GetDeadNodes(int t) {$/;"	f	class:ps::Postoffice
-GetDescriptor	deps/include/google/protobuf/message.h	/^  const Descriptor* GetDescriptor() const { return GetMetadata().descriptor; }$/;"	f	class:google::protobuf::Message
-GetDirectBufferForNBytesAndAdvance	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::GetDirectBufferForNBytesAndAdvance(int size) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-GetDirectBufferPointerInline	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::GetDirectBufferPointerInline(const void** data,$/;"	f	class:google::protobuf::io::CodedInputStream
-GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Label>() {$/;"	f	namespace:google::protobuf
-GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldDescriptorProto_Type>() {$/;"	f	namespace:google::protobuf
-GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FieldOptions_CType>() {$/;"	f	namespace:google::protobuf
-GetEnumDescriptor	deps/include/google/protobuf/descriptor.pb.h	/^inline const EnumDescriptor* GetEnumDescriptor< ::google::protobuf::FileOptions_OptimizeMode>() {$/;"	f	namespace:google::protobuf
-GetEnv	include/ps/internal/utils.h	/^inline V GetEnv(const char *key, V default_val) {$/;"	f	namespace:ps
-GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int GetErrno() { return errno_; }$/;"	f	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int GetErrno() { return errno_; }$/;"	f	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int GetErrno() { return copying_input_.GetErrno(); }$/;"	f	class:google::protobuf::io::FileInputStream
-GetErrno	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int GetErrno() { return copying_output_.GetErrno(); }$/;"	f	class:google::protobuf::io::FileOutputStream
-GetExtensionFactory	deps/include/google/protobuf/io/coded_stream.h	/^inline MessageFactory* CodedInputStream::GetExtensionFactory() {$/;"	f	class:google::protobuf::io::CodedInputStream
-GetExtensionPool	deps/include/google/protobuf/io/coded_stream.h	/^inline const DescriptorPool* CodedInputStream::GetExtensionPool() {$/;"	f	class:google::protobuf::io::CodedInputStream
-GetIP	src/network_utils.h	/^void GetIP(const std::string& interface, std::string* ip) {$/;"	f	namespace:ps
-GetKey	src/resender.h	/^  uint64_t GetKey(const Message& msg) {$/;"	f	class:ps::Resender
-GetLengthDelimitedSize	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownField::GetLengthDelimitedSize() const {$/;"	f	class:google::protobuf::UnknownField
-GetMessage	deps/include/google/protobuf/stubs/common.h	/^#undef GetMessage$/;"	d
-GetMessage	deps/include/google/protobuf/stubs/common.h	/^inline BOOL GetMessage($/;"	f
-GetMessage_Win32	deps/include/google/protobuf/stubs/common.h	/^inline BOOL GetMessage_Win32($/;"	f
-GetNodeID	src/zmq_van.h	/^  int GetNodeID(const char* buf, size_t size) {$/;"	f	class:ps::ZMQVan
-GetNodeIDs	include/ps/internal/postoffice.h	/^  const std::vector<int>& GetNodeIDs(int node_id) const {$/;"	f	class:ps::Postoffice
-GetReflection	deps/include/google/protobuf/message.h	/^  virtual const Reflection* GetReflection() const {$/;"	f	class:google::protobuf::Message
-GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<Message>& Reflection::GetRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
-GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<PB>& Reflection::GetRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
-GetRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline const RepeatedPtrField<string>& Reflection::GetRepeatedPtrField<string>($/;"	f	class:google::protobuf::Reflection
-GetServerKeyRanges	src/postoffice.cc	/^const std::vector<Range>& Postoffice::GetServerKeyRanges() {$/;"	f	class:ps::Postoffice
-GetSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  const string& GetSyntaxIdentifier() { return syntax_identifier_; }$/;"	f	class:google::protobuf::compiler::Parser
-GetTagFieldNumber	deps/include/google/protobuf/wire_format_lite.h	/^inline int WireFormatLite::GetTagFieldNumber(uint32 tag) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-GetTagWireType	deps/include/google/protobuf/wire_format_lite.h	/^inline WireFormatLite::WireType WireFormatLite::GetTagWireType(uint32 tag) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-GetTimestamp	include/ps/internal/van.h	/^  int GetTimestamp() { return timestamp_++; }$/;"	f	class:ps::Van
-GetTypeName	src/meta.pb.cc	/^::std::string PBControl::GetTypeName() const {$/;"	f	class:ps::PBControl
-GetTypeName	src/meta.pb.cc	/^::std::string PBMeta::GetTypeName() const {$/;"	f	class:ps::PBMeta
-GetTypeName	src/meta.pb.cc	/^::std::string PBNode::GetTypeName() const {$/;"	f	class:ps::PBNode
-GetValidationErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  DescriptorPool::ErrorCollector* GetValidationErrorCollector() {$/;"	f	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-GoogleOnceInit	deps/include/google/protobuf/stubs/once.h	/^inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)()) {$/;"	f	namespace:google::protobuf
-GoogleOnceInit	deps/include/google/protobuf/stubs/once.h	/^inline void GoogleOnceInit(ProtobufOnceType* once, void (*init_func)(Arg),$/;"	f	namespace:google::protobuf
-GroupSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::GroupSize(const MessageLite& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-GroupSizeNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::GroupSizeNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-GzipInputStream	deps/include/google/protobuf/io/gzip_stream.h	/^class LIBPROTOBUF_EXPORT GzipInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-GzipOutputStream	deps/include/google/protobuf/io/gzip_stream.h	/^class LIBPROTOBUF_EXPORT GzipOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-HEARTBEAT	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-HadError	deps/include/google/protobuf/io/coded_stream.h	/^  bool HadError() const { return had_error_; }$/;"	f	class:google::protobuf::io::CodedOutputStream
-Heartbeat	src/van.cc	/^void Van::Heartbeat() {$/;"	f	class:ps::Van
-I18NSPHINXOPTS	docs/Makefile	/^I18NSPHINXOPTS  = $(PAPEROPT_$(PAPER)) $(SPHINXOPTS) .$/;"	m
-IDtoRank	include/ps/internal/postoffice.h	/^  static inline int IDtoRank(int id) {$/;"	f	class:ps::Postoffice
-INCPATH	Makefile	/^INCPATH = -I.\/src -I.\/include -I$(DEPS_PATH)\/include$/;"	m
-INL	deps/include/google/protobuf/wire_format_lite.h	/^                                                    CType* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^                                           RepeatedField<CType>* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^                                         RepeatedField<CType>* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^      field_number, const MessageLite& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, const MessageType& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, const string& value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^    field_number, uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline bool ReadPrimitive(input, CType* value) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteBoolNoTagToArray    (bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteDoubleNoTagToArray  (double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteEnumNoTagToArray    (int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFixed32NoTagToArray (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFixed64NoTagToArray (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteFloatNoTagToArray   (float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteInt32NoTagToArray   (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteInt64NoTagToArray   (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSFixed32NoTagToArray(int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSFixed64NoTagToArray(int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSInt32NoTagToArray  (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteSInt64NoTagToArray  (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteTagToArray(field_number, WireType type, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteUInt32NoTagToArray  (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline uint8* WriteUInt64NoTagToArray  (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteBoolNoTag    (bool value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteDoubleNoTag  (double value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteEnumNoTag    (int value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFixed32NoTag (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFixed64NoTag (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteFloatNoTag   (float value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteInt32NoTag   (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteInt64NoTag   (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSFixed32NoTag(int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSFixed64NoTag(int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSInt32NoTag  (int32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteSInt64NoTag  (int64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteTag(field_number, WireType type, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteUInt32NoTag  (uint32 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^  static inline void WriteUInt64NoTag  (uint64 value, output) INL;$/;"	m	class:google::protobuf::internal::WireFormatLite
-INL	deps/include/google/protobuf/wire_format_lite.h	/^#define INL /;"	d
-INL	deps/include/google/protobuf/wire_format_lite.h	/^#undef INL$/;"	d
-INPUT_TYPE	deps/include/google/protobuf/descriptor.h	/^      INPUT_TYPE,        \/\/ method input type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-INT16	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
-INT32	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
-INT64	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
-INT8	include/ps/internal/message.h	/^  CHAR, INT8, INT16, INT32, INT64,$/;"	e	enum:ps::DataType
-INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION	src/meta.pb.cc	/^#define INTERNAL_SUPPRESS_PROTOBUF_FIELD_DEPRECATION$/;"	d	file:
-Importer	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT Importer {$/;"	c	namespace:google::protobuf::compiler
-IncrementRecursionDepth	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::IncrementRecursionDepth() {$/;"	f	class:google::protobuf::io::CodedInputStream
-Init	include/ps/internal/env.h	/^  static inline Environment* Init(const std::unordered_map<std::string, std::string>& envs) {$/;"	f	class:ps::Environment
-InitAsDefaultInstance	src/meta.pb.cc	/^void PBControl::InitAsDefaultInstance() {$/;"	f	class:ps::PBControl
-InitAsDefaultInstance	src/meta.pb.cc	/^void PBMeta::InitAsDefaultInstance() {$/;"	f	class:ps::PBMeta
-InitAsDefaultInstance	src/meta.pb.cc	/^void PBNode::InitAsDefaultInstance() {$/;"	f	class:ps::PBNode
-InitLogging	include/dmlc/logging.h	/^inline void InitLogging(const char* argv0) {$/;"	f	namespace:dmlc
-Int32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::Int32Size(int32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-Int64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::Int64Size(int64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-IsFlat	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::IsFlat() const {$/;"	f	class:google::protobuf::io::CodedInputStream
-IsInitialized	src/meta.pb.cc	/^bool PBControl::IsInitialized() const {$/;"	f	class:ps::PBControl
-IsInitialized	src/meta.pb.cc	/^bool PBMeta::IsInitialized() const {$/;"	f	class:ps::PBMeta
-IsInitialized	src/meta.pb.cc	/^bool PBNode::IsInitialized() const {$/;"	f	class:ps::PBNode
-IsReady	include/ps/internal/van.h	/^  bool IsReady() { return ready_; }$/;"	f	class:ps::Van
-IsScheduler	include/ps/ps.h	/^inline bool IsScheduler() { return Postoffice::Get()->is_scheduler(); }$/;"	f	namespace:ps
-IsServer	include/ps/ps.h	/^inline bool IsServer() { return Postoffice::Get()->is_server(); }$/;"	f	namespace:ps
-IsTypePackable	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::IsTypePackable(Type field_type) {$/;"	f	class:google::protobuf::FieldDescriptor
-IsWorker	include/ps/ps.h	/^inline bool IsWorker() { return Postoffice::Get()->is_worker(); }$/;"	f	namespace:ps
-IstreamInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT IstreamInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-JavaGenerator	deps/include/google/protobuf/compiler/java/java_generator.h	/^class LIBPROTOC_EXPORT JavaGenerator : public CodeGenerator {$/;"	c	namespace:google::protobuf::compiler::java
-KVMeta	include/ps/kv_app.h	/^struct KVMeta {$/;"	s	namespace:ps
-KVPairs	include/ps/kv_app.h	/^struct KVPairs {$/;"	s	namespace:ps
-KVServer	include/ps/kv_app.h	/^  explicit KVServer(int app_id) : SimpleApp() {$/;"	f	class:ps::KVServer
-KVServer	include/ps/kv_app.h	/^class KVServer : public SimpleApp {$/;"	c	namespace:ps
-KVServerDefaultHandle	include/ps/kv_app.h	/^struct KVServerDefaultHandle {$/;"	s	namespace:ps
-KVWorker	include/ps/kv_app.h	/^  explicit KVWorker(int app_id) : SimpleApp() {$/;"	f	class:ps::KVWorker
-KVWorker	include/ps/kv_app.h	/^class KVWorker : public SimpleApp {$/;"	c	namespace:ps
-LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.h	/^    LABEL_OPTIONAL      = 1,    \/\/ optional$/;"	e	enum:google::protobuf::FieldDescriptor::Label
-LABEL_OPTIONAL	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_OPTIONAL = FieldDescriptorProto_Label_LABEL_OPTIONAL;$/;"	m	class:google::protobuf::FieldDescriptorProto
-LABEL_REPEATED	deps/include/google/protobuf/descriptor.h	/^    LABEL_REPEATED      = 3,    \/\/ repeated$/;"	e	enum:google::protobuf::FieldDescriptor::Label
-LABEL_REPEATED	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_REPEATED = FieldDescriptorProto_Label_LABEL_REPEATED;$/;"	m	class:google::protobuf::FieldDescriptorProto
-LABEL_REQUIRED	deps/include/google/protobuf/descriptor.h	/^    LABEL_REQUIRED      = 2,    \/\/ required$/;"	e	enum:google::protobuf::FieldDescriptor::Label
-LABEL_REQUIRED	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label LABEL_REQUIRED = FieldDescriptorProto_Label_LABEL_REQUIRED;$/;"	m	class:google::protobuf::FieldDescriptorProto
-LDFLAGS	tests/test.mk	/^LDFLAGS = -Wl,-rpath,$(DEPS_PATH)\/lib $(PS_LDFLAGS_SO) -pthread$/;"	m
-LIBPROTOBUF_EXPORT	deps/include/google/protobuf/stubs/common.h	/^    #define LIBPROTOBUF_EXPORT /;"	d
-LIBPROTOC_EXPORT	deps/include/google/protobuf/stubs/common.h	/^    #define LIBPROTOC_EXPORT /;"	d
-LINE_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    LINE_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
-LITE_RUNTIME	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode LITE_RUNTIME = FileOptions_OptimizeMode_LITE_RUNTIME;$/;"	m	class:google::protobuf::FileOptions
-LL	include/ps/internal/utils.h	/^#define LL /;"	d
-LOGLEVEL_DFATAL	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_DFATAL = LOGLEVEL_ERROR$/;"	e	enum:google::protobuf::LogLevel
-LOGLEVEL_ERROR	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_ERROR,    \/\/ An error occurred which should never happen during$/;"	e	enum:google::protobuf::LogLevel
-LOGLEVEL_FATAL	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_FATAL,    \/\/ An error occurred from which the library cannot$/;"	e	enum:google::protobuf::LogLevel
-LOGLEVEL_INFO	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_INFO,     \/\/ Informational.  This is never actually used by$/;"	e	enum:google::protobuf::LogLevel
-LOGLEVEL_WARNING	deps/include/google/protobuf/stubs/common.h	/^  LOGLEVEL_WARNING,  \/\/ Warns about issues that, although not technically a$/;"	e	enum:google::protobuf::LogLevel
-LZ4	make/deps.mk	/^LZ4 = ${DEPS_PATH}\/include\/lz4.h$/;"	m
-Label	deps/include/google/protobuf/descriptor.h	/^  enum Label {$/;"	g	class:google::protobuf::FieldDescriptor
-Label	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldDescriptorProto_Label Label;$/;"	t	class:google::protobuf::FieldDescriptorProto
-Label_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int Label_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Label_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Label_IsValid(int value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-Label_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label Label_MAX =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Label_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const Label Label_MIN =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Label_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& Label_Name(Label value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-Label_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Label_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldDescriptorProto
-Label_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  Label_descriptor() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-LastTagWas	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::LastTagWas(uint32 expected) {$/;"	f	class:google::protobuf::io::CodedInputStream
-LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^    LazyMessageExtension() {}$/;"	f	class:google::protobuf::internal::ExtensionSet::LazyMessageExtension
-LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^  class LIBPROTOBUF_EXPORT LazyMessageExtension {$/;"	c	class:google::protobuf::internal::ExtensionSet
-LengthDelimitedSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::LengthDelimitedSize(int length) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-Limit	deps/include/google/protobuf/io/coded_stream.h	/^  typedef int Limit;$/;"	t	class:google::protobuf::io::CodedInputStream
-LimitingInputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT LimitingInputStream : public ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-LintHelper	tests/lint.py	/^class LintHelper(object):$/;"	c
-LinuxKernelCmpxchgFunc	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^typedef Atomic32 (*LinuxKernelCmpxchgFunc)(Atomic32 old_value,$/;"	t	namespace:google::protobuf::internal
-LinuxKernelMemoryBarrierFunc	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^typedef void (*LinuxKernelMemoryBarrierFunc)(void);$/;"	t	namespace:google::protobuf::internal
-LocalLauncher	tracker/dmlc_local.py	/^class LocalLauncher(object):$/;"	c
-Location	deps/include/google/protobuf/descriptor.pb.h	/^  typedef SourceCodeInfo_Location Location;$/;"	t	class:google::protobuf::SourceCodeInfo
-LocationMap	deps/include/google/protobuf/compiler/parser.h	/^    pair<int, int> > LocationMap;$/;"	t	class:google::protobuf::compiler::SourceLocationTable
-LocationMap	deps/include/google/protobuf/text_format.h	/^    typedef map<const FieldDescriptor*, vector<ParseLocation> > LocationMap;$/;"	t	class:google::protobuf::TextFormat::ParseInfoTree
-LocationRecorder	deps/include/google/protobuf/compiler/parser.h	/^  class LIBPROTOBUF_EXPORT LocationRecorder {$/;"	c	class:google::protobuf::compiler::Parser
-LogFinisher	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogFinisher {$/;"	c	namespace:google::protobuf::internal
-LogHandler	deps/include/google/protobuf/stubs/common.h	/^typedef void LogHandler(LogLevel level, const char* filename, int line,$/;"	t	namespace:google::protobuf
-LogLevel	deps/include/google/protobuf/stubs/common.h	/^enum LogLevel {$/;"	g	namespace:google::protobuf
-LogMessage	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogMessage {$/;"	c	namespace:google::protobuf::internal
-LogSilencer	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT LogSilencer {$/;"	c	namespace:google::protobuf
-MAX_CPPTYPE	deps/include/google/protobuf/descriptor.h	/^    MAX_CPPTYPE         = 10,    \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::CppType
-MAX_CPPTYPE	deps/include/google/protobuf/wire_format_lite.h	/^    MAX_CPPTYPE         = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::CppType
-MAX_FIELD_TYPE	deps/include/google/protobuf/wire_format_lite.h	/^    MAX_FIELD_TYPE      = 18,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-MAX_LABEL	deps/include/google/protobuf/descriptor.h	/^    MAX_LABEL           = 3,    \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::Label
-MAX_TYPE	deps/include/google/protobuf/descriptor.h	/^    MAX_TYPE            = 18,  \/\/ Constant useful for defining lookup tables$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-MINUS	include/ps/internal/assign_op.h	/^  MINUS,   \/\/ a -= b$/;"	e	enum:ps::AssignOp
-MODE_COMPILE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_COMPILE,  \/\/ Normal mode:  parse .proto files and compile them.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
-MODE_DECODE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_DECODE    \/\/ --decode:  read binary from stdin, write text to stdout.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
-MODE_ENCODE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    MODE_ENCODE,   \/\/ --encode:  read text from stdin, write binary to stdout.$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::Mode
-MakeTag	deps/include/google/protobuf/wire_format.h	/^inline uint32 WireFormat::MakeTag(const FieldDescriptor* field) {$/;"	f	class:google::protobuf::internal::WireFormat
-MakeTag	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::MakeTag(int field_number, WireType type) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-Manage	src/postoffice.cc	/^void Postoffice::Manage(const Message& recv) {$/;"	f	class:ps::Postoffice
-Mapping	deps/include/google/protobuf/compiler/importer.h	/^    inline Mapping(const string& virtual_path_param,$/;"	f	struct:google::protobuf::compiler::DiskSourceTree::Mapping
-Mapping	deps/include/google/protobuf/compiler/importer.h	/^  struct Mapping {$/;"	s	class:google::protobuf::compiler::DiskSourceTree
-MarkdownParser	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
-MarkdownParser	docs/sphinx_util.py	/^MarkdownParser = parser.CommonMarkParser$/;"	v
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-MemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void MemoryBarrier() {$/;"	f	namespace:google::protobuf::internal
-Merge	deps/include/google/protobuf/repeated_field.h	/^  static void Merge(const GenericType& from, GenericType* to) {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-Merge	deps/include/google/protobuf/repeated_field.h	/^  static void Merge(const string& from, string* to) { *to = from; }$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
-Merge	deps/include/google/protobuf/repeated_field.h	/^inline void GenericTypeHandler<MessageLite>::Merge($/;"	f	class:google::protobuf::internal::GenericTypeHandler
-MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::MergeFrom(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
-MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::MergeFrom($/;"	f	class:google::protobuf::RepeatedPtrField
-MergeFrom	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::MergeFrom(const RepeatedPtrFieldBase& other) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-MergeFrom	src/meta.pb.cc	/^void PBControl::MergeFrom(const PBControl& from) {$/;"	f	class:ps::PBControl
-MergeFrom	src/meta.pb.cc	/^void PBMeta::MergeFrom(const PBMeta& from) {$/;"	f	class:ps::PBMeta
-MergeFrom	src/meta.pb.cc	/^void PBNode::MergeFrom(const PBNode& from) {$/;"	f	class:ps::PBNode
-MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBControl::MergePartialFromCodedStream($/;"	f	class:ps::PBControl
-MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBMeta::MergePartialFromCodedStream($/;"	f	class:ps::PBMeta
-MergePartialFromCodedStream	src/meta.pb.cc	/^bool PBNode::MergePartialFromCodedStream($/;"	f	class:ps::PBNode
-MergedDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT MergedDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
-Message	deps/include/google/protobuf/message.h	/^  inline Message() {}$/;"	f	class:google::protobuf::Message
-Message	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT Message : public MessageLite {$/;"	c	namespace:google::protobuf
-Message	include/ps/internal/message.h	/^struct Message {$/;"	s	namespace:ps
-MessageFactory	deps/include/google/protobuf/message.h	/^  inline MessageFactory() {}$/;"	f	class:google::protobuf::MessageFactory
-MessageFactory	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT MessageFactory {$/;"	c	namespace:google::protobuf
-MessageLite	deps/include/google/protobuf/message_lite.h	/^  inline MessageLite() {}$/;"	f	class:google::protobuf::MessageLite
-MessageLite	deps/include/google/protobuf/message_lite.h	/^class LIBPROTOBUF_EXPORT MessageLite {$/;"	c	namespace:google::protobuf
-MessageOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MessageOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-MessageSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::MessageSize(const MessageLite& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-MessageSizeNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::MessageSizeNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-MessageTypeTraits	deps/include/google/protobuf/extension_set.h	/^class MessageTypeTraits {$/;"	c	namespace:google::protobuf::internal
-Meta	include/ps/internal/message.h	/^  Meta() : head(kEmpty), customer_id(kEmpty), timestamp(kEmpty),$/;"	f	struct:ps::Meta
-Meta	include/ps/internal/message.h	/^struct Meta {$/;"	s	namespace:ps
-Metadata	deps/include/google/protobuf/message.h	/^struct Metadata {$/;"	s	namespace:google::protobuf
-MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure0(Class* object, MethodType method, bool self_deleting)$/;"	f	class:google::protobuf::internal::MethodClosure0
-MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure0 : public Closure {$/;"	c	namespace:google::protobuf::internal
-MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure1(Class* object, MethodType method, bool self_deleting,$/;"	f	class:google::protobuf::internal::MethodClosure1
-MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure1 : public Closure {$/;"	c	namespace:google::protobuf::internal
-MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^  MethodClosure2(Class* object, MethodType method, bool self_deleting,$/;"	f	class:google::protobuf::internal::MethodClosure2
-MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^class MethodClosure2 : public Closure {$/;"	c	namespace:google::protobuf::internal
-MethodDescriptor	deps/include/google/protobuf/descriptor.h	/^  MethodDescriptor() {}$/;"	f	class:google::protobuf::MethodDescriptor
-MethodDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT MethodDescriptor {$/;"	c	namespace:google::protobuf
-MethodDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MethodDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-MethodOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT MethodOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)();$/;"	t	class:google::protobuf::internal::MethodClosure0
-MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)(Arg1 arg1);$/;"	t	class:google::protobuf::internal::MethodClosure1
-MethodType	deps/include/google/protobuf/stubs/common.h	/^  typedef void (Class::*MethodType)(Arg1 arg1, Arg2 arg2);$/;"	t	class:google::protobuf::internal::MethodClosure2
-Mode	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum Mode {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
-Monitoring	src/resender.h	/^  void Monitoring() {$/;"	f	class:ps::Resender
-MoveArray	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::MoveArray($/;"	f	class:google::protobuf::RepeatedField
-MultiFileErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  inline MultiFileErrorCollector() {}$/;"	f	class:google::protobuf::compiler::MultiFileErrorCollector
-MultiFileErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT MultiFileErrorCollector {$/;"	c	namespace:google::protobuf::compiler
-Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Mutable(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
-Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Mutable(int number, int index, ExtensionSet* set) {$/;"	f	class:google::protobuf::internal::RepeatedMessageTypeTraits
-Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline string* Mutable(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::StringTypeTraits
-Mutable	deps/include/google/protobuf/extension_set.h	/^  static inline string* Mutable(int number, int index, ExtensionSet* set) {$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
-Mutable	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::Mutable(int index) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Mutable	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::Mutable(int index) {$/;"	f	class:google::protobuf::RepeatedField
-Mutable	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::Mutable(int index) {$/;"	f	class:google::protobuf::RepeatedPtrField
-MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<Message>* Reflection::MutableRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
-MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<PB>* Reflection::MutableRepeatedPtrField($/;"	f	class:google::protobuf::Reflection
-MutableRepeatedPtrField	deps/include/google/protobuf/message.h	/^inline RepeatedPtrField<string>* Reflection::MutableRepeatedPtrField<string>($/;"	f	class:google::protobuf::Reflection
-MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef Type* MutableType;$/;"	t	class:google::protobuf::internal::MessageTypeTraits
-MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef Type* MutableType;$/;"	t	class:google::protobuf::internal::RepeatedMessageTypeTraits
-MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef string* MutableType;$/;"	t	class:google::protobuf::internal::RepeatedStringTypeTraits
-MutableType	deps/include/google/protobuf/extension_set.h	/^  typedef string* MutableType;$/;"	t	class:google::protobuf::internal::StringTypeTraits
-Mutex	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT Mutex {$/;"	c	namespace:google::protobuf::internal
-MutexLock	deps/include/google/protobuf/stubs/common.h	/^  explicit MutexLock(Mutex *mu) : mu_(mu) { this->mu_->Lock(); }$/;"	f	class:google::protobuf::internal::MutexLock
-MutexLock	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT MutexLock {$/;"	c	namespace:google::protobuf::internal
-MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^  explicit MutexLockMaybe(Mutex *mu) :$/;"	f	class:google::protobuf::internal::MutexLockMaybe
-MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^class LIBPROTOBUF_EXPORT MutexLockMaybe {$/;"	c	namespace:google::protobuf::internal
-MyRank	include/ps/ps.h	/^inline int MyRank() { return Postoffice::Get()->my_rank(); }$/;"	f	namespace:ps
-NAME	deps/include/google/protobuf/descriptor.h	/^      NAME,              \/\/ the symbol name, or the package name for files$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-NO_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    NO_COMMENT$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
-NO_MAPPING	deps/include/google/protobuf/compiler/importer.h	/^    NO_MAPPING$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
-NUMBER	deps/include/google/protobuf/descriptor.h	/^      NUMBER,            \/\/ field or extension range number$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-NamePart	deps/include/google/protobuf/descriptor.pb.h	/^  typedef UninterpretedOption_NamePart NamePart;$/;"	t	class:google::protobuf::UninterpretedOption
-NestedMap	deps/include/google/protobuf/text_format.h	/^    typedef map<const FieldDescriptor*, vector<ParseInfoTree*> > NestedMap;$/;"	t	class:google::protobuf::TextFormat::ParseInfoTree
-New	deps/include/google/protobuf/repeated_field.h	/^  static GenericType* New() { return new GenericType; }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-New	src/meta.pb.cc	/^PBControl* PBControl::New() const {$/;"	f	class:ps::PBControl
-New	src/meta.pb.cc	/^PBMeta* PBMeta::New() const {$/;"	f	class:ps::PBMeta
-New	src/meta.pb.cc	/^PBNode* PBNode::New() const {$/;"	f	class:ps::PBNode
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)()) {$/;"	f	namespace:google::protobuf
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1),$/;"	f	namespace:google::protobuf
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(Class* object, void (Class::*method)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)()) {$/;"	f	namespace:google::protobuf
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)(Arg1),$/;"	f	namespace:google::protobuf
-NewCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewCallback(void (*function)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback($/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(Class* object, void (Class::*method)()) {$/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(Class* object, void (Class::*method)(Arg1),$/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)()) {$/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)(Arg1),$/;"	f	namespace:google::protobuf
-NewPermanentCallback	deps/include/google/protobuf/stubs/common.h	/^inline Closure* NewPermanentCallback(void (*function)(Arg1, Arg2),$/;"	f	namespace:google::protobuf
-NewRequest	src/customer.cc	/^int Customer::NewRequest(int recver) {$/;"	f	class:ps::Customer
-NextCommentStatus	deps/include/google/protobuf/io/tokenizer.h	/^  enum NextCommentStatus {$/;"	g	class:google::protobuf::io::Tokenizer
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_AtomicExchange(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_AtomicExchange(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicExchange	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_AtomicExchange(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_AtomicIncrement(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 NoBarrier_AtomicIncrement(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_AtomicIncrement	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 NoBarrier_AtomicIncrement(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord NoBarrier_Load(volatile const AtomicWord *ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 NoBarrier_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 NoBarrier_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void NoBarrier_Store(volatile AtomicWord *ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void NoBarrier_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-NoBarrier_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void NoBarrier_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Node	include/ps/internal/message.h	/^  Node() : id(kEmpty), port(kEmpty), is_recovery(false) {}$/;"	f	struct:ps::Node
-Node	include/ps/internal/message.h	/^struct Node {$/;"	s	namespace:ps
-Now	src/resender.h	/^  Time Now() {$/;"	f	class:ps::Resender
-NumResponse	src/customer.cc	/^int Customer::NumResponse(int timestamp) {$/;"	f	class:ps::Customer
-NumServers	include/ps/ps.h	/^inline int NumServers() { return Postoffice::Get()->num_servers(); }$/;"	f	namespace:ps
-NumWorkers	include/ps/ps.h	/^inline int NumWorkers() { return Postoffice::Get()->num_workers(); }$/;"	f	namespace:ps
-OBJS	Makefile	/^OBJS = $(addprefix build\/, customer.o postoffice.o van.o meta.pb.o)$/;"	m
-OPTION_ASSIGNMENT	deps/include/google/protobuf/compiler/parser.h	/^    OPTION_ASSIGNMENT,  \/\/ just "name = value"$/;"	e	enum:google::protobuf::compiler::Parser::OptionStyle
-OPTION_NAME	deps/include/google/protobuf/descriptor.h	/^      OPTION_NAME,       \/\/ name in assignment$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-OPTION_STATEMENT	deps/include/google/protobuf/compiler/parser.h	/^    OPTION_STATEMENT    \/\/ "option name = value;"$/;"	e	enum:google::protobuf::compiler::Parser::OptionStyle
-OPTION_VALUE	deps/include/google/protobuf/descriptor.h	/^      OPTION_VALUE,      \/\/ value in option assignment$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-OR	include/ps/internal/assign_op.h	/^  OR,      \/\/ a |= b$/;"	e	enum:ps::AssignOp
-OTHER	deps/include/google/protobuf/descriptor.h	/^      OTHER              \/\/ some other problem$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-OTHER	include/ps/internal/message.h	/^  FLOAT, DOUBLE, OTHER$/;"	e	enum:ps::DataType
-OUTPUT_TYPE	deps/include/google/protobuf/descriptor.h	/^      OUTPUT_TYPE,       \/\/ method output type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-Operation	deps/include/google/protobuf/wire_format.h	/^  enum Operation {$/;"	g	class:google::protobuf::internal::WireFormat
-OptimizeMode	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FileOptions_OptimizeMode OptimizeMode;$/;"	t	class:google::protobuf::FileOptions
-OptimizeMode_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int OptimizeMode_ARRAYSIZE =$/;"	m	class:google::protobuf::FileOptions
-OptimizeMode_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool OptimizeMode_IsValid(int value) {$/;"	f	class:google::protobuf::FileOptions
-OptimizeMode_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode OptimizeMode_MAX =$/;"	m	class:google::protobuf::FileOptions
-OptimizeMode_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode OptimizeMode_MIN =$/;"	m	class:google::protobuf::FileOptions
-OptimizeMode_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& OptimizeMode_Name(OptimizeMode value) {$/;"	f	class:google::protobuf::FileOptions
-OptimizeMode_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool OptimizeMode_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FileOptions
-OptimizeMode_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  OptimizeMode_descriptor() {$/;"	f	class:google::protobuf::FileOptions
-OptionStyle	deps/include/google/protobuf/compiler/parser.h	/^  enum OptionStyle {$/;"	g	class:google::protobuf::compiler::Parser
-Options	deps/include/google/protobuf/io/gzip_stream.h	/^  struct LIBPROTOBUF_EXPORT Options {$/;"	s	class:google::protobuf::io::GzipOutputStream
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef EnumOptions OptionsType;$/;"	t	class:google::protobuf::EnumDescriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef EnumValueOptions OptionsType;$/;"	t	class:google::protobuf::EnumValueDescriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef FieldOptions OptionsType;$/;"	t	class:google::protobuf::FieldDescriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef FileOptions OptionsType;$/;"	t	class:google::protobuf::FileDescriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef MessageOptions OptionsType;$/;"	t	class:google::protobuf::Descriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef MethodOptions OptionsType;$/;"	t	class:google::protobuf::MethodDescriptor
-OptionsType	deps/include/google/protobuf/descriptor.h	/^  typedef ServiceOptions OptionsType;$/;"	t	class:google::protobuf::ServiceDescriptor
-OstreamOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^class LIBPROTOBUF_EXPORT OstreamOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-OutputDirective	deps/include/google/protobuf/compiler/command_line_interface.h	/^  struct OutputDirective {$/;"	s	class:google::protobuf::compiler::CommandLineInterface
-OutputDirectory	deps/include/google/protobuf/compiler/code_generator.h	/^typedef GeneratorContext OutputDirectory;$/;"	t	namespace:google::protobuf::compiler
-PAPER	docs/Makefile	/^PAPER         =$/;"	m
-PAPEROPT_a4	docs/Makefile	/^PAPEROPT_a4     = -D latex_paper_size=a4$/;"	m
-PAPEROPT_letter	docs/Makefile	/^PAPEROPT_letter = -D latex_paper_size=letter$/;"	m
-PARSE	deps/include/google/protobuf/wire_format.h	/^    PARSE,$/;"	e	enum:google::protobuf::internal::WireFormat::Operation
-PARSE_ARGUMENT_DONE_AND_CONTINUE	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_DONE_AND_CONTINUE,$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
-PARSE_ARGUMENT_DONE_AND_EXIT	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_DONE_AND_EXIT,$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
-PARSE_ARGUMENT_FAIL	deps/include/google/protobuf/compiler/command_line_interface.h	/^    PARSE_ARGUMENT_FAIL$/;"	e	enum:google::protobuf::compiler::CommandLineInterface::ParseArgumentStatus
-PBControl	src/meta.pb.cc	/^PBControl::PBControl()$/;"	f	class:ps::PBControl
-PBControl	src/meta.pb.cc	/^PBControl::PBControl(const PBControl& from)$/;"	f	class:ps::PBControl
-PBMeta	src/meta.pb.cc	/^PBMeta::PBMeta()$/;"	f	class:ps::PBMeta
-PBMeta	src/meta.pb.cc	/^PBMeta::PBMeta(const PBMeta& from)$/;"	f	class:ps::PBMeta
-PBNode	src/meta.pb.cc	/^PBNode::PBNode()$/;"	f	class:ps::PBNode
-PBNode	src/meta.pb.cc	/^PBNode::PBNode(const PBNode& from)$/;"	f	class:ps::PBNode
-PLUS	include/ps/internal/assign_op.h	/^  PLUS,    \/\/ a += b$/;"	e	enum:ps::AssignOp
-PROTOBUF	make/deps.mk	/^PROTOBUF = ${DEPS_PATH}\/include\/google\/protobuf\/message.h$/;"	m
-PROTOBUF_DEFINE_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_ACCESSOR(/;"	d
-PROTOBUF_DEFINE_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_ACCESSOR$/;"	d
-PROTOBUF_DEFINE_ARRAY_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_ARRAY_ACCESSOR(/;"	d
-PROTOBUF_DEFINE_ARRAY_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_ARRAY_ACCESSOR$/;"	d
-PROTOBUF_DEFINE_OPTIONS_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_OPTIONS_ACCESSOR(/;"	d
-PROTOBUF_DEFINE_PRIMITIVE_TYPE	deps/include/google/protobuf/extension_set.h	/^#define PROTOBUF_DEFINE_PRIMITIVE_TYPE(/;"	d
-PROTOBUF_DEFINE_PRIMITIVE_TYPE	deps/include/google/protobuf/extension_set.h	/^#undef PROTOBUF_DEFINE_PRIMITIVE_TYPE$/;"	d
-PROTOBUF_DEFINE_STRING_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#define PROTOBUF_DEFINE_STRING_ACCESSOR(/;"	d
-PROTOBUF_DEFINE_STRING_ACCESSOR	deps/include/google/protobuf/descriptor.h	/^#undef PROTOBUF_DEFINE_STRING_ACCESSOR$/;"	d
-PROTOBUF_DEPRECATED	deps/include/google/protobuf/generated_message_util.h	/^#define PROTOBUF_DEPRECATED$/;"	d
-PROTOBUF_LITTLE_ENDIAN	deps/include/google/protobuf/io/coded_stream.h	/^    #define PROTOBUF_LITTLE_ENDIAN /;"	d
-PROTOBUF_USE_EXCEPTIONS	deps/include/google/protobuf/stubs/common.h	/^  #define PROTOBUF_USE_EXCEPTIONS /;"	d
-PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED	deps/include/google/protobuf/compiler/plugin.pb.h	/^#define PROTOBUF_google_2fprotobuf_2fcompiler_2fplugin_2eproto__INCLUDED$/;"	d
-PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED	deps/include/google/protobuf/descriptor.pb.h	/^#define PROTOBUF_google_2fprotobuf_2fdescriptor_2eproto__INCLUDED$/;"	d
-PROTOC	Makefile	/^PROTOC = ${DEPS_PATH}\/bin\/protoc$/;"	m
-PSTracker	tracker/tracker.py	/^class PSTracker:$/;"	c
-PS_BASE_H_	include/ps/base.h	/^#define PS_BASE_H_$/;"	d
-PS_INTERNAL_ASSIGN_OP_H_	include/ps/internal/assign_op.h	/^#define PS_INTERNAL_ASSIGN_OP_H_$/;"	d
-PS_INTERNAL_CUSTOMER_H_	include/ps/internal/customer.h	/^#define PS_INTERNAL_CUSTOMER_H_$/;"	d
-PS_INTERNAL_ENV_H_	include/ps/internal/env.h	/^#define PS_INTERNAL_ENV_H_$/;"	d
-PS_INTERNAL_MESSAGE_H_	include/ps/internal/message.h	/^#define PS_INTERNAL_MESSAGE_H_$/;"	d
-PS_INTERNAL_PARALLEL_KV_MATCH_H_	include/ps/internal/parallel_kv_match.h	/^#define PS_INTERNAL_PARALLEL_KV_MATCH_H_$/;"	d
-PS_INTERNAL_PARALLEL_SORT_H_	include/ps/internal/parallel_sort.h	/^#define PS_INTERNAL_PARALLEL_SORT_H_$/;"	d
-PS_INTERNAL_POSTOFFICE_H_	include/ps/internal/postoffice.h	/^#define PS_INTERNAL_POSTOFFICE_H_$/;"	d
-PS_INTERNAL_THREADSAFE_QUEUE_H_	include/ps/internal/threadsafe_queue.h	/^#define PS_INTERNAL_THREADSAFE_QUEUE_H_$/;"	d
-PS_INTERNAL_UTILS_H_	include/ps/internal/utils.h	/^#define PS_INTERNAL_UTILS_H_$/;"	d
-PS_INTERNAL_VAN_H_	include/ps/internal/van.h	/^#define PS_INTERNAL_VAN_H_$/;"	d
-PS_KV_APP_H_	include/ps/kv_app.h	/^#define PS_KV_APP_H_$/;"	d
-PS_LDFLAGS_A	make/ps.mk	/^PS_LDFLAGS_A = $(addprefix $(DEPS_PATH)\/lib\/, libprotobuf-lite.a libzmq.a)$/;"	m
-PS_LDFLAGS_SO	make/ps.mk	/^PS_LDFLAGS_SO = -L$(DEPS_PATH)\/lib -lprotobuf-lite -lzmq$/;"	m
-PS_NETWORK_UTILS_H_	src/network_utils.h	/^#define PS_NETWORK_UTILS_H_$/;"	d
-PS_PS_H_	include/ps/ps.h	/^#define PS_PS_H_$/;"	d
-PS_RANGE_H_	include/ps/range.h	/^#define PS_RANGE_H_$/;"	d
-PS_RESENDER_H_	src/resender.h	/^#define PS_RESENDER_H_$/;"	d
-PS_SARRAY_H_	include/ps/sarray.h	/^#define PS_SARRAY_H_$/;"	d
-PS_SIMPLE_APP_H_	include/ps/simple_app.h	/^#define PS_SIMPLE_APP_H_$/;"	d
-PS_VLOG	include/ps/internal/postoffice.h	/^#define PS_VLOG(/;"	d
-PS_WINDOWS_UNISTD_H_	src/windows/unistd.h	/^#define PS_WINDOWS_UNISTD_H_$/;"	d
-PS_ZMQ_VAN_H_	src/zmq_van.h	/^#define PS_ZMQ_VAN_H_$/;"	d
-PYTHON_SUFFIX	tests/lint.py	/^PYTHON_SUFFIX = set(['py'])$/;"	v
-PackMeta	src/van.cc	/^void Van::PackMeta(const Meta& meta, char** meta_buf, int* buf_size) {$/;"	f	class:ps::Van
-ParallelOrderedMatch	include/ps/internal/parallel_kv_match.h	/^size_t ParallelOrderedMatch($/;"	f	namespace:ps
-ParallelOrderedMatch	include/ps/internal/parallel_kv_match.h	/^void ParallelOrderedMatch($/;"	f	namespace:ps::__anon6
-ParallelSort	include/ps/internal/parallel_sort.h	/^void ParallelSort(SArray<T>* arr,$/;"	f	namespace:ps
-ParallelSort	include/ps/internal/parallel_sort.h	/^void ParallelSort(T* data, size_t len, size_t grainsize, const Fn& cmp) {$/;"	f	namespace:ps::__anon7
-ParseArgumentStatus	deps/include/google/protobuf/compiler/command_line_interface.h	/^  enum ParseArgumentStatus {$/;"	g	class:google::protobuf::compiler::CommandLineInterface
-ParseFromString	deps/include/google/protobuf/unknown_field_set.h	/^  inline bool ParseFromString(const string& data) {$/;"	f	class:google::protobuf::UnknownFieldSet
-ParseInfoTree	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT ParseInfoTree {$/;"	c	class:google::protobuf::TextFormat
-ParseLocation	deps/include/google/protobuf/text_format.h	/^    ParseLocation() : line(-1), column(-1) {}$/;"	f	struct:google::protobuf::TextFormat::ParseLocation
-ParseLocation	deps/include/google/protobuf/text_format.h	/^    ParseLocation(int line_param, int column_param)$/;"	f	struct:google::protobuf::TextFormat::ParseLocation
-ParseLocation	deps/include/google/protobuf/text_format.h	/^  struct ParseLocation {$/;"	s	class:google::protobuf::TextFormat
-ParseNamedEnum	deps/include/google/protobuf/generated_enum_reflection.h	/^bool ParseNamedEnum(const EnumDescriptor* descriptor,$/;"	f	namespace:google::protobuf::internal
-ParseString	deps/include/google/protobuf/io/tokenizer.h	/^inline void Tokenizer::ParseString(const string& text, string* output) {$/;"	f	class:google::protobuf::io::Tokenizer
-Parser	deps/include/google/protobuf/compiler/parser.h	/^class LIBPROTOBUF_EXPORT Parser {$/;"	c	namespace:google::protobuf::compiler
-Parser	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Parser {$/;"	c	class:google::protobuf::TextFormat
-Postoffice	include/ps/internal/postoffice.h	/^class Postoffice {$/;"	c	namespace:ps
-Postoffice	src/postoffice.cc	/^Postoffice::Postoffice() {$/;"	f	class:ps::Postoffice
-PrimitiveTypeTraits	deps/include/google/protobuf/extension_set.h	/^class PrimitiveTypeTraits {$/;"	c	namespace:google::protobuf::internal
-Printer	deps/include/google/protobuf/io/printer.h	/^class LIBPROTOBUF_EXPORT Printer {$/;"	c	namespace:google::protobuf::io
-Printer	deps/include/google/protobuf/text_format.h	/^  class LIBPROTOBUF_EXPORT Printer {$/;"	c	class:google::protobuf::TextFormat
-Process	include/ps/kv_app.h	/^void KVServer<Val>::Process(const Message& msg) {$/;"	f	class:ps::KVServer
-Process	include/ps/kv_app.h	/^void KVWorker<Val>::Process(const Message& msg) {$/;"	f	class:ps::KVWorker
-Process	include/ps/simple_app.h	/^inline void SimpleApp::Process(const Message& msg) {$/;"	f	class:ps::SimpleApp
-ProtobufOnceType	deps/include/google/protobuf/stubs/once.h	/^typedef bool ProtobufOnceType;$/;"	t	namespace:google::protobuf
-Pull	include/ps/kv_app.h	/^  int Pull(const std::vector<Key>& keys,$/;"	f	class:ps::KVWorker
-Pull_	include/ps/kv_app.h	/^int KVWorker<Val>::Pull_($/;"	f	class:ps::KVWorker
-Push	include/ps/internal/threadsafe_queue.h	/^  void Push(T new_value) {$/;"	f	class:ps::ThreadsafeQueue
-Push	include/ps/kv_app.h	/^  int Push(const std::vector<Key>& keys,$/;"	f	class:ps::KVWorker
-QNXCmpxchg	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 QNXCmpxchg(Atomic32 old_value,$/;"	f	namespace:google::protobuf::internal
-READ_REPEATED_FIXED_SIZE_PRIMITIVE	deps/include/google/protobuf/wire_format_lite_inl.h	/^#define READ_REPEATED_FIXED_SIZE_PRIMITIVE(/;"	d
-READ_REPEATED_FIXED_SIZE_PRIMITIVE	deps/include/google/protobuf/wire_format_lite_inl.h	/^#undef READ_REPEATED_FIXED_SIZE_PRIMITIVE$/;"	d
-R_OK	src/windows/unistd.h	/^#define R_OK /;"	d
-RabitTracker	tracker/tracker.py	/^class RabitTracker:$/;"	c
-Range	include/ps/range.h	/^  Range() : Range(0, 0) {}$/;"	f	class:ps::Range
-Range	include/ps/range.h	/^  Range(uint64_t begin, uint64_t end) : begin_(begin), end_(end) { }$/;"	f	class:ps::Range
-Range	include/ps/range.h	/^class Range {$/;"	c	namespace:ps
-ReadGroup	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadGroup(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadGroupNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadGroupNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadLittleEndian32	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadLittleEndian32(uint32* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
-ReadLittleEndian32FromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ReadLittleEndian32FromArray($/;"	f	class:google::protobuf::io::CodedInputStream
-ReadLittleEndian64	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadLittleEndian64(uint64* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
-ReadLittleEndian64FromArray	deps/include/google/protobuf/io/coded_stream.h	/^inline const uint8* CodedInputStream::ReadLittleEndian64FromArray($/;"	f	class:google::protobuf::io::CodedInputStream
-ReadMessage	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadMessage(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadMessageNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadMessageNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPackedPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPackedPrimitive(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPackedPrimitiveNoInline	deps/include/google/protobuf/wire_format_lite_inl.h	/^bool WireFormatLite::ReadPackedPrimitiveNoInline(io::CodedInputStream* input,$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<bool, WireFormatLite::TYPE_BOOL>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<double, WireFormatLite::TYPE_DOUBLE>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<float, WireFormatLite::TYPE_FLOAT>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int, WireFormatLite::TYPE_ENUM>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_INT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SFIXED32>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int32, WireFormatLite::TYPE_SINT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_INT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SFIXED64>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<int64, WireFormatLite::TYPE_SINT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_FIXED32>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint32, WireFormatLite::TYPE_UINT32>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_FIXED64>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadPrimitive<uint64, WireFormatLite::TYPE_UINT64>($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadPrimitiveFromArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline const uint8* WireFormatLite::ReadPrimitiveFromArray<$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadRepeatedFixedSizePrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadRepeatedFixedSizePrimitive($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadRepeatedPrimitive	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline bool WireFormatLite::ReadRepeatedPrimitive(int, \/\/ tag_size, unused.$/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadRepeatedPrimitiveNoInline	deps/include/google/protobuf/wire_format_lite_inl.h	/^bool WireFormatLite::ReadRepeatedPrimitiveNoInline($/;"	f	class:google::protobuf::internal::WireFormatLite
-ReadTag	deps/include/google/protobuf/io/coded_stream.h	/^inline uint32 CodedInputStream::ReadTag() {$/;"	f	class:google::protobuf::io::CodedInputStream
-ReadVarint32	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadVarint32(uint32* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
-ReadVarint64	deps/include/google/protobuf/io/coded_stream.h	/^inline bool CodedInputStream::ReadVarint64(uint64* value) {$/;"	f	class:google::protobuf::io::CodedInputStream
-ReaderMutexLock	deps/include/google/protobuf/stubs/common.h	/^typedef MutexLock ReaderMutexLock;$/;"	t	namespace:google::protobuf::internal
-Receiving	src/customer.cc	/^void Customer::Receiving() {$/;"	f	class:ps::Customer
-Receiving	src/van.cc	/^void Van::Receiving() {$/;"	f	class:ps::Van
-RecordErrorsTo	deps/include/google/protobuf/compiler/importer.h	/^  void RecordErrorsTo(MultiFileErrorCollector* error_collector) {$/;"	f	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-RecordErrorsTo	deps/include/google/protobuf/compiler/parser.h	/^  void RecordErrorsTo(io::ErrorCollector* error_collector) {$/;"	f	class:google::protobuf::compiler::Parser
-RecordErrorsTo	deps/include/google/protobuf/text_format.h	/^    void RecordErrorsTo(io::ErrorCollector* error_collector) {$/;"	f	class:google::protobuf::TextFormat::Parser
-RecordLocation	deps/include/google/protobuf/text_format.h	/^inline void TextFormat::RecordLocation(ParseInfoTree* info_tree,$/;"	f	class:google::protobuf::TextFormat
-RecordSourceLocationsTo	deps/include/google/protobuf/compiler/parser.h	/^  void RecordSourceLocationsTo(SourceLocationTable* location_table) {$/;"	f	class:google::protobuf::compiler::Parser
-Reflection	deps/include/google/protobuf/message.h	/^  inline Reflection() {}$/;"	f	class:google::protobuf::Reflection
-Reflection	deps/include/google/protobuf/message.h	/^  typedef google::protobuf::Reflection Reflection;$/;"	t	class:google::protobuf::Message
-Reflection	deps/include/google/protobuf/message.h	/^class LIBPROTOBUF_EXPORT Reflection {$/;"	c	namespace:google::protobuf
-ReflectionOps	deps/include/google/protobuf/reflection_ops.h	/^class LIBPROTOBUF_EXPORT ReflectionOps {$/;"	c	namespace:google::protobuf::internal
-RegisterExitCallback	include/ps/internal/postoffice.h	/^  void RegisterExitCallback(const Callback& cb) {$/;"	f	class:ps::Postoffice
-RegisterExitCallback	include/ps/ps.h	/^inline void RegisterExitCallback(const std::function<void()>& cb) {$/;"	f	namespace:ps
-Release	deps/include/google/protobuf/extension_set.h	/^  static inline MutableType Release(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
-ReleaseCleared	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::ReleaseCleared() {$/;"	f	class:google::protobuf::RepeatedPtrField
-ReleaseCleared	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseCleared() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-ReleaseLast	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedPtrField<Element>::ReleaseLast() {$/;"	f	class:google::protobuf::RepeatedPtrField
-ReleaseLast	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type* RepeatedPtrFieldBase::ReleaseLast() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Release_CompareAndSwap(volatile AtomicWord* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Release_CompareAndSwap(volatile Atomic32* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_CompareAndSwap	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Release_CompareAndSwap(volatile Atomic64* ptr,$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline AtomicWord Release_Load(volatile const AtomicWord* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic32 Release_Load(volatile const Atomic32* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Load	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline Atomic64 Release_Load(volatile const Atomic64* ptr) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^inline void Release_Store(volatile AtomicWord* ptr, AtomicWord value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Release_Store(volatile Atomic32* ptr, Atomic32 value) {$/;"	f	namespace:google::protobuf::internal
-Release_Store	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^inline void Release_Store(volatile Atomic64* ptr, Atomic64 value) {$/;"	f	namespace:google::protobuf::internal
-RemoveCustomer	src/postoffice.cc	/^void Postoffice::RemoveCustomer(Customer* customer) {$/;"	f	class:ps::Postoffice
-RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::RemoveLast() {$/;"	f	class:google::protobuf::RepeatedField
-RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::RemoveLast() {$/;"	f	class:google::protobuf::RepeatedPtrField
-RemoveLast	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::RemoveLast() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-RepeatedEnumTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedEnumTypeTraits {$/;"	c	namespace:google::protobuf::internal
-RepeatedField	deps/include/google/protobuf/repeated_field.h	/^class RepeatedField {$/;"	c	namespace:google::protobuf
-RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField()$/;"	f	class:google::protobuf::RepeatedField
-RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField(Iter begin, const Iter& end)$/;"	f	class:google::protobuf::RepeatedField
-RepeatedField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedField<Element>::RepeatedField(const RepeatedField& other)$/;"	f	class:google::protobuf::RepeatedField
-RepeatedFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-RepeatedFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class RepeatedFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
-RepeatedFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedFieldBackInserter(RepeatedField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
-RepeatedFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
-RepeatedMessageTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedMessageTypeTraits {$/;"	c	namespace:google::protobuf::internal
-RepeatedPrimitiveTypeTraits	deps/include/google/protobuf/extension_set.h	/^class RepeatedPrimitiveTypeTraits {$/;"	c	namespace:google::protobuf::internal
-RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField : public internal::RepeatedPtrFieldBase {$/;"	c	namespace:google::protobuf
-RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>::RepeatedPtrField($/;"	f	class:google::protobuf::RepeatedPtrField
-RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>::RepeatedPtrField() {}$/;"	f	class:google::protobuf::RepeatedPtrField
-RepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-RepeatedPtrFieldBackInsertIterator	deps/include/google/protobuf/repeated_field.h	/^template<typename T> class RepeatedPtrFieldBackInsertIterator$/;"	c	namespace:google::protobuf::internal
-RepeatedPtrFieldBackInserter	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBackInserter(RepeatedPtrField<T>* const mutable_field) {$/;"	f	namespace:google::protobuf
-RepeatedPtrFieldBase	deps/include/google/protobuf/repeated_field.h	/^class LIBPROTOBUF_EXPORT RepeatedPtrFieldBase {$/;"	c	namespace:google::protobuf::internal
-RepeatedPtrFieldBase	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrFieldBase::RepeatedPtrFieldBase()$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrIterator() : it_(NULL) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrIterator(const RepeatedPtrIterator<OtherElement>& other)$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedPtrIterator(void* const* it) : it_(it) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-RepeatedPtrIterator	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrIterator$/;"	c	namespace:google::protobuf::internal
-RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrOverPtrsIterator() : it_(NULL) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^  explicit RepeatedPtrOverPtrsIterator(VoidPtr* it) : it_(it) {}$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-RepeatedPtrOverPtrsIterator	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrOverPtrsIterator$/;"	c	namespace:google::protobuf::internal
-RepeatedStringTypeTraits	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT RepeatedStringTypeTraits {$/;"	c	namespace:google::protobuf::internal
-ReqHandle	tests/test_simple_app.cc	/^void ReqHandle(const SimpleData& req, SimpleApp* app) {$/;"	f
-Request	include/ps/simple_app.h	/^inline int SimpleApp::Request(int req_head, const std::string& req_body, int recv_id) {$/;"	f	class:ps::SimpleApp
-Resender	src/resender.h	/^  Resender(int timeout, int max_num_retry, Van* van) {$/;"	f	class:ps::Resender
-Resender	src/resender.h	/^class Resender {$/;"	c	namespace:ps
-Reserve	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrField<Element>::Reserve(int new_size) {$/;"	f	class:google::protobuf::RepeatedPtrField
-Reserve	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::Reserve(int new_size) {$/;"	f	class:google::protobuf::RepeatedField
-Response	include/ps/kv_app.h	/^void KVServer<Val>::Response(const KVMeta& req, const KVPairs<Val>& res) {$/;"	f	class:ps::KVServer
-Response	include/ps/simple_app.h	/^inline void SimpleApp::Response(const SimpleData& req, const std::string& res_body) {$/;"	f	class:ps::SimpleApp
-Role	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	g	struct:ps::Node
-RpcChannel	deps/include/google/protobuf/service.h	/^  inline RpcChannel() {}$/;"	f	class:google::protobuf::RpcChannel
-RpcChannel	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT RpcChannel {$/;"	c	namespace:google::protobuf
-RpcController	deps/include/google/protobuf/service.h	/^  inline RpcController() {}$/;"	f	class:google::protobuf::RpcController
-RpcController	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT RpcController {$/;"	c	namespace:google::protobuf
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure0
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure1
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::FunctionClosure2
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure0
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure1
-Run	deps/include/google/protobuf/stubs/common.h	/^  void Run() {$/;"	f	class:google::protobuf::internal::MethodClosure2
-RunCallback	include/ps/kv_app.h	/^void KVWorker<Val>::RunCallback(int timestamp) {$/;"	f	class:ps::KVWorker
-RunWorker	tests/test_kv_app.cc	/^void RunWorker() {$/;"	f
-SArray	include/ps/sarray.h	/^  SArray() { }$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  SArray(V* data, size_t size, bool deletable = false) {$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  explicit SArray(const SArray<W>& arr) { *this = arr; }$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  explicit SArray(const std::shared_ptr<std::vector<V>>& vec) {$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  explicit SArray(const std::vector<V>& vec) { CopyFrom(vec.data(), vec.size()); }$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  explicit SArray(size_t size, V val = 0) { resize(size, val); }$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^  template <typename W> SArray(const std::initializer_list<W>& list) {$/;"	f	class:ps::SArray
-SArray	include/ps/sarray.h	/^class SArray {$/;"	c	namespace:ps
-SCHEDULER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
-SERIALIZE	deps/include/google/protobuf/wire_format.h	/^    SERIALIZE,$/;"	e	enum:google::protobuf::internal::WireFormat::Operation
-SERVER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
-SHADOWED	deps/include/google/protobuf/compiler/importer.h	/^    SHADOWED,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
-SH_COMMENT_STYLE	deps/include/google/protobuf/io/tokenizer.h	/^    SH_COMMENT_STYLE$/;"	e	enum:google::protobuf::io::Tokenizer::CommentStyle
-SInt32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::SInt32Size(int32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-SInt64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::SInt64Size(int64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-SLASH_NOT_COMMENT	deps/include/google/protobuf/io/tokenizer.h	/^    SLASH_NOT_COMMENT,$/;"	e	enum:google::protobuf::io::Tokenizer::NextCommentStatus
-SPEED	deps/include/google/protobuf/descriptor.pb.h	/^  static const OptimizeMode SPEED = FileOptions_OptimizeMode_SPEED;$/;"	m	class:google::protobuf::FileOptions
-SPHINXBUILD	docs/Makefile	/^SPHINXBUILD   = sphinx-build$/;"	m
-SPHINXOPTS	docs/Makefile	/^SPHINXOPTS    =$/;"	m
-SSHLauncher	tracker/dmlc_ssh.py	/^class SSHLauncher(object):$/;"	c
-STDERR_FILENO	src/windows/unistd.h	/^#define STDERR_FILENO /;"	d
-STDIN_FILENO	src/windows/unistd.h	/^#define STDIN_FILENO /;"	d
-STDOUT_FILENO	src/windows/unistd.h	/^#define STDOUT_FILENO /;"	d
-STRING	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType STRING = FieldOptions_CType_STRING;$/;"	m	class:google::protobuf::FieldOptions
-STRING_PIECE	deps/include/google/protobuf/descriptor.pb.h	/^  static const CType STRING_PIECE = FieldOptions_CType_STRING_PIECE;$/;"	m	class:google::protobuf::FieldOptions
-STUB_DOESNT_OWN_CHANNEL	deps/include/google/protobuf/service.h	/^    STUB_DOESNT_OWN_CHANNEL$/;"	e	enum:google::protobuf::Service::ChannelOwnership
-STUB_OWNS_CHANNEL	deps/include/google/protobuf/service.h	/^    STUB_OWNS_CHANNEL,$/;"	e	enum:google::protobuf::Service::ChannelOwnership
-SUCCESS	deps/include/google/protobuf/compiler/importer.h	/^    SUCCESS,$/;"	e	enum:google::protobuf::compiler::DiskSourceTree::DiskFileToVirtualFileResult
-SameType	include/ps/internal/message.h	/^inline bool SameType() {$/;"	f	namespace:ps
-Send	include/ps/kv_app.h	/^void KVWorker<Val>::Send(int timestamp, bool push, int cmd, const KVPairs<Val>& kvs) {$/;"	f	class:ps::KVWorker
-Send	src/van.cc	/^int Van::Send(const Message& msg) {$/;"	f	class:ps::Van
-SerializeWithCachedSizes	src/meta.pb.cc	/^void PBControl::SerializeWithCachedSizes($/;"	f	class:ps::PBControl
-SerializeWithCachedSizes	src/meta.pb.cc	/^void PBMeta::SerializeWithCachedSizes($/;"	f	class:ps::PBMeta
-SerializeWithCachedSizes	src/meta.pb.cc	/^void PBNode::SerializeWithCachedSizes($/;"	f	class:ps::PBNode
-ServerRankToID	include/ps/internal/postoffice.h	/^  static inline int ServerRankToID(int rank) {$/;"	f	class:ps::Postoffice
-Service	deps/include/google/protobuf/service.h	/^  inline Service() {}$/;"	f	class:google::protobuf::Service
-Service	deps/include/google/protobuf/service.h	/^class LIBPROTOBUF_EXPORT Service {$/;"	c	namespace:google::protobuf
-ServiceDescriptor	deps/include/google/protobuf/descriptor.h	/^  ServiceDescriptor() {}$/;"	f	class:google::protobuf::ServiceDescriptor
-ServiceDescriptor	deps/include/google/protobuf/descriptor.h	/^class LIBPROTOBUF_EXPORT ServiceDescriptor {$/;"	c	namespace:google::protobuf
-ServiceDescriptorProto	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT ServiceDescriptorProto : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-ServiceOptions	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT ServiceOptions : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::EnumTypeTraits
-Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::StringTypeTraits
-Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, int index,$/;"	f	class:google::protobuf::internal::RepeatedEnumTypeTraits
-Set	deps/include/google/protobuf/extension_set.h	/^  static inline void Set(int number, int index,$/;"	f	class:google::protobuf::internal::RepeatedStringTypeTraits
-Set	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Set(int index, const Element& value) {$/;"	f	class:google::protobuf::RepeatedField
-SetAllocated	deps/include/google/protobuf/extension_set.h	/^  static inline void SetAllocated(int number, FieldType field_type,$/;"	f	class:google::protobuf::internal::MessageTypeTraits
-SetCachedSize	src/meta.pb.cc	/^void PBControl::SetCachedSize(int size) const {$/;"	f	class:ps::PBControl
-SetCachedSize	src/meta.pb.cc	/^void PBMeta::SetCachedSize(int size) const {$/;"	f	class:ps::PBMeta
-SetCachedSize	src/meta.pb.cc	/^void PBNode::SetCachedSize(int size) const {$/;"	f	class:ps::PBNode
-SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }$/;"	f	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    void SetCloseOnDelete(bool value) { close_on_delete_ = value; }$/;"	f	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  void SetCloseOnDelete(bool value) { copying_input_.SetCloseOnDelete(value); }$/;"	f	class:google::protobuf::io::FileInputStream
-SetCloseOnDelete	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  void SetCloseOnDelete(bool value) { copying_output_.SetCloseOnDelete(value); }$/;"	f	class:google::protobuf::io::FileOutputStream
-SetDelegateToGeneratedFactory	deps/include/google/protobuf/dynamic_message.h	/^  void SetDelegateToGeneratedFactory(bool enable) {$/;"	f	class:google::protobuf::DynamicMessageFactory
-SetExtensionRegistry	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::SetExtensionRegistry(const DescriptorPool* pool,$/;"	f	class:google::protobuf::io::CodedInputStream
-SetFinder	deps/include/google/protobuf/text_format.h	/^    void SetFinder(Finder* finder) {$/;"	f	class:google::protobuf::TextFormat::Parser
-SetInitialIndentLevel	deps/include/google/protobuf/text_format.h	/^    void SetInitialIndentLevel(int indent_level) {$/;"	f	class:google::protobuf::TextFormat::Printer
-SetInputsAreProtoPathRelative	deps/include/google/protobuf/compiler/command_line_interface.h	/^  void SetInputsAreProtoPathRelative(bool enable) {$/;"	f	class:google::protobuf::compiler::CommandLineInterface
-SetOwnsCopyingStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }$/;"	f	class:google::protobuf::io::CopyingInputStreamAdaptor
-SetOwnsCopyingStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  void SetOwnsCopyingStream(bool value) { owns_copying_stream_ = value; }$/;"	f	class:google::protobuf::io::CopyingOutputStreamAdaptor
-SetRecursionLimit	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedInputStream::SetRecursionLimit(int limit) {$/;"	f	class:google::protobuf::io::CodedInputStream
-SetRepeatedString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::SetRepeatedString(int number, int index,$/;"	f	class:google::protobuf::internal::ExtensionSet
-SetRequireSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  void SetRequireSyntaxIdentifier(bool value) {$/;"	f	class:google::protobuf::compiler::Parser
-SetSingleLineMode	deps/include/google/protobuf/text_format.h	/^    void SetSingleLineMode(bool single_line_mode) {$/;"	f	class:google::protobuf::TextFormat::Printer
-SetStopAfterSyntaxIdentifier	deps/include/google/protobuf/compiler/parser.h	/^  void SetStopAfterSyntaxIdentifier(bool value) {$/;"	f	class:google::protobuf::compiler::Parser
-SetString	deps/include/google/protobuf/extension_set.h	/^inline void ExtensionSet::SetString(int number, FieldType type,$/;"	f	class:google::protobuf::internal::ExtensionSet
-SetUseShortRepeatedPrimitives	deps/include/google/protobuf/text_format.h	/^    void SetUseShortRepeatedPrimitives(bool use_short_repeated_primitives) {$/;"	f	class:google::protobuf::TextFormat::Printer
-SetUseUtf8StringEscaping	deps/include/google/protobuf/text_format.h	/^    void SetUseUtf8StringEscaping(bool as_utf8) {$/;"	f	class:google::protobuf::TextFormat::Printer
-SetVersionInfo	deps/include/google/protobuf/compiler/command_line_interface.h	/^  void SetVersionInfo(const string& text) {$/;"	f	class:google::protobuf::compiler::CommandLineInterface
-SharedCtor	src/meta.pb.cc	/^void PBControl::SharedCtor() {$/;"	f	class:ps::PBControl
-SharedCtor	src/meta.pb.cc	/^void PBMeta::SharedCtor() {$/;"	f	class:ps::PBMeta
-SharedCtor	src/meta.pb.cc	/^void PBNode::SharedCtor() {$/;"	f	class:ps::PBNode
-SharedDtor	src/meta.pb.cc	/^void PBControl::SharedDtor() {$/;"	f	class:ps::PBControl
-SharedDtor	src/meta.pb.cc	/^void PBMeta::SharedDtor() {$/;"	f	class:ps::PBMeta
-SharedDtor	src/meta.pb.cc	/^void PBNode::SharedDtor() {$/;"	f	class:ps::PBNode
-ShortDebugString	include/ps/internal/message.h	/^  std::string ShortDebugString() const {$/;"	f	struct:ps::Node
-SimpleApp	include/ps/simple_app.h	/^  inline SimpleApp() : obj_(nullptr) {$/;"	f	class:ps::SimpleApp
-SimpleApp	include/ps/simple_app.h	/^class SimpleApp {$/;"	c	namespace:ps
-SimpleApp	include/ps/simple_app.h	/^inline SimpleApp::SimpleApp(int app_id) : SimpleApp() {$/;"	f	class:ps::SimpleApp
-SimpleData	include/ps/simple_app.h	/^struct SimpleData {$/;"	s	namespace:ps
-SimpleDescriptorDatabase	deps/include/google/protobuf/descriptor_database.h	/^class LIBPROTOBUF_EXPORT SimpleDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf
-SlaveEntry	tracker/tracker.py	/^class SlaveEntry:$/;"	c
-SourceCodeInfo	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT SourceCodeInfo : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-SourceCodeInfo_Location	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT SourceCodeInfo_Location : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-SourceLocation	deps/include/google/protobuf/descriptor.h	/^struct SourceLocation {$/;"	s	namespace:google::protobuf
-SourceLocationTable	deps/include/google/protobuf/compiler/parser.h	/^class LIBPROTOBUF_EXPORT SourceLocationTable {$/;"	c	namespace:google::protobuf::compiler
-SourceTree	deps/include/google/protobuf/compiler/importer.h	/^  inline SourceTree() {}$/;"	f	class:google::protobuf::compiler::SourceTree
-SourceTree	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT SourceTree {$/;"	c	namespace:google::protobuf::compiler
-SourceTreeDescriptorDatabase	deps/include/google/protobuf/compiler/importer.h	/^class LIBPROTOBUF_EXPORT SourceTreeDescriptorDatabase : public DescriptorDatabase {$/;"	c	namespace:google::protobuf::compiler
-SpaceUsed	deps/include/google/protobuf/repeated_field.h	/^  static int SpaceUsed(const GenericType& value) { return value.SpaceUsed(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-SpaceUsed	deps/include/google/protobuf/repeated_field.h	/^  static int SpaceUsed(const string& value)  {$/;"	f	class:google::protobuf::internal::StringTypeHandler
-SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::RepeatedField
-SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-SpaceUsedExcludingSelf	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::SpaceUsedExcludingSelf() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-Start	include/ps/ps.h	/^inline void Start(const char* argv0 = nullptr) {$/;"	f	namespace:ps
-Start	src/postoffice.cc	/^void Postoffice::Start(const char* argv0, const bool do_barrier) {$/;"	f	class:ps::Postoffice
-Start	src/van.cc	/^void Van::Start() {$/;"	f	class:ps::Van
-StartAsync	include/ps/ps.h	/^inline void StartAsync(const char* argv0 = nullptr) {$/;"	f	namespace:ps
-StartServer	tests/test_kv_app.cc	/^void StartServer() {$/;"	f
-StaticDescriptorInitializer_meta_2eproto	src/meta.pb.cc	/^  StaticDescriptorInitializer_meta_2eproto() {$/;"	f	struct:ps::StaticDescriptorInitializer_meta_2eproto
-StaticDescriptorInitializer_meta_2eproto	src/meta.pb.cc	/^struct StaticDescriptorInitializer_meta_2eproto {$/;"	s	namespace:ps	file:
-StaticVarintSize32	deps/include/google/protobuf/io/coded_stream.h	/^  struct StaticVarintSize32 {$/;"	s	class:google::protobuf::io::CodedOutputStream
-Stop	src/van.cc	/^void Van::Stop() {$/;"	f	class:ps::Van
-StringOutputStream	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^class LIBPROTOBUF_EXPORT StringOutputStream : public ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-StringSize	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::StringSize(const string& value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-StringTypeHandler	deps/include/google/protobuf/repeated_field.h	/^class StringTypeHandler : public StringTypeHandlerBase {$/;"	c	namespace:google::protobuf::internal
-StringTypeHandlerBase	deps/include/google/protobuf/repeated_field.h	/^class LIBPROTOBUF_EXPORT StringTypeHandlerBase {$/;"	c	namespace:google::protobuf::internal
-StringTypeTraits	deps/include/google/protobuf/extension_set.h	/^class LIBPROTOBUF_EXPORT StringTypeTraits {$/;"	c	namespace:google::protobuf::internal
-Swap	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::Swap(RepeatedField* other) {$/;"	f	class:google::protobuf::RepeatedField
-Swap	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrField<Element>::Swap(RepeatedPtrField* other) {$/;"	f	class:google::protobuf::RepeatedPtrField
-Swap	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownFieldSet::Swap(UnknownFieldSet* x) {$/;"	f	class:google::protobuf::UnknownFieldSet
-Swap	src/meta.pb.cc	/^void PBControl::Swap(PBControl* other) {$/;"	f	class:ps::PBControl
-Swap	src/meta.pb.cc	/^void PBMeta::Swap(PBMeta* other) {$/;"	f	class:ps::PBMeta
-Swap	src/meta.pb.cc	/^void PBNode::Swap(PBNode* other) {$/;"	f	class:ps::PBNode
-SwapElements	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedPtrFieldBase::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-SwapElements	deps/include/google/protobuf/repeated_field.h	/^void RepeatedField<Element>::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::RepeatedField
-SwapElements	deps/include/google/protobuf/repeated_field.h	/^void RepeatedPtrField<Element>::SwapElements(int index1, int index2) {$/;"	f	class:google::protobuf::RepeatedPtrField
-TERMINATE	include/ps/internal/message.h	/^  enum Command { EMPTY, TERMINATE, ADD_NODE, BARRIER, ACK, HEARTBEAT };$/;"	e	enum:ps::Control::Command
-TEST	tests/test.mk	/^TEST = $(patsubst tests\/test_%.cc, tests\/test_%, $(TEST_SRC))$/;"	m
-TEST_SRC	tests/test.mk	/^TEST_SRC = $(wildcard tests\/test_*.cc)$/;"	m
-TIMES	include/ps/internal/assign_op.h	/^  TIMES,   \/\/ a *= b$/;"	e	enum:ps::AssignOp
-TYPE	deps/include/google/protobuf/descriptor.h	/^      TYPE,              \/\/ field type$/;"	e	enum:google::protobuf::DescriptorPool::ErrorCollector::ErrorLocation
-TYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^    TYPE_BOOL           = 8,   \/\/ bool, varint on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_BOOL	deps/include/google/protobuf/descriptor.h	/^#undef TYPE_BOOL$/;"	d
-TYPE_BOOL	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_BOOL = FieldDescriptorProto_Type_TYPE_BOOL;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_BOOL	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_BOOL           = 8,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_BYTES	deps/include/google/protobuf/descriptor.h	/^    TYPE_BYTES          = 12,  \/\/ Arbitrary byte array.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_BYTES	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_BYTES = FieldDescriptorProto_Type_TYPE_BYTES;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_BYTES	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_BYTES          = 12,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_DOUBLE	deps/include/google/protobuf/descriptor.h	/^    TYPE_DOUBLE         = 1,   \/\/ double, exactly eight bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_DOUBLE	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_DOUBLE = FieldDescriptorProto_Type_TYPE_DOUBLE;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_DOUBLE	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_DOUBLE         = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_END	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_END,         \/\/ End of input reached.  "text" is empty.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_ENUM	deps/include/google/protobuf/descriptor.h	/^    TYPE_ENUM           = 14,  \/\/ Enum, varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_ENUM	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_ENUM = FieldDescriptorProto_Type_TYPE_ENUM;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_ENUM	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_ENUM           = 14,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_FIXED32	deps/include/google/protobuf/descriptor.h	/^    TYPE_FIXED32        = 7,   \/\/ uint32, exactly four bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_FIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FIXED32 = FieldDescriptorProto_Type_TYPE_FIXED32;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_FIXED32	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_FIXED32,$/;"	e	enum:google::protobuf::UnknownField::Type
-TYPE_FIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FIXED32        = 7,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_FIXED64	deps/include/google/protobuf/descriptor.h	/^    TYPE_FIXED64        = 6,   \/\/ uint64, exactly eight bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_FIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FIXED64 = FieldDescriptorProto_Type_TYPE_FIXED64;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_FIXED64	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_FIXED64,$/;"	e	enum:google::protobuf::UnknownField::Type
-TYPE_FIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FIXED64        = 6,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_FLOAT	deps/include/google/protobuf/descriptor.h	/^    TYPE_FLOAT          = 2,   \/\/ float, exactly four bytes on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_FLOAT	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_FLOAT = FieldDescriptorProto_Type_TYPE_FLOAT;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_FLOAT	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_FLOAT,       \/\/ A floating point literal, with a fractional part and\/or$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_FLOAT	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_FLOAT          = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_GROUP	deps/include/google/protobuf/descriptor.h	/^    TYPE_GROUP          = 10,  \/\/ Tag-delimited message.  Deprecated.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_GROUP	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_GROUP = FieldDescriptorProto_Type_TYPE_GROUP;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_GROUP	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_GROUP$/;"	e	enum:google::protobuf::UnknownField::Type
-TYPE_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_GROUP          = 10,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_IDENTIFIER	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_IDENTIFIER,  \/\/ A sequence of letters, digits, and underscores, not$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_INT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_INT32          = 5,   \/\/ int32, varint on the wire.  Negative numbers$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_INT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_INT32 = FieldDescriptorProto_Type_TYPE_INT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_INT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_INT32          = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_INT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_INT64          = 3,   \/\/ int64, varint on the wire.  Negative numbers$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_INT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_INT64 = FieldDescriptorProto_Type_TYPE_INT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_INT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_INT64          = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_INTEGER	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_INTEGER,     \/\/ A sequence of digits representing an integer.  Normally$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_LENGTH_DELIMITED	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_LENGTH_DELIMITED,$/;"	e	enum:google::protobuf::UnknownField::Type
-TYPE_MESSAGE	deps/include/google/protobuf/descriptor.h	/^    TYPE_MESSAGE        = 11,  \/\/ Length-delimited message.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_MESSAGE	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_MESSAGE = FieldDescriptorProto_Type_TYPE_MESSAGE;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_MESSAGE	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_MESSAGE        = 11,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_SFIXED32	deps/include/google/protobuf/descriptor.h	/^    TYPE_SFIXED32       = 15,  \/\/ int32, exactly four bytes on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_SFIXED32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SFIXED32 = FieldDescriptorProto_Type_TYPE_SFIXED32;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_SFIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SFIXED32       = 15,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_SFIXED64	deps/include/google/protobuf/descriptor.h	/^    TYPE_SFIXED64       = 16,  \/\/ int64, exactly eight bytes on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_SFIXED64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SFIXED64 = FieldDescriptorProto_Type_TYPE_SFIXED64;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_SFIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SFIXED64       = 16,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_SINT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_SINT32         = 17,  \/\/ int32, ZigZag-encoded varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_SINT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SINT32 = FieldDescriptorProto_Type_TYPE_SINT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_SINT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SINT32         = 17,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_SINT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_SINT64         = 18,  \/\/ int64, ZigZag-encoded varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_SINT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_SINT64 = FieldDescriptorProto_Type_TYPE_SINT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_SINT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_SINT64         = 18,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_START	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_START,       \/\/ Next() has not yet been called.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_STRING	deps/include/google/protobuf/descriptor.h	/^    TYPE_STRING         = 9,   \/\/ UTF-8 text.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_STRING	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_STRING = FieldDescriptorProto_Type_TYPE_STRING;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_STRING	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_STRING,      \/\/ A quoted sequence of escaped characters.  Either single$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_STRING	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_STRING         = 9,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_SYMBOL	deps/include/google/protobuf/io/tokenizer.h	/^    TYPE_SYMBOL,      \/\/ Any other printable character, like '!' or '+'.$/;"	e	enum:google::protobuf::io::Tokenizer::TokenType
-TYPE_UINT32	deps/include/google/protobuf/descriptor.h	/^    TYPE_UINT32         = 13,  \/\/ uint32, varint on the wire$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_UINT32	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_UINT32 = FieldDescriptorProto_Type_TYPE_UINT32;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_UINT32	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_UINT32         = 13,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_UINT64	deps/include/google/protobuf/descriptor.h	/^    TYPE_UINT64         = 4,   \/\/ uint64, varint on the wire.$/;"	e	enum:google::protobuf::FieldDescriptor::Type
-TYPE_UINT64	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type TYPE_UINT64 = FieldDescriptorProto_Type_TYPE_UINT64;$/;"	m	class:google::protobuf::FieldDescriptorProto
-TYPE_UINT64	deps/include/google/protobuf/wire_format_lite.h	/^    TYPE_UINT64         = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::FieldType
-TYPE_VARINT	deps/include/google/protobuf/unknown_field_set.h	/^    TYPE_VARINT,$/;"	e	enum:google::protobuf::UnknownField::Type
-TagSize	deps/include/google/protobuf/wire_format.h	/^inline int WireFormat::TagSize(int field_number, FieldDescriptor::Type type) {$/;"	f	class:google::protobuf::internal::WireFormat
-TagSize	deps/include/google/protobuf/wire_format_lite.h	/^inline int WireFormatLite::TagSize(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-TextFormat	deps/include/google/protobuf/text_format.h	/^class LIBPROTOBUF_EXPORT TextFormat {$/;"	c	namespace:google::protobuf
-Thread	tracker/dmlc_local.py	/^from threading import Thread$/;"	i
-Thread	tracker/dmlc_mpi.py	/^from threading import Thread$/;"	i
-Thread	tracker/dmlc_ssh.py	/^from threading import Thread$/;"	i
-Thread	tracker/tracker.py	/^from threading import Thread$/;"	i
-ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^  ThreadsafeQueue() { }$/;"	f	class:ps::ThreadsafeQueue
-ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^template<typename T> class ThreadsafeQueue {$/;"	c	namespace:ps
-Token	deps/include/google/protobuf/io/tokenizer.h	/^  struct Token {$/;"	s	class:google::protobuf::io::Tokenizer
-TokenType	deps/include/google/protobuf/io/tokenizer.h	/^  enum TokenType {$/;"	g	class:google::protobuf::io::Tokenizer
-Tokenizer	deps/include/google/protobuf/io/tokenizer.h	/^class LIBPROTOBUF_EXPORT Tokenizer {$/;"	c	namespace:google::protobuf::io
-Truncate	deps/include/google/protobuf/repeated_field.h	/^inline void RepeatedField<Element>::Truncate(int new_size) {$/;"	f	class:google::protobuf::RepeatedField
-Type	deps/include/google/protobuf/descriptor.h	/^  enum Type {$/;"	g	class:google::protobuf::FieldDescriptor
-Type	deps/include/google/protobuf/descriptor.pb.h	/^  typedef FieldDescriptorProto_Type Type;$/;"	t	class:google::protobuf::FieldDescriptorProto
-Type	deps/include/google/protobuf/repeated_field.h	/^  typedef GenericType Type;$/;"	t	class:google::protobuf::internal::GenericTypeHandler
-Type	deps/include/google/protobuf/repeated_field.h	/^  typedef string Type;$/;"	t	class:google::protobuf::internal::StringTypeHandlerBase
-Type	deps/include/google/protobuf/unknown_field_set.h	/^  enum Type {$/;"	g	class:google::protobuf::UnknownField
-TypeHandler	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField<Element>::TypeHandler$/;"	c	class:google::protobuf::RepeatedPtrField
-TypeHandler	deps/include/google/protobuf/repeated_field.h	/^class RepeatedPtrField<string>::TypeHandler$/;"	c	class:google::protobuf::RepeatedPtrField
-TypeToCppType	deps/include/google/protobuf/descriptor.h	/^inline FieldDescriptor::CppType FieldDescriptor::TypeToCppType(Type type) {$/;"	f	class:google::protobuf::FieldDescriptor
-TypeTraits	deps/include/google/protobuf/extension_set.h	/^  typedef TypeTraitsType TypeTraits;$/;"	t	class:google::protobuf::internal::ExtensionIdentifier
-Type_ARRAYSIZE	deps/include/google/protobuf/descriptor.pb.h	/^  static const int Type_ARRAYSIZE =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Type_IsValid	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Type_IsValid(int value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-Type_MAX	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type Type_MAX =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Type_MIN	deps/include/google/protobuf/descriptor.pb.h	/^  static const Type Type_MIN =$/;"	m	class:google::protobuf::FieldDescriptorProto
-Type_Name	deps/include/google/protobuf/descriptor.pb.h	/^  static inline const ::std::string& Type_Name(Type value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-Type_Parse	deps/include/google/protobuf/descriptor.pb.h	/^  static inline bool Type_Parse(const ::std::string& name,$/;"	f	class:google::protobuf::FieldDescriptorProto
-Type_descriptor	deps/include/google/protobuf/descriptor.pb.h	/^  Type_descriptor() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-UINT16	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
-UINT32	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
-UINT64	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
-UINT8	include/ps/internal/message.h	/^  UINT8, UINT16, UINT32, UINT64,$/;"	e	enum:ps::DataType
-UInt32Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::UInt32Size(uint32 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-UInt64Size	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline int WireFormatLite::UInt64Size(uint64 value) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-URL	make/deps.mk	/^URL=https:\/\/raw.githubusercontent.com\/mli\/deps\/master\/build$/;"	m
-UninterpretedOption	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT UninterpretedOption : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-UninterpretedOption_NamePart	deps/include/google/protobuf/descriptor.pb.h	/^class LIBPROTOBUF_EXPORT UninterpretedOption_NamePart : public ::google::protobuf::Message {$/;"	c	namespace:google::protobuf
-UnknownField	deps/include/google/protobuf/unknown_field_set.h	/^class LIBPROTOBUF_EXPORT UnknownField {$/;"	c	namespace:google::protobuf
-UnknownFieldSet	deps/include/google/protobuf/unknown_field_set.h	/^class LIBPROTOBUF_EXPORT UnknownFieldSet {$/;"	c	namespace:google::protobuf
-UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^  UnknownFieldSetFieldSkipper(UnknownFieldSet* unknown_fields)$/;"	f	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
-UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^class LIBPROTOBUF_EXPORT UnknownFieldSetFieldSkipper : public FieldSkipper {$/;"	c	namespace:google::protobuf::internal
-UnpackMeta	src/van.cc	/^void Van::UnpackMeta(const char* meta_buf, int buf_size, Meta* meta) {$/;"	f	class:ps::Van
-UpdateHeartbeat	include/ps/internal/postoffice.h	/^  void UpdateHeartbeat(int node_id, time_t t) {$/;"	f	class:ps::Postoffice
-ValidationErrorCollector	deps/include/google/protobuf/compiler/importer.h	/^  class LIBPROTOBUF_EXPORT ValidationErrorCollector : public DescriptorPool::ErrorCollector {$/;"	c	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-Van	include/ps/internal/van.h	/^  Van() { }$/;"	f	class:ps::Van
-Van	include/ps/internal/van.h	/^class Van {$/;"	c	namespace:ps
-VarintSize32	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::VarintSize32(uint32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-VarintSize32SignExtended	deps/include/google/protobuf/io/coded_stream.h	/^inline int CodedOutputStream::VarintSize32SignExtended(int32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-VerifyUTF8String	deps/include/google/protobuf/wire_format.h	/^inline void WireFormat::VerifyUTF8String(const char* data, int size,$/;"	f	class:google::protobuf::internal::WireFormat
-WGET	make/deps.mk	/^WGET = wget$/;"	m
-WIRETYPE_END_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_END_GROUP        = 4,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WIRETYPE_FIXED32	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_FIXED32          = 5,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WIRETYPE_FIXED64	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_FIXED64          = 1,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WIRETYPE_LENGTH_DELIMITED	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_LENGTH_DELIMITED = 2,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WIRETYPE_START_GROUP	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_START_GROUP      = 3,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WIRETYPE_VARINT	deps/include/google/protobuf/wire_format_lite.h	/^    WIRETYPE_VARINT           = 0,$/;"	e	enum:google::protobuf::internal::WireFormatLite::WireType
-WORKER	include/ps/internal/message.h	/^  enum Role { SERVER, WORKER, SCHEDULER };$/;"	e	enum:ps::Node::Role
-W_OK	src/windows/unistd.h	/^#define W_OK /;"	d
-Wait	include/ps/kv_app.h	/^  void Wait(int timestamp) { obj_->WaitRequest(timestamp); }$/;"	f	class:ps::KVWorker
-Wait	include/ps/simple_app.h	/^  virtual inline void Wait(int timestamp) { obj_->WaitRequest(timestamp); }$/;"	f	class:ps::SimpleApp
-WaitAndPop	include/ps/internal/threadsafe_queue.h	/^  void WaitAndPop(T* value) {$/;"	f	class:ps::ThreadsafeQueue
-WaitRequest	src/customer.cc	/^void Customer::WaitRequest(int timestamp) {$/;"	f	class:ps::Customer
-WireFormat	deps/include/google/protobuf/wire_format.h	/^class LIBPROTOBUF_EXPORT WireFormat {$/;"	c	namespace:google::protobuf::internal
-WireFormatLite	deps/include/google/protobuf/wire_format_lite.h	/^class LIBPROTOBUF_EXPORT WireFormatLite {$/;"	c	namespace:google::protobuf::internal
-WireType	deps/include/google/protobuf/wire_format_lite.h	/^  enum WireType {$/;"	g	class:google::protobuf::internal::WireFormatLite
-WireTypeForField	deps/include/google/protobuf/wire_format.h	/^inline WireFormatLite::WireType WireFormat::WireTypeForField($/;"	f	class:google::protobuf::internal::WireFormat
-WireTypeForFieldType	deps/include/google/protobuf/wire_format.h	/^inline WireFormatLite::WireType WireFormat::WireTypeForFieldType($/;"	f	class:google::protobuf::internal::WireFormat
-WireTypeForFieldType	deps/include/google/protobuf/wire_format_lite.h	/^  static inline WireFormatLite::WireType WireTypeForFieldType($/;"	f	class:google::protobuf::internal::WireFormatLite
-WorkerRankToID	include/ps/internal/postoffice.h	/^  static inline int WorkerRankToID(int rank) {$/;"	f	class:ps::Postoffice
-WriteBoolNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteBoolNoTag(bool value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteBoolNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBoolNoTagToArray(bool value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteBoolToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBoolToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteBytesToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteBytesToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteDoubleNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteDoubleNoTag(double value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteDoubleNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteDoubleNoTagToArray(double value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteDoubleToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteDoubleToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteEnumNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteEnumNoTag(int value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteEnumNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteEnumNoTagToArray(int value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteEnumToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteEnumToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFixed32NoTag(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed32NoTagToArray(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFixed64NoTag(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed64NoTagToArray(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFixed64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFixed64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFloatNoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteFloatNoTag(float value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFloatNoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFloatNoTagToArray(float value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteFloatToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteFloatToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteGroupNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteGroupNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteGroupNoVirtualToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteGroupNoVirtualToArray($/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteGroupToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteGroupToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteInt32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteInt64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteLittleEndian32ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteLittleEndian32ToArray(uint32 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteLittleEndian64ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteLittleEndian64ToArray(uint64 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteLocationsTo	deps/include/google/protobuf/text_format.h	/^    void WriteLocationsTo(ParseInfoTree* tree) {$/;"	f	class:google::protobuf::TextFormat::Parser
-WriteMessageNoVirtual	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteMessageNoVirtual($/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteMessageNoVirtualToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteMessageNoVirtualToArray($/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteMessageToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteMessageToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSFixed32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSFixed64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSFixed64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSFixed64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSInt32NoTag(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt32NoTagToArray(int32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteSInt64NoTag(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt64NoTagToArray(int64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteSInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteSInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteString	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteString(const string& str) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteStringToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteStringToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteStringToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteStringToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteTag	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteTag(uint32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteTag(int field_number, WireType type,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteTagToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteTagToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteTagToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt32NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteUInt32NoTag(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt32NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt32NoTagToArray(uint32 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt32ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt32ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt64NoTag	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline void WireFormatLite::WriteUInt64NoTag(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt64NoTagToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt64NoTagToArray(uint64 value,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteUInt64ToArray	deps/include/google/protobuf/wire_format_lite_inl.h	/^inline uint8* WireFormatLite::WriteUInt64ToArray(int field_number,$/;"	f	class:google::protobuf::internal::WireFormatLite
-WriteVarint32SignExtended	deps/include/google/protobuf/io/coded_stream.h	/^inline void CodedOutputStream::WriteVarint32SignExtended(int32 value) {$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteVarint32SignExtendedToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteVarint32SignExtendedToArray($/;"	f	class:google::protobuf::io::CodedOutputStream
-WriteVarint32ToArray	deps/include/google/protobuf/io/coded_stream.h	/^inline uint8* CodedOutputStream::WriteVarint32ToArray(uint32 value,$/;"	f	class:google::protobuf::io::CodedOutputStream
-WriterMutexLock	deps/include/google/protobuf/stubs/common.h	/^typedef MutexLock WriterMutexLock;$/;"	t	namespace:google::protobuf::internal
-XOR	include/ps/internal/assign_op.h	/^  XOR      \/\/ a ^= b$/;"	e	enum:ps::AssignOp
-ZLIB	deps/include/google/protobuf/io/gzip_stream.h	/^    ZLIB = 2,$/;"	e	enum:google::protobuf::io::GzipInputStream::Format
-ZLIB	deps/include/google/protobuf/io/gzip_stream.h	/^    ZLIB = 2,$/;"	e	enum:google::protobuf::io::GzipOutputStream::Format
-ZMQ	make/deps.mk	/^ZMQ = ${DEPS_PATH}\/include\/zmq.h$/;"	m
-ZMQVan	src/zmq_van.h	/^  ZMQVan() { }$/;"	f	class:ps::ZMQVan
-ZMQVan	src/zmq_van.h	/^class ZMQVan : public Van {$/;"	c	namespace:ps
-ZMQ_AFFINITY	deps/include/zmq.h	/^#define ZMQ_AFFINITY /;"	d
-ZMQ_BACKLOG	deps/include/zmq.h	/^#define ZMQ_BACKLOG /;"	d
-ZMQ_CONFLATE	deps/include/zmq.h	/^#define ZMQ_CONFLATE /;"	d
-ZMQ_CONNECT_RID	deps/include/zmq.h	/^#define ZMQ_CONNECT_RID /;"	d
-ZMQ_CURVE	deps/include/zmq.h	/^#define ZMQ_CURVE /;"	d
-ZMQ_CURVE_PUBLICKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_PUBLICKEY /;"	d
-ZMQ_CURVE_SECRETKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_SECRETKEY /;"	d
-ZMQ_CURVE_SERVER	deps/include/zmq.h	/^#define ZMQ_CURVE_SERVER /;"	d
-ZMQ_CURVE_SERVERKEY	deps/include/zmq.h	/^#define ZMQ_CURVE_SERVERKEY /;"	d
-ZMQ_DEALER	deps/include/zmq.h	/^#define ZMQ_DEALER /;"	d
-ZMQ_DEFINED_STDINT	deps/include/zmq.h	/^#define ZMQ_DEFINED_STDINT /;"	d
-ZMQ_DELAY_ATTACH_ON_CONNECT	deps/include/zmq.h	/^#define ZMQ_DELAY_ATTACH_ON_CONNECT /;"	d
-ZMQ_DONTWAIT	deps/include/zmq.h	/^#define ZMQ_DONTWAIT /;"	d
-ZMQ_EVENTS	deps/include/zmq.h	/^#define ZMQ_EVENTS /;"	d
-ZMQ_EVENT_ACCEPTED	deps/include/zmq.h	/^#define ZMQ_EVENT_ACCEPTED /;"	d
-ZMQ_EVENT_ACCEPT_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_ACCEPT_FAILED /;"	d
-ZMQ_EVENT_ALL	deps/include/zmq.h	/^#define ZMQ_EVENT_ALL /;"	d
-ZMQ_EVENT_BIND_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_BIND_FAILED /;"	d
-ZMQ_EVENT_CLOSED	deps/include/zmq.h	/^#define ZMQ_EVENT_CLOSED /;"	d
-ZMQ_EVENT_CLOSE_FAILED	deps/include/zmq.h	/^#define ZMQ_EVENT_CLOSE_FAILED /;"	d
-ZMQ_EVENT_CONNECTED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECTED /;"	d
-ZMQ_EVENT_CONNECT_DELAYED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECT_DELAYED /;"	d
-ZMQ_EVENT_CONNECT_RETRIED	deps/include/zmq.h	/^#define ZMQ_EVENT_CONNECT_RETRIED /;"	d
-ZMQ_EVENT_DISCONNECTED	deps/include/zmq.h	/^#define ZMQ_EVENT_DISCONNECTED /;"	d
-ZMQ_EVENT_LISTENING	deps/include/zmq.h	/^#define ZMQ_EVENT_LISTENING /;"	d
-ZMQ_EVENT_MONITOR_STOPPED	deps/include/zmq.h	/^#define ZMQ_EVENT_MONITOR_STOPPED /;"	d
-ZMQ_EXPORT	deps/include/zmq.h	/^#       define ZMQ_EXPORT /;"	d
-ZMQ_EXPORT	deps/include/zmq.h	/^#       define ZMQ_EXPORT$/;"	d
-ZMQ_EXPORT	deps/include/zmq.h	/^#undef ZMQ_EXPORT$/;"	d
-ZMQ_FAIL_UNROUTABLE	deps/include/zmq.h	/^#define ZMQ_FAIL_UNROUTABLE /;"	d
-ZMQ_FD	deps/include/zmq.h	/^#define ZMQ_FD /;"	d
-ZMQ_FORWARDER	deps/include/zmq.h	/^#define ZMQ_FORWARDER /;"	d
-ZMQ_GSSAPI	deps/include/zmq.h	/^#define ZMQ_GSSAPI /;"	d
-ZMQ_GSSAPI_PLAINTEXT	deps/include/zmq.h	/^#define ZMQ_GSSAPI_PLAINTEXT /;"	d
-ZMQ_GSSAPI_PRINCIPAL	deps/include/zmq.h	/^#define ZMQ_GSSAPI_PRINCIPAL /;"	d
-ZMQ_GSSAPI_SERVER	deps/include/zmq.h	/^#define ZMQ_GSSAPI_SERVER /;"	d
-ZMQ_GSSAPI_SERVICE_PRINCIPAL	deps/include/zmq.h	/^#define ZMQ_GSSAPI_SERVICE_PRINCIPAL /;"	d
-ZMQ_HANDSHAKE_IVL	deps/include/zmq.h	/^#define ZMQ_HANDSHAKE_IVL /;"	d
-ZMQ_HAS_CAPABILITIES	deps/include/zmq.h	/^#define ZMQ_HAS_CAPABILITIES /;"	d
-ZMQ_HAUSNUMERO	deps/include/zmq.h	/^#define ZMQ_HAUSNUMERO /;"	d
-ZMQ_IDENTITY	deps/include/zmq.h	/^#define ZMQ_IDENTITY /;"	d
-ZMQ_IMMEDIATE	deps/include/zmq.h	/^#define ZMQ_IMMEDIATE /;"	d
-ZMQ_IO_THREADS	deps/include/zmq.h	/^#define ZMQ_IO_THREADS /;"	d
-ZMQ_IO_THREADS_DFLT	deps/include/zmq.h	/^#define ZMQ_IO_THREADS_DFLT /;"	d
-ZMQ_IPC_FILTER_GID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_GID /;"	d
-ZMQ_IPC_FILTER_PID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_PID /;"	d
-ZMQ_IPC_FILTER_UID	deps/include/zmq.h	/^#define ZMQ_IPC_FILTER_UID /;"	d
-ZMQ_IPV4ONLY	deps/include/zmq.h	/^#define ZMQ_IPV4ONLY /;"	d
-ZMQ_IPV6	deps/include/zmq.h	/^#define ZMQ_IPV6 /;"	d
-ZMQ_LAST_ENDPOINT	deps/include/zmq.h	/^#define ZMQ_LAST_ENDPOINT /;"	d
-ZMQ_LINGER	deps/include/zmq.h	/^#define ZMQ_LINGER /;"	d
-ZMQ_MAKE_VERSION	deps/include/zmq.h	/^#define ZMQ_MAKE_VERSION(/;"	d
-ZMQ_MAXMSGSIZE	deps/include/zmq.h	/^#define ZMQ_MAXMSGSIZE /;"	d
-ZMQ_MAX_SOCKETS	deps/include/zmq.h	/^#define ZMQ_MAX_SOCKETS /;"	d
-ZMQ_MAX_SOCKETS_DFLT	deps/include/zmq.h	/^#define ZMQ_MAX_SOCKETS_DFLT /;"	d
-ZMQ_MECHANISM	deps/include/zmq.h	/^#define ZMQ_MECHANISM /;"	d
-ZMQ_MORE	deps/include/zmq.h	/^#define ZMQ_MORE /;"	d
-ZMQ_MULTICAST_HOPS	deps/include/zmq.h	/^#define ZMQ_MULTICAST_HOPS /;"	d
-ZMQ_NOBLOCK	deps/include/zmq.h	/^#define ZMQ_NOBLOCK /;"	d
-ZMQ_NULL	deps/include/zmq.h	/^#define ZMQ_NULL /;"	d
-ZMQ_PAIR	deps/include/zmq.h	/^#define ZMQ_PAIR /;"	d
-ZMQ_PLAIN	deps/include/zmq.h	/^#define ZMQ_PLAIN /;"	d
-ZMQ_PLAIN_PASSWORD	deps/include/zmq.h	/^#define ZMQ_PLAIN_PASSWORD /;"	d
-ZMQ_PLAIN_SERVER	deps/include/zmq.h	/^#define ZMQ_PLAIN_SERVER /;"	d
-ZMQ_PLAIN_USERNAME	deps/include/zmq.h	/^#define ZMQ_PLAIN_USERNAME /;"	d
-ZMQ_POLLERR	deps/include/zmq.h	/^#define ZMQ_POLLERR /;"	d
-ZMQ_POLLIN	deps/include/zmq.h	/^#define ZMQ_POLLIN /;"	d
-ZMQ_POLLITEMS_DFLT	deps/include/zmq.h	/^#define ZMQ_POLLITEMS_DFLT /;"	d
-ZMQ_POLLOUT	deps/include/zmq.h	/^#define ZMQ_POLLOUT /;"	d
-ZMQ_PROBE_ROUTER	deps/include/zmq.h	/^#define ZMQ_PROBE_ROUTER /;"	d
-ZMQ_PUB	deps/include/zmq.h	/^#define ZMQ_PUB /;"	d
-ZMQ_PULL	deps/include/zmq.h	/^#define ZMQ_PULL /;"	d
-ZMQ_PUSH	deps/include/zmq.h	/^#define ZMQ_PUSH /;"	d
-ZMQ_QUEUE	deps/include/zmq.h	/^#define ZMQ_QUEUE /;"	d
-ZMQ_RATE	deps/include/zmq.h	/^#define ZMQ_RATE /;"	d
-ZMQ_RCVBUF	deps/include/zmq.h	/^#define ZMQ_RCVBUF /;"	d
-ZMQ_RCVHWM	deps/include/zmq.h	/^#define ZMQ_RCVHWM /;"	d
-ZMQ_RCVMORE	deps/include/zmq.h	/^#define ZMQ_RCVMORE /;"	d
-ZMQ_RCVTIMEO	deps/include/zmq.h	/^#define ZMQ_RCVTIMEO /;"	d
-ZMQ_RECONNECT_IVL	deps/include/zmq.h	/^#define ZMQ_RECONNECT_IVL /;"	d
-ZMQ_RECONNECT_IVL_MAX	deps/include/zmq.h	/^#define ZMQ_RECONNECT_IVL_MAX /;"	d
-ZMQ_RECOVERY_IVL	deps/include/zmq.h	/^#define ZMQ_RECOVERY_IVL /;"	d
-ZMQ_REP	deps/include/zmq.h	/^#define ZMQ_REP /;"	d
-ZMQ_REQ	deps/include/zmq.h	/^#define ZMQ_REQ /;"	d
-ZMQ_REQ_CORRELATE	deps/include/zmq.h	/^#define ZMQ_REQ_CORRELATE /;"	d
-ZMQ_REQ_RELAXED	deps/include/zmq.h	/^#define ZMQ_REQ_RELAXED /;"	d
-ZMQ_ROUTER	deps/include/zmq.h	/^#define ZMQ_ROUTER /;"	d
-ZMQ_ROUTER_BEHAVIOR	deps/include/zmq.h	/^#define ZMQ_ROUTER_BEHAVIOR /;"	d
-ZMQ_ROUTER_HANDOVER	deps/include/zmq.h	/^#define ZMQ_ROUTER_HANDOVER /;"	d
-ZMQ_ROUTER_MANDATORY	deps/include/zmq.h	/^#define ZMQ_ROUTER_MANDATORY /;"	d
-ZMQ_ROUTER_RAW	deps/include/zmq.h	/^#define ZMQ_ROUTER_RAW /;"	d
-ZMQ_SHARED	deps/include/zmq.h	/^#define ZMQ_SHARED /;"	d
-ZMQ_SNDBUF	deps/include/zmq.h	/^#define ZMQ_SNDBUF /;"	d
-ZMQ_SNDHWM	deps/include/zmq.h	/^#define ZMQ_SNDHWM /;"	d
-ZMQ_SNDMORE	deps/include/zmq.h	/^#define ZMQ_SNDMORE /;"	d
-ZMQ_SNDTIMEO	deps/include/zmq.h	/^#define ZMQ_SNDTIMEO /;"	d
-ZMQ_SOCKET_LIMIT	deps/include/zmq.h	/^#define ZMQ_SOCKET_LIMIT /;"	d
-ZMQ_SOCKS_PROXY	deps/include/zmq.h	/^#define ZMQ_SOCKS_PROXY /;"	d
-ZMQ_SRCFD	deps/include/zmq.h	/^#define ZMQ_SRCFD /;"	d
-ZMQ_STREAM	deps/include/zmq.h	/^#define ZMQ_STREAM /;"	d
-ZMQ_STREAMER	deps/include/zmq.h	/^#define ZMQ_STREAMER /;"	d
-ZMQ_SUB	deps/include/zmq.h	/^#define ZMQ_SUB /;"	d
-ZMQ_SUBSCRIBE	deps/include/zmq.h	/^#define ZMQ_SUBSCRIBE /;"	d
-ZMQ_TCP_ACCEPT_FILTER	deps/include/zmq.h	/^#define ZMQ_TCP_ACCEPT_FILTER /;"	d
-ZMQ_TCP_KEEPALIVE	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE /;"	d
-ZMQ_TCP_KEEPALIVE_CNT	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_CNT /;"	d
-ZMQ_TCP_KEEPALIVE_IDLE	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_IDLE /;"	d
-ZMQ_TCP_KEEPALIVE_INTVL	deps/include/zmq.h	/^#define ZMQ_TCP_KEEPALIVE_INTVL /;"	d
-ZMQ_THREAD_PRIORITY	deps/include/zmq.h	/^#define ZMQ_THREAD_PRIORITY /;"	d
-ZMQ_THREAD_PRIORITY_DFLT	deps/include/zmq.h	/^#define ZMQ_THREAD_PRIORITY_DFLT /;"	d
-ZMQ_THREAD_SCHED_POLICY	deps/include/zmq.h	/^#define ZMQ_THREAD_SCHED_POLICY /;"	d
-ZMQ_THREAD_SCHED_POLICY_DFLT	deps/include/zmq.h	/^#define ZMQ_THREAD_SCHED_POLICY_DFLT /;"	d
-ZMQ_TOS	deps/include/zmq.h	/^#define ZMQ_TOS /;"	d
-ZMQ_TYPE	deps/include/zmq.h	/^#define ZMQ_TYPE /;"	d
-ZMQ_UNSUBSCRIBE	deps/include/zmq.h	/^#define ZMQ_UNSUBSCRIBE /;"	d
-ZMQ_VERSION	deps/include/zmq.h	/^#define ZMQ_VERSION /;"	d
-ZMQ_VERSION_MAJOR	deps/include/zmq.h	/^#define ZMQ_VERSION_MAJOR /;"	d
-ZMQ_VERSION_MINOR	deps/include/zmq.h	/^#define ZMQ_VERSION_MINOR /;"	d
-ZMQ_VERSION_PATCH	deps/include/zmq.h	/^#define ZMQ_VERSION_PATCH /;"	d
-ZMQ_XPUB	deps/include/zmq.h	/^#define ZMQ_XPUB /;"	d
-ZMQ_XPUB_NODROP	deps/include/zmq.h	/^#define ZMQ_XPUB_NODROP /;"	d
-ZMQ_XPUB_VERBOSE	deps/include/zmq.h	/^#define ZMQ_XPUB_VERBOSE /;"	d
-ZMQ_XREP	deps/include/zmq.h	/^#define ZMQ_XREP /;"	d
-ZMQ_XREQ	deps/include/zmq.h	/^#define ZMQ_XREQ /;"	d
-ZMQ_XSUB	deps/include/zmq.h	/^#define ZMQ_XSUB /;"	d
-ZMQ_ZAP_DOMAIN	deps/include/zmq.h	/^#define ZMQ_ZAP_DOMAIN /;"	d
-ZPull	include/ps/kv_app.h	/^  int ZPull(const SArray<Key>& keys,$/;"	f	class:ps::KVWorker
-ZPush	include/ps/kv_app.h	/^  int ZPush(const SArray<Key>& keys,$/;"	f	class:ps::KVWorker
-ZeroCopyInputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^  inline ZeroCopyInputStream() {}$/;"	f	class:google::protobuf::io::ZeroCopyInputStream
-ZeroCopyInputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^class LIBPROTOBUF_EXPORT ZeroCopyInputStream {$/;"	c	namespace:google::protobuf::io
-ZeroCopyOutputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^  inline ZeroCopyOutputStream() {}$/;"	f	class:google::protobuf::io::ZeroCopyOutputStream
-ZeroCopyOutputStream	deps/include/google/protobuf/io/zero_copy_stream.h	/^class LIBPROTOBUF_EXPORT ZeroCopyOutputStream {$/;"	c	namespace:google::protobuf::io
-ZigZagDecode32	deps/include/google/protobuf/wire_format_lite.h	/^inline int32 WireFormatLite::ZigZagDecode32(uint32 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-ZigZagDecode64	deps/include/google/protobuf/wire_format_lite.h	/^inline int64 WireFormatLite::ZigZagDecode64(uint64 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-ZigZagEncode32	deps/include/google/protobuf/wire_format_lite.h	/^inline uint32 WireFormatLite::ZigZagEncode32(int32 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-ZigZagEncode64	deps/include/google/protobuf/wire_format_lite.h	/^inline uint64 WireFormatLite::ZigZagEncode64(int64 n) {$/;"	f	class:google::protobuf::internal::WireFormatLite
-ZlibErrorCode	deps/include/google/protobuf/io/gzip_stream.h	/^  inline int ZlibErrorCode() const {$/;"	f	class:google::protobuf::io::GzipInputStream
-ZlibErrorCode	deps/include/google/protobuf/io/gzip_stream.h	/^  inline int ZlibErrorCode() const {$/;"	f	class:google::protobuf::io::GzipOutputStream
-ZlibErrorMessage	deps/include/google/protobuf/io/gzip_stream.h	/^  inline const char* ZlibErrorMessage() const {$/;"	f	class:google::protobuf::io::GzipInputStream
-ZlibErrorMessage	deps/include/google/protobuf/io/gzip_stream.h	/^  inline const char* ZlibErrorMessage() const {$/;"	f	class:google::protobuf::io::GzipOutputStream
-_	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	m	struct:zmq_msg_t
-_GetSharedRef	include/ps/internal/env.h	/^  static inline std::shared_ptr<Environment> _GetSharedRef() {$/;"	f	class:ps::Environment
-_GetSharedRef	include/ps/internal/env.h	/^  static std::shared_ptr<Environment> _GetSharedRef($/;"	f	class:ps::Environment
-_HELPER	tests/lint.py	/^_HELPER = LintHelper()$/;"	v
-__ZMQ_H_INCLUDED__	deps/include/zmq.h	/^#define __ZMQ_H_INCLUDED__$/;"	d
-__del__	tracker/tracker.py	/^    def __del__(self):$/;"	m	class:RabitTracker	file:
-__init__	tests/lint.py	/^    def __init__(self):$/;"	m	class:LintHelper
-__init__	tracker/dmlc_local.py	/^    def __init__(self, args, unknown):$/;"	m	class:LocalLauncher
-__init__	tracker/dmlc_ssh.py	/^    def __init__(self, args, unknown):$/;"	m	class:SSHLauncher
-__init__	tracker/tracker.py	/^    def __init__(self, hostIP, cmd, port = 9091, port_end = 9999, envs = {}):$/;"	m	class:PSTracker
-__init__	tracker/tracker.py	/^    def __init__(self, hostIP, nslave, port = 9091, port_end = 9999):$/;"	m	class:RabitTracker
-__init__	tracker/tracker.py	/^    def __init__(self, sock):$/;"	m	class:ExSocket
-__init__	tracker/tracker.py	/^    def __init__(self, sock, s_addr):$/;"	m	class:SlaveEntry
-_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-_cached_size_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::DescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::EnumValueOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FieldOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileDescriptorSet
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::FileOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MessageOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::MethodOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::ServiceOptions
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::SourceCodeInfo
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::UninterpretedOption
-_cached_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _cached_size_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-_cpplint_state	tests/lint.py	/^from cpplint import _cpplint_state$/;"	i
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::EnumOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::EnumValueOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::FieldOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::FileOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::MessageOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::MethodOptions
-_extensions_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::internal::ExtensionSet _extensions_;$/;"	m	class:google::protobuf::ServiceOptions
-_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-_has_bits_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumValueOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::FileDescriptorSet
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::MethodOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::ServiceOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(1 + 31) \/ 32];$/;"	m	class:google::protobuf::SourceCodeInfo
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(10 + 31) \/ 32];$/;"	m	class:google::protobuf::FileOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(11 + 31) \/ 32];$/;"	m	class:google::protobuf::FileDescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(2 + 31) \/ 32];$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumDescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::MessageOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(3 + 31) \/ 32];$/;"	m	class:google::protobuf::ServiceDescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(4 + 31) \/ 32];$/;"	m	class:google::protobuf::MethodDescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(4 + 31) \/ 32];$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::DescriptorProto
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::FieldOptions
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(7 + 31) \/ 32];$/;"	m	class:google::protobuf::UninterpretedOption
-_has_bits_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint32 _has_bits_[(8 + 31) \/ 32];$/;"	m	class:google::protobuf::FieldDescriptorProto
-_path_cached_byte_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _path_cached_byte_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-_print_summary_map	tests/lint.py	/^    def _print_summary_map(strm, result_map, ftype):$/;"	m	class:LintHelper
-_span_cached_byte_size_	deps/include/google/protobuf/descriptor.pb.h	/^  mutable int _span_cached_byte_size_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-_unknown_fields_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::DescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::EnumValueOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FieldOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileDescriptorSet
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::FileOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MessageOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::MethodOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::ServiceOptions
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::SourceCodeInfo
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::UninterpretedOption
-_unknown_fields_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::UnknownFieldSet _unknown_fields_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-accept_slaves	tracker/tracker.py	/^    def accept_slaves(self, nslave):$/;"	m	class:RabitTracker
-access	src/windows/unistd.h	/^#define access /;"	d
-acked_	src/resender.h	/^  std::unordered_set<uint64_t> acked_;$/;"	m	class:ps::Resender
-add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::add_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_dependency(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::add_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
-add_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::add_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_extension() {$/;"	f	class:google::protobuf::DescriptorProto
-add_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::add_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::add_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
-add_field	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::add_field() {$/;"	f	class:google::protobuf::DescriptorProto
-add_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::add_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-add_file	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::add_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
-add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::add_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-add_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::add_file_to_generate(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-add_location	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::add_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
-add_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* FileDescriptorProto::add_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_method	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::add_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-add_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::add_name() {$/;"	f	class:google::protobuf::UninterpretedOption
-add_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* DescriptorProto::add_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
-add_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::add_path(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-add_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::add_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-add_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_public_dependency(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference { typedef T& type; };$/;"	s	namespace:google::protobuf::internal
-add_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference<T&> { typedef T& type; };$/;"	s	namespace:google::protobuf::internal
-add_service	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::add_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
-add_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::add_span(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumValueOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FieldOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FileOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MessageOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MethodOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
-add_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* ServiceOptions::add_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
-add_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::add_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-add_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::add_weak_dependency(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::aggregate_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-aggregate_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* aggregate_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-aliasing_enabled_	deps/include/google/protobuf/io/coded_stream.h	/^  bool aliasing_enabled_;$/;"	m	class:google::protobuf::io::CodedInputStream
-alignof	include/dmlc/base.h	/^#define alignof /;"	d
-allocated_size_	deps/include/google/protobuf/repeated_field.h	/^  int    allocated_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
-allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumOptions::allow_alias() const {$/;"	f	class:google::protobuf::EnumOptions
-allow_alias_	deps/include/google/protobuf/descriptor.pb.h	/^  bool allow_alias_;$/;"	m	class:google::protobuf::EnumOptions
-allow_f_after_float_	deps/include/google/protobuf/io/tokenizer.h	/^  bool allow_f_after_float_;$/;"	m	class:google::protobuf::io::Tokenizer
-allow_partial_	deps/include/google/protobuf/text_format.h	/^    bool allow_partial_;$/;"	m	class:google::protobuf::TextFormat::Parser
-allow_unknown_	deps/include/google/protobuf/descriptor.h	/^  bool allow_unknown_;$/;"	m	class:google::protobuf::DescriptorPool
-allow_unknown_field_	deps/include/google/protobuf/text_format.h	/^    bool allow_unknown_field_;$/;"	m	class:google::protobuf::TextFormat::Parser
-and_	deps/include/google/protobuf/stubs/template_util.h	/^struct and_ : public integral_constant<bool, (A::value && B::value)> {$/;"	s	namespace:google::protobuf::internal
-append	include/ps/sarray.h	/^  void append(const SArray<V>& arr) {$/;"	f	class:ps::SArray
-arg	deps/include/google/protobuf/extension_set.h	/^    const void* arg;$/;"	m	struct:google::protobuf::internal::ExtensionInfo::EnumValidityCheck
-arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
-arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
-arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::MethodClosure1
-arg1_	deps/include/google/protobuf/stubs/common.h	/^  Arg1 arg1_;$/;"	m	class:google::protobuf::internal::MethodClosure2
-arg2_	deps/include/google/protobuf/stubs/common.h	/^  Arg2 arg2_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
-arg2_	deps/include/google/protobuf/stubs/common.h	/^  Arg2 arg2_;$/;"	m	class:google::protobuf::internal::MethodClosure2
-argparse	tracker/dmlc_local.py	/^import argparse$/;"	i
-argparse	tracker/dmlc_mpi.py	/^import argparse$/;"	i
-argparse	tracker/dmlc_ssh.py	/^import argparse$/;"	i
-array_	deps/include/google/protobuf/stubs/common.h	/^  C* array_;$/;"	m	class:google::protobuf::internal::scoped_array
-assign_rank	tracker/tracker.py	/^    def assign_rank(self, rank, wait_conn, tree_map, parent_map, ring_map):$/;"	m	class:SlaveEntry
-at_start_of_line_	deps/include/google/protobuf/io/printer.h	/^  bool at_start_of_line_;$/;"	m	class:google::protobuf::io::Printer
-author	docs/conf.py	/^author = u'ps-lite developers'$/;"	v
-back	include/ps/sarray.h	/^  inline V back() const { CHECK(!empty()); return data()[size_-1]; }$/;"	f	class:ps::SArray
-backup_bytes_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int backup_bytes_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-barrier_cond_	include/ps/internal/postoffice.h	/^  std::condition_variable barrier_cond_;$/;"	m	class:ps::Postoffice
-barrier_count_	include/ps/internal/van.h	/^  std::vector<int> barrier_count_;$/;"	m	class:ps::Van
-barrier_done_	include/ps/internal/postoffice.h	/^  bool barrier_done_;$/;"	m	class:ps::Postoffice
-barrier_group	include/ps/internal/message.h	/^  int barrier_group;$/;"	m	struct:ps::Control
-barrier_mu_	include/ps/internal/postoffice.h	/^  std::mutex barrier_mu_;$/;"	m	class:ps::Postoffice
-begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::begin() const {$/;"	f	class:google::protobuf::RepeatedField
-begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::begin() {$/;"	f	class:google::protobuf::RepeatedField
-begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::begin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::begin() {$/;"	f	class:google::protobuf::RepeatedPtrField
-begin	include/ps/range.h	/^  uint64_t begin() const { return begin_; }$/;"	f	class:ps::Range
-begin	include/ps/sarray.h	/^  inline V* begin() { return data(); }$/;"	f	class:ps::SArray
-begin	include/ps/sarray.h	/^  inline const V* begin() const { return data(); }$/;"	f	class:ps::SArray
-begin_	include/ps/range.h	/^  uint64_t begin_;$/;"	m	class:ps::Range
-big_	deps/include/google/protobuf/stubs/template_util.h	/^struct big_ {$/;"	s	namespace:google::protobuf::internal
-block_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int block_size_;     \/\/ How many bytes to return at a time.$/;"	m	class:google::protobuf::io::ArrayInputStream
-block_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int block_size_;     \/\/ How many bytes to return at a time.$/;"	m	class:google::protobuf::io::ArrayOutputStream
-body	include/ps/internal/message.h	/^  std::string body;$/;"	m	struct:ps::Meta
-body	include/ps/simple_app.h	/^  std::string body;$/;"	m	struct:ps::SimpleData
-bool_value	deps/include/google/protobuf/extension_set.h	/^      bool                  bool_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-breathe_default_project	docs/conf.py	/^breathe_default_project = 'ps-lite'$/;"	v
-breathe_projects	docs/conf.py	/^breathe_projects = {'ps-lite' : 'xml\/'}$/;"	v
-buffer_	deps/include/google/protobuf/io/coded_stream.h	/^  const uint8* buffer_;$/;"	m	class:google::protobuf::io::CodedInputStream
-buffer_	deps/include/google/protobuf/io/coded_stream.h	/^  uint8* buffer_;$/;"	m	class:google::protobuf::io::CodedOutputStream
-buffer_	deps/include/google/protobuf/io/printer.h	/^  char* buffer_;$/;"	m	class:google::protobuf::io::Printer
-buffer_	deps/include/google/protobuf/io/tokenizer.h	/^  const char* buffer_;      \/\/ Current buffer returned from input_.$/;"	m	class:google::protobuf::io::Tokenizer
-buffer_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  scoped_array<uint8> buffer_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-buffer_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  scoped_array<uint8> buffer_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-buffer_end_	deps/include/google/protobuf/io/coded_stream.h	/^  const uint8* buffer_end_;     \/\/ pointer to the end of the buffer.$/;"	m	class:google::protobuf::io::CodedInputStream
-buffer_pos_	deps/include/google/protobuf/io/tokenizer.h	/^  int buffer_pos_;          \/\/ Current position within the buffer.$/;"	m	class:google::protobuf::io::Tokenizer
-buffer_size	deps/include/google/protobuf/io/gzip_stream.h	/^    int buffer_size;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
-buffer_size_	deps/include/google/protobuf/io/coded_stream.h	/^  int buffer_size_;$/;"	m	class:google::protobuf::io::CodedOutputStream
-buffer_size_	deps/include/google/protobuf/io/printer.h	/^  int buffer_size_;$/;"	m	class:google::protobuf::io::Printer
-buffer_size_	deps/include/google/protobuf/io/tokenizer.h	/^  int buffer_size_;         \/\/ Size of buffer_.$/;"	m	class:google::protobuf::io::Tokenizer
-buffer_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int buffer_size_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-buffer_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int buffer_size_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-buffer_size_after_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int buffer_size_after_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
-buffer_used_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int buffer_used_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-buffer_used_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int buffer_used_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-by_extension_	deps/include/google/protobuf/descriptor_database.h	/^    map<pair<string, int>, Value> by_extension_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
-by_name_	deps/include/google/protobuf/descriptor_database.h	/^    map<string, Value> by_name_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
-by_symbol_	deps/include/google/protobuf/descriptor_database.h	/^    map<string, Value> by_symbol_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase::DescriptorIndex
-bytes_retired_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int64 bytes_retired_;  \/\/ Bytes read from previous streams.$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
-cached_size	deps/include/google/protobuf/extension_set.h	/^    mutable int cached_size;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-callbacks_	include/ps/kv_app.h	/^  std::unordered_map<int, Callback> callbacks_;$/;"	m	class:ps::KVWorker
-camelcase_name_	deps/include/google/protobuf/descriptor.h	/^  const string* camelcase_name_;$/;"	m	class:google::protobuf::FieldDescriptor
-capacity	include/ps/sarray.h	/^  inline size_t capacity() const { return capacity_; }$/;"	f	class:ps::SArray
-capacity_	include/ps/sarray.h	/^  size_t capacity_ = 0;$/;"	m	class:ps::SArray
-cast	deps/include/google/protobuf/repeated_field.h	/^  static inline const typename TypeHandler::Type* cast(const void* element) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-cast	deps/include/google/protobuf/repeated_field.h	/^  static inline typename TypeHandler::Type* cast(void* element) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::cc_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-cc_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool cc_generic_services_;$/;"	m	class:google::protobuf::FileOptions
-chdir	src/windows/unistd.h	/^#define chdir /;"	d
-choices	tracker/dmlc_mpi.py	/^                    choices=['INFO', 'DEBUG'],$/;"	v
-clear	include/ps/sarray.h	/^  void clear() { reset(nullptr, 0, [](V* data) {}); }$/;"	f	class:ps::SArray
-clear_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
-clear_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_ctype() {$/;"	f	class:google::protobuf::FieldOptions
-clear_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
-clear_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-clear_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-clear_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
-clear_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_extension() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_field	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_field() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-clear_file	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorSet::clear_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
-clear_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-clear_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_go_package() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_has_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
-clear_has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_ctype() {$/;"	f	class:google::protobuf::FieldOptions
-clear_has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
-clear_has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_has_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-clear_has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::clear_has_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-clear_has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
-clear_has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_go_package() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_has_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-clear_has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_java_package() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_lazy() {$/;"	f	class:google::protobuf::FieldOptions
-clear_has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_has_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_has_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
-clear_has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_has_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_has_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-clear_has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_has_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-clear_has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_has_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
-clear_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_has_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-clear_has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_has_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_packed() {$/;"	f	class:google::protobuf::FieldOptions
-clear_has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_has_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-clear_has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_has_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_has_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_has_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-clear_has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_has_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_has_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_has_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_has_weak() {$/;"	f	class:google::protobuf::FieldOptions
-clear_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-clear_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
-clear_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
-clear_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
-clear_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_java_package() {$/;"	f	class:google::protobuf::FileOptions
-clear_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_lazy() {$/;"	f	class:google::protobuf::FieldOptions
-clear_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_location	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo::clear_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
-clear_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
-clear_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_method	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-clear_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::clear_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_name() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-clear_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_name() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::clear_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-clear_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
-clear_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::clear_options() {$/;"	f	class:google::protobuf::DescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::clear_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-clear_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::clear_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-clear_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_packed() {$/;"	f	class:google::protobuf::FieldOptions
-clear_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-clear_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_path() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::clear_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-clear_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_public_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-clear_service	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
-clear_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_span() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::clear_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-clear_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::clear_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-clear_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::clear_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-clear_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::clear_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
-clear_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceOptions::clear_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
-clear_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::clear_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-clear_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::clear_weak() {$/;"	f	class:google::protobuf::FieldOptions
-clear_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::clear_weak_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-close_on_delete_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool close_on_delete_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-close_on_delete_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool close_on_delete_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-cmd	include/ps/internal/message.h	/^  Command cmd;$/;"	m	struct:ps::Control
-cmd	include/ps/kv_app.h	/^  int cmd;$/;"	m	struct:ps::KVMeta
-codec_type_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string codec_type_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-codecs	tests/lint.py	/^import codecs$/;"	i
-column	deps/include/google/protobuf/io/tokenizer.h	/^    int column;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
-column	deps/include/google/protobuf/text_format.h	/^    int column;$/;"	m	struct:google::protobuf::TextFormat::ParseLocation
-column_	deps/include/google/protobuf/io/tokenizer.h	/^  int column_;$/;"	m	class:google::protobuf::io::Tokenizer
-comment_style_	deps/include/google/protobuf/io/tokenizer.h	/^  CommentStyle comment_style_;$/;"	m	class:google::protobuf::io::Tokenizer
-compiler	deps/include/google/protobuf/compiler/code_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/importer.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/parser.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/plugin.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compiler	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace compiler {$/;"	n	namespace:google::protobuf
-compression_level	deps/include/google/protobuf/io/gzip_stream.h	/^    int compression_level;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
-compression_strategy	deps/include/google/protobuf/io/gzip_stream.h	/^    int compression_strategy;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
-cond_	include/ps/internal/threadsafe_queue.h	/^  std::condition_variable cond_;$/;"	m	class:ps::ThreadsafeQueue
-config_logger	tracker/tracker.py	/^def config_logger(args):$/;"	f
-const_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef const Element* const_iterator;$/;"	t	class:google::protobuf::RepeatedField
-const_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef internal::RepeatedPtrIterator<const Element> const_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-const_pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type* const_pointer;$/;"	t	class:google::protobuf::RepeatedField
-const_pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type* const_pointer;$/;"	t	class:google::protobuf::RepeatedPtrField
-const_pointer_iterator	deps/include/google/protobuf/repeated_field.h	/^  const_pointer_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-const_reference	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type& const_reference;$/;"	t	class:google::protobuf::RepeatedField
-const_reference	deps/include/google/protobuf/repeated_field.h	/^  typedef const value_type& const_reference;$/;"	t	class:google::protobuf::RepeatedPtrField
-const_reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;$/;"	t	class:google::protobuf::RepeatedField
-const_reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<const_iterator> const_reverse_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-constexpr	include/dmlc/base.h	/^#define constexpr /;"	d
-containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::Descriptor
-containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::EnumDescriptor
-containing_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* containing_type_;$/;"	m	class:google::protobuf::FieldDescriptor
-containing_type_	deps/include/google/protobuf/extension_set.h	/^  const MessageLite* containing_type_;$/;"	m	class:google::protobuf::internal::GeneratedExtensionFinder
-content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::content() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-content_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* content_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-context_	src/zmq_van.h	/^  void *context_ = nullptr;$/;"	m	class:ps::ZMQVan
-control	include/ps/internal/message.h	/^  Control control;$/;"	m	struct:ps::Meta
-copying_input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingFileInputStream copying_input_;$/;"	m	class:google::protobuf::io::FileInputStream
-copying_input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingIstreamInputStream copying_input_;$/;"	m	class:google::protobuf::io::IstreamInputStream
-copying_output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingFileOutputStream copying_output_;$/;"	m	class:google::protobuf::io::FileOutputStream
-copying_output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOstreamOutputStream copying_output_;$/;"	m	class:google::protobuf::io::OstreamOutputStream
-copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  CopyingInputStream* copying_stream_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  CopyingOutputStream* copying_stream_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-copyright	docs/conf.py	/^copyright = u'2016, ps-lite developers'$/;"	v
-cpp	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace cpp {$/;"	n	namespace:google::protobuf::compiler
-cpp_type	deps/include/google/protobuf/descriptor.h	/^inline FieldDescriptor::CppType FieldDescriptor::cpp_type() const {$/;"	f	class:google::protobuf::FieldDescriptor
-cpp_type_name	deps/include/google/protobuf/descriptor.h	/^inline const char* FieldDescriptor::cpp_type_name() const {$/;"	f	class:google::protobuf::FieldDescriptor
-cpplint	tests/lint.py	/^import cpplint$/;"	i
-ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions_CType FieldOptions::ctype() const {$/;"	f	class:google::protobuf::FieldOptions
-ctype_	deps/include/google/protobuf/descriptor.pb.h	/^  int ctype_;$/;"	m	class:google::protobuf::FieldOptions
-curr_path	docs/conf.py	/^curr_path = os.path.dirname(os.path.abspath(os.path.expanduser(__file__)))$/;"	v
-current	deps/include/google/protobuf/io/tokenizer.h	/^inline const Tokenizer::Token& Tokenizer::current() {$/;"	f	class:google::protobuf::io::Tokenizer
-current_	deps/include/google/protobuf/io/tokenizer.h	/^  Token current_;           \/\/ Returned by current().$/;"	m	class:google::protobuf::io::Tokenizer
-current_char_	deps/include/google/protobuf/io/tokenizer.h	/^  char current_char_;       \/\/ == buffer_[buffer_pos_], updated by NextChar().$/;"	m	class:google::protobuf::io::Tokenizer
-current_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  Limit current_limit_;   \/\/ if position = -1, no limit is applied$/;"	m	class:google::protobuf::io::CodedInputStream
-current_size_	deps/include/google/protobuf/repeated_field.h	/^  int      current_size_;$/;"	m	class:google::protobuf::RepeatedField
-current_size_	deps/include/google/protobuf/repeated_field.h	/^  int    current_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
-customer_id	include/ps/internal/message.h	/^  int customer_id;$/;"	m	struct:ps::Meta
-customers_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, Customer*> customers_;$/;"	m	class:ps::Postoffice
-data	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrFieldBase::data() const {$/;"	f	class:google::protobuf::internal::TypeHandler::RepeatedPtrFieldBase
-data	deps/include/google/protobuf/repeated_field.h	/^inline const Element* RepeatedField<Element>::data() const {$/;"	f	class:google::protobuf::RepeatedField
-data	deps/include/google/protobuf/repeated_field.h	/^inline const Element* const* RepeatedPtrField<Element>::data() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-data	include/ps/internal/message.h	/^  std::vector<SArray<char> > data;$/;"	m	struct:ps::Message
-data	include/ps/sarray.h	/^  inline V* data() const { return ptr_.get(); }$/;"	f	class:ps::SArray
-data_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const uint8* const data_;  \/\/ The byte array.$/;"	m	class:google::protobuf::io::ArrayInputStream
-data_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  uint8* const data_;        \/\/ The byte array.$/;"	m	class:google::protobuf::io::ArrayOutputStream
-data_type	include/ps/internal/message.h	/^  std::vector<DataType> data_type;$/;"	m	struct:ps::Meta
-database_	deps/include/google/protobuf/compiler/importer.h	/^  SourceTreeDescriptorDatabase database_;$/;"	m	class:google::protobuf::compiler::Importer
-decide_rank	tracker/tracker.py	/^    def decide_rank(self, job_map):$/;"	m	class:SlaveEntry
-default_error_collector_	deps/include/google/protobuf/descriptor.h	/^  ErrorCollector* default_error_collector_;$/;"	m	class:google::protobuf::DescriptorPool
-default_instance	deps/include/google/protobuf/repeated_field.h	/^  static const Type& default_instance() { return Type::default_instance(); }$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-default_instance	deps/include/google/protobuf/repeated_field.h	/^  static const Type& default_instance() {$/;"	f	class:google::protobuf::internal::StringTypeHandlerBase
-default_instance	deps/include/google/protobuf/repeated_field.h	/^inline const Message& GenericTypeHandler<Message>::default_instance() {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-default_instance	deps/include/google/protobuf/repeated_field.h	/^inline const MessageLite& GenericTypeHandler<MessageLite>::default_instance() {$/;"	f	class:google::protobuf::internal::GenericTypeHandler
-default_instance	src/meta.pb.cc	/^const PBControl& PBControl::default_instance() {$/;"	f	class:ps::PBControl
-default_instance	src/meta.pb.cc	/^const PBMeta& PBMeta::default_instance() {$/;"	f	class:ps::PBMeta
-default_instance	src/meta.pb.cc	/^const PBNode& PBNode::default_instance() {$/;"	f	class:ps::PBNode
-default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorRequest* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorResponse* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-default_instance_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static CodeGeneratorResponse_File* default_instance_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static DescriptorProto* default_instance_;$/;"	m	class:google::protobuf::DescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static DescriptorProto_ExtensionRange* default_instance_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumOptions* default_instance_;$/;"	m	class:google::protobuf::EnumOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumValueDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static EnumValueOptions* default_instance_;$/;"	m	class:google::protobuf::EnumValueOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FieldDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FieldOptions* default_instance_;$/;"	m	class:google::protobuf::FieldOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::FileDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileDescriptorSet* default_instance_;$/;"	m	class:google::protobuf::FileDescriptorSet
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static FileOptions* default_instance_;$/;"	m	class:google::protobuf::FileOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MessageOptions* default_instance_;$/;"	m	class:google::protobuf::MessageOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MethodDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static MethodOptions* default_instance_;$/;"	m	class:google::protobuf::MethodOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static ServiceDescriptorProto* default_instance_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static ServiceOptions* default_instance_;$/;"	m	class:google::protobuf::ServiceOptions
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static SourceCodeInfo* default_instance_;$/;"	m	class:google::protobuf::SourceCodeInfo
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static SourceCodeInfo_Location* default_instance_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static UninterpretedOption* default_instance_;$/;"	m	class:google::protobuf::UninterpretedOption
-default_instance_	deps/include/google/protobuf/descriptor.pb.h	/^  static UninterpretedOption_NamePart* default_instance_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-default_instance_	deps/include/google/protobuf/generated_message_reflection.h	/^  const Message* default_instance_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-default_instance_	src/meta.pb.cc	/^PBControl* PBControl::default_instance_ = NULL;$/;"	m	class:ps::PBControl	file:
-default_instance_	src/meta.pb.cc	/^PBMeta* PBMeta::default_instance_ = NULL;$/;"	m	class:ps::PBMeta	file:
-default_instance_	src/meta.pb.cc	/^PBNode* PBNode::default_instance_ = NULL;$/;"	m	class:ps::PBNode	file:
-default_recursion_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  static int default_recursion_limit_;  \/\/ 100 by default.$/;"	m	class:google::protobuf::io::CodedInputStream
-default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::default_value() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-default_value	deps/include/google/protobuf/extension_set.h	/^  typename TypeTraits::ConstType default_value() const {$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
-default_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* default_value_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-default_value_	deps/include/google/protobuf/extension_set.h	/^  typename TypeTraits::ConstType default_value_;$/;"	m	class:google::protobuf::internal::ExtensionIdentifier
-default_value_bool_	deps/include/google/protobuf/descriptor.h	/^    bool   default_value_bool_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_double_	deps/include/google/protobuf/descriptor.h	/^    double default_value_double_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_enum_	deps/include/google/protobuf/descriptor.h	/^    const EnumValueDescriptor* default_value_enum_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_float_	deps/include/google/protobuf/descriptor.h	/^    float  default_value_float_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_int32_	deps/include/google/protobuf/descriptor.h	/^    int32  default_value_int32_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_int64_	deps/include/google/protobuf/descriptor.h	/^    int64  default_value_int64_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_string_	deps/include/google/protobuf/descriptor.h	/^    const string* default_value_string_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_uint32_	deps/include/google/protobuf/descriptor.h	/^    uint32 default_value_uint32_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-default_value_uint64_	deps/include/google/protobuf/descriptor.h	/^    uint64 default_value_uint64_;$/;"	m	union:google::protobuf::FieldDescriptor::__anon1
-delegate_to_generated_factory_	deps/include/google/protobuf/dynamic_message.h	/^  bool delegate_to_generated_factory_;$/;"	m	class:google::protobuf::DynamicMessageFactory
-dependencies_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor** dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
-dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptor
-dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::std::string> dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
-dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
-dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::deprecated() const {$/;"	f	class:google::protobuf::FieldOptions
-deprecated_	deps/include/google/protobuf/descriptor.pb.h	/^  bool deprecated_;$/;"	m	class:google::protobuf::FieldOptions
-desc	deps/include/google/protobuf/extension_set.h	/^#define desc /;"	d
-desc	deps/include/google/protobuf/extension_set.h	/^#undef desc$/;"	d
-descriptor	deps/include/google/protobuf/extension_set.h	/^    const FieldDescriptor* descriptor;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-descriptor	deps/include/google/protobuf/extension_set.h	/^  const FieldDescriptor* descriptor;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
-descriptor	deps/include/google/protobuf/message.h	/^  const Descriptor* descriptor;$/;"	m	struct:google::protobuf::Metadata
-descriptor_	deps/include/google/protobuf/generated_message_reflection.h	/^  const Descriptor* descriptor_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-descriptor_pool_	deps/include/google/protobuf/generated_message_reflection.h	/^  const DescriptorPool* descriptor_pool_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-descriptor_set_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string descriptor_set_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef ptrdiff_t difference_type;$/;"	t	class:google::protobuf::RepeatedField
-difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef ptrdiff_t difference_type;$/;"	t	class:google::protobuf::RepeatedPtrField
-difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::difference_type difference_type;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
-difference_type	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::difference_type difference_type;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-disallow_services_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool disallow_services_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-disk_path	deps/include/google/protobuf/compiler/importer.h	/^    string disk_path;$/;"	m	struct:google::protobuf::compiler::DiskSourceTree::Mapping
-dmlc	include/dmlc/base.h	/^namespace dmlc {$/;"	n
-dmlc	include/dmlc/logging.h	/^namespace dmlc {$/;"	n
-doc_root	docs/conf.py	/^doc_root = 'http:\/\/dmlc.ml'$/;"	v
-double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline double UninterpretedOption::double_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-double_value	deps/include/google/protobuf/extension_set.h	/^      double                double_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-double_value_	deps/include/google/protobuf/descriptor.pb.h	/^  double double_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-down_cast	deps/include/google/protobuf/stubs/common.h	/^inline To down_cast(From* f) {                   \/\/ so we only accept pointers$/;"	f	namespace:google::protobuf::internal
-drop_rate_	include/ps/internal/van.h	/^  int drop_rate_ = 0;$/;"	m	class:ps::Van
-dummy	deps/include/google/protobuf/stubs/template_util.h	/^  char dummy[2];$/;"	m	struct:google::protobuf::internal::big_
-dup2	src/windows/unistd.h	/^#define dup2 /;"	d
-dynamic_cast_if_available	deps/include/google/protobuf/generated_message_reflection.h	/^inline To dynamic_cast_if_available(From from) {$/;"	f	namespace:google::protobuf::internal
-element_type	deps/include/google/protobuf/stubs/common.h	/^  typedef C element_type;$/;"	t	class:google::protobuf::internal::scoped_array
-element_type	deps/include/google/protobuf/stubs/common.h	/^  typedef C element_type;$/;"	t	class:google::protobuf::internal::scoped_ptr
-elements_	deps/include/google/protobuf/repeated_field.h	/^  Element* elements_;$/;"	m	class:google::protobuf::RepeatedField
-elements_	deps/include/google/protobuf/repeated_field.h	/^  void** elements_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
-empty	deps/include/google/protobuf/unknown_field_set.h	/^inline bool UnknownFieldSet::empty() const {$/;"	f	class:google::protobuf::UnknownFieldSet
-empty	include/ps/internal/message.h	/^  inline bool empty() const { return cmd == EMPTY; }$/;"	f	struct:ps::Control
-empty	include/ps/sarray.h	/^  inline bool empty() const { return size() == 0; }$/;"	f	class:ps::SArray
-end	deps/include/google/protobuf/descriptor.h	/^    int end;    \/\/ exclusive$/;"	m	struct:google::protobuf::Descriptor::ExtensionRange
-end	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::end() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-end	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::end() const {$/;"	f	class:google::protobuf::RepeatedField
-end	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::end() {$/;"	f	class:google::protobuf::RepeatedField
-end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::end() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::end() {$/;"	f	class:google::protobuf::RepeatedPtrField
-end	include/ps/range.h	/^  uint64_t end() const { return end_; }$/;"	f	class:ps::Range
-end	include/ps/sarray.h	/^  inline V* end() { return data() + size(); }$/;"	f	class:ps::SArray
-end	include/ps/sarray.h	/^  inline const V* end() const { return data() + size(); }$/;"	f	class:ps::SArray
-end_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 end_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-end_	include/ps/range.h	/^  uint64_t end_;$/;"	m	class:ps::Range
-end_column	deps/include/google/protobuf/descriptor.h	/^  int end_column;$/;"	m	struct:google::protobuf::SourceLocation
-end_column	deps/include/google/protobuf/io/tokenizer.h	/^    int end_column;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
-end_line	deps/include/google/protobuf/descriptor.h	/^  int end_line;$/;"	m	struct:google::protobuf::SourceLocation
-enforce_dependencies_	deps/include/google/protobuf/descriptor.h	/^  bool enforce_dependencies_;$/;"	m	class:google::protobuf::DescriptorPool
-enum_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::enum_type() const {$/;"	f	class:google::protobuf::DescriptorProto
-enum_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::enum_type() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumDescriptorProto& DescriptorProto::enum_type(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
-enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumDescriptorProto& FileDescriptorProto::enum_type(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-enum_type_	deps/include/google/protobuf/descriptor.h	/^  const EnumDescriptor* enum_type_;$/;"	m	class:google::protobuf::FieldDescriptor
-enum_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;$/;"	m	class:google::protobuf::DescriptorProto
-enum_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumDescriptorProto > enum_type_;$/;"	m	class:google::protobuf::FileDescriptorProto
-enum_type_count_	deps/include/google/protobuf/descriptor.h	/^  int enum_type_count_;$/;"	m	class:google::protobuf::Descriptor
-enum_type_count_	deps/include/google/protobuf/descriptor.h	/^  int enum_type_count_;$/;"	m	class:google::protobuf::FileDescriptor
-enum_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::enum_type_size() const {$/;"	f	class:google::protobuf::DescriptorProto
-enum_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::enum_type_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-enum_types_	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor* enum_types_;$/;"	m	class:google::protobuf::Descriptor
-enum_types_	deps/include/google/protobuf/descriptor.h	/^  EnumDescriptor* enum_types_;$/;"	m	class:google::protobuf::FileDescriptor
-enum_validity_check	deps/include/google/protobuf/extension_set.h	/^    EnumValidityCheck enum_validity_check;$/;"	m	union:google::protobuf::internal::ExtensionInfo::__anon2
-enum_value	deps/include/google/protobuf/extension_set.h	/^      int                   enum_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-env_ref_	include/ps/internal/postoffice.h	/^  std::shared_ptr<Environment> env_ref_;$/;"	m	class:ps::Postoffice
-epylint	tests/lint.py	/^from pylint import epylint$/;"	i
-errno_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int errno_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-errno_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    int errno_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse::error() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-error_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* error_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  MultiFileErrorCollector* error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-error_collector_	deps/include/google/protobuf/compiler/parser.h	/^  io::ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::compiler::Parser
-error_collector_	deps/include/google/protobuf/io/tokenizer.h	/^  ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::io::Tokenizer
-error_collector_	deps/include/google/protobuf/text_format.h	/^    io::ErrorCollector* error_collector_;$/;"	m	class:google::protobuf::TextFormat::Parser
-error_format_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  ErrorFormat error_format_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-events	deps/include/zmq.h	/^    short events;$/;"	m	struct:zmq_pollitem_t
-exclude_patterns	docs/conf.py	/^exclude_patterns = ['_build']$/;"	v
-exec_cmd	tracker/dmlc_local.py	/^    def exec_cmd(self, cmd, role, pass_env):$/;"	m	class:LocalLauncher
-executable_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string executable_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-execve	src/windows/unistd.h	/^#define execve /;"	d
-exit_callback_	include/ps/internal/postoffice.h	/^  Callback exit_callback_;$/;"	m	class:ps::Postoffice
-experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldOptions::experimental_map_key() const {$/;"	f	class:google::protobuf::FieldOptions
-experimental_map_key_	deps/include/google/protobuf/descriptor.h	/^  const FieldDescriptor* experimental_map_key_;$/;"	m	class:google::protobuf::FieldDescriptor
-experimental_map_key_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* experimental_map_key_;$/;"	m	class:google::protobuf::FieldOptions
-extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::extendee() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-extendee_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* extendee_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-extension	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::extension() const {$/;"	f	class:google::protobuf::DescriptorProto
-extension	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::extension() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-extension	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::extension(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
-extension	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& FileDescriptorProto::extension(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-extension_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;$/;"	m	class:google::protobuf::DescriptorProto
-extension_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > extension_;$/;"	m	class:google::protobuf::FileDescriptorProto
-extension_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_count_;$/;"	m	class:google::protobuf::Descriptor
-extension_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_count_;$/;"	m	class:google::protobuf::FileDescriptor
-extension_factory_	deps/include/google/protobuf/io/coded_stream.h	/^  MessageFactory* extension_factory_;$/;"	m	class:google::protobuf::io::CodedInputStream
-extension_pool_	deps/include/google/protobuf/io/coded_stream.h	/^  const DescriptorPool* extension_pool_;$/;"	m	class:google::protobuf::io::CodedInputStream
-extension_range	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::extension_range() const {$/;"	f	class:google::protobuf::DescriptorProto
-extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto_ExtensionRange& DescriptorProto::extension_range(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
-extension_range_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto_ExtensionRange > extension_range_;$/;"	m	class:google::protobuf::DescriptorProto
-extension_range_count_	deps/include/google/protobuf/descriptor.h	/^  int extension_range_count_;$/;"	m	class:google::protobuf::Descriptor
-extension_range_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::extension_range_size() const {$/;"	f	class:google::protobuf::DescriptorProto
-extension_ranges_	deps/include/google/protobuf/descriptor.h	/^  ExtensionRange* extension_ranges_;$/;"	m	class:google::protobuf::Descriptor
-extension_scope_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* extension_scope_;$/;"	m	class:google::protobuf::FieldDescriptor
-extension_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::extension_size() const {$/;"	f	class:google::protobuf::DescriptorProto
-extension_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::extension_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-extensions	docs/conf.py	/^extensions = [$/;"	v
-extensions_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* extensions_;$/;"	m	class:google::protobuf::Descriptor
-extensions_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* extensions_;$/;"	m	class:google::protobuf::FileDescriptor
-extensions_	deps/include/google/protobuf/extension_set.h	/^  std::map<int, Extension> extensions_;$/;"	m	class:google::protobuf::internal::ExtensionSet
-extensions_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int extensions_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-failed	deps/include/google/protobuf/io/printer.h	/^  bool failed() const { return failed_; }$/;"	f	class:google::protobuf::io::Printer
-failed_	deps/include/google/protobuf/io/printer.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::Printer
-failed_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-failed_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool failed_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-fallback_database_	deps/include/google/protobuf/descriptor.h	/^  DescriptorDatabase* fallback_database_;$/;"	m	class:google::protobuf::DescriptorPool
-false_	deps/include/google/protobuf/stubs/template_util.h	/^typedef false_type false_;$/;"	t	namespace:google::protobuf::internal
-false_type	deps/include/google/protobuf/stubs/template_util.h	/^typedef integral_constant<bool, false> false_type;$/;"	t	namespace:google::protobuf::internal
-fd	deps/include/zmq.h	/^    SOCKET fd;$/;"	m	struct:zmq_pollitem_t
-fd	deps/include/zmq.h	/^    int fd;$/;"	m	struct:zmq_pollitem_t
-field	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::field() const {$/;"	f	class:google::protobuf::DescriptorProto
-field	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldDescriptorProto& DescriptorProto::field(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
-field	deps/include/google/protobuf/unknown_field_set.h	/^inline const UnknownField& UnknownFieldSet::field(int index) const {$/;"	f	class:google::protobuf::UnknownFieldSet
-field_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FieldDescriptorProto > field_;$/;"	m	class:google::protobuf::DescriptorProto
-field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedField<T>* field_;$/;"	m	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrField<T>* field_;$/;"	m	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-field_	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrField<T>* field_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-field_count	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownFieldSet::field_count() const {$/;"	f	class:google::protobuf::UnknownFieldSet
-field_count_	deps/include/google/protobuf/descriptor.h	/^  int field_count_;$/;"	m	class:google::protobuf::Descriptor
-field_number	deps/include/google/protobuf/wire_format_lite.h	/^#define field_number /;"	d
-field_number	deps/include/google/protobuf/wire_format_lite.h	/^#undef field_number$/;"	d
-field_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::field_size() const {$/;"	f	class:google::protobuf::DescriptorProto
-fields_	deps/include/google/protobuf/descriptor.h	/^  FieldDescriptor* fields_;$/;"	m	class:google::protobuf::Descriptor
-fields_	deps/include/google/protobuf/unknown_field_set.h	/^  vector<UnknownField>* fields_;$/;"	m	class:google::protobuf::UnknownFieldSet
-file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorResponse::file() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::google::protobuf::compiler::CodeGeneratorResponse_File& CodeGeneratorResponse::file(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-file	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorSet::file() const {$/;"	f	class:google::protobuf::FileDescriptorSet
-file	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FileDescriptorProto& FileDescriptorSet::file(int index) const {$/;"	f	class:google::protobuf::FileDescriptorSet
-file_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::compiler::CodeGeneratorResponse_File > file_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-file_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable const FileDescriptor* file_;  \/\/ Set in Generate().  Under mutex_.$/;"	m	class:google::protobuf::compiler::python::Generator
-file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::Descriptor
-file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::EnumDescriptor
-file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::FieldDescriptor
-file_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptor* file_;$/;"	m	class:google::protobuf::ServiceDescriptor
-file_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > file_;$/;"	m	class:google::protobuf::FileDescriptorSet
-file_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    const int file_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-file_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    const int file_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-file_descriptor_serialized_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable string file_descriptor_serialized_;$/;"	m	class:google::protobuf::compiler::python::Generator
-file_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorResponse::file_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-file_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorSet::file_size() const {$/;"	f	class:google::protobuf::FileDescriptorSet
-file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::file_to_generate() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorRequest::file_to_generate(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-file_to_generate_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::std::string> file_to_generate_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-file_to_generate_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorRequest::file_to_generate_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-filename	deps/include/google/protobuf/stubs/common.h	/^  const char* filename() const { return filename_; }$/;"	f	class:google::protobuf::FatalException
-filename_	deps/include/google/protobuf/stubs/common.h	/^  const char* filename_;$/;"	m	class:google::protobuf::FatalException
-filename_	deps/include/google/protobuf/stubs/common.h	/^  const char* filename_;$/;"	m	class:google::protobuf::internal::LogMessage
-fileno	src/windows/unistd.h	/^#define fileno /;"	d
-files_to_delete_	deps/include/google/protobuf/descriptor_database.h	/^  vector<const FileDescriptorProto*> files_to_delete_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase
-files_to_delete_	deps/include/google/protobuf/descriptor_database.h	/^  vector<void*> files_to_delete_;$/;"	m	class:google::protobuf::EncodedDescriptorDatabase
-find	include/ps/internal/env.h	/^  const char* find(const char* k) {$/;"	f	class:ps::Environment
-find_share_ring	tracker/tracker.py	/^    def find_share_ring(self, tree_map, parent_map, r):$/;"	m	class:RabitTracker
-finder_	deps/include/google/protobuf/text_format.h	/^    Finder* finder_;$/;"	m	class:google::protobuf::TextFormat::Parser
-fixed32	deps/include/google/protobuf/unknown_field_set.h	/^inline uint32 UnknownField::fixed32() const {$/;"	f	class:google::protobuf::UnknownField
-fixed32_	deps/include/google/protobuf/unknown_field_set.h	/^    uint32 fixed32_;$/;"	m	union:google::protobuf::UnknownField::__anon4
-fixed64	deps/include/google/protobuf/unknown_field_set.h	/^inline uint64 UnknownField::fixed64() const {$/;"	f	class:google::protobuf::UnknownField
-fixed64_	deps/include/google/protobuf/unknown_field_set.h	/^    uint64 fixed64_;$/;"	m	union:google::protobuf::UnknownField::__anon4
-flag_name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string flag_name;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
-float_value	deps/include/google/protobuf/extension_set.h	/^      float                 float_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-fopen64	include/dmlc/base.h	/^#define fopen64 /;"	d
-format	deps/include/google/protobuf/io/gzip_stream.h	/^    Format format;$/;"	m	struct:google::protobuf::io::GzipOutputStream::Options
-format_	deps/include/google/protobuf/io/gzip_stream.h	/^  Format format_;$/;"	m	class:google::protobuf::io::GzipInputStream
-front	include/ps/sarray.h	/^  inline V front() const { CHECK(!empty()); return data()[0]; }$/;"	f	class:ps::SArray
-ftruncate	src/windows/unistd.h	/^#define ftruncate /;"	d
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::Descriptor
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::EnumDescriptor
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::EnumValueDescriptor
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::FieldDescriptor
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::MethodDescriptor
-full_name_	deps/include/google/protobuf/descriptor.h	/^  const string* full_name_;$/;"	m	class:google::protobuf::ServiceDescriptor
-func	deps/include/google/protobuf/extension_set.h	/^    EnumValidityFuncWithArg* func;$/;"	m	struct:google::protobuf::internal::ExtensionInfo::EnumValidityCheck
-function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure0
-function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
-function_	deps/include/google/protobuf/stubs/common.h	/^  FunctionType function_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
-gaierror	tracker/tracker.py	/^        from socket import gaierror$/;"	i
-generate_doxygen_xml	docs/conf.py	/^from sphinx_util import MarkdownParser, AutoStructify, generate_doxygen_xml$/;"	i
-generate_doxygen_xml	docs/sphinx_util.py	/^def generate_doxygen_xml(app):$/;"	f
-generator	deps/include/google/protobuf/compiler/command_line_interface.h	/^    CodeGenerator* generator;   \/\/ NULL for plugins$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
-generator	deps/include/google/protobuf/compiler/command_line_interface.h	/^    CodeGenerator* generator;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
-generator_parameters_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  map<string, string> generator_parameters_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-generators_by_flag_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  GeneratorMap generators_by_flag_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-generators_by_option_name_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  GeneratorMap generators_by_option_name_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-get	deps/include/google/protobuf/stubs/common.h	/^  C* get() const { return ptr_; }$/;"	f	class:google::protobuf::internal::scoped_ptr
-get	deps/include/google/protobuf/stubs/common.h	/^  C* get() const {$/;"	f	class:google::protobuf::internal::scoped_array
-get_customer	include/ps/simple_app.h	/^  virtual inline Customer* get_customer() { return obj_; }$/;"	f	class:ps::SimpleApp
-get_env	tracker/dmlc_ssh.py	/^    def get_env(self, pass_envs):$/;"	m	class:SSHLauncher
-get_header_guard_dmlc	tests/lint.py	/^def get_header_guard_dmlc(filename):$/;"	f
-get_link_map	tracker/tracker.py	/^    def get_link_map(self, nslave):$/;"	m	class:RabitTracker
-get_mpi_env	tracker/dmlc_mpi.py	/^def get_mpi_env(envs):$/;"	f
-get_neighbor	tracker/tracker.py	/^    def get_neighbor(self, rank, nslave):$/;"	m	class:RabitTracker
-get_ring	tracker/tracker.py	/^    def get_ring(self, tree_map, parent_map):$/;"	m	class:RabitTracker
-get_tree	tracker/tracker.py	/^    def get_tree(self, nslave):$/;"	m	class:RabitTracker
-getcwd	src/windows/unistd.h	/^#define getcwd /;"	d
-go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::go_package() const {$/;"	f	class:google::protobuf::FileOptions
-go_package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* go_package_;$/;"	m	class:google::protobuf::FileOptions
-google	deps/include/google/protobuf/compiler/code_generator.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/importer.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/parser.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/plugin.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/descriptor.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/descriptor.pb.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/descriptor_database.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/dynamic_message.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/extension_set.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/generated_message_reflection.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/generated_message_util.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/coded_stream.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/gzip_stream.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/printer.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/tokenizer.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/message.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/message_lite.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/reflection_ops.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/repeated_field.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/service.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/common.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/once.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/template_util.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/stubs/type_traits.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/text_format.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/unknown_field_set.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/wire_format.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/wire_format_lite.h	/^namespace google {$/;"	n
-google	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace google {$/;"	n
-google_opensource	deps/include/google/protobuf/generated_message_reflection.h	/^namespace google_opensource {$/;"	n	namespace:google::upb
-google_opensource	deps/include/google/protobuf/repeated_field.h	/^namespace google_opensource {$/;"	n	namespace:google::upb
-group	deps/include/google/protobuf/unknown_field_set.h	/^inline const UnknownFieldSet& UnknownField::group() const {$/;"	f	class:google::protobuf::UnknownField
-group_	deps/include/google/protobuf/unknown_field_set.h	/^    UnknownFieldSet* group_;$/;"	m	union:google::protobuf::UnknownField::__anon4
-had_error_	deps/include/google/protobuf/io/coded_stream.h	/^  bool had_error_;   \/\/ Whether an error occurred during output.$/;"	m	class:google::protobuf::io::CodedOutputStream
-had_errors_	deps/include/google/protobuf/compiler/parser.h	/^  bool had_errors_;$/;"	m	class:google::protobuf::compiler::Parser
-handle_print	tracker/tracker.py	/^    def handle_print(self,slave, msg):$/;"	m	class:RabitTracker
-has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_aggregate_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumOptions::has_allow_alias() const {$/;"	f	class:google::protobuf::EnumOptions
-has_amd_lock_mb_bug	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^  bool has_amd_lock_mb_bug;  \/\/ Processor has AMD memory-barrier bug; do lfence$/;"	m	struct:google::protobuf::internal::AtomicOps_x86CPUFeatureStruct
-has_bits_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int has_bits_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_cc_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_content() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_ctype() const {$/;"	f	class:google::protobuf::FieldOptions
-has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_default_value() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_default_value_	deps/include/google/protobuf/descriptor.h	/^  bool has_default_value_;$/;"	m	class:google::protobuf::FieldDescriptor
-has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_deprecated() const {$/;"	f	class:google::protobuf::FieldOptions
-has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_double_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto_ExtensionRange::has_end() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse::has_error() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_experimental_map_key() const {$/;"	f	class:google::protobuf::FieldOptions
-has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_extendee() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_go_package() const {$/;"	f	class:google::protobuf::FileOptions
-has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_identifier_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_input_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_insertion_point() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::has_is_extension() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_generate_equals_and_hash() const {$/;"	f	class:google::protobuf::FileOptions
-has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_multiple_files() const {$/;"	f	class:google::protobuf::FileOptions
-has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_outer_classname() const {$/;"	f	class:google::protobuf::FileOptions
-has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_java_package() const {$/;"	f	class:google::protobuf::FileOptions
-has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_label() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_lazy() const {$/;"	f	class:google::protobuf::FieldOptions
-has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline bool SourceCodeInfo_Location::has_leading_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::has_message_set_wire_format() const {$/;"	f	class:google::protobuf::MessageOptions
-has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorResponse_File::has_name() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto::has_name() const {$/;"	f	class:google::protobuf::DescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool ServiceDescriptorProto::has_name() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::has_name_part() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_negative_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::has_no_standard_descriptor_accessor() const {$/;"	f	class:google::protobuf::MessageOptions
-has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_number() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_number() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_optimize_for() const {$/;"	f	class:google::protobuf::FileOptions
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto::has_options() const {$/;"	f	class:google::protobuf::DescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool EnumValueDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline bool ServiceDescriptorProto::has_options() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MethodDescriptorProto::has_output_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_package() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_packed() const {$/;"	f	class:google::protobuf::FieldOptions
-has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline bool CodeGeneratorRequest::has_parameter() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_positive_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::has_py_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileDescriptorProto::has_source_code_info() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-has_sse2	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^  bool has_sse2;             \/\/ Processor has SSE2.$/;"	m	struct:google::protobuf::internal::AtomicOps_x86CPUFeatureStruct
-has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline bool DescriptorProto_ExtensionRange::has_start() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption::has_string_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline bool SourceCodeInfo_Location::has_trailing_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_assign<A[N]>$/;"	s	namespace:google::protobuf::internal
-has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_assign<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
-has_trivial_assign	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_assign : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_constructor<A[N]>$/;"	s	namespace:google::protobuf::internal
-has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_constructor<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
-has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_constructor : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-has_trivial_constructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_constructor<const T>$/;"	s	namespace:google::protobuf::internal
-has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_copy<A[N]>$/;"	s	namespace:google::protobuf::internal
-has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_copy<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
-has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_copy : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-has_trivial_copy	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_copy<const T> : has_trivial_copy<T> { };$/;"	s	namespace:google::protobuf::internal
-has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class A, int N> struct has_trivial_destructor<A[N]>$/;"	s	namespace:google::protobuf::internal
-has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T, class U> struct has_trivial_destructor<std::pair<T, U> >$/;"	s	namespace:google::protobuf::internal
-has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_destructor : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-has_trivial_destructor	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct has_trivial_destructor<const T>$/;"	s	namespace:google::protobuf::internal
-has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_type() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldDescriptorProto::has_type_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::has_weak() const {$/;"	f	class:google::protobuf::FieldOptions
-head	include/ps/internal/message.h	/^  int head;$/;"	m	struct:ps::Meta
-head	include/ps/simple_app.h	/^  int head;$/;"	m	struct:ps::SimpleData
-heartbeat_mu_	include/ps/internal/postoffice.h	/^  std::mutex heartbeat_mu_;$/;"	m	class:ps::Postoffice
-heartbeat_thread_	include/ps/internal/van.h	/^  std::unique_ptr<std::thread> heartbeat_thread_;$/;"	m	class:ps::Van
-heartbeats_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, time_t> heartbeats_;$/;"	m	class:ps::Postoffice
-help	tracker/dmlc_mpi.py	/^                    help = 'command for dmlc program')$/;"	v
-help	tracker/dmlc_mpi.py	/^                    help = 'logging level')$/;"	v
-help	tracker/dmlc_mpi.py	/^                    help = 'number of server nodes to be launched')$/;"	v
-help	tracker/dmlc_mpi.py	/^                    help = 'number of worker proccess to be launched')$/;"	v
-help	tracker/dmlc_mpi.py	/^                    help = 'output log to the specific log file')$/;"	v
-help	tracker/dmlc_mpi.py	/^                    help = 'the hostfile of mpi server')$/;"	v
-help_text	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string help_text;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
-hostname	include/ps/internal/message.h	/^  std::string hostname;$/;"	m	struct:ps::Node
-html_static_path	docs/conf.py	/^html_static_path = ['_static']$/;"	v
-html_theme	docs/conf.py	/^html_theme = 'sphinx_rtd_theme'$/;"	v
-htmlhelp_basename	docs/conf.py	/^htmlhelp_basename = 'ps-litedoc'$/;"	v
-id	include/ps/internal/customer.h	/^  int id() { return id_; }$/;"	f	class:ps::Customer
-id	include/ps/internal/message.h	/^  int id;$/;"	m	struct:ps::Node
-id_	include/ps/internal/customer.h	/^  int id_;$/;"	m	class:ps::Customer
-identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::identifier_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-identifier_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* identifier_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-identity_	deps/include/google/protobuf/stubs/template_util.h	/^struct identity_ {$/;"	s	namespace:google::protobuf::internal
-if_	deps/include/google/protobuf/stubs/template_util.h	/^struct if_<false, A, B> {$/;"	s	namespace:google::protobuf::internal
-if_	deps/include/google/protobuf/stubs/template_util.h	/^struct if_{$/;"	s	namespace:google::protobuf::internal
-impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingInputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::FileInputStream
-impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingInputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::IstreamInputStream
-impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOutputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::FileOutputStream
-impl_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  CopyingOutputStreamAdaptor impl_;$/;"	m	class:google::protobuf::io::OstreamOutputStream
-implicit_cast	deps/include/google/protobuf/stubs/common.h	/^inline To implicit_cast(From const &f) {$/;"	f	namespace:google::protobuf::internal
-imports_in_descriptor_set_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool imports_in_descriptor_set_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-indent_	deps/include/google/protobuf/io/printer.h	/^  string indent_;$/;"	m	class:google::protobuf::io::Printer
-index	deps/include/google/protobuf/descriptor.h	/^inline int Descriptor::index() const {$/;"	f	class:google::protobuf::Descriptor
-index	deps/include/google/protobuf/descriptor.h	/^inline int EnumDescriptor::index() const {$/;"	f	class:google::protobuf::EnumDescriptor
-index	deps/include/google/protobuf/descriptor.h	/^inline int EnumValueDescriptor::index() const {$/;"	f	class:google::protobuf::EnumValueDescriptor
-index	deps/include/google/protobuf/descriptor.h	/^inline int FieldDescriptor::index() const {$/;"	f	class:google::protobuf::FieldDescriptor
-index	deps/include/google/protobuf/descriptor.h	/^inline int MethodDescriptor::index() const {$/;"	f	class:google::protobuf::MethodDescriptor
-index	deps/include/google/protobuf/descriptor.h	/^inline int ServiceDescriptor::index() const {$/;"	f	class:google::protobuf::ServiceDescriptor
-index_	deps/include/google/protobuf/descriptor_database.h	/^  DescriptorIndex<const FileDescriptorProto*> index_;$/;"	m	class:google::protobuf::SimpleDescriptorDatabase
-index_	deps/include/google/protobuf/descriptor_database.h	/^  SimpleDescriptorDatabase::DescriptorIndex<pair<const void*, int> > index_;$/;"	m	class:google::protobuf::EncodedDescriptorDatabase
-initial_indent_level_	deps/include/google/protobuf/text_format.h	/^    int initial_indent_level_;$/;"	m	class:google::protobuf::TextFormat::Printer
-input	deps/include/google/protobuf/wire_format_lite.h	/^#define input /;"	d
-input	deps/include/google/protobuf/wire_format_lite.h	/^#undef input$/;"	d
-input_	deps/include/google/protobuf/compiler/parser.h	/^  io::Tokenizer* input_;$/;"	m	class:google::protobuf::compiler::Parser
-input_	deps/include/google/protobuf/io/coded_stream.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::CodedInputStream
-input_	deps/include/google/protobuf/io/tokenizer.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::Tokenizer
-input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    istream* input_;$/;"	m	class:google::protobuf::io::IstreamInputStream::CopyingIstreamInputStream
-input_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  ZeroCopyInputStream* input_;$/;"	m	class:google::protobuf::io::LimitingInputStream
-input_buffer_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* input_buffer_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-input_buffer_length_	deps/include/google/protobuf/io/gzip_stream.h	/^  size_t input_buffer_length_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-input_files_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<string> input_files_;                \/\/ Names of the input proto files.$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::input_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-input_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* input_type_;$/;"	m	class:google::protobuf::MethodDescriptor
-input_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* input_type_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-inputs_are_proto_path_relative_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool inputs_are_proto_path_relative_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::insertion_point() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-insertion_point_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* insertion_point_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-int16	deps/include/google/protobuf/stubs/common.h	/^typedef __int16 int16;$/;"	t	namespace:google::protobuf
-int16	deps/include/google/protobuf/stubs/common.h	/^typedef int16_t int16;$/;"	t	namespace:google::protobuf
-int16_t	include/dmlc/base.h	/^typedef __int16 int16_t;$/;"	t
-int16_t	include/ps/internal/utils.h	/^typedef __int16          int16_t;$/;"	t	namespace:ps
-int32	deps/include/google/protobuf/stubs/common.h	/^typedef __int32 int32;$/;"	t	namespace:google::protobuf
-int32	deps/include/google/protobuf/stubs/common.h	/^typedef int32_t int32;$/;"	t	namespace:google::protobuf
-int32_t	include/dmlc/base.h	/^typedef __int32 int32_t;$/;"	t
-int32_t	include/ps/internal/utils.h	/^typedef __int32          int32_t;$/;"	t	namespace:ps
-int32_value	deps/include/google/protobuf/extension_set.h	/^      int32                 int32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-int64	deps/include/google/protobuf/stubs/common.h	/^typedef __int64 int64;$/;"	t	namespace:google::protobuf
-int64	deps/include/google/protobuf/stubs/common.h	/^typedef int64_t int64;$/;"	t	namespace:google::protobuf
-int64_t	include/dmlc/base.h	/^typedef __int64 int64_t;$/;"	t
-int64_t	include/ps/internal/utils.h	/^typedef __int64          int64_t;$/;"	t	namespace:ps
-int64_value	deps/include/google/protobuf/extension_set.h	/^      int64                 int64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-int8	deps/include/google/protobuf/stubs/common.h	/^typedef __int8  int8;$/;"	t	namespace:google::protobuf
-int8	deps/include/google/protobuf/stubs/common.h	/^typedef int8_t  int8;$/;"	t	namespace:google::protobuf
-int8_t	include/dmlc/base.h	/^typedef signed char int8_t;$/;"	t
-int8_t	include/ps/internal/utils.h	/^typedef signed char      int8_t;$/;"	t	namespace:ps
-integral_constant	deps/include/google/protobuf/stubs/template_util.h	/^struct integral_constant {$/;"	s	namespace:google::protobuf::internal
-interface	src/network_utils.h	/^#undef interface$/;"	d
-internal	deps/include/google/protobuf/extension_set.h	/^  namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/extension_set.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/generated_message_reflection.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/generated_message_util.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/reflection_ops.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/repeated_field.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/common.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/template_util.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/type_traits.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/stubs/type_traits.h	/^namespace internal {$/;"	n	namespace:google::protobuf::internal
-internal	deps/include/google/protobuf/unknown_field_set.h	/^  namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/wire_format.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/wire_format_lite.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace internal {$/;"	n	namespace:google::protobuf
-internal_set_underlay	deps/include/google/protobuf/descriptor.h	/^  void internal_set_underlay(const DescriptorPool* underlay) {$/;"	f	class:google::protobuf::DescriptorPool
-io	deps/include/google/protobuf/compiler/code_generator.h	/^namespace io { class ZeroCopyOutputStream; }$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/compiler/importer.h	/^namespace io { class ZeroCopyInputStream; }$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace io { class Printer; }$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/extension_set.h	/^  namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/coded_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/gzip_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/printer.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/tokenizer.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/message.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/message_lite.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/text_format.h	/^namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/unknown_field_set.h	/^  namespace io {$/;"	n	namespace:google::protobuf
-io	deps/include/google/protobuf/wire_format.h	/^  namespace io {$/;"	n	namespace:google::protobuf
-is_class_or_union	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_class_or_union {$/;"	s	namespace:google::protobuf::internal::internal
-is_cleared	deps/include/google/protobuf/extension_set.h	/^    bool is_cleared : 4;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-is_closed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool is_closed_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-is_closed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool is_closed_;$/;"	m	class:google::protobuf::io::FileOutputStream::CopyingFileOutputStream
-is_convertible	deps/include/google/protobuf/stubs/type_traits.h	/^struct is_convertible$/;"	s	namespace:google::protobuf::internal
-is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum$/;"	s	namespace:google::protobuf::internal
-is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<const T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
-is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<const volatile T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
-is_enum	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum<volatile T> : is_enum<T> { };$/;"	s	namespace:google::protobuf::internal
-is_enum_impl	deps/include/google/protobuf/stubs/type_traits.h	/^template <bool NotUnum, class T> struct is_enum_impl$/;"	s	namespace:google::protobuf::internal::internal
-is_enum_impl	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_enum_impl<true, T> : false_type { };$/;"	s	namespace:google::protobuf::internal::internal
-is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline bool UninterpretedOption_NamePart::is_extension() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-is_extension_	deps/include/google/protobuf/descriptor.h	/^  bool is_extension_;$/;"	m	class:google::protobuf::FieldDescriptor
-is_extension_	deps/include/google/protobuf/descriptor.pb.h	/^  bool is_extension_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point : false_type { };$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<const T>$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<const volatile T>$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_floating_point<volatile T>$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<double> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<float> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_floating_point	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_floating_point<long double> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral : false_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<const T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<const volatile T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_integral<volatile T> : is_integral<T> { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<__wchar_t> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<bool> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<char> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<int> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<long long> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<long> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<short> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<signed char> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned char> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned int> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned long long> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned long> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<unsigned short> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_integral	deps/include/google/protobuf/stubs/type_traits.h	/^template<> struct is_integral<wchar_t> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_lazy	deps/include/google/protobuf/extension_set.h	/^    bool is_lazy : 4;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-is_optional	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_optional() const {$/;"	f	class:google::protobuf::FieldDescriptor
-is_packable	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_packable() const {$/;"	f	class:google::protobuf::FieldDescriptor
-is_packed	deps/include/google/protobuf/extension_set.h	/^    bool is_packed;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-is_packed	deps/include/google/protobuf/extension_set.h	/^  bool is_packed;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
-is_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_placeholder_;$/;"	m	class:google::protobuf::Descriptor
-is_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_placeholder_;$/;"	m	class:google::protobuf::EnumDescriptor
-is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod$/;"	s	namespace:google::protobuf::internal
-is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<const T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<const volatile T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-is_pod	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pod<volatile T> : is_pod<T> { };$/;"	s	namespace:google::protobuf::internal
-is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer : false_type { };$/;"	s	namespace:google::protobuf::internal
-is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<T*> : true_type { };$/;"	s	namespace:google::protobuf::internal
-is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<const T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
-is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<const volatile T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
-is_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template <class T> struct is_pointer<volatile T> : is_pointer<T> { };$/;"	s	namespace:google::protobuf::internal
-is_recovery	include/ps/internal/message.h	/^  bool is_recovery;$/;"	m	struct:ps::Node
-is_recovery	include/ps/internal/postoffice.h	/^  bool is_recovery() const { return van_->my_node().is_recovery; }$/;"	f	class:ps::Postoffice
-is_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_reference : false_type {};$/;"	s	namespace:google::protobuf::internal
-is_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_reference<T&> : true_type {};$/;"	s	namespace:google::protobuf::internal
-is_repeated	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_repeated() const {$/;"	f	class:google::protobuf::FieldDescriptor
-is_repeated	deps/include/google/protobuf/extension_set.h	/^    bool is_repeated;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-is_repeated	deps/include/google/protobuf/extension_set.h	/^  bool is_repeated;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
-is_required	deps/include/google/protobuf/descriptor.h	/^inline bool FieldDescriptor::is_required() const {$/;"	f	class:google::protobuf::FieldDescriptor
-is_same	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T, typename U> struct is_same : public false_type { };$/;"	s	namespace:google::protobuf::internal
-is_same	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct is_same<T, T> : public true_type { };$/;"	s	namespace:google::protobuf::internal
-is_scheduler	include/ps/internal/postoffice.h	/^  int is_scheduler() const { return is_scheduler_; }$/;"	f	class:ps::Postoffice
-is_scheduler_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
-is_scheduler_	include/ps/internal/van.h	/^  bool is_scheduler_;$/;"	m	class:ps::Van
-is_server	include/ps/internal/postoffice.h	/^  int is_server() const { return is_server_; }$/;"	f	class:ps::Postoffice
-is_server_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
-is_unqualified_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_unqualified_placeholder_;$/;"	m	class:google::protobuf::Descriptor
-is_unqualified_placeholder_	deps/include/google/protobuf/descriptor.h	/^  bool is_unqualified_placeholder_;$/;"	m	class:google::protobuf::EnumDescriptor
-is_worker	include/ps/internal/postoffice.h	/^  int is_worker() const { return is_worker_; }$/;"	f	class:ps::Postoffice
-is_worker_	include/ps/internal/postoffice.h	/^  bool is_worker_, is_server_, is_scheduler_;$/;"	m	class:ps::Postoffice
-isatty	src/windows/unistd.h	/^#define isatty /;"	d
-it_	deps/include/google/protobuf/repeated_field.h	/^  VoidPtr* it_;$/;"	m	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-it_	deps/include/google/protobuf/repeated_field.h	/^  void* const* it_;$/;"	m	class:google::protobuf::internal::RepeatedPtrIterator
-iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef Element* iterator;$/;"	t	class:google::protobuf::RepeatedField
-iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef RepeatedPtrIterator<Element> iterator;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
-iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef RepeatedPtrOverPtrsIterator<Element, VoidPtr> iterator;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef internal::RepeatedPtrIterator<Element> iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-java	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace java {$/;"	n	namespace:google::protobuf::compiler
-java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_generate_equals_and_hash() const {$/;"	f	class:google::protobuf::FileOptions
-java_generate_equals_and_hash_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_generate_equals_and_hash_;$/;"	m	class:google::protobuf::FileOptions
-java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-java_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_generic_services_;$/;"	m	class:google::protobuf::FileOptions
-java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::java_multiple_files() const {$/;"	f	class:google::protobuf::FileOptions
-java_multiple_files_	deps/include/google/protobuf/descriptor.pb.h	/^  bool java_multiple_files_;$/;"	m	class:google::protobuf::FileOptions
-java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::java_outer_classname() const {$/;"	f	class:google::protobuf::FileOptions
-java_outer_classname_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* java_outer_classname_;$/;"	m	class:google::protobuf::FileOptions
-java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileOptions::java_package() const {$/;"	f	class:google::protobuf::FileOptions
-java_package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* java_package_;$/;"	m	class:google::protobuf::FileOptions
-join	tracker/tracker.py	/^    def join(self):$/;"	m	class:PSTracker
-join	tracker/tracker.py	/^    def join(self):$/;"	m	class:RabitTracker
-kAggregateValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kAggregateValueFieldNumber = 8;$/;"	m	class:google::protobuf::UninterpretedOption
-kAllowAliasFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kAllowAliasFieldNumber = 2;$/;"	m	class:google::protobuf::EnumOptions
-kBarrierGroupFieldNumber	src/meta.pb.cc	/^const int PBControl::kBarrierGroupFieldNumber;$/;"	m	class:ps::PBControl	file:
-kBodyFieldNumber	src/meta.pb.cc	/^const int PBMeta::kBodyFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kBoolSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kBoolSize     = 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kCcGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kCcGenericServicesFieldNumber = 16;$/;"	m	class:google::protobuf::FileOptions
-kCmdFieldNumber	src/meta.pb.cc	/^const int PBControl::kCmdFieldNumber;$/;"	m	class:ps::PBControl	file:
-kContentFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kContentFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-kControlFieldNumber	src/meta.pb.cc	/^const int PBMeta::kControlFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kCppTypeToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kCppTypeToName[MAX_CPPTYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
-kCtypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kCtypeFieldNumber = 1;$/;"	m	class:google::protobuf::FieldOptions
-kCustomerIdFieldNumber	src/meta.pb.cc	/^const int PBMeta::kCustomerIdFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kDataTypeFieldNumber	src/meta.pb.cc	/^const int PBMeta::kDataTypeFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kDefaultHeartbeatInterval	src/van.cc	/^static const int kDefaultHeartbeatInterval = 0;$/;"	m	namespace:ps	file:
-kDefaultTotalBytesLimit	deps/include/google/protobuf/io/coded_stream.h	/^  static const int kDefaultTotalBytesLimit = 64 << 20;  \/\/ 64MB$/;"	m	class:google::protobuf::io::CodedInputStream
-kDefaultTotalBytesWarningThreshold	deps/include/google/protobuf/io/coded_stream.h	/^  static const int kDefaultTotalBytesWarningThreshold = 32 << 20;  \/\/ 32MB$/;"	m	class:google::protobuf::io::CodedInputStream
-kDefaultValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDefaultValueFieldNumber = 7;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDependencyFieldNumber = 3;$/;"	m	class:google::protobuf::FileDescriptorProto
-kDeprecatedFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDeprecatedFieldNumber = 3;$/;"	m	class:google::protobuf::FieldOptions
-kDoubleSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kDoubleSize   = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kDoubleValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kDoubleValueFieldNumber = 6;$/;"	m	class:google::protobuf::UninterpretedOption
-kEmpty	include/ps/internal/message.h	/^  static const int kEmpty;$/;"	m	struct:ps::Meta
-kEmpty	include/ps/internal/message.h	/^  static const int kEmpty;$/;"	m	struct:ps::Node
-kEmpty	src/customer.cc	/^const int Meta::kEmpty = std::numeric_limits<int>::max();$/;"	m	class:ps::Meta	file:
-kEmpty	src/customer.cc	/^const int Node::kEmpty = std::numeric_limits<int>::max();$/;"	m	class:ps::Node	file:
-kEndFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEndFieldNumber = 2;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-kEnumTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEnumTypeFieldNumber = 4;$/;"	m	class:google::protobuf::DescriptorProto
-kEnumTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kEnumTypeFieldNumber = 5;$/;"	m	class:google::protobuf::FileDescriptorProto
-kErrorFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kErrorFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-kExperimentalMapKeyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExperimentalMapKeyFieldNumber = 9;$/;"	m	class:google::protobuf::FieldOptions
-kExtendeeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtendeeFieldNumber = 2;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionFieldNumber = 6;$/;"	m	class:google::protobuf::DescriptorProto
-kExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionFieldNumber = 7;$/;"	m	class:google::protobuf::FileDescriptorProto
-kExtensionRangeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kExtensionRangeFieldNumber = 5;$/;"	m	class:google::protobuf::DescriptorProto
-kFieldFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kFieldFieldNumber = 2;$/;"	m	class:google::protobuf::DescriptorProto
-kFieldTypeToCppTypeMap	deps/include/google/protobuf/wire_format_lite.h	/^  static const CppType kFieldTypeToCppTypeMap[];$/;"	m	class:google::protobuf::internal::WireFormatLite
-kFileFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kFileFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse
-kFileFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kFileFieldNumber = 1;$/;"	m	class:google::protobuf::FileDescriptorSet
-kFileToGenerateFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kFileToGenerateFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-kFirstReservedNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kFirstReservedNumber = 19000;$/;"	m	class:google::protobuf::FieldDescriptor
-kFixed32Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFixed32Size  = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kFixed64Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFixed64Size  = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kFloatSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kFloatSize    = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kGoPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kGoPackageFieldNumber = 11;$/;"	m	class:google::protobuf::FileOptions
-kHeadFieldNumber	src/meta.pb.cc	/^const int PBMeta::kHeadFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kHostnameFieldNumber	src/meta.pb.cc	/^const int PBNode::kHostnameFieldNumber;$/;"	m	class:ps::PBNode	file:
-kIdFieldNumber	src/meta.pb.cc	/^const int PBNode::kIdFieldNumber;$/;"	m	class:ps::PBNode	file:
-kIdentifierValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kIdentifierValueFieldNumber = 3;$/;"	m	class:google::protobuf::UninterpretedOption
-kInitialSize	deps/include/google/protobuf/repeated_field.h	/^  static const int kInitialSize = 0;$/;"	m	class:google::protobuf::RepeatedField
-kInitialSize	deps/include/google/protobuf/repeated_field.h	/^  static const int kInitialSize = 0;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
-kInputTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kInputTypeFieldNumber = 2;$/;"	m	class:google::protobuf::MethodDescriptorProto
-kInsertionPointFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kInsertionPointFieldNumber = 2;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-kIsExtensionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kIsExtensionFieldNumber = 2;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-kIsRecoveryFieldNumber	src/meta.pb.cc	/^const int PBNode::kIsRecoveryFieldNumber;$/;"	m	class:ps::PBNode	file:
-kJavaGenerateEqualsAndHashFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaGenerateEqualsAndHashFieldNumber = 20;$/;"	m	class:google::protobuf::FileOptions
-kJavaGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaGenericServicesFieldNumber = 17;$/;"	m	class:google::protobuf::FileOptions
-kJavaMultipleFilesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaMultipleFilesFieldNumber = 10;$/;"	m	class:google::protobuf::FileOptions
-kJavaOuterClassnameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaOuterClassnameFieldNumber = 8;$/;"	m	class:google::protobuf::FileOptions
-kJavaPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kJavaPackageFieldNumber = 1;$/;"	m	class:google::protobuf::FileOptions
-kLabelFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLabelFieldNumber = 4;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kLabelToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kLabelToName[MAX_LABEL + 1];$/;"	m	class:google::protobuf::FieldDescriptor
-kLastReservedNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kLastReservedNumber  = 19999;$/;"	m	class:google::protobuf::FieldDescriptor
-kLazyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLazyFieldNumber = 5;$/;"	m	class:google::protobuf::FieldOptions
-kLeadingCommentsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLeadingCommentsFieldNumber = 3;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-kLocationFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kLocationFieldNumber = 1;$/;"	m	class:google::protobuf::SourceCodeInfo
-kMagic	tracker/tracker.py	/^kMagic = 0xff99$/;"	v
-kMaxKey	include/ps/base.h	/^static const Key kMaxKey = std::numeric_limits<Key>::max();$/;"	m	namespace:ps
-kMaxNumber	deps/include/google/protobuf/descriptor.h	/^  static const int kMaxNumber = (1 << 29) - 1;$/;"	m	class:google::protobuf::FieldDescriptor
-kMessageSetItemEndTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemEndTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetItemNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemNumber = 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetItemStartTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemStartTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetItemTagsSize	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetItemTagsSize;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetMessageNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetMessageNumber = 3;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetMessageTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetMessageTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetTypeIdNumber	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetTypeIdNumber = 2;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetTypeIdTag	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kMessageSetTypeIdTag =$/;"	m	class:google::protobuf::internal::WireFormatLite
-kMessageSetWireFormatFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMessageSetWireFormatFieldNumber = 1;$/;"	m	class:google::protobuf::MessageOptions
-kMessageTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMessageTypeFieldNumber = 4;$/;"	m	class:google::protobuf::FileDescriptorProto
-kMethodFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kMethodFieldNumber = 2;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-kMinHeaderVersionForLibrary	deps/include/google/protobuf/stubs/common.h	/^static const int kMinHeaderVersionForLibrary = 2005000;$/;"	m	namespace:google::protobuf::internal
-kMinHeaderVersionForProtoc	deps/include/google/protobuf/stubs/common.h	/^static const int kMinHeaderVersionForProtoc = 2005000;$/;"	m	namespace:google::protobuf::internal
-kMinRepeatedFieldAllocationSize	deps/include/google/protobuf/repeated_field.h	/^static const int kMinRepeatedFieldAllocationSize = 4;$/;"	m	namespace:google::protobuf::internal
-kMinimumSize	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  static const int kMinimumSize = 16;$/;"	m	class:google::protobuf::io::StringOutputStream
-kMsgSigFieldNumber	src/meta.pb.cc	/^const int PBControl::kMsgSigFieldNumber;$/;"	m	class:ps::PBControl	file:
-kNameFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::DescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::EnumDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::FileDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::MethodDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 1;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-kNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNameFieldNumber = 2;$/;"	m	class:google::protobuf::UninterpretedOption
-kNamePartFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNamePartFieldNumber = 1;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-kNegativeIntValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNegativeIntValueFieldNumber = 5;$/;"	m	class:google::protobuf::UninterpretedOption
-kNestedTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNestedTypeFieldNumber = 3;$/;"	m	class:google::protobuf::DescriptorProto
-kNoStandardDescriptorAccessorFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNoStandardDescriptorAccessorFieldNumber = 2;$/;"	m	class:google::protobuf::MessageOptions
-kNodeFieldNumber	src/meta.pb.cc	/^const int PBControl::kNodeFieldNumber;$/;"	m	class:ps::PBControl	file:
-kNumberFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNumberFieldNumber = 2;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-kNumberFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kNumberFieldNumber = 3;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kOptimizeForFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptimizeForFieldNumber = 9;$/;"	m	class:google::protobuf::FileOptions
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::EnumDescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 3;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 4;$/;"	m	class:google::protobuf::MethodDescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 7;$/;"	m	class:google::protobuf::DescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 8;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kOptionsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOptionsFieldNumber = 8;$/;"	m	class:google::protobuf::FileDescriptorProto
-kOutputTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kOutputTypeFieldNumber = 3;$/;"	m	class:google::protobuf::MethodDescriptorProto
-kPackageFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPackageFieldNumber = 2;$/;"	m	class:google::protobuf::FileDescriptorProto
-kPackedFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPackedFieldNumber = 2;$/;"	m	class:google::protobuf::FieldOptions
-kParameterFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kParameterFieldNumber = 2;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-kPathFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPathFieldNumber = 1;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-kPortFieldNumber	src/meta.pb.cc	/^const int PBNode::kPortFieldNumber;$/;"	m	class:ps::PBNode	file:
-kPositiveIntValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPositiveIntValueFieldNumber = 4;$/;"	m	class:google::protobuf::UninterpretedOption
-kProtoFileFieldNumber	deps/include/google/protobuf/compiler/plugin.pb.h	/^  static const int kProtoFileFieldNumber = 15;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-kPublicDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPublicDependencyFieldNumber = 10;$/;"	m	class:google::protobuf::FileDescriptorProto
-kPushFieldNumber	src/meta.pb.cc	/^const int PBMeta::kPushFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kPyGenericServicesFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kPyGenericServicesFieldNumber = 18;$/;"	m	class:google::protobuf::FileOptions
-kRequestFieldNumber	src/meta.pb.cc	/^const int PBMeta::kRequestFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kRoleFieldNumber	src/meta.pb.cc	/^const int PBNode::kRoleFieldNumber;$/;"	m	class:ps::PBNode	file:
-kSFixed32Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kSFixed32Size = 4;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kSFixed64Size	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kSFixed64Size = 8;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kScheduler	include/ps/base.h	/^static const int kScheduler = 1;$/;"	m	namespace:ps
-kServerGroup	include/ps/base.h	/^static const int kServerGroup = 2;$/;"	m	namespace:ps
-kServiceFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kServiceFieldNumber = 6;$/;"	m	class:google::protobuf::FileDescriptorProto
-kSimpleAppFieldNumber	src/meta.pb.cc	/^const int PBMeta::kSimpleAppFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kSourceCodeInfoFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kSourceCodeInfoFieldNumber = 9;$/;"	m	class:google::protobuf::FileDescriptorProto
-kSpanFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kSpanFieldNumber = 2;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-kStartFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kStartFieldNumber = 1;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-kStringValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kStringValueFieldNumber = 7;$/;"	m	class:google::protobuf::UninterpretedOption
-kTabWidth	deps/include/google/protobuf/io/tokenizer.h	/^  static const int kTabWidth = 8;$/;"	m	class:google::protobuf::io::Tokenizer
-kTagTypeBits	deps/include/google/protobuf/wire_format_lite.h	/^  static const int kTagTypeBits = 3;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kTagTypeMask	deps/include/google/protobuf/wire_format_lite.h	/^  static const uint32 kTagTypeMask = (1 << kTagTypeBits) - 1;$/;"	m	class:google::protobuf::internal::WireFormatLite
-kTimestampFieldNumber	src/meta.pb.cc	/^const int PBMeta::kTimestampFieldNumber;$/;"	m	class:ps::PBMeta	file:
-kTrailingCommentsFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTrailingCommentsFieldNumber = 4;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-kTypeFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTypeFieldNumber = 5;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kTypeNameFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kTypeNameFieldNumber = 6;$/;"	m	class:google::protobuf::FieldDescriptorProto
-kTypeToCppTypeMap	deps/include/google/protobuf/descriptor.h	/^  static const CppType kTypeToCppTypeMap[MAX_TYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
-kTypeToName	deps/include/google/protobuf/descriptor.h	/^  static const char * const kTypeToName[MAX_TYPE + 1];$/;"	m	class:google::protobuf::FieldDescriptor
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::EnumOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::EnumValueOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::FieldOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::FileOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::MessageOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::MethodOptions
-kUninterpretedOptionFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kUninterpretedOptionFieldNumber = 999;$/;"	m	class:google::protobuf::ServiceOptions
-kValueFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kValueFieldNumber = 2;$/;"	m	class:google::protobuf::EnumDescriptorProto
-kWeakDependencyFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kWeakDependencyFieldNumber = 11;$/;"	m	class:google::protobuf::FileDescriptorProto
-kWeakFieldNumber	deps/include/google/protobuf/descriptor.pb.h	/^  static const int kWeakFieldNumber = 10;$/;"	m	class:google::protobuf::FieldOptions
-kWireTypeForFieldType	deps/include/google/protobuf/wire_format_lite.h	/^  static const WireFormatLite::WireType kWireTypeForFieldType[];$/;"	m	class:google::protobuf::internal::WireFormatLite
-kWorkerGroup	include/ps/base.h	/^static const int kWorkerGroup = 4;$/;"	m	namespace:ps
-keys	include/ps/kv_app.h	/^  SArray<Key> keys;$/;"	m	struct:ps::KVPairs
-kint32max	deps/include/google/protobuf/stubs/common.h	/^static const int32 kint32max = 0x7FFFFFFF;$/;"	m	namespace:google::protobuf
-kint32min	deps/include/google/protobuf/stubs/common.h	/^static const int32 kint32min = -kint32max - 1;$/;"	m	namespace:google::protobuf
-kint64max	deps/include/google/protobuf/stubs/common.h	/^static const int64 kint64max = GOOGLE_LONGLONG(0x7FFFFFFFFFFFFFFF);$/;"	m	namespace:google::protobuf
-kint64min	deps/include/google/protobuf/stubs/common.h	/^static const int64 kint64min = -kint64max - 1;$/;"	m	namespace:google::protobuf
-kuint32max	deps/include/google/protobuf/stubs/common.h	/^static const uint32 kuint32max = 0xFFFFFFFFu;$/;"	m	namespace:google::protobuf
-kuint64max	deps/include/google/protobuf/stubs/common.h	/^static const uint64 kuint64max = GOOGLE_ULONGLONG(0xFFFFFFFFFFFFFFFF);$/;"	m	namespace:google::protobuf
-kvs	include/ps/internal/env.h	/^  std::unordered_map<std::string, std::string> kvs;$/;"	m	class:ps::Environment
-label	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto_Label FieldDescriptorProto::label() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-label_	deps/include/google/protobuf/descriptor.h	/^  Label label_;$/;"	m	class:google::protobuf::FieldDescriptor
-label_	deps/include/google/protobuf/descriptor.pb.h	/^  int label_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-language	docs/conf.py	/^language = None$/;"	v
-last_returned_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int last_returned_size_;   \/\/ How many bytes we returned last time Next()$/;"	m	class:google::protobuf::io::ArrayInputStream
-last_returned_size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int last_returned_size_;   \/\/ How many bytes we returned last time Next()$/;"	m	class:google::protobuf::io::ArrayOutputStream
-last_tag_	deps/include/google/protobuf/io/coded_stream.h	/^  uint32 last_tag_;         \/\/ result of last ReadTag().$/;"	m	class:google::protobuf::io::CodedInputStream
-latex_documents	docs/conf.py	/^latex_documents = [$/;"	v
-latex_elements	docs/conf.py	/^latex_elements = {$/;"	v
-lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::lazy() const {$/;"	f	class:google::protobuf::FieldOptions
-lazy_	deps/include/google/protobuf/descriptor.pb.h	/^  bool lazy_;$/;"	m	class:google::protobuf::FieldOptions
-lazymessage_value	deps/include/google/protobuf/extension_set.h	/^      LazyMessageExtension* lazymessage_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-leading_comments	deps/include/google/protobuf/descriptor.h	/^  string leading_comments;$/;"	m	struct:google::protobuf::SourceLocation
-leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& SourceCodeInfo_Location::leading_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-leading_comments_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* leading_comments_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-legitimate_message_end_	deps/include/google/protobuf/io/coded_stream.h	/^  bool legitimate_message_end_;$/;"	m	class:google::protobuf::io::CodedInputStream
-length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline const string& UnknownField::length_delimited() const {$/;"	f	class:google::protobuf::UnknownField
-length_delimited_	deps/include/google/protobuf/unknown_field_set.h	/^    } length_delimited_;$/;"	m	union:google::protobuf::UnknownField::__anon4	typeref:union:google::protobuf::UnknownField::__anon4::__anon5
-lens	include/ps/kv_app.h	/^  SArray<int> lens;$/;"	m	struct:ps::KVPairs
-level_	deps/include/google/protobuf/stubs/common.h	/^  LogLevel level_;$/;"	m	class:google::protobuf::internal::LogMessage
-limit_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int64 limit_;  \/\/ Decreases as we go, becomes negative if we overshoot.$/;"	m	class:google::protobuf::io::LimitingInputStream
-line	deps/include/google/protobuf/io/tokenizer.h	/^    int line;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
-line	deps/include/google/protobuf/stubs/common.h	/^  int line() const { return line_; }$/;"	f	class:google::protobuf::FatalException
-line	deps/include/google/protobuf/text_format.h	/^    int line;$/;"	m	struct:google::protobuf::TextFormat::ParseLocation
-line_	deps/include/google/protobuf/io/tokenizer.h	/^  int line_;$/;"	m	class:google::protobuf::io::Tokenizer
-line_	deps/include/google/protobuf/stubs/common.h	/^  const int line_;$/;"	m	class:google::protobuf::FatalException
-line_	deps/include/google/protobuf/stubs/common.h	/^  int line_;$/;"	m	class:google::protobuf::internal::LogMessage
-location	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo::location() const {$/;"	f	class:google::protobuf::SourceCodeInfo
-location	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::SourceCodeInfo_Location& SourceCodeInfo::location(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo
-location_	deps/include/google/protobuf/compiler/parser.h	/^    SourceCodeInfo::Location* location_;$/;"	m	class:google::protobuf::compiler::Parser::LocationRecorder
-location_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::SourceCodeInfo_Location > location_;$/;"	m	class:google::protobuf::SourceCodeInfo
-location_map_	deps/include/google/protobuf/compiler/parser.h	/^  LocationMap location_map_;$/;"	m	class:google::protobuf::compiler::SourceLocationTable
-location_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo::location_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo
-locations_	deps/include/google/protobuf/text_format.h	/^    LocationMap locations_;$/;"	m	class:google::protobuf::TextFormat::ParseInfoTree
-logging	tracker/dmlc_local.py	/^import logging$/;"	i
-logging	tracker/dmlc_ssh.py	/^import logging$/;"	i
-logging	tracker/tracker.py	/^import logging$/;"	i
-lowercase_name_	deps/include/google/protobuf/descriptor.h	/^  const string* lowercase_name_;$/;"	m	class:google::protobuf::FieldDescriptor
-lseek	src/windows/unistd.h	/^#define lseek /;"	d
-mInternal	deps/include/google/protobuf/stubs/common.h	/^  Internal* mInternal;$/;"	m	class:google::protobuf::internal::Mutex
-main	tests/lint.py	/^def main():$/;"	f
-main	tests/test_connection.cc	/^int main(int argc, char *argv[]) {$/;"	f
-main	tests/test_kv_app.cc	/^int main(int argc, char *argv[]) {$/;"	f
-main	tests/test_simple_app.cc	/^int main(int argc, char *argv[]) {$/;"	f
-main	tracker/dmlc_local.py	/^def main():$/;"	f
-main	tracker/dmlc_ssh.py	/^def main():$/;"	f
-man_pages	docs/conf.py	/^man_pages = [$/;"	v
-mappings_	deps/include/google/protobuf/compiler/importer.h	/^  vector<Mapping> mappings_;$/;"	m	class:google::protobuf::compiler::DiskSourceTree
-master_doc	docs/conf.py	/^master_doc = 'index'$/;"	v
-max	include/ps/internal/postoffice.h	/^#undef max$/;"	d
-max_num_retry_	src/resender.h	/^  int max_num_retry_;$/;"	m	class:ps::Resender
-message	deps/include/google/protobuf/stubs/common.h	/^  const std::string& message() const { return message_; }$/;"	f	class:google::protobuf::FatalException
-message_	deps/include/google/protobuf/stubs/common.h	/^  const std::string message_;$/;"	m	class:google::protobuf::FatalException
-message_	deps/include/google/protobuf/stubs/common.h	/^  std::string message_;$/;"	m	class:google::protobuf::internal::LogMessage
-message_factory_	deps/include/google/protobuf/generated_message_reflection.h	/^  MessageFactory* message_factory_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-message_prototype	deps/include/google/protobuf/extension_set.h	/^    const MessageLite* message_prototype;$/;"	m	union:google::protobuf::internal::ExtensionInfo::__anon2
-message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::message_set_wire_format() const {$/;"	f	class:google::protobuf::MessageOptions
-message_set_wire_format_	deps/include/google/protobuf/descriptor.pb.h	/^  bool message_set_wire_format_;$/;"	m	class:google::protobuf::MessageOptions
-message_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::message_type() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto& FileDescriptorProto::message_type(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-message_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* message_type_;$/;"	m	class:google::protobuf::FieldDescriptor
-message_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > message_type_;$/;"	m	class:google::protobuf::FileDescriptorProto
-message_type_count_	deps/include/google/protobuf/descriptor.h	/^  int message_type_count_;$/;"	m	class:google::protobuf::FileDescriptor
-message_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::message_type_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-message_types_	deps/include/google/protobuf/descriptor.h	/^  Descriptor* message_types_;$/;"	m	class:google::protobuf::FileDescriptor
-message_value	deps/include/google/protobuf/extension_set.h	/^      MessageLite*          message_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-meta	include/ps/internal/message.h	/^  Meta meta;$/;"	m	struct:ps::Message
-method	deps/include/google/protobuf/descriptor.pb.h	/^ServiceDescriptorProto::method() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-method	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MethodDescriptorProto& ServiceDescriptorProto::method(int index) const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-method_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::MethodDescriptorProto > method_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure0
-method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure1
-method_	deps/include/google/protobuf/stubs/common.h	/^  MethodType method_;$/;"	m	class:google::protobuf::internal::MethodClosure2
-method_count_	deps/include/google/protobuf/descriptor.h	/^  int method_count_;$/;"	m	class:google::protobuf::ServiceDescriptor
-method_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int ServiceDescriptorProto::method_size() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-methods_	deps/include/google/protobuf/descriptor.h	/^  MethodDescriptor* methods_;$/;"	m	class:google::protobuf::ServiceDescriptor
-mode_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  Mode mode_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-monitor_	src/resender.h	/^  std::thread* monitor_;$/;"	m	class:ps::Resender
-mpi_submit	tracker/dmlc_mpi.py	/^def mpi_submit(nworker, nserver, pass_envs):$/;"	f
-msg	src/resender.h	/^    Message msg;$/;"	m	struct:ps::Resender::Entry
-msg_sig	include/ps/internal/message.h	/^  uint64_t msg_sig;$/;"	m	struct:ps::Control
-mthread_submit	tracker/dmlc_local.py	/^        def mthread_submit(nworker, nserver, envs):$/;"	f	function:LocalLauncher.submit
-mu_	deps/include/google/protobuf/stubs/common.h	/^  Mutex *const mu_;$/;"	m	class:google::protobuf::internal::MutexLock
-mu_	deps/include/google/protobuf/stubs/common.h	/^  Mutex *const mu_;$/;"	m	class:google::protobuf::internal::MutexLockMaybe
-mu_	include/ps/internal/postoffice.h	/^  mutable std::mutex mu_;$/;"	m	class:ps::Postoffice
-mu_	include/ps/internal/threadsafe_queue.h	/^  mutable std::mutex mu_;$/;"	m	class:ps::ThreadsafeQueue
-mu_	include/ps/kv_app.h	/^  std::mutex mu_;$/;"	m	class:ps::KVWorker
-mu_	src/resender.h	/^  std::mutex mu_;$/;"	m	class:ps::Resender
-mu_	src/zmq_van.h	/^  std::mutex mu_;$/;"	m	class:ps::ZMQVan
-mutable_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline Element* RepeatedField<Element>::mutable_data() {$/;"	f	class:google::protobuf::RepeatedField
-mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline Element** RepeatedPtrField<Element>::mutable_data() {$/;"	f	class:google::protobuf::RepeatedPtrField
-mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline typename TypeHandler::Type** RepeatedPtrFieldBase::mutable_data() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-mutable_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_dependency(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_enum_type() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_enum_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* DescriptorProto::mutable_enum_type(int index) {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_enum_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumDescriptorProto* FileDescriptorProto::mutable_enum_type(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse::mutable_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-mutable_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldOptions::mutable_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
-mutable_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_extension() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_extension() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_extension(int index) {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* FileDescriptorProto::mutable_extension(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_extension_range() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_extension_range	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto_ExtensionRange* DescriptorProto::mutable_extension_range(int index) {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_field	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_field() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_field	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto* DescriptorProto::mutable_field(int index) {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_field	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownField* UnknownFieldSet::mutable_field(int index) {$/;"	f	class:google::protobuf::UnknownFieldSet
-mutable_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorResponse::mutable_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-mutable_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::compiler::CodeGeneratorResponse_File* CodeGeneratorResponse::mutable_file(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-mutable_file	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorSet::mutable_file() {$/;"	f	class:google::protobuf::FileDescriptorSet
-mutable_file	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileDescriptorProto* FileDescriptorSet::mutable_file(int index) {$/;"	f	class:google::protobuf::FileDescriptorSet
-mutable_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::mutable_file_to_generate() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::mutable_file_to_generate(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_go_package() {$/;"	f	class:google::protobuf::FileOptions
-mutable_group	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownFieldSet* UnknownField::mutable_group() {$/;"	f	class:google::protobuf::UnknownField
-mutable_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-mutable_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-mutable_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
-mutable_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::mutable_java_package() {$/;"	f	class:google::protobuf::FileOptions
-mutable_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::mutable_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-mutable_length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline string* UnknownField::mutable_length_delimited() {$/;"	f	class:google::protobuf::UnknownField
-mutable_location	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo::mutable_location() {$/;"	f	class:google::protobuf::SourceCodeInfo
-mutable_location	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo_Location* SourceCodeInfo::mutable_location(int index) {$/;"	f	class:google::protobuf::SourceCodeInfo
-mutable_message_type	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_message_type() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_message_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* FileDescriptorProto::mutable_message_type(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_method	deps/include/google/protobuf/descriptor.pb.h	/^ServiceDescriptorProto::mutable_method() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-mutable_method	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodDescriptorProto* ServiceDescriptorProto::mutable_method(int index) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-mutable_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::mutable_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^UninterpretedOption::mutable_name() {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption_NamePart* UninterpretedOption::mutable_name(int index) {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* DescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumValueDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-mutable_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* ServiceDescriptorProto::mutable_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-mutable_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption_NamePart::mutable_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-mutable_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::mutable_nested_type() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::DescriptorProto* DescriptorProto::mutable_nested_type(int index) {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumOptions* EnumDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions* FieldDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions* FileDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MessageOptions* DescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodOptions* MethodDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-mutable_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::mutable_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-mutable_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::mutable_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-mutable_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::mutable_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::mutable_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_path	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::mutable_path() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-mutable_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::mutable_proto_file() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::google::protobuf::FileDescriptorProto* CodeGeneratorRequest::mutable_proto_file(int index) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_public_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_service	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_service() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_service	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceDescriptorProto* FileDescriptorProto::mutable_service(int index) {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::mutable_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_span	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::mutable_span() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-mutable_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::mutable_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::mutable_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-mutable_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::mutable_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumValueOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::EnumValueOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FieldOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::FieldOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FileOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::FileOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MessageOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::MessageOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MethodOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::MethodOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^ServiceOptions::mutable_uninterpreted_option() {$/;"	f	class:google::protobuf::ServiceOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::EnumOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* EnumValueOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::EnumValueOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FieldOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::FieldOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* FileOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::FileOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MessageOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::MessageOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* MethodOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::MethodOptions
-mutable_uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::UninterpretedOption* ServiceOptions::mutable_uninterpreted_option(int index) {$/;"	f	class:google::protobuf::ServiceOptions
-mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-mutable_unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::DescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::EnumValueOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FieldOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileDescriptorSet
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::FileOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MessageOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::MethodOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::ServiceOptions
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::SourceCodeInfo
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::UninterpretedOption
-mutable_unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline ::google::protobuf::UnknownFieldSet* mutable_unknown_fields() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-mutable_value	deps/include/google/protobuf/descriptor.pb.h	/^EnumDescriptorProto::mutable_value() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-mutable_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueDescriptorProto* EnumDescriptorProto::mutable_value(int index) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-mutable_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::mutable_weak_dependency() {$/;"	f	class:google::protobuf::FileDescriptorProto
-mutex_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable Mutex mutex_;$/;"	m	class:google::protobuf::compiler::python::Generator
-mutex_	deps/include/google/protobuf/descriptor.h	/^  Mutex* mutex_;$/;"	m	class:google::protobuf::DescriptorPool
-my_node	include/ps/internal/van.h	/^  const Node& my_node() const {$/;"	f	class:ps::Van
-my_node_	include/ps/internal/van.h	/^  Node my_node_;$/;"	m	class:ps::Van
-my_rank	include/ps/internal/postoffice.h	/^  int my_rank() const { return IDtoRank(van_->my_node().id); }$/;"	f	class:ps::Postoffice
-name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string name;                \/\/ E.g. "--foo_out"$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
-name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorResponse_File::name() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-name	deps/include/google/protobuf/descriptor.pb.h	/^UninterpretedOption::name() const {$/;"	f	class:google::protobuf::UninterpretedOption
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption_NamePart& UninterpretedOption::name(int index) const {$/;"	f	class:google::protobuf::UninterpretedOption
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& DescriptorProto::name() const {$/;"	f	class:google::protobuf::DescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& EnumDescriptorProto::name() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& EnumValueDescriptorProto::name() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::name() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::name() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& ServiceDescriptorProto::name() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-name_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorResponse_File
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::Descriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::EnumDescriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::EnumValueDescriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::FieldDescriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::FileDescriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::MethodDescriptor
-name_	deps/include/google/protobuf/descriptor.h	/^  const string* name_;$/;"	m	class:google::protobuf::ServiceDescriptor
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption_NamePart > name_;$/;"	m	class:google::protobuf::UninterpretedOption
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::DescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::FileDescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption_NamePart::name_part() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-name_part_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* name_part_;$/;"	m	class:google::protobuf::UninterpretedOption_NamePart
-name_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int UninterpretedOption::name_size() const {$/;"	f	class:google::protobuf::UninterpretedOption
-negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int64 UninterpretedOption::negative_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-negative_int_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int64 negative_int_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-nested_	deps/include/google/protobuf/text_format.h	/^    NestedMap nested_;$/;"	m	class:google::protobuf::TextFormat::ParseInfoTree
-nested_type	deps/include/google/protobuf/descriptor.pb.h	/^DescriptorProto::nested_type() const {$/;"	f	class:google::protobuf::DescriptorProto
-nested_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::DescriptorProto& DescriptorProto::nested_type(int index) const {$/;"	f	class:google::protobuf::DescriptorProto
-nested_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::DescriptorProto > nested_type_;$/;"	m	class:google::protobuf::DescriptorProto
-nested_type_count_	deps/include/google/protobuf/descriptor.h	/^  int nested_type_count_;$/;"	m	class:google::protobuf::Descriptor
-nested_type_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int DescriptorProto::nested_type_size() const {$/;"	f	class:google::protobuf::DescriptorProto
-nested_types_	deps/include/google/protobuf/descriptor.h	/^  Descriptor* nested_types_;$/;"	m	class:google::protobuf::Descriptor
-no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline bool MessageOptions::no_standard_descriptor_accessor() const {$/;"	f	class:google::protobuf::MessageOptions
-no_standard_descriptor_accessor_	deps/include/google/protobuf/descriptor.pb.h	/^  bool no_standard_descriptor_accessor_;$/;"	m	class:google::protobuf::MessageOptions
-node	include/ps/internal/message.h	/^  std::vector<Node> node;$/;"	m	struct:ps::Control
-node_ids_	include/ps/internal/postoffice.h	/^  std::unordered_map<int, std::vector<int>> node_ids_;$/;"	m	class:ps::Postoffice
-noexcept	include/dmlc/logging.h	/^#define noexcept(/;"	d
-num	tests/test_simple_app.cc	/^int num = 0;$/;"	v
-num_retry	src/resender.h	/^    int num_retry = 0;$/;"	m	struct:ps::Resender::Entry
-num_servers	include/ps/internal/postoffice.h	/^  int num_servers() const { return num_servers_; }$/;"	f	class:ps::Postoffice
-num_servers_	include/ps/internal/postoffice.h	/^  int num_servers_, num_workers_;$/;"	m	class:ps::Postoffice
-num_servers_	include/ps/internal/van.h	/^  int num_servers_ = 0;$/;"	m	class:ps::Van
-num_workers	include/ps/internal/postoffice.h	/^  int num_workers() const { return num_workers_; }$/;"	f	class:ps::Postoffice
-num_workers_	include/ps/internal/postoffice.h	/^  int num_servers_, num_workers_;$/;"	m	class:ps::Postoffice
-num_workers_	include/ps/internal/van.h	/^  int num_workers_ = 0;$/;"	m	class:ps::Van
-number	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 EnumValueDescriptorProto::number() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-number	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FieldDescriptorProto::number() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-number	deps/include/google/protobuf/extension_set.h	/^  inline int number() const { return number_; }$/;"	f	class:google::protobuf::internal::ExtensionIdentifier
-number	deps/include/google/protobuf/unknown_field_set.h	/^inline int UnknownField::number() const { return number_; }$/;"	f	class:google::protobuf::UnknownField
-number_	deps/include/google/protobuf/descriptor.h	/^  int number_;$/;"	m	class:google::protobuf::EnumValueDescriptor
-number_	deps/include/google/protobuf/descriptor.h	/^  int number_;$/;"	m	class:google::protobuf::FieldDescriptor
-number_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 number_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-number_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 number_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-number_	deps/include/google/protobuf/extension_set.h	/^  const int number_;$/;"	m	class:google::protobuf::internal::ExtensionIdentifier
-obj_	include/ps/simple_app.h	/^  Customer* obj_;$/;"	m	class:ps::SimpleApp
-object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure0
-object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure1
-object_	deps/include/google/protobuf/stubs/common.h	/^  Class* object_;$/;"	m	class:google::protobuf::internal::MethodClosure2
-object_size_	deps/include/google/protobuf/generated_message_reflection.h	/^  int object_size_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-off64_t	include/dmlc/base.h	/^#define off64_t /;"	d
-offsets_	deps/include/google/protobuf/generated_message_reflection.h	/^  const int* offsets_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-operator !=	deps/include/google/protobuf/repeated_field.h	/^  bool operator!=(const iterator& x) const { return it_ != x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator !=	deps/include/google/protobuf/repeated_field.h	/^  bool operator!=(const iterator& x) const { return it_ != x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator !=	deps/include/google/protobuf/stubs/common.h	/^  bool operator!=(C* p) const { return array_ != p; }$/;"	f	class:google::protobuf::internal::scoped_array
-operator !=	deps/include/google/protobuf/stubs/common.h	/^  bool operator!=(C* p) const { return ptr_ != p; }$/;"	f	class:google::protobuf::internal::scoped_ptr
-operator ()	deps/include/google/protobuf/repeated_field.h	/^  void operator()(Element to[], const Element from[], int array_size) {$/;"	f	struct:google::protobuf::internal::ElementCopier
-operator ()	deps/include/google/protobuf/repeated_field.h	/^void ElementCopier<Element, HasTrivialCopy>::operator()($/;"	f	class:google::protobuf::internal::ElementCopier
-operator ()	include/ps/kv_app.h	/^  void operator()($/;"	f	struct:ps::KVServerDefaultHandle
-operator *	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-operator *	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-operator *	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator*() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-operator *	deps/include/google/protobuf/repeated_field.h	/^  reference operator*() const { return *reinterpret_cast<Element**>(it_); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator *	deps/include/google/protobuf/repeated_field.h	/^  reference operator*() const { return *reinterpret_cast<Element*>(*it_); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator *	deps/include/google/protobuf/stubs/common.h	/^  C& operator*() const {$/;"	f	class:google::protobuf::internal::scoped_ptr
-operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(difference_type d, iterator it) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(difference_type d, iterator it) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator +	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator+(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator++(int \/* unused *\/) {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator++() {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator++(int \/* unused *\/) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator++(int) { return iterator(it_++); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator++(int) { return iterator(it_++); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator++() { ++it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator ++	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator++() { ++it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator +=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator+=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator +=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator+=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator -	deps/include/google/protobuf/repeated_field.h	/^  difference_type operator-(const iterator& x) const { return it_ - x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator -	deps/include/google/protobuf/repeated_field.h	/^  difference_type operator-(const iterator& x) const { return it_ - x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator -	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator-(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator -	deps/include/google/protobuf/repeated_field.h	/^  friend iterator operator-(iterator it, difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator--(int) { return iterator(it_--); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator  operator--(int) { return iterator(it_--); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator--() { --it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator --	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator--() { --it_; return *this; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator -=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator-=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator -=	deps/include/google/protobuf/repeated_field.h	/^  iterator& operator-=(difference_type d) {$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator ->	deps/include/google/protobuf/repeated_field.h	/^  pointer   operator->() const { return &(operator*()); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator ->	deps/include/google/protobuf/repeated_field.h	/^  pointer   operator->() const { return &(operator*()); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator ->	deps/include/google/protobuf/stubs/common.h	/^  C* operator->() const  {$/;"	f	class:google::protobuf::internal::scoped_ptr
-operator <	deps/include/google/protobuf/repeated_field.h	/^  bool operator<(const iterator& x) const { return it_ < x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator <	deps/include/google/protobuf/repeated_field.h	/^  bool operator<(const iterator& x) const { return it_ < x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator <<	include/ps/sarray.h	/^std::ostream& operator<<(std::ostream& os, const SArray<V>& obj) {$/;"	f	namespace:ps
-operator <=	deps/include/google/protobuf/repeated_field.h	/^  bool operator<=(const iterator& x) const { return it_ <= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator <=	deps/include/google/protobuf/repeated_field.h	/^  bool operator<=(const iterator& x) const { return it_ <= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorRequest& operator=(const CodeGeneratorRequest& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorResponse& operator=(const CodeGeneratorResponse& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-operator =	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline CodeGeneratorResponse_File& operator=(const CodeGeneratorResponse_File& from) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline DescriptorProto& operator=(const DescriptorProto& from) {$/;"	f	class:google::protobuf::DescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline DescriptorProto_ExtensionRange& operator=(const DescriptorProto_ExtensionRange& from) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumDescriptorProto& operator=(const EnumDescriptorProto& from) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumOptions& operator=(const EnumOptions& from) {$/;"	f	class:google::protobuf::EnumOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumValueDescriptorProto& operator=(const EnumValueDescriptorProto& from) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline EnumValueOptions& operator=(const EnumValueOptions& from) {$/;"	f	class:google::protobuf::EnumValueOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FieldDescriptorProto& operator=(const FieldDescriptorProto& from) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FieldOptions& operator=(const FieldOptions& from) {$/;"	f	class:google::protobuf::FieldOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileDescriptorProto& operator=(const FileDescriptorProto& from) {$/;"	f	class:google::protobuf::FileDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileDescriptorSet& operator=(const FileDescriptorSet& from) {$/;"	f	class:google::protobuf::FileDescriptorSet
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline FileOptions& operator=(const FileOptions& from) {$/;"	f	class:google::protobuf::FileOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MessageOptions& operator=(const MessageOptions& from) {$/;"	f	class:google::protobuf::MessageOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MethodDescriptorProto& operator=(const MethodDescriptorProto& from) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline MethodOptions& operator=(const MethodOptions& from) {$/;"	f	class:google::protobuf::MethodOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline ServiceDescriptorProto& operator=(const ServiceDescriptorProto& from) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline ServiceOptions& operator=(const ServiceOptions& from) {$/;"	f	class:google::protobuf::ServiceOptions
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline SourceCodeInfo& operator=(const SourceCodeInfo& from) {$/;"	f	class:google::protobuf::SourceCodeInfo
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline SourceCodeInfo_Location& operator=(const SourceCodeInfo_Location& from) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline UninterpretedOption& operator=(const UninterpretedOption& from) {$/;"	f	class:google::protobuf::UninterpretedOption
-operator =	deps/include/google/protobuf/descriptor.pb.h	/^  inline UninterpretedOption_NamePart& operator=(const UninterpretedOption_NamePart& from) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-operator =	deps/include/google/protobuf/repeated_field.h	/^  AllocatedRepeatedPtrFieldBackInsertIterator<T>& operator=($/;"	f	class:google::protobuf::internal::AllocatedRepeatedPtrFieldBackInsertIterator
-operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedFieldBackInsertIterator<T>& operator=(const T& value) {$/;"	f	class:google::protobuf::internal::RepeatedFieldBackInsertIterator
-operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator=($/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-operator =	deps/include/google/protobuf/repeated_field.h	/^  RepeatedPtrFieldBackInsertIterator<T>& operator=(const T& value) {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBackInsertIterator
-operator =	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::operator=(const RepeatedField& other) {$/;"	f	class:google::protobuf::RepeatedField
-operator =	deps/include/google/protobuf/repeated_field.h	/^inline RepeatedPtrField<Element>& RepeatedPtrField<Element>::operator=($/;"	f	class:google::protobuf::RepeatedPtrField
-operator =	include/ps/sarray.h	/^  template <typename W> void operator=(const SArray<W>& arr) {$/;"	f	class:ps::SArray
-operator =	include/ps/sarray.h	/^  template <typename W> void operator=(const std::initializer_list<W>& list) {$/;"	f	class:ps::SArray
-operator ==	deps/include/google/protobuf/repeated_field.h	/^  bool operator==(const iterator& x) const { return it_ == x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator ==	deps/include/google/protobuf/repeated_field.h	/^  bool operator==(const iterator& x) const { return it_ == x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator ==	deps/include/google/protobuf/stubs/common.h	/^  bool operator==(C* p) const { return array_ == p; }$/;"	f	class:google::protobuf::internal::scoped_array
-operator ==	deps/include/google/protobuf/stubs/common.h	/^  bool operator==(C* p) const { return ptr_ == p; }$/;"	f	class:google::protobuf::internal::scoped_ptr
-operator >	deps/include/google/protobuf/repeated_field.h	/^  bool operator>(const iterator& x) const { return it_ > x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator >	deps/include/google/protobuf/repeated_field.h	/^  bool operator>(const iterator& x) const { return it_ > x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator >=	deps/include/google/protobuf/repeated_field.h	/^  bool operator>=(const iterator& x) const { return it_ >= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator >=	deps/include/google/protobuf/repeated_field.h	/^  bool operator>=(const iterator& x) const { return it_ >= x.it_; }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator []	deps/include/google/protobuf/repeated_field.h	/^  reference operator[](difference_type d) const { return *(*this + d); }$/;"	f	class:google::protobuf::internal::RepeatedPtrIterator
-operator []	deps/include/google/protobuf/repeated_field.h	/^  reference operator[](difference_type d) const { return *(*this + d); }$/;"	f	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-operator []	deps/include/google/protobuf/stubs/common.h	/^  C& operator[](std::ptrdiff_t i) const {$/;"	f	class:google::protobuf::internal::scoped_array
-operator []	include/ps/sarray.h	/^  inline V& operator[] (int i) { return data()[i]; }$/;"	f	class:ps::SArray
-operator []	include/ps/sarray.h	/^  inline const V& operator[] (int i) const { return data()[i]; }$/;"	f	class:ps::SArray
-optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions_OptimizeMode FileOptions::optimize_for() const {$/;"	f	class:google::protobuf::FileOptions
-optimize_for_	deps/include/google/protobuf/descriptor.pb.h	/^  int optimize_for_;$/;"	m	class:google::protobuf::FileOptions
-option_flag_name	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string option_flag_name;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::GeneratorInfo
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumOptions& EnumDescriptorProto::options() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumValueOptions& EnumValueDescriptorProto::options() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FieldOptions& FieldDescriptorProto::options() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::FileOptions& FileDescriptorProto::options() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MessageOptions& DescriptorProto::options() const {$/;"	f	class:google::protobuf::DescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::MethodOptions& MethodDescriptorProto::options() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-options	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::ServiceOptions& ServiceDescriptorProto::options() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-options_	deps/include/google/protobuf/descriptor.h	/^  const EnumOptions* options_;$/;"	m	class:google::protobuf::EnumDescriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const EnumValueOptions* options_;$/;"	m	class:google::protobuf::EnumValueDescriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const FieldOptions* options_;$/;"	m	class:google::protobuf::FieldDescriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const FileOptions* options_;$/;"	m	class:google::protobuf::FileDescriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const MessageOptions* options_;$/;"	m	class:google::protobuf::Descriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const MethodOptions* options_;$/;"	m	class:google::protobuf::MethodDescriptor
-options_	deps/include/google/protobuf/descriptor.h	/^  const ServiceOptions* options_;$/;"	m	class:google::protobuf::ServiceDescriptor
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::EnumOptions* options_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::EnumValueOptions* options_;$/;"	m	class:google::protobuf::EnumValueDescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::FieldOptions* options_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::FileOptions* options_;$/;"	m	class:google::protobuf::FileDescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::MessageOptions* options_;$/;"	m	class:google::protobuf::DescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::MethodOptions* options_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-options_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::ServiceOptions* options_;$/;"	m	class:google::protobuf::ServiceDescriptorProto
-or_	deps/include/google/protobuf/stubs/template_util.h	/^struct or_ : public integral_constant<bool, (A::value || B::value)> {$/;"	s	namespace:google::protobuf::internal
-os	docs/conf.py	/^import os$/;"	i
-os	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
-os	tests/lint.py	/^import os$/;"	i
-os	tracker/dmlc_local.py	/^import os$/;"	i
-os	tracker/dmlc_mpi.py	/^import os$/;"	i
-os	tracker/dmlc_ssh.py	/^import os$/;"	i
-os	tracker/tracker.py	/^import os$/;"	i
-output	deps/include/google/protobuf/wire_format_lite.h	/^#define output /;"	d
-output	deps/include/google/protobuf/wire_format_lite.h	/^#undef output$/;"	d
-output_	deps/include/google/protobuf/io/coded_stream.h	/^  ZeroCopyOutputStream* output_;$/;"	m	class:google::protobuf::io::CodedOutputStream
-output_	deps/include/google/protobuf/io/printer.h	/^  ZeroCopyOutputStream* const output_;$/;"	m	class:google::protobuf::io::Printer
-output_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    ostream* output_;$/;"	m	class:google::protobuf::io::OstreamOutputStream::CopyingOstreamOutputStream
-output_buffer_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* output_buffer_;$/;"	m	class:google::protobuf::io::GzipInputStream
-output_buffer_length_	deps/include/google/protobuf/io/gzip_stream.h	/^  size_t output_buffer_length_;$/;"	m	class:google::protobuf::io::GzipInputStream
-output_directives_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<OutputDirective> output_directives_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-output_location	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string output_location;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
-output_position_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* output_position_;$/;"	m	class:google::protobuf::io::GzipInputStream
-output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& MethodDescriptorProto::output_type() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-output_type_	deps/include/google/protobuf/descriptor.h	/^  const Descriptor* output_type_;$/;"	m	class:google::protobuf::MethodDescriptor
-output_type_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* output_type_;$/;"	m	class:google::protobuf::MethodDescriptorProto
-overflow_bytes_	deps/include/google/protobuf/io/coded_stream.h	/^  int overflow_bytes_;$/;"	m	class:google::protobuf::io::CodedInputStream
-owner_	deps/include/google/protobuf/compiler/importer.h	/^    SourceTreeDescriptorDatabase* owner_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase::ValidationErrorCollector
-owns_copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool owns_copying_stream_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-owns_copying_stream_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  bool owns_copying_stream_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-pLinuxKernelCmpxchg	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^LinuxKernelCmpxchgFunc pLinuxKernelCmpxchg __attribute__((weak)) =$/;"	m	namespace:google::protobuf::internal
-pLinuxKernelMemoryBarrier	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^LinuxKernelMemoryBarrierFunc pLinuxKernelMemoryBarrier __attribute__((weak)) =$/;"	m	namespace:google::protobuf::internal
-package	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FileDescriptorProto::package() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-package_	deps/include/google/protobuf/descriptor.h	/^  const string* package_;$/;"	m	class:google::protobuf::FileDescriptor
-package_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* package_;$/;"	m	class:google::protobuf::FileDescriptorProto
-packed	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::packed() const {$/;"	f	class:google::protobuf::FieldOptions
-packed_	deps/include/google/protobuf/descriptor.pb.h	/^  bool packed_;$/;"	m	class:google::protobuf::FieldOptions
-parameter	deps/include/google/protobuf/compiler/command_line_interface.h	/^    string parameter;$/;"	m	struct:google::protobuf::compiler::CommandLineInterface::OutputDirective
-parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::std::string& CodeGeneratorRequest::parameter() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-parameter_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::std::string* parameter_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-parse_info_tree_	deps/include/google/protobuf/text_format.h	/^    ParseInfoTree* parse_info_tree_;$/;"	m	class:google::protobuf::TextFormat::Parser
-parser	docs/sphinx_util.py	/^from recommonmark import parser, transform$/;"	i
-parser	tracker/dmlc_mpi.py	/^parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using MPI')$/;"	v
-parser_	deps/include/google/protobuf/compiler/parser.h	/^    Parser* parser_;$/;"	m	class:google::protobuf::compiler::Parser::LocationRecorder
-path	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::path() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-path	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 SourceCodeInfo_Location::path(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-path_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > path_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-path_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo_Location::path_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-plugin_prefix_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string plugin_prefix_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-plugins_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  map<string, string> plugins_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::pointer pointer;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
-pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::pointer pointer;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type* pointer;$/;"	t	class:google::protobuf::RepeatedField
-pointer	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type* pointer;$/;"	t	class:google::protobuf::RepeatedPtrField
-pointer_begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_begin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-pointer_begin	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_begin() {$/;"	f	class:google::protobuf::RepeatedPtrField
-pointer_end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_end() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-pointer_end	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::pointer_end() {$/;"	f	class:google::protobuf::RepeatedPtrField
-pointer_iterator	deps/include/google/protobuf/repeated_field.h	/^  pointer_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-pool	deps/include/google/protobuf/compiler/importer.h	/^  inline const DescriptorPool* pool() const {$/;"	f	class:google::protobuf::compiler::Importer
-pool_	deps/include/google/protobuf/compiler/importer.h	/^  DescriptorPool pool_;$/;"	m	class:google::protobuf::compiler::Importer
-pool_	deps/include/google/protobuf/descriptor.h	/^  const DescriptorPool* pool_;$/;"	m	class:google::protobuf::FileDescriptor
-pool_	deps/include/google/protobuf/descriptor_database.h	/^  const DescriptorPool& pool_;$/;"	m	class:google::protobuf::DescriptorPoolDatabase
-pool_	deps/include/google/protobuf/dynamic_message.h	/^  const DescriptorPool* pool_;$/;"	m	class:google::protobuf::DynamicMessageFactory
-pop_back	include/ps/sarray.h	/^  void pop_back() { if (size_) --size_; }$/;"	f	class:ps::SArray
-port	include/ps/internal/message.h	/^  int port;$/;"	m	struct:ps::Node
-position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int position_;$/;"	m	class:google::protobuf::io::ArrayInputStream
-position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int position_;$/;"	m	class:google::protobuf::io::ArrayOutputStream
-position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int64 position_;$/;"	m	class:google::protobuf::io::CopyingInputStreamAdaptor
-position_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  int64 position_;$/;"	m	class:google::protobuf::io::CopyingOutputStreamAdaptor
-positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::uint64 UninterpretedOption::positive_int_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-positive_int_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::uint64 positive_int_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-previous	deps/include/google/protobuf/io/tokenizer.h	/^inline const Tokenizer::Token& Tokenizer::previous() {$/;"	f	class:google::protobuf::io::Tokenizer
-previous_	deps/include/google/protobuf/io/tokenizer.h	/^  Token previous_;          \/\/ Returned by previous().$/;"	m	class:google::protobuf::io::Tokenizer
-previous_seek_failed_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^    bool previous_seek_failed_;$/;"	m	class:google::protobuf::io::FileInputStream::CopyingFileInputStream
-print_summary	tests/lint.py	/^    def print_summary(self, strm):$/;"	m	class:LintHelper
-printer_	deps/include/google/protobuf/compiler/python/python_generator.h	/^  mutable io::Printer* printer_;  \/\/ Set in Generate().  Under mutex_.$/;"	m	class:google::protobuf::compiler::python::Generator
-process	tests/lint.py	/^def process(fname, allow_type):$/;"	f
-process_cpp	tests/lint.py	/^    def process_cpp(self, path, suffix):$/;"	m	class:LintHelper
-process_python	tests/lint.py	/^    def process_python(self, path):$/;"	m	class:LintHelper
-project	docs/conf.py	/^project = u'ps-lite'$/;"	v
-proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^CodeGeneratorRequest::proto_file() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-proto_file	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline const ::google::protobuf::FileDescriptorProto& CodeGeneratorRequest::proto_file(int index) const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-proto_file_	deps/include/google/protobuf/compiler/plugin.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::FileDescriptorProto > proto_file_;$/;"	m	class:google::protobuf::compiler::CodeGeneratorRequest
-proto_file_size	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline int CodeGeneratorRequest::proto_file_size() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-proto_path_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  vector<pair<string, string> > proto_path_;  \/\/ Search path for proto files.$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-protobuf	deps/include/google/protobuf/compiler/code_generator.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/command_line_interface.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/cpp/cpp_generator.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/importer.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/java/java_generator.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/parser.h	/^namespace protobuf { class Message; }$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/parser.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/plugin.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/plugin.pb.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/descriptor.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/descriptor.pb.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/descriptor_database.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/dynamic_message.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/extension_set.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/generated_enum_reflection.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/generated_message_reflection.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/generated_message_util.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/coded_stream.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/gzip_stream.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/printer.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/tokenizer.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/zero_copy_stream.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/message.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/message_lite.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/reflection_ops.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/repeated_field.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/service.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_arm_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_arm_qnx.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_atomicword_compat.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_macosx.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_mips_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_pnacl.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_x86_gcc.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/atomicops_internals_x86_msvc.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/common.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/once.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/template_util.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/stubs/type_traits.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/text_format.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/unknown_field_set.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/wire_format.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/wire_format_lite.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf	deps/include/google/protobuf/wire_format_lite_inl.h	/^namespace protobuf {$/;"	n	namespace:google
-protobuf_AddDesc_meta_2eproto	src/meta.pb.cc	/^void protobuf_AddDesc_meta_2eproto() {$/;"	f	namespace:ps
-protobuf_AddDesc_meta_2eproto_impl	src/meta.pb.cc	/^void protobuf_AddDesc_meta_2eproto_impl() {$/;"	f	namespace:ps
-protobuf_ShutdownFile_meta_2eproto	src/meta.pb.cc	/^void protobuf_ShutdownFile_meta_2eproto() {$/;"	f	namespace:ps
-prototypes_	deps/include/google/protobuf/dynamic_message.h	/^  scoped_ptr<PrototypeMap> prototypes_;$/;"	m	class:google::protobuf::DynamicMessageFactory
-prototypes_mutex_	deps/include/google/protobuf/dynamic_message.h	/^  mutable Mutex prototypes_mutex_;$/;"	m	class:google::protobuf::DynamicMessageFactory
-ps	include/ps/base.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/assign_op.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/customer.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/env.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/message.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/parallel_kv_match.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/parallel_sort.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/postoffice.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/threadsafe_queue.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/utils.h	/^namespace ps {$/;"	n
-ps	include/ps/internal/van.h	/^namespace ps {$/;"	n
-ps	include/ps/kv_app.h	/^namespace ps {$/;"	n
-ps	include/ps/ps.h	/^namespace ps {$/;"	n
-ps	include/ps/range.h	/^namespace ps {$/;"	n
-ps	include/ps/sarray.h	/^namespace ps {$/;"	n
-ps	include/ps/simple_app.h	/^namespace ps {$/;"	n
-ps	src/customer.cc	/^namespace ps {$/;"	n	file:
-ps	src/meta.pb.cc	/^namespace ps {$/;"	n	file:
-ps	src/network_utils.h	/^namespace ps {$/;"	n
-ps	src/postoffice.cc	/^namespace ps {$/;"	n	file:
-ps	src/resender.h	/^namespace ps {$/;"	n
-ps	src/van.cc	/^namespace ps {$/;"	n	file:
-ps	src/zmq_van.h	/^namespace ps {$/;"	n
-ptr	include/ps/sarray.h	/^  inline const std::shared_ptr<V>& ptr() const { return ptr_; }$/;"	f	class:ps::SArray
-ptr	include/ps/sarray.h	/^  inline std::shared_ptr<V>& ptr() { return ptr_; }$/;"	f	class:ps::SArray
-ptr_	deps/include/google/protobuf/stubs/common.h	/^  C* ptr_;$/;"	m	class:google::protobuf::internal::scoped_ptr
-ptr_	include/ps/sarray.h	/^  std::shared_ptr<V> ptr_;$/;"	m	class:ps::SArray
-public_dependencies_	deps/include/google/protobuf/descriptor.h	/^  int* public_dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
-public_dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::public_dependency($/;"	f	class:google::protobuf::FileDescriptor
-public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::public_dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FileDescriptorProto::public_dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-public_dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > public_dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
-public_dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int public_dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
-public_dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::public_dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-push	include/ps/internal/message.h	/^  bool push;$/;"	m	struct:ps::Meta
-push	include/ps/kv_app.h	/^  bool push;$/;"	m	struct:ps::KVMeta
-push_back	include/ps/sarray.h	/^  inline void push_back(const V& val) {$/;"	f	class:ps::SArray
-py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FileOptions::py_generic_services() const {$/;"	f	class:google::protobuf::FileOptions
-py_generic_services_	deps/include/google/protobuf/descriptor.pb.h	/^  bool py_generic_services_;$/;"	m	class:google::protobuf::FileOptions
-pygments_style	docs/conf.py	/^pygments_style = 'sphinx'$/;"	v
-python	deps/include/google/protobuf/compiler/python/python_generator.h	/^namespace python {$/;"	n	namespace:google::protobuf::compiler
-queue_	include/ps/internal/threadsafe_queue.h	/^  std::queue<T> queue_;$/;"	m	class:ps::ThreadsafeQueue
-rand_r	src/zmq_van.h	/^#define rand_r(/;"	d
-random	src/windows/unistd.h	/^#define random /;"	d
-random	tracker/tracker.py	/^import random$/;"	i
-raw_data	deps/include/google/protobuf/repeated_field.h	/^inline void* const* RepeatedPtrFieldBase::raw_data() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-raw_mutable_data	deps/include/google/protobuf/repeated_field.h	/^inline void** RepeatedPtrFieldBase::raw_mutable_data() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-rbegin	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rbegin() const {$/;"	f	class:google::protobuf::RepeatedField
-rbegin	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rbegin() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-rbegin	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rbegin() {$/;"	f	class:google::protobuf::RepeatedField
-rbegin	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rbegin() {$/;"	f	class:google::protobuf::RepeatedPtrField
-re	tests/lint.py	/^import re$/;"	i
-read_error_	deps/include/google/protobuf/io/tokenizer.h	/^  bool read_error_;         \/\/ Did we previously encounter a read error?$/;"	m	class:google::protobuf::io::Tokenizer
-receiver_	src/zmq_van.h	/^  void *receiver_ = nullptr;$/;"	m	class:ps::ZMQVan
-receiver_thread_	include/ps/internal/van.h	/^  std::unique_ptr<std::thread> receiver_thread_;$/;"	m	class:ps::Van
-record_start_	deps/include/google/protobuf/io/tokenizer.h	/^  int record_start_;$/;"	m	class:google::protobuf::io::Tokenizer
-record_target_	deps/include/google/protobuf/io/tokenizer.h	/^  string* record_target_;$/;"	m	class:google::protobuf::io::Tokenizer
-recursion_depth_	deps/include/google/protobuf/io/coded_stream.h	/^  int recursion_depth_;$/;"	m	class:google::protobuf::io::CodedInputStream
-recursion_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int recursion_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
-recv_bytes_	include/ps/internal/van.h	/^  size_t recv_bytes_ = 0;$/;"	m	class:ps::Van
-recv_handle_	include/ps/internal/customer.h	/^  RecvHandle recv_handle_;$/;"	m	class:ps::Customer
-recv_kvs_	include/ps/kv_app.h	/^  std::unordered_map<int, std::vector<KVPairs<Val>>> recv_kvs_;$/;"	m	class:ps::KVWorker
-recv_queue_	include/ps/internal/customer.h	/^  ThreadsafeQueue<Message> recv_queue_;$/;"	m	class:ps::Customer
-recv_thread_	include/ps/internal/customer.h	/^  std::unique_ptr<std::thread> recv_thread_;$/;"	m	class:ps::Customer
-recvall	tracker/tracker.py	/^    def recvall(self, nbytes):$/;"	m	class:ExSocket
-recver	include/ps/internal/message.h	/^  int recver;$/;"	m	struct:ps::Meta
-recvint	tracker/tracker.py	/^    def recvint(self):$/;"	m	class:ExSocket
-recvstr	tracker/tracker.py	/^    def recvstr(self):$/;"	m	class:ExSocket
-reference	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::reference reference;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
-reference	deps/include/google/protobuf/repeated_field.h	/^  typedef typename superclass::reference reference;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-reference	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type& reference;$/;"	t	class:google::protobuf::RepeatedField
-reference	deps/include/google/protobuf/repeated_field.h	/^  typedef value_type& reference;$/;"	t	class:google::protobuf::RepeatedPtrField
-reflection	deps/include/google/protobuf/message.h	/^  const Reflection* reflection;$/;"	m	struct:google::protobuf::Metadata
-release	deps/include/google/protobuf/stubs/common.h	/^  C* release() {$/;"	f	class:google::protobuf::internal::scoped_array
-release	deps/include/google/protobuf/stubs/common.h	/^  C* release() {$/;"	f	class:google::protobuf::internal::scoped_ptr
-release	docs/conf.py	/^release = u'1.0'$/;"	v
-release_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-release_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-release_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-release_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse::release_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-release_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldOptions::release_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
-release_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-release_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_go_package() {$/;"	f	class:google::protobuf::FileOptions
-release_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-release_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-release_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-release_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
-release_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileOptions::release_java_package() {$/;"	f	class:google::protobuf::FileOptions
-release_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::release_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-release_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorResponse_File::release_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* DescriptorProto::release_name() {$/;"	f	class:google::protobuf::DescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumDescriptorProto::release_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* EnumValueDescriptorProto::release_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::release_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-release_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* ServiceDescriptorProto::release_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-release_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption_NamePart::release_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumOptions* EnumDescriptorProto::release_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::EnumValueOptions* EnumValueDescriptorProto::release_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldOptions* FieldDescriptorProto::release_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FileOptions* FileDescriptorProto::release_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MessageOptions* DescriptorProto::release_options() {$/;"	f	class:google::protobuf::DescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::MethodOptions* MethodDescriptorProto::release_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-release_options	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::ServiceOptions* ServiceDescriptorProto::release_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-release_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* MethodDescriptorProto::release_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-release_package	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FileDescriptorProto::release_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
-release_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline ::std::string* CodeGeneratorRequest::release_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-release_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::SourceCodeInfo* FileDescriptorProto::release_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
-release_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* UninterpretedOption::release_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-release_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* SourceCodeInfo_Location::release_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-release_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline ::std::string* FieldDescriptorProto::release_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-remove_const	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_const	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const<T const> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_cv	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_cv {$/;"	s	namespace:google::protobuf::internal
-remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const volatile> {$/;"	s	namespace:google::protobuf::internal
-remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* volatile> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_pointer	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T*> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_reference	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference<T&> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_volatile	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-remove_volatile	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile<T volatile> { typedef T type; };$/;"	s	namespace:google::protobuf::internal
-rend	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rend() const {$/;"	f	class:google::protobuf::RepeatedField
-rend	deps/include/google/protobuf/repeated_field.h	/^  const_reverse_iterator rend() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-rend	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rend() {$/;"	f	class:google::protobuf::RepeatedField
-rend	deps/include/google/protobuf/repeated_field.h	/^  reverse_iterator rend() {$/;"	f	class:google::protobuf::RepeatedPtrField
-repeated_bool_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <bool       >* repeated_bool_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_double_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <double     >* repeated_double_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_enum_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int        >* repeated_enum_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_float_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <float      >* repeated_float_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_int32_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int32      >* repeated_int32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_int64_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <int64      >* repeated_int64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_message_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedPtrField<MessageLite>* repeated_message_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_string_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedPtrField<string     >* repeated_string_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_uint32_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <uint32     >* repeated_uint32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-repeated_uint64_value	deps/include/google/protobuf/extension_set.h	/^      RepeatedField   <uint64     >* repeated_uint64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-request	include/ps/internal/message.h	/^  bool request;$/;"	m	struct:ps::Meta
-request_handle_	include/ps/kv_app.h	/^  ReqHandle request_handle_;$/;"	m	class:ps::KVServer
-request_handle_	include/ps/simple_app.h	/^  Handle request_handle_;$/;"	m	class:ps::SimpleApp
-require_syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  bool require_syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
-resender_	include/ps/internal/van.h	/^  Resender* resender_ = nullptr;$/;"	m	class:ps::Van
-reserve	include/ps/sarray.h	/^  void reserve(size_t size) {$/;"	f	class:ps::SArray
-reset	deps/include/google/protobuf/stubs/common.h	/^  void reset(C* p = NULL) {$/;"	f	class:google::protobuf::internal::scoped_array
-reset	deps/include/google/protobuf/stubs/common.h	/^  void reset(C* p = NULL) {$/;"	f	class:google::protobuf::internal::scoped_ptr
-reset	include/ps/sarray.h	/^  void reset(V* data, size_t size, Deleter del) {$/;"	f	class:ps::SArray
-resize	include/ps/sarray.h	/^  void resize(size_t size, V val = 0) {$/;"	f	class:ps::SArray
-response_handle_	include/ps/simple_app.h	/^  Handle response_handle_;$/;"	m	class:ps::SimpleApp
-revents	deps/include/zmq.h	/^    short revents;$/;"	m	struct:zmq_pollitem_t
-reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<iterator> reverse_iterator;$/;"	t	class:google::protobuf::RepeatedField
-reverse_iterator	deps/include/google/protobuf/repeated_field.h	/^  typedef std::reverse_iterator<iterator> reverse_iterator;$/;"	t	class:google::protobuf::RepeatedPtrField
-role	include/ps/internal/message.h	/^  Role role;$/;"	m	struct:ps::Node
-run	tracker/dmlc_local.py	/^    def run(self):$/;"	m	class:LocalLauncher
-run	tracker/dmlc_mpi.py	/^    def run(prog):$/;"	f	function:mpi_submit
-run	tracker/dmlc_ssh.py	/^            def run(prog):$/;"	f	function:SSHLauncher.submit.ssh_submit
-run	tracker/dmlc_ssh.py	/^    def run(self):$/;"	m	class:SSHLauncher
-run	tracker/tracker.py	/^        def run():$/;"	f	function:RabitTracker.start
-scheduler_	include/ps/internal/van.h	/^  Node scheduler_;$/;"	m	class:ps::Van
-scoped_array	deps/include/google/protobuf/stubs/common.h	/^  explicit scoped_array(C* p = NULL) : array_(p) { }$/;"	f	class:google::protobuf::internal::scoped_array
-scoped_array	deps/include/google/protobuf/stubs/common.h	/^class scoped_array {$/;"	c	namespace:google::protobuf::internal
-scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^  explicit scoped_ptr(C* p = NULL) : ptr_(p) { }$/;"	f	class:google::protobuf::internal::scoped_ptr
-scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^class scoped_ptr {$/;"	c	namespace:google::protobuf::internal
-segment	include/ps/sarray.h	/^  SArray<V> segment(size_t begin, size_t end) const {$/;"	f	class:ps::SArray
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure0
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure1
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::FunctionClosure2
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure0
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure1
-self_deleting_	deps/include/google/protobuf/stubs/common.h	/^  bool self_deleting_;$/;"	m	class:google::protobuf::internal::MethodClosure2
-send	src/resender.h	/^    Time send;$/;"	m	struct:ps::Resender::Entry
-send_buff_	src/resender.h	/^  std::unordered_map<uint64_t, Entry> send_buff_;$/;"	m	class:ps::Resender
-sender	include/ps/internal/message.h	/^  int sender;$/;"	m	struct:ps::Meta
-sender	include/ps/kv_app.h	/^  int sender;$/;"	m	struct:ps::KVMeta
-sender	include/ps/simple_app.h	/^  int sender;$/;"	m	struct:ps::SimpleData
-senders_	src/zmq_van.h	/^  std::unordered_map<int, void*> senders_;$/;"	m	class:ps::ZMQVan
-sendint	tracker/tracker.py	/^    def sendint(self, n):$/;"	m	class:ExSocket
-sendstr	tracker/tracker.py	/^    def sendstr(self, s):$/;"	m	class:ExSocket
-server_key_ranges_	include/ps/internal/postoffice.h	/^  std::vector<Range> server_key_ranges_;$/;"	m	class:ps::Postoffice
-service	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::service() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-service	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::ServiceDescriptorProto& FileDescriptorProto::service(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-service_	deps/include/google/protobuf/descriptor.h	/^  const ServiceDescriptor* service_;$/;"	m	class:google::protobuf::MethodDescriptor
-service_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::ServiceDescriptorProto > service_;$/;"	m	class:google::protobuf::FileDescriptorProto
-service_count_	deps/include/google/protobuf/descriptor.h	/^  int service_count_;$/;"	m	class:google::protobuf::FileDescriptor
-service_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::service_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-services_	deps/include/google/protobuf/descriptor.h	/^  ServiceDescriptor* services_;$/;"	m	class:google::protobuf::FileDescriptor
-set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_aggregate_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_allocated_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_aggregate_value(::std::string* aggregate_value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_allocated_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_content(::std::string* content) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_allocated_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_default_value(::std::string* default_value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_allocated_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_allocated_error(::std::string* error) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-set_allocated_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_allocated_experimental_map_key(::std::string* experimental_map_key) {$/;"	f	class:google::protobuf::FieldOptions
-set_allocated_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_extendee(::std::string* extendee) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_allocated_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_go_package(::std::string* go_package) {$/;"	f	class:google::protobuf::FileOptions
-set_allocated_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_identifier_value(::std::string* identifier_value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_allocated_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_input_type(::std::string* input_type) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_allocated_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_insertion_point(::std::string* insertion_point) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_allocated_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_java_outer_classname(::std::string* java_outer_classname) {$/;"	f	class:google::protobuf::FileOptions
-set_allocated_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_allocated_java_package(::std::string* java_package) {$/;"	f	class:google::protobuf::FileOptions
-set_allocated_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_allocated_leading_comments(::std::string* leading_comments) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_allocated_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::DescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_allocated_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_allocated_name(::std::string* name) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_allocated_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_allocated_name_part(::std::string* name_part) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_allocated_options(::google::protobuf::MessageOptions* options) {$/;"	f	class:google::protobuf::DescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_allocated_options(::google::protobuf::EnumOptions* options) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_allocated_options(::google::protobuf::EnumValueOptions* options) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_options(::google::protobuf::FieldOptions* options) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_options(::google::protobuf::FileOptions* options) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_options(::google::protobuf::MethodOptions* options) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_allocated_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_allocated_options(::google::protobuf::ServiceOptions* options) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_allocated_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_allocated_output_type(::std::string* output_type) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_allocated_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_package(::std::string* package) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_allocated_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_allocated_parameter(::std::string* parameter) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_allocated_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_allocated_source_code_info(::google::protobuf::SourceCodeInfo* source_code_info) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_allocated_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_allocated_string_value(::std::string* string_value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_allocated_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_allocated_trailing_comments(::std::string* trailing_comments) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_allocated_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_allocated_type_name(::std::string* type_name) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::set_allow_alias(bool value) {$/;"	f	class:google::protobuf::EnumOptions
-set_allow_f_after_float	deps/include/google/protobuf/io/tokenizer.h	/^  void set_allow_f_after_float(bool value) { allow_f_after_float_ = value; }$/;"	f	class:google::protobuf::io::Tokenizer
-set_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_cc_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
-set_comment_style	deps/include/google/protobuf/io/tokenizer.h	/^  void set_comment_style(CommentStyle style) { comment_style_ = style; }$/;"	f	class:google::protobuf::io::Tokenizer
-set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_content(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_ctype(::google::protobuf::FieldOptions_CType value) {$/;"	f	class:google::protobuf::FieldOptions
-set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_default_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_dependency(int index, const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_deprecated(bool value) {$/;"	f	class:google::protobuf::FieldOptions
-set_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_double_value(double value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_end(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-set_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_error(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldOptions
-set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const char* value) {$/;"	f	class:google::protobuf::FieldOptions
-set_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_experimental_map_key(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldOptions
-set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_extendee(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_file_to_generate	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_file_to_generate(int index, const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_fixed32	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_fixed32(uint32 value) {$/;"	f	class:google::protobuf::UnknownField
-set_fixed64	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_fixed64(uint64 value) {$/;"	f	class:google::protobuf::UnknownField
-set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
-set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const char* value) {$/;"	f	class:google::protobuf::FileOptions
-set_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_go_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
-set_has_aggregate_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_aggregate_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_allow_alias	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumOptions::set_has_allow_alias() {$/;"	f	class:google::protobuf::EnumOptions
-set_has_cc_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_cc_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-set_has_content	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_content() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_has_ctype	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_ctype() {$/;"	f	class:google::protobuf::FieldOptions
-set_has_default_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_default_value() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_deprecated	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_deprecated() {$/;"	f	class:google::protobuf::FieldOptions
-set_has_double_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_double_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_end	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_has_end() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-set_has_error	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse::set_has_error() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-set_has_experimental_map_key	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_experimental_map_key() {$/;"	f	class:google::protobuf::FieldOptions
-set_has_extendee	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_extendee() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_go_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_go_package() {$/;"	f	class:google::protobuf::FileOptions
-set_has_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_identifier_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_input_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_has_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_insertion_point() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_has_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_has_is_extension() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_has_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_generate_equals_and_hash() {$/;"	f	class:google::protobuf::FileOptions
-set_has_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-set_has_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_multiple_files() {$/;"	f	class:google::protobuf::FileOptions
-set_has_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_outer_classname() {$/;"	f	class:google::protobuf::FileOptions
-set_has_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_java_package() {$/;"	f	class:google::protobuf::FileOptions
-set_has_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_label() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_lazy() {$/;"	f	class:google::protobuf::FieldOptions
-set_has_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_has_leading_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_has_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_has_message_set_wire_format() {$/;"	f	class:google::protobuf::MessageOptions
-set_has_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_has_name() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::DescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_has_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_has_name() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_has_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_has_name_part() {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_has_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_negative_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_has_no_standard_descriptor_accessor() {$/;"	f	class:google::protobuf::MessageOptions
-set_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_number() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_has_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_number() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_optimize_for() {$/;"	f	class:google::protobuf::FileOptions
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::DescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_has_options	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_has_options() {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_has_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_has_output_type() {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_has_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_package() {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_has_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_packed() {$/;"	f	class:google::protobuf::FieldOptions
-set_has_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_has_parameter() {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_has_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_positive_int_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_has_py_generic_services() {$/;"	f	class:google::protobuf::FileOptions
-set_has_source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_has_source_code_info() {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_has_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_has_start() {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-set_has_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_has_string_value() {$/;"	f	class:google::protobuf::UninterpretedOption
-set_has_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_has_trailing_comments() {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_has_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_type() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_has_type_name() {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_has_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_has_weak() {$/;"	f	class:google::protobuf::FieldOptions
-set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_identifier_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_identifier_value(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_input_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_input_type(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_insertion_point	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_insertion_point(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_is_extension	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_is_extension(bool value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_java_generate_equals_and_hash	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_generate_equals_and_hash(bool value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_multiple_files	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_multiple_files(bool value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const char* value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_outer_classname	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_outer_classname(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
-set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const char* value) {$/;"	f	class:google::protobuf::FileOptions
-set_java_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_java_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileOptions
-set_label	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_label(::google::protobuf::FieldDescriptorProto_Label value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_lazy	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_lazy(bool value) {$/;"	f	class:google::protobuf::FieldOptions
-set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const ::std::string& value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const char* value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_leading_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_leading_comments(const char* value, size_t size) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_length_delimited	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_length_delimited(const string& value) {$/;"	f	class:google::protobuf::UnknownField
-set_message_set_wire_format	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_message_set_wire_format(bool value) {$/;"	f	class:google::protobuf::MessageOptions
-set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_name	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorResponse_File::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::DescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::DescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::DescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::EnumDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const ::std::string& value) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const char* value) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void ServiceDescriptorProto::set_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_name_part	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption_NamePart::set_name_part(const char* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-set_negative_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_negative_int_value(::google::protobuf::int64 value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_no_standard_descriptor_accessor	deps/include/google/protobuf/descriptor.pb.h	/^inline void MessageOptions::set_no_standard_descriptor_accessor(bool value) {$/;"	f	class:google::protobuf::MessageOptions
-set_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void EnumValueDescriptorProto::set_number(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-set_number	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_number(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_optimize_for	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_optimize_for(::google::protobuf::FileOptions_OptimizeMode value) {$/;"	f	class:google::protobuf::FileOptions
-set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const ::std::string& value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const char* value) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_output_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void MethodDescriptorProto::set_output_type(const char* value, size_t size) {$/;"	f	class:google::protobuf::MethodDescriptorProto
-set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const ::std::string& value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const char* value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_package	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_package(const char* value, size_t size) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_packed	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_packed(bool value) {$/;"	f	class:google::protobuf::FieldOptions
-set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const ::std::string& value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const char* value) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_parameter	deps/include/google/protobuf/compiler/plugin.pb.h	/^inline void CodeGeneratorRequest::set_parameter(const char* value, size_t size) {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-set_path	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_path(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_positive_int_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_positive_int_value(::google::protobuf::uint64 value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_public_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_public_dependency(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-set_py_generic_services	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileOptions::set_py_generic_services(bool value) {$/;"	f	class:google::protobuf::FileOptions
-set_request_handle	include/ps/kv_app.h	/^  void set_request_handle(const ReqHandle& request_handle) {$/;"	f	class:ps::KVServer
-set_request_handle	include/ps/simple_app.h	/^  virtual inline void set_request_handle(const Handle& request_handle) {$/;"	f	class:ps::SimpleApp
-set_response_handle	include/ps/simple_app.h	/^  virtual inline void set_response_handle(const Handle& response_handle) {$/;"	f	class:ps::SimpleApp
-set_slicer	include/ps/kv_app.h	/^  void set_slicer(const Slicer& slicer) {$/;"	f	class:ps::KVWorker
-set_span	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_span(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_start	deps/include/google/protobuf/descriptor.pb.h	/^inline void DescriptorProto_ExtensionRange::set_start(::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const ::std::string& value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const char* value) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline void UninterpretedOption::set_string_value(const void* value, size_t size) {$/;"	f	class:google::protobuf::UninterpretedOption
-set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const ::std::string& value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const char* value) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline void SourceCodeInfo_Location::set_trailing_comments(const char* value, size_t size) {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-set_type	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type(::google::protobuf::FieldDescriptorProto_Type value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const ::std::string& value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const char* value) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldDescriptorProto::set_type_name(const char* value, size_t size) {$/;"	f	class:google::protobuf::FieldDescriptorProto
-set_varint	deps/include/google/protobuf/unknown_field_set.h	/^inline void UnknownField::set_varint(uint64 value) {$/;"	f	class:google::protobuf::UnknownField
-set_weak	deps/include/google/protobuf/descriptor.pb.h	/^inline void FieldOptions::set_weak(bool value) {$/;"	f	class:google::protobuf::FieldOptions
-set_weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline void FileDescriptorProto::set_weak_dependency(int index, ::google::protobuf::int32 value) {$/;"	f	class:google::protobuf::FileDescriptorProto
-setup	docs/conf.py	/^def setup(app):$/;"	f
-signal	tracker/dmlc_local.py	/^import signal$/;"	i
-simple_app	include/ps/internal/message.h	/^  bool simple_app;$/;"	m	struct:ps::Meta
-single_line_mode_	deps/include/google/protobuf/text_format.h	/^    bool single_line_mode_;$/;"	m	class:google::protobuf::TextFormat::Printer
-size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedField<Element>::size() const {$/;"	f	class:google::protobuf::RepeatedField
-size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrField<Element>::size() const {$/;"	f	class:google::protobuf::RepeatedPtrField
-size	deps/include/google/protobuf/repeated_field.h	/^inline int RepeatedPtrFieldBase::size() const {$/;"	f	class:google::protobuf::internal::RepeatedPtrFieldBase
-size	include/ps/range.h	/^  uint64_t size() const { return end_ - begin_; }$/;"	f	class:ps::Range
-size	include/ps/sarray.h	/^  inline size_t size() const { return size_; }$/;"	f	class:ps::SArray
-size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int size_;           \/\/ Total size of the array.$/;"	m	class:google::protobuf::io::ArrayInputStream
-size_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  const int size_;           \/\/ Total size of the array.$/;"	m	class:google::protobuf::io::ArrayOutputStream
-size_	include/ps/sarray.h	/^  size_t size_ = 0;$/;"	m	class:ps::SArray
-size_type	deps/include/google/protobuf/repeated_field.h	/^  typedef int size_type;$/;"	t	class:google::protobuf::RepeatedField
-size_type	deps/include/google/protobuf/repeated_field.h	/^  typedef int size_type;$/;"	t	class:google::protobuf::RepeatedPtrField
-slave_envs	tracker/tracker.py	/^    def slave_envs(self):$/;"	m	class:PSTracker
-slave_envs	tracker/tracker.py	/^    def slave_envs(self):$/;"	m	class:RabitTracker
-slicer_	include/ps/kv_app.h	/^  Slicer slicer_;$/;"	m	class:ps::KVWorker
-small_	deps/include/google/protobuf/stubs/template_util.h	/^typedef char small_;$/;"	t	namespace:google::protobuf::internal
-snprintf	include/dmlc/base.h	/^#define snprintf /;"	d
-socket	deps/include/zmq.h	/^    void *socket;$/;"	m	struct:zmq_pollitem_t
-socket	tracker/tracker.py	/^import socket$/;"	i
-source_code_info	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::SourceCodeInfo& FileDescriptorProto::source_code_info() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-source_code_info_	deps/include/google/protobuf/compiler/parser.h	/^  SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::compiler::Parser
-source_code_info_	deps/include/google/protobuf/descriptor.h	/^  const SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::FileDescriptor
-source_code_info_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::SourceCodeInfo* source_code_info_;$/;"	m	class:google::protobuf::FileDescriptorProto
-source_info_in_descriptor_set_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  bool source_info_in_descriptor_set_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-source_location_table_	deps/include/google/protobuf/compiler/parser.h	/^  SourceLocationTable* source_location_table_;  \/\/ legacy$/;"	m	class:google::protobuf::compiler::Parser
-source_locations_	deps/include/google/protobuf/compiler/importer.h	/^  SourceLocationTable source_locations_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-source_parsers	docs/conf.py	/^source_parsers = {$/;"	v
-source_suffix	docs/conf.py	/^source_suffix = ['.md']$/;"	v
-source_tree_	deps/include/google/protobuf/compiler/importer.h	/^  SourceTree* source_tree_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-sources_	deps/include/google/protobuf/descriptor_database.h	/^  vector<DescriptorDatabase*> sources_;$/;"	m	class:google::protobuf::MergedDescriptorDatabase
-span	deps/include/google/protobuf/descriptor.pb.h	/^SourceCodeInfo_Location::span() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-span	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 SourceCodeInfo_Location::span(int index) const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-span_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > span_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-span_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int SourceCodeInfo_Location::span_size() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-srandom	src/windows/unistd.h	/^#define srandom /;"	d
-ssh_submit	tracker/dmlc_ssh.py	/^        def ssh_submit(nworker, nserver, pass_envs):$/;"	f	function:SSHLauncher.submit
-ssize_t	src/windows/unistd.h	/^#define ssize_t /;"	d
-start	deps/include/google/protobuf/descriptor.h	/^    int start;  \/\/ inclusive$/;"	m	struct:google::protobuf::Descriptor::ExtensionRange
-start	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 DescriptorProto_ExtensionRange::start() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-start	tracker/tracker.py	/^    def start(self, nslave):$/;"	m	class:RabitTracker
-start_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::int32 start_;$/;"	m	class:google::protobuf::DescriptorProto_ExtensionRange
-start_column	deps/include/google/protobuf/descriptor.h	/^  int start_column;$/;"	m	struct:google::protobuf::SourceLocation
-start_line	deps/include/google/protobuf/descriptor.h	/^  int start_line;$/;"	m	struct:google::protobuf::SourceLocation
-start_time_	include/ps/internal/postoffice.h	/^  time_t start_time_;$/;"	m	class:ps::Postoffice
-static_descriptor_initializer_meta_2eproto_	src/meta.pb.cc	/^} static_descriptor_initializer_meta_2eproto_;$/;"	m	namespace:ps	typeref:struct:ps::StaticDescriptorInitializer_meta_2eproto	file:
-std	deps/include/google/protobuf/stubs/common.h	/^namespace std {}$/;"	n
-stop_after_syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  bool stop_after_syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
-store	include/ps/kv_app.h	/^  std::unordered_map<Key, Val> store;$/;"	m	struct:ps::KVServerDefaultHandle
-stream_count_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  int stream_count_;$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
-streams_	deps/include/google/protobuf/io/zero_copy_stream_impl.h	/^  ZeroCopyInputStream* const* streams_;$/;"	m	class:google::protobuf::io::ConcatenatingInputStream
-string_value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& UninterpretedOption::string_value() const {$/;"	f	class:google::protobuf::UninterpretedOption
-string_value	deps/include/google/protobuf/extension_set.h	/^      string*               string_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-string_value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* string_value_;$/;"	m	class:google::protobuf::UninterpretedOption
-string_value_	deps/include/google/protobuf/unknown_field_set.h	/^      string* string_value_;$/;"	m	union:google::protobuf::UnknownField::__anon4::__anon5
-struct	tracker/tracker.py	/^import struct$/;"	i
-sub_data_	deps/include/google/protobuf/io/gzip_stream.h	/^  void* sub_data_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-sub_data_size_	deps/include/google/protobuf/io/gzip_stream.h	/^  int sub_data_size_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-sub_stream_	deps/include/google/protobuf/io/gzip_stream.h	/^  ZeroCopyInputStream* sub_stream_;$/;"	m	class:google::protobuf::io::GzipInputStream
-sub_stream_	deps/include/google/protobuf/io/gzip_stream.h	/^  ZeroCopyOutputStream* sub_stream_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-submit	tracker/dmlc_local.py	/^    def submit(self):$/;"	m	class:LocalLauncher
-submit	tracker/dmlc_ssh.py	/^    def submit(self):$/;"	m	class:SSHLauncher
-submit	tracker/tracker.py	/^def submit(nworker, nserver, fun_submit, hostIP = 'auto', pscmd = None):$/;"	f
-subprocess	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
-subprocess	tracker/dmlc_local.py	/^import subprocess$/;"	i
-subprocess	tracker/dmlc_mpi.py	/^import subprocess$/;"	i
-subprocess	tracker/dmlc_ssh.py	/^import subprocess$/;"	i
-subprocess	tracker/tracker.py	/^import subprocess$/;"	i
-superclass	deps/include/google/protobuf/repeated_field.h	/^          std::random_access_iterator_tag, Element*> superclass;$/;"	t	class:google::protobuf::internal::RepeatedPtrOverPtrsIterator
-superclass	deps/include/google/protobuf/repeated_field.h	/^          std::random_access_iterator_tag, Element> superclass;$/;"	t	class:google::protobuf::internal::RepeatedPtrIterator
-swap	deps/include/google/protobuf/stubs/common.h	/^  void swap(scoped_array& p2) {$/;"	f	class:google::protobuf::internal::scoped_array
-swap	deps/include/google/protobuf/stubs/common.h	/^  void swap(scoped_ptr& p2) {$/;"	f	class:google::protobuf::internal::scoped_ptr
-sync_dir	tracker/dmlc_ssh.py	/^    def sync_dir(self, local_dir, slave_node, slave_dir):$/;"	m	class:SSHLauncher
-syntax_identifier_	deps/include/google/protobuf/compiler/parser.h	/^  string syntax_identifier_;$/;"	m	class:google::protobuf::compiler::Parser
-sys	docs/conf.py	/^import sys$/;"	i
-sys	docs/sphinx_util.py	/^import sys, os, subprocess$/;"	i
-sys	tests/lint.py	/^import sys$/;"	i
-sys	tracker/dmlc_local.py	/^import sys$/;"	i
-sys	tracker/dmlc_mpi.py	/^import sys$/;"	i
-sys	tracker/dmlc_ssh.py	/^import sys$/;"	i
-sys	tracker/tracker.py	/^import sys$/;"	i
-tables_	deps/include/google/protobuf/descriptor.h	/^  const FileDescriptorTables* tables_;$/;"	m	class:google::protobuf::FileDescriptor
-tables_	deps/include/google/protobuf/descriptor.h	/^  scoped_ptr<Tables> tables_;$/;"	m	class:google::protobuf::DescriptorPool
-target_	deps/include/google/protobuf/io/zero_copy_stream_impl_lite.h	/^  string* target_;$/;"	m	class:google::protobuf::io::StringOutputStream
-templates_path	docs/conf.py	/^templates_path = ['_templates']$/;"	v
-texinfo_documents	docs/conf.py	/^texinfo_documents = [$/;"	v
-text	deps/include/google/protobuf/io/tokenizer.h	/^    string text;       \/\/ The exact text of the token as it appeared in$/;"	m	struct:google::protobuf::io::Tokenizer::Token
-time	tracker/tracker.py	/^import time$/;"	i
-timeout_	src/resender.h	/^  int timeout_;$/;"	m	class:ps::Resender
-timestamp	include/ps/internal/message.h	/^  int timestamp;$/;"	m	struct:ps::Meta
-timestamp	include/ps/kv_app.h	/^  int timestamp;$/;"	m	struct:ps::KVMeta
-timestamp	include/ps/simple_app.h	/^  int timestamp;$/;"	m	struct:ps::SimpleData
-todo_include_todos	docs/conf.py	/^todo_include_todos = False$/;"	v
-total_bytes_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_;  \/\/ Sum of sizes of all buffers seen so far.$/;"	m	class:google::protobuf::io::CodedOutputStream
-total_bytes_limit_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_limit_;$/;"	m	class:google::protobuf::io::CodedInputStream
-total_bytes_read_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_read_;  \/\/ total bytes read from input_, including$/;"	m	class:google::protobuf::io::CodedInputStream
-total_bytes_warning_threshold_	deps/include/google/protobuf/io/coded_stream.h	/^  int total_bytes_warning_threshold_;$/;"	m	class:google::protobuf::io::CodedInputStream
-total_size_	deps/include/google/protobuf/repeated_field.h	/^  int      total_size_;$/;"	m	class:google::protobuf::RepeatedField
-total_size_	deps/include/google/protobuf/repeated_field.h	/^  int    total_size_;$/;"	m	class:google::protobuf::internal::RepeatedPtrFieldBase
-tracker	tracker/dmlc_local.py	/^import tracker$/;"	i
-tracker	tracker/dmlc_mpi.py	/^import tracker$/;"	i
-tracker	tracker/dmlc_ssh.py	/^import tracker$/;"	i
-tracker_	include/ps/internal/customer.h	/^  std::vector<std::pair<int, int>> tracker_;$/;"	m	class:ps::Customer
-tracker_cond_	include/ps/internal/customer.h	/^  std::condition_variable tracker_cond_;$/;"	m	class:ps::Customer
-tracker_mu_	include/ps/internal/customer.h	/^  std::mutex tracker_mu_;$/;"	m	class:ps::Customer
-trailing_comments	deps/include/google/protobuf/descriptor.h	/^  string trailing_comments;$/;"	m	struct:google::protobuf::SourceLocation
-trailing_comments	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& SourceCodeInfo_Location::trailing_comments() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-trailing_comments_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* trailing_comments_;$/;"	m	class:google::protobuf::SourceCodeInfo_Location
-transform	docs/sphinx_util.py	/^from recommonmark import parser, transform$/;"	i
-true_	deps/include/google/protobuf/stubs/template_util.h	/^typedef true_type  true_;$/;"	t	namespace:google::protobuf::internal
-true_type	deps/include/google/protobuf/stubs/template_util.h	/^typedef integral_constant<bool, true>  true_type;$/;"	t	namespace:google::protobuf::internal
-type	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::FieldDescriptorProto_Type FieldDescriptorProto::type() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-type	deps/include/google/protobuf/extension_set.h	/^    FieldType type;$/;"	m	struct:google::protobuf::internal::ExtensionSet::Extension
-type	deps/include/google/protobuf/extension_set.h	/^  FieldType type;$/;"	m	struct:google::protobuf::internal::ExtensionInfo
-type	deps/include/google/protobuf/io/tokenizer.h	/^    TokenType type;$/;"	m	struct:google::protobuf::io::Tokenizer::Token
-type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef A type;$/;"	t	struct:google::protobuf::internal::if_
-type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef B type;$/;"	t	struct:google::protobuf::internal::if_
-type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef T type;$/;"	t	struct:google::protobuf::internal::identity_
-type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef integral_constant<T, v> type;$/;"	t	struct:google::protobuf::internal::integral_constant
-type	deps/include/google/protobuf/stubs/type_traits.h	/^  typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
-type	deps/include/google/protobuf/stubs/type_traits.h	/^  typedef typename remove_const<typename remove_volatile<T>::type>::type type;$/;"	t	struct:google::protobuf::internal::remove_cv
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference { typedef T& type; };$/;"	t	struct:google::protobuf::internal::add_reference
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template <typename T> struct add_reference<T&> { typedef T& type; };$/;"	t	struct:google::protobuf::internal::add_reference
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_const
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_const<T const> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_const
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* const> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T* volatile> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_pointer<T*> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_pointer
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_reference
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_reference<T&> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_reference
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_volatile
-type	deps/include/google/protobuf/stubs/type_traits.h	/^template<typename T> struct remove_volatile<T volatile> { typedef T type; };$/;"	t	struct:google::protobuf::internal::remove_volatile
-type	deps/include/google/protobuf/unknown_field_set.h	/^inline UnknownField::Type UnknownField::type() const {$/;"	f	class:google::protobuf::UnknownField
-type_	deps/include/google/protobuf/descriptor.h	/^  Type type_;$/;"	m	class:google::protobuf::FieldDescriptor
-type_	deps/include/google/protobuf/descriptor.h	/^  const EnumDescriptor* type_;$/;"	m	class:google::protobuf::EnumValueDescriptor
-type_	deps/include/google/protobuf/descriptor.pb.h	/^  int type_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-type_equals_	deps/include/google/protobuf/stubs/template_util.h	/^struct type_equals_ : public false_ {$/;"	s	namespace:google::protobuf::internal
-type_equals_	deps/include/google/protobuf/stubs/template_util.h	/^struct type_equals_<A, A> : public true_ {$/;"	s	namespace:google::protobuf::internal
-type_name	deps/include/google/protobuf/descriptor.h	/^inline const char* FieldDescriptor::type_name() const {$/;"	f	class:google::protobuf::FieldDescriptor
-type_name	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::std::string& FieldDescriptorProto::type_name() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-type_name_	deps/include/google/protobuf/descriptor.pb.h	/^  ::std::string* type_name_;$/;"	m	class:google::protobuf::FieldDescriptorProto
-uint	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned int uint;$/;"	t	namespace:google::protobuf
-uint16	deps/include/google/protobuf/stubs/common.h	/^typedef uint16_t uint16;$/;"	t	namespace:google::protobuf
-uint16	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int16 uint16;$/;"	t	namespace:google::protobuf
-uint16_t	include/dmlc/base.h	/^typedef unsigned __int16 uint16_t;$/;"	t
-uint16_t	include/ps/internal/utils.h	/^typedef unsigned __int16 uint16_t;$/;"	t	namespace:ps
-uint32	deps/include/google/protobuf/stubs/common.h	/^typedef uint32_t uint32;$/;"	t	namespace:google::protobuf
-uint32	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int32 uint32;$/;"	t	namespace:google::protobuf
-uint32_t	include/dmlc/base.h	/^typedef unsigned __int32 uint32_t;$/;"	t
-uint32_t	include/ps/internal/utils.h	/^typedef unsigned __int32 uint32_t;$/;"	t	namespace:ps
-uint32_value	deps/include/google/protobuf/extension_set.h	/^      uint32                uint32_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-uint64	deps/include/google/protobuf/stubs/common.h	/^typedef uint64_t uint64;$/;"	t	namespace:google::protobuf
-uint64	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int64 uint64;$/;"	t	namespace:google::protobuf
-uint64_t	include/dmlc/base.h	/^typedef unsigned __int64 uint64_t;$/;"	t
-uint64_t	include/ps/internal/utils.h	/^typedef unsigned __int64 uint64_t;$/;"	t	namespace:ps
-uint64_value	deps/include/google/protobuf/extension_set.h	/^      uint64                uint64_value;$/;"	m	union:google::protobuf::internal::ExtensionSet::Extension::__anon3
-uint8	deps/include/google/protobuf/stubs/common.h	/^typedef uint8_t  uint8;$/;"	t	namespace:google::protobuf
-uint8	deps/include/google/protobuf/stubs/common.h	/^typedef unsigned __int8  uint8;$/;"	t	namespace:google::protobuf
-uint8_t	include/dmlc/base.h	/^typedef unsigned char uint8_t;$/;"	t
-uint8_t	include/ps/internal/utils.h	/^typedef unsigned char    uint8_t;$/;"	t	namespace:ps
-underlay_	deps/include/google/protobuf/descriptor.h	/^  const DescriptorPool* underlay_;$/;"	m	class:google::protobuf::DescriptorPool
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::EnumOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^EnumValueOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::EnumValueOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FieldOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::FieldOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^FileOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::FileOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MessageOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::MessageOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^MethodOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::MethodOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^ServiceOptions::uninterpreted_option() const {$/;"	f	class:google::protobuf::ServiceOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& EnumOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::EnumOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& EnumValueOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::EnumValueOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& FieldOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::FieldOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& FileOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::FileOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& MessageOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::MessageOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& MethodOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::MethodOptions
-uninterpreted_option	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::UninterpretedOption& ServiceOptions::uninterpreted_option(int index) const {$/;"	f	class:google::protobuf::ServiceOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::EnumOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::EnumValueOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::FieldOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::FileOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::MessageOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::MethodOptions
-uninterpreted_option_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::UninterpretedOption > uninterpreted_option_;$/;"	m	class:google::protobuf::ServiceOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::EnumOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumValueOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::EnumValueOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FieldOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::FieldOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::FileOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int MessageOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::MessageOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int MethodOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::MethodOptions
-uninterpreted_option_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int ServiceOptions::uninterpreted_option_size() const {$/;"	f	class:google::protobuf::ServiceOptions
-unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorRequest
-unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse
-unknown_fields	deps/include/google/protobuf/compiler/plugin.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::compiler::CodeGeneratorResponse_File
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::DescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::DescriptorProto_ExtensionRange
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumValueDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::EnumValueOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FieldDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FieldOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileDescriptorSet
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::FileOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MessageOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MethodDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::MethodOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::ServiceDescriptorProto
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::ServiceOptions
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::SourceCodeInfo
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::SourceCodeInfo_Location
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::UninterpretedOption
-unknown_fields	deps/include/google/protobuf/descriptor.pb.h	/^  inline const ::google::protobuf::UnknownFieldSet& unknown_fields() const {$/;"	f	class:google::protobuf::UninterpretedOption_NamePart
-unknown_fields_	deps/include/google/protobuf/wire_format.h	/^  UnknownFieldSet* unknown_fields_;$/;"	m	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
-unknown_fields_offset_	deps/include/google/protobuf/generated_message_reflection.h	/^  int unknown_fields_offset_;$/;"	m	class:google::protobuf::internal::GeneratedMessageReflection
-unlink	src/windows/unistd.h	/^#define unlink /;"	d
-upb	deps/include/google/protobuf/generated_message_reflection.h	/^namespace upb {$/;"	n	namespace:google
-upb	deps/include/google/protobuf/repeated_field.h	/^namespace upb {$/;"	n	namespace:google
-upcoming_doc_comments_	deps/include/google/protobuf/compiler/parser.h	/^  string upcoming_doc_comments_;$/;"	m	class:google::protobuf::compiler::Parser
-use_short_repeated_primitives_	deps/include/google/protobuf/text_format.h	/^    bool use_short_repeated_primitives_;$/;"	m	class:google::protobuf::TextFormat::Printer
-using_validation_error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  bool using_validation_error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-utf8_string_escaping_	deps/include/google/protobuf/text_format.h	/^    bool utf8_string_escaping_;$/;"	m	class:google::protobuf::TextFormat::Printer
-validation_error_collector_	deps/include/google/protobuf/compiler/importer.h	/^  ValidationErrorCollector validation_error_collector_;$/;"	m	class:google::protobuf::compiler::SourceTreeDescriptorDatabase
-vals	include/ps/kv_app.h	/^  SArray<Val> vals;$/;"	m	struct:ps::KVPairs
-value	deps/include/google/protobuf/descriptor.pb.h	/^EnumDescriptorProto::value() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-value	deps/include/google/protobuf/descriptor.pb.h	/^inline const ::google::protobuf::EnumValueDescriptorProto& EnumDescriptorProto::value(int index) const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-value	deps/include/google/protobuf/io/coded_stream.h	/^    static const int value =$/;"	m	struct:google::protobuf::io::CodedOutputStream::StaticVarintSize32
-value	deps/include/google/protobuf/stubs/template_util.h	/^  static const T value = v;$/;"	m	struct:google::protobuf::internal::integral_constant
-value	deps/include/google/protobuf/stubs/template_util.h	/^template <class T, T v> const T integral_constant<T, v>::value;$/;"	m	class:google::protobuf::internal::integral_constant
-value	deps/include/google/protobuf/stubs/type_traits.h	/^  static const bool value = sizeof(tester<T>(0)) == sizeof(small_);$/;"	m	struct:google::protobuf::internal::internal::is_class_or_union
-value_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedPtrField< ::google::protobuf::EnumValueDescriptorProto > value_;$/;"	m	class:google::protobuf::EnumDescriptorProto
-value_count_	deps/include/google/protobuf/descriptor.h	/^  int value_count_;$/;"	m	class:google::protobuf::EnumDescriptor
-value_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int EnumDescriptorProto::value_size() const {$/;"	f	class:google::protobuf::EnumDescriptorProto
-value_type	deps/include/google/protobuf/repeated_field.h	/^  typedef Element value_type;$/;"	t	class:google::protobuf::RepeatedField
-value_type	deps/include/google/protobuf/repeated_field.h	/^  typedef Element value_type;$/;"	t	class:google::protobuf::RepeatedPtrField
-value_type	deps/include/google/protobuf/stubs/template_util.h	/^  typedef T value_type;$/;"	t	struct:google::protobuf::internal::integral_constant
-values_	deps/include/google/protobuf/descriptor.h	/^  EnumValueDescriptor* values_;$/;"	m	class:google::protobuf::EnumDescriptor
-van	include/ps/internal/postoffice.h	/^  Van* van() { return van_; }$/;"	f	class:ps::Postoffice
-van_	include/ps/internal/postoffice.h	/^  Van* van_;$/;"	m	class:ps::Postoffice
-van_	src/resender.h	/^  Van* van_;$/;"	m	class:ps::Resender
-variable_delimiter_	deps/include/google/protobuf/io/printer.h	/^  const char variable_delimiter_;$/;"	m	class:google::protobuf::io::Printer
-varint	deps/include/google/protobuf/unknown_field_set.h	/^inline uint64 UnknownField::varint () const {$/;"	f	class:google::protobuf::UnknownField
-varint_	deps/include/google/protobuf/unknown_field_set.h	/^    uint64 varint_;$/;"	m	union:google::protobuf::UnknownField::__anon4
-verbose	include/ps/internal/postoffice.h	/^  int verbose() const { return verbose_; }$/;"	f	class:ps::Postoffice
-verbose_	include/ps/internal/postoffice.h	/^  int verbose_;$/;"	m	class:ps::Postoffice
-version	docs/conf.py	/^version = u'1.0'$/;"	v
-version_info_	deps/include/google/protobuf/compiler/command_line_interface.h	/^  string version_info_;$/;"	m	class:google::protobuf::compiler::CommandLineInterface
-virtual_path	deps/include/google/protobuf/compiler/importer.h	/^    string virtual_path;$/;"	m	struct:google::protobuf::compiler::DiskSourceTree::Mapping
-vsnprintf	include/dmlc/base.h	/^#define vsnprintf /;"	d
-weak	deps/include/google/protobuf/descriptor.pb.h	/^inline bool FieldOptions::weak() const {$/;"	f	class:google::protobuf::FieldOptions
-weak_	deps/include/google/protobuf/descriptor.pb.h	/^  bool weak_;$/;"	m	class:google::protobuf::FieldOptions
-weak_dependencies_	deps/include/google/protobuf/descriptor.h	/^  int* weak_dependencies_;$/;"	m	class:google::protobuf::FileDescriptor
-weak_dependency	deps/include/google/protobuf/descriptor.h	/^inline const FileDescriptor* FileDescriptor::weak_dependency($/;"	f	class:google::protobuf::FileDescriptor
-weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^FileDescriptorProto::weak_dependency() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-weak_dependency	deps/include/google/protobuf/descriptor.pb.h	/^inline ::google::protobuf::int32 FileDescriptorProto::weak_dependency(int index) const {$/;"	f	class:google::protobuf::FileDescriptorProto
-weak_dependency_	deps/include/google/protobuf/descriptor.pb.h	/^  ::google::protobuf::RepeatedField< ::google::protobuf::int32 > weak_dependency_;$/;"	m	class:google::protobuf::FileDescriptorProto
-weak_dependency_count_	deps/include/google/protobuf/descriptor.h	/^  int weak_dependency_count_;$/;"	m	class:google::protobuf::FileDescriptor
-weak_dependency_size	deps/include/google/protobuf/descriptor.pb.h	/^inline int FileDescriptorProto::weak_dependency_size() const {$/;"	f	class:google::protobuf::FileDescriptorProto
-zcontext_	deps/include/google/protobuf/io/gzip_stream.h	/^  z_stream zcontext_;$/;"	m	class:google::protobuf::io::GzipInputStream
-zcontext_	deps/include/google/protobuf/io/gzip_stream.h	/^  z_stream zcontext_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-zerror_	deps/include/google/protobuf/io/gzip_stream.h	/^  int zerror_;$/;"	m	class:google::protobuf::io::GzipInputStream
-zerror_	deps/include/google/protobuf/io/gzip_stream.h	/^  int zerror_;$/;"	m	class:google::protobuf::io::GzipOutputStream
-zmq_free_fn	deps/include/zmq.h	/^typedef void (zmq_free_fn) (void *data, void *hint);$/;"	t
-zmq_msg_t	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	s
-zmq_msg_t	deps/include/zmq.h	/^typedef struct zmq_msg_t {unsigned char _ [64];} zmq_msg_t;$/;"	t	typeref:struct:zmq_msg_t
-zmq_pollitem_t	deps/include/zmq.h	/^typedef struct zmq_pollitem_t$/;"	s
-zmq_pollitem_t	deps/include/zmq.h	/^} zmq_pollitem_t;$/;"	t	typeref:struct:zmq_pollitem_t
-zmq_thread_fn	deps/include/zmq.h	/^typedef void (zmq_thread_fn) (void*);$/;"	t
-~Customer	src/customer.cc	/^Customer::~Customer() {$/;"	f	class:ps::Customer
-~FieldSkipper	deps/include/google/protobuf/wire_format_lite.h	/^  virtual ~FieldSkipper() {}$/;"	f	class:google::protobuf::internal::FieldSkipper
-~FunctionClosure1	deps/include/google/protobuf/stubs/common.h	/^  ~FunctionClosure1() {}$/;"	f	class:google::protobuf::internal::FunctionClosure1
-~FunctionClosure2	deps/include/google/protobuf/stubs/common.h	/^  ~FunctionClosure2() {}$/;"	f	class:google::protobuf::internal::FunctionClosure2
-~GeneratedExtensionFinder	deps/include/google/protobuf/extension_set.h	/^  virtual ~GeneratedExtensionFinder() {}$/;"	f	class:google::protobuf::internal::GeneratedExtensionFinder
-~KVServer	include/ps/kv_app.h	/^  virtual ~KVServer() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::KVServer
-~KVWorker	include/ps/kv_app.h	/^  virtual ~KVWorker() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::KVWorker
-~LazyMessageExtension	deps/include/google/protobuf/extension_set.h	/^    virtual ~LazyMessageExtension() {}$/;"	f	class:google::protobuf::internal::ExtensionSet::LazyMessageExtension
-~MethodClosure0	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure0() {}$/;"	f	class:google::protobuf::internal::MethodClosure0
-~MethodClosure1	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure1() {}$/;"	f	class:google::protobuf::internal::MethodClosure1
-~MethodClosure2	deps/include/google/protobuf/stubs/common.h	/^  ~MethodClosure2() {}$/;"	f	class:google::protobuf::internal::MethodClosure2
-~MutexLock	deps/include/google/protobuf/stubs/common.h	/^  ~MutexLock() { this->mu_->Unlock(); }$/;"	f	class:google::protobuf::internal::MutexLock
-~MutexLockMaybe	deps/include/google/protobuf/stubs/common.h	/^  ~MutexLockMaybe() { if (this->mu_ != NULL) { this->mu_->Unlock(); } }$/;"	f	class:google::protobuf::internal::MutexLockMaybe
-~PBControl	src/meta.pb.cc	/^PBControl::~PBControl() {$/;"	f	class:ps::PBControl
-~PBMeta	src/meta.pb.cc	/^PBMeta::~PBMeta() {$/;"	f	class:ps::PBMeta
-~PBNode	src/meta.pb.cc	/^PBNode::~PBNode() {$/;"	f	class:ps::PBNode
-~Postoffice	include/ps/internal/postoffice.h	/^  ~Postoffice() { delete van_; }$/;"	f	class:ps::Postoffice
-~RepeatedField	deps/include/google/protobuf/repeated_field.h	/^RepeatedField<Element>::~RepeatedField() {$/;"	f	class:google::protobuf::RepeatedField
-~RepeatedPtrField	deps/include/google/protobuf/repeated_field.h	/^RepeatedPtrField<Element>::~RepeatedPtrField() {$/;"	f	class:google::protobuf::RepeatedPtrField
-~Resender	src/resender.h	/^  ~Resender() {$/;"	f	class:ps::Resender
-~SArray	include/ps/sarray.h	/^  ~SArray() { }$/;"	f	class:ps::SArray
-~SimpleApp	include/ps/simple_app.h	/^  virtual ~SimpleApp() { delete obj_; obj_ = nullptr; }$/;"	f	class:ps::SimpleApp
-~ThreadsafeQueue	include/ps/internal/threadsafe_queue.h	/^  ~ThreadsafeQueue() { }$/;"	f	class:ps::ThreadsafeQueue
-~UnknownFieldSetFieldSkipper	deps/include/google/protobuf/wire_format.h	/^  virtual ~UnknownFieldSetFieldSkipper() {}$/;"	f	class:google::protobuf::internal::UnknownFieldSetFieldSkipper
-~Van	include/ps/internal/van.h	/^  virtual ~Van() { }$/;"	f	class:ps::Van
-~ZMQVan	src/zmq_van.h	/^  virtual ~ZMQVan() { }$/;"	f	class:ps::ZMQVan
-~scoped_array	deps/include/google/protobuf/stubs/common.h	/^  ~scoped_array() {$/;"	f	class:google::protobuf::internal::scoped_array
-~scoped_ptr	deps/include/google/protobuf/stubs/common.h	/^  ~scoped_ptr() {$/;"	f	class:google::protobuf::internal::scoped_ptr
diff --git a/ps-lite/tests/README.md b/ps-lite/tests/README.md
deleted file mode 100644
index a17e6cc0..00000000
--- a/ps-lite/tests/README.md
+++ /dev/null
@@ -1,7 +0,0 @@
-How to use
-
-build by `make test` in the root directory, then run
-
-```bash
-find test_* -type f -executable -exec ./repeat.sh 4 ./local.sh 2 2 ./{} \;
-```
diff --git a/ps-lite/tests/lint.py b/ps-lite/tests/lint.py
deleted file mode 100755
index 4dd898be..00000000
--- a/ps-lite/tests/lint.py
+++ /dev/null
@@ -1,173 +0,0 @@
-#!/usr/bin/env python
-# pylint: disable=protected-access, unused-variable, locally-disabled, redefined-variable-type
-"""Lint helper to generate lint summary of source.
-
-Copyright by Contributors
-"""
-import codecs
-import sys
-import re
-import os
-import cpplint
-from cpplint import _cpplint_state
-from pylint import epylint
-
-CXX_SUFFIX = set(['cc', 'c', 'cpp', 'h', 'cu', 'hpp'])
-PYTHON_SUFFIX = set(['py'])
-
-class LintHelper(object):
-    """Class to help runing the lint and records summary"""
-
-    @staticmethod
-    def _print_summary_map(strm, result_map, ftype):
-        """Print summary of certain result map."""
-        if len(result_map) == 0:
-            return 0
-        npass = len([x for k, x in result_map.iteritems() if len(x) == 0])
-        strm.write('=====%d/%d %s files passed check=====\n' % (npass, len(result_map), ftype))
-        for fname, emap in result_map.iteritems():
-            if len(emap) == 0:
-                continue
-            strm.write('%s: %d Errors of %d Categories map=%s\n' % (
-                fname, sum(emap.values()), len(emap), str(emap)))
-        return len(result_map) - npass
-
-    def __init__(self):
-        self.project_name = None
-        self.cpp_header_map = {}
-        self.cpp_src_map = {}
-        self.python_map = {}
-        pylint_disable = ['superfluous-parens',
-                          'too-many-instance-attributes',
-                          'too-few-public-methods']
-        # setup pylint
-        self.pylint_opts = ['--extension-pkg-whitelist=numpy',
-                            '--disable=' + ','.join(pylint_disable)]
-
-        self.pylint_cats = set(['error', 'warning', 'convention', 'refactor'])
-        # setup cpp lint
-        cpplint_args = ['.', '--extensions=' + (','.join(CXX_SUFFIX))]
-        _ = cpplint.ParseArguments(cpplint_args)
-        cpplint._SetFilters(','.join(['-build/c++11',
-                                      '-build/namespaces',
-                                      '-build/include,',
-                                      '+build/include_what_you_use',
-                                      '+build/include_order']))
-        cpplint._SetCountingStyle('toplevel')
-        cpplint._line_length = 100
-
-    def process_cpp(self, path, suffix):
-        """Process a cpp file."""
-        _cpplint_state.ResetErrorCounts()
-        cpplint.ProcessFile(str(path), _cpplint_state.verbose_level)
-        _cpplint_state.PrintErrorCounts()
-        errors = _cpplint_state.errors_by_category.copy()
-
-        if suffix == 'h':
-            self.cpp_header_map[str(path)] = errors
-        else:
-            self.cpp_src_map[str(path)] = errors
-
-    def process_python(self, path):
-        """Process a python file."""
-        (pylint_stdout, pylint_stderr) = epylint.py_run(
-            ' '.join([str(path)] + self.pylint_opts), return_std=True)
-        emap = {}
-        print pylint_stderr.read()
-        for line in pylint_stdout:
-            sys.stderr.write(line)
-            key = line.split(':')[-1].split('(')[0].strip()
-            if key not in self.pylint_cats:
-                continue
-            if key not in emap:
-                emap[key] = 1
-            else:
-                emap[key] += 1
-        sys.stderr.write('\n')
-        self.python_map[str(path)] = emap
-
-    def print_summary(self, strm):
-        """Print summary of lint."""
-        nerr = 0
-        nerr += LintHelper._print_summary_map(strm, self.cpp_header_map, 'cpp-header')
-        nerr += LintHelper._print_summary_map(strm, self.cpp_src_map, 'cpp-soruce')
-        nerr += LintHelper._print_summary_map(strm, self.python_map, 'python')
-        if nerr == 0:
-            strm.write('All passed!\n')
-        else:
-            strm.write('%d files failed lint\n' % nerr)
-        return nerr
-
-# singleton helper for lint check
-_HELPER = LintHelper()
-
-def get_header_guard_dmlc(filename):
-    """Get Header Guard Convention for DMLC Projects.
-
-    For headers in include, directly use the path
-    For headers in src, use project name plus path
-
-    Examples: with project-name = dmlc
-        include/dmlc/timer.h -> DMLC_TIMTER_H_
-        src/io/libsvm_parser.h -> DMLC_IO_LIBSVM_PARSER_H_
-    """
-    fileinfo = cpplint.FileInfo(filename)
-    file_path_from_root = fileinfo.RepositoryName()
-    inc_list = ['include', 'api', 'wrapper']
-
-    if file_path_from_root.find('src/') != -1 and _HELPER.project_name is not None:
-        idx = file_path_from_root.find('src/')
-        file_path_from_root = _HELPER.project_name +  file_path_from_root[idx + 3:]
-    else:
-        for spath in inc_list:
-            prefix = spath + os.sep
-            if file_path_from_root.startswith(prefix):
-                file_path_from_root = re.sub('^' + prefix, '', file_path_from_root)
-                break
-    return re.sub(r'[-./\s]', '_', file_path_from_root).upper() + '_'
-
-cpplint.GetHeaderGuardCPPVariable = get_header_guard_dmlc
-
-def process(fname, allow_type):
-    """Process a file."""
-    fname = str(fname)
-    arr = fname.rsplit('.', 1)
-    if fname.find('#') != -1 or arr[-1] not in allow_type:
-        return
-    if arr[-1] in CXX_SUFFIX and (not fname.endswith(".pb.h")) and (not fname.endswith(".pb.cc")):
-        _HELPER.process_cpp(fname, arr[-1])
-    if arr[-1] in PYTHON_SUFFIX:
-        _HELPER.process_python(fname)
-
-def main():
-    """Main entry function."""
-    if len(sys.argv) < 3:
-        print('Usage: <project-name> <filetype> <list-of-path to traverse>')
-        print('\tfiletype can be python/cpp/all')
-        exit(-1)
-    _HELPER.project_name = sys.argv[1]
-    file_type = sys.argv[2]
-    allow_type = []
-    if file_type == 'python' or file_type == 'all':
-        allow_type += [x for x in PYTHON_SUFFIX]
-    if file_type == 'cpp' or file_type == 'all':
-        allow_type += [x for x in CXX_SUFFIX]
-    allow_type = set(allow_type)
-    if os.name != 'nt':
-        sys.stderr = codecs.StreamReaderWriter(sys.stderr,
-                                               codecs.getreader('utf8'),
-                                               codecs.getwriter('utf8'),
-                                               'replace')
-    for path in sys.argv[3:]:
-        if os.path.isfile(path):
-            process(path, allow_type)
-        else:
-            for root, dirs, files in os.walk(path):
-                for name in files:
-                    process(os.path.join(root, name), allow_type)
-
-    nerr = _HELPER.print_summary(sys.stderr)
-    sys.exit(nerr > 0)
-
-if __name__ == '__main__':
-    main()
diff --git a/ps-lite/tests/local.sh b/ps-lite/tests/local.sh
deleted file mode 100755
index 089b1747..00000000
--- a/ps-lite/tests/local.sh
+++ /dev/null
@@ -1,37 +0,0 @@
-#!/bin/bash
-# set -x
-if [ $# -lt 3 ]; then
-    echo "usage: $0 num_servers num_workers bin [args..]"
-    exit -1;
-fi
-
-export DMLC_NUM_SERVER=$1
-shift
-export DMLC_NUM_WORKER=$1
-shift
-bin=$1
-shift
-arg="$@"
-
-# start the scheduler
-export DMLC_PS_ROOT_URI='127.0.0.1'
-export DMLC_PS_ROOT_PORT=8000
-export DMLC_ROLE='scheduler'
-${bin} ${arg} &
-
-
-# start servers
-export DMLC_ROLE='server'
-for ((i=0; i<${DMLC_NUM_SERVER}; ++i)); do
-    export HEAPPROFILE=./S${i}
-    ${bin} ${arg} &
-done
-
-# start workers
-export DMLC_ROLE='worker'
-for ((i=0; i<${DMLC_NUM_WORKER}; ++i)); do
-    export HEAPPROFILE=./W${i}
-    ${bin} ${arg} &
-done
-
-wait
diff --git a/ps-lite/tests/repeat.sh b/ps-lite/tests/repeat.sh
deleted file mode 100755
index c38c1d2c..00000000
--- a/ps-lite/tests/repeat.sh
+++ /dev/null
@@ -1,16 +0,0 @@
-#!/bin/bash
-
-if [ $# -lt 2 ]; then
-    echo "usage: $0 num_repeats bin [args...]"
-    exit -1;
-fi
-np=$1
-shift
-
-for ((i=0; i<${np}; ++i)); do
-    echo "repeat $i: $@"
-    $@
-    if [ $? != 0 ]; then
-        break
-    fi
-done
diff --git a/ps-lite/tests/test.mk b/ps-lite/tests/test.mk
deleted file mode 100644
index f4c6974e..00000000
--- a/ps-lite/tests/test.mk
+++ /dev/null
@@ -1,10 +0,0 @@
-TEST_SRC = $(wildcard tests/test_*.cc)
-TEST = $(patsubst tests/test_%.cc, tests/test_%, $(TEST_SRC))
-
-# -ltcmalloc_and_profiler
-LDFLAGS = -Wl,-rpath,$(DEPS_PATH)/lib $(PS_LDFLAGS_SO) -pthread
-tests/% : tests/%.cc build/libps.a
-	$(CXX) -std=c++0x $(CFLAGS) -MM -MT tests/$* $< >tests/$*.d
-	$(CXX) -std=c++0x $(CFLAGS) -o $@ $(filter %.cc %.a, $^) $(LDFLAGS)
-
--include tests/*.d
diff --git a/ps-lite/tests/travis/travis_before_cache.sh b/ps-lite/tests/travis/travis_before_cache.sh
deleted file mode 100755
index 6789ae08..00000000
--- a/ps-lite/tests/travis/travis_before_cache.sh
+++ /dev/null
@@ -1,3 +0,0 @@
-#!/bin/bash
-# do nothing for now
-ls -alLR ${CACHE_PREFIX}
\ No newline at end of file
diff --git a/ps-lite/tests/travis/travis_script.sh b/ps-lite/tests/travis/travis_script.sh
deleted file mode 100755
index 2bfb92f0..00000000
--- a/ps-lite/tests/travis/travis_script.sh
+++ /dev/null
@@ -1,16 +0,0 @@
-#!/bin/bash
-# main script of travis
-
-if [ ${TASK} == "lint" ]; then
-    make lint || exit -1
-fi
-
-if [ ${TASK} == "build" ]; then
-    make DEPS_PATH=${CACHE_PREFIX} CXX=${CXX} || exit -1
-fi
-
-if [ ${TASK} == "test" ]; then
-    make test DEPS_PATH=${CACHE_PREFIX} CXX=${CXX} || exit -1
-    cd tests
-    find test_* -type f -executable -exec ./repeat.sh 4 ./local.sh 2 2 ./{} \;
-fi
diff --git a/ps-lite/tests/travis/travis_setup_env.sh b/ps-lite/tests/travis/travis_setup_env.sh
deleted file mode 100644
index 7bdf4430..00000000
--- a/ps-lite/tests/travis/travis_setup_env.sh
+++ /dev/null
@@ -1,12 +0,0 @@
-# script to be sourced in travis yml
-# setup all enviroment variables
-
-export CACHE_PREFIX=${HOME}/.cache/usr
-export PATH=${HOME}/.local/bin:${PATH}
-export PATH=${PATH}:${CACHE_PREFIX}/bin
-export CPLUS_INCLUDE_PATH=${CPLUS_INCLUDE_PATH}:${CACHE_PREFIX}/include
-export C_INCLUDE_PATH=${C_INCLUDE_PATH}:${CACHE_PREFIX}/include
-export LIBRARY_PATH=${LIBRARY_PATH}:${CACHE_PREFIX}/lib
-export LD_LIBRARY_PATH=${LD_LIBRARY_PATH}:${CACHE_PREFIX}/lib
-
-# alias make="make -j4"
diff --git a/ps-lite/tracker/README.md b/ps-lite/tracker/README.md
deleted file mode 100644
index e674d568..00000000
--- a/ps-lite/tracker/README.md
+++ /dev/null
@@ -1,26 +0,0 @@
-tracker
-====
-
-This folder contains tracker scripts that can be used to submit jobs to
-different distributed platforms.
-
-(Refactor of https://github.com/dmlc/dmlc-core/tree/master/tracker will merged
-back when ready)
-
-## How to use
-
-Assume `prog` is an execuable program, and `[args...]` are the possible
-arguments that `prog` accepts.
-
-### Local machine
-
-Run a job using 4 workers and 2 servers on the local machine:
-
-```bash
-./dmlc_local.py -s 2 -n 4 ./prog [args...]
-```
-
-### Launch via `mpirun`
-
-If `mpirun` is available (shipped with `openmpi` or `mpich2`), we can launch a
-job using `dmlc_mpi.py`.
diff --git a/ps-lite/tracker/dmlc_local.py b/ps-lite/tracker/dmlc_local.py
deleted file mode 100755
index c9cef4db..00000000
--- a/ps-lite/tracker/dmlc_local.py
+++ /dev/null
@@ -1,100 +0,0 @@
-#!/usr/bin/env python
-"""
-DMLC submission script, local machine version
-"""
-
-import argparse
-import sys
-import os
-import subprocess
-from threading import Thread
-import tracker
-import signal
-import logging
-
-keepalive = """
-nrep=0
-rc=254
-while [ $rc -eq 254 ];
-do
-    export DMLC_NUM_ATTEMPT=$nrep
-    %s
-    rc=$?;
-    nrep=$((nrep+1));
-done
-"""
-
-class LocalLauncher(object):
-    def __init__(self, args, unknown):
-        self.args = args
-        self.cmd = ' '.join(args.command) + ' ' + ' '.join(unknown)
-
-    def exec_cmd(self, cmd, role, pass_env):
-        env = os.environ.copy()
-        for k, v in pass_env.items():
-            env[k] = str(v)
-
-        env['DMLC_ROLE'] = role
-
-        ntrial = 0
-        while True:
-            if os.name == 'nt':
-                env['DMLC_NUM_ATTEMPT'] = str(ntrial)
-                ret = subprocess.call(cmd, shell=True, env = env)
-                if ret == 254:
-                    ntrial += 1
-                    continue
-            else:
-                bash = keepalive % (cmd)
-                ret = subprocess.call(bash, shell=True, executable='bash', env = env)
-            if ret == 0:
-                logging.debug('Thread %d exit with 0')
-                return
-            else:
-                if os.name == 'nt':
-                    os.exit(-1)
-                else:
-                    raise Exception('Get nonzero return code=%d' % ret)
-
-    def submit(self):
-        def mthread_submit(nworker, nserver, envs):
-            """
-            customized submit script
-            """
-            procs = {}
-            for i in range(nworker + nserver):
-                role = 'worker' if i < nworker else 'server'
-                procs[i] = Thread(target = self.exec_cmd, args = (self.cmd, role, envs))
-                procs[i].setDaemon(True)
-                procs[i].start()
-        return mthread_submit
-
-    def run(self):
-        tracker.config_logger(self.args)
-        tracker.submit(self.args.num_workers,
-                       self.args.num_servers,
-                       fun_submit = self.submit(),
-                       pscmd = self.cmd)
-
-def main():
-    parser = argparse.ArgumentParser(
-        description='DMLC script to submit dmlc jobs as local process')
-
-    parser.add_argument('-n', '--num-workers', required=True, type=int,
-                        help = 'number of worker nodes to be launched')
-    parser.add_argument('-s', '--num-servers', type=int,
-                        help = 'number of server nodes to be launched')
-    parser.add_argument('--log-level', default='INFO', type=str,
-                        choices=['INFO', 'DEBUG'],
-                        help = 'logging level')
-    parser.add_argument('--log-file', type=str,
-                        help = 'output log to the specific log file')
-    parser.add_argument('command', nargs='+',
-                        help = 'command for launching the program')
-    args, unknown = parser.parse_known_args()
-
-    launcher = LocalLauncher(args, unknown)
-    launcher.run()
-
-if __name__ == '__main__':
-    main()
diff --git a/ps-lite/tracker/dmlc_mpi.py b/ps-lite/tracker/dmlc_mpi.py
deleted file mode 100755
index 395880cc..00000000
--- a/ps-lite/tracker/dmlc_mpi.py
+++ /dev/null
@@ -1,91 +0,0 @@
-#!/usr/bin/env python
-"""
-DMLC submission script, MPI version
-"""
-import argparse
-import sys
-import os
-import subprocess
-import tracker
-from threading import Thread
-
-parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using MPI')
-parser.add_argument('-n', '--nworker', required=True, type=int,
-                    help = 'number of worker proccess to be launched')
-parser.add_argument('-s', '--server-nodes', default = 0, type=int,
-                    help = 'number of server nodes to be launched')
-parser.add_argument('--log-level', default='INFO', type=str,
-                    choices=['INFO', 'DEBUG'],
-                    help = 'logging level')
-parser.add_argument('--log-file', type=str,
-                    help = 'output log to the specific log file')
-parser.add_argument('-H', '--hostfile', type=str,
-                    help = 'the hostfile of mpi server')
-parser.add_argument('command', nargs='+',
-                    help = 'command for dmlc program')
-parser.add_argument('--host-ip', type=str,
-                    help = 'the scheduler ip', default='ip')
-args, unknown = parser.parse_known_args()
-#
-# submission script using MPI
-#
-
-def get_mpi_env(envs):
-    """get the mpirun command for setting the envornment
-
-    support both openmpi and mpich2
-    """
-    outfile="/tmp/mpiver"
-    os.system("mpirun 1>/tmp/mpiver 2>/tmp/mpiver")
-    with open (outfile, "r") as infile:
-        mpi_ver = infile.read()
-    cmd = ''
-    if 'Open MPI' in mpi_ver:
-        for k, v in envs.items():
-            cmd += ' -x %s=%s' % (k, str(v))
-    elif 'mpich' in mpi_ver:
-        for k, v in envs.items():
-            cmd += ' -env %s %s' % (k, str(v))
-    else:
-        raise Exception('unknow mpi version %s' % (mpi_ver))
-
-    return cmd
-
-def mpi_submit(nworker, nserver, pass_envs):
-    """
-      customized submit script, that submit nslave jobs, each must contain args as parameter
-      note this can be a lambda function containing additional parameters in input
-      Parameters
-         nworker number of slave process to start up
-         nserver number of server nodes to start up
-         pass_envs enviroment variables to be added to the starting programs
-    """
-    def run(prog):
-        """"""
-        subprocess.check_call(prog, shell = True)
-
-    cmd = ''
-    if args.hostfile is not None:
-        cmd = '--hostfile %s' % (args.hostfile)
-    cmd += ' ' + ' '.join(args.command) + ' ' + ' '.join(unknown)
-
-    # start servers
-    if nserver > 0:
-        pass_envs['DMLC_ROLE'] = 'server'
-        prog = 'mpirun -n %d %s %s' % (nserver, get_mpi_env(pass_envs), cmd)
-        thread = Thread(target = run, args=(prog,))
-        thread.setDaemon(True)
-        thread.start()
-
-    if nworker > 0:
-        pass_envs['DMLC_ROLE'] = 'worker'
-        prog = 'mpirun -n %d %s %s' % (nworker, get_mpi_env(pass_envs), cmd)
-        thread = Thread(target = run, args=(prog,))
-        thread.setDaemon(True)
-        thread.start()
-
-tracker.config_logger(args)
-
-tracker.submit(args.nworker, args.server_nodes, fun_submit = mpi_submit,
-               hostIP=args.host_ip,
-               pscmd=(' '.join(args.command) + ' ' + ' '.join(unknown)))
diff --git a/ps-lite/tracker/dmlc_ssh.py b/ps-lite/tracker/dmlc_ssh.py
deleted file mode 100755
index 7779852d..00000000
--- a/ps-lite/tracker/dmlc_ssh.py
+++ /dev/null
@@ -1,113 +0,0 @@
-#!/usr/bin/env python
-"""
-DMLC submission script by ssh
-
-One need to make sure all slaves machines are ssh-able.
-"""
-
-import argparse
-import sys
-import os
-import subprocess
-import tracker
-import logging
-from threading import Thread
-
-class SSHLauncher(object):
-    def __init__(self, args, unknown):
-        self.args = args
-        self.cmd = (' '.join(args.command) + ' ' + ' '.join(unknown))
-
-        assert args.hostfile is not None
-        with open(args.hostfile) as f:
-            hosts = f.readlines()
-        assert len(hosts) > 0
-        self.hosts=[]
-        for h in hosts:
-            if len(h.strip()) > 0:
-                self.hosts.append(h.strip())
-
-    def sync_dir(self, local_dir, slave_node, slave_dir):
-        """
-        sync the working directory from root node into slave node
-        """
-        remote = slave_node + ':' + slave_dir
-        logging.info('rsync %s -> %s', local_dir, remote)
-
-        # TODO uses multithread
-        prog = 'rsync -az --rsh="ssh -o StrictHostKeyChecking=no" %s %s' % (
-            local_dir, remote)
-        subprocess.check_call([prog], shell = True)
-
-
-    def get_env(self, pass_envs):
-        envs = []
-        # get system envs
-        keys = ['LD_LIBRARY_PATH', 'AWS_ACCESS_KEY_ID', 'AWS_SECRET_ACCESS_KEY']
-        for k in keys:
-            v = os.getenv(k)
-            if v is not None:
-                envs.append('export ' + k + '=' + v + ';')
-        # get ass_envs
-        for k, v in pass_envs.items():
-            envs.append('export ' + str(k) + '=' + str(v) + ';')
-        return (' '.join(envs))
-
-    def submit(self):
-        def ssh_submit(nworker, nserver, pass_envs):
-            """
-            customized submit script
-            """
-            # thread func to run the job
-            def run(prog):
-                subprocess.check_call(prog, shell = True)
-
-            # sync programs if necessary
-            local_dir = os.getcwd()+'/'
-            working_dir = local_dir
-            if self.args.sync_dir is not None:
-                working_dir = self.args.sync_dir
-                for h in self.hosts:
-                    self.sync_dir(local_dir, h, working_dir)
-
-            # launch jobs
-            for i in range(nworker + nserver):
-                pass_envs['DMLC_ROLE'] = 'server' if i < nserver else 'worker'
-                node = self.hosts[i % len(self.hosts)]
-                prog = self.get_env(pass_envs) + ' cd ' + working_dir + '; ' + self.cmd
-                prog = 'ssh -o StrictHostKeyChecking=no ' + node + ' \'' + prog + '\''
-
-                thread = Thread(target = run, args=(prog,))
-                thread.setDaemon(True)
-                thread.start()
-
-        return ssh_submit
-
-    def run(self):
-        tracker.config_logger(self.args)
-        tracker.submit(self.args.num_workers,
-                       self.args.num_servers,
-                       fun_submit = self.submit(),
-                       pscmd = self.cmd)
-
-def main():
-    parser = argparse.ArgumentParser(description='DMLC script to submit dmlc job using ssh')
-    parser.add_argument('-n', '--num-workers', required=True, type=int,
-                        help = 'number of worker nodes to be launched')
-    parser.add_argument('-s', '--num-servers', default = 0, type=int,
-                        help = 'number of server nodes to be launched')
-    parser.add_argument('-H', '--hostfile', type=str,
-                        help = 'the hostfile of all slave nodes')
-    parser.add_argument('command', nargs='+',
-                        help = 'command for dmlc program')
-    parser.add_argument('--sync-dir', type=str,
-                        help = 'if specificed, it will sync the current \
-                        directory into slave machines\'s SYNC_DIR')
-
-    args, unknown = parser.parse_known_args()
-
-    launcher = SSHLauncher(args, unknown)
-    launcher.run()
-
-if __name__ == '__main__':
-    main()
diff --git a/ps-lite/tracker/tracker.py b/ps-lite/tracker/tracker.py
deleted file mode 100644
index bfaa06b3..00000000
--- a/ps-lite/tracker/tracker.py
+++ /dev/null
@@ -1,433 +0,0 @@
-"""
-Tracker script for DMLC
-Implements the tracker control protocol
- - start dmlc jobs
- - start ps scheduler and rabit tracker
- - help nodes to establish links with each other
-
-Tianqi Chen
-"""
-
-import sys
-import os
-import socket
-import struct
-import subprocess
-import time
-import logging
-import random
-from threading import Thread
-
-"""
-Extension of socket to handle recv and send of special data
-"""
-class ExSocket:
-    def __init__(self, sock):
-        self.sock = sock
-    def recvall(self, nbytes):
-        res = []
-        sock = self.sock
-        nread = 0
-        while nread < nbytes:
-            chunk = self.sock.recv(min(nbytes - nread, 1024))
-            nread += len(chunk)
-            res.append(chunk)
-        return ''.join(res)
-    def recvint(self):
-        return struct.unpack('@i', self.recvall(4))[0]
-    def sendint(self, n):
-        self.sock.sendall(struct.pack('@i', n))
-    def sendstr(self, s):
-        self.sendint(len(s))
-        self.sock.sendall(s)
-    def recvstr(self):
-        slen = self.recvint()
-        return self.recvall(slen)
-
-# magic number used to verify existence of data
-kMagic = 0xff99
-
-class SlaveEntry:
-    def __init__(self, sock, s_addr):
-        slave = ExSocket(sock)
-        self.sock = slave
-        self.host = socket.gethostbyname(s_addr[0])
-        magic = slave.recvint()
-        assert magic == kMagic, 'invalid magic number=%d from %s' % (magic, self.host)
-        slave.sendint(kMagic)
-        self.rank = slave.recvint()
-        self.world_size = slave.recvint()
-        self.jobid = slave.recvstr()
-        self.cmd = slave.recvstr()
-
-    def decide_rank(self, job_map):
-        if self.rank >= 0:
-            return self.rank
-        if self.jobid != 'NULL' and self.jobid in job_map:
-            return job_map[self.jobid]
-        return -1
-
-    def assign_rank(self, rank, wait_conn, tree_map, parent_map, ring_map):
-        self.rank = rank
-        nnset = set(tree_map[rank])
-        rprev, rnext = ring_map[rank]
-        self.sock.sendint(rank)
-        # send parent rank
-        self.sock.sendint(parent_map[rank])
-        # send world size
-        self.sock.sendint(len(tree_map))
-        self.sock.sendint(len(nnset))
-        # send the rprev and next link
-        for r in nnset:
-            self.sock.sendint(r)
-        # send prev link
-        if rprev != -1 and rprev != rank:
-            nnset.add(rprev)
-            self.sock.sendint(rprev)
-        else:
-            self.sock.sendint(-1)
-        # send next link
-        if rnext != -1 and rnext != rank:
-            nnset.add(rnext)
-            self.sock.sendint(rnext)
-        else:
-            self.sock.sendint(-1)
-        while True:
-            ngood = self.sock.recvint()
-            goodset = set([])
-            for i in xrange(ngood):
-                goodset.add(self.sock.recvint())
-            assert goodset.issubset(nnset)
-            badset = nnset - goodset
-            conset = []
-            for r in badset:
-                if r in wait_conn:
-                    conset.append(r)
-            self.sock.sendint(len(conset))
-            self.sock.sendint(len(badset) - len(conset))
-            for r in conset:
-                self.sock.sendstr(wait_conn[r].host)
-                self.sock.sendint(wait_conn[r].port)
-                self.sock.sendint(r)
-            nerr = self.sock.recvint()
-            if nerr != 0:
-                continue
-            self.port = self.sock.recvint()
-            rmset = []
-            # all connection was successuly setup
-            for r in conset:
-                wait_conn[r].wait_accept -= 1
-                if wait_conn[r].wait_accept == 0:
-                    rmset.append(r)
-            for r in rmset:
-                wait_conn.pop(r, None)
-            self.wait_accept = len(badset) - len(conset)
-            return rmset
-
-class RabitTracker:
-    """
-    tracker for rabit
-    """
-    def __init__(self, hostIP, nslave, port = 9091, port_end = 9999):
-        sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
-        for port in range(port, port_end):
-            try:
-                sock.bind((hostIP, port))
-                self.port = port
-                break
-            except socket.error:
-                continue
-        sock.listen(16)
-        self.sock = sock
-        self.hostIP = hostIP
-        logging.info('start listen on %s:%d' % (hostIP, self.port))
-
-    def __del__(self):
-        self.sock.close()
-
-    def slave_envs(self):
-        """
-        get enviroment variables for slaves
-        can be passed in as args or envs
-        """
-        return {'DMLC_TRACKER_URI': self.hostIP,
-                'DMLC_TRACKER_PORT': self.port}
-
-    def get_neighbor(self, rank, nslave):
-        rank = rank + 1
-        ret = []
-        if rank > 1:
-            ret.append(rank / 2 - 1)
-        if rank * 2 - 1  < nslave:
-            ret.append(rank * 2 - 1)
-        if rank * 2 < nslave:
-            ret.append(rank * 2)
-        return ret
-
-    def get_tree(self, nslave):
-        tree_map = {}
-        parent_map = {}
-        for r in range(nslave):
-            tree_map[r] = self.get_neighbor(r, nslave)
-            parent_map[r] = (r + 1) / 2 - 1
-        return tree_map, parent_map
-
-    def find_share_ring(self, tree_map, parent_map, r):
-        """
-        get a ring structure that tends to share nodes with the tree
-        return a list starting from r
-        """
-        nset = set(tree_map[r])
-        cset = nset - set([parent_map[r]])
-        if len(cset) == 0:
-            return [r]
-        rlst = [r]
-        cnt = 0
-        for v in cset:
-            vlst = self.find_share_ring(tree_map, parent_map, v)
-            cnt += 1
-            if cnt == len(cset):
-                vlst.reverse()
-            rlst += vlst
-        return rlst
-
-    def get_ring(self, tree_map, parent_map):
-        """
-        get a ring connection used to recover local data
-        """
-        assert parent_map[0] == -1
-        rlst = self.find_share_ring(tree_map, parent_map, 0)
-        assert len(rlst) == len(tree_map)
-        ring_map = {}
-        nslave = len(tree_map)
-        for r in range(nslave):
-            rprev = (r + nslave - 1) % nslave
-            rnext = (r + 1) % nslave
-            ring_map[rlst[r]] = (rlst[rprev], rlst[rnext])
-        return ring_map
-
-    def get_link_map(self, nslave):
-        """
-        get the link map, this is a bit hacky, call for better algorithm
-        to place similar nodes together
-        """
-        tree_map, parent_map = self.get_tree(nslave)
-        ring_map = self.get_ring(tree_map, parent_map)
-        rmap = {0 : 0}
-        k = 0
-        for i in range(nslave - 1):
-            k = ring_map[k][1]
-            rmap[k] = i + 1
-
-        ring_map_ = {}
-        tree_map_ = {}
-        parent_map_ ={}
-        for k, v in ring_map.items():
-            ring_map_[rmap[k]] = (rmap[v[0]], rmap[v[1]])
-        for k, v in tree_map.items():
-            tree_map_[rmap[k]] = [rmap[x] for x in v]
-        for k, v in parent_map.items():
-            if k != 0:
-                parent_map_[rmap[k]] = rmap[v]
-            else:
-                parent_map_[rmap[k]] = -1
-        return tree_map_, parent_map_, ring_map_
-
-    def handle_print(self,slave, msg):
-        logging.info(msg.strip())
-        sys.stdout.write(msg)
-        sys.stdout.flush()
-
-    def accept_slaves(self, nslave):
-        # set of nodes that finishs the job
-        shutdown = {}
-        # set of nodes that is waiting for connections
-        wait_conn = {}
-        # maps job id to rank
-        job_map = {}
-        # list of workers that is pending to be assigned rank
-        pending = []
-        # lazy initialize tree_map
-        tree_map = None
-
-        while len(shutdown) != nslave:
-            fd, s_addr = self.sock.accept()
-            s = SlaveEntry(fd, s_addr)
-            if s.cmd == 'print':
-                msg = s.sock.recvstr()
-                self.handle_print(s, msg)
-                continue
-            if s.cmd == 'shutdown':
-                assert s.rank >= 0 and s.rank not in shutdown
-                assert s.rank not in wait_conn
-                shutdown[s.rank] = s
-                logging.debug('Recieve %s signal from %d' % (s.cmd, s.rank))
-                continue
-            assert s.cmd == 'start' or s.cmd == 'recover'
-            # lazily initialize the slaves
-            if tree_map == None:
-                assert s.cmd == 'start'
-                if s.world_size > 0:
-                    nslave = s.world_size
-                tree_map, parent_map, ring_map = self.get_link_map(nslave)
-                # set of nodes that is pending for getting up
-                todo_nodes = range(nslave)
-            else:
-                assert s.world_size == -1 or s.world_size == nslave
-            if s.cmd == 'recover':
-                assert s.rank >= 0
-
-            rank = s.decide_rank(job_map)
-            # batch assignment of ranks
-            if rank == -1:
-                assert len(todo_nodes) != 0
-                pending.append(s)
-                if len(pending) == len(todo_nodes):
-                    pending.sort(key = lambda x : x.host)
-                    for s in pending:
-                        rank = todo_nodes.pop(0)
-                        if s.jobid != 'NULL':
-                            job_map[s.jobid] = rank
-                        s.assign_rank(rank, wait_conn, tree_map, parent_map, ring_map)
-                        if s.wait_accept > 0:
-                            wait_conn[rank] = s
-                        logging.debug('Recieve %s signal from %s; assign rank %d' % (s.cmd, s.host, s.rank))
-                if len(todo_nodes) == 0:
-                    logging.info('@tracker All of %d nodes getting started' % nslave)
-                    self.start_time = time.time()
-            else:
-                s.assign_rank(rank, wait_conn, tree_map, parent_map, ring_map)
-                logging.debug('Recieve %s signal from %d' % (s.cmd, s.rank))
-                if s.wait_accept > 0:
-                    wait_conn[rank] = s
-        logging.info('@tracker All nodes finishes job')
-        self.end_time = time.time()
-        logging.info('@tracker %s secs between node start and job finish' % str(self.end_time - self.start_time))
-
-    def start(self, nslave):
-        def run():
-            self.accept_slaves(nslave)
-        self.thread = Thread(target = run, args = ())
-        self.thread.setDaemon(True)
-        self.thread.start()
-
-    def join(self):
-        while self.thread.isAlive():
-            self.thread.join(100)
-
-class PSTracker:
-    """Start the schduler node in PS
-    """
-    def __init__(self, hostIP, cmd, port = 9091, port_end = 9999, envs = {}):
-        """
-        Starts the PS scheduler
-        """
-        self.cmd = cmd
-        if cmd is None:
-            return
-
-        self.hostIP = hostIP
-        sock = socket.socket(socket.AF_INET, socket.SOCK_STREAM)
-        max_retry = 100
-
-        for i in range(0, max_retry):
-            if i + 1 == max_retry:
-                raise Exception('the schduler is faild to bind a port')
-            port = random.randint(port, port_end)
-            try:
-                sock.bind(('', port))
-                self.port = port
-                sock.close()
-                break
-            except socket.error:
-                continue
-        env = os.environ.copy()
-
-        env['DMLC_ROLE'] = 'scheduler'
-        env['DMLC_PS_ROOT_URI'] = str(self.hostIP)
-        env['DMLC_PS_ROOT_PORT'] = str(self.port)
-        for k, v in envs.items():
-            env[k] = str(v)
-        self.thread = Thread(target = (lambda : subprocess.check_call(self.cmd, env=env, shell=True)), args = ())
-        self.thread.setDaemon(True)
-        self.thread.start()
-
-    def join(self):
-        if self.cmd is not None:
-            while self.thread.isAlive():
-                self.thread.join(100)
-
-    def slave_envs(self):
-        if self.cmd is None:
-            return {}
-        else:
-            return {'DMLC_PS_ROOT_URI': self.hostIP,
-                    'DMLC_PS_ROOT_PORT': self.port}
-
-def submit(nworker, nserver, fun_submit, hostIP = 'auto', pscmd = None):
-    """submit job
-
-    Paramaters
-    ----------
-    nworker : int
-        number of workers
-    nserver : int
-        number of servers, if 0 then submit as rabit a job, otherwise sumbit as
-        a parmaeter server job
-    fun_sumbit : func
-        the function to submit the jobs for servers and workers
-    hostIP : str, optional
-        the host ip of the root node
-    pscmd :
-    """
-    # get the root node ip
-    if hostIP == 'auto':
-        hostIP = 'ip'
-    if hostIP == 'dns':
-        hostIP = socket.getfqdn()
-    elif hostIP == 'ip':
-        from socket import gaierror
-        try:
-            hostIP = socket.gethostbyname(socket.getfqdn())
-        except gaierror:
-            logging.warn('gethostbyname(socket.getfqdn()) failed... trying on hostname()')
-            hostIP = socket.gethostbyname(socket.gethostname())
-        if hostIP.startswith("127."):
-            s = socket.socket(socket.AF_INET, socket.SOCK_DGRAM)
-            # doesn't have to be reachable
-            s.connect(('10.255.255.255', 0))
-            hostIP = s.getsockname()[0]
-
-    envs = {'DMLC_NUM_WORKER' : nworker,
-            'DMLC_NUM_SERVER' : nserver}
-
-    # start the root
-    if nserver == 0:
-        rabit = RabitTracker(hostIP = hostIP, nslave = nworker)
-        envs.update(rabit.slave_envs())
-        rabit.start(nworker)
-    else:
-        pserver = PSTracker(hostIP = hostIP, cmd=pscmd, envs = envs)
-        envs.update(pserver.slave_envs())
-
-    # start the workers and servers
-    fun_submit(nworker, nserver, envs)
-
-    # wait the root finished
-    if nserver == 0:
-        rabit.join()
-    else:
-        pserver.join()
-
-def config_logger(args):
-    FORMAT = '%(asctime)s %(levelname)s %(message)s'
-    level = args.log_level if 'log_level' in args else 'DEBUG'
-    level = eval('logging.' + level)
-    if 'log_file' not in args or args.log_file is None:
-        logging.basicConfig(format=FORMAT, level = level)
-    else:
-        logging.basicConfig(format=FORMAT, level = level, filename = args.log_file)
-        console = logging.StreamHandler()
-        console.setFormatter(logging.Formatter(FORMAT))
-        console.setLevel(level)
-        logging.getLogger('').addHandler(console)

From 7703c0fddfe7ae0a7ebe7133fc19c8a5fe259160 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 22:16:57 +0800
Subject: [PATCH 39/82] add: makelist

---
 CMakeLists.txt | 5 +++++
 1 file changed, 5 insertions(+)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 92f2995d..b7619583 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -31,6 +31,7 @@ cmake_minimum_required(VERSION 3.0)
 # Optimization on architecture
 #-------------------------------------------------------------------------------
 add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
+-Wno-dev 
 -Wno-strict-aliasing -Wno-comment")
 
 #-------------------------------------------------------------------------------
@@ -45,6 +46,9 @@ if(NOT ${CMAKE_SYSTEM_NAME} MATCHES "Darwin")
   set(CMAKE_EXE_LINKER_FLAGS "-static -static-libgcc")
 endif()
 
+#set(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake)
+#include(ps-lite)
+
 #-------------------------------------------------------------------------------
 # Set include paths and library paths.
 #-------------------------------------------------------------------------------
@@ -72,6 +76,7 @@ link_directories(
 #-------------------------------------------------------------------------------
 # Declare packages in xLearn project.
 #-------------------------------------------------------------------------------
+add_subdirectory(ps-lite)
 add_subdirectory(gtest)
 add_subdirectory(demo)
 add_subdirectory(src/base)

From f7937bb19f46354cbbdf68a58c8454e711b41a9e Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 22:17:56 +0800
Subject: [PATCH 40/82] add: cmake/ps-lite.cmake

---
 cmake/ps-lite.cmake | 13 +++++++++++++
 1 file changed, 13 insertions(+)
 create mode 100644 cmake/ps-lite.cmake

diff --git a/cmake/ps-lite.cmake b/cmake/ps-lite.cmake
new file mode 100644
index 00000000..b299321c
--- /dev/null
+++ b/cmake/ps-lite.cmake
@@ -0,0 +1,13 @@
+include(ExternalProject)
+
+set(pslite_URL https://github.com/dmlc/ps-lite.git)
+set(pslite_TAG 2ce8b9a256207947acfa2cb9b09ab74b8de74547)
+
+ExternalProject_Add(ps-lite
+  PREFIX ps-lite
+  GIT_REPOSITORY ${pslite_URL}
+  GIT_TAG ${pslite_TAG}
+  UPDATE_COMMAND ""
+  BUILD_COMMAND make
+)
+

From c8ccc331fe6284bdce1b11f8683b457876bf5e4b Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 16 Dec 2017 22:26:58 +0800
Subject: [PATCH 41/82] add: zmq.cmake

---
 cmake/FindZMQ.cmake | 17 ++++++++++++
 cmake/zmq.cmake     | 63 +++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 80 insertions(+)
 create mode 100644 cmake/FindZMQ.cmake
 create mode 100644 cmake/zmq.cmake

diff --git a/cmake/FindZMQ.cmake b/cmake/FindZMQ.cmake
new file mode 100644
index 00000000..11319098
--- /dev/null
+++ b/cmake/FindZMQ.cmake
@@ -0,0 +1,17 @@
+# - Try to find ZMQ
+# Once done this will define
+# ZMQ_FOUND - System has ZMQ
+# ZMQ_INCLUDE_DIRS - The ZMQ include directories
+# ZMQ_LIBRARIES - The libraries needed to use ZMQ
+# ZMQ_DEFINITIONS - Compiler switches required for using ZMQ
+
+find_path ( ZMQ_INCLUDE_DIR zmq.h )
+find_library ( ZMQ_LIBRARY NAMES zmq )
+
+set ( ZMQ_LIBRARIES ${ZMQ_LIBRARY} )
+set ( ZMQ_INCLUDE_DIRS ${ZMQ_INCLUDE_DIR} )
+
+include ( FindPackageHandleStandardArgs )
+# handle the QUIETLY and REQUIRED arguments and set ZMQ_FOUND to TRUE
+# if all listed variables are TRUE
+find_package_handle_standard_args ( ZMQ DEFAULT_MSG ZMQ_LIBRARY ZMQ_INCLUDE_DIR )
\ No newline at end of file
diff --git a/cmake/zmq.cmake b/cmake/zmq.cmake
new file mode 100644
index 00000000..dc6d514a
--- /dev/null
+++ b/cmake/zmq.cmake
@@ -0,0 +1,63 @@
+if (NOT __ZMQ_INCLUDED) # guard against multiple includes
+  set(__ZMQ_INCLUDED TRUE)
+  include(ExternalProject)
+
+  # use the system-wide ZMQ if present
+  find_package(ZMQ)
+  if (ZMQ_FOUND)
+    set(ZMQ_EXTERNAL FALSE)
+  else()
+    # ZMQ will use pthreads if it's available in the system, so we must link with it
+    find_package(Threads)
+
+    # build directory
+    set(ZMQ_PREFIX ${CMAKE_BINARY_DIR}/external/ZMQ-prefix)
+    # install directory
+    set(ZMQ_INSTALL ${CMAKE_BINARY_DIR}/external/ZMQ-install)
+
+    # we build ZMQ statically, but want to link it into the caffe shared library
+    # this requires position-independent code
+    if (UNIX)
+        set(ZMQ_EXTRA_COMPILER_FLAGS "-fPIC")
+    endif()
+
+    set(ZMQ_CXX_FLAGS ${CMAKE_CXX_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
+    set(ZMQ_C_FLAGS ${CMAKE_C_FLAGS} ${ZMQ_EXTRA_COMPILER_FLAGS})
+
+    ExternalProject_Add(ZMQ
+      PREFIX ${ZMQ_PREFIX}
+      GIT_REPOSITORY "https://github.com/zeromq/libZMQ.git"
+      UPDATE_COMMAND ""
+      INSTALL_DIR ${ZMQ_INSTALL}
+      CMAKE_ARGS -DCMAKE_BUILD_TYPE=${CMAKE_BUILD_TYPE}
+                 -DCMAKE_INSTALL_PREFIX=${ZMQ_INSTALL}
+                 -DBUILD_SHARED_LIBS=OFF
+                 -DBUILD_STATIC_LIBS=ON
+                 -DBUILD_PACKAGING=OFF
+                 -DBUILD_TESTING=OFF
+                 -DBUILD_NC_TESTS=OFF
+                 -BUILD_CONFIG_TESTS=OFF
+                 -DINSTALL_HEADERS=ON
+                 -DCMAKE_C_FLAGS=${ZMQ_C_FLAGS}
+                 -DCMAKE_CXX_FLAGS=${ZMQ_CXX_FLAGS}
+      LOG_DOWNLOAD 1
+      LOG_INSTALL 1
+      )
+
+    set(ZMQ_FOUND TRUE)
+    set(ZMQ_INCLUDE_DIRS ${ZMQ_INSTALL}/include)
+	
+	if(MSVC)
+		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-${CMAKE_VS_PLATFORM_TOOLSET}*.lib")
+		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/ZMQ.lib ${CMAKE_THREAD_LIBS_INIT})
+	else()
+		FILE(GLOB_RECURSE ZMQ_LIBRARIES "${ZMQ_INSTALL}/lib/libzmq-*.a")
+		#set(ZMQ_LIBRARIES ${ZMQ_INSTALL}/lib/libZMQ.a ${CMAKE_THREAD_LIBS_INIT})
+	endif()
+    set(ZMQ_LIBRARY_DIRS ${ZMQ_INSTALL}/lib)
+    set(ZMQ_EXTERNAL TRUE)
+
+    list(APPEND external_project_dependencies ZMQ)
+  endif()
+
+endif()

From 7edcde1b7fc7173554f910fe5ab3f48acedf8b84 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 17 Dec 2017 09:19:31 +0800
Subject: [PATCH 42/82] add: CMakeLists.txt

---
 CMakeLists.txt | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index b7619583..552c4d4b 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -69,8 +69,7 @@ link_directories(
   "${PROJECT_BINARY_DIR}/src/solver"
   "${PROJECT_BINARY_DIR}/src/distributed"
   "${PROJECT_BINARY_DIR}/src/c_api"
-  "${PROJECT_SOURCE_DIR}/ps-lite/deps/lib"
-  "${PROJECT_SOURCE_DIR}/ps-lite/build"
+  "${PROJECT_BINARY_DIR}/ps-lite"
 )
 
 #-------------------------------------------------------------------------------

From 44e3bab158ae8359e18ba633bcb7eb3d121c0963 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 17 Dec 2017 09:19:48 +0800
Subject: [PATCH 43/82] update: src/c_api/CMakeLists.txt

---
 src/c_api/CMakeLists.txt | 6 +++---
 1 file changed, 3 insertions(+), 3 deletions(-)

diff --git a/src/c_api/CMakeLists.txt b/src/c_api/CMakeLists.txt
index 571c9578..94ceabbe 100644
--- a/src/c_api/CMakeLists.txt
+++ b/src/c_api/CMakeLists.txt
@@ -4,7 +4,7 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 
 # Build static library
-set(STA_DEPS solver reader loss score data base ps protobuf zmq distributed)
+set(STA_DEPS solver reader loss score data base pslite protobuf zmq distributed)
 add_library(xlearn_api STATIC c_api.cc c_api_error.cc)
 target_link_libraries(xlearn_api ${STA_DEPS})
 
@@ -23,7 +23,7 @@ add_library(xlearn_api_shared SHARED c_api.cc c_api_error.cc
 ../solver/checker.cc ../solver/trainer.cc 
 ../solver/inference.cc ../solver/solver.cc)
 
-target_link_libraries(xlearn_api_shared ps zmq protobuf)
+target_link_libraries(xlearn_api_shared pslite zmq protobuf)
 
 # Set properties
 set_target_properties(xlearn_api_shared PROPERTIES OUTPUT_NAME "xlearn_api")
@@ -31,7 +31,7 @@ set_target_properties(xlearn_api_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(xlearn_api PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build unittests.
-set(LIBS xlearn_api solver reader loss score data base pthread gtest ps protobuf zmq distributed_shared)
+set(LIBS xlearn_api solver reader loss score data base pthread gtest pslite protobuf zmq distributed_shared)
 
 add_executable(c_api_test c_api_test.cc)
 target_link_libraries(c_api_test gtest_main ${LIBS})

From 81978632db407373d28abb357ce28e9951d65a01 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 17 Dec 2017 09:20:03 +0800
Subject: [PATCH 44/82] update: src/loss/CMakeLists.txt

---
 src/loss/CMakeLists.txt | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/src/loss/CMakeLists.txt b/src/loss/CMakeLists.txt
index 0ef11765..a598f03a 100644
--- a/src/loss/CMakeLists.txt
+++ b/src/loss/CMakeLists.txt
@@ -2,13 +2,13 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
 # Build static library
-set(STA_DEPS score data base ps protobuf zmq distributed)
+set(STA_DEPS score data base pslite protobuf zmq distributed)
 add_library(loss STATIC loss.cc squared_loss.cc 
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss ${STA_DEPS})
 
 # Build shared library
-set(SHA_DEPS score_shared data_shared base_shared ps protobuf zmq distributed)
+set(SHA_DEPS score_shared data_shared base_shared pslite protobuf zmq distributed)
 add_library(loss_shared SHARED loss.cc squared_loss.cc
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss_shared ${SHA_DEPS})

From 6704c6964cdf903bab07c87a991bb5cdf928a7ab Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 17 Dec 2017 09:24:49 +0800
Subject: [PATCH 45/82] add: summodule

---
 .gitmodules | 3 +++
 ps-lite     | 1 +
 2 files changed, 4 insertions(+)
 create mode 100644 .gitmodules
 create mode 160000 ps-lite

diff --git a/.gitmodules b/.gitmodules
new file mode 100644
index 00000000..fe99534d
--- /dev/null
+++ b/.gitmodules
@@ -0,0 +1,3 @@
+[submodule "ps-lite"]
+	path = ps-lite
+	url = https://github.com/dmlc/ps-lite
diff --git a/ps-lite b/ps-lite
new file mode 160000
index 00000000..2ce8b9a2
--- /dev/null
+++ b/ps-lite
@@ -0,0 +1 @@
+Subproject commit 2ce8b9a256207947acfa2cb9b09ab74b8de74547

From 648082146d15a70c01785d08e4cde985fda90156 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 08:49:34 +0800
Subject: [PATCH 46/82] rm: include

---
 CMakeLists.txt | 1 -
 1 file changed, 1 deletion(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index 552c4d4b..b837691c 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -31,7 +31,6 @@ cmake_minimum_required(VERSION 3.0)
 # Optimization on architecture
 #-------------------------------------------------------------------------------
 add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
--Wno-dev 
 -Wno-strict-aliasing -Wno-comment")
 
 #-------------------------------------------------------------------------------

From 4bfbed8d1969ad9a24d52819c1e6cdd31c922cb9 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 11:09:41 +0800
Subject: [PATCH 47/82] update: CMakeLists.txt

---
 CMakeLists.txt | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index b837691c..bf2efd72 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -45,9 +45,6 @@ if(NOT ${CMAKE_SYSTEM_NAME} MATCHES "Darwin")
   set(CMAKE_EXE_LINKER_FLAGS "-static -static-libgcc")
 endif()
 
-#set(CMAKE_MODULE_PATH ${PROJECT_SOURCE_DIR}/cmake)
-#include(ps-lite)
-
 #-------------------------------------------------------------------------------
 # Set include paths and library paths.
 #-------------------------------------------------------------------------------
@@ -56,7 +53,6 @@ include_directories(
   "${PROJECT_BINARY_DIR}"
   "${PROJECT_SOURCE_DIR}/gtest/include"
   "${PROJECT_SOURCE_DIR}/ps-lite/include"
-  "${PROJECT_SOURCE_DIR}/ps-lite/deps/include"
 )
 
 link_directories(

From 5ad56441d56623b3d4153f89316633983d113c27 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 22:43:49 +0800
Subject: [PATCH 48/82] update: server.h

---
 src/distributed/server.h | 28 +++++++++++++++++-----------
 1 file changed, 17 insertions(+), 11 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index a97a210e..caa7ea6e 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -1,10 +1,11 @@
 #include "iostream"
-#include "ps.h"
 #include "src/base/math.h"
+#include "src/distributed/dist_score_function.h"
+#include "ps/ps.h"
 
 #include <time.h>
 
-namespace xlean {
+namespace xlearn {
 float alpha = 0.001;
 float beta = 1.0;
 float lambda1 = 0.00001;
@@ -13,6 +14,8 @@ float lambda2 = 2.0;
 float regu_lambda_ = 0.1;
 float learning_rate_ = 0.1;
 
+int v_dim = 4;
+
 typedef struct SGDEntry{
   SGDEntry(size_t k = 4) {
     w.resize(k, 0.0);
@@ -23,7 +26,7 @@ typedef struct SGDEntry{
 struct KVServerSGDHandle {
   void operator() (const ps::KVMeta& req_meta,
                    const ps::KVPairs<float>& req_data,
-                   ps::KVServer<float>* server)
+                   ps::KVServer<float>* server) {
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
@@ -47,6 +50,7 @@ struct KVServerSGDHandle {
         }
       }
     }
+  }
  private:
   std::unordered_map<ps::Key, sgdentry> store_;
 };
@@ -70,9 +74,9 @@ struct KVServerAdaGradHandle {
       CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
-      res.vals.resize(n);
+      res.vals.resize(keys_size);
     }
-    for (size_t it = 0; i < keys_size; ++i) {
+    for (size_t i = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
       AdaGradEntry& val = store_[key];
       if (req_meta.push) {
@@ -80,11 +84,11 @@ struct KVServerAdaGradHandle {
           float gradient = req_data.vals[i * v_dim + j];
           gradient += regu_lambda_ * gradient;
           val.n[j] = gradient * gradient;
-          val.w[j] -= (learning_rate_ * gradient * InvSqrt(val.n[j]))
+          val.w[j] -= (learning_rate_ * gradient * InvSqrt(val.n[j]));
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
-          res[i * v_dim + j] = val.w[j];
+          res.vals[i * v_dim + j] = val.w[j];
         }
       }
     }
@@ -111,10 +115,10 @@ struct KVServerFTRLHandle {
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      CHECK_EQ(n, req_data.vals.size());
+      CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
-      res.vals.resize(n);
+      res.vals.resize(keys_size);
     }
     for (size_t i = 0; i < keys_size; ++i) {
       ps::Key key = req_data.keys[i];
@@ -150,15 +154,17 @@ class XLearnServer{
  public:
   XLearnServer(){
     auto server_ = new ps::KVServer<float>(0);
+    /*
     if (opt_type_.compare("sgd") == 0) {
       server_->set_request_handle(KVServerSGDHandle());
     }
     if (opt_type_.compare("adagrad") == 0) {
       server_->set_request_handle(KVServerAdaGradHandle());
     }
-    if (opt_type_.compare("ftrl") == 0) {
+    */
+    //if (opt_type_.compare("ftrl") == 0) {
       server_->set_request_handle(KVServerFTRLHandle());
-    }
+    //}
     std::cout << "init server success " << std::endl;
   }
   ~XLearnServer(){}

From a3a94a59d3371eb488470304b5be0dcc8aa9e9c9 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 22:44:03 +0800
Subject: [PATCH 49/82] update: worker.h

---
 src/distributed/worker.h | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/src/distributed/worker.h b/src/distributed/worker.h
index 5d75123b..25942f34 100644
--- a/src/distributed/worker.h
+++ b/src/distributed/worker.h
@@ -8,6 +8,10 @@
 #ifndef WORKER_H
 #define WORKER_H
 
+#include "ps/ps.h"
+
+namespace xlearn{
+
 class XLearnWorker {
  public:
   XLearnWorker() {
@@ -21,4 +25,6 @@ class XLearnWorker {
   ps::KVWorker<float>* kv_v_;
 };
 
+}
+
 #endif /* !WORKER_H */

From 7eb5b6e9133a3bfa7989432f5fb34615d1e57f9c Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 22:44:24 +0800
Subject: [PATCH 50/82] update: metric

---
 src/loss/metric.h | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/loss/metric.h b/src/loss/metric.h
index 548a5937..34feb31b 100644
--- a/src/loss/metric.h
+++ b/src/loss/metric.h
@@ -545,7 +545,7 @@ class AUCMetric : public Metric {
     CHECK_EQ(positive_vec.size(), negative_vec.size());
     index_t positive_sum = 0;
     index_t negative_sum= 0;
-    index_t pre_positive_sum = 0.0;
+    index_t pre_positive_sum = 0;
     index_t positivesum_dot_negativesum = 0;
     double auc = 0.0;
     double auc_res = 0.0;

From d4bbe8107c1875627c9d66cc0cb3fc097041b617 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 18 Dec 2017 22:44:51 +0800
Subject: [PATCH 51/82] add: start worker and server

---
 src/solver/train_main.cc | 19 ++++++++++++++-----
 1 file changed, 14 insertions(+), 5 deletions(-)

diff --git a/src/solver/train_main.cc b/src/solver/train_main.cc
index 92a85116..41f3ea5c 100644
--- a/src/solver/train_main.cc
+++ b/src/solver/train_main.cc
@@ -24,6 +24,8 @@ This file is the entry for training of the xLearn.
 #include "src/base/timer.h"
 #include "src/base/stringprintf.h"
 #include "src/solver/solver.h"
+#include "src/distributed/server.h"
+#include "src/distributed/worker.h"
 
 //------------------------------------------------------------------------------
 // The pre-defined main function
@@ -33,11 +35,18 @@ int main(int argc, char* argv[]) {
   Timer timer;
   timer.tic();
 
-  xLearn::Solver solver;
-  solver.SetTrain();
-  solver.Initialize(argc, argv);
-  solver.StartWork();
-  solver.Clear();
+  if (ps::IsServer()) {
+    xlearn::XLearnServer* server = new xlearn::XLearnServer();
+  }
+  ps::Start();
+  if (ps::IsWorker()) {
+    xLearn::Solver solver;
+    solver.SetTrain();
+    solver.Initialize(argc, argv);
+    solver.StartWork();
+    solver.Clear();
+  }
+  ps::Finalize();
 
   print_info(
     StringPrintf("Total time cost: %.2f (sec)", 

From 42d513acb552ffaad321c4188ffee5e34a0c700a Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 19 Dec 2017 09:36:12 +0800
Subject: [PATCH 52/82] fix: auc

---
 src/loss/metric.h | 13 ++++++++-----
 1 file changed, 8 insertions(+), 5 deletions(-)

diff --git a/src/loss/metric.h b/src/loss/metric.h
index 34feb31b..77c7e1bd 100644
--- a/src/loss/metric.h
+++ b/src/loss/metric.h
@@ -543,21 +543,24 @@ class AUCMetric : public Metric {
   real_t CalcAUC(std::vector<index_t> positive_vec,
                  std::vector<index_t> negative_vec) {
     CHECK_EQ(positive_vec.size(), negative_vec.size());
-    index_t positive_sum = 0;
-    index_t negative_sum= 0;
-    index_t pre_positive_sum = 0;
-    index_t positivesum_dot_negativesum = 0;
+    long long positive_sum = 0;
+    long long negative_sum= 0;
+    long long pre_positive_sum = 0;
+    long long positivesum_dot_negativesum = 0;
     double auc = 0.0;
     double auc_res = 0.0;
     for (index_t i = 0; i < kMaxBucketSize; ++i) {
       pre_positive_sum = positive_sum;
       positive_sum += all_positive_number_[i];
       negative_sum += all_negative_number_[i];
-      auc += (pre_positive_sum + positive_sum) * 
+      auc += (pre_positive_sum + positive_sum) *
              (double)(all_negative_number_[i]) * 1.0 / 2;
     }
+    std::cout <<positive_sum << "------" << negative_sum << std::endl;
+    std::cout << auc << std::endl;
     positivesum_dot_negativesum = positive_sum * negative_sum;
     auc_res = auc / (positivesum_dot_negativesum);
+    std::cout << auc_res << std::endl;
     return 1.0 - auc_res;
   }
 

From c55001a042088de32e058a4729b8c6560e1e64e2 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 19 Dec 2017 09:42:03 +0800
Subject: [PATCH 53/82] update

---
 src/loss/metric.h | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/src/loss/metric.h b/src/loss/metric.h
index 77c7e1bd..254b56e8 100644
--- a/src/loss/metric.h
+++ b/src/loss/metric.h
@@ -556,11 +556,8 @@ class AUCMetric : public Metric {
       auc += (pre_positive_sum + positive_sum) *
              (double)(all_negative_number_[i]) * 1.0 / 2;
     }
-    std::cout <<positive_sum << "------" << negative_sum << std::endl;
-    std::cout << auc << std::endl;
     positivesum_dot_negativesum = positive_sum * negative_sum;
     auc_res = auc / (positivesum_dot_negativesum);
-    std::cout << auc_res << std::endl;
     return 1.0 - auc_res;
   }
 

From 5d2e4b2bebf7bd6d6686b53df8004a6f046bfa9d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 20 Dec 2017 08:33:45 +0800
Subject: [PATCH 54/82] update: to dist score

---
 src/solver/solver.cc | 8 +++++---
 src/solver/solver.h  | 7 +++++--
 2 files changed, 10 insertions(+), 5 deletions(-)

diff --git a/src/solver/solver.cc b/src/solver/solver.cc
index 5be6879f..e6b2226f 100644
--- a/src/solver/solver.cc
+++ b/src/solver/solver.cc
@@ -80,9 +80,11 @@ Reader* Solver::create_reader() {
 }
 
 // Create Score by a given string
-Score* Solver::create_score() {
-  Score* score;
-  score = CREATE_SCORE(hyper_param_.score_func.c_str());
+DistScore* Solver::create_score() {
+  //Score* score;
+  DistScore* score;
+  //score = CREATE_SCORE(hyper_param_.score_func.c_str());
+  score = CREATE_DIST_SCORE("dist_linear");
   if (score == nullptr) {
     LOG(FATAL) << "Cannot create score: "
                << hyper_param_.score_func;
diff --git a/src/solver/solver.h b/src/solver/solver.h
index d08cd461..d805b10b 100644
--- a/src/solver/solver.h
+++ b/src/solver/solver.h
@@ -33,6 +33,7 @@ of the xLearn.
 #include "src/reader/parser.h"
 #include "src/reader/file_splitor.h"
 #include "src/score/score_function.h"
+#include "src/distributed/dist_score_function.h"
 #include "src/loss/loss.h"
 #include "src/loss/metric.h"
 #include "src/solver/checker.h"
@@ -95,7 +96,8 @@ class Solver {
   /* Split file in cross-validation */
   xLearn::FileSpliter splitor_;
   /* linear, fm or ffm ? */
-  xLearn::Score* score_;
+  //xLearn::Score* score_;
+  xLearn::DistScore* score_;
   /* cross-entropy or squared ? */
   xLearn::Loss* loss_;
   /* acc, prec, recall, mae, etc */
@@ -105,7 +107,8 @@ class Solver {
 
   // Create object by name
   xLearn::Reader* create_reader();
-  xLearn::Score* create_score();
+  //xLearn::Score* create_score();
+  xLearn::DistScore* create_score();
   xLearn::Loss* create_loss();
   xLearn::Metric* create_metric();
 

From e20e4bfbcad585c9cbf4ea2f6e8bdc5684f3119b Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 20 Dec 2017 08:34:18 +0800
Subject: [PATCH 55/82] update: loss

---
 src/distributed/dist_score_function.h |  4 ++--
 src/loss/CMakeLists.txt               | 12 ++++++------
 src/loss/loss.h                       |  5 +++--
 3 files changed, 11 insertions(+), 10 deletions(-)

diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index 2eb5ab30..6a2f5e1b 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -107,9 +107,9 @@ CLASS_REGISTER_DEFINE_REGISTRY(xLearn_dist_score_registry, DistScore);
       format_name,                                          \
       score_name)
 
-#define CREATE_SCORE(format_name)                           \
+#define CREATE_DIST_SCORE(format_name)                           \
   CLASS_REGISTER_CREATE_OBJECT(                             \
-      xLearn_score_registry,                                \
+      xLearn_dist_score_registry,                                \
       format_name)
 
 }  // namespace xLearn
diff --git a/src/loss/CMakeLists.txt b/src/loss/CMakeLists.txt
index a598f03a..ce822050 100644
--- a/src/loss/CMakeLists.txt
+++ b/src/loss/CMakeLists.txt
@@ -21,14 +21,14 @@ set_target_properties(loss PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 # Build uinttests
 set(LIBS loss score data base gtest)
 
-add_executable(loss_test loss_test.cc)
-target_link_libraries(loss_test gtest_main ${LIBS})
+#add_executable(loss_test loss_test.cc)
+#target_link_libraries(loss_test gtest_main ${LIBS})
 
-add_executable(squared_loss_test squared_loss_test.cc)
-target_link_libraries(squared_loss_test gtest_main ${LIBS})
+#add_executable(squared_loss_test squared_loss_test.cc)
+#target_link_libraries(squared_loss_test gtest_main ${LIBS})
 
-add_executable(cross_entropy_loss_test cross_entropy_loss_test.cc)
-target_link_libraries(cross_entropy_loss_test gtest_main ${LIBS})
+#add_executable(cross_entropy_loss_test cross_entropy_loss_test.cc)
+#target_link_libraries(cross_entropy_loss_test gtest_main ${LIBS})
 
 add_executable(metric_test metric_test.cc)
 target_link_libraries(metric_test gtest_main ${LIBS})
diff --git a/src/loss/loss.h b/src/loss/loss.h
index bdb454e6..fdd8933e 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -81,13 +81,14 @@ class Loss {
   virtual ~Loss() { }
 
   // This function needs to be invoked before using this class
-  void Initialize(Score* score, 
+  //void Initialize(Score* score, 
+  void Initialize(DistScore* score, 
                   ThreadPool* pool, 
                   bool norm = true,
                   bool lock_free = false) {
     CHECK_NOTNULL(score);
     CHECK_NOTNULL(pool);
-    score_func_ = score;
+    dist_score_func_ = score;
     pool_ = pool;
     norm_ = norm;
     threadNumber_ = pool_->ThreadNumber();

From dc208e2edf820db0f907c7d95ca8a91d233e46c5 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 20 Dec 2017 22:59:56 +0800
Subject: [PATCH 56/82] update and fix: distributed

---
 src/distributed/dist_cross_entropy_loss.cc | 31 +++++++-----
 src/distributed/dist_cross_entropy_loss.h  |  1 +
 src/distributed/dist_linear_score.cc       | 26 +++++-----
 src/distributed/dist_linear_score.h        |  8 ++--
 src/distributed/dist_score_function.h      |  2 +-
 src/distributed/server.h                   |  3 +-
 src/loss/loss.h                            |  4 +-
 src/solver/checker.cc                      |  8 ++--
 src/solver/solver.cc                       | 10 ++--
 src/solver/solver.h                        |  5 +-
 src/solver/train_main.cc                   | 13 +++--
 src/solver/trainer.cc                      | 56 ++++++++++++----------
 src/solver/trainer.h                       |  1 +
 13 files changed, 94 insertions(+), 74 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 53b76215..442faedc 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -81,7 +81,7 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 
 // Calculate gradient in one thread.
-static void ce_gradient_thread(const DMatrix* matrix,
+static void ce_gradient_thread(const DMatrix& matrix,
                                std::unordered_map<index_t, real_t>& w,
                                DistScore* dist_score_func,
                                bool is_norm,
@@ -91,6 +91,7 @@ static void ce_gradient_thread(const DMatrix* matrix,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
   dist_score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
+//  std::cout << "test    944444 " << std::endl;
 }
 
 //------------------------------------------------------------------------------
@@ -107,18 +108,21 @@ static void ce_gradient_thread(const DMatrix* matrix,
 //                         master_thread
 //------------------------------------------------------------------------------
 void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
+                                    Model& model) {}
+void DistCrossEntropyLoss::CalcGrad(const DMatrix& matrix,
                                 Model& model) {
-  CHECK_NOTNULL(matrix);
-  CHECK_GT(matrix->row_length, 0);
-  size_t row_len = matrix->row_length;
+  //CHECK_NOTNULL(matrix);
+  CHECK_GT(matrix.row_length, 0);
+  size_t row_len = matrix.row_length;
   total_example_ += row_len;
   auto feature_ids = std::vector<ps::Key>();
   auto gradient_pull = std::make_shared<std::vector<float>>();
   std::unordered_map<index_t, real_t> weight_map;
   std::unordered_map<index_t, real_t> gradient_push_map;
-  std::vector<real_t> gradient_push;
-  for (int i = 0; i < row_len; ++i) {
-    SparseRow* row = matrix->row[i];
+  //std::vector<real_t> gradient_push;
+  auto gradient_push = std::make_shared<std::vector<float>>();
+  for (index_t i = 0; i < row_len; ++i) {
+    SparseRow* row = matrix.row[i];
     for (SparseRow::const_iterator iter = row->begin();
          iter != row->end(); ++iter) {
       index_t idx = iter->feat_id;
@@ -131,7 +135,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
                       feature_ids.end());
 
   gradient_pull->resize(feature_ids.size());
-  if (model.GetScoreFunction().compare("dist_linear") == 0) {
+  if (model.GetScoreFunction().compare("linear") == 0) {
     kv_w_->Pull(feature_ids, &(*gradient_pull));
   }
   for (int i = 0; i < gradient_pull->size(); ++i) {
@@ -141,12 +145,14 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   }
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
+  std::cout << "cout = " << count << "\tlen = " << row_len << std::endl;
   std::vector<real_t> sum(count, 0);
   for (int i = 0; i < count; ++i) {
+    std::cout << "i ====== " << i << std::endl;
     index_t start_idx = getStart(row_len, count, i);
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
-                             matrix,
+                             std::ref(matrix),
                              std::ref(weight_map),
                              dist_score_func_,
                              norm_,
@@ -157,13 +163,14 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   }
   // Wait all of the threads finish their job
   pool_->Sync(count);
+  std::cout << "167======"<< std::endl;
   for (int i = 0; i < feature_ids.size(); ++i) {
     index_t idx = feature_ids[i];
     real_t g = gradient_push_map[idx];
-    gradient_pull->push_back(g);
+    gradient_push->push_back(g);
   }
-  if (model.GetScoreFunction().compare("dist_linear") == 0) {
-    kv_w_->Push(feature_ids, gradient_push);
+  if (model.GetScoreFunction().compare("linear") == 0) {
+    kv_w_->Push(feature_ids, (*gradient_push));
   }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
index 337a4814..a3c8891d 100644
--- a/src/distributed/dist_cross_entropy_loss.h
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -46,6 +46,7 @@ class DistCrossEntropyLoss : public Loss {
   // and update current model parameters.
   // This function will also accumulate the loss value.
   void CalcGrad(const DMatrix* data_matrix, Model& model);
+  void CalcGrad(const DMatrix& data_matrix, Model& model);
 
   // Return current loss type.
   std::string loss_type() { return "dist_log_loss"; }
diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index c7dbe424..54a7a7c4 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -38,7 +38,7 @@ real_t DistLinearScore::CalcScore(const SparseRow* row,
 }
 
 // Calculate gradient and update current model
-void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
+void DistLinearScore::DistCalcGrad(const DMatrix& matrix,
                            std::unordered_map<index_t, real_t>& w,
                            real_t* sum,
                            std::unordered_map<index_t, real_t>& g,
@@ -55,11 +55,12 @@ void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
   // Using ftrl
   else if (opt_type_.compare("ftrl") == 0) {
     this->calc_grad_ftrl(matrix, w, sum, g, start_idx, end_idx);
+    std::cout << "ftrllllll 588888888" << std::endl;
   }
 }
 
 // Calculate gradient and update current model using sgd
-void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
+void DistLinearScore::calc_grad_sgd(const DMatrix& matrix,
                                 std::unordered_map<index_t, real_t>& w,
                                 real_t* sum,
                                 std::unordered_map<index_t, real_t>& g,
@@ -67,9 +68,9 @@ void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
                                 real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix->row[i];
+    SparseRow* row = matrix.row[i];
     real_t pred = CalcScore(row, &w);
-    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
@@ -83,7 +84,7 @@ void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
 }
 
 // Calculate gradient and update current model using adagrad
-void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
+void DistLinearScore::calc_grad_adagrad(const DMatrix& matrix,
                                     std::unordered_map<index_t, real_t>& w,
                                     real_t* sum,
                                     std::unordered_map<index_t, real_t>& g,
@@ -91,9 +92,9 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
                                     real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix->row[i];
+    SparseRow* row = matrix.row[i];
     real_t pred = CalcScore(row, &w);
-    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
@@ -107,16 +108,18 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
 }
 
 // Calculate gradient and update current model using ftrl
-void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
+void DistLinearScore::calc_grad_ftrl(const DMatrix& matrix,
                                  std::unordered_map<index_t, real_t>& w,
                                  real_t* sum,
                                  std::unordered_map<index_t, real_t>& g,
                                  real_t start_idx,
                                  real_t end_idx) {
-  for (int i = 0; i < start_idx; ++i) {
-    SparseRow* row = matrix->row[i];
+  //std::cout << "start_idx = " << start_idx << "\tend_idx = " << end_idx << std::endl;
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix.row[i];
     real_t pred = CalcScore(row, &w);
-    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    //if (i % 1000 == 0) std::cout << i << std::endl;
+    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
@@ -125,6 +128,7 @@ void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
       real_t gradient = pg * iter->feat_val; // get gradient
       g[idx_g] += gradient;
     }
+    //std::cout << "i*" << i << std::endl;
   }
 }
 
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index d35a2416..edd51779 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -44,7 +44,7 @@ class DistLinearScore : public DistScore {
                    std::unordered_map<index_t, real_t>* w,
                    real_t norm = 1.0);
 
-  void DistCalcGrad(const DMatrix* matrix,
+  void DistCalcGrad(const DMatrix& matrix,
                      std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>& g,
@@ -53,7 +53,7 @@ class DistLinearScore : public DistScore {
 
  protected:
   // Calculate gradient and update model using sgd
-  void calc_grad_sgd(const DMatrix* matrix,
+  void calc_grad_sgd(const DMatrix& matrix,
                      std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>& g,
@@ -62,7 +62,7 @@ class DistLinearScore : public DistScore {
                     );
 
   // Calculate gradient and update model using adagrad
-  void calc_grad_adagrad(const DMatrix* matrix,
+  void calc_grad_adagrad(const DMatrix& matrix,
                          std::unordered_map<index_t, real_t>& w,
                          real_t* sum,
                          std::unordered_map<index_t, real_t>& g,
@@ -71,7 +71,7 @@ class DistLinearScore : public DistScore {
                         );
 
   // Calculate gradient and update model using ftrl
-  void calc_grad_ftrl(const DMatrix* matrix,
+  void calc_grad_ftrl(const DMatrix& matrix,
                       std::unordered_map<index_t, real_t>& w,
                       real_t* sum,
                       std::unordered_map<index_t, real_t>& g,
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index 6a2f5e1b..58a66e54 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -75,7 +75,7 @@ class DistScore {
                            std::unordered_map<index_t, real_t>* w,
                            real_t norm = 1.0) = 0;
 
-  virtual void DistCalcGrad(const DMatrix* matrix,
+  virtual void DistCalcGrad(const DMatrix& matrix,
                                std::unordered_map<index_t, real_t>& w,
                                real_t* sum,
                                std::unordered_map<index_t, real_t>& g,
diff --git a/src/distributed/server.h b/src/distributed/server.h
index caa7ea6e..7dea8fc9 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -14,7 +14,7 @@ float lambda2 = 2.0;
 float regu_lambda_ = 0.1;
 float learning_rate_ = 0.1;
 
-int v_dim = 4;
+int v_dim = 1;
 
 typedef struct SGDEntry{
   SGDEntry(size_t k = 4) {
@@ -115,6 +115,7 @@ struct KVServerFTRLHandle {
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
+      std::cout << keys_size * v_dim << "==" << req_data.vals.size() << std::endl;
       CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
diff --git a/src/loss/loss.h b/src/loss/loss.h
index fdd8933e..61178943 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -82,13 +82,13 @@ class Loss {
 
   // This function needs to be invoked before using this class
   //void Initialize(Score* score, 
-  void Initialize(DistScore* score, 
+  void Initialize(Score* score, 
                   ThreadPool* pool, 
                   bool norm = true,
                   bool lock_free = false) {
     CHECK_NOTNULL(score);
     CHECK_NOTNULL(pool);
-    dist_score_func_ = score;
+    score_func_ = score;
     pool_ = pool;
     norm_ = norm;
     threadNumber_ = pool_->ThreadNumber();
diff --git a/src/solver/checker.cc b/src/solver/checker.cc
index 458ec333..b82db5d6 100644
--- a/src/solver/checker.cc
+++ b/src/solver/checker.cc
@@ -236,15 +236,15 @@ bool Checker::check_train_options(HyperParam& hyper_param) {
       } else {
         switch (value) {
           case 0:
-            hyper_param.loss_func = "cross-entropy";
+            hyper_param.loss_func = "dist-cross-entropy";
             hyper_param.score_func = "linear";
             break;
           case 1:
-            hyper_param.loss_func = "cross-entropy";
+            hyper_param.loss_func = "dist-cross-entropy";
             hyper_param.score_func = "fm";
             break;
           case 2:
-            hyper_param.loss_func = "cross-entropy";
+            hyper_param.loss_func = "dist-cross-entropy";
             hyper_param.score_func = "ffm";
             break;
           case 3:
@@ -590,7 +590,7 @@ void Checker::check_conflict_train(HyperParam& hyper_param) {
       );
       hyper_param.metric = "none";
     }
-  } else if (hyper_param.loss_func.compare("cross-entropy") == 0) {
+  } else if (hyper_param.loss_func.compare("dist-cross-entropy") == 0) {
     if (hyper_param.metric.compare("mae") == 0 ||
         hyper_param.metric.compare("mape") == 0 ||
         hyper_param.metric.compare("rmsd") == 0 ||
diff --git a/src/solver/solver.cc b/src/solver/solver.cc
index e6b2226f..c88b8120 100644
--- a/src/solver/solver.cc
+++ b/src/solver/solver.cc
@@ -319,8 +319,8 @@ void Solver::init_train() {
   /*********************************************************
    *  Initialize score function                            *
    *********************************************************/
-  score_ = create_score();
-  score_->Initialize(hyper_param_.learning_rate,
+  dist_score_ = create_score();
+  dist_score_->Initialize(hyper_param_.learning_rate,
                      hyper_param_.regu_lambda,
                      hyper_param_.alpha,
                      hyper_param_.beta,
@@ -332,7 +332,7 @@ void Solver::init_train() {
    *  Initialize loss function                             *
    *********************************************************/
   loss_ = create_loss();
-  loss_->Initialize(score_, pool_, 
+  loss_->DistInitialize(dist_score_, pool_, 
          hyper_param_.norm, 
          hyper_param_.lock_free);
   LOG(INFO) << "Initialize loss function.";
@@ -431,13 +431,13 @@ void Solver::init_predict() {
   /*********************************************************
    *  Init score function                                  *
    *********************************************************/
-  score_ = create_score();
+  dist_score_ = create_score();
   LOG(INFO) << "Initialize score function.";
   /*********************************************************
    *  Init loss function                                   *
    *********************************************************/
   loss_ = create_loss();
-  loss_->Initialize(score_, pool_, hyper_param_.norm);
+  loss_->DistInitialize(dist_score_, pool_, hyper_param_.norm);
   LOG(INFO) << "Initialize score function.";
 }
 
diff --git a/src/solver/solver.h b/src/solver/solver.h
index d805b10b..42b3284b 100644
--- a/src/solver/solver.h
+++ b/src/solver/solver.h
@@ -59,6 +59,7 @@ class Solver {
   // Constructor and Destructor
   Solver() 
     : score_(nullptr),
+      dist_score_(nullptr),
       loss_(nullptr),
       metric_(nullptr) { }
   ~Solver() { }
@@ -96,8 +97,8 @@ class Solver {
   /* Split file in cross-validation */
   xLearn::FileSpliter splitor_;
   /* linear, fm or ffm ? */
-  //xLearn::Score* score_;
-  xLearn::DistScore* score_;
+  xLearn::Score* score_;
+  xLearn::DistScore* dist_score_;
   /* cross-entropy or squared ? */
   xLearn::Loss* loss_;
   /* acc, prec, recall, mae, etc */
diff --git a/src/solver/train_main.cc b/src/solver/train_main.cc
index 41f3ea5c..a190d301 100644
--- a/src/solver/train_main.cc
+++ b/src/solver/train_main.cc
@@ -32,25 +32,24 @@ This file is the entry for training of the xLearn.
 //------------------------------------------------------------------------------
 
 int main(int argc, char* argv[]) {
-  Timer timer;
-  timer.tic();
-
   if (ps::IsServer()) {
     xlearn::XLearnServer* server = new xlearn::XLearnServer();
   }
+
   ps::Start();
   if (ps::IsWorker()) {
+    Timer timer;
+    timer.tic();
     xLearn::Solver solver;
     solver.SetTrain();
     solver.Initialize(argc, argv);
     solver.StartWork();
     solver.Clear();
+    print_info(
+      StringPrintf("Total time cost: %.2f (sec)", 
+      timer.toc()), false);
   }
   ps::Finalize();
 
-  print_info(
-    StringPrintf("Total time cost: %.2f (sec)", 
-    timer.toc()), false);
-
   return 0;
 }
diff --git a/src/solver/trainer.cc b/src/solver/trainer.cc
index 0b2ae31f..04242bc8 100644
--- a/src/solver/trainer.cc
+++ b/src/solver/trainer.cc
@@ -177,35 +177,39 @@ void Trainer::train(std::vector<Reader*>& train_reader,
     Timer timer;
     timer.tic();
     // Calc grad and update model
+    std::cout << "n = " << epoch_ << std::endl;
     real_t tr_loss = calc_gradient(train_reader);
+    std::cout << "trainer.cc : 181 ========" << std::endl;
     // we don't do any evaluation in a quiet model
-    if (!quiet_) {
-      if (!test_reader.empty()) { 
-        te_info = calc_metric(test_reader); 
-      }
-      // show evaludation metric info
-      show_train_info(tr_loss, 
-                      te_info.loss_val,
-                      te_info.metric_val,
-                      timer.toc(), 
-                      !test_reader.empty(), 
-                      n);
-      // Early-stopping
-      if (early_stop_) {
-        if (te_info.loss_val < best_loss) {
-          best_loss = te_info.loss_val;
-          best_epoch = n;
-          model_->SetBestModel();
+    if (ps::MyRank() == 100) {
+      if (!quiet_) {
+        if (!test_reader.empty()) { 
+          te_info = calc_metric(test_reader); 
         }
-        if (te_info.loss_val >= prev_loss) {
-          stop_window++;
-          // If the validation loss goes up conntinuously
-          // in 3 epoch, we stop training
-          if (stop_window == kStopWindow) { break; }
-        } else {
-          stop_window = 0;
+        // show evaludation metric info
+        show_train_info(tr_loss, 
+            te_info.loss_val,
+            te_info.metric_val,
+            timer.toc(), 
+            !test_reader.empty(), 
+            n);
+        // Early-stopping
+        if (early_stop_) {
+          if (te_info.loss_val < best_loss) {
+            best_loss = te_info.loss_val;
+            best_epoch = n;
+            model_->SetBestModel();
+          }
+          if (te_info.loss_val >= prev_loss) {
+            stop_window++;
+            // If the validation loss goes up conntinuously
+            // in 3 epoch, we stop training
+            if (stop_window == kStopWindow) { break; }
+          } else {
+            stop_window = 0;
+          }
+          prev_loss = te_info.loss_val;
         }
-        prev_loss = te_info.loss_val;
       }
     }
   }
@@ -231,7 +235,9 @@ real_t Trainer::calc_gradient(std::vector<Reader*>& reader) {
     for (;;) {
       index_t tmp = reader[i]->Samples(matrix);
       if (tmp == 0) { break; }
+      std::cout << "trainer.cc 237 ===============" << std::endl;
       loss_->CalcGrad(matrix, *model_);
+      std::cout << "trainer.cc 239 ===============" << std::endl;
     }
   }
   return loss_->GetLoss();
diff --git a/src/solver/trainer.h b/src/solver/trainer.h
index 51bc20c1..fb8bce34 100644
--- a/src/solver/trainer.h
+++ b/src/solver/trainer.h
@@ -31,6 +31,7 @@ This file defines the Trainer class.
 #include "src/data/model_parameters.h"
 #include "src/loss/loss.h"
 #include "src/loss/metric.h"
+#include "ps/ps.h"
 
 namespace xLearn {
 

From 3c28a91dbd11d4d65a4da5702d0cc3cd3178428f Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Thu, 21 Dec 2017 08:27:09 +0800
Subject: [PATCH 57/82] update: dist

---
 src/distributed/dist_cross_entropy_loss.cc | 18 +++++++-----------
 src/distributed/dist_cross_entropy_loss.h  |  2 +-
 src/distributed/dist_linear_score.cc       | 21 ++++++++++-----------
 src/distributed/dist_linear_score.h        |  8 ++++----
 src/distributed/dist_score_function.h      |  2 +-
 src/solver/trainer.cc                      | 20 ++++++++------------
 6 files changed, 31 insertions(+), 40 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 442faedc..37e775d9 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -81,7 +81,7 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 
 // Calculate gradient in one thread.
-static void ce_gradient_thread(const DMatrix& matrix,
+static void ce_gradient_thread(const DMatrix* matrix,
                                std::unordered_map<index_t, real_t>& w,
                                DistScore* dist_score_func,
                                bool is_norm,
@@ -91,7 +91,6 @@ static void ce_gradient_thread(const DMatrix& matrix,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
   dist_score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
-//  std::cout << "test    944444 " << std::endl;
 }
 
 //------------------------------------------------------------------------------
@@ -108,21 +107,18 @@ static void ce_gradient_thread(const DMatrix& matrix,
 //                         master_thread
 //------------------------------------------------------------------------------
 void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
-                                    Model& model) {}
-void DistCrossEntropyLoss::CalcGrad(const DMatrix& matrix,
-                                Model& model) {
-  //CHECK_NOTNULL(matrix);
-  CHECK_GT(matrix.row_length, 0);
-  size_t row_len = matrix.row_length;
+                                    Model& model) {
+  CHECK_NOTNULL(matrix);
+  CHECK_GT(matrix->row_length, 0);
+  size_t row_len = matrix->row_length;
   total_example_ += row_len;
   auto feature_ids = std::vector<ps::Key>();
   auto gradient_pull = std::make_shared<std::vector<float>>();
   std::unordered_map<index_t, real_t> weight_map;
   std::unordered_map<index_t, real_t> gradient_push_map;
-  //std::vector<real_t> gradient_push;
   auto gradient_push = std::make_shared<std::vector<float>>();
   for (index_t i = 0; i < row_len; ++i) {
-    SparseRow* row = matrix.row[i];
+    SparseRow* row = matrix->row[i];
     for (SparseRow::const_iterator iter = row->begin();
          iter != row->end(); ++iter) {
       index_t idx = iter->feat_id;
@@ -152,7 +148,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix& matrix,
     index_t start_idx = getStart(row_len, count, i);
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
-                             std::ref(matrix),
+                             matrix,
                              std::ref(weight_map),
                              dist_score_func_,
                              norm_,
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
index a3c8891d..7ce52ea5 100644
--- a/src/distributed/dist_cross_entropy_loss.h
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -46,7 +46,7 @@ class DistCrossEntropyLoss : public Loss {
   // and update current model parameters.
   // This function will also accumulate the loss value.
   void CalcGrad(const DMatrix* data_matrix, Model& model);
-  void CalcGrad(const DMatrix& data_matrix, Model& model);
+  //void DistCalcGrad(const DMatrix& data_matrix, Model& model);
 
   // Return current loss type.
   std::string loss_type() { return "dist_log_loss"; }
diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index 54a7a7c4..77ee7bfd 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -38,7 +38,7 @@ real_t DistLinearScore::CalcScore(const SparseRow* row,
 }
 
 // Calculate gradient and update current model
-void DistLinearScore::DistCalcGrad(const DMatrix& matrix,
+void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
                            std::unordered_map<index_t, real_t>& w,
                            real_t* sum,
                            std::unordered_map<index_t, real_t>& g,
@@ -55,12 +55,11 @@ void DistLinearScore::DistCalcGrad(const DMatrix& matrix,
   // Using ftrl
   else if (opt_type_.compare("ftrl") == 0) {
     this->calc_grad_ftrl(matrix, w, sum, g, start_idx, end_idx);
-    std::cout << "ftrllllll 588888888" << std::endl;
   }
 }
 
 // Calculate gradient and update current model using sgd
-void DistLinearScore::calc_grad_sgd(const DMatrix& matrix,
+void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
                                 std::unordered_map<index_t, real_t>& w,
                                 real_t* sum,
                                 std::unordered_map<index_t, real_t>& g,
@@ -68,9 +67,9 @@ void DistLinearScore::calc_grad_sgd(const DMatrix& matrix,
                                 real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix.row[i];
+    SparseRow* row = matrix->row[i];
     real_t pred = CalcScore(row, &w);
-    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
@@ -84,7 +83,7 @@ void DistLinearScore::calc_grad_sgd(const DMatrix& matrix,
 }
 
 // Calculate gradient and update current model using adagrad
-void DistLinearScore::calc_grad_adagrad(const DMatrix& matrix,
+void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
                                     std::unordered_map<index_t, real_t>& w,
                                     real_t* sum,
                                     std::unordered_map<index_t, real_t>& g,
@@ -92,9 +91,9 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix& matrix,
                                     real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix.row[i];
+    SparseRow* row = matrix->row[i];
     real_t pred = CalcScore(row, &w);
-    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
@@ -108,7 +107,7 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix& matrix,
 }
 
 // Calculate gradient and update current model using ftrl
-void DistLinearScore::calc_grad_ftrl(const DMatrix& matrix,
+void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
                                  std::unordered_map<index_t, real_t>& w,
                                  real_t* sum,
                                  std::unordered_map<index_t, real_t>& g,
@@ -116,10 +115,10 @@ void DistLinearScore::calc_grad_ftrl(const DMatrix& matrix,
                                  real_t end_idx) {
   //std::cout << "start_idx = " << start_idx << "\tend_idx = " << end_idx << std::endl;
   for (index_t i = start_idx; i < end_idx; ++i) {
-    SparseRow* row = matrix.row[i];
+    SparseRow* row = matrix->row[i];
     real_t pred = CalcScore(row, &w);
     //if (i % 1000 == 0) std::cout << i << std::endl;
-    real_t y = matrix.Y[i] > 0 ? 1.0 : -1.0;
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
     for (SparseRow::const_iterator iter = row->begin();
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index edd51779..d35a2416 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -44,7 +44,7 @@ class DistLinearScore : public DistScore {
                    std::unordered_map<index_t, real_t>* w,
                    real_t norm = 1.0);
 
-  void DistCalcGrad(const DMatrix& matrix,
+  void DistCalcGrad(const DMatrix* matrix,
                      std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>& g,
@@ -53,7 +53,7 @@ class DistLinearScore : public DistScore {
 
  protected:
   // Calculate gradient and update model using sgd
-  void calc_grad_sgd(const DMatrix& matrix,
+  void calc_grad_sgd(const DMatrix* matrix,
                      std::unordered_map<index_t, real_t>& w,
                      real_t* sum,
                      std::unordered_map<index_t, real_t>& g,
@@ -62,7 +62,7 @@ class DistLinearScore : public DistScore {
                     );
 
   // Calculate gradient and update model using adagrad
-  void calc_grad_adagrad(const DMatrix& matrix,
+  void calc_grad_adagrad(const DMatrix* matrix,
                          std::unordered_map<index_t, real_t>& w,
                          real_t* sum,
                          std::unordered_map<index_t, real_t>& g,
@@ -71,7 +71,7 @@ class DistLinearScore : public DistScore {
                         );
 
   // Calculate gradient and update model using ftrl
-  void calc_grad_ftrl(const DMatrix& matrix,
+  void calc_grad_ftrl(const DMatrix* matrix,
                       std::unordered_map<index_t, real_t>& w,
                       real_t* sum,
                       std::unordered_map<index_t, real_t>& g,
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index 58a66e54..6a2f5e1b 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -75,7 +75,7 @@ class DistScore {
                            std::unordered_map<index_t, real_t>* w,
                            real_t norm = 1.0) = 0;
 
-  virtual void DistCalcGrad(const DMatrix& matrix,
+  virtual void DistCalcGrad(const DMatrix* matrix,
                                std::unordered_map<index_t, real_t>& w,
                                real_t* sum,
                                std::unordered_map<index_t, real_t>& g,
diff --git a/src/solver/trainer.cc b/src/solver/trainer.cc
index 04242bc8..bf585293 100644
--- a/src/solver/trainer.cc
+++ b/src/solver/trainer.cc
@@ -177,9 +177,7 @@ void Trainer::train(std::vector<Reader*>& train_reader,
     Timer timer;
     timer.tic();
     // Calc grad and update model
-    std::cout << "n = " << epoch_ << std::endl;
     real_t tr_loss = calc_gradient(train_reader);
-    std::cout << "trainer.cc : 181 ========" << std::endl;
     // we don't do any evaluation in a quiet model
     if (ps::MyRank() == 100) {
       if (!quiet_) {
@@ -211,16 +209,16 @@ void Trainer::train(std::vector<Reader*>& train_reader,
           prev_loss = te_info.loss_val;
         }
       }
+      if (early_stop_ && best_epoch != epoch_) {  // not for cv
+        print_action(
+            StringPrintf("Early-stopping at epoch %d", best_epoch)
+            );
+        model_->Shrink();
+      } else {  // for cv
+        metric_info_.push_back(te_info);
+      }
     }
   }
-  if (early_stop_ && best_epoch != epoch_) {  // not for cv
-    print_action(
-      StringPrintf("Early-stopping at epoch %d", best_epoch)
-    );
-    model_->Shrink();
-  } else {  // for cv
-    metric_info_.push_back(te_info);
-  }
 }
 
 /*********************************************************
@@ -235,9 +233,7 @@ real_t Trainer::calc_gradient(std::vector<Reader*>& reader) {
     for (;;) {
       index_t tmp = reader[i]->Samples(matrix);
       if (tmp == 0) { break; }
-      std::cout << "trainer.cc 237 ===============" << std::endl;
       loss_->CalcGrad(matrix, *model_);
-      std::cout << "trainer.cc 239 ===============" << std::endl;
     }
   }
   return loss_->GetLoss();

From f581ef4d4be8cf838c0a1bc09a0cba00b9e5fb95 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 16:35:21 +0800
Subject: [PATCH 58/82] fix: bug for push and pull

---
 CMakeLists.txt                             |   3 +-
 python-package/setup.py                    | 115 ++++++++++++++++-----
 src/distributed/dist_cross_entropy_loss.cc |  84 ++++++++++++---
 src/distributed/dist_cross_entropy_loss.h  |   4 +
 src/distributed/dist_linear_score.cc       |  21 ++--
 src/distributed/dist_linear_score.h        |  18 ++--
 src/distributed/dist_score_function.h      |   7 +-
 src/distributed/server.h                   |   1 -
 src/loss/loss.h                            |   3 +-
 src/solver/trainer.cc                      |   4 +-
 10 files changed, 195 insertions(+), 65 deletions(-)

diff --git a/CMakeLists.txt b/CMakeLists.txt
index bf2efd72..835d87db 100644
--- a/CMakeLists.txt
+++ b/CMakeLists.txt
@@ -30,7 +30,8 @@ cmake_minimum_required(VERSION 3.0)
 # Using c++11;
 # Optimization on architecture
 #-------------------------------------------------------------------------------
-add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
+#add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
+add_definitions("-Wall -Wno-sign-compare -std=c++11 -march=native 
 -Wno-strict-aliasing -Wno-comment")
 
 #-------------------------------------------------------------------------------
diff --git a/python-package/setup.py b/python-package/setup.py
index 0db55012..12380724 100644
--- a/python-package/setup.py
+++ b/python-package/setup.py
@@ -1,31 +1,100 @@
 # coding: utf-8
 """Setup xlearn package."""
 from __future__ import absolute_import
-import sys
+
 import os
-from setuptools import setup, find_packages
+import subprocess
+import shutil
+import sys
+
+from setuptools import find_packages
+from setuptools import setup
+from setuptools.command.install import install
+from setuptools.command.sdist import sdist
+
 sys.path.insert(0, '.')
 
 CURRENT_DIR = os.path.dirname(__file__)
 
-libpath_py = os.path.join(CURRENT_DIR, 'xlearn/libpath.py')
-libpath = {'__file__': libpath_py}
-exec(compile(open(libpath_py, "rb").read(), libpath_py, 'exec'), libpath, libpath)
-
-LIB_PATH = [os.path.relpath(libfile, CURRENT_DIR) for libfile in libpath['find_lib_path']()]
-print("Install libxlearn_api from: %s" % LIB_PATH)
-
-setup(name='xlearn',
-      version=open(os.path.join(CURRENT_DIR, 'xlearn/VERSION')).read().strip(),
-      description="xLearn Python Package",
-      maintainer='Chao Ma',
-      maintainer_email='mctt90@gmail.com',
-      zip_safe=False,
-      packages=find_packages(),
-      # this will use MANIFEST.in during install where we specify additional files,
-      # this is the golden line
-      include_package_data=True,
-      data_files=[('xlearn', LIB_PATH)],
-      license='Apache-2.0',
-      classifiers=['License :: OSI Approved :: Apache Software License'],
-      url='https://github.com/aksnzhy/xlearn')
\ No newline at end of file
+def silent_call(cmd, raise_error=False, error_msg=''):
+    try:
+        with open(os.devnull, 'w') as shut_up:
+            subprocess.check_output(cmd, stderr=shut_up)
+            return 0
+    except Exception:
+        if raise_error:
+            raise Exception(error_msg);
+        return 1
+
+def copy_files():
+    if os.path.isdir('compile'):
+        shutil.rmtree('compile')
+    src_list = ['demo', 'gtest', 'scripts', 'src']
+    for src in src_list:
+        dst = 'compile/{}'.format(src)
+        if os.path.isdir(dst):
+            shutil.rmtree(dst)
+        shutil.copytree('../{}'.format(src), dst)
+    shutil.copy('../CMakeLists.txt', 'compile')
+    # create empty python-package for cmake
+    os.makedirs('compile/python-package')
+    open('compile/python-package/CMakeLists.txt', 'w')
+
+def compile_cpp():
+    build_path = os.path.join(CURRENT_DIR, 'build_cpp')
+    if os.path.isdir(build_path):
+        shutil.rmtree(build_path)
+    os.makedirs(build_path)
+    old_working_dir = os.getcwd()
+    os.chdir(build_path)
+    src_path = '../compile'
+    cmake_cmd = ['cmake', src_path]
+    if not os.path.isdir(src_path):
+        print('current path: {}'.format(os.getcwd()))
+        raise Exception('{} not exists'.format(src_path))
+    if os.name == "nt":
+        # Windows
+        print('Windows users please use github installation.')
+    else:
+        # Linux, Darwin (OS X), etc.
+        silent_call(cmake_cmd, raise_error=True, error_msg='Please install CMake first')
+        silent_call(["make", "-j4"], raise_error=True, 
+                error_msg='An error has occurred while building xlearn library file')
+        suffix_list = ['dylib', 'so']
+        for suffix in suffix_list:
+            if os.path.isfile('lib/libxlearn_api.{}'.format(suffix)):
+                shutil.copy('lib/libxlearn_api.{}'.format(suffix), '../xlearn/')
+
+    os.chdir(old_working_dir)
+    
+class CustomInstall(install):
+    
+    def run(self):
+        compile_cpp();
+        install.run(self)
+
+class CustomSdist(sdist):
+    
+    def run(self):
+        copy_files()
+        sdist.run(self)
+
+if __name__ == "__main__":
+    setup(name='xlearn',
+          version="0.20.a1",
+          description="xLearn Python Package",
+          maintainer='Chao Ma',
+          maintainer_email='mctt90@gmail.com',
+          zip_safe=False,
+          cmdclass={
+              'install': CustomInstall,
+              'sdist': CustomSdist,
+          },
+          packages=find_packages(),
+          # this will use MANIFEST.in during install where we specify additional files,
+          # this is the golden line
+          include_package_data=True,
+          # move data to MANIFEST.in
+          license='Apache-2.0',
+          classifiers=['License :: OSI Approved :: Apache Software License'],
+          url='https://github.com/aksnzhy/xlearn')
diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 37e775d9..2e3554f6 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -23,14 +23,72 @@ This file is the implementation of CrossEntropyLoss class.
 
 #include<thread>
 #include<atomic>
-#include<unordered_map>
+#include<map>
 
 namespace xLearn {
 
+static void pred_thread(const DMatrix* data_matrix,
+                        std::map<index_t, real_t>& w,
+                        std::vector<real_t>* pred,
+                        DistScore* dist_score_func,
+                        bool is_norm,
+                        size_t start_idx,
+                        size_t end_idx) {
+  CHECK_GE(end_idx, start_idx);
+  for (size_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = data_matrix->row[i];
+    real_t norm = is_norm ? data_matrix->norm[i] : 1.0;
+    (*pred)[i] = dist_score_func->CalcScore(row, &w, norm);
+  }
+}
+
+void DistCrossEntropyLoss::Predict(const DMatrix* data_matrix,
+                                   Model& model,
+                                   std::vector<real_t>& pred) {
+  auto feature_ids = std::vector<ps::Key>();
+  size_t row_len = data_matrix->row_length;
+  auto gradient_pull = std::make_shared<std::vector<float>>();
+  std::map<index_t, real_t> weight_map;
+  for (index_t i = 0; i < row_len; ++i) {
+    SparseRow* row = data_matrix->row[i];
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t idx = iter->feat_id;
+      feature_ids.push_back(idx);
+      weight_map[idx] = 0.0;
+    }
+  }
+  std::sort(feature_ids.begin(), feature_ids.end());
+  feature_ids.erase(unique(feature_ids.begin(), feature_ids.end()),
+                    feature_ids.end());
+  gradient_pull->resize(feature_ids.size());
+  if (model.GetScoreFunction().compare("linear") == 0) {
+    kv_w_->Pull(feature_ids, &(*gradient_pull));
+  }
+  for (int i = 0; i < gradient_pull->size(); ++i) {
+    index_t idx = feature_ids[i];
+    real_t weight = (*gradient_pull)[i];
+    weight_map[idx] = weight;
+  }
+  for (int i = 0; i < threadNumber_; ++i) {
+    size_t start_idx = getStart(row_len, threadNumber_, i);
+    size_t end_idx = getEnd(row_len, threadNumber_, i);
+    pool_->enqueue(std::bind(pred_thread,
+          data_matrix,
+          std::ref(weight_map),
+          &pred,
+          dist_score_func_,
+          norm_,
+          start_idx,
+          end_idx));
+  }
+  pool_->Sync(threadNumber_);
+}
+
 // Calculate loss in one thread.
 static void ce_evalute_thread(const std::vector<real_t>* pred,
-                              const std::vector<real_t>* label,
-                              real_t* tmp_sum,
+    const std::vector<real_t>* label,
+    real_t* tmp_sum,
                               size_t start_idx,
                               size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
@@ -82,11 +140,11 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
-                               std::unordered_map<index_t, real_t>& w,
+                               std::map<index_t, real_t>& w,
                                DistScore* dist_score_func,
                                bool is_norm,
                                real_t* sum,
-                               std::unordered_map<index_t, real_t>& g,
+                               std::map<index_t, real_t>& g,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
@@ -114,9 +172,10 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   total_example_ += row_len;
   auto feature_ids = std::vector<ps::Key>();
   auto gradient_pull = std::make_shared<std::vector<float>>();
-  std::unordered_map<index_t, real_t> weight_map;
-  std::unordered_map<index_t, real_t> gradient_push_map;
+  std::map<index_t, real_t> weight_map;
+  std::map<index_t, real_t> gradient_push_map;
   auto gradient_push = std::make_shared<std::vector<float>>();
+
   for (index_t i = 0; i < row_len; ++i) {
     SparseRow* row = matrix->row[i];
     for (SparseRow::const_iterator iter = row->begin();
@@ -132,19 +191,18 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
 
   gradient_pull->resize(feature_ids.size());
   if (model.GetScoreFunction().compare("linear") == 0) {
-    kv_w_->Pull(feature_ids, &(*gradient_pull));
+    kv_w_->Wait(kv_w_->Pull(feature_ids, &(*gradient_pull)));
   }
   for (int i = 0; i < gradient_pull->size(); ++i) {
     index_t idx = feature_ids[i];
     real_t weight = (*gradient_pull)[i];
     weight_map[idx] = weight;
+    gradient_push_map[idx] = 0.0;
   }
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
-  std::cout << "cout = " << count << "\tlen = " << row_len << std::endl;
   std::vector<real_t> sum(count, 0);
   for (int i = 0; i < count; ++i) {
-    std::cout << "i ====== " << i << std::endl;
     index_t start_idx = getStart(row_len, count, i);
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
@@ -159,14 +217,14 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   }
   // Wait all of the threads finish their job
   pool_->Sync(count);
-  std::cout << "167======"<< std::endl;
+  gradient_push->resize(feature_ids.size());
   for (int i = 0; i < feature_ids.size(); ++i) {
     index_t idx = feature_ids[i];
     real_t g = gradient_push_map[idx];
-    gradient_push->push_back(g);
+    (*gradient_push)[i] = g;
   }
   if (model.GetScoreFunction().compare("linear") == 0) {
-    kv_w_->Push(feature_ids, (*gradient_push));
+    kv_w_->Wait(kv_w_->Push(feature_ids, *gradient_push));
   }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
index 7ce52ea5..2182db0c 100644
--- a/src/distributed/dist_cross_entropy_loss.h
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -38,6 +38,10 @@ class DistCrossEntropyLoss : public Loss {
   DistCrossEntropyLoss() { }
   ~DistCrossEntropyLoss() { }
 
+  void Predict(const DMatrix* data_matrix,
+      Model& model,
+      std::vector<real_t>& pred);
+
   // Given predictions and labels, accumulate cross-entropy loss.
   void Evalute(const std::vector<real_t>& pred,
                const std::vector<real_t>& label);
diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index 77ee7bfd..1bc0decc 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -26,7 +26,7 @@ namespace xLearn {
 
 // y = wTx (incluing bias term)
 real_t DistLinearScore::CalcScore(const SparseRow* row,
-                                  std::unordered_map<index_t, real_t>* w,
+                                  std::map<index_t, real_t>* w,
                                   real_t norm) {
   real_t score = 0.0;
   for (SparseRow::const_iterator iter = row->begin();
@@ -39,9 +39,9 @@ real_t DistLinearScore::CalcScore(const SparseRow* row,
 
 // Calculate gradient and update current model
 void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
-                           std::unordered_map<index_t, real_t>& w,
+                           std::map<index_t, real_t>& w,
                            real_t* sum,
-                           std::unordered_map<index_t, real_t>& g,
+                           std::map<index_t, real_t>& g,
                            index_t start_idx,
                            index_t end_idx) {
   // Using sgd
@@ -60,9 +60,9 @@ void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using sgd
 void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
-                                std::unordered_map<index_t, real_t>& w,
+                                std::map<index_t, real_t>& w,
                                 real_t* sum,
-                                std::unordered_map<index_t, real_t>& g,
+                                std::map<index_t, real_t>& g,
                                 real_t start_idx,
                                 real_t end_idx) {
   // linear term
@@ -84,9 +84,9 @@ void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
 
 // Calculate gradient and update current model using adagrad
 void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
-                                    std::unordered_map<index_t, real_t>& w,
+                                    std::map<index_t, real_t>& w,
                                     real_t* sum,
-                                    std::unordered_map<index_t, real_t>& g,
+                                    std::map<index_t, real_t>& g,
                                     real_t start_idx,
                                     real_t end_idx) {
   // linear term
@@ -108,16 +108,14 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using ftrl
 void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
-                                 std::unordered_map<index_t, real_t>& w,
+                                 std::map<index_t, real_t>& w,
                                  real_t* sum,
-                                 std::unordered_map<index_t, real_t>& g,
+                                 std::map<index_t, real_t>& g,
                                  real_t start_idx,
                                  real_t end_idx) {
-  //std::cout << "start_idx = " << start_idx << "\tend_idx = " << end_idx << std::endl;
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
     real_t pred = CalcScore(row, &w);
-    //if (i % 1000 == 0) std::cout << i << std::endl;
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -127,7 +125,6 @@ void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
       real_t gradient = pg * iter->feat_val; // get gradient
       g[idx_g] += gradient;
     }
-    //std::cout << "i*" << i << std::endl;
   }
 }
 
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index d35a2416..14e8ad10 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -41,40 +41,40 @@ class DistLinearScore : public DistScore {
   // Given one exmaple and current model, this method
   // returns the linear score wTx.
   real_t CalcScore(const SparseRow* row,
-                   std::unordered_map<index_t, real_t>* w,
+                   std::map<index_t, real_t>* w,
                    real_t norm = 1.0);
 
   void DistCalcGrad(const DMatrix* matrix,
-                     std::unordered_map<index_t, real_t>& w,
+                     std::map<index_t, real_t>& w,
                      real_t* sum,
-                     std::unordered_map<index_t, real_t>& g,
+                     std::map<index_t, real_t>& g,
                      index_t start_idx,
                      index_t end_idx);
 
  protected:
   // Calculate gradient and update model using sgd
   void calc_grad_sgd(const DMatrix* matrix,
-                     std::unordered_map<index_t, real_t>& w,
+                     std::map<index_t, real_t>& w,
                      real_t* sum,
-                     std::unordered_map<index_t, real_t>& g,
+                     std::map<index_t, real_t>& g,
                      real_t start_idx,
                      real_t end_idx
                     );
 
   // Calculate gradient and update model using adagrad
   void calc_grad_adagrad(const DMatrix* matrix,
-                         std::unordered_map<index_t, real_t>& w,
+                         std::map<index_t, real_t>& w,
                          real_t* sum,
-                         std::unordered_map<index_t, real_t>& g,
+                         std::map<index_t, real_t>& g,
                          real_t start_idx,
                          real_t end_idx
                         );
 
   // Calculate gradient and update model using ftrl
   void calc_grad_ftrl(const DMatrix* matrix,
-                      std::unordered_map<index_t, real_t>& w,
+                      std::map<index_t, real_t>& w,
                       real_t* sum,
-                      std::unordered_map<index_t, real_t>& g,
+                      std::map<index_t, real_t>& g,
                       real_t start_idx,
                       real_t end_idx
                      );
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index 6a2f5e1b..8c06e3fa 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -25,6 +25,7 @@ FM score, FFM score, and etc.
 
 #include <vector>
 #include <unordered_map>
+#include <map>
 
 #include "src/base/common.h"
 #include "src/base/class_register.h"
@@ -72,13 +73,13 @@ class DistScore {
   // Given one exmaple and current model, this method
   // returns the score
   virtual real_t CalcScore(const SparseRow* row,
-                           std::unordered_map<index_t, real_t>* w,
+                           std::map<index_t, real_t>* w,
                            real_t norm = 1.0) = 0;
 
   virtual void DistCalcGrad(const DMatrix* matrix,
-                               std::unordered_map<index_t, real_t>& w,
+                               std::map<index_t, real_t>& w,
                                real_t* sum,
-                               std::unordered_map<index_t, real_t>& g,
+                               std::map<index_t, real_t>& g,
                                index_t start_idx,
                                index_t end_idx) = 0;
 
diff --git a/src/distributed/server.h b/src/distributed/server.h
index 7dea8fc9..5426e421 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -115,7 +115,6 @@ struct KVServerFTRLHandle {
     size_t keys_size = req_data.keys.size();
     ps::KVPairs<float> res;
     if (req_meta.push) {
-      std::cout << keys_size * v_dim << "==" << req_data.vals.size() << std::endl;
       CHECK_EQ(keys_size * v_dim, req_data.vals.size());
     } else {
       res.keys = req_data.keys;
diff --git a/src/loss/loss.h b/src/loss/loss.h
index 61178943..81441db7 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -74,7 +74,8 @@ namespace xLearn {
 class Loss {
  public:
   // Constructor and Desstructor
-  Loss() : loss_sum_(0), total_example_ (0) { 
+  Loss() : loss_sum_(0), total_example_(0), 
+           score_func_(nullptr), dist_score_func_(nullptr) { 
     kv_w_ = new ps::KVWorker<float>(0);
     kv_v_ = new ps::KVWorker<float>(1);
   };
diff --git a/src/solver/trainer.cc b/src/solver/trainer.cc
index bf585293..92d000b6 100644
--- a/src/solver/trainer.cc
+++ b/src/solver/trainer.cc
@@ -179,7 +179,7 @@ void Trainer::train(std::vector<Reader*>& train_reader,
     // Calc grad and update model
     real_t tr_loss = calc_gradient(train_reader);
     // we don't do any evaluation in a quiet model
-    if (ps::MyRank() == 100) {
+    if (ps::MyRank() == 0) {
       if (!quiet_) {
         if (!test_reader.empty()) { 
           te_info = calc_metric(test_reader); 
@@ -217,7 +217,7 @@ void Trainer::train(std::vector<Reader*>& train_reader,
       } else {  // for cv
         metric_info_.push_back(te_info);
       }
-    }
+    }  // for ps::MyRank
   }
 }
 

From 322e31633b493e564421c05f22c884fb4e444b3d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 17:04:34 +0800
Subject: [PATCH 59/82] update: loss/metric.h

---
 src/loss/metric.h | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/src/loss/metric.h b/src/loss/metric.h
index 3d33b22e..f88edfde 100644
--- a/src/loss/metric.h
+++ b/src/loss/metric.h
@@ -545,11 +545,7 @@ class AUCMetric : public Metric {
     CHECK_EQ(positive_vec.size(), negative_vec.size());
     long long positive_sum = 0;
     long long negative_sum= 0;
-<<<<<<< HEAD
-    long long pre_positive_sum = 0;
-=======
     long long pre_positive_sum = 0.0;
->>>>>>> upstream/master
     long long positivesum_dot_negativesum = 0;
     double auc = 0.0;
     double auc_res = 0.0;

From 7efce6f14a70fa5c21a68d4c3fe81364998e7c35 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 17:51:33 +0800
Subject: [PATCH 60/82] update: xlearn/CMakeLists.txt

---
 CMakeLists.txt | 91 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 91 insertions(+)
 create mode 100644 CMakeLists.txt

diff --git a/CMakeLists.txt b/CMakeLists.txt
new file mode 100644
index 00000000..e69e9834
--- /dev/null
+++ b/CMakeLists.txt
@@ -0,0 +1,91 @@
+# Copyright (c) 2016 by contributors.
+# Authour: Chao Ma (mctt90@gmail.com)
+#
+# This is the root CMakeLists.txt file of the xLearn project, which
+# build all subdirectories (packages) in the order of
+# inter-package dependence.
+#
+# you can build the xLearn using the following commands:
+#
+# $> cd xLearn
+# $> mkdir build
+# $> cd build
+# $> cmake ..
+# $> make
+#
+# Thus you check out the xLearn project and build it in a
+# subdirectory ``build". If you want further to install the
+# built project, you can type the command:
+#
+# $> make install
+#
+project ("xLearn")
+
+cmake_minimum_required(VERSION 2.8)
+
+#-------------------------------------------------------------------------------
+# Take almost all warnings;
+# Do not generate debug symbols;
+# Optimization level 3;
+# Using c++11;
+# Optimization on architecture
+#-------------------------------------------------------------------------------
+#add_definitions("-Wall -Wno-sign-compare -O3 -std=c++11 -march=native 
+add_definitions("-Wall -Wno-sign-compare -std=c++11 -march=native 
+-Wno-strict-aliasing -Wno-comment")
+
+#-------------------------------------------------------------------------------
+# Declare where our project will be installed.
+#-------------------------------------------------------------------------------
+set(CMAKE_INSTALL_PREFIX "xLearn")
+
+#-------------------------------------------------------------------------------
+# For Mac OSX
+#-------------------------------------------------------------------------------
+set(CMAKE_MACOSX_RPATH TRUE)
+
+#-------------------------------------------------------------------------------
+# Ensure executables are statically linked with libraries.
+#-------------------------------------------------------------------------------
+if(NOT ${CMAKE_SYSTEM_NAME} MATCHES "Darwin")
+  set(CMAKE_EXE_LINKER_FLAGS "-static -static-libgcc")
+endif()
+
+#-------------------------------------------------------------------------------
+# Set include paths and library paths.
+#-------------------------------------------------------------------------------
+include_directories(
+  "${PROJECT_SOURCE_DIR}"
+  "${PROJECT_BINARY_DIR}"
+  "${PROJECT_SOURCE_DIR}/gtest/include"
+  "${PROJECT_SOURCE_DIR}/ps-lite/include"
+)
+
+link_directories(
+  "${PROJECT_BINARY_DIR}/src/base"
+  "${PROJECT_BINARY_DIR}/src/data"
+  "${PROJECT_BINARY_DIR}/src/reader"
+  "${PROJECT_BINARY_DIR}/src/score"
+  "${PROJECT_BINARY_DIR}/src/loss"
+  "${PROJECT_BINARY_DIR}/src/solver"
+  "${PROJECT_BINARY_DIR}/src/distributed"
+  "${PROJECT_BINARY_DIR}/src/c_api"
+  "${PROJECT_BINARY_DIR}/ps-lite"
+)
+
+#-------------------------------------------------------------------------------
+# Declare packages in xLearn project.
+#-------------------------------------------------------------------------------
+add_subdirectory(ps-lite)
+add_subdirectory(gtest)
+add_subdirectory(demo)
+add_subdirectory(src/base)
+add_subdirectory(src/data)
+add_subdirectory(src/reader)
+add_subdirectory(src/score)
+add_subdirectory(src/loss)
+add_subdirectory(src/solver)
+add_subdirectory(src/distributed)
+add_subdirectory(src/c_api)
+add_subdirectory(python-package)
+add_subdirectory(scripts)

From 0fa057e42c6069b7e96038e8edd60bf0f4b2f5e2 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 22:46:23 +0800
Subject: [PATCH 61/82] update: make local_run clean

---
 src/c_api/CMakeLists.txt |  8 ++---
 src/loss/CMakeLists.txt  |  4 +--
 src/loss/loss.cc         |  2 --
 src/loss/loss.h          | 28 +---------------
 src/solver/checker.cc    |  6 ++--
 src/solver/solver.cc     | 18 +++++------
 src/solver/solver.h      |  6 +---
 src/solver/train_main.cc | 30 ++++++-----------
 src/solver/trainer.cc    | 70 +++++++++++++++++++---------------------
 src/solver/trainer.h     |  1 -
 10 files changed, 62 insertions(+), 111 deletions(-)

diff --git a/src/c_api/CMakeLists.txt b/src/c_api/CMakeLists.txt
index 94ceabbe..fb3e1d59 100644
--- a/src/c_api/CMakeLists.txt
+++ b/src/c_api/CMakeLists.txt
@@ -4,7 +4,7 @@ set(CMAKE_LIBRARY_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 set(CMAKE_ARCHIVE_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/lib)
 
 # Build static library
-set(STA_DEPS solver reader loss score data base pslite protobuf zmq distributed)
+set(STA_DEPS solver reader loss score data base)
 add_library(xlearn_api STATIC c_api.cc c_api_error.cc)
 target_link_libraries(xlearn_api ${STA_DEPS})
 
@@ -18,12 +18,10 @@ add_library(xlearn_api_shared SHARED c_api.cc c_api_error.cc
 ../reader/parser.cc ../reader/file_splitor.cc ../reader/reader.cc 
 ../score/score_function.cc ../score/linear_score.cc ../score/fm_score.cc 
 ../score/ffm_score.cc 
-../distributed/dist_cross_entropy_loss.cc 
-../distributed/dist_score_function.cc ../distributed/dist_linear_score.cc 
 ../solver/checker.cc ../solver/trainer.cc 
 ../solver/inference.cc ../solver/solver.cc)
 
-target_link_libraries(xlearn_api_shared pslite zmq protobuf)
+target_link_libraries(xlearn_api_shared)
 
 # Set properties
 set_target_properties(xlearn_api_shared PROPERTIES OUTPUT_NAME "xlearn_api")
@@ -31,7 +29,7 @@ set_target_properties(xlearn_api_shared PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 set_target_properties(xlearn_api PROPERTIES CLEAN_DIRECT_OUTPUT 1)
 
 # Build unittests.
-set(LIBS xlearn_api solver reader loss score data base pthread gtest pslite protobuf zmq distributed_shared)
+set(LIBS xlearn_api solver reader loss score data base)
 
 add_executable(c_api_test c_api_test.cc)
 target_link_libraries(c_api_test gtest_main ${LIBS})
diff --git a/src/loss/CMakeLists.txt b/src/loss/CMakeLists.txt
index ce822050..17e4db90 100644
--- a/src/loss/CMakeLists.txt
+++ b/src/loss/CMakeLists.txt
@@ -2,13 +2,13 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
 
 # Build static library
-set(STA_DEPS score data base pslite protobuf zmq distributed)
+set(STA_DEPS score data base)
 add_library(loss STATIC loss.cc squared_loss.cc 
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss ${STA_DEPS})
 
 # Build shared library
-set(SHA_DEPS score_shared data_shared base_shared pslite protobuf zmq distributed)
+set(SHA_DEPS score_shared data_shared base_shared)
 add_library(loss_shared SHARED loss.cc squared_loss.cc
 cross_entropy_loss.cc metric.cc)
 target_link_libraries(loss_shared ${SHA_DEPS})
diff --git a/src/loss/loss.cc b/src/loss/loss.cc
index 28f5eb33..59c3e3b1 100644
--- a/src/loss/loss.cc
+++ b/src/loss/loss.cc
@@ -22,7 +22,6 @@ This file is the implementation of the base Loss class.
 #include "src/loss/loss.h"
 #include "src/loss/squared_loss.h"
 #include "src/loss/cross_entropy_loss.h"
-#include "src/distributed/dist_cross_entropy_loss.h"
 
 namespace xLearn {
 
@@ -32,7 +31,6 @@ namespace xLearn {
 CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_loss_registry, Loss);
 REGISTER_LOSS("squared", SquaredLoss);
 REGISTER_LOSS("cross-entropy", CrossEntropyLoss);
-REGISTER_LOSS("dist-cross-entropy", DistCrossEntropyLoss);
 
 // Predict in one thread
 void pred_thread(const DMatrix* matrix,
diff --git a/src/loss/loss.h b/src/loss/loss.h
index 81441db7..e4c8266f 100644
--- a/src/loss/loss.h
+++ b/src/loss/loss.h
@@ -32,9 +32,6 @@ function or objective function.
 #include "src/base/thread_pool.h"
 #include "src/data/model_parameters.h"
 #include "src/score/score_function.h"
-#include "src/distributed/dist_score_function.h"
-
-#include "ps/ps.h"
 
 namespace xLearn {
 
@@ -74,11 +71,7 @@ namespace xLearn {
 class Loss {
  public:
   // Constructor and Desstructor
-  Loss() : loss_sum_(0), total_example_(0), 
-           score_func_(nullptr), dist_score_func_(nullptr) { 
-    kv_w_ = new ps::KVWorker<float>(0);
-    kv_v_ = new ps::KVWorker<float>(1);
-  };
+  Loss() : loss_sum_(0), total_example_(0) { };
   virtual ~Loss() { }
 
   // This function needs to be invoked before using this class
@@ -96,19 +89,6 @@ class Loss {
     lock_free_ = lock_free;
   }
 
-  void DistInitialize(DistScore* score,
-                  ThreadPool* pool,
-                  bool norm = true,
-                  bool lock_free = false) {
-    CHECK_NOTNULL(score);
-    CHECK_NOTNULL(pool);
-    dist_score_func_ = score;
-    pool_ = pool;
-    norm_ = norm;
-    threadNumber_ = pool_->ThreadNumber();
-    lock_free_ = lock_free;
-  }
-
   // Given predictions and labels, accumulate loss value.
   virtual void Evalute(const std::vector<real_t>& pred,
                        const std::vector<real_t>& label) = 0;
@@ -142,7 +122,6 @@ class Loss {
   /* The score function, including LinearScore,
   FMScore, FFMScore, etc */
   Score* score_func_;
-  DistScore* dist_score_func_;
   /* Use instance-wise normalization */
   bool norm_;
   /* Open lock-free training ? */
@@ -155,11 +134,6 @@ class Loss {
   real_t loss_sum_;
   /* Used to store the number of example */
   index_t total_example_;
-  /* kv store for w */
-  ps::KVWorker<float>* kv_w_;
-  /* kv store for v */
-  ps::KVWorker<float>* kv_v_;
-
 
  private:
   DISALLOW_COPY_AND_ASSIGN(Loss);
diff --git a/src/solver/checker.cc b/src/solver/checker.cc
index 9313422a..3404a702 100644
--- a/src/solver/checker.cc
+++ b/src/solver/checker.cc
@@ -242,15 +242,15 @@ bool Checker::check_train_options(HyperParam& hyper_param) {
       } else {
         switch (value) {
           case 0:
-            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.loss_func = "cross-entropy";
             hyper_param.score_func = "linear";
             break;
           case 1:
-            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.loss_func = "cross-entropy";
             hyper_param.score_func = "fm";
             break;
           case 2:
-            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.loss_func = "cross-entropy";
             hyper_param.score_func = "ffm";
             break;
           case 3:
diff --git a/src/solver/solver.cc b/src/solver/solver.cc
index bd65bf28..167b36ed 100644
--- a/src/solver/solver.cc
+++ b/src/solver/solver.cc
@@ -80,11 +80,9 @@ Reader* Solver::create_reader() {
 }
 
 // Create Score by a given string
-DistScore* Solver::create_score() {
-  //Score* score;
-  DistScore* score;
-  //score = CREATE_SCORE(hyper_param_.score_func.c_str());
-  score = CREATE_DIST_SCORE("dist_linear");
+Score* Solver::create_score() {
+  Score* score;
+  score = CREATE_SCORE(hyper_param_.score_func.c_str());
   if (score == nullptr) {
     LOG(FATAL) << "Cannot create score: "
                << hyper_param_.score_func;
@@ -322,8 +320,8 @@ void Solver::init_train() {
   /*********************************************************
    *  Initialize score function                            *
    *********************************************************/
-  dist_score_ = create_score();
-  dist_score_->Initialize(hyper_param_.learning_rate,
+  score_ = create_score();
+  score_->Initialize(hyper_param_.learning_rate,
                      hyper_param_.regu_lambda,
                      hyper_param_.alpha,
                      hyper_param_.beta,
@@ -335,7 +333,7 @@ void Solver::init_train() {
    *  Initialize loss function                             *
    *********************************************************/
   loss_ = create_loss();
-  loss_->DistInitialize(dist_score_, pool_, 
+  loss_->Initialize(score_, pool_,
          hyper_param_.norm, 
          hyper_param_.lock_free);
   LOG(INFO) << "Initialize loss function.";
@@ -434,13 +432,13 @@ void Solver::init_predict() {
   /*********************************************************
    *  Init score function                                  *
    *********************************************************/
-  dist_score_ = create_score();
+  score_ = create_score();
   LOG(INFO) << "Initialize score function.";
   /*********************************************************
    *  Init loss function                                   *
    *********************************************************/
   loss_ = create_loss();
-  loss_->DistInitialize(dist_score_, pool_, hyper_param_.norm);
+  loss_->Initialize(score_, pool_, hyper_param_.norm);
   LOG(INFO) << "Initialize score function.";
 }
 
diff --git a/src/solver/solver.h b/src/solver/solver.h
index 42b3284b..d08cd461 100644
--- a/src/solver/solver.h
+++ b/src/solver/solver.h
@@ -33,7 +33,6 @@ of the xLearn.
 #include "src/reader/parser.h"
 #include "src/reader/file_splitor.h"
 #include "src/score/score_function.h"
-#include "src/distributed/dist_score_function.h"
 #include "src/loss/loss.h"
 #include "src/loss/metric.h"
 #include "src/solver/checker.h"
@@ -59,7 +58,6 @@ class Solver {
   // Constructor and Destructor
   Solver() 
     : score_(nullptr),
-      dist_score_(nullptr),
       loss_(nullptr),
       metric_(nullptr) { }
   ~Solver() { }
@@ -98,7 +96,6 @@ class Solver {
   xLearn::FileSpliter splitor_;
   /* linear, fm or ffm ? */
   xLearn::Score* score_;
-  xLearn::DistScore* dist_score_;
   /* cross-entropy or squared ? */
   xLearn::Loss* loss_;
   /* acc, prec, recall, mae, etc */
@@ -108,8 +105,7 @@ class Solver {
 
   // Create object by name
   xLearn::Reader* create_reader();
-  //xLearn::Score* create_score();
-  xLearn::DistScore* create_score();
+  xLearn::Score* create_score();
   xLearn::Loss* create_loss();
   xLearn::Metric* create_metric();
 
diff --git a/src/solver/train_main.cc b/src/solver/train_main.cc
index a190d301..90971271 100644
--- a/src/solver/train_main.cc
+++ b/src/solver/train_main.cc
@@ -24,32 +24,22 @@ This file is the entry for training of the xLearn.
 #include "src/base/timer.h"
 #include "src/base/stringprintf.h"
 #include "src/solver/solver.h"
-#include "src/distributed/server.h"
-#include "src/distributed/worker.h"
 
 //------------------------------------------------------------------------------
 // The pre-defined main function
 //------------------------------------------------------------------------------
 
 int main(int argc, char* argv[]) {
-  if (ps::IsServer()) {
-    xlearn::XLearnServer* server = new xlearn::XLearnServer();
-  }
-
-  ps::Start();
-  if (ps::IsWorker()) {
-    Timer timer;
-    timer.tic();
-    xLearn::Solver solver;
-    solver.SetTrain();
-    solver.Initialize(argc, argv);
-    solver.StartWork();
-    solver.Clear();
-    print_info(
-      StringPrintf("Total time cost: %.2f (sec)", 
-      timer.toc()), false);
-  }
-  ps::Finalize();
+  Timer timer;
+  timer.tic();
+  xLearn::Solver solver;
+  solver.SetTrain();
+  solver.Initialize(argc, argv);
+  solver.StartWork();
+  solver.Clear();
+  print_info(
+            StringPrintf("Total time cost: %.2f (sec)", 
+            timer.toc()), false);
 
   return 0;
 }
diff --git a/src/solver/trainer.cc b/src/solver/trainer.cc
index 92d000b6..eb85f2a4 100644
--- a/src/solver/trainer.cc
+++ b/src/solver/trainer.cc
@@ -179,45 +179,43 @@ void Trainer::train(std::vector<Reader*>& train_reader,
     // Calc grad and update model
     real_t tr_loss = calc_gradient(train_reader);
     // we don't do any evaluation in a quiet model
-    if (ps::MyRank() == 0) {
-      if (!quiet_) {
-        if (!test_reader.empty()) { 
-          te_info = calc_metric(test_reader); 
+    if (!quiet_) {
+      if (!test_reader.empty()) { 
+        te_info = calc_metric(test_reader); 
+      }
+      // show evaludation metric info
+      show_train_info(tr_loss, 
+          te_info.loss_val,
+          te_info.metric_val,
+          timer.toc(), 
+          !test_reader.empty(), 
+          n);
+      // Early-stopping
+      if (early_stop_) {
+        if (te_info.loss_val < best_loss) {
+          best_loss = te_info.loss_val;
+          best_epoch = n;
+          model_->SetBestModel();
         }
-        // show evaludation metric info
-        show_train_info(tr_loss, 
-            te_info.loss_val,
-            te_info.metric_val,
-            timer.toc(), 
-            !test_reader.empty(), 
-            n);
-        // Early-stopping
-        if (early_stop_) {
-          if (te_info.loss_val < best_loss) {
-            best_loss = te_info.loss_val;
-            best_epoch = n;
-            model_->SetBestModel();
-          }
-          if (te_info.loss_val >= prev_loss) {
-            stop_window++;
-            // If the validation loss goes up conntinuously
-            // in 3 epoch, we stop training
-            if (stop_window == kStopWindow) { break; }
-          } else {
-            stop_window = 0;
-          }
-          prev_loss = te_info.loss_val;
+        if (te_info.loss_val >= prev_loss) {
+          stop_window++;
+          // If the validation loss goes up conntinuously
+          // in 3 epoch, we stop training
+          if (stop_window == kStopWindow) { break; }
+        } else {
+          stop_window = 0;
         }
+        prev_loss = te_info.loss_val;
       }
-      if (early_stop_ && best_epoch != epoch_) {  // not for cv
-        print_action(
-            StringPrintf("Early-stopping at epoch %d", best_epoch)
-            );
-        model_->Shrink();
-      } else {  // for cv
-        metric_info_.push_back(te_info);
-      }
-    }  // for ps::MyRank
+    }
+    if (early_stop_ && best_epoch != epoch_) {  // not for cv
+      print_action(
+          StringPrintf("Early-stopping at epoch %d", best_epoch)
+          );
+      model_->Shrink();
+    } else {  // for cv
+      metric_info_.push_back(te_info);
+    }
   }
 }
 
diff --git a/src/solver/trainer.h b/src/solver/trainer.h
index fb8bce34..51bc20c1 100644
--- a/src/solver/trainer.h
+++ b/src/solver/trainer.h
@@ -31,7 +31,6 @@ This file defines the Trainer class.
 #include "src/data/model_parameters.h"
 #include "src/loss/loss.h"
 #include "src/loss/metric.h"
-#include "ps/ps.h"
 
 namespace xLearn {
 

From e8f9acc1dc5926eb4972c1a723798a863827336b Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 23:06:19 +0800
Subject: [PATCH 62/82] update: src/distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt            | 13 ++++++++-----
 src/distributed/dist_cross_entropy_loss.h |  4 ++--
 2 files changed, 10 insertions(+), 7 deletions(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index eab7b00d..aded038d 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,9 +1,12 @@
-set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/loss)
+set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/distributed)
 
-set(STA_DEPS data base loss)
-add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc)
+set(STA_DEPS data base pslite protobuf zmq)
+add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
 target_link_libraries(distributed ${STA_DEPS})
 
-set(SHA_DEPS data_shared base_shared loss_shared)
-add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc)
+set(SHA_DEPS data_shared base_shared pslite protobuf zmq)
+add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
 target_link_libraries(distributed_shared ${SHA_DEPS})
+
+add_executable(dist_xlearn_train dist_train_main.cc dist_solver.cc dist_trainer.cc dist_inference.cc)
+target_link_libraries(dist_xlearn_train solver distributed)
diff --git a/src/distributed/dist_cross_entropy_loss.h b/src/distributed/dist_cross_entropy_loss.h
index 2182db0c..254d4797 100644
--- a/src/distributed/dist_cross_entropy_loss.h
+++ b/src/distributed/dist_cross_entropy_loss.h
@@ -23,7 +23,7 @@ This file defines the CrossEntropyLoss class.
 #define XLEARN_LOSS_DIST_CROSS_ENTROPY_LOSS_H_
 
 #include "src/base/common.h"
-#include "src/loss/loss.h"
+#include "src/distributed/dist_loss.h"
 
 namespace xLearn {
 
@@ -32,7 +32,7 @@ namespace xLearn {
 // has the following form:
 // loss = sum_all_example(log(1.0+exp(-y*pred)))
 //------------------------------------------------------------------------------
-class DistCrossEntropyLoss : public Loss {
+class DistCrossEntropyLoss : public DistLoss {
  public:
   // Constructor and Desstructor
   DistCrossEntropyLoss() { }

From 5546e9e7a91d9fd94014a6a73b987bc72f480d03 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 23:06:50 +0800
Subject: [PATCH 63/82] add: local run script and dist run  script

---
 scripts/local.sh                   | 37 ++++++++++++++++++++++++++++++
 scripts/run_xlearn_dist_train.sh   |  8 +++++++
 scripts/run_xlearn_local_train.sh  | 13 +++++++++++
 scripts/stop_xlearn_dist_train.sh  | 10 ++++++++
 scripts/stop_xlearn_local_train.sh | 10 ++++++++
 5 files changed, 78 insertions(+)
 create mode 100755 scripts/local.sh
 create mode 100644 scripts/run_xlearn_dist_train.sh
 create mode 100644 scripts/run_xlearn_local_train.sh
 create mode 100644 scripts/stop_xlearn_dist_train.sh
 create mode 100644 scripts/stop_xlearn_local_train.sh

diff --git a/scripts/local.sh b/scripts/local.sh
new file mode 100755
index 00000000..089b1747
--- /dev/null
+++ b/scripts/local.sh
@@ -0,0 +1,37 @@
+#!/bin/bash
+# set -x
+if [ $# -lt 3 ]; then
+    echo "usage: $0 num_servers num_workers bin [args..]"
+    exit -1;
+fi
+
+export DMLC_NUM_SERVER=$1
+shift
+export DMLC_NUM_WORKER=$1
+shift
+bin=$1
+shift
+arg="$@"
+
+# start the scheduler
+export DMLC_PS_ROOT_URI='127.0.0.1'
+export DMLC_PS_ROOT_PORT=8000
+export DMLC_ROLE='scheduler'
+${bin} ${arg} &
+
+
+# start servers
+export DMLC_ROLE='server'
+for ((i=0; i<${DMLC_NUM_SERVER}; ++i)); do
+    export HEAPPROFILE=./S${i}
+    ${bin} ${arg} &
+done
+
+# start workers
+export DMLC_ROLE='worker'
+for ((i=0; i<${DMLC_NUM_WORKER}; ++i)); do
+    export HEAPPROFILE=./W${i}
+    ${bin} ${arg} &
+done
+
+wait
diff --git a/scripts/run_xlearn_dist_train.sh b/scripts/run_xlearn_dist_train.sh
new file mode 100644
index 00000000..947dce1a
--- /dev/null
+++ b/scripts/run_xlearn_dist_train.sh
@@ -0,0 +1,8 @@
+#! /bin/sh
+
+echo "=====================================BigDataLR================================="
+sh local.sh 1 3 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/test/distributed/dist_xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#echo "=====================================BigDataFM================================="
+#sh local.sh 1 1 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 1 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#echo "=====================================BigDataFFM==============================="
+#sh local.sh 1 1 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 2 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
diff --git a/scripts/run_xlearn_local_train.sh b/scripts/run_xlearn_local_train.sh
new file mode 100644
index 00000000..d503cfbe
--- /dev/null
+++ b/scripts/run_xlearn_local_train.sh
@@ -0,0 +1,13 @@
+#echo "====================================SmallData LR==================================="
+#/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_train.txt -v /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_test.txt -s 0 -x auc --dis-es
+#echo "====================================SmallData FM==================================="
+#/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_train.txt -v /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_test.txt -s 1 -x auc --dis-es
+#echo "====================================SmallData FFM=================================="
+#/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_train.txt -v /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/demo/classification/criteo_ctr/small_test.txt -s 2 -x auc --dis-es
+
+echo "=====================================BigDataLR================================="
+/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#echo "=====================================BigDataFM================================="
+/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 1 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#echo "=====================================BigDataFFM==============================="
+/Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 2 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
diff --git a/scripts/stop_xlearn_dist_train.sh b/scripts/stop_xlearn_dist_train.sh
new file mode 100644
index 00000000..9b18ad11
--- /dev/null
+++ b/scripts/stop_xlearn_dist_train.sh
@@ -0,0 +1,10 @@
+#! /bin/sh
+#
+# stop_xlearn.sh
+# Copyright (C) 2017 wangxiaoshu <2012wxs@gmail.com>
+#
+# Distributed under terms of the MIT license.
+#
+
+
+ps -ef | grep xlearn_dist_train | awk '{ print $2 }' | sudo xargs kill -9
diff --git a/scripts/stop_xlearn_local_train.sh b/scripts/stop_xlearn_local_train.sh
new file mode 100644
index 00000000..ad2e6e43
--- /dev/null
+++ b/scripts/stop_xlearn_local_train.sh
@@ -0,0 +1,10 @@
+#! /bin/sh
+#
+# stop_xlearn.sh
+# Copyright (C) 2017 wangxiaoshu <2012wxs@gmail.com>
+#
+# Distributed under terms of the MIT license.
+#
+
+
+ps -ef | grep xlearn_train | awk '{ print $2 }' | sudo xargs kill -9

From ffdb6aeda215c54b18bcdcafc791c2a508ebf24e Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sat, 23 Dec 2017 23:07:26 +0800
Subject: [PATCH 64/82] add: for dist version

---
 src/distributed/dist_checker.cc    | 789 +++++++++++++++++++++++++++++
 src/distributed/dist_checker.h     |  80 +++
 src/distributed/dist_inference.cc  |  82 +++
 src/distributed/dist_inference.h   |  90 ++++
 src/distributed/dist_loss.cc       |  78 +++
 src/distributed/dist_loss.h        | 170 +++++++
 src/distributed/dist_solver.cc     | 563 ++++++++++++++++++++
 src/distributed/dist_solver.h      | 134 +++++
 src/distributed/dist_train_main.cc |  55 ++
 src/distributed/dist_trainer.cc    | 274 ++++++++++
 src/distributed/dist_trainer.h     | 139 +++++
 11 files changed, 2454 insertions(+)
 create mode 100644 src/distributed/dist_checker.cc
 create mode 100644 src/distributed/dist_checker.h
 create mode 100644 src/distributed/dist_inference.cc
 create mode 100644 src/distributed/dist_inference.h
 create mode 100644 src/distributed/dist_loss.cc
 create mode 100644 src/distributed/dist_loss.h
 create mode 100644 src/distributed/dist_solver.cc
 create mode 100644 src/distributed/dist_solver.h
 create mode 100644 src/distributed/dist_train_main.cc
 create mode 100644 src/distributed/dist_trainer.cc
 create mode 100644 src/distributed/dist_trainer.h

diff --git a/src/distributed/dist_checker.cc b/src/distributed/dist_checker.cc
new file mode 100644
index 00000000..8156eba3
--- /dev/null
+++ b/src/distributed/dist_checker.cc
@@ -0,0 +1,789 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the Checker class.
+*/
+
+#include <string>
+#include <cstdlib>
+#include <algorithm>
+#include <cstdio>
+
+#include "src/base/common.h"
+#include "src/base/format_print.h"
+#include "src/distributed/dist_checker.h"
+#include "src/base/levenshtein_distance.h"
+#include "src/base/file_util.h"
+
+namespace xLearn {
+
+// Option help menu
+std::string DistChecker::option_help() const {
+  if (is_train_) {
+    return std::string(
+"----------------------------------------  Training task  -------------------------------------\n"
+"USAGE: \n"
+"     xlearn_train <train_file_path> [OPTIONS] \n"
+"                                                    \n"
+" e.g.,  xlearn_train train_data.txt -s 0 -v validate_data.txt -r 0.1 \n"
+"                                                                      \n"
+"OPTIONS: \n"
+"  -s <type> : Type of machine learning model (default 0) \n"
+"     for classification task: \n"
+"         0 -- linear model (GLM) \n"
+"         1 -- factorization machines (FM) \n"
+"         2 -- field-aware factorization machines (FFM) \n"
+"     for regression task: \n"
+"         3 -- linear model (GLM) \n"
+"         4 -- factorization machines (FM) \n"
+"         5 -- field-aware factorization machines (FFM) \n"
+"                                                                            \n"
+"  -x <metric>          :  The metric can be 'acc', 'prec', 'recall', 'f1', 'auc' (classification), and \n"
+"                          'mae', 'mape', 'rmsd (rmse)' (regression). On defaurt, xLearn will not print \n"
+"                          any evaluation metric information.                                            \n"
+"                                                                                                      \n"
+"  -p <opt_method>      :  Choose the optimization method, including 'sgd', adagrad' and 'ftrl'. On default, \n"
+"                          we use the adagrad optimization. \n"
+"                                                                                                 \n"
+"  -v <validate_file>   :  Path of the validation data file. This option will be empty by default, \n"
+"                          and in this way, the xLearn will not perform validation. \n"
+"                                                                                              \n"
+"  -m <model_file>      :  Path of the model checkpoint file. On default, the model file name will be. \n"
+"                          set to 'train_file' + '.model'. If we set this value to 'none', the xLearn will \n"
+"                          not dump the model checkpoint after training. \n"
+"  -t <txt_model_file>  :  Path of the txt model checkpoint file. On default, this option is empty \n"
+"                          and xLearn will not dump the txt model. For now, only the bias and linear term \n"
+"                          will dump to the txt model checkpoint file. \n"
+"                                                                             \n"
+"  -l <log_file>        :  Path of the log file. Using '/tmp/xlearn_log/' by default. \n"
+"                                                                                       \n"
+"  -k <number_of_K>     :  Number of the latent factor used by fm and ffm tasks. Using 4 by default. \n"
+"                          Note that, we will get the same model size when setting k to 1 and 4. \n"
+"                          This is because we use SSE instruction and the memory need to be aligned. \n"
+"                          So even you assign k = 1, we still fill some dummy zeros from k = 2 to 4. \n"
+"                                                                                         \n"
+"  -r <learning_rate>   :  Learning rate for stochastic gradient descent. Using 0.2 by default. \n"
+"                          xLearn uses adaptive gradient descent (AdaGrad) for optimization problem, \n"
+"                          and the learning rate will be changed adaptively. \n"
+"                                                                                     \n"
+"  -b <lambda_for_regu> :  Lambda for L2 regular. Using 0.00002 by default. We can disable the \n"
+"                          regular term by setting this value to 0.0 \n"
+"                                                                      \n"
+"  -u <model_scale>     :  Hyper parameter used for initialize model parameters. \n"
+"                          Using 0.66 by default. \n"
+"                                                                                  \n"
+"  -e <epoch_number>    :  Number of epoch for training. Using 10 by default. Note that, xLearn will \n"
+"                          perform early-stopping by default, so this value is just a upper bound. \n"
+"                                                                                       \n"
+"  -f <fold_number>     :  Number of folds for cross-validation. Using 5 by default.      \n"
+"                                                                                         \n"
+"  -nthread <thread number> :  Number of thread for multi-thread training                 \n"
+"                                                                                      \n"
+"  --disk               :  Open on-disk training for large-scale machine learning problems. \n"
+"                                                                    \n"
+"  --cv                 :  Open cross-validation in training tasks. If we use this option, xLearn \n"
+"                          will ignore the validation file (-t).  \n"
+"                                                                   \n"
+"  --dis-lock-free      :  Disable lock-free training. Lock-free training can accelerate training but \n"
+"                          the result is non-deterministic. Our suggestion is that you can open this flag \n"
+"                          if the training data is big and sparse. \n"
+"                                                                        \n"
+"  --dis-es             :  Disable early-stopping in training. By default, xLearn will use early-stopping \n"
+"                          in training tasks, except for training in cross-validation. \n"
+"                                                                                          \n"
+"  --no-norm            :  Disable instance-wise normalization. By default, xLearn will use \n"
+"                          instance-wise normalization for both training and prediction. \n"
+"                                                                  \n"
+"  --quiet              :  Don't print any evaluation information during the training and \n"
+"                          just train the model quietly. \n"
+"  -alpha               :  Used by ftrl. \n"
+"                                        \n"
+"  -beta                :  Used by ftrl. \n"
+"                                        \n"
+"  -lambda_1            :  Used by ftrl. \n"
+"                                        \n"
+"  -lambda_2            :  Used by ftrl. \n"
+"----------------------------------------------------------------------------------------------\n"
+    );
+  } else {
+    return std::string(
+"-------------------------------------- Prediction task ---------------------------------------\n"
+"USAGE: \n"
+"     xlearn_predict <test_file> <model_file> [OPTIONS] \n"
+"                                                         \n"
+" e.g.,  xlearn_predict ./test_data.txt ./model_file -o ./out.txt  \n"
+"                                                                           \n"
+"OPTIONS: \n"
+"  -o <output_file>     :  Path of the output file. On default, this value will be set \n"
+"                          to 'test_file' + '.out'                    \n"
+"                                                                         \n"
+"  -nthread <thread number> :  Number of thread for multi-thread learning. \n"
+"                                                                             \n"
+"  -l <log_file_path>   :  Path of the log file. Using '/tmp/xlearn_log' by default. \n"
+"----------------------------------------------------------------------------------------------\n"
+    );
+  }
+}
+
+// Initialize Checker
+void DistChecker::Initialize(bool is_train, int argc, char* argv[]) {
+  is_train_ = is_train;
+  if (is_train_) {  // for training
+    menu_.push_back(std::string("-s"));
+    menu_.push_back(std::string("-x"));
+    menu_.push_back(std::string("-v"));
+    menu_.push_back(std::string("-p"));
+    menu_.push_back(std::string("-m"));
+    menu_.push_back(std::string("-t"));
+    menu_.push_back(std::string("-l"));
+    menu_.push_back(std::string("-k"));
+    menu_.push_back(std::string("-r"));
+    menu_.push_back(std::string("-b"));
+    menu_.push_back(std::string("-u"));
+    menu_.push_back(std::string("-e"));
+    menu_.push_back(std::string("-f"));
+    menu_.push_back(std::string("-nthread"));
+    menu_.push_back(std::string("--disk"));
+    menu_.push_back(std::string("--cv"));
+    menu_.push_back(std::string("--dis-es"));
+    menu_.push_back(std::string("--no-norm"));
+    menu_.push_back(std::string("--quiet"));
+    menu_.push_back(std::string("-alpha"));
+    menu_.push_back(std::string("-beta"));
+    menu_.push_back(std::string("-lambda_1"));
+    menu_.push_back(std::string("-lambda_2"));
+  } else {  // for Prediction
+    menu_.push_back(std::string("-o"));
+    menu_.push_back(std::string("-l"));
+    menu_.push_back(std::string("-nthread"));
+    menu_.push_back(std::string("--sign"));
+    menu_.push_back(std::string("--sigmoid"));
+  }
+  // Get the user's input
+  for (int i = 0; i < argc; ++i) {
+    args_.push_back(std::string(argv[i]));
+  }
+}
+
+// Check and parse user's input
+bool DistChecker::check_cmd(HyperParam& hyper_param) {
+  // Do not have any args
+  if (args_.size() == 1) {
+    printf("%s\n", option_help().c_str());
+    exit(0);
+  }
+  // Parse and check argument
+  if (is_train_) {
+    return check_train_options(hyper_param);
+  } else {
+    return check_prediction_options(hyper_param);
+  }
+}
+
+// Check hyper-param. Used by c_api
+bool DistChecker::check_param(HyperParam& hyper_param) {
+  if (hyper_param.is_train) {
+    return check_train_param(hyper_param);
+  } else {
+    return check_prediction_param(hyper_param);
+  }
+}
+
+// Check options for training tasks
+bool DistChecker::check_train_options(HyperParam& hyper_param) {
+  bool bo = true;
+  /*********************************************************
+   *  Check the file path of the training data             *
+   *********************************************************/
+  if (FileExist(args_[1].c_str())) {
+    hyper_param.train_set_file = std::string(args_[1]);
+  } else {
+    print_error(
+      StringPrintf("Training data file: %s does not exist.", 
+                    args_[1].c_str())
+    );
+    return false;
+  }
+  /*********************************************************
+   *  Check each input argument                            *
+   *********************************************************/
+  StringList list(args_.begin()+2, args_.end());
+  StrSimilar ss;
+  for (int i = 0; i < list.size(); ) {
+    if (list[i].compare("-s") == 0) {  // task type
+      int value = atoi(list[i+1].c_str());
+      if (value < 0 || value > 5) {
+        print_error(
+            "-s can only be [0 - 5] : \n"
+            "  for classification task: \n"
+            "    0 -- linear model (GLM) \n"
+            "    1 -- factorization machines (FM) \n"
+            "    2 -- field-aware factorization machines (FFM) \n"
+            "  for regression task: \n"
+            "    3 -- linear model (GLM) \n"
+            "    4 -- factorization machines (FM) \n"
+            "    5 -- field-aware factorization machines (FFM)");
+        bo = false;
+      } else {
+        switch (value) {
+          case 0:
+            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.score_func = "linear";
+            break;
+          case 1:
+            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.score_func = "fm";
+            break;
+          case 2:
+            hyper_param.loss_func = "dist-cross-entropy";
+            hyper_param.score_func = "ffm";
+            break;
+          case 3:
+            hyper_param.loss_func = "squared";
+            hyper_param.score_func = "linear";
+            break;
+          case 4:
+            hyper_param.loss_func = "squared";
+            hyper_param.score_func = "fm";
+            break;
+          case 5:
+            hyper_param.loss_func = "squared";
+            hyper_param.score_func = "ffm";
+            break;
+          default: break;
+        }
+      }
+      i += 2;
+    } else if (list[i].compare("-x") == 0) {  // metrics
+      if (list[i+1].compare("acc") != 0 &&
+          list[i+1].compare("prec") != 0 &&
+          list[i+1].compare("recall") != 0 &&
+          list[i+1].compare("f1") != 0 &&
+          list[i+1].compare("auc") != 0 &&
+          list[i+1].compare("mae") != 0 &&
+          list[i+1].compare("mape") != 0 &&
+          list[i+1].compare("rmsd") != 0 &&
+          list[i+1].compare("rmse") != 0 &&
+          list[i+1].compare("none") != 0) {
+        print_error(
+          StringPrintf("Unknow metric: %s \n"
+               " -x can only be: \n"
+               "   acc \n"
+               "   prec \n" 
+               "   recall \n"
+               "   f1 \n"
+               "   auc\n"
+               "   mae \n"
+               "   mape \n"
+               "   rmsd \n"
+               "   rmse \n"
+               "   none",
+               list[i+1].c_str())
+        );
+        bo = false;
+      } else {
+        hyper_param.metric = list[i+1];
+      }
+      i += 2;
+    } else if (list[i].compare("-p") == 0) {  // optimization method
+      if (list[i+1].compare("adagrad") != 0 &&
+          list[i+1].compare("ftrl") != 0 &&
+          list[i+1].compare("sgd") != 0) {
+        print_error(
+          StringPrintf("Unknow optimization method: %s \n"
+               " -o can only be: adagrad and ftrl. \n",
+               list[i+1].c_str())
+        );
+        bo = false;
+      } else {
+        hyper_param.opt_type = list[i+1];
+      }
+      i += 2;
+    } else if (list[i].compare("-v") == 0) {  // validation file
+      if (FileExist(list[i+1].c_str())) {
+        hyper_param.validate_set_file = list[i+1];
+      } else {
+        print_error(
+          StringPrintf("Validation set file: %s dose not exists.",
+                       list[i+1].c_str())
+        );
+        bo = false;
+      }
+      i += 2;
+    } else if (list[i].compare("-m") == 0) {  // model file
+      hyper_param.model_file = list[i+1];
+      i += 2;
+    } else if (list[i].compare("-t") == 0) { // txt model file
+      hyper_param.txt_model_file = list[i+1];
+      i += 2;
+    } else if (list[i].compare("-l") == 0) {  // log file
+      hyper_param.log_file = list[i+1];
+      i += 2;
+    } else if (list[i].compare("-k") == 0) {  // latent factor
+      int value = atoi(list[i+1].c_str());
+      if (value <= 0) {
+        print_error(
+          StringPrintf("Illegal -k '%i'. -k must be geater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.num_K = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-r") == 0) {  // learning rate
+      real_t value = atof(list[i+1].c_str());
+      if (value <= 0) {
+        print_error(
+          StringPrintf("Illegal -r : '%f'. -r must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.learning_rate = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-b") == 0) {  // regular lambda
+      real_t value = atof(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -b : '%f' "
+               "-b must be greater than or equal to zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.regu_lambda = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-u") == 0) {  // model scale
+      real_t value = atof(list[i+1].c_str());
+      if (value <= 0) {
+        print_error(
+          StringPrintf("Illegal -u : '%f'. -u must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.model_scale = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-e") == 0) {  // number of epoch
+      int value = atoi(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -e : '%i'. -e must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.num_epoch = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-f") == 0) {  // number of folds
+      int value = atoi(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -f : '%i'. -f must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.num_folds = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-nthread") == 0) {  // number of thread
+      int value = atoi(list[i+1].c_str());
+      if (value <= 0) {
+        print_error(
+          StringPrintf("Illegal -nthread : '%i'. -nthread must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.thread_number = value;
+      }
+      i += 2;
+    } else if (list[i].compare("--disk") == 0) {  // on-disk training
+      hyper_param.on_disk = true;
+      i += 1;
+    } else if (list[i].compare("--cv") == 0) {  // cross-validation
+      hyper_param.cross_validation = true;
+      i += 1;
+    } else if (list[i].compare("--dis-lock-free") == 0) {  // lock-free training
+      hyper_param.lock_free = false;
+      i += 1;
+    } else if (list[i].compare("--dis-es") == 0) {  // disable early-stop
+      hyper_param.early_stop = false;
+      i += 1;
+    } else if (list[i].compare("--no-norm") == 0) {  // normalization
+      hyper_param.norm = false;
+      i += 1;
+    } else if (list[i].compare("--quiet") == 0) {  // quiet
+      hyper_param.quiet = true;
+      i += 1;
+    } else if (list[i].compare("-alpha") == 0) {  // alpha
+      real_t value = atof(list[i+1].c_str());
+      if (value <= 0) {
+        print_error(
+          StringPrintf("Illegal -alpha : '%f'. "
+                       "-alpha must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.alpha = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-beta") == 0) {  // beta
+      real_t value = atof(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -beta : '%f'. "
+                       "-beta cannot be less than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.beta = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-lambda_1") == 0) {  // lambda_1
+      real_t value = atof(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -lambda_1 : '%f'. "
+                       "-lambda_1 cannot be less than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.lambda_1 = value;
+      }
+      i += 2;
+    } else if (list[i].compare("-lambda_2") == 0) { // lambda_2
+      real_t value = atof(list[i+1].c_str());
+      if (value < 0) {
+        print_error(
+          StringPrintf("Illegal -lambda_2 : '%f'. "
+                       "-lambda_2 cannot be less than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.lambda_2 = value;
+      }
+      i += 2;
+    } else {  // no match
+      std::string similar_str;
+      ss.FindSimilar(list[i], menu_, similar_str);
+      print_error(
+        StringPrintf("Unknow argument '%s'. Do you mean '%s' ?",
+             list[i].c_str(),
+             similar_str.c_str())
+      );
+      bo = false;
+      break;
+    }
+  }
+  if (!bo) { return false; }
+  /*********************************************************
+   *  Check warning and fix conflict                       *
+   *********************************************************/
+  check_conflict_train(hyper_param);
+  /*********************************************************
+   *  Set default value                                    *
+   *********************************************************/
+  if (hyper_param.model_file.empty() && !hyper_param.cross_validation) {
+    hyper_param.model_file = hyper_param.train_set_file + ".model";
+  }
+  if (hyper_param.metric.compare("rmse") == 0) {
+    hyper_param.metric = "rmsd";
+  }
+
+  return true;
+}
+
+// Check the given hyper-param. Used by c_api
+bool DistChecker::check_train_param(HyperParam& hyper_param) {
+  bool bo = true;
+  /*********************************************************
+   *  Check file path                                      *
+   *********************************************************/
+  if (!FileExist(hyper_param.train_set_file.c_str())) {
+    print_error(
+      StringPrintf("Training data file: %s does not exist.", 
+                    hyper_param.train_set_file.c_str())
+    );
+    bo = false;
+  }
+  if (!hyper_param.validate_set_file.empty() &&
+      !FileExist(hyper_param.validate_set_file.c_str())) {
+    print_error(
+      StringPrintf("Validation data file: %s does not exist.", 
+                    hyper_param.validate_set_file.c_str())
+    );
+    bo = false;
+  }
+  /*********************************************************
+   *  Check invalid value                                  *
+   *********************************************************/
+  if (hyper_param.thread_number < 0) {
+    print_error(
+      StringPrintf("The thread number must be greater than zero.")
+    );
+    bo = false;
+  }
+  if (hyper_param.loss_func.compare("unknow") == 0) {
+    print_error(
+      StringPrintf("The task can only be 'binary' or 'reg'.")
+    );
+    bo = false;
+  }
+  if (!bo) return false;
+  /*********************************************************
+   *  Check warning and fix conflict                       *
+   *********************************************************/
+  check_conflict_train(hyper_param);
+  /*********************************************************
+   *  Set default value                                    *
+   *********************************************************/
+  if (hyper_param.model_file.empty() && !hyper_param.cross_validation) {
+    hyper_param.model_file = hyper_param.train_set_file + ".model";
+  }
+  if (hyper_param.metric.compare("rmse") == 0) {
+    hyper_param.metric = "rmsd";
+  }
+
+  return true;
+}
+
+// Check warning and fix conflict
+void DistChecker::check_conflict_train(HyperParam& hyper_param) {
+  if (hyper_param.on_disk && hyper_param.cross_validation) {
+    print_warning("On-disk training doesn't support cross-validation. "
+                  "xLearn has already disable the -cv option.");
+    hyper_param.cross_validation = false;
+  }
+  if (hyper_param.cross_validation && hyper_param.early_stop) {
+    print_warning("Cross-validation doesn't support early-stopping. "
+                  "xLearn has already close early-stopping.");
+    hyper_param.early_stop = false;
+  }
+  if (hyper_param.cross_validation && !hyper_param.test_set_file.empty()) {
+    print_warning(
+      StringPrintf("The --cv (cross-validation) has been set, and "
+                   "xLearn will ignore the validation file: %s",
+                   hyper_param.test_set_file.c_str())
+    );
+    hyper_param.validate_set_file.clear();
+  }
+  if (hyper_param.cross_validation && hyper_param.quiet) {
+    print_warning("The --cv (cross-validation) has been set, and "
+                  "xLearn will ignore the --quiet option.");
+    hyper_param.quiet = false;
+  }
+  if (hyper_param.cross_validation && !hyper_param.model_file.empty()) {
+    print_warning("The --cv (cross-validation) has been set, and "
+                  "xLearn will not dump model checkpoint to disk.");
+    hyper_param.model_file.clear();
+  }
+  if (hyper_param.validate_set_file.empty() && hyper_param.early_stop) {
+    print_warning("Validation file not found, xLearn has already "
+                  "disable early-stopping.");
+    hyper_param.early_stop = false;
+  }
+  if (hyper_param.metric.compare("none") != 0 &&
+      hyper_param.validate_set_file.empty() &&
+      !hyper_param.cross_validation) {
+    print_warning(
+      StringPrintf("Validation file not found, xLearn has already "
+                   "disable (-x %s) option.", 
+                   hyper_param.metric.c_str())
+    );
+    hyper_param.metric = "none";
+  }
+  if (hyper_param.loss_func.compare("squared") == 0) {
+    if (hyper_param.metric.compare("acc") == 0 ||
+        hyper_param.metric.compare("prec") == 0 ||
+        hyper_param.metric.compare("recall") == 0 ||
+        hyper_param.metric.compare("f1") == 0) {
+      print_warning(
+        StringPrintf("The -x: %s metric can only be used "
+                     "in classification tasks. xLearn will "
+                     "ignore this option.",
+                     hyper_param.metric.c_str())
+      );
+      hyper_param.metric = "none";
+    }
+  } else if (hyper_param.loss_func.compare("dist-cross-entropy") == 0) {
+    if (hyper_param.metric.compare("mae") == 0 ||
+        hyper_param.metric.compare("mape") == 0 ||
+        hyper_param.metric.compare("rmsd") == 0 ||
+        hyper_param.metric.compare("rmse") == 0) {
+      print_warning(
+        StringPrintf("The -x: %s metric can only be used "
+                     "in regression tasks. xLearn will ignore "
+                     "this option.",
+                     hyper_param.metric.c_str())
+        );
+      hyper_param.metric = "none";
+    }
+  }
+}
+
+// Check options for prediction tasks
+bool DistChecker::check_prediction_options(HyperParam& hyper_param) {
+  bool bo = true;
+  /*********************************************************
+   *  Check size                                           *
+   *********************************************************/
+  if (args_.size() < 3) {
+    print_error("The test file and model file must be set.");
+    return false;
+  }
+  /*********************************************************
+   *  Check the path of test set file                      *
+   *********************************************************/
+  if (FileExist(args_[1].c_str())) {
+    hyper_param.test_set_file = std::string(args_[1]);
+  } else {
+    print_error(
+      StringPrintf("Test set file: %s does not exist.",
+           args_[1].c_str())
+    );
+    return false;
+  }
+  /*********************************************************
+   *  Check the path of model file                         *
+   *********************************************************/
+  if (FileExist(args_[2].c_str())) {
+    hyper_param.model_file = std::string(args_[2]);
+  } else {
+    print_error(
+      StringPrintf("Model file: %s does not exist.",
+           args_[2].c_str())
+    );
+    return false;
+  }
+  /*********************************************************
+   *  Check each input argument                            *
+   *********************************************************/
+  StringList list(args_.begin()+3, args_.end());
+  StrSimilar ss;
+  for (int i = 0; i < list.size(); ) {
+    if (list[i].compare("-o") == 0) {  // path of the output
+      hyper_param.output_file = list[i+1];
+      i += 2;
+    } else if (list[i].compare("-l") == 0) {  // path of the log file
+      hyper_param.log_file = list[i+1];
+      i += 2;
+    } else if (list[i].compare("-nthread") == 0) {  // number of thread
+      int value = atoi(list[i+1].c_str());
+      if (value <= 0) {
+         print_error(
+          StringPrintf("Illegal -nthread : '%i'. -nthread must be greater than zero.",
+               value)
+        );
+        bo = false;
+      } else {
+        hyper_param.thread_number = value;
+      }
+      i += 2;
+    } else if (list[i].compare("--sign") == 0) {  // convert output to 0 and 1
+      hyper_param.sign = true;
+      i += 1;
+    } else if (list[i].compare("--sigmoid") == 0) {  // using sigmoid
+      hyper_param.sigmoid = true;
+      i += 1;
+    } else {  // no match
+      std::string similar_str;
+      ss.FindSimilar(list[i], menu_, similar_str);
+      print_error(
+        StringPrintf("Unknow argument '%s'. Do you mean '%s' ?",
+             list[i].c_str(),
+             similar_str.c_str())
+      );
+      bo = false;
+      break;
+    }
+  }
+  if (!bo) { return false; }
+  /*********************************************************
+   *  Check warning and fix conflict                       *
+   *********************************************************/
+  check_conflict_predict(hyper_param);
+  /*********************************************************
+   *  Set default value                                    *
+   *********************************************************/
+  if (hyper_param.output_file.empty()) {
+    hyper_param.output_file = hyper_param.test_set_file + ".out";
+  }
+
+  return true;
+}
+
+// Check the given param. Used by c_api
+bool DistChecker::check_prediction_param(HyperParam& hyper_param) {
+ bool bo = true;
+ /*********************************************************
+  *  Check the path of test set file                      *
+  *********************************************************/
+ if (!FileExist(hyper_param.test_set_file.c_str())) {
+   print_error(
+      StringPrintf("Test set file: %s does not exist.",
+           hyper_param.test_set_file.c_str())
+    );
+    bo =  false;
+ }
+ /*********************************************************
+   *  Check the path of model file                         *
+   *********************************************************/
+ if (!FileExist(hyper_param.model_file.c_str())) {
+   print_error(
+      StringPrintf("Test set file: %s does not exist.",
+           hyper_param.model_file.c_str())
+    );
+    bo = false;
+ }
+ if (!bo) return false;
+ /*********************************************************
+  *  Check warning and fix conflict                       *
+  *********************************************************/
+ check_conflict_predict(hyper_param);
+ /*********************************************************
+  *  Set default value                                    *
+  *********************************************************/
+ if (hyper_param.output_file.empty()) {
+   hyper_param.output_file = hyper_param.test_set_file + ".out";
+ }
+
+ return true;
+}
+
+// Check warning and fix conflict
+void DistChecker::check_conflict_predict(HyperParam& hyper_param) {
+  if (hyper_param.sign && hyper_param.sigmoid) {
+    print_warning("Both of --sign and --sigmoid have been set. "
+                  "xLearn has already disable --sign and --sigmoid.");
+    hyper_param.sign = false;
+    hyper_param.sigmoid = false;
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_checker.h b/src/distributed/dist_checker.h
new file mode 100644
index 00000000..f81e8705
--- /dev/null
+++ b/src/distributed/dist_checker.h
@@ -0,0 +1,80 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+
+This file defines the Checker class, which can check and parse
+the command line arguments.
+*/
+
+#ifndef XLEARN_DISTRIBUTED_DIST_CHECKER_H_
+#define XLEARN_DISTRIBUTED_DIST_CHECKER_H_
+
+#include <vector>
+#include <string>
+
+#include "src/base/common.h"
+#include "src/data/hyper_parameters.h"
+
+namespace xLearn {
+
+typedef std::vector<std::string> StringList;
+
+//------------------------------------------------------------------------------
+// Checker is used to check and parse command line arguments for xLearn.
+//------------------------------------------------------------------------------
+class DistChecker {
+ public:
+  // Constructor and Destructor
+  DistChecker() { }
+  ~DistChecker() { }
+
+  // Initialize Checker
+  void Initialize(bool is_train, int argc, char* argv[]);
+
+  // Check and parse arguments
+  bool check_cmd(HyperParam& hyper_param);
+
+  // Check hyper-param. Used by c_api
+  bool check_param(HyperParam& hyper_param);
+
+ protected:
+  /* Store all the possible options */
+  StringList menu_;
+  /* User input command line */
+  StringList args_;
+  /* train or predict */
+  bool is_train_;
+
+  // Print the help menu
+  std::string option_help() const;
+
+  // Check options for training and prediction
+  bool check_train_options(HyperParam& hyper_param);
+  bool check_train_param(HyperParam& hyper_param);
+  bool check_prediction_options(HyperParam& hyper_param);
+  bool check_prediction_param(HyperParam& hyper_param);
+  void check_conflict_train(HyperParam& hyper_param);
+  void check_conflict_predict(HyperParam& hyper_param);
+  
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistChecker);
+};
+
+} // namespace xLearn
+
+#endif // XLEARN_DISTRIBUTED_DIST_CHECKER_H_
diff --git a/src/distributed/dist_inference.cc b/src/distributed/dist_inference.cc
new file mode 100644
index 00000000..41a91470
--- /dev/null
+++ b/src/distributed/dist_inference.cc
@@ -0,0 +1,82 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the Predictor class.
+*/
+
+#include "src/distributed/dist_inference.h"
+#include "src/base/timer.h"
+#include "src/base/format_print.h"
+
+#include <vector>
+#include <sstream>
+
+namespace xLearn {
+
+// Given a pre-trained model and test data, the predictor
+// will return the prediction output
+void DistPredictor::Predict() {
+  std::ofstream o_file(out_file_);
+  static std::vector<real_t> out;
+  DMatrix* matrix = nullptr;
+  reader_->Reset();
+  loss_->Reset();
+  for (;;) {
+    index_t tmp = reader_->Samples(matrix);
+    if (tmp == 0) { break; }
+    if (tmp != out.size()) { out.resize(tmp); }
+    loss_->Predict(matrix, *model_, out);
+    if (reader_->has_label()) {
+      loss_->Evalute(out, matrix->Y);
+    }
+    if (sigmoid_) {
+      this->sigmoid(out, out);
+    } else if (sign_) {
+      this->sign(out, out);
+    }
+    for (index_t i = 0; i < out.size(); ++i) {
+      o_file << out[i] << "\n";
+    }
+  }
+  if (reader_->has_label()) {
+    print_info(
+      StringPrintf("The test loss is: %.6f", 
+        loss_->GetLoss())
+    );
+  }
+}
+
+// Convert output by using the sigmoid function.
+void DistPredictor::sigmoid(std::vector<real_t>& in, 
+                        std::vector<real_t>& out) {
+  CHECK_EQ(in.size(), out.size());
+  for (size_t i = 0; i < in.size(); ++i) {
+    out[i] = 1.0 / (1.0 + exp(-in[i]));
+  }
+}
+
+// Convert output to 0 and 1.
+void DistPredictor::sign(std::vector<real_t>& in, 
+                     std::vector<real_t>& out) {
+  CHECK_EQ(in.size(), out.size());
+  for (size_t i = 0; i < in.size(); ++i) {
+    out[i] = in[i] > 0 ? 1 : 0;
+  }
+}
+
+}  // namespace xLearn
diff --git a/src/distributed/dist_inference.h b/src/distributed/dist_inference.h
new file mode 100644
index 00000000..875abb8c
--- /dev/null
+++ b/src/distributed/dist_inference.h
@@ -0,0 +1,90 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+
+This file defines the Predictor class.
+*/
+
+#ifndef XLEARN_SOLVER_DIST_INFERENCE_H_
+#define XLEARN_SOLVER_DIST_INFERENCE_H_
+
+#include <string>
+
+#include "src/base/common.h"
+#include "src/data/data_structure.h"
+#include "src/data/model_parameters.h"
+#include "src/reader/reader.h"
+#include "src/distributed/dist_loss.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Given a pre-trained model and test data, the predictor
+// will return the prediction output
+//------------------------------------------------------------------------------
+class DistPredictor {
+ public:
+  // Constructor and Desstructor
+  DistPredictor() { }
+  ~DistPredictor() { }
+
+  // Invoke this function before we use this class
+  void Initialize(Reader* reader,
+                  Model* model,
+                  DistLoss* loss,
+                  const std::string& out,
+                  bool sign = false,
+                  bool sigmoid = false) {
+    CHECK_NOTNULL(reader);
+    CHECK_NOTNULL(model);
+    CHECK_NOTNULL(loss);
+    CHECK_NE(out.empty(), true);
+    reader_ = reader;
+    model_ = model;
+    loss_ = loss;
+    out_file_ = out;
+    sign_ = sign;
+    sigmoid_ = sigmoid;
+  }
+
+  // The core function
+  void Predict();
+
+ protected:
+  Reader* reader_;
+  Model* model_;
+  DistLoss* loss_;
+  std::string out_file_;
+  bool sign_;
+  bool sigmoid_;
+
+  // Convert output by using the sigmoid function.
+  void sigmoid(std::vector<real_t>& in, 
+               std::vector<real_t>& out);
+
+  // Convert output to 0 and 1.
+  void sign(std::vector<real_t>& in, 
+            std::vector<real_t>& out);
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistPredictor);
+};  // class Predictor
+
+}  // namespace xLearn
+
+#endif // XLEARN_SOLVER_DIST_INFERENCE_H_
diff --git a/src/distributed/dist_loss.cc b/src/distributed/dist_loss.cc
new file mode 100644
index 00000000..e803f77b
--- /dev/null
+++ b/src/distributed/dist_loss.cc
@@ -0,0 +1,78 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the base Loss class.
+*/
+
+#include "src/distributed/dist_loss.h"
+#include "src/distributed/dist_cross_entropy_loss.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_dist_loss_registry, DistLoss);
+REGISTER_DIST_LOSS("dist-cross-entropy", DistCrossEntropyLoss);
+
+// Predict in one thread
+void pred_thread(const DMatrix* matrix,
+                 Model* model,
+                 std::vector<real_t>* pred,
+                 DistScore* dist_score_func_,
+                 bool is_norm,
+                 size_t start_idx,
+                 size_t end_idx) {
+  /*
+  CHECK_GE(end_idx, start_idx);
+  for (size_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t norm = is_norm ? matrix->norm[i] : 1.0;
+    (*pred)[i] = dist_score_func_->CalcScore(row, *model, norm);
+  }
+  */
+}
+
+// Predict in multi-thread
+void DistLoss::Predict(const DMatrix* matrix,
+                   Model& model,
+                   std::vector<real_t>& pred) {
+  /*
+  CHECK_NOTNULL(matrix);
+  CHECK_NE(pred.empty(), true);
+  CHECK_EQ(pred.size(), matrix->row_length);
+  index_t row_len = matrix->row_length;
+  // Predict in multi-thread
+  for (int i = 0; i < threadNumber_; ++i) {
+    size_t start_idx = getStart(row_len, threadNumber_, i);
+    size_t end_idx = getEnd(row_len, threadNumber_, i);
+    pool_->enqueue(std::bind(pred_thread,
+                             matrix,
+                             &model,
+                             &pred,
+                             dist_score_func_,
+                             norm_,
+                             start_idx,
+                             end_idx));
+  }
+  // Wait all of the threads finish their job
+  pool_->Sync(threadNumber_);
+  */
+}
+
+}  // namespace xLearn
diff --git a/src/distributed/dist_loss.h b/src/distributed/dist_loss.h
new file mode 100644
index 00000000..cea113b0
--- /dev/null
+++ b/src/distributed/dist_loss.h
@@ -0,0 +1,170 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the Loss class, which is also called error
+function or objective function.
+*/
+
+#ifndef XLEARN_DISTRIBUTED_DIST_LOSS_H_
+#define XLEARN_DISTRIBUTED_DIST_LOSS_H_
+
+#include <vector>
+#include <string>
+
+#include "src/base/common.h"
+#include "src/base/class_register.h"
+#include "src/base/math.h"
+#include "src/base/thread_pool.h"
+#include "src/data/model_parameters.h"
+#include "src/distributed/dist_score_function.h"
+
+#include "ps/ps.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// The Loss is an abstract class, which can be implemented by the real
+// loss functions such as cross-entropy loss (cross_entropy_loss.h),
+// squared loss (squared_loss.h), hinge loss (hinge_loss.h), etc.
+// There are three important method in Loss, including Evalute(), Predict(),
+// and CalcGrad(). We can use the Loss class like this:
+//
+//   // Create a squared loss with linear score function, which
+//   // is usually used for linear regression.
+//   Loss* sq_loss = new SquaredLoss();
+//   sq_loss->Initialize(linear_score, pool);
+//
+//   // Then, we can perform gradient descent like this:
+//   DMatrix* matrix = NULL;
+//   for (int n = 0: n < epoch; ++n) {
+//     reader->Reset();
+//     while (reader->Samples(matrix)) {
+//       // Assume that the model and updater have been initialized
+//       sq_loss->CalcGrad(matrix, model, updater);
+//     }
+//   }
+//
+//   // After training, we can calculate the train loss
+//   real_t loss_val = 0;
+//   while (1) {
+//     int tmp = reader->Samples(matrix);
+//     if (tmp == 0) { break; }
+//     pred.resize(tmp);
+//     sq_loss->Predict(matrix, model, pred);
+//     sq_loss->Evalute(pred, matrix->Y);
+//   }
+//   loss_val = sq_loss->GetLoss()
+//------------------------------------------------------------------------------
+class DistLoss {
+ public:
+  // Constructor and Desstructor
+  DistLoss() : loss_sum_(0), total_example_(0){ 
+    kv_w_ = new ps::KVWorker<float>(0);
+    kv_v_ = new ps::KVWorker<float>(1);
+  };
+  virtual ~DistLoss() { }
+
+  // This function needs to be invoked before using this class
+  void DistInitialize(DistScore* score,
+                  ThreadPool* pool,
+                  bool norm = true,
+                  bool lock_free = false) {
+    CHECK_NOTNULL(score);
+    CHECK_NOTNULL(pool);
+    dist_score_func_ = score;
+    pool_ = pool;
+    norm_ = norm;
+    threadNumber_ = pool_->ThreadNumber();
+    lock_free_ = lock_free;
+  }
+
+  // Given predictions and labels, accumulate loss value.
+  virtual void Evalute(const std::vector<real_t>& pred,
+                       const std::vector<real_t>& label) = 0;
+
+  // Given data sample and current model, return predictions.
+  virtual void Predict(const DMatrix* data_matrix,
+                       Model& model,
+                       std::vector<real_t>& pred);
+
+  // Given data sample and current model, calculate gradient
+  // and update current model parameters.
+  // This function will also acummulate loss value.
+  virtual void CalcGrad(const DMatrix* data_matrix, 
+                        Model& model) = 0;
+
+  // Return the calculated loss value
+  virtual real_t GetLoss() {
+    return loss_sum_ / total_example_;
+  }
+
+  // Reset loss_sum_ and total_example_
+  virtual void Reset() {
+    loss_sum_ = 0;
+    total_example_ = 0;
+  }
+
+  // Return a current loss type
+  virtual std::string loss_type() = 0;
+
+ protected:
+  /* The score function, including LinearScore,
+  FMScore, FFMScore, etc */
+  DistScore* dist_score_func_;
+  /* Use instance-wise normalization */
+  bool norm_;
+  /* Open lock-free training ? */
+  bool lock_free_;
+  /* Thread pool for multi-thread training */
+  ThreadPool* pool_;
+  /* Number of thread in thread pool */
+  size_t threadNumber_;
+  /* Used to store the accumulate loss */
+  real_t loss_sum_;
+  /* Used to store the number of example */
+  index_t total_example_;
+  /* kv store for w */
+  ps::KVWorker<float>* kv_w_;
+  /* kv store for v */
+  ps::KVWorker<float>* kv_v_;
+
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistLoss);
+};
+
+//------------------------------------------------------------------------------
+// Class register
+//------------------------------------------------------------------------------
+CLASS_REGISTER_DEFINE_REGISTRY(xLearn_dist_loss_registry, DistLoss);
+
+#define REGISTER_DIST_LOSS(format_name, loss_name)               \
+  CLASS_REGISTER_OBJECT_CREATOR(                            \
+      xLearn_dist_loss_registry,                                 \
+      DistLoss,                                                 \
+      format_name,                                          \
+      loss_name)
+
+#define CREATE_DIST_LOSS(format_name)                            \
+  CLASS_REGISTER_CREATE_OBJECT(                             \
+      xLearn_dist_loss_registry,                                 \
+      format_name)
+
+}  // namespace xLearn
+
+#endif  // XLEARN_LOSS_LOSS_H_
diff --git a/src/distributed/dist_solver.cc b/src/distributed/dist_solver.cc
new file mode 100644
index 00000000..189c811b
--- /dev/null
+++ b/src/distributed/dist_solver.cc
@@ -0,0 +1,563 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the Solver class.
+*/
+
+#include "src/distributed/dist_solver.h"
+
+#include <vector>
+#include <string>
+#include <algorithm>
+#include <stdexcept>
+#include <cstdio>
+#include <thread>
+
+#include "src/base/stringprintf.h"
+#include "src/base/split_string.h"
+#include "src/base/timer.h"
+#include "src/base/system.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+//         _
+//        | |
+//   __  _| |     ___  __ _ _ __ _ __
+//   \ \/ / |    / _ \/ _` | '__| '_ \
+//    >  <| |___|  __/ (_| | |  | | | |
+//   /_/\_\______\___|\__,_|_|  |_| |_|
+//
+//      xLearn   -- 0.10 Version --
+//------------------------------------------------------------------------------
+void DistSolver::print_logo() const {
+  std::string logo = 
+"----------------------------------------------------------------------------------------------\n"
+                    "           _\n"
+                    "          | |\n"
+                    "     __  _| |     ___  __ _ _ __ _ __\n"
+                    "     \\ \\/ / |    / _ \\/ _` | '__| '_ \\ \n"
+                    "      >  <| |___|  __/ (_| | |  | | | |\n"
+                    "     /_/\\_\\_____/\\___|\\__,_|_|  |_| |_|\n\n"
+                    "        xLearn   -- 0.20 Version --\n"
+"----------------------------------------------------------------------------------------------\n"
+"\n";
+  Color::Modifier green(Color::FG_GREEN);
+  Color::Modifier def(Color::FG_DEFAULT);
+  Color::Modifier bold(Color::BOLD);
+  Color::Modifier reset(Color::RESET);
+  std::cout << green << bold << logo << def << reset;
+}
+
+/******************************************************************************
+ * Creater functions                                                          *
+ ******************************************************************************/
+
+// Create Reader by a given string
+Reader* DistSolver::create_reader() {
+  Reader* reader;
+  std::string str = hyper_param_.on_disk ? "disk" : "memory";
+  reader = CREATE_READER(str.c_str());
+  if (reader == nullptr) {
+    LOG(FATAL) << "Cannot create reader: " << str;
+  }
+  return reader;
+}
+
+// Create Score by a given string
+DistScore* DistSolver::create_score() {
+  DistScore* dist_score;
+  dist_score = CREATE_DIST_SCORE("dist_linear");
+  if (dist_score == nullptr) {
+    LOG(FATAL) << "Cannot create score: "
+               << hyper_param_.score_func;
+  }
+  return dist_score;
+}
+
+// Create Loss by a given string
+DistLoss* DistSolver::create_loss() {
+  DistLoss* loss;
+  loss = CREATE_DIST_LOSS(hyper_param_.loss_func.c_str());
+  if (loss == nullptr) {
+    LOG(FATAL) << "Cannot create loss: "
+               << hyper_param_.loss_func;
+  }
+  return loss;
+}
+
+// Create Metric by a given string
+Metric* DistSolver::create_metric() {
+  Metric* metric;
+  metric = CREATE_METRIC(hyper_param_.metric.c_str());
+  // Note that here we do not cheack metric == nullptr
+  // this is because we can set metric to "none", which 
+  // means that we don't print any metric info.
+  return metric;
+}
+
+
+/******************************************************************************
+ * Functions for xlearn initialize                                            *
+ ******************************************************************************/
+
+// Initialize Solver
+void DistSolver::Initialize(int argc, char* argv[]) {
+  //  Print logo
+  print_logo();
+  // Check and parse command line arguments
+  checker(argc, argv);
+  // Initialize log file
+  init_log();
+  // Init train or predict
+  if (hyper_param_.is_train) {
+    init_train();
+  } else {
+    init_predict();
+  }
+}
+
+// Initialize the xLearn environment through the
+// given hyper-parameters. This function will be 
+// used for python API.
+void DistSolver::Initialize(HyperParam& hyper_param) {
+  // Print logo
+  print_logo();
+  // Check the arguments
+  checker(hyper_param);
+  this->hyper_param_ = hyper_param;
+  // Initialize log file
+  init_log();
+  // Init train or predict
+  if (hyper_param_.is_train) {
+    init_train();
+  } else {
+    init_predict();
+  }
+}
+
+// Check and parse command line arguments
+void DistSolver::checker(int argc, char* argv[]) {
+  try {
+    dist_checker_.Initialize(hyper_param_.is_train, argc, argv);
+    if (!dist_checker_.check_cmd(hyper_param_)) {
+      print_error("Arguments error");
+      exit(0);
+    }
+  } catch (std::invalid_argument &e) {
+    printf("%s\n", e.what());
+    exit(1);
+  }
+}
+
+// Check the given hyper-parameters
+void DistSolver::checker(HyperParam& hyper_param) {
+  if (!dist_checker_.check_param(hyper_param)) {
+    print_error("Arguments error");
+    exit(0);
+  }
+}
+
+// Initialize log file
+void DistSolver::init_log() {
+  std::string prefix = get_log_file(hyper_param_.log_file);
+  if (hyper_param_.is_train) {
+    prefix += "_train";
+  } else {
+    prefix += "_predict";
+  }
+  InitializeLogger(StringPrintf("%s.INFO", prefix.c_str()),
+              StringPrintf("%s.WARN", prefix.c_str()),
+              StringPrintf("%s.ERROR", prefix.c_str()));
+}
+
+// Initialize training task
+void DistSolver::init_train() {
+  /*********************************************************
+   *  Initialize thread pool                               *
+   *********************************************************/
+  size_t threadNumber = std::thread::hardware_concurrency();;
+  if (hyper_param_.thread_number != 0) {
+    threadNumber = hyper_param_.thread_number;
+  }
+  pool_ = new ThreadPool(threadNumber);
+  /*********************************************************
+   *  Initialize Reader                                    *
+   *********************************************************/
+  Timer timer;
+  timer.tic();
+  print_action("Read Problem ...");
+  LOG(INFO) << "Start to init Reader";
+  // Split file
+  if (hyper_param_.cross_validation) {
+    CHECK_GT(hyper_param_.num_folds, 0);
+    splitor_.split(hyper_param_.train_set_file,
+                   hyper_param_.num_folds);
+    LOG(INFO) << "Split file into "
+              << hyper_param_.num_folds
+              << " parts.";
+  }
+  // Get the Reader list
+  int num_reader = 0;
+  std::vector<std::string> file_list;
+  if (hyper_param_.cross_validation) {
+    num_reader += hyper_param_.num_folds;
+    for (int i = 0; i < hyper_param_.num_folds; ++i) {
+      std::string filename = StringPrintf("%s_%d",
+           hyper_param_.train_set_file.c_str(), i);
+      file_list.push_back(filename);
+    }
+  } else {  // do not use cross-validation
+    num_reader += 1;  // training file
+    CHECK_NE(hyper_param_.train_set_file.empty(), true);
+    file_list.push_back(hyper_param_.train_set_file);
+    if (!hyper_param_.validate_set_file.empty()) {
+      num_reader += 1;  // validation file
+      file_list.push_back(hyper_param_.validate_set_file);
+    }
+  }
+  LOG(INFO) << "Number of Reader: " << num_reader;
+  reader_.resize(num_reader, nullptr);
+  // Create Reader
+  for (int i = 0; i < num_reader; ++i) {
+    reader_[i] = create_reader();
+    reader_[i]->Initialize(file_list[i]);
+    if (!hyper_param_.on_disk) {
+      reader_[i]->SetShuffle(true);
+    }
+    if (reader_[i] == nullptr) {
+      print_error(
+        StringPrintf("Cannot open the file %s",
+             file_list[i].c_str())
+      );
+      exit(0);
+    }
+    LOG(INFO) << "Init Reader: " << file_list[i];
+  }
+  /*********************************************************
+   *  Read problem                                         *
+   *********************************************************/
+  DMatrix* matrix = nullptr;
+  index_t max_feat = 0, max_field = 0;
+  for (int i = 0; i < num_reader; ++i) {
+    while(reader_[i]->Samples(matrix)) {
+      int tmp = matrix->MaxFeat();
+      if (tmp > max_feat) { max_feat = tmp; }
+      if (hyper_param_.score_func.compare("ffm") == 0) {
+        tmp = matrix->MaxField();
+        if (tmp > max_field) { max_field = tmp; }
+      }
+    }
+    // Return to the begining of target file.
+    reader_[i]->Reset();
+  }
+  hyper_param_.num_feature = max_feat + 1;
+  LOG(INFO) << "Number of feature: " << hyper_param_.num_feature;
+  print_info(
+    StringPrintf("Number of Feature: %d", 
+                 hyper_param_.num_feature)
+  );
+  if (hyper_param_.score_func.compare("ffm") == 0) {
+    hyper_param_.num_field = max_field + 1;
+    LOG(INFO) << "Number of field: " << hyper_param_.num_field;
+    print_info(
+      StringPrintf("Number of Field: %d", 
+        hyper_param_.num_field)
+    );
+  }
+  print_info(
+    StringPrintf("Time cost for reading problem: %.2f (sec)",
+         timer.toc())
+  );
+  /*********************************************************
+   *  Initialize Model                                     *
+   *********************************************************/
+  timer.reset();
+  timer.tic();
+  print_action("Initialize model ...");
+  // Initialize parameters
+  model_ = new Model();
+  if (hyper_param_.opt_type.compare("sgd") == 0) {
+    hyper_param_.auxiliary_size = 1;
+  } else if (hyper_param_.opt_type.compare("adagrad") == 0) {
+    hyper_param_.auxiliary_size = 2;
+  } else if (hyper_param_.opt_type.compare("ftrl") == 0) {
+    hyper_param_.auxiliary_size = 3;
+  }
+  model_->Initialize(hyper_param_.score_func,
+                   hyper_param_.loss_func,
+                   hyper_param_.num_feature,
+                   hyper_param_.num_field,
+                   hyper_param_.num_K,
+                   hyper_param_.auxiliary_size,
+                   hyper_param_.model_scale);
+  index_t num_param = model_->GetNumParameter();
+  hyper_param_.num_param = num_param;
+  LOG(INFO) << "Number parameters: " << num_param;
+  print_info(
+    StringPrintf("Model size: %s", 
+         PrintSize(num_param*sizeof(real_t)).c_str())
+  );
+  print_info(
+    StringPrintf("Time cost for model initial: %.2f (sec)",
+         timer.toc())
+  );
+  /*********************************************************
+   *  Initialize score function                            *
+   *********************************************************/
+  dist_score_ = create_score();
+  dist_score_->Initialize(hyper_param_.learning_rate,
+                     hyper_param_.regu_lambda,
+                     hyper_param_.alpha,
+                     hyper_param_.beta,
+                     hyper_param_.lambda_1,
+                     hyper_param_.lambda_2,
+                     hyper_param_.opt_type);
+  LOG(INFO) << "Initialize score function.";
+  /*********************************************************
+   *  Initialize loss function                             *
+   *********************************************************/
+  dist_loss_ = create_loss();
+  dist_loss_->DistInitialize(dist_score_, pool_, 
+         hyper_param_.norm, 
+         hyper_param_.lock_free);
+  LOG(INFO) << "Initialize loss function.";
+  /*********************************************************
+   *  Init metric                                          *
+   *********************************************************/
+  metric_ = create_metric();
+  if (metric_ != nullptr) {
+    metric_->Initialize(pool_);
+  }
+  LOG(INFO) << "Initialize evaluation metric.";
+}
+
+// Initialize predict task
+void DistSolver::init_predict() {
+  /*********************************************************
+   *  Initialize thread pool                               *
+   *********************************************************/
+  size_t threadNumber = std::thread::hardware_concurrency();
+  pool_ = new ThreadPool(threadNumber);
+  /*********************************************************
+   *  Read model file                                      *
+   *********************************************************/
+  print_action("Load model ...");
+  CHECK_NE(hyper_param_.model_file.empty(), true);
+  print_info(
+    StringPrintf("Load model from %s",
+          hyper_param_.model_file.c_str())
+  );
+  Timer timer;
+  timer.tic();
+  model_ = new Model(hyper_param_.model_file);
+  hyper_param_.score_func = model_->GetScoreFunction();
+  hyper_param_.loss_func = model_->GetLossFunction();
+  hyper_param_.num_feature = model_->GetNumFeature();
+  if (hyper_param_.score_func.compare("fm") == 0 ||
+       hyper_param_.score_func.compare("ffm") == 0) {
+    hyper_param_.num_K = model_->GetNumK();
+  }
+  if (hyper_param_.score_func.compare("ffm") == 0) {
+    hyper_param_.num_field = model_->GetNumField();
+  }
+  print_info(
+    StringPrintf("Loss function: %s", 
+      hyper_param_.loss_func.c_str())
+  );
+  print_info(
+    StringPrintf("Score function: %s", 
+      hyper_param_.score_func.c_str())
+  );
+  print_info(
+    StringPrintf("Number of Feature: %d", 
+                 hyper_param_.num_feature)
+  );
+  if (hyper_param_.score_func.compare("fm") == 0 ||
+      hyper_param_.score_func.compare("ffm") == 0) {
+    print_info(
+      StringPrintf("Number of K: %d", 
+                   hyper_param_.num_K)
+    );
+    if (hyper_param_.score_func.compare("ffm") == 0) {
+      print_info(
+        StringPrintf("Number of field: %d", 
+                    hyper_param_.num_field)
+      );
+    }
+  }
+  print_info(
+    StringPrintf("Time cost for loading model: %.2f (sec)",
+        timer.toc())
+  );
+  LOG(INFO) << "Initialize model.";
+  /*********************************************************
+   *  Initialize Reader and read problem                   *
+   *********************************************************/
+  print_action("Read Problem ...");
+  timer.reset();
+  timer.tic();
+  // Create Reader
+  reader_.resize(1, create_reader());
+  CHECK_NE(hyper_param_.test_set_file.empty(), true);
+  reader_[0]->Initialize(hyper_param_.test_set_file);
+  reader_[0]->SetShuffle(false);
+  if (reader_[0] == nullptr) {
+   print_info(
+    StringPrintf("Cannot open the file %s",
+                 hyper_param_.test_set_file.c_str())
+   );
+   exit(0);
+  }
+  print_info(
+    StringPrintf("Time cost for reading problem: %.2f (sec)",
+                  timer.toc())
+  );
+  LOG(INFO) << "Initialize Reader: " << hyper_param_.test_set_file;
+  /*********************************************************
+   *  Init score function                                  *
+   *********************************************************/
+  dist_score_ = create_score();
+  LOG(INFO) << "Initialize score function.";
+  /*********************************************************
+   *  Init loss function                                   *
+   *********************************************************/
+  dist_loss_ = create_loss();
+  dist_loss_->DistInitialize(dist_score_, pool_, hyper_param_.norm);
+  LOG(INFO) << "Initialize score function.";
+}
+
+/******************************************************************************
+ * Functions for xlearn start work                                            *
+ ******************************************************************************/
+
+// Start training or inference
+void DistSolver::StartWork() {
+  if (hyper_param_.is_train) {
+    LOG(INFO) << "Start training work.";
+    start_train_work();
+  } else {
+    LOG(INFO) << "Start inference work.";
+    start_prediction_work();
+  }
+}
+
+// Train
+void DistSolver::start_train_work() {
+  int epoch = hyper_param_.num_epoch;
+  bool early_stop = hyper_param_.early_stop &&
+                   !hyper_param_.cross_validation;
+  bool quiet = hyper_param_.quiet &&
+              !hyper_param_.cross_validation;
+  bool save_model = true;
+  bool save_txt_model = true;
+  if (hyper_param_.model_file.compare("none") == 0 ||
+      hyper_param_.cross_validation) {
+    save_model = false;
+  }
+  if (hyper_param_.txt_model_file.compare("none") == 0 ||
+      hyper_param_.cross_validation) {
+    save_txt_model = false;
+  }
+  DistTrainer trainer;
+  trainer.Initialize(reader_,  /* Reader list */
+                     epoch,
+                     model_,
+                     dist_loss_,
+                     metric_,
+                     early_stop,
+                     quiet);
+  print_action("Start to train ...");
+/******************************************************************************
+ * Training under cross-validation                                            *
+ ******************************************************************************/
+  if (hyper_param_.cross_validation) {
+    trainer.CVTrain();
+    print_action("Finish Cross-Validation");
+  } 
+/******************************************************************************
+ * Original training without cross-validation                                 *
+ ******************************************************************************/
+  else {
+    trainer.Train();
+    if (save_model) {
+      Timer timer;
+      timer.tic();
+      print_action("Start to save model ...");
+      trainer.SaveModel(hyper_param_.model_file);
+      print_info(
+        StringPrintf("Model file: %s", 
+          hyper_param_.model_file.c_str())
+      );
+      print_info(
+        StringPrintf("Time cost for saving model: %.2f (sec)",
+             timer.toc())
+      );
+    } 
+    if (save_txt_model) {
+      Timer timer;
+      timer.tic();
+      print_action("Start to save txt model ...");
+      trainer.SaveTxtModel(hyper_param_.txt_model_file);
+      print_info(
+        StringPrintf("TXT Model file: %s", 
+          hyper_param_.txt_model_file.c_str())
+      );
+      print_info(
+        StringPrintf("Time cost for saving txt model: %.2f (sec)",
+             timer.toc())
+      );
+    }
+    print_action("Finish training");
+  }
+}
+
+// Inference
+void DistSolver::start_prediction_work() {
+  print_action("Start to predict ...");
+  DistPredictor pdc;
+  pdc.Initialize(reader_[0],
+                 model_,
+                 dist_loss_,
+                 hyper_param_.output_file,
+                 hyper_param_.sign,
+                 hyper_param_.sigmoid);
+  // Predict and write output
+  pdc.Predict();
+}
+
+/******************************************************************************
+ * Functions for xlearn finalization                                          *
+ ******************************************************************************/
+
+// Finalize xLearn
+void DistSolver::Clear() {
+  LOG(INFO) << "Clear the xLearn environment ...";
+  print_action("Clear the xLearn environment ...");
+  // Clear model
+  delete this->model_;
+  // Clear Reader
+  for (size_t i = 0; i < this->reader_.size(); ++i) {
+    if (reader_[i] != nullptr) {
+      delete reader_[i];
+    }
+  }
+  reader_.clear();
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_solver.h b/src/distributed/dist_solver.h
new file mode 100644
index 00000000..14b69219
--- /dev/null
+++ b/src/distributed/dist_solver.h
@@ -0,0 +1,134 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+
+This file defines the Solver class, which is the entry
+of the xLearn.
+*/
+
+#ifndef XLEARN_DIST_SOLVER_SOLVER_H_
+#define XLEARN_DIST_SOLVER_SOLVER_H_
+
+#include "src/base/common.h"
+#include "src/base/thread_pool.h"
+#include "src/data/hyper_parameters.h"
+#include "src/data/data_structure.h"
+#include "src/data/model_parameters.h"
+#include "src/reader/reader.h"
+#include "src/reader/parser.h"
+#include "src/reader/file_splitor.h"
+#include "src/score/score_function.h"
+#include "src/distributed/dist_score_function.h"
+#include "src/distributed/dist_loss.h"
+#include "src/loss/metric.h"
+#include "src/distributed/dist_checker.h"
+#include "src/distributed/dist_trainer.h"
+#include "src/distributed/dist_inference.h"
+
+namespace xLearn {
+//------------------------------------------------------------------------------
+// Solver is entry class of xLearn, which can perform training 
+// or prediction tasks. There are three important functions in this 
+// class, including the Initialize(), StartWork(), and Clear() funtions.
+// 
+// We can use Solver class like this:
+//
+//  xLearn::Solver solver;
+//  solver.SetTrain();   // or solver.SetPredict()
+//  solver.Initialize(argc, argv);
+//  solver.StartWork();
+//  solver.Clear();
+//------------------------------------------------------------------------------
+class DistSolver {
+ public:
+  // Constructor and Destructor
+  DistSolver() 
+    : dist_score_(nullptr),
+      dist_loss_(nullptr),
+      metric_(nullptr) { }
+  ~DistSolver() { }
+
+  // Ser train or predict
+  void SetTrain() { hyper_param_.is_train = true; }
+  void SetPredict() { hyper_param_.is_train = false; }
+
+  // Initialize the xLearn environment, including checking
+  // and parsing the commad line arguments, reading problem
+  // (training data or testing data), initialize model, loss, 
+  // metric, and score functions, etc.
+  void Initialize(int argc, char* argv[]);
+
+  // Initialize the xLearn environment through the
+  // given hyper-parameters. This function will be 
+  // used for python API.
+  void Initialize(HyperParam& hyper_param);
+
+  // Start a training task or start an inference task.
+  void StartWork();
+
+  // Clear the xLearn environment.
+  void Clear();
+
+ protected:
+  /* Global hyper-parameters */
+  xLearn::HyperParam hyper_param_;
+  /* Check the user input */
+  xLearn::DistChecker dist_checker_;
+  /* Global model parameters */
+  xLearn::Model* model_;
+  /* One Reader corresponds one data file */
+  std::vector<xLearn::Reader*> reader_;
+  /* Split file in cross-validation */
+  xLearn::FileSpliter splitor_;
+  /* linear, fm or ffm ? */
+  xLearn::DistScore* dist_score_;
+  /* cross-entropy or squared ? */
+  xLearn::DistLoss* dist_loss_;
+  /* acc, prec, recall, mae, etc */
+  xLearn::Metric* metric_;
+  /* ThreadPool for multi-thread training */
+  ThreadPool* pool_;
+
+  // Create object by name
+  xLearn::Reader* create_reader();
+  //xLearn::Score* create_score();
+  xLearn::DistScore* create_score();
+  xLearn::DistLoss* create_loss();
+  xLearn::Metric* create_metric();
+
+  // xLearn command line logo
+  void print_logo() const;
+
+  // Initialize function
+  void init_train();
+  void init_predict();
+  void init_log();
+  void checker(int argc, char* argv[]);
+  void checker(HyperParam& hyper_param);
+
+  // Start function
+  void start_train_work();
+  void start_prediction_work();
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistSolver);
+};
+
+} // namespace xLearn
+
+#endif // XLEARN_DIST_SOLVER_SOLVER_H_
diff --git a/src/distributed/dist_train_main.cc b/src/distributed/dist_train_main.cc
new file mode 100644
index 00000000..2a5ec675
--- /dev/null
+++ b/src/distributed/dist_train_main.cc
@@ -0,0 +1,55 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+
+This file is the entry for training of the xLearn.
+*/
+
+#include "src/base/common.h"
+#include "src/base/timer.h"
+#include "src/base/stringprintf.h"
+#include "src/distributed/dist_solver.h"
+#include "src/distributed/server.h"
+#include "src/distributed/worker.h"
+
+//------------------------------------------------------------------------------
+// The pre-defined main function
+//------------------------------------------------------------------------------
+
+int main(int argc, char* argv[]) {
+  if (ps::IsServer()) {
+    xlearn::XLearnServer* server = new xlearn::XLearnServer();
+  }
+
+  ps::Start();
+  if (ps::IsWorker()) {
+    Timer timer;
+    timer.tic();
+    xLearn::DistSolver dist_solver;
+    dist_solver.SetTrain();
+    dist_solver.Initialize(argc, argv);
+    dist_solver.StartWork();
+    dist_solver.Clear();
+    print_info(
+      StringPrintf("Total time cost: %.2f (sec)", 
+      timer.toc()), false);
+  }
+  ps::Finalize();
+
+  return 0;
+}
diff --git a/src/distributed/dist_trainer.cc b/src/distributed/dist_trainer.cc
new file mode 100644
index 00000000..3fd5579d
--- /dev/null
+++ b/src/distributed/dist_trainer.cc
@@ -0,0 +1,274 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of the Trainer class.
+*/
+
+#include <stdio.h>
+#include <vector>
+#include <string>
+
+#include "src/distributed/dist_trainer.h"
+#include "src/data/data_structure.h"
+#include "src/base/timer.h"
+
+namespace xLearn {
+
+const int kStopWindow = 2;
+
+/*********************************************************
+ *  Show head info                                       *
+ *********************************************************/
+void DistTrainer::show_head_info(bool validate) {
+  std::vector<std::string> str_list;
+  std::vector<int> width_list;
+  str_list.push_back("Epoch");
+  width_list.push_back(6);
+  str_list.push_back("Train " + loss_->loss_type());
+  width_list.push_back(20);
+  if (validate) {
+    str_list.push_back("Test " + loss_->loss_type());
+    width_list.push_back(20);
+    if (metric_ != nullptr) {
+      str_list.push_back("Test " + metric_->metric_type());
+      width_list.push_back(20);
+    }
+  }
+  str_list.push_back("Time cost (sec)");
+  width_list.push_back(20);
+  Color::Modifier green(Color::FG_GREEN);
+  Color::Modifier reset(Color::RESET);
+  std::cout << green << "[------------]" << reset;
+  print_row(str_list, width_list);
+}
+
+/*********************************************************
+ *  Show train info                                      *
+ *********************************************************/
+void DistTrainer::show_train_info(real_t tr_loss, 
+                              real_t te_loss,
+                              real_t te_metric,
+                              real_t time_cost, 
+                              bool validate,
+                              index_t epoch) {
+  std::vector<std::string> str_list;
+  std::vector<int> width_list;
+  str_list.push_back(StringPrintf("%d", epoch));
+  width_list.push_back(6);
+  str_list.push_back(StringPrintf("%.6f", tr_loss));
+  width_list.push_back(20);
+  if (validate) {
+    str_list.push_back(StringPrintf("%.6f", te_loss));
+    width_list.push_back(20);
+    if (metric_ != nullptr) {
+      str_list.push_back(StringPrintf("%.6f", te_metric));
+      width_list.push_back(20);
+    }
+  }
+  str_list.push_back(StringPrintf("%.2f", time_cost));
+  width_list.push_back(20);
+  Color::Modifier green(Color::FG_GREEN);
+  Color::Modifier reset(Color::RESET);
+  std::cout << green << "[ " << reset;
+  std::cout.width(4); 
+  std::cout << static_cast<int>(epoch*1.0/epoch_*100) 
+            << "%" << green << "      ]"  << reset;
+  print_row(str_list, width_list);
+}
+
+/*********************************************************
+ *  Basic train                                          *
+ *********************************************************/
+void DistTrainer::Train() {
+  // Get train Reader and test Reader
+  std::vector<Reader*> tr_reader;
+  tr_reader.push_back(reader_list_[0]);
+  std::vector<Reader*> te_reader;
+  if (reader_list_.size() == 2) {
+    te_reader.push_back(reader_list_[1]);
+  }
+  this->train(tr_reader, te_reader);
+}
+
+/*********************************************************
+ *  Cross-Validation                                     *
+ *********************************************************/
+void DistTrainer::CVTrain() {
+  // Use the i-th reader as validation Reader
+  for (int i = 0; i < reader_list_.size(); ++i) {
+    print_action(
+      StringPrintf("Cross-validation: %d/%lu:", 
+        i+1, reader_list_.size())
+    );
+    // Get the train Reader and test Reader
+    std::vector<Reader*> tr_reader;
+    for (int j = 0; j < reader_list_.size(); ++j) {
+      if (i == j) { continue; }
+      tr_reader.push_back(reader_list_[j]);
+    }
+    std::vector<Reader*> te_reader;
+    te_reader.push_back(reader_list_[i]);
+    if (i != 0) {
+      // Re-init current model parameters.
+      model_->Reset();
+    }
+    this->train(tr_reader, te_reader);
+  }
+  // Average metric for cross-validation
+  show_average_metric();
+}
+
+/*********************************************************
+ *  Calc average evaluation metric for CV                *
+ *********************************************************/
+void DistTrainer::show_average_metric() {
+  real_t loss = 0;
+  real_t metric = 0;
+  for (size_t i = 0; i < metric_info_.size(); ++i) {
+    loss += metric_info_[i].loss_val;
+    if (metric_ != nullptr) {
+      metric += metric_info_[i].metric_val;
+    }
+  }
+  print_info(
+    StringPrintf("Average %s: %.6f", 
+    loss_->loss_type().c_str(), 
+    loss / metric_info_.size())
+  );
+  if (metric_ != nullptr) {
+    print_info(
+      StringPrintf("Average %s: %.6f", 
+      metric_->metric_type().c_str(),
+       metric / metric_info_.size())
+    );
+  }
+}
+
+/*********************************************************
+ *  Basic train function                                 *
+ *********************************************************/
+void DistTrainer::train(std::vector<Reader*>& train_reader,
+                    std::vector<Reader*>& test_reader) {
+  int best_epoch = 0;
+  int stop_window = 0;
+  real_t best_loss = kFloatMax;
+  real_t prev_loss = kFloatMax;
+  MetricInfo te_info;
+  // Show header info
+  if (!quiet_) { 
+    show_head_info(!test_reader.empty()); 
+  }
+  for (int n = 1; n <= epoch_; ++n) {
+    Timer timer;
+    timer.tic();
+    // Calc grad and update model
+    real_t tr_loss = calc_gradient(train_reader);
+    // we don't do any evaluation in a quiet model
+    if (ps::MyRank() == 0) {
+      if (!quiet_) {
+        if (!test_reader.empty()) { 
+          te_info = calc_metric(test_reader); 
+        }
+        // show evaludation metric info
+        show_train_info(tr_loss, 
+            te_info.loss_val,
+            te_info.metric_val,
+            timer.toc(), 
+            !test_reader.empty(), 
+            n);
+        // Early-stopping
+        if (early_stop_) {
+          if (te_info.loss_val < best_loss) {
+            best_loss = te_info.loss_val;
+            best_epoch = n;
+            model_->SetBestModel();
+          }
+          if (te_info.loss_val >= prev_loss) {
+            stop_window++;
+            // If the validation loss goes up conntinuously
+            // in 3 epoch, we stop training
+            if (stop_window == kStopWindow) { break; }
+          } else {
+            stop_window = 0;
+          }
+          prev_loss = te_info.loss_val;
+        }
+      }
+      if (early_stop_ && best_epoch != epoch_) {  // not for cv
+        print_action(
+            StringPrintf("Early-stopping at epoch %d", best_epoch)
+            );
+        model_->Shrink();
+      } else {  // for cv
+        metric_info_.push_back(te_info);
+      }
+    }  // for ps::MyRank
+  }
+}
+
+/*********************************************************
+ *  Calc gradient and update model                       *
+ *********************************************************/
+real_t DistTrainer::calc_gradient(std::vector<Reader*>& reader) {
+  CHECK_NE(reader.empty(), true);
+  loss_->Reset();
+  for (int i = 0; i < reader.size(); ++i) {
+    reader[i]->Reset();
+    DMatrix* matrix = nullptr;
+    for (;;) {
+      index_t tmp = reader[i]->Samples(matrix);
+      if (tmp == 0) { break; }
+      loss_->CalcGrad(matrix, *model_);
+    }
+  }
+  return loss_->GetLoss();
+}
+
+/*********************************************************
+ *  Calc evaluation metric                               *
+ *********************************************************/
+MetricInfo DistTrainer::calc_metric(std::vector<Reader*>& reader_list) {
+  CHECK_NE(reader_list.empty(), true);
+  DMatrix* matrix = nullptr;
+  std::vector<real_t> pred;
+  if (metric_ != nullptr) {
+    metric_->Reset();
+  }
+  loss_->Reset();
+  for (int i = 0; i < reader_list.size(); ++i) {
+    reader_list[i]->Reset();
+    for (;;) {
+      index_t tmp = reader_list[i]->Samples(matrix);
+      if (tmp == 0) { break; }
+      if (tmp != pred.size()) { pred.resize(tmp); }
+      loss_->Predict(matrix, *model_, pred);
+      loss_->Evalute(pred, matrix->Y);
+      if (metric_ != nullptr) {
+        metric_->Accumulate(matrix->Y, pred);
+      }
+    }
+  }
+  MetricInfo info;
+  info.loss_val = loss_->GetLoss();
+  if (metric_ != nullptr) {
+    info.metric_val = metric_->GetMetric();
+  }
+  return info;
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_trainer.h b/src/distributed/dist_trainer.h
new file mode 100644
index 00000000..118778c2
--- /dev/null
+++ b/src/distributed/dist_trainer.h
@@ -0,0 +1,139 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+
+This file defines the Trainer class.
+*/
+
+#ifndef XLEARN_DIST_SOLVER_TRAINER_H_
+#define XLEARN_DIST_SOLVER_TRAINER_H_
+
+#include <vector>
+
+#include "src/base/common.h"
+#include "src/base/format_print.h"
+#include "src/reader/reader.h"
+#include "src/data/model_parameters.h"
+#include "src/distributed/dist_loss.h"
+#include "src/loss/metric.h"
+#include "ps/ps.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// Trainer is the core class of xLearn, which can perform
+// standard training process (training set and test set), as 
+// well as the cross-validation training process.
+//------------------------------------------------------------------------------
+class DistTrainer {
+ public:
+  // Constructor and Destructor
+  DistTrainer() {}
+  ~DistTrainer() {}
+
+  // Invoke this function before we use this class
+  void Initialize(std::vector<Reader*>& reader_list,
+                  int epoch,
+                  Model* model,
+                  DistLoss* loss,
+                  Metric* metric,
+                  bool early_stop,
+                  bool quiet) {
+    CHECK_NE(reader_list.empty(), true);
+    CHECK_GT(epoch, 0);
+    CHECK_NOTNULL(model);
+    CHECK_NOTNULL(loss);
+    // Do not check metric == nullptr
+    reader_list_ = reader_list;
+    epoch_ = epoch;
+    model_ = model;
+    loss_ = loss;
+    metric_ = metric;
+    early_stop_ = early_stop;
+    quiet_ = quiet;
+  }
+
+  // Training without cross-validation
+  void Train();
+
+  // Training using cross-validation
+  void CVTrain();
+
+  // Save model to disk file
+  void SaveModel(const std::string& filename) {
+    CHECK_NE(filename.empty(), true);
+    CHECK_NE(filename.compare("none"), 0);
+    model_->Serialize(filename);
+  }
+
+  // Save txt model to disk file
+  void SaveTxtModel(const std::string& filename) {
+    CHECK_NE(filename.empty(), true);
+    CHECK_NE(filename.compare("none"), 0);
+    model_->SerializeToTxt(filename);
+  }
+
+ protected:
+  /* The reader_list_ contains both of the 
+  training data and the validation data. */
+  std::vector<Reader*> reader_list_;
+  /* Number of epoch */
+  int epoch_;
+  /* Using early-stopping ? */
+  bool early_stop_;
+  /* quiet training ? */
+  bool quiet_;
+  /* Model parameter */
+  Model* model_;
+  /* Loss function */
+  DistLoss* loss_;
+  /* Evaluation metric */
+  Metric* metric_;
+  /* Store each metric info of cross-validation */
+  std::vector<MetricInfo> metric_info_;
+
+  // Basic train function
+  void train(std::vector<Reader*>& train_reader,
+             std::vector<Reader*>& test_reader);
+
+  // Caculate gradient and update model.
+  // Return training loss.
+  real_t calc_gradient(std::vector<Reader*>& reader_list);
+
+  // Calculate loss value and evaluation metric.
+  MetricInfo calc_metric(std::vector<Reader*>& reader_list);
+
+  // Calculate average metric for cross-validation
+  void show_average_metric();
+
+  // Print information during the training.
+  void show_head_info(bool validate);
+  void show_train_info(real_t tr_loss, 
+                       real_t te_loss,
+                       real_t te_metric,
+                       real_t time_cost, 
+                       bool validate,
+                       index_t epoch);
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistTrainer);
+};
+
+} // namespace xLearn
+
+#endif  // XLEARN_DIST_SOLVER_TRAINER_H_

From 2ae02e4ec6c6775359fd1592c07c02c3a868d767 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 11:45:14 +0800
Subject: [PATCH 65/82] update: server, init hyparamter

---
 src/distributed/dist_train_main.cc |  2 +-
 src/distributed/server.h           | 14 +++++++++++---
 2 files changed, 12 insertions(+), 4 deletions(-)

diff --git a/src/distributed/dist_train_main.cc b/src/distributed/dist_train_main.cc
index 2a5ec675..afb6db1b 100644
--- a/src/distributed/dist_train_main.cc
+++ b/src/distributed/dist_train_main.cc
@@ -33,7 +33,7 @@ This file is the entry for training of the xLearn.
 
 int main(int argc, char* argv[]) {
   if (ps::IsServer()) {
-    xlearn::XLearnServer* server = new xlearn::XLearnServer();
+    xlearn::XLearnServer* server = new xlearn::XLearnServer(argc, argv);
   }
 
   ps::Start();
diff --git a/src/distributed/server.h b/src/distributed/server.h
index 5426e421..895ccf1a 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -1,5 +1,7 @@
 #include "iostream"
 #include "src/base/math.h"
+#include "src/data/hyper_parameters.h"
+#include "src/distributed/dist_checker.h"
 #include "src/distributed/dist_score_function.h"
 #include "ps/ps.h"
 
@@ -152,8 +154,12 @@ struct KVServerFTRLHandle {
 
 class XLearnServer{
  public:
-  XLearnServer(){
+  XLearnServer(int argc, char* argv[]){
     auto server_ = new ps::KVServer<float>(0);
+    xLearn::HyperParam hyper_param_;
+    xLearn::DistChecker* checker_ = new xLearn::DistChecker;
+    checker_->Initialize(hyper_param_.is_train, argc, argv);
+    checker_->check_cmd(hyper_param_);
     /*
     if (opt_type_.compare("sgd") == 0) {
       server_->set_request_handle(KVServerSGDHandle());
@@ -162,9 +168,11 @@ class XLearnServer{
       server_->set_request_handle(KVServerAdaGradHandle());
     }
     */
-    //if (opt_type_.compare("ftrl") == 0) {
+    std::cout << hyper_param_.opt_type << std::endl;
+    std::cout << hyper_param_.alpha << std::endl;
+    if (hyper_param_.opt_type.compare("ftrl") == 0) {
       server_->set_request_handle(KVServerFTRLHandle());
-    //}
+    }
     std::cout << "init server success " << std::endl;
   }
   ~XLearnServer(){}

From 0227ac270cd236974c5b3c549873cdf9c795ea0d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 16:10:34 +0800
Subject: [PATCH 66/82] update: set v_dim by score_function

---
 src/distributed/server.h | 47 +++++++++++++++++++++++++++-------------
 1 file changed, 32 insertions(+), 15 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index 895ccf1a..e536f25d 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -13,13 +13,13 @@ float beta = 1.0;
 float lambda1 = 0.00001;
 float lambda2 = 2.0;
 
-float regu_lambda_ = 0.1;
-float learning_rate_ = 0.1;
+float regu_lambda = 0.1;
+float learning_rate = 0.1;
 
 int v_dim = 1;
 
 typedef struct SGDEntry{
-  SGDEntry(size_t k = 4) {
+  SGDEntry(size_t k = v_dim) {
     w.resize(k, 0.0);
   }
   std::vector<float> w;
@@ -43,8 +43,8 @@ struct KVServerSGDHandle {
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j) {
           float gradient = req_data.vals[i * v_dim + j];
-          gradient += regu_lambda_ * gradient;
-          val.w[j] -= learning_rate_ * gradient;
+          gradient += regu_lambda * gradient;
+          val.w[j] -= learning_rate * gradient;
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
@@ -52,6 +52,7 @@ struct KVServerSGDHandle {
         }
       }
     }
+    server->Response(req_meta, res);
   }
  private:
   std::unordered_map<ps::Key, sgdentry> store_;
@@ -84,9 +85,9 @@ struct KVServerAdaGradHandle {
       if (req_meta.push) {
         for (int j = 0; j < val.w.size(); ++j) {
           float gradient = req_data.vals[i * v_dim + j];
-          gradient += regu_lambda_ * gradient;
+          gradient += regu_lambda * gradient;
           val.n[j] = gradient * gradient;
-          val.w[j] -= (learning_rate_ * gradient * InvSqrt(val.n[j]));
+          val.w[j] -= (learning_rate * gradient * InvSqrt(val.n[j]));
         }
       } else {
         for (int j = 0; j < val.w.size(); ++j) {
@@ -94,6 +95,7 @@ struct KVServerAdaGradHandle {
         }
       }
     }
+    server->Response(req_meta, res);
   }
  private:
   std::unordered_map<ps::Key, adagradentry> store_;
@@ -156,20 +158,33 @@ class XLearnServer{
  public:
   XLearnServer(int argc, char* argv[]){
     auto server_ = new ps::KVServer<float>(0);
-    xLearn::HyperParam hyper_param_;
-    xLearn::DistChecker* checker_ = new xLearn::DistChecker;
+    checker_ = new xLearn::DistChecker;
     checker_->Initialize(hyper_param_.is_train, argc, argv);
     checker_->check_cmd(hyper_param_);
-    /*
-    if (opt_type_.compare("sgd") == 0) {
+
+    std::cout << hyper_param_.opt_type << std::endl;
+    std::cout << hyper_param_.auxiliary_size << std::endl;
+    std::cout << hyper_param_.score_func << std::endl;
+    alpha = hyper_param_.alpha;
+    beta = hyper_param_.beta;
+    lambda1 = hyper_param_.lambda_1;
+    lambda2 = hyper_param_.lambda_2;
+    regu_lambda = hyper_param_.regu_lambda;
+    learning_rate = hyper_param_.learning_rate;
+    if (hyper_param_.score_func.compare("linear") == 0) {
+      v_dim = 1;
+    }
+    if (hyper_param_.score_func.compare("fm")  == 0||
+        hyper_param_.score_func.compare("ffm") == 0) {
+      v_dim = hyper_param_.num_K;
+    }
+
+    if (hyper_param_.opt_type.compare("sgd") == 0) {
       server_->set_request_handle(KVServerSGDHandle());
     }
-    if (opt_type_.compare("adagrad") == 0) {
+    if (hyper_param_.opt_type.compare("adagrad") == 0) {
       server_->set_request_handle(KVServerAdaGradHandle());
     }
-    */
-    std::cout << hyper_param_.opt_type << std::endl;
-    std::cout << hyper_param_.alpha << std::endl;
     if (hyper_param_.opt_type.compare("ftrl") == 0) {
       server_->set_request_handle(KVServerFTRLHandle());
     }
@@ -177,5 +192,7 @@ class XLearnServer{
   }
   ~XLearnServer(){}
   ps::KVServer<float>* server_;
+  xLearn::HyperParam hyper_param_;
+  xLearn::DistChecker* checker_;
 };//end class Server
 }

From 24f86313f96ee13b0056252bb6f04c95385c53db Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 16:10:48 +0800
Subject: [PATCH 67/82] update: run_xlearn_dist_train.sh

---
 scripts/run_xlearn_dist_train.sh | 4 +++-
 1 file changed, 3 insertions(+), 1 deletion(-)

diff --git a/scripts/run_xlearn_dist_train.sh b/scripts/run_xlearn_dist_train.sh
index 947dce1a..02f6bcc5 100644
--- a/scripts/run_xlearn_dist_train.sh
+++ b/scripts/run_xlearn_dist_train.sh
@@ -1,7 +1,9 @@
 #! /bin/sh
 
 echo "=====================================BigDataLR================================="
-sh local.sh 1 3 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/test/distributed/dist_xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+sh local.sh 1 3 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/test/distributed/dist_xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p sgd -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#sh local.sh 1 3 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/test/distributed/dist_xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p adagrad -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
+#sh local.sh 1 3 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/test/distributed/dist_xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 0 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
 #echo "=====================================BigDataFM================================="
 #sh local.sh 1 1 /Users/xiaoshuwang/documents/oneflow/opensource/xlearn/xlearn_build/xlearn_train ~/documents/data/libffm_toy/criteo.tr.r100.gbdt0.ffm -v ~/documents/data/libffm_toy/criteo.va.r100.gbdt0.ffm -s 1 -x auc --dis-es -p ftrl -alpha 5e-2 -beta 1.0 -lambda_1 5e-5 -lambda_2 15.0 --no-norm
 #echo "=====================================BigDataFFM==============================="

From 16dd0235fd9d0f9cbca56f514e870ec34e703e8d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 16:15:52 +0800
Subject: [PATCH 68/82] update: server.h

---
 src/distributed/server.h | 10 ++++------
 1 file changed, 4 insertions(+), 6 deletions(-)

diff --git a/src/distributed/server.h b/src/distributed/server.h
index e536f25d..8b7c75f1 100644
--- a/src/distributed/server.h
+++ b/src/distributed/server.h
@@ -59,7 +59,7 @@ struct KVServerSGDHandle {
 };
 
 typedef struct AdaGradEntry {
-  AdaGradEntry(size_t k = 4) {
+  AdaGradEntry(size_t k = v_dim) {
     w.resize(k, 0.0);
     n.resize(k, 0.0);
   }
@@ -102,7 +102,7 @@ struct KVServerAdaGradHandle {
 };
 
 typedef struct FTRLEntry{
-  FTRLEntry(size_t k = 4) {
+  FTRLEntry(size_t k = v_dim) {
     w.resize(k, 0.0);
     n.resize(k, 0.0);
     z.resize(k, 0.0);
@@ -162,19 +162,17 @@ class XLearnServer{
     checker_->Initialize(hyper_param_.is_train, argc, argv);
     checker_->check_cmd(hyper_param_);
 
-    std::cout << hyper_param_.opt_type << std::endl;
-    std::cout << hyper_param_.auxiliary_size << std::endl;
-    std::cout << hyper_param_.score_func << std::endl;
     alpha = hyper_param_.alpha;
     beta = hyper_param_.beta;
     lambda1 = hyper_param_.lambda_1;
     lambda2 = hyper_param_.lambda_2;
     regu_lambda = hyper_param_.regu_lambda;
     learning_rate = hyper_param_.learning_rate;
+
     if (hyper_param_.score_func.compare("linear") == 0) {
       v_dim = 1;
     }
-    if (hyper_param_.score_func.compare("fm")  == 0||
+    if (hyper_param_.score_func.compare("fm")  == 0 ||
         hyper_param_.score_func.compare("ffm") == 0) {
       v_dim = hyper_param_.num_K;
     }

From aab2a88d1cb8bd7c1626398cb718f858d4823f9f Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 16:16:14 +0800
Subject: [PATCH 69/82] add: gitignore

---
 .gitignore | 6 ++++++
 1 file changed, 6 insertions(+)

diff --git a/.gitignore b/.gitignore
index 7f325e52..d6477cef 100644
--- a/.gitignore
+++ b/.gitignore
@@ -46,3 +46,9 @@ build/*
 .Rhistory
 *.tar.gz
 xlearn/*
+
+# Python-package
+.pyc
+build_cpp/
+compile/
+xlearn.egg-info/

From cc6e25214e81c1e06a357d5eaa5d593c91e18002 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 16:19:38 +0800
Subject: [PATCH 70/82] add: python package

---
 .gitignore | 8 ++++----
 1 file changed, 4 insertions(+), 4 deletions(-)

diff --git a/.gitignore b/.gitignore
index d6477cef..910e9b27 100644
--- a/.gitignore
+++ b/.gitignore
@@ -48,7 +48,7 @@ build/*
 xlearn/*
 
 # Python-package
-.pyc
-build_cpp/
-compile/
-xlearn.egg-info/
+*.pyc
+python-package/build_cpp/
+python-package/compile/
+python-package/xlearn.egg-info/

From 02c3da321faa0ce7bcddba72695de343a97e832d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 24 Dec 2017 21:44:16 +0800
Subject: [PATCH 71/82] update: gitignore

---
 .gitignore | 3 ---
 1 file changed, 3 deletions(-)

diff --git a/.gitignore b/.gitignore
index 910e9b27..ca9063a2 100644
--- a/.gitignore
+++ b/.gitignore
@@ -49,6 +49,3 @@ xlearn/*
 
 # Python-package
 *.pyc
-python-package/build_cpp/
-python-package/compile/
-python-package/xlearn.egg-info/

From 626d4786e148d962625fecf6b209b62e180cb2ca Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Mon, 25 Dec 2017 20:57:20 +0800
Subject: [PATCH 72/82] rm: shared lib in distributed

---
 src/distributed/CMakeLists.txt | 4 ----
 1 file changed, 4 deletions(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index aded038d..956a8f80 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -4,9 +4,5 @@ set(STA_DEPS data base pslite protobuf zmq)
 add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
 target_link_libraries(distributed ${STA_DEPS})
 
-set(SHA_DEPS data_shared base_shared pslite protobuf zmq)
-add_library(distributed_shared SHARED dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
-target_link_libraries(distributed_shared ${SHA_DEPS})
-
 add_executable(dist_xlearn_train dist_train_main.cc dist_solver.cc dist_trainer.cc dist_inference.cc)
 target_link_libraries(dist_xlearn_train solver distributed)

From 484c8bfd15d54b521a2c66877f969c65c9abcf57 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 26 Dec 2017 18:59:37 +0800
Subject: [PATCH 73/82] update: distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index 956a8f80..393bf99b 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,4 +1,4 @@
-set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR}/test/distributed)
+set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR})
 
 set(STA_DEPS data base pslite protobuf zmq)
 add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
@@ -6,3 +6,8 @@ target_link_libraries(distributed ${STA_DEPS})
 
 add_executable(dist_xlearn_train dist_train_main.cc dist_solver.cc dist_trainer.cc dist_inference.cc)
 target_link_libraries(dist_xlearn_train solver distributed)
+
+install(TARGETS distributed DESTINATION lib/distributed)
+FILE(GLOB HEADER_FILES "${CMAKE_CURRENT_SOURCE_DIR}/*.h")
+message(${HEADER_FILES})
+install(FILES ${HEADER_FILES} DESTINATION include/distributed)

From ab8c10171af6b5b19d5598fa91d671eea37283c8 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 26 Dec 2017 18:59:59 +0800
Subject: [PATCH 74/82] add: dist_ffm header files

---
 src/distributed/dist_score_function.cc | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
index 99369f34..adce9b2b 100644
--- a/src/distributed/dist_score_function.cc
+++ b/src/distributed/dist_score_function.cc
@@ -21,6 +21,7 @@ This file is the implementation of the base Score class.
 
 #include "src/distributed/dist_score_function.h"
 #include "src/distributed/dist_linear_score.h"
+#include "src/distributed/dist_fm_score.h"
 
 namespace xLearn {
 
@@ -29,5 +30,6 @@ namespace xLearn {
 //------------------------------------------------------------------------------
 CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_dist_score_registry, DistScore);
 REGISTER_SCORE("dist_linear", DistLinearScore);
+REGISTER_SCORE("dist_fm", DistFMScore);
 
 }  // namespace xLearn

From 328d220e2f9bd9dc8c6305d514b0f243da4bb381 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 26 Dec 2017 19:00:20 +0800
Subject: [PATCH 75/82] add: dist_fm_score

---
 src/distributed/dist_fm_score.cc | 301 +++++++++++++++++++++++++++++++
 src/distributed/dist_fm_score.h  | 105 +++++++++++
 2 files changed, 406 insertions(+)
 create mode 100644 src/distributed/dist_fm_score.cc
 create mode 100644 src/distributed/dist_fm_score.h

diff --git a/src/distributed/dist_fm_score.cc b/src/distributed/dist_fm_score.cc
new file mode 100644
index 00000000..bf0da51f
--- /dev/null
+++ b/src/distributed/dist_fm_score.cc
@@ -0,0 +1,301 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of FMScore class.
+*/
+
+#include <pmmintrin.h>  // for SSE
+
+#include "src/distributed/dist_fm_score.h"
+#include "src/base/math.h"
+
+namespace xLearn {
+
+// y = sum( (V_i*V_j)(x_i * x_j) )
+// Using SSE to accelerate vector operation.
+  real_t DistFMScore::CalcScore(const SparseRow* row,
+      std::map<index_t, real_t>* weight,
+      std::map<index_t, std::vector<real_t>>* v,
+      real_t norm = 1.0
+      ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sqrt_norm = sqrt(norm);
+  real_t t = 0;
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    t += (iter->feat_val *
+          weight[iter->feat_id] *
+          sqrt_norm);
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t aligned_k = model.get_aligned_k();
+  std::vector<real_t> sv(aligned_k, 0);
+  real_t* s = sv.data();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t *w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    real_t* s = v[j1].data();
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 const XMMw = _mm_load_ps(w+d);
+      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+      _mm_store_ps(s+d, XMMs);
+    }
+  }
+  __m128 XMMt = _mm_set1_ps(0.0f);
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t* w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 XMMw = _mm_load_ps(w+d);
+      __m128 XMMwv = _mm_mul_ps(XMMw, XMMv);
+      XMMt = _mm_add_ps(XMMt,
+         _mm_mul_ps(XMMwv, _mm_sub_ps(XMMs, XMMwv)));
+    }
+  }
+  XMMt = _mm_hadd_ps(XMMt, XMMt);
+  XMMt = _mm_hadd_ps(XMMt, XMMt);
+  real_t t_all;
+  _mm_store_ss(&t_all, XMMt);
+  t_all *= 0.5;
+  t_all += t;
+  return t_all;
+}
+
+// Calculate gradient and update current model parameters.
+// Using SSE to accelerate vector operation.
+void DistFMScore::CalcGrad(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  // Using sgd
+  if (opt_type_.compare("sgd") == 0) {
+    this->calc_grad_sgd(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+  // Using adagrad
+  else if (opt_type_.compare("adagrad") == 0) {
+    this->calc_grad_adagrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+  // Using ftrl 
+  else if (opt_type_.compare("ftrl") == 0) {
+    this->calc_grad_ftrl(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+}
+
+// Calculate gradient and update current model using sgd
+void DistFMScore::calc_grad_sgd(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/  
+  real_t sqrt_norm = sqrt(norm);
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    real_t &wl = weight[iter->feat_id];
+    real_t g = pg*iter->feat_val*sqrt_norm;
+    w_g[iter->feat_id] += g;
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t aligned_k = model.get_aligned_k();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMlr = _mm_set1_ps(learning_rate_);
+  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+  std::vector<real_t> sv(aligned_k, 0);
+  real_t* s = sv.data();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t* w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 const XMMw = _mm_load_ps(w+d);
+      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+      _mm_store_ps(s+d, XMMs);
+    }
+  }
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t* w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+    real_t* v_gradient = v_g[j1].data();
+    for(index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 XMMw = _mm_load_ps(w+d);
+      __m128 XMMg = _mm_add_ps(_mm_mul_ps(XMMlamb, XMMw),
+        _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
+        _mm_mul_ps(XMMw, XMMv))));
+      _mm_store_ps(v_gradient+d, XMMg);
+    }
+  }
+}
+
+// Calculate gradient and update current model using adagrad
+void DistFMScore::calc_grad_adagrad(const DMatrix* matrix,
+    std::map<index_t, real_t>& weight,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sqrt_norm = sqrt(norm);
+  for (SparseRow::const_iterator iter = row->begin();
+      iter != row->end(); ++iter) {
+    real_t &wl = weight[iter->feat_id];
+    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
+    w_g[iter->feat_id] += g;
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t aligned_k = model.get_aligned_k();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMlr = _mm_set1_ps(learning_rate_);
+  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+  std::vector<real_t> sv(aligned_k, 0);
+  real_t* s = sv.data();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t *w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 const XMMw = _mm_load_ps(w+d);
+      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+      _mm_store_ps(s+d, XMMs);
+    }
+  }
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t* w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+    real_t* v_gradient = v_g[j1].data();
+    for(index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 XMMg = _mm_add_ps(_mm_mul_ps(XMMlamb, XMMw),
+      _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
+        _mm_mul_ps(XMMw, XMMv))));
+      _mm_store_ps(v_gradient+d, XMMpgv);
+    }
+  }
+}
+
+// Calculate gradient and update current model using ftrl
+void DistFMScore::calc_grad_ftrl(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sqrt_norm = sqrt(norm);
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    real_t g = pg*iter->feat_val*sqrt_norm; 
+    w_g[iter->feat_id] += g;
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t aligned_k = model.get_aligned_k();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMalpha = _mm_set1_ps(alpha_);
+  __m128 XMML2 = _mm_set1_ps(lambda_2_);
+  std::vector<real_t> sv(aligned_k, 0);
+  real_t* s = sv.data();
+ for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t *w = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 const XMMw = _mm_load_ps(w+d);
+      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+      _mm_store_ps(s+d, XMMs);
+    }
+  }
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    index_t j1 = iter->feat_id;
+    real_t v1 = iter->feat_val;
+    real_t *w_base = v[j1].data();
+    __m128 XMMv = _mm_set1_ps(v1*norm);
+    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+    real_t* v_gradient = v_g[j1].data();
+    for (index_t d = 0; d < aligned_k; d += kAlign) {
+      real_t* w = w_base + d;
+      __m128 XMMs = _mm_load_ps(s+d);
+      __m128 XMMw = _mm_load_ps(w);
+      __m128 XMMg = _mm_add_ps(
+                    _mm_mul_ps(XMML2, XMMw),
+                    _mm_mul_ps(XMMpgv,
+                    _mm_sub_ps(XMMs,
+                      _mm_mul_ps(XMMw, XMMv))));
+      // Update w. SSE mat not faster.
+      __mm_store_ps(v_gradient+d, XMMg);
+    }
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_fm_score.h b/src/distributed/dist_fm_score.h
new file mode 100644
index 00000000..c69e622e
--- /dev/null
+++ b/src/distributed/dist_fm_score.h
@@ -0,0 +1,105 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the FMrScore (factorization machine) class.
+*/
+
+#ifndef XLEARN_DIST_FM_SCORE_H_
+#define XLEARN_DIST_FM_SCORE_H_
+
+#include "src/base/common.h"
+#include "src/data/model_parameters.h"
+#include "src/distributed/dist_score_function.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// FMScore is used to implemente factorization machines, in which
+// the socre function is y = sum( (V_i*V_j)(x_i * x_j) )
+// Here we leave out the linear term and bias term.
+//------------------------------------------------------------------------------
+class DistFMScore : public DistScore {
+ public:
+  // Constructor and Desstructor
+  DistFMScore() { }
+  ~DistFMScore() { }
+
+  // Given one exmaple and current model, this method
+  // returns the fm score.
+  real_t CalcScore(const SparseRow* row,
+                   std::map<index_t, real_t>* w,
+                   std::map<index_t, std::vector<real_t>>* v,
+                   real_t norm = 1.0);
+
+  // Calculate gradient and update current
+  // model parameters.
+  void DistCalcGrad(const DMatrix* matrix,
+                    std::map<index_t, real_t>& w,
+                    std::map<index_t, std::vector<real_t>>* v,
+                    real_t* sum,
+                    std::map<index_t, real_t>& w_g,
+                    std::map<index_t, real_t>& v_g,
+                    index_t start_idx,
+                    index_t end_idx
+                   );
+
+ protected:
+  // Calculate gradient and update model using sgd
+  void calc_grad_sgd(const DMatrix* matrix,
+                     std::map<index_t, real_t>& w,
+                     std::map<index_t, std::vector<real_t>>* v,
+                     real_t* sum,
+                     std::map<index_t, real_t>& w_g,
+                     std::map<index_t, real_t>& v_g,
+                     real_t start_idx,
+                     real_t end_idx
+                    );
+
+  // Calculate gradient and update model using adagrad
+  void calc_grad_adagrad(const DMatrix* matrix,
+                         std::map<index_t, real_t>& w,
+                         std::map<index_t, std::vector<real_t>>* v,
+                         real_t* sum,
+                         std::map<index_t, real_t>& w_g,
+                         std::map<index_t, real_t>& v_g,
+                         real_t start_idx,
+                         real_t end_idx
+                        );
+
+  // Calculate gradient and update model using ftrl
+  void calc_grad_ftrl(const DMatrix* matrix,
+                      std::map<index_t, real_t>& w,
+                      std::map<index_t, std::vector<real_t>>* v,
+                      real_t* sum,
+                      std::map<index_t, real_t>& w_g,
+                      std::map<index_t, real_t>& v_g,
+                      real_t start_idx,
+                      real_t end_idx
+                      );
+ private:
+  real_t* comp_res = nullptr;
+  real_t* comp_z_lt_zero = nullptr;
+  real_t* comp_z_gt_zero = nullptr;
+
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistFMScore);
+};
+
+} // namespace xLearn
+
+#endif // XLEARN_DIST_FM_SCORE_H_

From d21ce6071906fd79df165fc8749cf280942ee028 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Tue, 26 Dec 2017 19:00:35 +0800
Subject: [PATCH 76/82] add: dist_ffm

---
 src/distributed/dist_ffm_score.cc | 412 ++++++++++++++++++++++++++++++
 src/distributed/dist_ffm_score.h  | 108 ++++++++
 2 files changed, 520 insertions(+)
 create mode 100644 src/distributed/dist_ffm_score.cc
 create mode 100644 src/distributed/dist_ffm_score.h

diff --git a/src/distributed/dist_ffm_score.cc b/src/distributed/dist_ffm_score.cc
new file mode 100644
index 00000000..92c49adb
--- /dev/null
+++ b/src/distributed/dist_ffm_score.cc
@@ -0,0 +1,412 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file is the implementation of FFMScore class.
+*/
+
+#include <pmmintrin.h>  // for SSE
+
+#include "src/score/ffm_score.h"
+#include "src/base/math.h"
+
+namespace xLearn {
+
+// y = sum( (V_i_fj*V_j_fi)(x_i * x_j) )
+// Using SSE to accelerate vector operation.
+  real_t DistFFMScore::CalcScore(const SparseRow* row,
+      std::map<index_t, real_t>* weight,
+      std::map<index_t, std::vector<real_t>>* v,
+      real_t norm = 1.0
+      ) {
+    /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sum_w = 0;
+  real_t sqrt_norm = sqrt(norm);
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    sum_w += (iter->feat_val * 
+              weight[iter->feat_id] * 
+              sqrt_norm);
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t align0 = aux_size * model.get_aligned_k();
+  index_t align1 = model.GetNumField() * align0;
+  //int align = kAlign * aux_size;
+  //w = model.GetParameter_v();
+  __m128 XMMt = _mm_setzero_ps();
+  for (SparseRow::const_iterator iter_i = row->begin();
+       iter_i != row->end(); ++iter_i) {
+    index_t j1 = iter_i->feat_id;
+    index_t f1 = iter_i->field_id;
+    real_t v1 = iter_i->feat_val;
+    for (SparseRow::const_iterator iter_j = iter_i+1;
+         iter_j != row->end(); ++iter_j) {
+      index_t j2 = iter_j->feat_id;
+      index_t f2 = iter_j->field_id;
+      real_t v2 = iter_j->feat_val;
+      real_t* w1_base = v[j1].data();
+      real_t* w2_base = v[j2].data();
+      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
+      for (index_t d = 0; d < align0; d += align) {
+        __m128 XMMw1 = _mm_load_ps(w1_base + d);
+        __m128 XMMw2 = _mm_load_ps(w2_base + d);
+        XMMt = _mm_add_ps(XMMt,
+               _mm_mul_ps(
+               _mm_mul_ps(XMMw1, XMMw2), XMMv));
+      }
+    }
+  }
+  real_t sum_v = 0;
+  XMMt = _mm_hadd_ps(XMMt, XMMt);
+  XMMt = _mm_hadd_ps(XMMt, XMMt);
+  _mm_store_ss(&sum_v, XMMt);
+
+  return sum_v + sum_w;
+}
+
+// Calculate gradient and update current model.
+// Using the SSE to accelerate vector operation.
+void DistFFMScore::CalcGrad(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, real_t>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  // Using sgd
+  if (opt_type_.compare("sgd") == 0) {
+    this->calc_grad_sgd(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+  // Using adagrad
+  else if (opt_type_.compare("adagrad") == 0) {
+    this->calc_grad_adagrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+  // Using ftrl 
+  else if (opt_type_.compare("ftrl") == 0) {
+    this->calc_grad_ftrl(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  }
+}
+
+// Calculate gradient and update current model using sgd
+void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sqrt_norm = sqrt(norm);
+  real_t *w = model.GetParameter_w();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    real_t &wl = w[iter->feat_id];
+    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
+    wl -= (learning_rate_ * g);
+  }
+  // bias
+  w = model.GetParameter_b();
+  real_t &wb = w[0];
+  real_t g = pg;
+  wb -= (learning_rate_ * g);
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t align0 = model.GetAuxiliarySize() * model.get_aligned_k();
+  index_t align1 = model.GetNumField() * align0;
+  index_t align = kAlign * model.GetAuxiliarySize();
+  w = model.GetParameter_v();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMlr = _mm_set1_ps(learning_rate_);
+  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+  for (SparseRow::const_iterator iter_i = row->begin();
+       iter_i != row->end(); ++iter_i) {
+    index_t j1 = iter_i->feat_id;
+    index_t f1 = iter_i->field_id;
+    real_t v1 = iter_i->feat_val;
+    for (SparseRow::const_iterator iter_j = iter_i+1;
+         iter_j != row->end(); ++iter_j) {
+      index_t j2 = iter_j->feat_id;
+      index_t f2 = iter_j->field_id;
+      real_t v2 = iter_j->feat_val;
+      real_t* w1_base = w + j1*align1 + f2*align0;
+      real_t* w2_base = w + j2*align1 + f1*align0;
+      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
+      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+      for (index_t d = 0; d < align0; d += align) {
+        real_t *w1 = w1_base + d;
+        real_t *w2 = w2_base + d;
+        __m128 XMMw1 = _mm_load_ps(w1);
+        __m128 XMMw2 = _mm_load_ps(w2);
+        __m128 XMMg1 = _mm_add_ps(
+                       _mm_mul_ps(XMMlamb, XMMw1),
+                       _mm_mul_ps(XMMpgv, XMMw2));
+        __m128 XMMg2 = _mm_add_ps(
+                       _mm_mul_ps(XMMlamb, XMMw2),
+                       _mm_mul_ps(XMMpgv, XMMw1));
+        XMMw1 = _mm_sub_ps(XMMw1, _mm_mul_ps(XMMlr, XMMg1));
+        XMMw2 = _mm_sub_ps(XMMw2, _mm_mul_ps(XMMlr, XMMg2));
+        _mm_store_ps(w1, XMMw1);
+        _mm_store_ps(w2, XMMw2);
+      }
+    }
+  }
+
+}
+
+// Calculate gradient and update current model using adagrad
+void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/
+  real_t sqrt_norm = sqrt(norm);
+  real_t *w = model.GetParameter_w();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    real_t &wl = w[iter->feat_id*2];
+    real_t &wlg = w[iter->feat_id*2+1];
+    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
+    wlg += g*g;
+    wl -= learning_rate_ * g * InvSqrt(wlg);
+  }
+  // bias
+  w = model.GetParameter_b();
+  real_t &wb = w[0];
+  real_t &wbg = w[1];
+  real_t g = pg;
+  wbg += g*g;
+  wb -= learning_rate_ * g * InvSqrt(wbg);
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t align0 = 2 * model.get_aligned_k();
+  index_t align1 = model.GetNumField() * align0;
+  index_t align = kAlign * 2;
+  w = model.GetParameter_v();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMlr = _mm_set1_ps(learning_rate_);
+  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+  for (SparseRow::const_iterator iter_i = row->begin();
+       iter_i != row->end(); ++iter_i) {
+    index_t j1 = iter_i->feat_id;
+    index_t f1 = iter_i->field_id;
+    real_t v1 = iter_i->feat_val;
+    for (SparseRow::const_iterator iter_j = iter_i+1;
+         iter_j != row->end(); ++iter_j) {
+      index_t j2 = iter_j->feat_id;
+      index_t f2 = iter_j->field_id;
+      real_t v2 = iter_j->feat_val;
+      real_t* w1_base = w + j1*align1 + f2*align0;
+      real_t* w2_base = w + j2*align1 + f1*align0;
+      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
+      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+      for (index_t d = 0; d < align0; d += align) {
+        real_t *w1 = w1_base + d;
+        real_t *w2 = w2_base + d;
+        real_t *wg1 = w1 + kAlign;
+        real_t *wg2 = w2 + kAlign;
+        __m128 XMMw1 = _mm_load_ps(w1);
+        __m128 XMMw2 = _mm_load_ps(w2);
+        __m128 XMMwg1 = _mm_load_ps(wg1);
+        __m128 XMMwg2 = _mm_load_ps(wg2);
+        __m128 XMMg1 = _mm_add_ps(
+                       _mm_mul_ps(XMMlamb, XMMw1),
+                       _mm_mul_ps(XMMpgv, XMMw2));
+        __m128 XMMg2 = _mm_add_ps(
+                       _mm_mul_ps(XMMlamb, XMMw2),
+                       _mm_mul_ps(XMMpgv, XMMw1));
+        XMMwg1 = _mm_add_ps(XMMwg1, _mm_mul_ps(XMMg1, XMMg1));
+        XMMwg2 = _mm_add_ps(XMMwg2, _mm_mul_ps(XMMg2, XMMg2));
+        XMMw1 = _mm_sub_ps(XMMw1, _mm_mul_ps(XMMlr,
+                _mm_mul_ps(_mm_rsqrt_ps(XMMwg1), XMMg1)));
+        XMMw2 = _mm_sub_ps(XMMw2, _mm_mul_ps(XMMlr,
+                _mm_mul_ps(_mm_rsqrt_ps(XMMwg2), XMMg2)));
+        _mm_store_ps(w1, XMMw1);
+        _mm_store_ps(w2, XMMw2);
+        _mm_store_ps(wg1, XMMwg1);
+        _mm_store_ps(wg2, XMMwg2);
+      }
+    }
+  }
+}
+
+// Calculate gradient and update current model using ftrl
+void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
+    std::map<index_t, real_t>& w,
+    std::map<index_t, std::vector<real_t>>* v,
+    real_t* sum,
+    std::map<index_t, real_t>& w_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
+    index_t start_idx,
+    index_t end_idx
+    ) {
+  /*********************************************************
+   *  linear term and bias term                            *
+   *********************************************************/  
+  real_t sqrt_norm = sqrt(norm);
+  real_t *w = model.GetParameter_w();
+  for (SparseRow::const_iterator iter = row->begin();
+       iter != row->end(); ++iter) {
+    real_t &wl = w[iter->feat_id*3];
+    real_t &wlg = w[iter->feat_id*3+1];
+    real_t &wlz = w[iter->feat_id*3+2];
+    real_t g = lambda_2_*wl+pg*iter->feat_val*sqrt_norm; 
+    real_t old_wlg = wlg;
+    wlg += g*g;
+    real_t sigma = (sqrt(wlg)-sqrt(old_wlg)) / alpha_;
+    wlz += (g-sigma*wl);
+    int sign = wlz > 0 ? 1:-1;
+    if (sign*wlz <= lambda_1_) {
+      wl = 0;
+    } else {
+      wl = (sign*lambda_1_-wlz) / 
+           ((beta_ + sqrt(wlg)) / 
+            alpha_ + lambda_2_);
+    }
+  }
+  // bias
+  w = model.GetParameter_b();
+  real_t &wb = w[0];
+  real_t &wbg = w[1];
+  real_t &wbz = w[2];
+  real_t g = pg;
+  real_t old_wbg = wbg;
+  wbg += g*g;
+  real_t sigma = (sqrt(wbg)-sqrt(old_wbg)) / alpha_;
+  wbz += (g-sigma*wb);
+  int sign = wbz > 0 ? 1:-1;
+  if (sign*wbz <= lambda_1_) {
+    wb = 0;
+  } else {
+    wb = (sign*lambda_1_-wbz) / 
+         ((beta_ + sqrt(wbg)) / 
+          alpha_ + lambda_2_);
+  }
+  /*********************************************************
+   *  latent factor                                        *
+   *********************************************************/
+  index_t align0 = 3 * model.get_aligned_k();
+  index_t align1 = model.GetNumField() * align0;
+  index_t align = kAlign * 3;
+  w = model.GetParameter_v();
+  __m128 XMMpg = _mm_set1_ps(pg);
+  __m128 XMMalpha = _mm_set1_ps(alpha_);
+  __m128 XMML2 = _mm_set1_ps(lambda_2_);
+  for (SparseRow::const_iterator iter_i = row->begin();
+       iter_i != row->end(); ++iter_i) {
+    index_t j1 = iter_i->feat_id;
+    index_t f1 = iter_i->field_id;
+    real_t v1 = iter_i->feat_val;
+    for (SparseRow::const_iterator iter_j = iter_i+1;
+         iter_j != row->end(); ++iter_j) {
+      index_t j2 = iter_j->feat_id;
+      index_t f2 = iter_j->field_id;
+      real_t v2 = iter_j->feat_val;
+      real_t* w1_base = w + j1*align1 + f2*align0;
+      real_t* w2_base = w + j2*align1 + f1*align0;
+      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
+      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+      for (index_t d = 0; d < align0; d += align) {
+        real_t *w1 = w1_base + d;
+        real_t *w2 = w2_base + d;
+        real_t *wg1 = w1 + kAlign;
+        real_t *wg2 = w2 + kAlign;
+        real_t *z1 = w1 + kAlign * 2;
+        real_t *z2 = w2 + kAlign * 2;
+        __m128 XMMw1 = _mm_load_ps(w1);
+        __m128 XMMw2 = _mm_load_ps(w2);
+        __m128 XMMwg1 = _mm_load_ps(wg1);
+        __m128 XMMwg2 = _mm_load_ps(wg2);
+        __m128 XMMz1 = _mm_load_ps(z1);
+        __m128 XMMz2 = _mm_load_ps(z2);
+        __m128 XMMg1 = _mm_add_ps(
+                       _mm_mul_ps(XMML2, XMMw1),
+                       _mm_mul_ps(XMMpgv, XMMw2));
+        __m128 XMMg2 = _mm_add_ps(
+                       _mm_mul_ps(XMML2, XMMw2),
+                       _mm_mul_ps(XMMpgv, XMMw1));
+        __m128 XMMsigma1 = _mm_div_ps(
+                           _mm_sub_ps(
+                           _mm_sqrt_ps(
+                           _mm_add_ps(XMMwg1,
+                           _mm_mul_ps(XMMg1, XMMg1))),
+                           _mm_sqrt_ps(XMMwg1)), XMMalpha);
+        __m128 XMMsigma2 = _mm_div_ps(
+                           _mm_sub_ps(
+                           _mm_sqrt_ps(
+                           _mm_add_ps(XMMwg2,
+                           _mm_mul_ps(XMMg2, XMMg2))),
+                           _mm_sqrt_ps(XMMwg2)), XMMalpha);
+        XMMz1 = _mm_add_ps(XMMz1,
+                _mm_sub_ps(XMMg1,
+                _mm_mul_ps(XMMsigma1, XMMw1)));
+        XMMz2 = _mm_add_ps(XMMz2,
+                _mm_sub_ps(XMMg2,
+                _mm_mul_ps(XMMsigma2, XMMw2)));
+        _mm_store_ps(z1, XMMz1);
+        _mm_store_ps(z2, XMMz2);
+        XMMwg1 = _mm_add_ps(XMMwg1,
+                 _mm_mul_ps(XMMg1, XMMg1));
+        XMMwg2 = _mm_add_ps(XMMwg2,
+                 _mm_mul_ps(XMMg2, XMMg2));
+        _mm_store_ps(wg1, XMMwg1);
+        _mm_store_ps(wg2, XMMwg2);
+        // Update w. SSE may not faster
+        for (size_t i = 0; i < kAlign; ++i) {
+          // w1
+          real_t z1_value = *(z1+i);
+          int sign = z1_value > 0 ? 1 : -1;
+          if (sign * z1_value <= lambda_1_) {
+            *(w1+i) = 0;
+          } else {
+            *(w1+i) = (sign*lambda_1_-z1_value) / 
+              ((beta_ + sqrt(*(wg1+i))) / alpha_ + lambda_2_);
+          }
+          // w2
+          real_t z2_value = *(z2+i);
+          sign = z2_value > 0 ? 1 : -1;
+          if (sign * z2_value <= lambda_1_) {
+            *(w2+i) = 0;
+          } else {
+            *(w2+i) = (sign*lambda_1_-z2_value) / 
+              ((beta_ + sqrt(*(wg2+i))) / alpha_ + lambda_2_);
+          }
+        }
+      }
+    }
+  }
+}
+
+} // namespace xLearn
diff --git a/src/distributed/dist_ffm_score.h b/src/distributed/dist_ffm_score.h
new file mode 100644
index 00000000..ab548dff
--- /dev/null
+++ b/src/distributed/dist_ffm_score.h
@@ -0,0 +1,108 @@
+//------------------------------------------------------------------------------
+// Copyright (c) 2016 by contributors. All Rights Reserved.
+//
+// Licensed under the Apache License, Version 2.0 (the "License");
+// you may not use this file except in compliance with the License.
+// You may obtain a copy of the License at
+//
+//     http://www.apache.org/licenses/LICENSE-2.0
+//
+// Unless required by applicable law or agreed to in writing, software
+// distributed under the License is distributed on an "AS IS" BASIS,
+// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
+// See the License for the specific language governing permissions and
+// limitations under the License.
+//------------------------------------------------------------------------------
+
+/*
+Author: Chao Ma (mctt90@gmail.com)
+This file defines the FFMScore (field-aware factorization machine) class.
+*/
+
+#ifndef XLEARN_DIST_FFM_SCORE_H_
+#define XLEARN_DIST_FFM_SCORE_H_
+
+#include "src/base/common.h"
+#include "src/distributed/dist_score_function.h"
+
+namespace xLearn {
+
+//------------------------------------------------------------------------------
+// FFMScore is used to implemente field-aware factorization machines,
+// in which the socre function is:
+//   y = sum( (V_i_fj*V_j_fi)(x_i * x_j) )
+// Here leave out the bias and linear term.
+//------------------------------------------------------------------------------
+class DistFFMScore : public DistScore {
+public:
+ // Constructor and Desstructor
+ DistFFMScore() { }
+ ~DistFFMScore() { }
+
+ // Given one exmaple and current model, this method
+ // returns the ffm score.
+ real_t CalcScore(const SparseRow* row,
+     std::map<index_t, real_t>* weight,
+     std::map<index_t, std::vector<real_t>>* v,
+     real_t norm = 1.0
+     );
+
+ // Calculate gradient and update current
+ // model parameters.
+ void CalcGrad(const DMatrix* matrix,
+     std::map<index_t, real_t>& w,
+     std::map<index_t, std::vector<real_t>>* v,
+     real_t* sum,
+     std::map<index_t, real_t>& w_g,
+     std::map<index_t, real_t>& v_g,
+     index_t start_idx,
+     index_t end_idx
+     );
+
+ protected:
+  // Calculate gradient and update model using sgd
+ void calc_grad_sgd(const DMatrix* matrix,
+     std::map<index_t, real_t>& w,
+     std::map<index_t, std::vector<real_t>>* v,
+     real_t* sum,
+     std::map<index_t, real_t>& w_g,
+     std::map<index_t, real_t>& v_g,
+     index_t start_idx,
+     index_t end_idx
+     );
+
+  // Calculate gradient and update model using adagrad
+ void calc_grad_adagrad(const DMatrix* matrix,
+     std::map<index_t, real_t>& w,
+     std::map<index_t, std::vector<real_t>>* v,
+     real_t* sum,
+     std::map<index_t, real_t>& w_g,
+     std::map<index_t, real_t>& v_g,
+     index_t start_idx,
+     index_t end_idx
+     );
+
+  // Calculate gradient and update model using ftrl
+ void calc_grad_ftrl(const DMatrix* matrix,
+     std::map<index_t, real_t>& w,
+     std::map<index_t, std::vector<real_t>>* v,
+     real_t* sum,
+     std::map<index_t, real_t>& w_g,
+     std::map<index_t, real_t>& v_g,
+     index_t start_idx,
+     index_t end_idx
+     );
+
+ private:
+  real_t* comp_res1 = nullptr;
+  real_t* comp_res2 = nullptr;
+  real_t* comp_z_lt_zero = nullptr;
+  real_t* comp_z_gt_zero = nullptr;
+  
+ private:
+  DISALLOW_COPY_AND_ASSIGN(DistFFMScore);
+};
+
+}  // namespace xLearn
+
+#endif  // XLEARN_DIST_FFM_SCORE_H_

From 6f44cc07ac3f6591d3ca2860954d62c3c808219d Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Wed, 27 Dec 2017 09:31:43 +0800
Subject: [PATCH 77/82] update: dist_ffm_score.cc

---
 src/distributed/dist_ffm_score.cc | 164 +++++-------------------------
 1 file changed, 28 insertions(+), 136 deletions(-)

diff --git a/src/distributed/dist_ffm_score.cc b/src/distributed/dist_ffm_score.cc
index 92c49adb..9b4084e3 100644
--- a/src/distributed/dist_ffm_score.cc
+++ b/src/distributed/dist_ffm_score.cc
@@ -49,7 +49,7 @@ namespace xLearn {
    *********************************************************/
   index_t align0 = aux_size * model.get_aligned_k();
   index_t align1 = model.GetNumField() * align0;
-  //int align = kAlign * aux_size;
+  int align = kAlign * aux_size;
   //w = model.GetParameter_v();
   __m128 XMMt = _mm_setzero_ps();
   for (SparseRow::const_iterator iter_i = row->begin();
@@ -109,7 +109,7 @@ void DistFFMScore::CalcGrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using sgd
 void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
-    std::map<index_t, real_t>& w,
+    std::map<index_t, real_t>& weight,
     std::map<index_t, std::vector<real_t>>* v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
@@ -121,25 +121,19 @@ void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
    *  linear term and bias term                            *
    *********************************************************/
   real_t sqrt_norm = sqrt(norm);
-  real_t *w = model.GetParameter_w();
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
-    real_t &wl = w[iter->feat_id];
-    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
-    wl -= (learning_rate_ * g);
+    real_t &wl = weight[iter->feat_id];
+    real_t g = pg*iter->feat_val*sqrt_norm;
+    w_g[iter->feat_id] += g;
   }
-  // bias
-  w = model.GetParameter_b();
-  real_t &wb = w[0];
-  real_t g = pg;
-  wb -= (learning_rate_ * g);
   /*********************************************************
    *  latent factor                                        *
    *********************************************************/
   index_t align0 = model.GetAuxiliarySize() * model.get_aligned_k();
   index_t align1 = model.GetNumField() * align0;
   index_t align = kAlign * model.GetAuxiliarySize();
-  w = model.GetParameter_v();
+  //w = model.GetParameter_v();
   __m128 XMMpg = _mm_set1_ps(pg);
   __m128 XMMlr = _mm_set1_ps(learning_rate_);
   __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
@@ -148,13 +142,13 @@ void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
     index_t j1 = iter_i->feat_id;
     index_t f1 = iter_i->field_id;
     real_t v1 = iter_i->feat_val;
+    real_t* w1_base = v[j1].data() + j1 * align1;
     for (SparseRow::const_iterator iter_j = iter_i+1;
          iter_j != row->end(); ++iter_j) {
       index_t j2 = iter_j->feat_id;
       index_t f2 = iter_j->field_id;
       real_t v2 = iter_j->feat_val;
-      real_t* w1_base = w + j1*align1 + f2*align0;
-      real_t* w2_base = w + j2*align1 + f1*align0;
+      real_t* w2_base = v[j2].data() + j2 * align1;
       __m128 XMMv = _mm_set1_ps(v1*v2*norm);
       __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
       for (index_t d = 0; d < align0; d += align) {
@@ -180,7 +174,7 @@ void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
 
 // Calculate gradient and update current model using adagrad
 void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
-    std::map<index_t, real_t>& w,
+    std::map<index_t, real_t>& weight,
     std::map<index_t, std::vector<real_t>>* v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
@@ -192,29 +186,18 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
    *  linear term and bias term                            *
    *********************************************************/
   real_t sqrt_norm = sqrt(norm);
-  real_t *w = model.GetParameter_w();
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
-    real_t &wl = w[iter->feat_id*2];
-    real_t &wlg = w[iter->feat_id*2+1];
-    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
-    wlg += g*g;
-    wl -= learning_rate_ * g * InvSqrt(wlg);
+    real_t &wl = weight[iter->feat_id];
+    real_t g = pg*iter->feat_val*sqrt_norm;
+    w_g[iter->feat_id] += g;
   }
-  // bias
-  w = model.GetParameter_b();
-  real_t &wb = w[0];
-  real_t &wbg = w[1];
-  real_t g = pg;
-  wbg += g*g;
-  wb -= learning_rate_ * g * InvSqrt(wbg);
   /*********************************************************
    *  latent factor                                        *
    *********************************************************/
-  index_t align0 = 2 * model.get_aligned_k();
-  index_t align1 = model.GetNumField() * align0;
-  index_t align = kAlign * 2;
-  w = model.GetParameter_v();
+  index_t align0 = model.get_aligned_k();
+  index_t align = kAlign;
+  //w = model.GetParameter_v();
   __m128 XMMpg = _mm_set1_ps(pg);
   __m128 XMMlr = _mm_set1_ps(learning_rate_);
   __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
@@ -222,25 +205,21 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
        iter_i != row->end(); ++iter_i) {
     index_t j1 = iter_i->feat_id;
     index_t f1 = iter_i->field_id;
+    real_t* w1_base = v[j1].data() + f1 * align0;
     real_t v1 = iter_i->feat_val;
     for (SparseRow::const_iterator iter_j = iter_i+1;
          iter_j != row->end(); ++iter_j) {
       index_t j2 = iter_j->feat_id;
       index_t f2 = iter_j->field_id;
       real_t v2 = iter_j->feat_val;
-      real_t* w1_base = w + j1*align1 + f2*align0;
-      real_t* w2_base = w + j2*align1 + f1*align0;
+      real_t* w2_base = v[j2].data() + f2 * align0;
       __m128 XMMv = _mm_set1_ps(v1*v2*norm);
       __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
       for (index_t d = 0; d < align0; d += align) {
         real_t *w1 = w1_base + d;
         real_t *w2 = w2_base + d;
-        real_t *wg1 = w1 + kAlign;
-        real_t *wg2 = w2 + kAlign;
         __m128 XMMw1 = _mm_load_ps(w1);
         __m128 XMMw2 = _mm_load_ps(w2);
-        __m128 XMMwg1 = _mm_load_ps(wg1);
-        __m128 XMMwg2 = _mm_load_ps(wg2);
         __m128 XMMg1 = _mm_add_ps(
                        _mm_mul_ps(XMMlamb, XMMw1),
                        _mm_mul_ps(XMMpgv, XMMw2));
@@ -249,12 +228,6 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
                        _mm_mul_ps(XMMpgv, XMMw1));
         XMMwg1 = _mm_add_ps(XMMwg1, _mm_mul_ps(XMMg1, XMMg1));
         XMMwg2 = _mm_add_ps(XMMwg2, _mm_mul_ps(XMMg2, XMMg2));
-        XMMw1 = _mm_sub_ps(XMMw1, _mm_mul_ps(XMMlr,
-                _mm_mul_ps(_mm_rsqrt_ps(XMMwg1), XMMg1)));
-        XMMw2 = _mm_sub_ps(XMMw2, _mm_mul_ps(XMMlr,
-                _mm_mul_ps(_mm_rsqrt_ps(XMMwg2), XMMg2)));
-        _mm_store_ps(w1, XMMw1);
-        _mm_store_ps(w2, XMMw2);
         _mm_store_ps(wg1, XMMwg1);
         _mm_store_ps(wg2, XMMwg2);
       }
@@ -264,7 +237,7 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using ftrl
 void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
-    std::map<index_t, real_t>& w,
+    std::map<index_t, real_t>& weight,
     std::map<index_t, std::vector<real_t>>* v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
@@ -276,51 +249,19 @@ void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
    *  linear term and bias term                            *
    *********************************************************/  
   real_t sqrt_norm = sqrt(norm);
-  real_t *w = model.GetParameter_w();
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
-    real_t &wl = w[iter->feat_id*3];
-    real_t &wlg = w[iter->feat_id*3+1];
-    real_t &wlz = w[iter->feat_id*3+2];
+    real_t &wl = weight[iter->feat_id];
     real_t g = lambda_2_*wl+pg*iter->feat_val*sqrt_norm; 
-    real_t old_wlg = wlg;
-    wlg += g*g;
-    real_t sigma = (sqrt(wlg)-sqrt(old_wlg)) / alpha_;
-    wlz += (g-sigma*wl);
-    int sign = wlz > 0 ? 1:-1;
-    if (sign*wlz <= lambda_1_) {
-      wl = 0;
-    } else {
-      wl = (sign*lambda_1_-wlz) / 
-           ((beta_ + sqrt(wlg)) / 
-            alpha_ + lambda_2_);
-    }
-  }
-  // bias
-  w = model.GetParameter_b();
-  real_t &wb = w[0];
-  real_t &wbg = w[1];
-  real_t &wbz = w[2];
-  real_t g = pg;
-  real_t old_wbg = wbg;
-  wbg += g*g;
-  real_t sigma = (sqrt(wbg)-sqrt(old_wbg)) / alpha_;
-  wbz += (g-sigma*wb);
-  int sign = wbz > 0 ? 1:-1;
-  if (sign*wbz <= lambda_1_) {
-    wb = 0;
-  } else {
-    wb = (sign*lambda_1_-wbz) / 
-         ((beta_ + sqrt(wbg)) / 
-          alpha_ + lambda_2_);
+    v_g[iter->feat_id] += g;
   }
   /*********************************************************
    *  latent factor                                        *
    *********************************************************/
-  index_t align0 = 3 * model.get_aligned_k();
-  index_t align1 = model.GetNumField() * align0;
-  index_t align = kAlign * 3;
-  w = model.GetParameter_v();
+  index_t align0 = model.get_aligned_k();  // latent factor dim
+  index_t align1 = model.GetNumField() * align0;  // all latent factor dim for one feature;
+  index_t align = kAlign;
+  //w = model.GetParameter_v();
   __m128 XMMpg = _mm_set1_ps(pg);
   __m128 XMMalpha = _mm_set1_ps(alpha_);
   __m128 XMML2 = _mm_set1_ps(lambda_2_);
@@ -329,81 +270,32 @@ void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
     index_t j1 = iter_i->feat_id;
     index_t f1 = iter_i->field_id;
     real_t v1 = iter_i->feat_val;
+    real_t* w1_base = v[j1].data() + f1*align0;
     for (SparseRow::const_iterator iter_j = iter_i+1;
          iter_j != row->end(); ++iter_j) {
       index_t j2 = iter_j->feat_id;
       index_t f2 = iter_j->field_id;
       real_t v2 = iter_j->feat_val;
-      real_t* w1_base = w + j1*align1 + f2*align0;
-      real_t* w2_base = w + j2*align1 + f1*align0;
+      real_t* w2_base = v[j2].data() + f2*align0;
       __m128 XMMv = _mm_set1_ps(v1*v2*norm);
       __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
       for (index_t d = 0; d < align0; d += align) {
         real_t *w1 = w1_base + d;
         real_t *w2 = w2_base + d;
-        real_t *wg1 = w1 + kAlign;
-        real_t *wg2 = w2 + kAlign;
-        real_t *z1 = w1 + kAlign * 2;
-        real_t *z2 = w2 + kAlign * 2;
         __m128 XMMw1 = _mm_load_ps(w1);
         __m128 XMMw2 = _mm_load_ps(w2);
-        __m128 XMMwg1 = _mm_load_ps(wg1);
-        __m128 XMMwg2 = _mm_load_ps(wg2);
-        __m128 XMMz1 = _mm_load_ps(z1);
-        __m128 XMMz2 = _mm_load_ps(z2);
         __m128 XMMg1 = _mm_add_ps(
                        _mm_mul_ps(XMML2, XMMw1),
                        _mm_mul_ps(XMMpgv, XMMw2));
         __m128 XMMg2 = _mm_add_ps(
                        _mm_mul_ps(XMML2, XMMw2),
                        _mm_mul_ps(XMMpgv, XMMw1));
-        __m128 XMMsigma1 = _mm_div_ps(
-                           _mm_sub_ps(
-                           _mm_sqrt_ps(
-                           _mm_add_ps(XMMwg1,
-                           _mm_mul_ps(XMMg1, XMMg1))),
-                           _mm_sqrt_ps(XMMwg1)), XMMalpha);
-        __m128 XMMsigma2 = _mm_div_ps(
-                           _mm_sub_ps(
-                           _mm_sqrt_ps(
-                           _mm_add_ps(XMMwg2,
-                           _mm_mul_ps(XMMg2, XMMg2))),
-                           _mm_sqrt_ps(XMMwg2)), XMMalpha);
-        XMMz1 = _mm_add_ps(XMMz1,
-                _mm_sub_ps(XMMg1,
-                _mm_mul_ps(XMMsigma1, XMMw1)));
-        XMMz2 = _mm_add_ps(XMMz2,
-                _mm_sub_ps(XMMg2,
-                _mm_mul_ps(XMMsigma2, XMMw2)));
-        _mm_store_ps(z1, XMMz1);
-        _mm_store_ps(z2, XMMz2);
         XMMwg1 = _mm_add_ps(XMMwg1,
                  _mm_mul_ps(XMMg1, XMMg1));
         XMMwg2 = _mm_add_ps(XMMwg2,
                  _mm_mul_ps(XMMg2, XMMg2));
-        _mm_store_ps(wg1, XMMwg1);
-        _mm_store_ps(wg2, XMMwg2);
-        // Update w. SSE may not faster
-        for (size_t i = 0; i < kAlign; ++i) {
-          // w1
-          real_t z1_value = *(z1+i);
-          int sign = z1_value > 0 ? 1 : -1;
-          if (sign * z1_value <= lambda_1_) {
-            *(w1+i) = 0;
-          } else {
-            *(w1+i) = (sign*lambda_1_-z1_value) / 
-              ((beta_ + sqrt(*(wg1+i))) / alpha_ + lambda_2_);
-          }
-          // w2
-          real_t z2_value = *(z2+i);
-          sign = z2_value > 0 ? 1 : -1;
-          if (sign * z2_value <= lambda_1_) {
-            *(w2+i) = 0;
-          } else {
-            *(w2+i) = (sign*lambda_1_-z2_value) / 
-              ((beta_ + sqrt(*(wg2+i))) / alpha_ + lambda_2_);
-          }
-        }
+        _mm_store_ps(v_g[j1].data() + d, XMMwg1);
+        _mm_store_ps(v_g[j2].data() + d, XMMwg2);
       }
     }
   }

From f19fdcd6afa14d4ca9b9a132b2ad2d7cef4b8cae Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Fri, 29 Dec 2017 15:47:54 +0800
Subject: [PATCH 78/82] update: dist fm and ffm

---
 src/distributed/dist_cross_entropy_loss.cc | 36 +++++++++++++++++++---
 src/distributed/dist_ffm_score.h           |  2 +-
 src/distributed/dist_fm_score.cc           |  2 +-
 src/distributed/dist_linear_score.h        |  9 ++++++
 src/distributed/dist_score_function.cc     |  2 ++
 src/distributed/dist_score_function.h      |  3 ++
 6 files changed, 48 insertions(+), 6 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 2e3554f6..bf679d80 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -172,9 +172,15 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   total_example_ += row_len;
   auto feature_ids = std::vector<ps::Key>();
   auto gradient_pull = std::make_shared<std::vector<float>>();
+  auto v_pull = std::make_shared<std::vector<float>>();
   std::map<index_t, real_t> weight_map;
+  std::map<index_t, std::vector<real_t>> v_map;
+
   std::map<index_t, real_t> gradient_push_map;
+  std::map<index_t, real_t> v_push_map;
+
   auto gradient_push = std::make_shared<std::vector<float>>();
+  auto v_push = std::make_shared<std::vector<float>>();
 
   for (index_t i = 0; i < row_len; ++i) {
     SparseRow* row = matrix->row[i];
@@ -190,8 +196,11 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
                       feature_ids.end());
 
   gradient_pull->resize(feature_ids.size());
-  if (model.GetScoreFunction().compare("linear") == 0) {
-    kv_w_->Wait(kv_w_->Pull(feature_ids, &(*gradient_pull)));
+  kv_w_->Wait(kv_w_->Pull(feature_ids, &(*gradient_pull)));
+  v_pull->resize(feature_ids.size() * hyper_param_.num_K);
+  if (model.GetScoreFunction().compare("fm") == 0 ||
+      model.GetScoreFunction().compare("ffm") == 0) {
+    kv_v_->Wait(kv_v_->Pull(feature_ids, &(*v_pull)));
   }
   for (int i = 0; i < gradient_pull->size(); ++i) {
     index_t idx = feature_ids[i];
@@ -199,6 +208,14 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     weight_map[idx] = weight;
     gradient_push_map[idx] = 0.0;
   }
+  for (int i = 0; i < v_pull; ++i) {
+    index_t idx = feature_ids[i];
+    std::vector<real_t> vec_k;
+    for(int j = 0; j < hyper_param_.num_K; ++j) {
+      vec_k.push_back(v_pull[i+j]);
+    }
+    v_map[idx] = vec_k;
+  }
   // multi-thread training
   int count = lock_free_ ? threadNumber_ : 1;
   std::vector<real_t> sum(count, 0);
@@ -208,10 +225,12 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
                              std::ref(weight_map),
+                             std::ref(v_map);
                              dist_score_func_,
                              norm_,
                              &(sum[i]),
                              std::ref(gradient_push_map),
+                             std::ref(v_push_map),
                              start_idx,
                              end_idx));
   }
@@ -223,8 +242,17 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     real_t g = gradient_push_map[idx];
     (*gradient_push)[i] = g;
   }
-  if (model.GetScoreFunction().compare("linear") == 0) {
-    kv_w_->Wait(kv_w_->Push(feature_ids, *gradient_push));
+  kv_w_->Wait(kv_w_->Push(feature_ids, *gradient_push));
+  v_push->resize(feature_ids.size() * hyper_param_.num_K);
+  for (int i = 0; i < feature_ids.size(); ++i) {
+    index_t idx = feature_ids[i];
+    for (int j = 0; j < v_push_map[idx].size(); ++j) {
+      v_push->push_back(v_push_map[idx][j]);
+    }
+  }
+  if (model.GetScoreFunction().compare("fm") == 0 ||
+      model.GetScoreFunction().compare("ffm") == 0) {
+    kv_v_.Wait(kv_v_.Push(feature_ids, *v_push));
   }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
diff --git a/src/distributed/dist_ffm_score.h b/src/distributed/dist_ffm_score.h
index ab548dff..2426ed5a 100644
--- a/src/distributed/dist_ffm_score.h
+++ b/src/distributed/dist_ffm_score.h
@@ -49,7 +49,7 @@ class DistFFMScore : public DistScore {
 
  // Calculate gradient and update current
  // model parameters.
- void CalcGrad(const DMatrix* matrix,
+ void DistCalcGrad(const DMatrix* matrix,
      std::map<index_t, real_t>& w,
      std::map<index_t, std::vector<real_t>>* v,
      real_t* sum,
diff --git a/src/distributed/dist_fm_score.cc b/src/distributed/dist_fm_score.cc
index bf0da51f..e17368c4 100644
--- a/src/distributed/dist_fm_score.cc
+++ b/src/distributed/dist_fm_score.cc
@@ -90,7 +90,7 @@ namespace xLearn {
 
 // Calculate gradient and update current model parameters.
 // Using SSE to accelerate vector operation.
-void DistFMScore::CalcGrad(const DMatrix* matrix,
+void DistFMScore::DistCalcGrad(const DMatrix* matrix,
     std::map<index_t, real_t>& w,
     std::map<index_t, std::vector<real_t>>* v,
     real_t* sum,
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index 14e8ad10..add75089 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -42,12 +42,15 @@ class DistLinearScore : public DistScore {
   // returns the linear score wTx.
   real_t CalcScore(const SparseRow* row,
                    std::map<index_t, real_t>* w,
+                   std::map<index_t, std::vector<real_t>>* v,
                    real_t norm = 1.0);
 
   void DistCalcGrad(const DMatrix* matrix,
                      std::map<index_t, real_t>& w,
+                     std::map<index_t, std::vector<real_t>>* v,
                      real_t* sum,
                      std::map<index_t, real_t>& g,
+                     std::map<index_t, real_t>& v_g,
                      index_t start_idx,
                      index_t end_idx);
 
@@ -55,8 +58,10 @@ class DistLinearScore : public DistScore {
   // Calculate gradient and update model using sgd
   void calc_grad_sgd(const DMatrix* matrix,
                      std::map<index_t, real_t>& w,
+                     std::map<index_t, std::vector<real_t>>* v,
                      real_t* sum,
                      std::map<index_t, real_t>& g,
+                     std::map<index_t, real_t>& v_g,
                      real_t start_idx,
                      real_t end_idx
                     );
@@ -64,8 +69,10 @@ class DistLinearScore : public DistScore {
   // Calculate gradient and update model using adagrad
   void calc_grad_adagrad(const DMatrix* matrix,
                          std::map<index_t, real_t>& w,
+                         std::map<index_t, std::vector<real_t>>* v,
                          real_t* sum,
                          std::map<index_t, real_t>& g,
+                         std::map<index_t, real_t>& v_g,
                          real_t start_idx,
                          real_t end_idx
                         );
@@ -73,8 +80,10 @@ class DistLinearScore : public DistScore {
   // Calculate gradient and update model using ftrl
   void calc_grad_ftrl(const DMatrix* matrix,
                       std::map<index_t, real_t>& w,
+                      std::map<index_t, std::vector<real_t>>* v,
                       real_t* sum,
                       std::map<index_t, real_t>& g,
+                      std::map<index_t, real_t>& v_g,
                       real_t start_idx,
                       real_t end_idx
                      );
diff --git a/src/distributed/dist_score_function.cc b/src/distributed/dist_score_function.cc
index adce9b2b..f0781121 100644
--- a/src/distributed/dist_score_function.cc
+++ b/src/distributed/dist_score_function.cc
@@ -22,6 +22,7 @@ This file is the implementation of the base Score class.
 #include "src/distributed/dist_score_function.h"
 #include "src/distributed/dist_linear_score.h"
 #include "src/distributed/dist_fm_score.h"
+#include "src/distributed/dist_ffm_score.h"
 
 namespace xLearn {
 
@@ -31,5 +32,6 @@ namespace xLearn {
 CLASS_REGISTER_IMPLEMENT_REGISTRY(xLearn_dist_score_registry, DistScore);
 REGISTER_SCORE("dist_linear", DistLinearScore);
 REGISTER_SCORE("dist_fm", DistFMScore);
+REGISTER_SCORE("dist_ffm", DistFFMScore);
 
 }  // namespace xLearn
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index 8c06e3fa..f5dc7f93 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -74,12 +74,15 @@ class DistScore {
   // returns the score
   virtual real_t CalcScore(const SparseRow* row,
                            std::map<index_t, real_t>* w,
+                           std::map<index_t, std::vector<real_t>>* v,
                            real_t norm = 1.0) = 0;
 
   virtual void DistCalcGrad(const DMatrix* matrix,
                                std::map<index_t, real_t>& w,
+                               std::map<index_t, std::vector<real_t>>* v,
                                real_t* sum,
                                std::map<index_t, real_t>& g,
+                               std::map<index_t, real_t>& v_g,
                                index_t start_idx,
                                index_t end_idx) = 0;
 

From 0d6e9eb854cf40a6bb49f596b6156e3360cd5ca9 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 31 Dec 2017 13:16:23 +0800
Subject: [PATCH 79/82] update: distributed/CMakeLists.txt

---
 src/distributed/CMakeLists.txt | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/distributed/CMakeLists.txt b/src/distributed/CMakeLists.txt
index 393bf99b..1ca798d6 100644
--- a/src/distributed/CMakeLists.txt
+++ b/src/distributed/CMakeLists.txt
@@ -1,7 +1,7 @@
 set(CMAKE_RUNTIME_OUTPUT_DIRECTORY ${PROJECT_BINARY_DIR})
 
 set(STA_DEPS data base pslite protobuf zmq)
-add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
+add_library(distributed STATIC dist_score_function.cc dist_linear_score.cc dist_fm_score.cc dist_ffm_score.cc dist_cross_entropy_loss.cc dist_checker.cc dist_loss.cc)
 target_link_libraries(distributed ${STA_DEPS})
 
 add_executable(dist_xlearn_train dist_train_main.cc dist_solver.cc dist_trainer.cc dist_inference.cc)

From b271024e4c412763d199dc53990d8ecb9c3e25e6 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 31 Dec 2017 13:16:48 +0800
Subject: [PATCH 80/82] update: score

---
 src/distributed/dist_cross_entropy_loss.cc |  40 ++-
 src/distributed/dist_ffm_score.cc          | 334 +++++++++++----------
 src/distributed/dist_ffm_score.h           |  19 +-
 src/distributed/dist_fm_score.cc           | 323 ++++++++++----------
 src/distributed/dist_fm_score.h            |  33 +-
 src/distributed/dist_linear_score.cc       |  32 +-
 src/distributed/dist_linear_score.h        |  21 +-
 src/distributed/dist_score_function.h      |   6 +-
 8 files changed, 443 insertions(+), 365 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index bf679d80..84fe00a6 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -29,6 +29,7 @@ namespace xLearn {
 
 static void pred_thread(const DMatrix* data_matrix,
                         std::map<index_t, real_t>& w,
+                        std::map<index_t, std::vector<real_t>>& v,
                         std::vector<real_t>* pred,
                         DistScore* dist_score_func,
                         bool is_norm,
@@ -38,7 +39,7 @@ static void pred_thread(const DMatrix* data_matrix,
   for (size_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = data_matrix->row[i];
     real_t norm = is_norm ? data_matrix->norm[i] : 1.0;
-    (*pred)[i] = dist_score_func->CalcScore(row, &w, norm);
+    (*pred)[i] = dist_score_func->CalcScore(row, &w, &v, norm);
   }
 }
 
@@ -48,7 +49,9 @@ void DistCrossEntropyLoss::Predict(const DMatrix* data_matrix,
   auto feature_ids = std::vector<ps::Key>();
   size_t row_len = data_matrix->row_length;
   auto gradient_pull = std::make_shared<std::vector<float>>();
+  auto v_pull = std::make_shared<std::vector<float>>();
   std::map<index_t, real_t> weight_map;
+  std::map<index_t, std::vector<real_t>> v_map;
   for (index_t i = 0; i < row_len; ++i) {
     SparseRow* row = data_matrix->row[i];
     for (SparseRow::const_iterator iter = row->begin();
@@ -62,13 +65,21 @@ void DistCrossEntropyLoss::Predict(const DMatrix* data_matrix,
   feature_ids.erase(unique(feature_ids.begin(), feature_ids.end()),
                     feature_ids.end());
   gradient_pull->resize(feature_ids.size());
-  if (model.GetScoreFunction().compare("linear") == 0) {
-    kv_w_->Pull(feature_ids, &(*gradient_pull));
+  kv_w_->Pull(feature_ids, &(*gradient_pull));
+  v_pull->resize(feature_ids.size() * model.GetNumK());
+  if (model.GetScoreFunction().compare("fm") == 0 ||
+      model.GetScoreFunction().compare("ffm") == 0) {
+    kv_v_->Pull(feature_ids, &(*v_pull));
   }
   for (int i = 0; i < gradient_pull->size(); ++i) {
     index_t idx = feature_ids[i];
     real_t weight = (*gradient_pull)[i];
     weight_map[idx] = weight;
+    std::vector<real_t> vec_k;
+    for (int j = 0; j < model.GetNumK(); ++j) {
+      vec_k.push_back((*v_pull)[i * model.GetNumK() + j]);
+    }
+    v_map[idx] = vec_k;
   }
   for (int i = 0; i < threadNumber_; ++i) {
     size_t start_idx = getStart(row_len, threadNumber_, i);
@@ -76,6 +87,7 @@ void DistCrossEntropyLoss::Predict(const DMatrix* data_matrix,
     pool_->enqueue(std::bind(pred_thread,
           data_matrix,
           std::ref(weight_map),
+          std::ref(v_map),
           &pred,
           dist_score_func_,
           norm_,
@@ -141,14 +153,16 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
                                std::map<index_t, real_t>& w,
+                               std::map<index_t, std::vector<real_t>>& v,
                                DistScore* dist_score_func,
                                bool is_norm,
                                real_t* sum,
-                               std::map<index_t, real_t>& g,
+                               std::map<index_t, real_t>& w_g,
+                               std::map<index_t, std::vector<real_t>>& v_g,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  dist_score_func->DistCalcGrad(matrix, w, sum, g, start_idx, end_idx);
+  dist_score_func->DistCalcGrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -177,7 +191,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   std::map<index_t, std::vector<real_t>> v_map;
 
   std::map<index_t, real_t> gradient_push_map;
-  std::map<index_t, real_t> v_push_map;
+  std::map<index_t, std::vector<real_t>> v_push_map;
 
   auto gradient_push = std::make_shared<std::vector<float>>();
   auto v_push = std::make_shared<std::vector<float>>();
@@ -197,7 +211,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
 
   gradient_pull->resize(feature_ids.size());
   kv_w_->Wait(kv_w_->Pull(feature_ids, &(*gradient_pull)));
-  v_pull->resize(feature_ids.size() * hyper_param_.num_K);
+  v_pull->resize(feature_ids.size() * model.GetNumK());
   if (model.GetScoreFunction().compare("fm") == 0 ||
       model.GetScoreFunction().compare("ffm") == 0) {
     kv_v_->Wait(kv_v_->Pull(feature_ids, &(*v_pull)));
@@ -208,11 +222,11 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     weight_map[idx] = weight;
     gradient_push_map[idx] = 0.0;
   }
-  for (int i = 0; i < v_pull; ++i) {
+  for (int i = 0; i < v_pull->size(); ++i) {
     index_t idx = feature_ids[i];
     std::vector<real_t> vec_k;
-    for(int j = 0; j < hyper_param_.num_K; ++j) {
-      vec_k.push_back(v_pull[i+j]);
+    for(int j = 0; j < model.GetNumK(); ++j) {
+      vec_k.push_back((*v_pull)[i * model.GetNumK() + j]);
     }
     v_map[idx] = vec_k;
   }
@@ -225,7 +239,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
                              std::ref(weight_map),
-                             std::ref(v_map);
+                             std::ref(v_map),
                              dist_score_func_,
                              norm_,
                              &(sum[i]),
@@ -243,7 +257,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     (*gradient_push)[i] = g;
   }
   kv_w_->Wait(kv_w_->Push(feature_ids, *gradient_push));
-  v_push->resize(feature_ids.size() * hyper_param_.num_K);
+  v_push->resize(feature_ids.size() * model.GetNumK());
   for (int i = 0; i < feature_ids.size(); ++i) {
     index_t idx = feature_ids[i];
     for (int j = 0; j < v_push_map[idx].size(); ++j) {
@@ -252,7 +266,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
   }
   if (model.GetScoreFunction().compare("fm") == 0 ||
       model.GetScoreFunction().compare("ffm") == 0) {
-    kv_v_.Wait(kv_v_.Push(feature_ids, *v_push));
+    kv_v_->Wait(kv_v_->Push(feature_ids, *v_push));
   }
   // Accumulate loss
   for (int i = 0; i < sum.size(); ++i) {
diff --git a/src/distributed/dist_ffm_score.cc b/src/distributed/dist_ffm_score.cc
index 9b4084e3..2e40b529 100644
--- a/src/distributed/dist_ffm_score.cc
+++ b/src/distributed/dist_ffm_score.cc
@@ -29,6 +29,7 @@ namespace xLearn {
 // y = sum( (V_i_fj*V_j_fi)(x_i * x_j) )
 // Using SSE to accelerate vector operation.
   real_t DistFFMScore::CalcScore(const SparseRow* row,
+      Model& model,
       std::map<index_t, real_t>* weight,
       std::map<index_t, std::vector<real_t>>* v,
       real_t norm = 1.0
@@ -85,8 +86,9 @@ namespace xLearn {
 // Calculate gradient and update current model.
 // Using the SSE to accelerate vector operation.
 void DistFFMScore::CalcGrad(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& w,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, real_t>& v_g,
@@ -95,141 +97,154 @@ void DistFFMScore::CalcGrad(const DMatrix* matrix,
     ) {
   // Using sgd
   if (opt_type_.compare("sgd") == 0) {
-    this->calc_grad_sgd(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_sgd(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using adagrad
   else if (opt_type_.compare("adagrad") == 0) {
-    this->calc_grad_adagrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_adagrad(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using ftrl 
   else if (opt_type_.compare("ftrl") == 0) {
-    this->calc_grad_ftrl(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_ftrl(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
 }
 
 // Calculate gradient and update current model using sgd
 void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& weight,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    real_t &wl = weight[iter->feat_id];
-    real_t g = pg*iter->feat_val*sqrt_norm;
-    w_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t align0 = model.GetAuxiliarySize() * model.get_aligned_k();
-  index_t align1 = model.GetNumField() * align0;
-  index_t align = kAlign * model.GetAuxiliarySize();
-  //w = model.GetParameter_v();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMlr = _mm_set1_ps(learning_rate_);
-  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
-  for (SparseRow::const_iterator iter_i = row->begin();
-       iter_i != row->end(); ++iter_i) {
-    index_t j1 = iter_i->feat_id;
-    index_t f1 = iter_i->field_id;
-    real_t v1 = iter_i->feat_val;
-    real_t* w1_base = v[j1].data() + j1 * align1;
-    for (SparseRow::const_iterator iter_j = iter_i+1;
-         iter_j != row->end(); ++iter_j) {
-      index_t j2 = iter_j->feat_id;
-      index_t f2 = iter_j->field_id;
-      real_t v2 = iter_j->feat_val;
-      real_t* w2_base = v[j2].data() + j2 * align1;
-      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
-      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
-      for (index_t d = 0; d < align0; d += align) {
-        real_t *w1 = w1_base + d;
-        real_t *w2 = w2_base + d;
-        __m128 XMMw1 = _mm_load_ps(w1);
-        __m128 XMMw2 = _mm_load_ps(w2);
-        __m128 XMMg1 = _mm_add_ps(
-                       _mm_mul_ps(XMMlamb, XMMw1),
-                       _mm_mul_ps(XMMpgv, XMMw2));
-        __m128 XMMg2 = _mm_add_ps(
-                       _mm_mul_ps(XMMlamb, XMMw2),
-                       _mm_mul_ps(XMMpgv, XMMw1));
-        XMMw1 = _mm_sub_ps(XMMw1, _mm_mul_ps(XMMlr, XMMg1));
-        XMMw2 = _mm_sub_ps(XMMw2, _mm_mul_ps(XMMlr, XMMg2));
-        _mm_store_ps(w1, XMMw1);
-        _mm_store_ps(w2, XMMw2);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &w, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      real_t &wl = weight[iter->feat_id];
+      real_t g = pg*iter->feat_val;
+      w_g[iter->feat_id] += g;
+    }
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t align0 = model.GetAuxiliarySize() * model.get_aligned_k();
+    index_t align1 = model.GetNumField() * align0;
+    index_t align = kAlign * model.GetAuxiliarySize();
+    //w = model.GetParameter_v();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    __m128 XMMlr = _mm_set1_ps(learning_rate_);
+    __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+    for (SparseRow::const_iterator iter_i = row->begin();
+        iter_i != row->end(); ++iter_i) {
+      index_t j1 = iter_i->feat_id;
+      index_t f1 = iter_i->field_id;
+      real_t v1 = iter_i->feat_val;
+      real_t* w1_base = v[j1].data() + j1 * align1;
+      for (SparseRow::const_iterator iter_j = iter_i+1;
+          iter_j != row->end(); ++iter_j) {
+        index_t j2 = iter_j->feat_id;
+        index_t f2 = iter_j->field_id;
+        real_t v2 = iter_j->feat_val;
+        real_t* w2_base = v[j2].data() + j2 * align1;
+        __m128 XMMv = _mm_set1_ps(v1*v2);
+        __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+        for (index_t d = 0; d < align0; d += align) {
+          real_t *w1 = w1_base + d;
+          real_t *w2 = w2_base + d;
+          __m128 XMMw1 = _mm_load_ps(w1);
+          __m128 XMMw2 = _mm_load_ps(w2);
+          __m128 XMMg1 = _mm_add_ps(
+              _mm_mul_ps(XMMlamb, XMMw1),
+              _mm_mul_ps(XMMpgv, XMMw2));
+          __m128 XMMg2 = _mm_add_ps(
+              _mm_mul_ps(XMMlamb, XMMw2),
+              _mm_mul_ps(XMMpgv, XMMw1));
+          XMMw1 = _mm_sub_ps(XMMw1, _mm_mul_ps(XMMlr, XMMg1));
+          XMMw2 = _mm_sub_ps(XMMw2, _mm_mul_ps(XMMlr, XMMg2));
+          _mm_store_ps(w1, XMMw1);
+          _mm_store_ps(w2, XMMw2);
+        }
       }
     }
   }
-
 }
 
 // Calculate gradient and update current model using adagrad
 void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& weight,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    real_t &wl = weight[iter->feat_id];
-    real_t g = pg*iter->feat_val*sqrt_norm;
-    w_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t align0 = model.get_aligned_k();
-  index_t align = kAlign;
-  //w = model.GetParameter_v();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMlr = _mm_set1_ps(learning_rate_);
-  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
-  for (SparseRow::const_iterator iter_i = row->begin();
-       iter_i != row->end(); ++iter_i) {
-    index_t j1 = iter_i->feat_id;
-    index_t f1 = iter_i->field_id;
-    real_t* w1_base = v[j1].data() + f1 * align0;
-    real_t v1 = iter_i->feat_val;
-    for (SparseRow::const_iterator iter_j = iter_i+1;
-         iter_j != row->end(); ++iter_j) {
-      index_t j2 = iter_j->feat_id;
-      index_t f2 = iter_j->field_id;
-      real_t v2 = iter_j->feat_val;
-      real_t* w2_base = v[j2].data() + f2 * align0;
-      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
-      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
-      for (index_t d = 0; d < align0; d += align) {
-        real_t *w1 = w1_base + d;
-        real_t *w2 = w2_base + d;
-        __m128 XMMw1 = _mm_load_ps(w1);
-        __m128 XMMw2 = _mm_load_ps(w2);
-        __m128 XMMg1 = _mm_add_ps(
-                       _mm_mul_ps(XMMlamb, XMMw1),
-                       _mm_mul_ps(XMMpgv, XMMw2));
-        __m128 XMMg2 = _mm_add_ps(
-                       _mm_mul_ps(XMMlamb, XMMw2),
-                       _mm_mul_ps(XMMpgv, XMMw1));
-        XMMwg1 = _mm_add_ps(XMMwg1, _mm_mul_ps(XMMg1, XMMg1));
-        XMMwg2 = _mm_add_ps(XMMwg2, _mm_mul_ps(XMMg2, XMMg2));
-        _mm_store_ps(wg1, XMMwg1);
-        _mm_store_ps(wg2, XMMwg2);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &w, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      real_t &wl = weight[iter->feat_id];
+      real_t g = pg*iter->feat_val;
+      w_g[iter->feat_id] += g;
+    }
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t align0 = model.get_aligned_k();
+    index_t align = kAlign;
+    //w = model.GetParameter_v();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    __m128 XMMlr = _mm_set1_ps(learning_rate_);
+    __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
+    for (SparseRow::const_iterator iter_i = row->begin();
+        iter_i != row->end(); ++iter_i) {
+      index_t j1 = iter_i->feat_id;
+      index_t f1 = iter_i->field_id;
+      real_t* w1_base = v[j1].data() + f1 * align0;
+      real_t v1 = iter_i->feat_val;
+      for (SparseRow::const_iterator iter_j = iter_i+1;
+          iter_j != row->end(); ++iter_j) {
+        index_t j2 = iter_j->feat_id;
+        index_t f2 = iter_j->field_id;
+        real_t v2 = iter_j->feat_val;
+        real_t* w2_base = v[j2].data() + f2 * align0;
+        __m128 XMMv = _mm_set1_ps(v1*v2);
+        __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+        for (index_t d = 0; d < align0; d += align) {
+          real_t *w1 = w1_base + d;
+          real_t *w2 = w2_base + d;
+          __m128 XMMw1 = _mm_load_ps(w1);
+          __m128 XMMw2 = _mm_load_ps(w2);
+          __m128 XMMg1 = _mm_add_ps(
+              _mm_mul_ps(XMMlamb, XMMw1),
+              _mm_mul_ps(XMMpgv, XMMw2));
+          __m128 XMMg2 = _mm_add_ps(
+              _mm_mul_ps(XMMlamb, XMMw2),
+              _mm_mul_ps(XMMpgv, XMMw1));
+          XMMwg1 = _mm_add_ps(XMMwg1, _mm_mul_ps(XMMg1, XMMg1));
+          XMMwg2 = _mm_add_ps(XMMwg2, _mm_mul_ps(XMMg2, XMMg2));
+          _mm_store_ps(wg1, XMMwg1);
+          _mm_store_ps(wg2, XMMwg2);
+        }
       }
     }
   }
@@ -237,65 +252,72 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using ftrl
 void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& weight,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/  
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    real_t &wl = weight[iter->feat_id];
-    real_t g = lambda_2_*wl+pg*iter->feat_val*sqrt_norm; 
-    v_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t align0 = model.get_aligned_k();  // latent factor dim
-  index_t align1 = model.GetNumField() * align0;  // all latent factor dim for one feature;
-  index_t align = kAlign;
-  //w = model.GetParameter_v();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMalpha = _mm_set1_ps(alpha_);
-  __m128 XMML2 = _mm_set1_ps(lambda_2_);
-  for (SparseRow::const_iterator iter_i = row->begin();
-       iter_i != row->end(); ++iter_i) {
-    index_t j1 = iter_i->feat_id;
-    index_t f1 = iter_i->field_id;
-    real_t v1 = iter_i->feat_val;
-    real_t* w1_base = v[j1].data() + f1*align0;
-    for (SparseRow::const_iterator iter_j = iter_i+1;
-         iter_j != row->end(); ++iter_j) {
-      index_t j2 = iter_j->feat_id;
-      index_t f2 = iter_j->field_id;
-      real_t v2 = iter_j->feat_val;
-      real_t* w2_base = v[j2].data() + f2*align0;
-      __m128 XMMv = _mm_set1_ps(v1*v2*norm);
-      __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
-      for (index_t d = 0; d < align0; d += align) {
-        real_t *w1 = w1_base + d;
-        real_t *w2 = w2_base + d;
-        __m128 XMMw1 = _mm_load_ps(w1);
-        __m128 XMMw2 = _mm_load_ps(w2);
-        __m128 XMMg1 = _mm_add_ps(
-                       _mm_mul_ps(XMML2, XMMw1),
-                       _mm_mul_ps(XMMpgv, XMMw2));
-        __m128 XMMg2 = _mm_add_ps(
-                       _mm_mul_ps(XMML2, XMMw2),
-                       _mm_mul_ps(XMMpgv, XMMw1));
-        XMMwg1 = _mm_add_ps(XMMwg1,
-                 _mm_mul_ps(XMMg1, XMMg1));
-        XMMwg2 = _mm_add_ps(XMMwg2,
-                 _mm_mul_ps(XMMg2, XMMg2));
-        _mm_store_ps(v_g[j1].data() + d, XMMwg1);
-        _mm_store_ps(v_g[j2].data() + d, XMMwg2);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &w, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/  
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      real_t &wl = weight[iter->feat_id];
+      real_t g = lambda_2_*wl+pg*iter->feat_val; 
+      v_g[iter->feat_id] += g;
+    }
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t align0 = model.get_aligned_k();  // latent factor dim
+    index_t align1 = model.GetNumField() * align0;  // all latent factor dim for one feature;
+    index_t align = kAlign;
+    //w = model.GetParameter_v();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    __m128 XMMalpha = _mm_set1_ps(alpha_);
+    __m128 XMML2 = _mm_set1_ps(lambda_2_);
+    for (SparseRow::const_iterator iter_i = row->begin();
+        iter_i != row->end(); ++iter_i) {
+      index_t j1 = iter_i->feat_id;
+      index_t f1 = iter_i->field_id;
+      real_t v1 = iter_i->feat_val;
+      real_t* w1_base = v[j1].data() + f1*align0;
+      for (SparseRow::const_iterator iter_j = iter_i+1;
+          iter_j != row->end(); ++iter_j) {
+        index_t j2 = iter_j->feat_id;
+        index_t f2 = iter_j->field_id;
+        real_t v2 = iter_j->feat_val;
+        real_t* w2_base = v[j2].data() + f2*align0;
+        __m128 XMMv = _mm_set1_ps(v1*v2);
+        __m128 XMMpgv = _mm_mul_ps(XMMv, XMMpg);
+        for (index_t d = 0; d < align0; d += align) {
+          real_t *w1 = w1_base + d;
+          real_t *w2 = w2_base + d;
+          __m128 XMMw1 = _mm_load_ps(w1);
+          __m128 XMMw2 = _mm_load_ps(w2);
+          __m128 XMMg1 = _mm_add_ps(
+              _mm_mul_ps(XMML2, XMMw1),
+              _mm_mul_ps(XMMpgv, XMMw2));
+          __m128 XMMg2 = _mm_add_ps(
+              _mm_mul_ps(XMML2, XMMw2),
+              _mm_mul_ps(XMMpgv, XMMw1));
+          XMMwg1 = _mm_add_ps(XMMwg1,
+              _mm_mul_ps(XMMg1, XMMg1));
+          XMMwg2 = _mm_add_ps(XMMwg2,
+              _mm_mul_ps(XMMg2, XMMg2));
+          _mm_store_ps(v_g[j1].data() + d, XMMwg1);
+          _mm_store_ps(v_g[j2].data() + d, XMMwg2);
+        }
       }
     }
   }
diff --git a/src/distributed/dist_ffm_score.h b/src/distributed/dist_ffm_score.h
index 2426ed5a..ebda60f7 100644
--- a/src/distributed/dist_ffm_score.h
+++ b/src/distributed/dist_ffm_score.h
@@ -42,6 +42,7 @@ class DistFFMScore : public DistScore {
  // Given one exmaple and current model, this method
  // returns the ffm score.
  real_t CalcScore(const SparseRow* row,
+     Model& model,
      std::map<index_t, real_t>* weight,
      std::map<index_t, std::vector<real_t>>* v,
      real_t norm = 1.0
@@ -50,11 +51,12 @@ class DistFFMScore : public DistScore {
  // Calculate gradient and update current
  // model parameters.
  void DistCalcGrad(const DMatrix* matrix,
+     Model& model,
      std::map<index_t, real_t>& w,
-     std::map<index_t, std::vector<real_t>>* v,
+     std::map<index_t, std::vector<real_t>>& v,
      real_t* sum,
      std::map<index_t, real_t>& w_g,
-     std::map<index_t, real_t>& v_g,
+     std::map<index_t, std::vector<real_t>>& v_g,
      index_t start_idx,
      index_t end_idx
      );
@@ -62,30 +64,33 @@ class DistFFMScore : public DistScore {
  protected:
   // Calculate gradient and update model using sgd
  void calc_grad_sgd(const DMatrix* matrix,
+     Model& model,
      std::map<index_t, real_t>& w,
-     std::map<index_t, std::vector<real_t>>* v,
+     std::map<index_t, std::vector<real_t>>& v,
      real_t* sum,
      std::map<index_t, real_t>& w_g,
-     std::map<index_t, real_t>& v_g,
+     std::map<index_t, std::vector<real_t>>& v_g,
      index_t start_idx,
      index_t end_idx
      );
 
   // Calculate gradient and update model using adagrad
  void calc_grad_adagrad(const DMatrix* matrix,
+     Model& model,
      std::map<index_t, real_t>& w,
-     std::map<index_t, std::vector<real_t>>* v,
+     std::map<index_t, std::vector<real_t>>& v,
      real_t* sum,
      std::map<index_t, real_t>& w_g,
-     std::map<index_t, real_t>& v_g,
+     std::map<index_t, std::vector<real_t>>& v_g,
      index_t start_idx,
      index_t end_idx
      );
 
   // Calculate gradient and update model using ftrl
  void calc_grad_ftrl(const DMatrix* matrix,
+     Model& model,
      std::map<index_t, real_t>& w,
-     std::map<index_t, std::vector<real_t>>* v,
+     std::map<index_t, std::vector<real_t>>& v,
      real_t* sum,
      std::map<index_t, real_t>& w_g,
      std::map<index_t, real_t>& v_g,
diff --git a/src/distributed/dist_fm_score.cc b/src/distributed/dist_fm_score.cc
index e17368c4..372aab83 100644
--- a/src/distributed/dist_fm_score.cc
+++ b/src/distributed/dist_fm_score.cc
@@ -28,11 +28,11 @@ namespace xLearn {
 
 // y = sum( (V_i*V_j)(x_i * x_j) )
 // Using SSE to accelerate vector operation.
-  real_t DistFMScore::CalcScore(const SparseRow* row,
+real_t DistFMScore::CalcScore(const SparseRow* row,
+      Model& model,
       std::map<index_t, real_t>* weight,
       std::map<index_t, std::vector<real_t>>* v,
-      real_t norm = 1.0
-      ) {
+      real_t norm) {
   /*********************************************************
    *  linear term and bias term                            *
    *********************************************************/
@@ -40,8 +40,7 @@ namespace xLearn {
   real_t t = 0;
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
-    t += (iter->feat_val *
-          weight[iter->feat_id] *
+    t += (iter->feat_val * ((*weight)[iter->feat_id]) *
           sqrt_norm);
   }
   /*********************************************************
@@ -54,9 +53,9 @@ namespace xLearn {
        iter != row->end(); ++iter) {
     index_t j1 = iter->feat_id;
     real_t v1 = iter->feat_val;
-    real_t *w = v[j1].data();
+    real_t *w = (*v)[j1].data();
     __m128 XMMv = _mm_set1_ps(v1*norm);
-    real_t* s = v[j1].data();
+    real_t* s = (*v)[j1].data();
     for (index_t d = 0; d < aligned_k; d += kAlign) {
       __m128 XMMs = _mm_load_ps(s+d);
       __m128 const XMMw = _mm_load_ps(w+d);
@@ -69,7 +68,7 @@ namespace xLearn {
        iter != row->end(); ++iter) {
     index_t j1 = iter->feat_id;
     real_t v1 = iter->feat_val;
-    real_t* w = v[j1].data();
+    real_t* w = (*v)[j1].data();
     __m128 XMMv = _mm_set1_ps(v1*norm);
     for (index_t d = 0; d < aligned_k; d += kAlign) {
       __m128 XMMs = _mm_load_ps(s+d);
@@ -91,8 +90,9 @@ namespace xLearn {
 // Calculate gradient and update current model parameters.
 // Using SSE to accelerate vector operation.
 void DistFMScore::DistCalcGrad(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& w,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
@@ -101,199 +101,210 @@ void DistFMScore::DistCalcGrad(const DMatrix* matrix,
     ) {
   // Using sgd
   if (opt_type_.compare("sgd") == 0) {
-    this->calc_grad_sgd(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_sgd(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using adagrad
   else if (opt_type_.compare("adagrad") == 0) {
-    this->calc_grad_adagrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_adagrad(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using ftrl 
   else if (opt_type_.compare("ftrl") == 0) {
-    this->calc_grad_ftrl(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+    this->calc_grad_ftrl(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
 }
 
 // Calculate gradient and update current model using sgd
 void DistFMScore::calc_grad_sgd(const DMatrix* matrix,
-    std::map<index_t, real_t>& w,
-    std::map<index_t, std::vector<real_t>>* v,
+    Model& model,
+    std::map<index_t, real_t>& weight,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/  
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    real_t &wl = weight[iter->feat_id];
-    real_t g = pg*iter->feat_val*sqrt_norm;
-    w_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t aligned_k = model.get_aligned_k();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMlr = _mm_set1_ps(learning_rate_);
-  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
-  std::vector<real_t> sv(aligned_k, 0);
-  real_t* s = sv.data();
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t* w = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    for (index_t d = 0; d < aligned_k; d += kAlign) {
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 const XMMw = _mm_load_ps(w+d);
-      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
-      _mm_store_ps(s+d, XMMs);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &weight, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/  
+    for (SparseRow::const_iterator iter = row->begin();
+         iter != row->end(); ++iter) {
+      real_t g = pg*iter->feat_val;
+      w_g[iter->feat_id] += g;
     }
-  }
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t* w = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
-    real_t* v_gradient = v_g[j1].data();
-    for(index_t d = 0; d < aligned_k; d += kAlign) {
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 XMMw = _mm_load_ps(w+d);
-      __m128 XMMg = _mm_add_ps(_mm_mul_ps(XMMlamb, XMMw),
-        _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
-        _mm_mul_ps(XMMw, XMMv))));
-      _mm_store_ps(v_gradient+d, XMMg);
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t aligned_k = model.get_aligned_k();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    std::vector<real_t> sv(aligned_k, 0);
+    real_t* s = sv.data();
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t* w = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      for (index_t d = 0; d < aligned_k; d += kAlign) {
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 const XMMw = _mm_load_ps(w+d);
+        XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+        _mm_store_ps(s+d, XMMs);
+      }
+    }
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t* w = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+      real_t* v_gradient = v_g[j1].data();
+      for(index_t d = 0; d < aligned_k; d += kAlign) {
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 XMMw = _mm_load_ps(w+d);
+        __m128 XMMg = _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
+                _mm_mul_ps(XMMw, XMMv)));
+        _mm_store_ps(v_gradient+d, XMMg);
+      }
     }
   }
 }
 
 // Calculate gradient and update current model using adagrad
 void DistFMScore::calc_grad_adagrad(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& weight,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-      iter != row->end(); ++iter) {
-    real_t &wl = weight[iter->feat_id];
-    real_t g = regu_lambda_*wl+pg*iter->feat_val*sqrt_norm;
-    w_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t aligned_k = model.get_aligned_k();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMlr = _mm_set1_ps(learning_rate_);
-  __m128 XMMlamb = _mm_set1_ps(regu_lambda_);
-  std::vector<real_t> sv(aligned_k, 0);
-  real_t* s = sv.data();
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t *w = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    for (index_t d = 0; d < aligned_k; d += kAlign) {
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 const XMMw = _mm_load_ps(w+d);
-      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
-      _mm_store_ps(s+d, XMMs);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &weight, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      real_t &wl = weight[iter->feat_id];
+      real_t g = regu_lambda_*wl+pg*iter->feat_val;
+      w_g[iter->feat_id] += g;
     }
-  }
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t* w = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
-    real_t* v_gradient = v_g[j1].data();
-    for(index_t d = 0; d < aligned_k; d += kAlign) {
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 XMMg = _mm_add_ps(_mm_mul_ps(XMMlamb, XMMw),
-      _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
-        _mm_mul_ps(XMMw, XMMv))));
-      _mm_store_ps(v_gradient+d, XMMpgv);
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t aligned_k = model.get_aligned_k();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    std::vector<real_t> sv(aligned_k, 0);
+    real_t* s = sv.data();
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t *w = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      for (index_t d = 0; d < aligned_k; d += kAlign) {
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 const XMMw = _mm_load_ps(w+d);
+        XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+        _mm_store_ps(s+d, XMMs);
+      }
+    }
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t* w = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+      real_t* v_gradient = v_g[j1].data();
+      for(index_t d = 0; d < aligned_k; d += kAlign) {
+        __m128 XMMw = _mm_load_ps(w+d);
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 XMMg = _mm_mul_ps(XMMpgv, _mm_sub_ps(XMMs,
+                _mm_mul_ps(XMMw, XMMv)));
+        _mm_store_ps(v_gradient+d, XMMg);
+      }
     }
   }
 }
 
 // Calculate gradient and update current model using ftrl
 void DistFMScore::calc_grad_ftrl(const DMatrix* matrix,
+    Model& model,
     std::map<index_t, real_t>& w,
-    std::map<index_t, std::vector<real_t>>* v,
+    std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
     std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
-  /*********************************************************
-   *  linear term and bias term                            *
-   *********************************************************/
-  real_t sqrt_norm = sqrt(norm);
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    real_t g = pg*iter->feat_val*sqrt_norm; 
-    w_g[iter->feat_id] += g;
-  }
-  /*********************************************************
-   *  latent factor                                        *
-   *********************************************************/
-  index_t aligned_k = model.get_aligned_k();
-  __m128 XMMpg = _mm_set1_ps(pg);
-  __m128 XMMalpha = _mm_set1_ps(alpha_);
-  __m128 XMML2 = _mm_set1_ps(lambda_2_);
-  std::vector<real_t> sv(aligned_k, 0);
-  real_t* s = sv.data();
- for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t *w = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    for (index_t d = 0; d < aligned_k; d += kAlign) {
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 const XMMw = _mm_load_ps(w+d);
-      XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
-      _mm_store_ps(s+d, XMMs);
+  for (index_t i = start_idx; i < end_idx; ++i) {
+    SparseRow* row = matrix->row[i];
+    real_t pred = CalcScore(row, model, &w, &v);
+    real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
+    (*sum) += log1p(exp(-y*pred));
+    real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
+    /*********************************************************
+     *  linear term and bias term                            *
+     *********************************************************/
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      real_t g = pg*iter->feat_val;
+      w_g[iter->feat_id] += g;
     }
-  }
-  for (SparseRow::const_iterator iter = row->begin();
-       iter != row->end(); ++iter) {
-    index_t j1 = iter->feat_id;
-    real_t v1 = iter->feat_val;
-    real_t *w_base = v[j1].data();
-    __m128 XMMv = _mm_set1_ps(v1*norm);
-    __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
-    real_t* v_gradient = v_g[j1].data();
-    for (index_t d = 0; d < aligned_k; d += kAlign) {
-      real_t* w = w_base + d;
-      __m128 XMMs = _mm_load_ps(s+d);
-      __m128 XMMw = _mm_load_ps(w);
-      __m128 XMMg = _mm_add_ps(
-                    _mm_mul_ps(XMML2, XMMw),
-                    _mm_mul_ps(XMMpgv,
-                    _mm_sub_ps(XMMs,
-                      _mm_mul_ps(XMMw, XMMv))));
-      // Update w. SSE mat not faster.
-      __mm_store_ps(v_gradient+d, XMMg);
+    /*********************************************************
+     *  latent factor                                        *
+     *********************************************************/
+    index_t aligned_k = model.get_aligned_k();
+    __m128 XMMpg = _mm_set1_ps(pg);
+    std::vector<real_t> sv(aligned_k, 0);
+    real_t* s = sv.data();
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t *w = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      for (index_t d = 0; d < aligned_k; d += kAlign) {
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 const XMMw = _mm_load_ps(w+d);
+        XMMs = _mm_add_ps(XMMs, _mm_mul_ps(XMMw, XMMv));
+        _mm_store_ps(s+d, XMMs);
+      }
+    }
+    for (SparseRow::const_iterator iter = row->begin();
+        iter != row->end(); ++iter) {
+      index_t j1 = iter->feat_id;
+      real_t v1 = iter->feat_val;
+      real_t *w_base = v[j1].data();
+      __m128 XMMv = _mm_set1_ps(v1);
+      __m128 XMMpgv = _mm_mul_ps(XMMpg, XMMv);
+      real_t* v_gradient = v_g[j1].data();
+      for (index_t d = 0; d < aligned_k; d += kAlign) {
+        real_t* w = w_base + d;
+        __m128 XMMs = _mm_load_ps(s+d);
+        __m128 XMMw = _mm_load_ps(w);
+        __m128 XMMg = _mm_mul_ps(XMMpgv,
+              _mm_sub_ps(XMMs,
+                _mm_mul_ps(XMMw, XMMv)));
+        // Update w. SSE mat not faster.
+        _mm_store_ps(v_gradient+d, XMMg);
+      }
     }
   }
 }
diff --git a/src/distributed/dist_fm_score.h b/src/distributed/dist_fm_score.h
index c69e622e..6f9d30fc 100644
--- a/src/distributed/dist_fm_score.h
+++ b/src/distributed/dist_fm_score.h
@@ -42,6 +42,7 @@ class DistFMScore : public DistScore {
   // Given one exmaple and current model, this method
   // returns the fm score.
   real_t CalcScore(const SparseRow* row,
+                   Model& model,
                    std::map<index_t, real_t>* w,
                    std::map<index_t, std::vector<real_t>>* v,
                    real_t norm = 1.0);
@@ -49,11 +50,12 @@ class DistFMScore : public DistScore {
   // Calculate gradient and update current
   // model parameters.
   void DistCalcGrad(const DMatrix* matrix,
+                    Model& model,
                     std::map<index_t, real_t>& w,
-                    std::map<index_t, std::vector<real_t>>* v,
+                    std::map<index_t, std::vector<real_t>>& v,
                     real_t* sum,
                     std::map<index_t, real_t>& w_g,
-                    std::map<index_t, real_t>& v_g,
+                    std::map<index_t, std::vector<real_t>>& v_g,
                     index_t start_idx,
                     index_t end_idx
                    );
@@ -61,35 +63,38 @@ class DistFMScore : public DistScore {
  protected:
   // Calculate gradient and update model using sgd
   void calc_grad_sgd(const DMatrix* matrix,
+                     Model& model,
                      std::map<index_t, real_t>& w,
-                     std::map<index_t, std::vector<real_t>>* v,
+                     std::map<index_t, std::vector<real_t>>& v,
                      real_t* sum,
                      std::map<index_t, real_t>& w_g,
-                     std::map<index_t, real_t>& v_g,
-                     real_t start_idx,
-                     real_t end_idx
+                     std::map<index_t, std::vector<real_t>>& v_g,
+                     index_t start_idx,
+                     index_t end_idx
                     );
 
   // Calculate gradient and update model using adagrad
   void calc_grad_adagrad(const DMatrix* matrix,
+                         Model& model,
                          std::map<index_t, real_t>& w,
-                         std::map<index_t, std::vector<real_t>>* v,
+                         std::map<index_t, std::vector<real_t>>& v,
                          real_t* sum,
                          std::map<index_t, real_t>& w_g,
-                         std::map<index_t, real_t>& v_g,
-                         real_t start_idx,
-                         real_t end_idx
+                         std::map<index_t, std::vector<real_t>>& v_g,
+                         index_t start_idx,
+                         index_t end_idx
                         );
 
   // Calculate gradient and update model using ftrl
   void calc_grad_ftrl(const DMatrix* matrix,
+                      Model& model,
                       std::map<index_t, real_t>& w,
-                      std::map<index_t, std::vector<real_t>>* v,
+                      std::map<index_t, std::vector<real_t>>& v,
                       real_t* sum,
                       std::map<index_t, real_t>& w_g,
-                      std::map<index_t, real_t>& v_g,
-                      real_t start_idx,
-                      real_t end_idx
+                      std::map<index_t, std::vector<real_t>>& v_g,
+                      index_t start_idx,
+                      index_t end_idx
                       );
  private:
   real_t* comp_res = nullptr;
diff --git a/src/distributed/dist_linear_score.cc b/src/distributed/dist_linear_score.cc
index 1bc0decc..bf0c98c7 100644
--- a/src/distributed/dist_linear_score.cc
+++ b/src/distributed/dist_linear_score.cc
@@ -26,49 +26,57 @@ namespace xLearn {
 
 // y = wTx (incluing bias term)
 real_t DistLinearScore::CalcScore(const SparseRow* row,
-                                  std::map<index_t, real_t>* w,
+                                  Model& model,
+                                  std::map<index_t, real_t>* weight,
+                                  std::map<index_t, std::vector<real_t>>* v,
                                   real_t norm) {
   real_t score = 0.0;
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
     index_t idx = iter->feat_id;
-    score += (*w)[idx] * iter->feat_val;
+    score += (*weight)[idx] * iter->feat_val;
   }
   return score;
 }
 
 // Calculate gradient and update current model
 void DistLinearScore::DistCalcGrad(const DMatrix* matrix,
+                            Model& model,
                            std::map<index_t, real_t>& w,
+                           std::map<index_t, std::vector<real_t>>& v,
                            real_t* sum,
-                           std::map<index_t, real_t>& g,
+                           std::map<index_t, real_t>& w_g,
+                           std::map<index_t, std::vector<real_t>>& v_g,
                            index_t start_idx,
                            index_t end_idx) {
   // Using sgd
   if (opt_type_.compare("sgd") == 0) {
-    this->calc_grad_sgd(matrix, w, sum, g, start_idx, end_idx);
+    this->calc_grad_sgd(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using adagrad
   else if (opt_type_.compare("adagrad") == 0) {
-    this->calc_grad_adagrad(matrix, w, sum, g, start_idx, end_idx);
+    this->calc_grad_adagrad(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
   // Using ftrl
   else if (opt_type_.compare("ftrl") == 0) {
-    this->calc_grad_ftrl(matrix, w, sum, g, start_idx, end_idx);
+    this->calc_grad_ftrl(matrix, model, w, v, sum, w_g, v_g, start_idx, end_idx);
   }
 }
 
 // Calculate gradient and update current model using sgd
 void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
+                                    Model& model,
                                 std::map<index_t, real_t>& w,
+                                std::map<index_t, std::vector<real_t>>& v,
                                 real_t* sum,
                                 std::map<index_t, real_t>& g,
+                                std::map<index_t, std::vector<real_t>>& v_g,
                                 real_t start_idx,
                                 real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, &w);
+    real_t pred = CalcScore(row, model, &w, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -84,15 +92,18 @@ void DistLinearScore::calc_grad_sgd(const DMatrix* matrix,
 
 // Calculate gradient and update current model using adagrad
 void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
+                                        Model& model,
                                     std::map<index_t, real_t>& w,
+                                    std::map<index_t, std::vector<real_t>>& v,
                                     real_t* sum,
                                     std::map<index_t, real_t>& g,
+                                    std::map<index_t, std::vector<real_t>>& v_g,
                                     real_t start_idx,
                                     real_t end_idx) {
   // linear term
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, &w);
+    real_t pred = CalcScore(row, model, &w, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -108,14 +119,17 @@ void DistLinearScore::calc_grad_adagrad(const DMatrix* matrix,
 
 // Calculate gradient and update current model using ftrl
 void DistLinearScore::calc_grad_ftrl(const DMatrix* matrix,
+                                 Model& model,
                                  std::map<index_t, real_t>& w,
+                                 std::map<index_t, std::vector<real_t>>& v,
                                  real_t* sum,
                                  std::map<index_t, real_t>& g,
+                                 std::map<index_t, std::vector<real_t>>& v_g,
                                  real_t start_idx,
                                  real_t end_idx) {
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, &w);
+    real_t pred = CalcScore(row, model, &w, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y * pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
diff --git a/src/distributed/dist_linear_score.h b/src/distributed/dist_linear_score.h
index add75089..5e7a4142 100644
--- a/src/distributed/dist_linear_score.h
+++ b/src/distributed/dist_linear_score.h
@@ -41,49 +41,54 @@ class DistLinearScore : public DistScore {
   // Given one exmaple and current model, this method
   // returns the linear score wTx.
   real_t CalcScore(const SparseRow* row,
+                   Model& model,
                    std::map<index_t, real_t>* w,
                    std::map<index_t, std::vector<real_t>>* v,
                    real_t norm = 1.0);
 
   void DistCalcGrad(const DMatrix* matrix,
+                     Model& model,
                      std::map<index_t, real_t>& w,
-                     std::map<index_t, std::vector<real_t>>* v,
+                     std::map<index_t, std::vector<real_t>>& v,
                      real_t* sum,
                      std::map<index_t, real_t>& g,
-                     std::map<index_t, real_t>& v_g,
+                     std::map<index_t, std::vector<real_t>>& v_g,
                      index_t start_idx,
                      index_t end_idx);
 
  protected:
   // Calculate gradient and update model using sgd
   void calc_grad_sgd(const DMatrix* matrix,
+                     Model& model,
                      std::map<index_t, real_t>& w,
-                     std::map<index_t, std::vector<real_t>>* v,
+                     std::map<index_t, std::vector<real_t>>& v,
                      real_t* sum,
                      std::map<index_t, real_t>& g,
-                     std::map<index_t, real_t>& v_g,
+                     std::map<index_t, std::vector<real_t>>& v_g,
                      real_t start_idx,
                      real_t end_idx
                     );
 
   // Calculate gradient and update model using adagrad
   void calc_grad_adagrad(const DMatrix* matrix,
+                         Model& model,
                          std::map<index_t, real_t>& w,
-                         std::map<index_t, std::vector<real_t>>* v,
+                         std::map<index_t, std::vector<real_t>>& v,
                          real_t* sum,
                          std::map<index_t, real_t>& g,
-                         std::map<index_t, real_t>& v_g,
+                         std::map<index_t, std::vector<real_t>>& v_g,
                          real_t start_idx,
                          real_t end_idx
                         );
 
   // Calculate gradient and update model using ftrl
   void calc_grad_ftrl(const DMatrix* matrix,
+                      Model& model, 
                       std::map<index_t, real_t>& w,
-                      std::map<index_t, std::vector<real_t>>* v,
+                      std::map<index_t, std::vector<real_t>>& v,
                       real_t* sum,
                       std::map<index_t, real_t>& g,
-                      std::map<index_t, real_t>& v_g,
+                      std::map<index_t, std::vector<real_t>>& v_g,
                       real_t start_idx,
                       real_t end_idx
                      );
diff --git a/src/distributed/dist_score_function.h b/src/distributed/dist_score_function.h
index f5dc7f93..1e43d09c 100644
--- a/src/distributed/dist_score_function.h
+++ b/src/distributed/dist_score_function.h
@@ -73,16 +73,18 @@ class DistScore {
   // Given one exmaple and current model, this method
   // returns the score
   virtual real_t CalcScore(const SparseRow* row,
+                           Model& model,
                            std::map<index_t, real_t>* w,
                            std::map<index_t, std::vector<real_t>>* v,
                            real_t norm = 1.0) = 0;
 
   virtual void DistCalcGrad(const DMatrix* matrix,
+                            Model& model,
                                std::map<index_t, real_t>& w,
-                               std::map<index_t, std::vector<real_t>>* v,
+                               std::map<index_t, std::vector<real_t>>& v,
                                real_t* sum,
                                std::map<index_t, real_t>& g,
-                               std::map<index_t, real_t>& v_g,
+                               std::map<index_t, std::vector<real_t>>& v_g,
                                index_t start_idx,
                                index_t end_idx) = 0;
 

From f33b6179e5456b8fe63dbdfa50a7e719e7c10c0b Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 31 Dec 2017 15:41:43 +0800
Subject: [PATCH 81/82] update: dist_ffm_score.h

---
 src/distributed/dist_ffm_score.cc | 35 ++++++++++++++++++-------------
 src/distributed/dist_ffm_score.h  |  2 +-
 2 files changed, 22 insertions(+), 15 deletions(-)

diff --git a/src/distributed/dist_ffm_score.cc b/src/distributed/dist_ffm_score.cc
index 2e40b529..cf790bf3 100644
--- a/src/distributed/dist_ffm_score.cc
+++ b/src/distributed/dist_ffm_score.cc
@@ -21,7 +21,7 @@ This file is the implementation of FFMScore class.
 
 #include <pmmintrin.h>  // for SSE
 
-#include "src/score/ffm_score.h"
+#include "src/distributed/dist_ffm_score.h"
 #include "src/base/math.h"
 
 namespace xLearn {
@@ -32,7 +32,7 @@ namespace xLearn {
       Model& model,
       std::map<index_t, real_t>* weight,
       std::map<index_t, std::vector<real_t>>* v,
-      real_t norm = 1.0
+      real_t norm
       ) {
     /*********************************************************
    *  linear term and bias term                            *
@@ -42,16 +42,15 @@ namespace xLearn {
   for (SparseRow::const_iterator iter = row->begin();
        iter != row->end(); ++iter) {
     sum_w += (iter->feat_val * 
-              weight[iter->feat_id] * 
+              (*weight)[iter->feat_id] * 
               sqrt_norm);
   }
   /*********************************************************
    *  latent factor                                        *
    *********************************************************/
-  index_t align0 = aux_size * model.get_aligned_k();
+  index_t align0 = model.get_aligned_k();
   index_t align1 = model.GetNumField() * align0;
-  int align = kAlign * aux_size;
-  //w = model.GetParameter_v();
+  int align = kAlign;
   __m128 XMMt = _mm_setzero_ps();
   for (SparseRow::const_iterator iter_i = row->begin();
        iter_i != row->end(); ++iter_i) {
@@ -63,8 +62,8 @@ namespace xLearn {
       index_t j2 = iter_j->feat_id;
       index_t f2 = iter_j->field_id;
       real_t v2 = iter_j->feat_val;
-      real_t* w1_base = v[j1].data();
-      real_t* w2_base = v[j2].data();
+      real_t* w1_base = (*v)[j1].data();
+      real_t* w2_base = (*v)[j2].data();
       __m128 XMMv = _mm_set1_ps(v1*v2*norm);
       for (index_t d = 0; d < align0; d += align) {
         __m128 XMMw1 = _mm_load_ps(w1_base + d);
@@ -85,13 +84,13 @@ namespace xLearn {
 
 // Calculate gradient and update current model.
 // Using the SSE to accelerate vector operation.
-void DistFFMScore::CalcGrad(const DMatrix* matrix,
+void DistFFMScore::DistCalcGrad(const DMatrix* matrix,
     Model& model,
     std::map<index_t, real_t>& w,
     std::map<index_t, std::vector<real_t>>& v,
     real_t* sum,
     std::map<index_t, real_t>& w_g,
-    std::map<index_t, real_t>& v_g,
+    std::map<index_t, std::vector<real_t>>& v_g,
     index_t start_idx,
     index_t end_idx
     ) {
@@ -122,7 +121,7 @@ void DistFFMScore::calc_grad_sgd(const DMatrix* matrix,
     ) {
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, model, &w, &v);
+    real_t pred = CalcScore(row, model, &weight, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -193,7 +192,7 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
     ) {
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, model, &w, &v);
+    real_t pred = CalcScore(row, model, &weight, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -234,6 +233,10 @@ void DistFFMScore::calc_grad_adagrad(const DMatrix* matrix,
           real_t *w2 = w2_base + d;
           __m128 XMMw1 = _mm_load_ps(w1);
           __m128 XMMw2 = _mm_load_ps(w2);
+          real_t *wg1 = w1 + kAlign;
+          real_t *wg2 = w2 + kAlign;
+          __m128 XMMwg1 = _mm_load_ps(wg1);
+          __m128 XMMwg2 = _mm_load_ps(wg2);
           __m128 XMMg1 = _mm_add_ps(
               _mm_mul_ps(XMMlamb, XMMw1),
               _mm_mul_ps(XMMpgv, XMMw2));
@@ -263,7 +266,7 @@ void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
     ) {
   for (index_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = matrix->row[i];
-    real_t pred = CalcScore(row, model, &w, &v);
+    real_t pred = CalcScore(row, model, &weight, &v);
     real_t y = matrix->Y[i] > 0 ? 1.0 : -1.0;
     (*sum) += log1p(exp(-y*pred));
     real_t pg = -y / (1.0 + (1.0 / exp(-y * pred)));
@@ -274,7 +277,7 @@ void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
         iter != row->end(); ++iter) {
       real_t &wl = weight[iter->feat_id];
       real_t g = lambda_2_*wl+pg*iter->feat_val; 
-      v_g[iter->feat_id] += g;
+      w_g[iter->feat_id] += g;
     }
     /*********************************************************
      *  latent factor                                        *
@@ -305,6 +308,10 @@ void DistFFMScore::calc_grad_ftrl(const DMatrix* matrix,
           real_t *w2 = w2_base + d;
           __m128 XMMw1 = _mm_load_ps(w1);
           __m128 XMMw2 = _mm_load_ps(w2);
+          real_t *wg1 = w1 + kAlign;
+          real_t *wg2 = w2 + kAlign;
+          __m128 XMMwg1 = _mm_load_ps(wg1);
+          __m128 XMMwg2 = _mm_load_ps(wg2);
           __m128 XMMg1 = _mm_add_ps(
               _mm_mul_ps(XMML2, XMMw1),
               _mm_mul_ps(XMMpgv, XMMw2));
diff --git a/src/distributed/dist_ffm_score.h b/src/distributed/dist_ffm_score.h
index ebda60f7..b280cc11 100644
--- a/src/distributed/dist_ffm_score.h
+++ b/src/distributed/dist_ffm_score.h
@@ -93,7 +93,7 @@ class DistFFMScore : public DistScore {
      std::map<index_t, std::vector<real_t>>& v,
      real_t* sum,
      std::map<index_t, real_t>& w_g,
-     std::map<index_t, real_t>& v_g,
+     std::map<index_t, std::vector<real_t>>& v_g,
      index_t start_idx,
      index_t end_idx
      );

From e6ea10d29b9d8bdc7b92f52e58a5c10b5e4d5470 Mon Sep 17 00:00:00 2001
From: xswang <2012wxs@gmail.com>
Date: Sun, 31 Dec 2017 15:42:12 +0800
Subject: [PATCH 82/82] update: dist_cross_entropy_loss.cc

---
 src/distributed/dist_cross_entropy_loss.cc | 8 ++++++--
 1 file changed, 6 insertions(+), 2 deletions(-)

diff --git a/src/distributed/dist_cross_entropy_loss.cc b/src/distributed/dist_cross_entropy_loss.cc
index 84fe00a6..33980cac 100644
--- a/src/distributed/dist_cross_entropy_loss.cc
+++ b/src/distributed/dist_cross_entropy_loss.cc
@@ -28,6 +28,7 @@ This file is the implementation of CrossEntropyLoss class.
 namespace xLearn {
 
 static void pred_thread(const DMatrix* data_matrix,
+                        Model* model,
                         std::map<index_t, real_t>& w,
                         std::map<index_t, std::vector<real_t>>& v,
                         std::vector<real_t>* pred,
@@ -39,7 +40,7 @@ static void pred_thread(const DMatrix* data_matrix,
   for (size_t i = start_idx; i < end_idx; ++i) {
     SparseRow* row = data_matrix->row[i];
     real_t norm = is_norm ? data_matrix->norm[i] : 1.0;
-    (*pred)[i] = dist_score_func->CalcScore(row, &w, &v, norm);
+    (*pred)[i] = dist_score_func->CalcScore(row, *model, &w, &v, norm);
   }
 }
 
@@ -86,6 +87,7 @@ void DistCrossEntropyLoss::Predict(const DMatrix* data_matrix,
     size_t end_idx = getEnd(row_len, threadNumber_, i);
     pool_->enqueue(std::bind(pred_thread,
           data_matrix,
+          &model,
           std::ref(weight_map),
           std::ref(v_map),
           &pred,
@@ -152,6 +154,7 @@ void DistCrossEntropyLoss::Evalute(const std::vector<real_t>& pred,
 
 // Calculate gradient in one thread.
 static void ce_gradient_thread(const DMatrix* matrix,
+                               Model* model,
                                std::map<index_t, real_t>& w,
                                std::map<index_t, std::vector<real_t>>& v,
                                DistScore* dist_score_func,
@@ -162,7 +165,7 @@ static void ce_gradient_thread(const DMatrix* matrix,
                                size_t start_idx,
                                size_t end_idx) {
   CHECK_GE(end_idx, start_idx);
-  dist_score_func->DistCalcGrad(matrix, w, v, sum, w_g, v_g, start_idx, end_idx);
+  dist_score_func->DistCalcGrad(matrix, *model, w, v, sum, w_g, v_g, start_idx, end_idx);
 }
 
 //------------------------------------------------------------------------------
@@ -238,6 +241,7 @@ void DistCrossEntropyLoss::CalcGrad(const DMatrix* matrix,
     index_t end_idx = getEnd(row_len, count, i);
     pool_->enqueue(std::bind(ce_gradient_thread,
                              matrix,
+                             &model,
                              std::ref(weight_map),
                              std::ref(v_map),
                              dist_score_func_,