breakout-detection 0.1.0

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: 8f81b5a2a9781787903f293322eef1ff6d08479cde2df25eea47c3023cd501bd
+  data.tar.gz: 1839625455de87fca184eb2f1fdf8bc7a2e8809c8afd17b9fc9ec61d6d775b7a
+SHA512:
+  metadata.gz: 1fa14ae2cc9db547bdeb13a3232d87c96e239aa6dde618ea6b7fa9c53aaca5596b45223c3e7eeceb9a8aa0428de77c54c4e8275adf57b9767c13a889538981bb
+  data.tar.gz: 4ba5ee1decd2ab9084c3d377ec6d37a743c7f5ff47bb48eb55bdd5ecb9bce57df534522643c448b00a35cdd39d1a429ebc1c036440b079046c321bbef5e193a1

data/CHANGELOG.md

@@ -0,0 +1,3 @@
+## 0.1.0 (2021-09-02)
+
+- First release

data/LICENSE.txt

@@ -0,0 +1,340 @@
+GNU GENERAL PUBLIC LICENSE
+                       Version 2, June 1991
+
+ Copyright (C) 1989, 1991 Free Software Foundation, Inc., <http://fsf.org/>
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+License is intended to guarantee your freedom to share and change free
+software--to make sure the software is free for all its users.  This
+General Public License applies to most of the Free Software
+Foundation's software and to any other program whose authors commit to
+using it.  (Some other Free Software Foundation software is covered by
+the GNU Lesser General Public License instead.)  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+this service if you wish), that you receive source code or can get it
+if you want it, that you can change the software or use pieces of it
+in new free programs; and that you know you can do these things.
+
+  To protect your rights, we need to make restrictions that forbid
+anyone to deny you these rights or to ask you to surrender the rights.
+These restrictions translate to certain responsibilities for you if you
+distribute copies of the software, or if you modify it.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must give the recipients all the rights that
+you have.  You must make sure that they, too, receive or can get the
+source code.  And you must show them these terms so they know their
+rights.
+
+  We protect your rights with two steps: (1) copyright the software, and
+(2) offer you this license which gives you legal permission to copy,
+distribute and/or modify the software.
+
+  Also, for each author's protection and ours, we want to make certain
+that everyone understands that there is no warranty for this free
+software.  If the software is modified by someone else and passed on, we
+want its recipients to know that what they have is not the original, so
+that any problems introduced by others will not reflect on the original
+authors' reputations.
+
+  Finally, any free program is threatened constantly by software
+patents.  We wish to avoid the danger that redistributors of a free
+program will individually obtain patent licenses, in effect making the
+program proprietary.  To prevent this, we have made it clear that any
+patent must be licensed for everyone's free use or not licensed at all.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                    GNU GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License applies to any program or other work which contains
+a notice placed by the copyright holder saying it may be distributed
+under the terms of this General Public License.  The "Program", below,
+refers to any such program or work, and a "work based on the Program"
+means either the Program or any derivative work under copyright law:
+that is to say, a work containing the Program or a portion of it,
+either verbatim or with modifications and/or translated into another
+language.  (Hereinafter, translation is included without limitation in
+the term "modification".)  Each licensee is addressed as "you".
+
+Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running the Program is not restricted, and the output from the Program
+is covered only if its contents constitute a work based on the
+Program (independent of having been made by running the Program).
+Whether that is true depends on what the Program does.
+
+  1. You may copy and distribute verbatim copies of the Program's
+source code as you receive it, in any medium, provided that you
+conspicuously and appropriately publish on each copy an appropriate
+copyright notice and disclaimer of warranty; keep intact all the
+notices that refer to this License and to the absence of any warranty;
+and give any other recipients of the Program a copy of this License
+along with the Program.
+
+You may charge a fee for the physical act of transferring a copy, and
+you may at your option offer warranty protection in exchange for a fee.
+
+  2. You may modify your copy or copies of the Program or any portion
+of it, thus forming a work based on the Program, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) You must cause the modified files to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    b) You must cause any work that you distribute or publish, that in
+    whole or in part contains or is derived from the Program or any
+    part thereof, to be licensed as a whole at no charge to all third
+    parties under the terms of this License.
+
+    c) If the modified program normally reads commands interactively
+    when run, you must cause it, when started running for such
+    interactive use in the most ordinary way, to print or display an
+    announcement including an appropriate copyright notice and a
+    notice that there is no warranty (or else, saying that you provide
+    a warranty) and that users may redistribute the program under
+    these conditions, and telling the user how to view a copy of this
+    License.  (Exception: if the Program itself is interactive but
+    does not normally print such an announcement, your work based on
+    the Program is not required to print an announcement.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Program,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Program, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Program.
+
+In addition, mere aggregation of another work not based on the Program
+with the Program (or with a work based on the Program) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may copy and distribute the Program (or a work based on it,
+under Section 2) in object code or executable form under the terms of
+Sections 1 and 2 above provided that you also do one of the following:
+
+    a) Accompany it with the complete corresponding machine-readable
+    source code, which must be distributed under the terms of Sections
+    1 and 2 above on a medium customarily used for software interchange; or,
+
+    b) Accompany it with a written offer, valid for at least three
+    years, to give any third party, for a charge no more than your
+    cost of physically performing source distribution, a complete
+    machine-readable copy of the corresponding source code, to be
+    distributed under the terms of Sections 1 and 2 above on a medium
+    customarily used for software interchange; or,
+
+    c) Accompany it with the information you received as to the offer
+    to distribute corresponding source code.  (This alternative is
+    allowed only for noncommercial distribution and only if you
+    received the program in object code or executable form with such
+    an offer, in accord with Subsection b above.)
+
+The source code for a work means the preferred form of the work for
+making modifications to it.  For an executable work, complete source
+code means all the source code for all modules it contains, plus any
+associated interface definition files, plus the scripts used to
+control compilation and installation of the executable.  However, as a
+special exception, the source code distributed need not include
+anything that is normally distributed (in either source or binary
+form) with the major components (compiler, kernel, and so on) of the
+operating system on which the executable runs, unless that component
+itself accompanies the executable.
+
+If distribution of executable or object code is made by offering
+access to copy from a designated place, then offering equivalent
+access to copy the source code from the same place counts as
+distribution of the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  4. You may not copy, modify, sublicense, or distribute the Program
+except as expressly provided under this License.  Any attempt
+otherwise to copy, modify, sublicense or distribute the Program is
+void, and will automatically terminate your rights under this License.
+However, parties who have received copies, or rights, from you under
+this License will not have their licenses terminated so long as such
+parties remain in full compliance.
+
+  5. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Program or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Program (or any work based on the
+Program), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Program or works based on it.
+
+  6. Each time you redistribute the Program (or any work based on the
+Program), the recipient automatically receives a license from the
+original licensor to copy, distribute or modify the Program subject to
+these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties to
+this License.
+
+  7. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Program at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Program by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Program.
+
+If any portion of this section is held invalid or unenforceable under
+any particular circumstance, the balance of the section is intended to
+apply and the section as a whole is intended to apply in other
+circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system, which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  8. If the distribution and/or use of the Program is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Program under this License
+may add an explicit geographical distribution limitation excluding
+those countries, so that distribution is permitted only in or among
+countries not thus excluded.  In such case, this License incorporates
+the limitation as if written in the body of this License.
+
+  9. The Free Software Foundation may publish revised and/or new versions
+of the General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Program
+specifies a version number of this License which applies to it and "any
+later version", you have the option of following the terms and conditions
+either of that version or of any later version published by the Free
+Software Foundation.  If the Program does not specify a version number of
+this License, you may choose any version ever published by the Free Software
+Foundation.
+
+  10. If you wish to incorporate parts of the Program into other free
+programs whose distribution conditions are different, write to the author
+to ask for permission.  For software which is copyrighted by the Free
+Software Foundation, write to the Free Software Foundation; we sometimes
+make exceptions for this.  Our decision will be guided by the two goals
+of preserving the free status of all derivatives of our free software and
+of promoting the sharing and reuse of software generally.
+
+                            NO WARRANTY
+
+  11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY
+FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW.  EXCEPT WHEN
+OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES
+PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED
+OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.  THE ENTIRE RISK AS
+TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU.  SHOULD THE
+PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING,
+REPAIR OR CORRECTION.
+
+  12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR
+REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES,
+INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING
+OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED
+TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY
+YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER
+PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+convey the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    {description}
+    Copyright (C) {year}  {fullname}
+
+    This program is free software; you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation; either version 2 of the License, or
+    (at your option) any later version.
+
+    This program 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 General Public License for more details.
+
+    You should have received a copy of the GNU General Public License along
+    with this program; if not, write to the Free Software Foundation, Inc.,
+    51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
+
+Also add information on how to contact you by electronic and paper mail.
+
+If the program is interactive, make it output a short notice like this
+when it starts in an interactive mode:
+
+    Gnomovision version 69, Copyright (C) year name of author
+    Gnomovision comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, the commands you use may
+be called something other than `show w' and `show c'; they could even be
+mouse-clicks or menu items--whatever suits your program.
+
+You should also get your employer (if you work as a programmer) or your
+school, if any, to sign a "copyright disclaimer" for the program, if
+necessary.  Here is a sample; alter the names:
+
+  Yoyodyne, Inc., hereby disclaims all copyright interest in the program
+  `Gnomovision' (which makes passes at compilers) written by James Hacker.
+
+  {signature of Ty Coon}, 1 April 1989
+  Ty Coon, President of Vice
+
+This General Public License does not permit incorporating your program into
+proprietary programs.  If your program is a subroutine library, you may
+consider it more useful to permit linking proprietary applications with the
+library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.
+

data/README.md

@@ -0,0 +1,92 @@
+# Breakout
+
+:fire: [BreakoutDetection](https://github.com/twitter/BreakoutDetection) for Ruby
+
+Learn more about [how it works](https://blog.twitter.com/engineering/en_us/a/2014/breakout-detection-in-the-wild)
+
+[![Build Status](https://github.com/ankane/breakout/workflows/build/badge.svg?branch=master)](https://github.com/ankane/breakout/actions)
+
+## Installation
+
+Add this line to your application’s Gemfile:
+
+```ruby
+gem 'breakout-detection'
+```
+
+## Getting Started
+
+Detect breakouts in a time series
+
+```ruby
+series = {
+  Date.parse("2020-01-01") => 100,
+  Date.parse("2020-01-02") => 150,
+  Date.parse("2020-01-03") => 136,
+  # ...
+}
+
+Breakout.detect(series)
+```
+
+Works great with [Groupdate](https://github.com/ankane/groupdate)
+
+```ruby
+series = User.group_by_day(:created_at).count
+Breakout.detect(series)
+```
+
+Series can also be an array without times (the index is returned)
+
+```ruby
+series = [100, 150, 136, ...]
+Breakout.detect(series)
+```
+
+## Options
+
+Pass options - default values below
+
+```ruby
+Breakout.detect(
+  series,
+  min_size: 30,        # minimum observations between breakouts
+  method: "multi",     # multi or amoc (at most one change)
+  degree: 1,           # degree of the penalization polynomial (multi only)
+  beta: 0.008,         # penalization term (multi only)
+  percent: nil,        # minimum percent change in goodness of fit statistic (multi only)
+  alpha: 2,            # weight of the distance between observations (amoc only)
+  exact: true          # exact or approximate median (amoc only)
+)
+```
+
+## Credits
+
+This library uses the C++ code from the [BreakoutDetection](https://github.com/twitter/BreakoutDetection) R package and is available under the same license.
+
+## References
+
+- [Leveraging Cloud Data to Mitigate User Experience from ‘Breaking Bad’](https://arxiv.org/abs/1411.7955)
+
+## History
+
+View the [changelog](https://github.com/ankane/breakout/blob/master/CHANGELOG.md)
+
+## Contributing
+
+Everyone is encouraged to help improve this project. Here are a few ways you can help:
+
+- [Report bugs](https://github.com/ankane/breakout/issues)
+- Fix bugs and [submit pull requests](https://github.com/ankane/breakout/pulls)
+- Write, clarify, or fix documentation
+- Suggest or add new features
+
+To get started with development:
+
+```sh
+git clone https://github.com/ankane/breakout.git
+cd breakout
+bundle install
+bundle exec rake compile
+bundle exec rake test
+```

data/ext/breakout/edm_multi.cpp

@@ -0,0 +1,93 @@
+#include <algorithm>
+#include <cmath>
+#include <set>
+#include <vector>
+#include "helper.h"
+
+// Z: time series
+// min_size: minimum segment size
+// beta: penalization term for the addition of a change point
+
+std::vector<int> EDM_multi(const std::vector<double>& Z, int min_size = 24, double beta = 0, int degree = 0) {
+
+  // identify which type of penalization to use
+  double (*G)(double);
+  switch (degree) {
+  case 1:
+    G = Linear;
+    break;
+  case 2:
+    G = Quadratic;
+    break;
+  default:
+    G = Const;
+    break;
+  }
+
+  int n = Z.size();
+  if (beta < 0) // assume that beta is a positive number
+    beta = -beta;
+  std::vector<int> prev(n + 1, 0);   // store optimal location of previous change point
+  std::vector<int> number(n + 1, 0); // store the number of change points in optimal segmentation
+  std::vector<double> F(n + 1, -3);  // store optimal statistic value
+  // F[s] is calculated using observations { Z[0], Z[1], ..., Z[s-1] }
+
+  // trees used to store the "upper half" of the considered observations
+  std::multiset<double> right_min, left_min;
+  // trees used to store the "lower half" of the considered observations
+  std::multiset<double, std::greater<double>> right_max, left_max;
+
+  // Iterate over possible locations for the last change
+  for (int s = 2 * min_size; s < n + 1; ++s) {
+    right_max.clear();
+    right_min.clear(); // clear right trees
+    left_max.clear();
+    left_min.clear(); // clear left trees
+
+    // initialize left and right trees to account for minimum segment size
+    for (int i = prev[min_size - 1]; i < min_size - 1; ++i)
+      insert_element(left_min, left_max, Z[i]);
+    for (int i = min_size - 1; i < s; ++i)
+      insert_element(right_min, right_max, Z[i]);
+
+    // Iterate over possible locations for the penultiamte change
+    for (int t = min_size; t < s - min_size + 1; ++t) { // modify limits to deal with min_size
+      insert_element(left_min, left_max, Z[t - 1]);     // insert element into left tree
+      remove_element(right_min, right_max, Z[t - 1]);   // remove element from right tree
+      // left tree now has { Z[prev[t-1]], ..., Z[t-1] }
+      // right tree now has { Z[t], ..., Z[s-1] }
+
+      // check to see if optimal position of previous change point has changed
+      // if so update the left tree
+      if (prev[t] > prev[t - 1]) {
+        for (int i = prev[t - 1]; i < prev[t]; ++i)
+          remove_element(left_min, left_max, Z[i]);
+      } else if (prev[t] < prev[t - 1]) {
+        for (int i = prev[t]; i < prev[t - 1]; ++i)
+          insert_element(left_min, left_max, Z[i]);
+      }
+
+      // calculate statistic value
+      double left_median = get_median(left_min, left_max), right_median = get_median(right_min, right_max);
+      double normalize = ((t - prev[t]) * (s - t)) / (std::pow((double)(s - prev[t]), 2.0));
+      double tmp = F[t] + normalize * std::pow(left_median - right_median, 2.0) - beta * G(number[t]);
+      // check for improved optimal statistic value
+      if (tmp > F[s]) {
+        number[s] = number[t] + 1;
+        F[s] = tmp;
+        prev[s] = t;
+      }
+    }
+  }
+
+  // obtain list of optimal change point estimates
+  std::vector<int> ret;
+  int at = n;
+  while (at) {
+    if (prev[at]) // don't insert 0 as a change point estimate
+      ret.push_back(prev[at]);
+    at = prev[at];
+  }
+  sort(ret.begin(), ret.end());
+  return ret;
+}

data/ext/breakout/edm_percent.cpp

@@ -0,0 +1,105 @@
+/*
+  Penalizes based on percent chagne in the statistic value.
+  Linear penalty means that each new breakout must result in an at least X% increast
+  Quadratic penalty means that each new brekaout must result in at least an (X*k)% increase for k breakouts
+*/
+
+#include <algorithm>
+#include <cmath>
+#include <set>
+#include <vector>
+#include "helper.h"
+
+std::vector<int> EDM_percent(const std::vector<double>& Z, int min_size = 24, double percent = 0, int degree = 0) {
+  // Z: time series
+  // min_size: minimum segment size
+  // beta: penalization term for the addition of a change point
+
+  // identify which type of penalization to use
+  double (*G)(double);
+  switch (degree) {
+  case 1:
+    G = Linear;
+    break;
+  case 2:
+    G = Quadratic;
+    break;
+  default:
+    G = Const;
+    break;
+  }
+
+  int n = Z.size();
+
+  std::vector<int> prev(n + 1, 0);   // store optimal location of previous change point
+  std::vector<int> number(n + 1, 0); // store the number of change points in optimal segmentation
+  std::vector<double> F(n + 1, 0);   // store optimal statistic value
+  // F[s] is calculated using observations { Z[0], Z[1], ..., Z[s-1] }
+
+  // trees used to store the "upper half" of the considered observations
+  std::multiset<double> right_min, left_min;
+  // trees used to store the "lower half" of the considered observations
+  std::multiset<double, std::greater<double>> right_max, left_max;
+
+  // Iterate over possible locations for the last change
+  for (int s = 2 * min_size; s < n + 1; ++s) {
+    right_max.clear();
+    right_min.clear(); // clear right trees
+    left_max.clear();
+    left_min.clear(); // clear left trees
+
+    // initialize left and right trees to account for minimum segment size
+    for (int i = prev[min_size - 1]; i < min_size - 1; ++i)
+      insert_element(left_min, left_max, Z[i]);
+    for (int i = min_size - 1; i < s; ++i)
+      insert_element(right_min, right_max, Z[i]);
+
+    // Iterate over possible locations for the penultimate change
+    for (int t = min_size; t < s - min_size + 1; ++t) { // modify limits to deal with min_size
+      insert_element(left_min, left_max, Z[t - 1]);     // insert element into left tree
+      remove_element(right_min, right_max, Z[t - 1]);   // remove element from right tree
+      // left tree now has { Z[prev[t-1]], ..., Z[t-1] }
+      // right tree now has { Z[t], ..., Z[s-1] }
+
+      // check to see if optimal position of previous change point has changed
+      // if so update the left tree
+      if (prev[t] > prev[t - 1]) {
+        for (int i = prev[t - 1]; i < prev[t]; ++i)
+          remove_element(left_min, left_max, Z[i]);
+      } else if (prev[t] < prev[t - 1]) {
+        for (int i = prev[t]; i < prev[t - 1]; ++i)
+          insert_element(left_min, left_max, Z[i]);
+      }
+
+      // calculate statistic value
+      double left_median = get_median(left_min, left_max), right_median = get_median(right_min, right_max);
+      double normalize = ((t - prev[t]) * (s - t)) / (std::pow(static_cast<double>(s - prev[t]), 2));
+      double tmp = F[t] + normalize * std::pow(static_cast<double>(left_median - right_median), 2);
+      // Find best location for change point. check % condition later
+      if (tmp > F[s]) {
+        number[s] = number[t] + 1;
+        F[s] = tmp;
+        prev[s] = t;
+      }
+    }
+    // check to make sure we meet the percent change requirement
+    if (prev[s]) {
+      if (F[s] - F[prev[s]] < percent * G(number[prev[s]]) * F[prev[s]]) {
+        number[s] = number[prev[s]];
+        F[s] = F[prev[s]];
+        prev[s] = prev[prev[s]];
+      }
+    }
+  }
+
+  // obtain list of optimal change point estimates
+  std::vector<int> ret;
+  int at = n;
+  while (at) {
+    if (prev[at]) // don't insert 0 as a change point estimate
+      ret.push_back(prev[at]);
+    at = prev[at];
+  }
+  sort(ret.begin(), ret.end());
+  return ret;
+}

data/ext/breakout/edm_tail.cpp

@@ -0,0 +1,380 @@
+/*
+This version calculates the between distance using the delta points around the change point estimate.
+*/
+
+#include <algorithm>
+#include <cmath>
+#include <iostream>
+#include <vector>
+
+// Class used to hold all the information about the
+// breakout location and the interval trees
+struct Information {
+  std::vector<double> A, B, AB;
+  double best_stat;
+  int best_loc, best_t2;
+  int min_size, b;
+
+  Information(int, int);
+};
+
+Information::Information(int bb, int m) {
+  A = std::vector<double>(1 << (bb + 1));
+  B = std::vector<double>(1 << (bb + 1));
+  AB = std::vector<double>(1 << (bb + 1));
+  b = bb;
+  best_stat = best_loc = best_t2 = -3;
+  min_size = m;
+}
+
+void BackwardUpdate(std::vector<double>& Z, Information& info, int& tau1, double quant, double alpha);
+void ForwardUpdate(std::vector<double>& Z, Information& info, int& tau1, double quant, double alpha);
+
+int GetIndex(int B, double x) {
+  // Get index of leaf node interval containing x
+  return (int)std::ceil(std::abs(x) * (1 << B)) + (1 << B) - 1;
+}
+
+double GetQuantile(std::vector<double>& x, double quant) {
+  // Return approximate quantile based on the interval tree
+
+  int N = x.size();
+  int k = std::ceil(x[1] * quant);
+  double l = 0, u = 1;
+  int i = 1, j;
+  while (i < N) { // Make sure that we do not go beyond the array bounds
+    j = i << 1;
+    if (j >= N)
+      break;
+    if (x[i] == k) { // Exactly k elements in this node's subtree. So can terminate early
+      // Return a weighted combination of the child node medians
+      double lWeight = x[j] / (x[j] + x[j + 1]);
+      double rWeight = 1 - lWeight;
+      double lu, rl;
+      lu = (u + l) / 2;
+      rl = (u + lu) / 2;
+      return lWeight * (quant * (lu - l) + l) + rWeight * (quant * (u - rl) + rl);
+    } else if (x[j] >= k) { // More than k elements in node's left child's subtree, move to left child
+      i = j;
+      u = (l + u) / 2;
+    } else if (x[j] < k) { // Not enough elements in node's left child's subtree, move to right child
+      k -= x[j];
+      i = j + 1;
+      l = (l + u) / 2;
+    }
+  }
+  return quant * (u - l) + l;
+}
+
+std::vector<int> AddToTree(int B, std::vector<double>& x) {
+  std::vector<int> A(1 << (B + 1));
+  std::vector<double>::iterator i;
+  for (i = x.begin(); i < x.end(); ++i) { // Iterage over items we wish to add to the tree
+    int index = GetIndex(B, *i);
+    while (index) {
+      ++A[index];
+      index /= 2;
+    }
+  }
+  return A;
+}
+
+std::vector<int> EDM_tail(std::vector<double>& Z, int min_size = 24, double alpha = 2, double quant = 0.5) {
+
+  int N = Z.size();
+  int eps = (int)std::ceil(std::log(N));
+  eps = std::max(eps, 10);
+
+  Information info(eps, min_size);
+
+  int tau1 = info.min_size;
+  int tau2 = tau1 * 2;
+
+  // Populate trees and calculate statistic value for starting configuration of
+  // 2 min_size segments
+  for (int i = 0; i < tau1; ++i) {
+    for (int j = i + 1; j < tau1; ++j) {
+      int index = GetIndex(info.b, Z[i] - Z[j]);
+      while (index) {
+        ++info.A[index];
+        index /= 2;
+      }
+    }
+  }
+
+  // Populate trees and calculate statistic value for starting configuration of
+  // 2 min_size segments
+  for (int i = tau1; i < tau2; ++i) {
+    for (int j = i + 1; j < tau2; ++j) {
+      int index = GetIndex(info.b, Z[i] - Z[j]);
+      while (index) {
+        ++info.B[index];
+        index /= 2;
+      }
+    }
+  }
+
+  // Populate trees and calculate statistic value for starting configuration of
+  // 2 min_size segments
+  for (int i = 0; i < tau1; ++i) {
+    for (int j = tau1; j < tau2; ++j) {
+      int index = GetIndex(info.b, Z[i] - Z[j]);
+      while (index) {
+        ++info.AB[index];
+        index /= 2;
+      }
+    }
+  }
+
+  double qa, qb, qc, stat;
+
+  qa = std::pow(GetQuantile(info.A, quant), alpha);
+  qb = std::pow(GetQuantile(info.B, quant), alpha);
+  qc = std::pow(GetQuantile(info.AB, quant), alpha);
+
+  stat = 2 * qc - qa - qb;
+  stat *= (double)(tau1) * (tau2 - tau1) / (tau2);
+
+  info.best_stat = stat;
+  info.best_loc = tau1;
+  info.best_t2 = tau2;
+
+  // Increment tau2 and update trees and statistic
+  ++tau2;
+  for (; tau2 < N + 1; ++tau2) {
+    int index = GetIndex(info.b, Z[tau2 - 1] - Z[tau2 - 2]);
+    while (index) { // array position 0 is not used, so we exit once we reach this location
+      ++info.B[index];
+      index /= 2;
+    }
+    qb = std::pow(GetQuantile(info.B, quant), alpha);
+    stat = 2 * qc - qa - qb;
+    stat *= (double)(tau2 - tau1) * tau1 / tau2;
+
+    if (stat > info.best_stat) {
+      info.best_stat = stat;
+      info.best_loc = tau1;
+      info.best_t2 = tau2;
+    }
+  }
+
+  bool forward_move = false;
+  // Initial consideration of other possible locations for tau1
+  while (tau1 < N - min_size) {
+    //"warm start" to update tree and statistic value for other prefix series
+    if (forward_move) {
+      ForwardUpdate(Z, info, tau1, quant, alpha);
+    } else {
+      BackwardUpdate(Z, info, tau1, quant, alpha);
+    }
+    forward_move = !forward_move;
+  }
+
+  std::vector<int> ret;
+  if (info.best_stat > 0) {
+    ret.push_back(info.best_loc);
+  }
+  return ret;
+}
+
+void ForwardUpdate(std::vector<double>& Z, Information& info, int& tau1, double quant, double alpha) {
+
+  int min_size = info.min_size;
+  int tau2 = tau1 + min_size;
+  ++tau1;
+  int N = Z.size(), index;
+  // Update A tree
+  for (int i = tau1 - min_size; i < tau1 - 1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      ++info.A[index];
+      index /= 2;
+    }
+  }
+  for (int i = tau1 - min_size; i < tau1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - min_size - 1]);
+    while (index) {
+      --info.A[index];
+      index /= 2;
+    }
+  }
+  index = GetIndex(info.b, Z[tau1 - min_size - 1] - Z[tau1 - min_size]);
+  while (index) {
+    ++info.A[index];
+    index /= 2;
+  }
+  double qa = std::pow(GetQuantile(info.A, quant), alpha);
+
+  // Update AB tree
+  index = GetIndex(info.b, Z[tau1 - 1] - Z[tau1 - min_size - 1]);
+  while (index) {
+    --info.AB[index];
+    index /= 2;
+  }
+  for (int i = tau1; i < tau2; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - min_size - 1]);
+    while (index) {
+      --info.AB[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      ++info.AB[index];
+      index /= 2;
+    }
+  }
+  for (int i = tau1 - min_size; i < tau1 - 1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      --info.AB[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau2]);
+    while (index) {
+      ++info.AB[index];
+      index /= 2;
+    }
+  }
+  index = GetIndex(info.b, Z[tau1 - 1] - Z[tau2]);
+  while (index) {
+    ++info.AB[index];
+    index /= 2;
+  }
+  double qc = std::pow(GetQuantile(info.AB, quant), alpha);
+
+  // Update B tree
+  for (int i = tau1; i < tau2; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      --info.B[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau2]);
+    while (index) {
+      ++info.B[index];
+      index /= 2;
+    }
+  }
+
+  // Increment tau2 and update statistic value as we proceed
+  ++tau2;
+  for (; tau2 < N + 1; ++tau2) {
+    index = GetIndex(info.b, Z[tau2 - 1] - Z[tau2 - 2]);
+    while (index) {
+      ++info.B[index];
+      index /= 2;
+    }
+    double qb = std::pow(GetQuantile(info.B, quant), alpha);
+
+    double stat = 2 * qc - qa - qb;
+    stat *= (double)(tau2 - tau1) * tau1 / tau2;
+
+    if (stat > info.best_stat) {
+      info.best_stat = stat;
+      info.best_loc = tau1;
+      info.best_t2 = tau2;
+    }
+  }
+}
+
+void BackwardUpdate(std::vector<double>& Z, Information& info, int& tau1, double quant, double alpha) {
+
+  int min_size = info.min_size;
+  int tau2 = tau1 + min_size;
+  ++tau1;
+  int N = Z.size(), index;
+  // Update A tree
+  for (int i = tau1 - min_size; i < tau1 - 1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      ++info.A[index];
+      index /= 2;
+    }
+  }
+  for (int i = tau1 - min_size; i < tau1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - min_size - 1]);
+    while (index) {
+      --info.A[index];
+      index /= 2;
+    }
+  }
+  index = GetIndex(info.b, Z[tau1 - min_size - 1] - Z[tau1 - min_size]);
+  while (index) {
+    ++info.A[index];
+    index /= 2;
+  }
+  double qa = std::pow(GetQuantile(info.A, quant), alpha);
+
+  // Update AB tree
+  index = GetIndex(info.b, Z[tau1 - 1] - Z[tau1 - min_size - 1]);
+  while (index) {
+    --info.AB[index];
+    index /= 2;
+  }
+  for (int i = tau1; i < tau2; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - min_size - 1]);
+    while (index) {
+      --info.AB[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      ++info.AB[index];
+      index /= 2;
+    }
+  }
+  for (int i = tau1 - min_size; i < tau1 - 1; ++i) {
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      --info.AB[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau2]);
+    while (index) {
+      ++info.AB[index];
+      index /= 2;
+    }
+  }
+  index = GetIndex(info.b, Z[tau1 - 1] - Z[tau2]);
+  while (index) {
+    ++info.AB[index];
+    index /= 2;
+  }
+  double qc = std::pow(GetQuantile(info.AB, quant), alpha);
+
+  // Update B tree
+  for (int i = tau1; i < tau1 + min_size - 1; ++i) {
+    index = GetIndex(info.b, Z[tau1 + min_size - 1] - Z[i]);
+    while (index) {
+      ++info.B[index];
+      index /= 2;
+    }
+    index = GetIndex(info.b, Z[i] - Z[tau1 - 1]);
+    while (index) {
+      --info.B[index];
+      index /= 2;
+    }
+  }
+  double qb = std::pow(GetQuantile(info.B, quant), alpha);
+  // Move tau2 from the end of the time series to the front.
+  // Update the statistic value along the way
+  tau2 = N;
+
+  for (; tau2 >= tau1 + min_size; --tau2) {
+    index = GetIndex(info.b, Z[tau2 - 1] - Z[tau2 - 2]);
+    while (index) {
+      --info.B[index];
+      index /= 2;
+    }
+    qb = std::pow(GetQuantile(info.B, quant), alpha);
+
+    double stat = 2 * qc - qa - qb;
+    stat *= (double)(tau2 - tau1) * tau1 / tau2;
+
+    if (stat > info.best_stat) {
+      info.best_stat = stat;
+      info.best_loc = tau1;
+      info.best_t2 = tau2;
+    }
+  }
+}

data/ext/breakout/edmx.cpp

@@ -0,0 +1,90 @@
+/*
+Robust estimation of 2[mean(X)-mean(Y)]^2 time normalization factor
+This is the E-Divisive E-statistic when alpha = 2
+Instead of calculating mean(X) we calculate median(X), and similarly for Y
+*/
+
+#include <algorithm>
+#include <cmath>
+#include <queue>
+#include <vector>
+
+void AddToHeaps(std::priority_queue<double, std::vector<double>, std::greater<double>>& m, std::priority_queue<double>& M, double x);
+
+double getMedian(const std::priority_queue<double, std::vector<double>, std::greater<double>>& m, const std::priority_queue<double>& M);
+
+std::vector<int> EDMX(const std::vector<double>& Z, int min_size = 24, double alpha = 2) {
+
+  alpha = 2; // Not used, just here for uniform funciton signature
+
+  std::priority_queue<double> LeftMax;
+  std::priority_queue<double, std::vector<double>, std::greater<double>> LeftMin;
+
+  double stat = -3, stat_best = -3, t1 = 0.0, t2;
+  int tau1, tau2;
+  int N = Z.size();
+  for (int i = 0; i < min_size - 1; ++i)
+    AddToHeaps(LeftMin, LeftMax, Z[i]);
+
+  for (tau1 = min_size; tau1 < N - min_size + 1; ++tau1) { // Iterate over breakout locations
+    AddToHeaps(LeftMin, LeftMax, Z[tau1 - 1]);
+    std::priority_queue<double> RightMax;
+    std::priority_queue<double, std::vector<double>, std::greater<double>> RightMin;
+    double medL = getMedian(LeftMin, LeftMax);
+
+    // Add first set of elements to the heaps for the right segment
+    for (std::vector<double>::const_iterator i = Z.begin() + tau1; i != Z.begin() + tau1 + min_size - 1; ++i)
+      AddToHeaps(RightMin, RightMax, *i);
+
+    for (tau2 = tau1 + min_size; tau2 < N + 1; ++tau2) { // Iterate over end of prefix series locations
+      AddToHeaps(RightMin, RightMax, Z[tau2 - 1]);
+      double medR = getMedian(RightMin, RightMax);
+
+      stat = std::pow(medL - medR, 2);
+      stat *= ((double)tau1 * (tau2 - tau1) / tau2);
+
+      if (stat > stat_best) {
+        t1 = tau1;
+        t2 = tau2;
+        stat_best = stat;
+      }
+    }
+  }
+
+  std::vector<int> ret;
+  if (stat_best > 0) {
+    ret.push_back(t1);
+  }
+  return ret;
+}
+
+// Use 2 heaps to keep track of the median (can also be adjusted for other quantiles). One heap
+// for the "larger" and one heap for the "smaller" observations. Simple to update for streaming
+// data ( O(log n) ) and find median ( O(1) ).
+
+double getMedian(const std::priority_queue<double, std::vector<double>, std::greater<double>>& m, const std::priority_queue<double>& M) {
+
+  if (m.size() > M.size()) // There are an odd number of observations
+    return m.top();
+  else if (M.size() > m.size()) // There are an odd number of observations
+    return M.top();
+  else // There are an even number of obersations
+    return (m.top() + M.top()) / 2;
+}
+
+void AddToHeaps(std::priority_queue<double, std::vector<double>, std::greater<double>>& m, std::priority_queue<double>& M, double x) {
+
+  // decide on initial heap to place element into
+  if (m.empty() || x < m.top())
+    M.push(x);
+  else
+    m.push(x);
+  // make sure that heaps are balanced
+  if (m.size() > M.size() + 1) {
+    M.push(m.top());
+    m.pop();
+  } else if (M.size() > m.size() + 1) {
+    m.push(M.top());
+    M.pop();
+  }
+}

data/ext/breakout/ext.cpp

@@ -0,0 +1,51 @@
+// rice
+#include <rice/rice.hpp>
+#include <rice/stl.hpp>
+
+std::vector<int> EDM_multi(const std::vector<double>& Z, int min_size = 24, double beta = 0, int degree = 0);
+std::vector<int> EDM_percent(const std::vector<double>& Z, int min_size = 24, double percent = 0, int degree = 0);
+std::vector<int> EDM_tail(std::vector<double>& Z, int min_size = 24, double alpha = 2, double quant = 0.5);
+std::vector<int> EDMX(const std::vector<double>& Z, int min_size = 24, double alpha = 2);
+
+extern "C"
+void Init_ext() {
+  auto rb_mBreakout = Rice::define_module("Breakout");
+
+  rb_mBreakout
+    .define_singleton_function(
+      "_detect",
+      [](std::vector<double> z, int min_size, const std::string& method, double alpha, std::optional<double> beta, int degree, std::optional<double> percent, bool exact) {
+        auto minmax = std::minmax_element(z.begin(), z.end());
+        auto min = *minmax.first;
+        auto max = *minmax.second;
+        auto diff = max - min;
+        if (diff == 0) {
+          // constant series
+          return Rice::Array();
+        }
+        for (auto i = 0; i < z.size(); i++) {
+          z[i] = (z[i] - min) / diff;
+        }
+
+        std::vector<int> res;
+        if (method == "amoc") {
+          if (exact) {
+            res = EDMX(z, min_size, alpha);
+          } else {
+            res = EDM_tail(z, min_size, alpha);
+          }
+        } else {
+          if (percent.has_value()) {
+            res = EDM_percent(z, min_size, *percent, degree);
+          } else {
+            res = EDM_multi(z, min_size, beta.value_or(0.008), degree);
+          }
+        }
+
+        auto a = Rice::Array();
+        for (auto v : res) {
+          a.push(v);
+        }
+        return a;
+      });
+}

data/ext/breakout/extconf.rb

@@ -0,0 +1,5 @@
+require "mkmf-rice"
+
+$CXXFLAGS += " -std=c++17 $(optflags)"
+
+create_makefile("breakout/ext")

data/ext/breakout/helper.cpp

@@ -0,0 +1,69 @@
+#include <algorithm>
+#include <cmath>
+#include <set>
+
+extern double Linear(double x) { return 1; }
+extern double Const(double x) { return 0; }
+extern double Quadratic(double x) { return 2 * x + 1; }
+
+/*
+Use 2 multisets (red-black trees) to keep track of the median. One tree for the larger (m) and
+one for the smaller (M) observations. Insertion and deletion in O(log(n)) and find
+the median in O(1), additional memory use is O(n).
+*/
+
+// insert x into the appropriate tree
+extern void insert_element(std::multiset<double>& m, std::multiset<double, std::greater<double>>& M, double x) {
+
+  if (m.empty() || x < *(m.begin()))
+    M.insert(x);
+  else
+    m.insert(x);
+  if (m.size() > M.size() + 1) {
+    std::multiset<double>::iterator i;
+    i = m.begin();
+    M.insert(*i);
+    m.erase(m.begin());
+  } else if (M.size() > m.size() + 1) {
+    std::multiset<double, std::greater<double>>::iterator i;
+    i = M.begin();
+    m.insert(*i);
+    M.erase(M.begin());
+  }
+}
+
+// given a pair of trees obtain the median
+extern double get_median(const std::multiset<double>& m, const std::multiset<double, std::greater<double>>& M) {
+
+  if (m.size() > M.size())
+    return *(m.begin());
+  else if (M.size() > m.size())
+    return *(M.begin());
+  else
+    return (*(M.begin()) + *(m.begin())) / 2;
+}
+
+// remove x from the tree, if multiple copies of x exist only remove 1
+// since this method is never called by the user directly it is assumed
+// that there is at least 1 copy of x
+extern void remove_element(std::multiset<double>& m, std::multiset<double, std::greater<double>>& M, double x) {
+
+  if (x < *(m.begin())) {
+    std::multiset<double, std::greater<double>>::iterator i = M.find(x);
+    M.erase(i);
+  } else {
+    std::multiset<double>::iterator i = m.find(x);
+    m.erase(i);
+  }
+  if (m.size() > M.size() + 1) {
+    std::multiset<double>::iterator i;
+    i = m.begin();
+    M.insert(*i);
+    m.erase(m.begin());
+  } else if (M.size() > m.size() + 1) {
+    std::multiset<double, std::greater<double>>::iterator i;
+    i = M.begin();
+    m.insert(*i);
+    M.erase(M.begin());
+  }
+}

data/ext/breakout/helper.h

@@ -0,0 +1,13 @@
+#pragma once
+
+#include <algorithm>
+#include <cmath>
+#include <set>
+
+double get_median(const std::multiset<double>&, const std::multiset<double, std::greater<double>>&);
+void insert_element(std::multiset<double>&, std::multiset<double, std::greater<double>>&, double);
+void remove_element(std::multiset<double>&, std::multiset<double, std::greater<double>>&, double);
+
+extern double Linear(double x);
+extern double Const(double x);
+extern double Quadratic(double x);

data/lib/breakout/version.rb

@@ -0,0 +1,3 @@
+module Breakout
+  VERSION = "0.1.0"
+end

data/lib/breakout-detection.rb

@@ -0,0 +1 @@
+require "breakout"

data/lib/breakout.rb

@@ -0,0 +1,28 @@
+# ext
+require "breakout/ext"
+
+# modules
+require "breakout/version"
+
+module Breakout
+  def self.detect(series, min_size: 30, method: "multi", alpha: 2, beta: nil, degree: 1, percent: nil, exact: true)
+    raise ArgumentError, "min_size must be at least 2" if min_size < 2
+    raise ArgumentError, "beta and percent cannot be passed together" unless beta.nil? || percent.nil?
+    raise ArgumentError, "alpha must be between 0 and 2" if alpha < 0 || alpha > 2
+    raise ArgumentError, "degree must be 0, 1, or 2" unless [0, 1, 2].include?(degree)
+    raise ArgumentError, "Bad method" unless ["amoc", "multi"].include?(method)
+
+    return [] if series.size < min_size
+
+    if series.is_a?(Hash)
+      sorted = series.sort_by { |k, _| k }
+      z = sorted.map(&:last)
+    else
+      z = series
+    end
+
+    res = _detect(z, min_size, method, alpha, beta, degree, percent, exact)
+    res.map! { |i| sorted[i][0] } if series.is_a?(Hash)
+    res
+  end
+end

metadata

@@ -0,0 +1,71 @@
+--- !ruby/object:Gem::Specification
+name: breakout-detection
+version: !ruby/object:Gem::Version
+  version: 0.1.0
+platform: ruby
+authors:
+- Andrew Kane
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2021-09-03 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: rice
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 4.0.2
+  type: :runtime
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - ">="
+      - !ruby/object:Gem::Version
+        version: 4.0.2
+description:
+email: andrew@ankane.org
+executables: []
+extensions:
+- ext/breakout/extconf.rb
+extra_rdoc_files: []
+files:
+- CHANGELOG.md
+- LICENSE.txt
+- README.md
+- ext/breakout/edm_multi.cpp
+- ext/breakout/edm_percent.cpp
+- ext/breakout/edm_tail.cpp
+- ext/breakout/edmx.cpp
+- ext/breakout/ext.cpp
+- ext/breakout/extconf.rb
+- ext/breakout/helper.cpp
+- ext/breakout/helper.h
+- lib/breakout-detection.rb
+- lib/breakout.rb
+- lib/breakout/version.rb
+homepage: https://github.com/ankane/breakout
+licenses:
+- GPL-2.0-or-later
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '2.6'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.2.22
+signing_key:
+specification_version: 4
+summary: Breakout detection for Ruby
+test_files: []