{"action":"created","comment":{"url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/comments/55269854","id":55269854,"diff_hunk":"@@ -0,0 +1,432 @@\n+/**\n+ *   Copyright 2016 Pivotal Software, Inc.\n+ *\n+ *   Licensed under the Apache License, Version 2.0 (the \"License\");\n+ *   you may not use this file except in compliance with the License.\n+ *   You may obtain a copy of the License at\n+ *\n+ *       http://www.apache.org/licenses/LICENSE-2.0\n+ *\n+ *   Unless required by applicable law or agreed to in writing, software\n+ *   distributed under the License is distributed on an \"AS IS\" BASIS,\n+ *   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n+ *   See the License for the specific language governing permissions and\n+ *   limitations under the License.\n+ **/\n+\n+#ifndef QUICKSTEP_STORAGE_SMA_INDEX_SUB_BLOCK_HPP_\n+#define QUICKSTEP_STORAGE_SMA_INDEX_SUB_BLOCK_HPP_\n+\n+#include <cstddef>\n+#include <exception>\n+#include <iostream>\n+#include <string>\n+#include <vector>\n+\n+#include \"catalog/CatalogAttribute.hpp\"\n+#include \"expressions/predicate/PredicateCost.hpp\"\n+#include \"storage/IndexSubBlock.hpp\"\n+#include \"storage/StorageConstants.hpp\"\n+#include \"storage/SubBlockTypeRegistryMacros.hpp\"\n+#include \"types/TypedValue.hpp\"\n+#include \"types/operations/binary_operations/BinaryOperation.hpp\"\n+#include \"types/operations/comparisons/Comparison.hpp\"\n+#include \"types/operations/comparisons/ComparisonID.hpp\"\n+#include \"types/operations/comparisons/ComparisonFactory.hpp\"\n+#include \"utility/BitVector.hpp\"\n+#include \"utility/Macros.hpp\"\n+#include \"utility/PtrVector.hpp\"\n+\n+#include \"glog/logging.h\"\n+\n+namespace quickstep {\n+\n+class SMAIndexSubBlock;\n+\n+QUICKSTEP_DECLARE_SUB_BLOCK_TYPE_REGISTERED(SMAIndexSubBlock);\n+\n+/**\n+ * Namespace contains helper functions of the SMA block. This includes functions\n+ * to find the selectivity of predicates over a storage subblock. Also includes\n+ * structs that make up the index.\n+ */\n+namespace sma_internal {\n+/**\n+ * @brief Roughly describes how many tuples of a subblock will be selected by\n+ *        a predicate.\n+ * @details kAll, kNone indicate that the SMA has determined that all, or none\n+ *          of the tuples will be selected. kSome means that some tuples may be\n+ *          selected, but a scan must be performed. kUnknown indicates that the\n+ *          SMA tried to answer the predicate but did not have enough information.\n+ *          kUnsolved indicates that the predicate has been created but not\n+ *          analyzed by the SMA.\n+ */\n+enum class Selectivity {\n+  kAll,      // Select all tuples in storage subblock.\n+  kSome,     // Select some of the tuples.\n+  kNone,     // Select none of the tuples.\n+  kUnknown,  // The predicate cannot be determined.\n+  kUnsolved  // We have not tried to determine the selectivity.\n+};\n+\n+/**\n+ * @brief Helper method. Uses the stored values from the SMA Index to determine\n+ *        selectivity of a predicate.\n+ *\n+ * @param literal The literal value to compare against.\n+ * @param comparison The id of the predicate comparison function.\n+ * @param min The minimum value associated with that attribute.\n+ * @param max The maximum value associated with that attribute.\n+ * @param less_comparator The less comparator for the attribute type.\n+ * @param equals_comparator  The equals comparator for the attribute type.\n+ * \n+ * @return Selectivity of this predicate.\n+ */\n+Selectivity getSelectivity(const TypedValue &literal,\n+                           const ComparisonID comparison,\n+                           const TypedValue &min,\n+                           const TypedValue &max,\n+                           const UncheckedComparator *less_comparator,\n+                           const UncheckedComparator *equals_comparator);\n+\n+/**\n+ * @brief A simple holding struct for a comparison predicate. Selectivity enum\n+ *        indicates if the SMA has been used to solve the predicate and if so,\n+ *        what is the selectivity over the block.\n+ */\n+struct SMAPredicate {\n+  /**\n+   * @brief Extracts a comparison predicate into an SMAPredicate.\n+   *\n+   * @param predicate A comparison of the form {attribute} {comparison} {literal}\n+   *                  or {literal} {comparison} {attribute}.\n+   * @return An SMAPredicate pointer which the caller must manage.\n+   */\n+  static SMAPredicate* ExtractSMAPredicate(const ComparisonPredicate& predicate);\n+\n+  const attribute_id attribute;\n+  const ComparisonID comparison;\n+  const TypedValue literal;\n+  // How much of the TupleStore this predicate will select. kUnsolved indicates\n+  // that the predicate had not been used previously.\n+  Selectivity selectivity;\n+\n+ private:\n+  SMAPredicate(const attribute_id attr,\n+               const ComparisonID comp,\n+               const TypedValue lit)\n+      : attribute(attr),\n+        comparison(comp),\n+        literal(lit),\n+        selectivity(Selectivity::kUnsolved) { }\n+};\n+\n+// A 64-bit header.\n+struct SMAHeader {\n+  // Count refers the SQL aggregate COUNT.\n+  std::uint32_t count_aggregate;\n+\n+  union {\n+    // Consistent refers to the index being in a consistent state.\n+    bool index_consistent;\n+    // Padding is so we keep this data structure to 64 bits in length.\n+    std::uint32_t padding;\n+  };\n+};\n+\n+// Reference to an attribute value in a tuple. This struct is used to keep a\n+// of the min and max value for an attribute.\n+struct EntryReference {\n+  tuple_id entry_ref_tuple;\n+  // There are certain cases when the entry reference can be invalid such as\n+  // when the index is being rebuilt. value should not be used in this case.\n+  bool valid;\n+  // A copy of the typed value referenced by tuple.\n+  TypedValue value;\n+};\n+\n+// Index entry for an attribute in the SMA.\n+struct SMAEntry {\n+  attribute_id attribute;\n+  // The type of the attribute contained in this entry.\n+  TypeID type_id;\n+  // A reference to the minimum value of the attribute.\n+  EntryReference min_entry_ref;\n+  // A reference to the maximum value of the attribute.\n+  EntryReference max_entry_ref;\n+  // The sum of the attribute. This is only used in the case of numeric types.\n+  TypedValue sum_aggregate;\n+};\n+\n+}  // namespace sma_internal\n+\n+\n+/**\n+ * @brief Small Materialized Aggregate SubBlock.\n+ * @details Keeps account of several types of aggregate functions per Block.\n+ *          Currently supports min, max, sum, and count (for numeric types).\n+ *          Physical organization of the block is as follows:\n+ *\n+ *          [SMAHeader][SMAEntry x number of indexed attributes]\n+ */\n+class SMAIndexSubBlock : public IndexSubBlock {\n+ public:\n+  /**\n+   * @brief Constructor.\n+   * \n+   * @param tuple_store The TupleStorageSubBlock whose contents are indexed by\n+   *                    this IndexSubBlock.\n+   * @param description A description containing any parameters needed to\n+   *        construct this SubBlock (e.g. what attributes to index on).\n+   *        Implementation-specific parameters are defined as extensions in\n+   *        StorageBlockLayout.proto.\n+   * @param new_block Whether this is a newly-created block.\n+   * @param sub_block_memory The memory slot to use for the block's contents.\n+   * @param sub_block_memory_size The size of the memory slot in bytes.\n+   */\n+  SMAIndexSubBlock(const TupleStorageSubBlock &tuple_store,\n+                   const IndexSubBlockDescription &description,\n+                   const bool new_block,\n+                   void *sub_block_memory,\n+                   const std::size_t sub_block_memory_size);\n+\n+  /**\n+   * @brief Frees data associated with variable length attributes.\n+   * \n+   * Several of the data structures in this index are on the heap, therefore it is\n+   * important that the destructor be called when evicted. The variables which\n+   * are held out of line (on the heap_ are the variable length TypedValues and\n+   * the comparators. \n+   */\n+  ~SMAIndexSubBlock();\n+\n+  /**\n+   * @brief Determine whether an IndexSubBlockDescription is valid for this\n+   *        type of IndexSubBlock.\n+   *\n+   * @param relation The relation an index described by description would\n+   *        belong to.\n+   * @param description A description of the parameters for this type of\n+   *        IndexSubBlock, which will be checked for validity.\n+   * @return Whether description is well-formed and valid for this type of\n+   *         IndexSubBlock belonging to relation (i.e. whether an IndexSubBlock\n+   *         of this type, belonging to relation, can be constructed according\n+   *         to description).\n+   **/\n+  static bool DescriptionIsValid(const CatalogRelationSchema &relation,\n+                                 const IndexSubBlockDescription &description);\n+\n+  /**\n+   * @brief Estimate the average number of bytes (including any applicable\n+   *        overhead) used to index a single tuple in this type of\n+   *        IndexSubBlock. Used by StorageBlockLayout::finalize() to divide\n+   *        block memory amongst sub-blocks.\n+   * @warning description must be valid. DescriptionIsValid() should be called\n+   *          first if necessary.\n+   *\n+   * @param relation The relation tuples belong to.\n+   * @param description A description of the parameters for this type of\n+   *        IndexSubBlock.\n+   *\n+   * @return The average/amortized number of bytes used to index a single\n+   *         tuple of relation in an IndexSubBlock of this type described by\n+   *         description.\n+   **/\n+  static std::size_t EstimateBytesPerTuple(const CatalogRelationSchema &relation,\n+                                           const IndexSubBlockDescription &description);\n+\n+  /**\n+   * @return The sub block type.\n+   */\n+  IndexSubBlockType getIndexSubBlockType() const override {\n+    return kSMA;\n+  }\n+\n+  /**\n+   * @return \\c true if the SMA block is initialized.\n+   */\n+  bool supportsAdHocAdd() const override {\n+    return initialized_;\n+  }\n+\n+  /**\n+   * @return \\c true if the SMA block is initialized.\n+   */\n+  bool supportsAdHocRemove() const override {\n+    return initialized_;\n+  }\n+\n+  /**\n+   * @param tuple The id of the new tuple.\n+   * @return \\c true always. There's no reason we should ever run out of space once\n+   *         this index has been successfully created.\n+   */\n+  bool addEntry(const tuple_id tuple) override;\n+\n+  /**\n+   * @brief Updates the index to reflect the removal of a single tuple.\n+   *\n+   * @param tuple The id of the tuple which is going to be removed (i.e. it still\n+   *        exists within the storage block.\n+   */\n+  void removeEntry(const tuple_id tuple) override;\n+\n+  /**\n+   * @brief Updates the index to reflect the addition of several tuples.\n+   *\n+   * @param tuples The ids of the tuple which have been added (i.e. they exist within\n+   *        the storage block).\n+   *\n+   * @return \\c true if successful.\n+   */\n+  bool bulkAddEntries(const TupleIdSequence &tuples) override;\n+\n+  /**\n+   * @brief Updates the index to reflect the removal of several tuples.\n+   *\n+   * @param tuples The ids of the tuple which is going to be removed (i.e. they\n+   *        still exist within the storage block.\n+   */\n+  void bulkRemoveEntries(const TupleIdSequence &tuples) override;\n+\n+  /**\n+   * @brief Gives an estimate of how long it will take to respond to a query.\n+   * \n+   * The SMA index will detect if one of the following cases is true:\n+   *   1) Complete match: all the tuples in this subblock will match the predicate\n+   *   2) Empty match:    none of the tuples will match\n+   *   3) Partial match:  some of the tuples may match\n+   * If there is a partial match, the SMA index is of no use. However, in a\n+   * Complete or Empty match, the SMA index can speed up the selection process\n+   * and should be used.\n+   *\n+   * @param predicate A simple predicate too be evaluated.\n+   * \n+   * @return The cost associated with the type of match. Empty matches are constant,\n+   *         partial matches require a scan, and complete matches require something\n+   *         less than a regular scan (because we don't need to do the comparison\n+   *         operation for each tuple) but is still linear with the number of tuples.\n+   */\n+  predicate_cost_t estimatePredicateEvaluationCost(\n+      const ComparisonPredicate &predicate) const override;\n+\n+  /**\n+   * @warning Calling this method on the SMA index implies that we are not going\n+   *          to do a scan for some tuple matches. As in, the SMA index will\n+   *          either return an empty set of tuple ids, or a set of tuple ids\n+   *          which is the entire set of all tuple ids in the storage subblock.\n+   * @note Currently this version only supports simple comparisons of a literal\n+   *       value with a non-composite key.\n+   **/\n+  TupleIdSequence* getMatchesForPredicate(const ComparisonPredicate &predicate,\n+                                          const TupleIdSequence *filter) const override;\n+\n+  /**\n+   * @brief Update the index to reflect the current state of the storage block.\n+   *\n+   * @return \\c true if successful.\n+   */\n+  bool rebuild() override;\n+\n+  /**\n+   * @brief Returns if the index is consistent. Rebuilding will ensure this\n+   *        returns true.\n+   *\n+   * @return \\c true if inconsistent (rebuild to return true).\n+   */\n+  bool requiresRebuild() const;\n+\n+  /**\n+   * @brief Given an attribute, quickly check to see if the SMA index contains an\n+   *        entry for it.\n+   *\n+   * @param attribute The ID of the attribute to check.\n+   * \n+   * @return \\c true if this index contains an entry.\n+   */\n+  bool hasEntryForAttribute(attribute_id attribute) const;\n+\n+  /**\n+   * @brief Returns the number of tuples, the aggregate COUNT, of the storage sub block.\n+   *\n+   * @return Number of tuples in the sub block.\n+   */\n+  std::uint32_t getCount() const {\n+    return reinterpret_cast<sma_internal::SMAHeader*>(sub_block_memory_)->count_aggregate;\n+  }\n+\n+ private:\n+  inline sma_internal::Selectivity selectivityForPredicate(const ComparisonPredicate &predicate) const;\n+\n+  // Retrieves an entry, first checking if the given attribute is indexed.\n+  inline const sma_internal::SMAEntry* getEntryChecked(attribute_id attribute) const {\n+    DCHECK(attribute > -1) << \"Attribute Id must be >= 0\";\n+\n+    if (total_attributes_ > static_cast<std::size_t>(attribute)) {\n+      int index = attribute_to_entry_[attribute];\n+      if (index != -1) {\n+        return entries_ + index;\n+      }\n+    }\n+    return nullptr;\n+  }\n+\n+  // Retrieves an entry, not checking if the given attribute is indexed.\n+  // Warning: This should not be used unless the attribute is indexed.\n+  inline const sma_internal::SMAEntry* getEntry(attribute_id attribute) const {\n+    return entries_ + attribute_to_entry_[attribute];\n+  }\n+\n+  // Resets a single entry to a zero and invalid state.\n+  // This should be called before rebuilding, or while initializing.\n+  void resetEntry(sma_internal::SMAEntry *entry, attribute_id attribute, const Type &attribute_type);\n+\n+  // Sets all entries to a zero'd and invalid state.\n+  // This is called prior to a rebuild.\n+  void resetEntries();","path":"storage/SMAIndexSubBlock.hpp","position":384,"original_position":386,"commit_id":"02f6e51e61ede56d0aecdfbf723b5a6fdfa823d0","original_commit_id":"ed20cc42cf6bc4fc8064023335c51f6927339ab7","user":{"login":"cramja","id":5708822,"avatar_url":"https://avatars.githubusercontent.com/u/5708822?v=3","gravatar_id":"","url":"https://api.github.com/users/cramja","html_url":"https://github.com/cramja","followers_url":"https://api.github.com/users/cramja/followers","following_url":"https://api.github.com/users/cramja/following{/other_user}","gists_url":"https://api.github.com/users/cramja/gists{/gist_id}","starred_url":"https://api.github.com/users/cramja/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cramja/subscriptions","organizations_url":"https://api.github.com/users/cramja/orgs","repos_url":"https://api.github.com/users/cramja/repos","events_url":"https://api.github.com/users/cramja/events{/privacy}","received_events_url":"https://api.github.com/users/cramja/received_events","type":"User","site_admin":false},"body":"addressed","created_at":"2016-03-07T20:51:47Z","updated_at":"2016-03-07T20:51:47Z","html_url":"https://github.com/pivotalsoftware/quickstep/pull/35#discussion_r55269854","pull_request_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35","_links":{"self":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/comments/55269854"},"html":{"href":"https://github.com/pivotalsoftware/quickstep/pull/35#discussion_r55269854"},"pull_request":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35"}}},"pull_request":{"url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35","id":59419862,"html_url":"https://github.com/pivotalsoftware/quickstep/pull/35","diff_url":"https://github.com/pivotalsoftware/quickstep/pull/35.diff","patch_url":"https://github.com/pivotalsoftware/quickstep/pull/35.patch","issue_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/35","number":35,"state":"open","locked":false,"title":"SMA Index","user":{"login":"cramja","id":5708822,"avatar_url":"https://avatars.githubusercontent.com/u/5708822?v=3","gravatar_id":"","url":"https://api.github.com/users/cramja","html_url":"https://github.com/cramja","followers_url":"https://api.github.com/users/cramja/followers","following_url":"https://api.github.com/users/cramja/following{/other_user}","gists_url":"https://api.github.com/users/cramja/gists{/gist_id}","starred_url":"https://api.github.com/users/cramja/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/cramja/subscriptions","organizations_url":"https://api.github.com/users/cramja/orgs","repos_url":"https://api.github.com/users/cramja/repos","events_url":"https://api.github.com/users/cramja/events{/privacy}","received_events_url":"https://api.github.com/users/cramja/received_events","type":"User","site_admin":false},"body":"## SMAIndexSubBlock and Tests\r\nAs we discussed in the code review on Friday, this is a new index which calculates and stores MIN/MAX/COUNT/SUM. It is primarily used for avoiding scans of blocks. \r\n\r\n**Big Picture Features**\r\n* Works with all attribute types.\r\n* Works with all storage block types.\r\n* Unit tests are comprehensive and based off of unit tests for CSBTree.\r\n\r\n**TODOs**\r\nIn this PR I have added the sub block and unit tests for the sub block. It is a simple matter to tie in the index to the existing code inside of TupleStorageSubBlock and I have not done so because the changes in this PR are entirely insular: they do not change outside classes. \r\n\r\nAdditionally, the EstimateBytesPerTuple function needs to be rethought because the SMA index scales in size according to how many attributes are indexed and not with how many tuples there are in the subblock.\r\n\r\n**Notes**\r\nTo test the possible memory leak issue we discussed in the meeting, I ran the unit tests through valgrind on @pateljm 's suggestion. This revealed memory leaks, but only in the context of the unit tests which I have since resolved and valgrind shows no memory leaks: \r\n\r\n```\r\n==2886== LEAK SUMMARY:\r\n==2886==    definitely lost: 0 bytes in 0 blocks\r\n==2886==    indirectly lost: 0 bytes in 0 blocks\r\n==2886==      possibly lost: 5,053 bytes in 80 blocks\r\n==2886==    still reachable: 84,280 bytes in 183 blocks\r\n==2886==         suppressed: 0 bytes in 0 blocks\r\n```\r\n\r\nI assigned this PR to @hbdeshmukh because we have talked about this PR together in the past and we share the same office so that will likely make resolving issues easier.","created_at":"2016-02-15T22:17:27Z","updated_at":"2016-03-07T20:51:47Z","closed_at":null,"merged_at":null,"merge_commit_sha":"a2ca6ff184e65c1e0a30f6aa52d64ed32f952b93","assignee":{"login":"hbdeshmukh","id":3750801,"avatar_url":"https://avatars.githubusercontent.com/u/3750801?v=3","gravatar_id":"","url":"https://api.github.com/users/hbdeshmukh","html_url":"https://github.com/hbdeshmukh","followers_url":"https://api.github.com/users/hbdeshmukh/followers","following_url":"https://api.github.com/users/hbdeshmukh/following{/other_user}","gists_url":"https://api.github.com/users/hbdeshmukh/gists{/gist_id}","starred_url":"https://api.github.com/users/hbdeshmukh/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/hbdeshmukh/subscriptions","organizations_url":"https://api.github.com/users/hbdeshmukh/orgs","repos_url":"https://api.github.com/users/hbdeshmukh/repos","events_url":"https://api.github.com/users/hbdeshmukh/events{/privacy}","received_events_url":"https://api.github.com/users/hbdeshmukh/received_events","type":"User","site_admin":false},"milestone":null,"commits_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35/commits","review_comments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35/comments","review_comment_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/comments{/number}","comments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/35/comments","statuses_url":"https://api.github.com/repos/pivotalsoftware/quickstep/statuses/02f6e51e61ede56d0aecdfbf723b5a6fdfa823d0","head":{"label":"pivotalsoftware:sma-index-staging","ref":"sma-index-staging","sha":"02f6e51e61ede56d0aecdfbf723b5a6fdfa823d0","user":{"login":"pivotalsoftware","id":4247270,"avatar_url":"https://avatars.githubusercontent.com/u/4247270?v=3","gravatar_id":"","url":"https://api.github.com/users/pivotalsoftware","html_url":"https://github.com/pivotalsoftware","followers_url":"https://api.github.com/users/pivotalsoftware/followers","following_url":"https://api.github.com/users/pivotalsoftware/following{/other_user}","gists_url":"https://api.github.com/users/pivotalsoftware/gists{/gist_id}","starred_url":"https://api.github.com/users/pivotalsoftware/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/pivotalsoftware/subscriptions","organizations_url":"https://api.github.com/users/pivotalsoftware/orgs","repos_url":"https://api.github.com/users/pivotalsoftware/repos","events_url":"https://api.github.com/users/pivotalsoftware/events{/privacy}","received_events_url":"https://api.github.com/users/pivotalsoftware/received_events","type":"Organization","site_admin":false},"repo":{"id":45578105,"name":"quickstep","full_name":"pivotalsoftware/quickstep","owner":{"login":"pivotalsoftware","id":4247270,"avatar_url":"https://avatars.githubusercontent.com/u/4247270?v=3","gravatar_id":"","url":"https://api.github.com/users/pivotalsoftware","html_url":"https://github.com/pivotalsoftware","followers_url":"https://api.github.com/users/pivotalsoftware/followers","following_url":"https://api.github.com/users/pivotalsoftware/following{/other_user}","gists_url":"https://api.github.com/users/pivotalsoftware/gists{/gist_id}","starred_url":"https://api.github.com/users/pivotalsoftware/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/pivotalsoftware/subscriptions","organizations_url":"https://api.github.com/users/pivotalsoftware/orgs","repos_url":"https://api.github.com/users/pivotalsoftware/repos","events_url":"https://api.github.com/users/pivotalsoftware/events{/privacy}","received_events_url":"https://api.github.com/users/pivotalsoftware/received_events","type":"Organization","site_admin":false},"private":false,"html_url":"https://github.com/pivotalsoftware/quickstep","description":"Quickstep Project","fork":false,"url":"https://api.github.com/repos/pivotalsoftware/quickstep","forks_url":"https://api.github.com/repos/pivotalsoftware/quickstep/forks","keys_url":"https://api.github.com/repos/pivotalsoftware/quickstep/keys{/key_id}","collaborators_url":"https://api.github.com/repos/pivotalsoftware/quickstep/collaborators{/collaborator}","teams_url":"https://api.github.com/repos/pivotalsoftware/quickstep/teams","hooks_url":"https://api.github.com/repos/pivotalsoftware/quickstep/hooks","issue_events_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/events{/number}","events_url":"https://api.github.com/repos/pivotalsoftware/quickstep/events","assignees_url":"https://api.github.com/repos/pivotalsoftware/quickstep/assignees{/user}","branches_url":"https://api.github.com/repos/pivotalsoftware/quickstep/branches{/branch}","tags_url":"https://api.github.com/repos/pivotalsoftware/quickstep/tags","blobs_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/blobs{/sha}","git_tags_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/tags{/sha}","git_refs_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/refs{/sha}","trees_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/trees{/sha}","statuses_url":"https://api.github.com/repos/pivotalsoftware/quickstep/statuses/{sha}","languages_url":"https://api.github.com/repos/pivotalsoftware/quickstep/languages","stargazers_url":"https://api.github.com/repos/pivotalsoftware/quickstep/stargazers","contributors_url":"https://api.github.com/repos/pivotalsoftware/quickstep/contributors","subscribers_url":"https://api.github.com/repos/pivotalsoftware/quickstep/subscribers","subscription_url":"https://api.github.com/repos/pivotalsoftware/quickstep/subscription","commits_url":"https://api.github.com/repos/pivotalsoftware/quickstep/commits{/sha}","git_commits_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/commits{/sha}","comments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/comments{/number}","issue_comment_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/comments{/number}","contents_url":"https://api.github.com/repos/pivotalsoftware/quickstep/contents/{+path}","compare_url":"https://api.github.com/repos/pivotalsoftware/quickstep/compare/{base}...{head}","merges_url":"https://api.github.com/repos/pivotalsoftware/quickstep/merges","archive_url":"https://api.github.com/repos/pivotalsoftware/quickstep/{archive_format}{/ref}","downloads_url":"https://api.github.com/repos/pivotalsoftware/quickstep/downloads","issues_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues{/number}","pulls_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls{/number}","milestones_url":"https://api.github.com/repos/pivotalsoftware/quickstep/milestones{/number}","notifications_url":"https://api.github.com/repos/pivotalsoftware/quickstep/notifications{?since,all,participating}","labels_url":"https://api.github.com/repos/pivotalsoftware/quickstep/labels{/name}","releases_url":"https://api.github.com/repos/pivotalsoftware/quickstep/releases{/id}","deployments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/deployments","created_at":"2015-11-05T01:06:50Z","updated_at":"2016-03-03T02:13:31Z","pushed_at":"2016-03-07T20:19:15Z","git_url":"git://github.com/pivotalsoftware/quickstep.git","ssh_url":"git@github.com:pivotalsoftware/quickstep.git","clone_url":"https://github.com/pivotalsoftware/quickstep.git","svn_url":"https://github.com/pivotalsoftware/quickstep","homepage":null,"size":6674,"stargazers_count":6,"watchers_count":6,"language":"C++","has_issues":true,"has_downloads":true,"has_wiki":true,"has_pages":false,"forks_count":7,"mirror_url":null,"open_issues_count":12,"forks":7,"open_issues":12,"watchers":6,"default_branch":"master"}},"base":{"label":"pivotalsoftware:master","ref":"master","sha":"b846e989d7e34bf2e6dfb1b7bdb73bf9760145bd","user":{"login":"pivotalsoftware","id":4247270,"avatar_url":"https://avatars.githubusercontent.com/u/4247270?v=3","gravatar_id":"","url":"https://api.github.com/users/pivotalsoftware","html_url":"https://github.com/pivotalsoftware","followers_url":"https://api.github.com/users/pivotalsoftware/followers","following_url":"https://api.github.com/users/pivotalsoftware/following{/other_user}","gists_url":"https://api.github.com/users/pivotalsoftware/gists{/gist_id}","starred_url":"https://api.github.com/users/pivotalsoftware/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/pivotalsoftware/subscriptions","organizations_url":"https://api.github.com/users/pivotalsoftware/orgs","repos_url":"https://api.github.com/users/pivotalsoftware/repos","events_url":"https://api.github.com/users/pivotalsoftware/events{/privacy}","received_events_url":"https://api.github.com/users/pivotalsoftware/received_events","type":"Organization","site_admin":false},"repo":{"id":45578105,"name":"quickstep","full_name":"pivotalsoftware/quickstep","owner":{"login":"pivotalsoftware","id":4247270,"avatar_url":"https://avatars.githubusercontent.com/u/4247270?v=3","gravatar_id":"","url":"https://api.github.com/users/pivotalsoftware","html_url":"https://github.com/pivotalsoftware","followers_url":"https://api.github.com/users/pivotalsoftware/followers","following_url":"https://api.github.com/users/pivotalsoftware/following{/other_user}","gists_url":"https://api.github.com/users/pivotalsoftware/gists{/gist_id}","starred_url":"https://api.github.com/users/pivotalsoftware/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/pivotalsoftware/subscriptions","organizations_url":"https://api.github.com/users/pivotalsoftware/orgs","repos_url":"https://api.github.com/users/pivotalsoftware/repos","events_url":"https://api.github.com/users/pivotalsoftware/events{/privacy}","received_events_url":"https://api.github.com/users/pivotalsoftware/received_events","type":"Organization","site_admin":false},"private":false,"html_url":"https://github.com/pivotalsoftware/quickstep","description":"Quickstep Project","fork":false,"url":"https://api.github.com/repos/pivotalsoftware/quickstep","forks_url":"https://api.github.com/repos/pivotalsoftware/quickstep/forks","keys_url":"https://api.github.com/repos/pivotalsoftware/quickstep/keys{/key_id}","collaborators_url":"https://api.github.com/repos/pivotalsoftware/quickstep/collaborators{/collaborator}","teams_url":"https://api.github.com/repos/pivotalsoftware/quickstep/teams","hooks_url":"https://api.github.com/repos/pivotalsoftware/quickstep/hooks","issue_events_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/events{/number}","events_url":"https://api.github.com/repos/pivotalsoftware/quickstep/events","assignees_url":"https://api.github.com/repos/pivotalsoftware/quickstep/assignees{/user}","branches_url":"https://api.github.com/repos/pivotalsoftware/quickstep/branches{/branch}","tags_url":"https://api.github.com/repos/pivotalsoftware/quickstep/tags","blobs_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/blobs{/sha}","git_tags_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/tags{/sha}","git_refs_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/refs{/sha}","trees_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/trees{/sha}","statuses_url":"https://api.github.com/repos/pivotalsoftware/quickstep/statuses/{sha}","languages_url":"https://api.github.com/repos/pivotalsoftware/quickstep/languages","stargazers_url":"https://api.github.com/repos/pivotalsoftware/quickstep/stargazers","contributors_url":"https://api.github.com/repos/pivotalsoftware/quickstep/contributors","subscribers_url":"https://api.github.com/repos/pivotalsoftware/quickstep/subscribers","subscription_url":"https://api.github.com/repos/pivotalsoftware/quickstep/subscription","commits_url":"https://api.github.com/repos/pivotalsoftware/quickstep/commits{/sha}","git_commits_url":"https://api.github.com/repos/pivotalsoftware/quickstep/git/commits{/sha}","comments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/comments{/number}","issue_comment_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/comments{/number}","contents_url":"https://api.github.com/repos/pivotalsoftware/quickstep/contents/{+path}","compare_url":"https://api.github.com/repos/pivotalsoftware/quickstep/compare/{base}...{head}","merges_url":"https://api.github.com/repos/pivotalsoftware/quickstep/merges","archive_url":"https://api.github.com/repos/pivotalsoftware/quickstep/{archive_format}{/ref}","downloads_url":"https://api.github.com/repos/pivotalsoftware/quickstep/downloads","issues_url":"https://api.github.com/repos/pivotalsoftware/quickstep/issues{/number}","pulls_url":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls{/number}","milestones_url":"https://api.github.com/repos/pivotalsoftware/quickstep/milestones{/number}","notifications_url":"https://api.github.com/repos/pivotalsoftware/quickstep/notifications{?since,all,participating}","labels_url":"https://api.github.com/repos/pivotalsoftware/quickstep/labels{/name}","releases_url":"https://api.github.com/repos/pivotalsoftware/quickstep/releases{/id}","deployments_url":"https://api.github.com/repos/pivotalsoftware/quickstep/deployments","created_at":"2015-11-05T01:06:50Z","updated_at":"2016-03-03T02:13:31Z","pushed_at":"2016-03-07T20:19:15Z","git_url":"git://github.com/pivotalsoftware/quickstep.git","ssh_url":"git@github.com:pivotalsoftware/quickstep.git","clone_url":"https://github.com/pivotalsoftware/quickstep.git","svn_url":"https://github.com/pivotalsoftware/quickstep","homepage":null,"size":6674,"stargazers_count":6,"watchers_count":6,"language":"C++","has_issues":true,"has_downloads":true,"has_wiki":true,"has_pages":false,"forks_count":7,"mirror_url":null,"open_issues_count":12,"forks":7,"open_issues":12,"watchers":6,"default_branch":"master"}},"_links":{"self":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35"},"html":{"href":"https://github.com/pivotalsoftware/quickstep/pull/35"},"issue":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/35"},"comments":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/issues/35/comments"},"review_comments":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35/comments"},"review_comment":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/comments{/number}"},"commits":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/pulls/35/commits"},"statuses":{"href":"https://api.github.com/repos/pivotalsoftware/quickstep/statuses/02f6e51e61ede56d0aecdfbf723b5a6fdfa823d0"}}}}