stupidedi 1.1.0

data/spec/examples/stupidedi/zipper/abstract_cursor.example

@@ -0,0 +1,417 @@
+require "spec_helper"
+
+describe Stupidedi::Zipper do
+  describe ".build" do
+    it "returns a RootCursor" do
+      Stupidedi::Zipper.build(Node.new("x")).should be_root
+    end
+  end
+end
+
+describe Stupidedi::Zipper::AbstractCursor do
+  let(:root)    { Stupidedi::Zipper.build(Node.new("a")) }
+  let(:leaf)    { root.append_child(Leaf.new("x"))       }
+  let(:root_a)  { root.append_child(Node.new("b"))       }
+  let(:root_b)  { root_a.append(Node.new("c"))           }
+  let(:root_aa) { root_a.append_child(Node.new("d"))     }
+  let(:root_ab) { root_aa.append(Node.new("e"))          }
+
+  describe "#depth" do
+    context "of root" do
+      it "is 0" do
+        root.depth.should == 0
+      end
+    end
+
+    context "of root's child" do
+      it "is 1" do
+        root_a.depth.should == 1
+        root_b.depth.should == 1
+        root_a.up.down.depth.should == 1
+        root_b.up.down.depth.should == 1
+      end
+    end
+
+    context "of root's grandchild" do
+      it "is 2" do
+        root_aa.depth.should == 2
+        root_ab.depth.should == 2
+        root_aa.up.down.depth.should == 2
+        root_ab.up.down.depth.should == 2
+      end
+    end
+  end
+
+  describe "#first?" do
+    context "on root" do
+      it "is true" do
+        root.should be_first
+      end
+    end
+
+    context "on an only child" do
+      it "is true" do
+        root_a.should be_first
+        root_aa.should be_first
+
+        root_a.up.down.should be_first
+        root_aa.up.down.should be_first
+
+        root.dangle.should be_first
+      end
+    end
+
+    context "on the first child" do
+      it "is true" do
+        root_b.prev.should be_first
+        root_ab.prev.should be_first
+
+        root_b.up.down.should be_first
+        root_ab.up.down.should be_first
+      end
+    end
+
+    context "on the last child" do
+      it "is false" do
+        root_b.should_not be_first
+        root_ab.should_not be_first
+
+        root_b.up.down.last.should_not be_first
+        root_ab.up.down.last.should_not be_first
+      end
+    end
+  end
+
+  describe "#last?" do
+    context "on root" do
+      it "is true" do
+        root.should be_last
+        root_a.up.should be_last
+        root_aa.up.up.should be_last
+      end
+    end
+
+    context "on an only child" do
+      it "is true" do
+        root.dangle.should be_last
+        root_a.should be_last
+        root_aa.should be_last
+
+        root_a.up.down.should be_last
+        root_aa.up.down.should be_last
+      end
+    end
+
+    context "on the first child" do
+      it "is false" do
+        root_b.prev.should_not be_last
+        root_ab.prev.should_not be_last
+
+        root_b.up.down.should_not be_last
+        root_ab.up.down.should_not be_last
+      end
+    end
+
+    context "on the last child" do
+      it "is false" do
+        root_b.should be_last
+        root_ab.should be_last
+
+        root_b.up.down.last.should be_last
+        root_ab.up.down.last.should be_last
+      end
+    end
+  end
+
+  describe "#leaf?" do
+    context "on root" do
+      context "with no children" do
+        it "is true" do
+          root.should be_leaf
+          root.dangle.should be_leaf
+          root_a.dangle.should be_leaf
+        end
+      end
+
+      context "with children" do
+        it "is false" do
+          root_a.up.should_not be_leaf
+        end
+      end
+    end
+
+    context "on child" do
+      context "with no children" do
+        it "is true" do
+          root_a.should be_leaf
+          root_a.up.down.should be_leaf
+        end
+      end
+
+      context "with children" do
+        it "is false" do
+          root_aa.up.should_not be_leaf
+          root_ab.up.up.down.should_not be_leaf
+        end
+      end
+    end
+  end
+
+  describe "#root?" do
+    context "on root" do
+      it "is true" do
+        root.should be_root
+        root_a.up.should be_root
+        root_b.up.should be_root
+      end
+    end
+
+    context "on a child" do
+      it "is false" do
+        root_a.should_not be_root
+        root_b.up.down.should_not be_root
+        root.dangle.should_not be_root
+      end
+    end
+  end
+
+  describe "#child(n)" do
+    context "on a leaf" do
+      it "raises an exception" do
+        lambda { root.child(0) }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on a parent" do
+      it "returns the nth child" do
+        root_a.up.child(0).node.should == root_a.node
+        root_b.up.child(0).node.should == root_a.node
+        root_b.up.child(1).node.should == root_b.node
+      end
+    end
+
+    context "when n is negative" do
+      it "raises an exception" do
+        lambda { root_a.up.child(-1) }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+  end
+
+  describe "#dangle" do
+    context "on a leaf" do
+      let(:dangle) { root.dangle }
+
+      it "returns a placeholder" do
+        dangle.should be_first
+        dangle.should be_last
+        dangle.should be_leaf
+
+        dangle.up.should   == root
+        dangle.root.should == root
+        dangle.depth.should == 1
+
+        dangle.first.should  == dangle
+        dangle.last.should   == dangle
+        dangle.delete.should == dangle
+
+        lambda { dangle.next   }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+
+        lambda { dangle.prev   }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+
+        lambda { dangle.dangle }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+
+        lambda { dangle.append_child(Node.new("w")) }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+
+        lambda { dangle.prepend_child(Node.new("w")) }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on a leaf class" do
+      it "raises an exception" do
+        lambda { leaf.dangle }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on a parent" do
+      it "returns the first child" do
+        root_a.up.dangle.node.should == root_a.node
+      end
+    end
+  end
+
+  describe "#down" do
+    context "on a leaf" do
+      it "raises an exception" do
+        lambda { root.down }.should \
+          raise_exception(Stupidedi::Exceptions::ZipperError)
+        lambda { root_a.down }.should \
+          raise_exception(Stupidedi::Exceptions::ZipperError)
+        lambda { root_b.down }.should \
+          raise_exception(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on a parent" do
+      it "returns the first child" do
+        root_a.up.down.node.should == root_a.node
+        root_b.up.down.node.should == root_a.node
+      end
+    end
+  end
+
+  describe "#descendant(n, *ns)"
+
+  describe "#first" do
+    context "on root" do
+      it "returns itself" do
+        root.first.should == root
+      end
+    end
+
+    context "on the first sibling" do
+      it "returns itself" do
+        root_a.first.node.should == root_a.node
+        root_aa.first.node.should == root_aa.node
+
+        root_b.up.down.first.node.should == root_a.node
+        root_ab.up.down.first.node.should == root_aa.node
+      end
+    end
+
+    context "on a next sibling" do
+      it "returns the first sibling" do
+        root_b.first.node.should == root_a.node
+        root_ab.first.node.should == root_aa.node
+
+        root_b.up.down.last.first.node.should == root_a.node
+        root_ab.up.down.last.first.node.should == root_aa.node
+      end
+    end
+  end
+
+  describe "#last" do
+    context "on root" do
+      it "returns root" do
+        root.last.should == root
+      end
+    end
+
+    context "on the last sibling" do
+      it "returns itself" do
+        root_a.last.node.should == root_a.node
+        root_b.last.node.should == root_b.node
+        root_ab.last.node.should == root_ab.node
+        root_ab.last.node.should == root_ab.node
+
+        root_a.up.down.last.node.should == root_a.node
+        root_aa.up.down.last.node.should == root_aa.node
+      end
+    end
+
+    context "on a prev sibling" do
+      it "returns the last sibling" do
+        root_b.prev.last.node.should == root_b.node
+        root_ab.prev.last.node.should == root_ab.node
+
+        root_b.up.down.last.node.should == root_b.node
+        root_ab.up.down.last.node.should == root_ab.node
+      end
+    end
+  end
+
+  describe "#next" do
+    context "on root" do
+      it "raises an exception" do
+        lambda { root.next }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on the last sibling" do
+      it "raises an exception" do
+        lambda { root_a.next }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+        lambda { root_b.next }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+        lambda { root_b.up.down.next.next }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on the prev sibling" do
+      it "returns the next sibling" do
+        root_b.prev.next.node.should == root_b.node
+        root_ab.prev.next.node.should == root_ab.node
+
+        root_b.up.down.next.node.should == root_b.node
+        root_ab.up.down.next.node.should == root_ab.node
+      end
+    end
+  end
+
+  describe "#prev" do
+    context "on root" do
+      it "raises an exception" do
+        lambda { root.prev }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on the first sibling" do
+      it "raises an exception" do
+        lambda { root_a.prev }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+        lambda { root_aa.prev }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+
+        lambda { root_b.up.down.prev }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+        lambda { root_ab.up.down.prev }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+
+    context "on the next sibling" do
+      it "returns the prev sibling" do
+        root_b.prev.node.should == root_a.node
+        root_ab.prev.node.should == root_aa.node
+
+        root_b.up.down.next.prev.node.should == root_a.node
+        root_ab.up.down.next.prev.node.should == root_aa.node
+      end
+    end
+  end
+
+  describe "#root" do
+    context "on root" do
+      it "returns root" do
+        root.root.should == root
+      end
+    end
+  end
+
+  describe "#up" do
+    context "on root" do
+      it "raises an error" do
+        lambda { root.up }.should \
+          raise_error(Stupidedi::Exceptions::ZipperError)
+      end
+    end
+  end
+
+  describe "#append(sibling)"
+  describe "#append_child(child)"
+  describe "#prepend(sibling)"
+  describe "#prepend_child(child)"
+  describe "#delete"
+  describe "#replace(node)"
+
+end

data/spec/examples/stupidedi/zipper.example

@@ -0,0 +1,9 @@
+require "spec_helper"
+
+describe Stupidedi::Zipper do
+  describe ".build" do
+    it "returns a RootCursor" do
+      Stupidedi::Zipper.build(Node.new("x")).should be_root
+    end
+  end
+end

data/spec/fixtures/X186-AG824/1-bad.txt

@@ -0,0 +1,21 @@
+Business Scenario 1 - Positive Acknowledgement 
+
+The following is the 824 transaction set sent from ABC Insurance to acknowledge receipt of the 834 from SmithCo.
+
+Errors Found in File 824 5010X186-1
+* W10009:Padding, spaces or control characters detected after segment terminator.
+* H10014:Leading zeros detected in OTI08. The X12 syntax requires the suppression of leading zeros for numeric elements.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*
+000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*
+005010X186~
+ST*824*021390001*005010X186~
+BGN*11*FFA.ABCDEF.123456*20020709*0932**123456789**WQ~
+N1*41*ABC INSURANCE*46*111111111~
+PER*IC*JOHN JOHNSON*TE*8005551212*EX*1439~
+N1*40*SMITHCO*46*A1234~
+OTI*TA*TN*NA***20020709*0902*0002*0001*834*004010X095~
+SE*7*021390001~
+GE*1*22~
+IEA*1*000000022~

data/spec/fixtures/X186-AG824/1-good.txt

@@ -0,0 +1,17 @@
+Business Scenario 1 - Positive Acknowledgement 
+
+The following is the 824 transaction set sent from ABC Insurance to acknowledge receipt of the 834 from SmithCo.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*
+000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*
+005010X186~
+ST*824*021390001*005010X186~
+BGN*11*FFA.ABCDEF.123456*20020709*0932**123456789**WQ~
+N1*41*ABC INSURANCE*46*111111111~
+PER*IC*JOHN JOHNSON*TE*8005551212*EX*1439~
+N1*40*SMITHCO*46*A1234~
+OTI*TA*TN*NA***20020709*0902*2*0001*834*004010X095~
+SE*7*021390001~
+GE*1*22~
+IEA*1*000000022~

data/spec/fixtures/X186-AG824/2-bad.txt

@@ -0,0 +1,26 @@
+Business Scenario 2 
+
+The following is the 824 transaction set sent from DEF Insurance to report on the implementation guide error of the 124 from JonesCo.
+
+Errors Found in File 824 5010X186-2
+* W10009:Padding, spaces or control characters detected after segment terminator.
+* H10014:Leading zeros detected in OTI08. The X12 syntax requires the suppression of leading zeros for numeric elements.
+* H10014:Leading zeros detected in TED0501. The X12 syntax requires the suppression of leading zeros for numeric elements.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*
+000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*
+005010X186~
+ST*824*021390002*005010X186~
+BGN*11*FFA.ABCDEF.123456*20020709*0932**
+123456789**U~
+N1*41*DEF INSURANCE*46*222222222~
+PER*IC*TOM EVANS*TE*8005551212*EX*1439~
+N1*40*JONESCO*46*B5678~
+OTI*TR*TN*NA***20020709*0902*0002*0001*124*
+004010~
+TED*024**VEH*36*02~
+RED*NA**94**IBP*E054~
+SE*9*021390002~
+GE*1*22~
+IEA*1*000000022~

data/spec/fixtures/X186-AG824/2-good.txt

@@ -0,0 +1,21 @@
+Business Scenario 2 
+
+The following is the 824 transaction set sent from DEF Insurance to report on the implementation guide error of the 124 from JonesCo.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*
+000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*
+005010X186~
+ST*824*021390002*005010X186~
+BGN*11*FFA.ABCDEF.123456*20020709*0932**
+123456789**U~
+N1*41*DEF INSURANCE*46*222222222~
+PER*IC*TOM EVANS*TE*8005551212*EX*1439~
+N1*40*JONESCO*46*B5678~
+OTI*TR*TN*NA***20020709*0902*2*0001*124*
+004010~
+TED*024**VEH*36*2~
+RED*NA**94**IBP*E054~
+SE*9*021390002~
+GE*1*22~
+IEA*1*000000022~

data/spec/fixtures/X186-AG824/3-bad.txt

@@ -0,0 +1,87 @@
+Business Scenario 3 
+
+Partial Transaction Set Reject Reporting.
+
+Errors Found in File 824 5010X186-3
+* W10009:Padding, spaces or control characters detected after segment terminator.
+* H46441:The value of TA was found but not expected because BGN08 is not equal to WQ.
+* H10005:Value '040812' is too short for 'OTI06'.
+* H46444:The Error or Informational Message Location was not found but was expected because OTI01 is equal to BR, IR, TR, BC, IC, TC, BE, IE, TE, BP, IP, or TP.
+* H10005:Value '040812' is too short for 'OTI06'.
+* H10005:Value '040812' is too short for 'OTI06'.
+* H10005:Value '040812' is too short for 'OTI06'.
+* H20203:Element NM107 is present, though marked 'Not Used'.
+* H10005:Value '040812' is too short for 'OTI06'.
+* H20203:Element NM107 is present, though marked 'Not Used'.
+* H12029:Assuming Element Repeat Delimiter is - rather than ^ in CTX01.
+* H10018:Trailing spaces are not allowed (CTX0101).
+* H10016:Leading spaces are not allowed (CTX0101).
+* H10005:Value '040812' is too short for 'OTI06'.
+* H10005:Value '040812' is too short for 'OTI06'.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*
+000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*
+005010X186~
+ST*824*0001*005010X186~
+BGN*11*12345*20040831*150057**0123**RU~
+N1*41*CONSOLIDATED INSURANCE CO*46*00000~
+PER*IC*CUSTOMER SERVICE*TE*8005551212~
+N1*40*PHIL GOOD, M.D.*46*TXX23~
+OTI*TA*TN*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*F8*0123~
+DTM*050*20040814~
+AMT*GW*16970.33~
+QTY*TO*5~
+NM1*41*2*PHIL GOOD, M.D.*****46*TXX23~
+TED*024~
+RED*NA**94**IBP*W050~
+OTI*BP*BT*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*1C*99983000~
+AMT*2*16970.33~
+QTY*46*5~
+NM1*85*2*GOOD AND ASSOCIATES*****24*555667777~
+OTI*IA*IX*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*EJ*26462967~
+AMT*GW*540~
+NM1*QC*1*SMITH*TED****MI*000221111A~
+OTI*IE*IX*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*EJ*78945639837~
+AMT*GW*1100.67~
+NM1*QC*1*BROWN*ROBERT*W**JR*MI*888553737~
+TED*024**N4*32*3**10407~
+RED*NA**94**IBP*E038~
+OTI*IR*IX*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*EJ*8437450584598~
+AMT*GW*12642.16~
+NM1*QC*1*JAMES*JIM*D**II*MI*011332211~
+TED*024**N4*54*3**73076~
+RED*NA**94**IBP*E038~
+TED*024**REF*68~
+CTX*2310A REFERRING PROVIDER*NM1*65*2310~
+CTX*2010BB PAYER NAME*NM1*18*2010~
+CTX*CLAIM FILING INDICATOR CODE - MB*SBR*13*
+2000*9~
+RED*NA**94**IBP*E019~
+OTI*IA*IX*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*EJ*984576898~
+AMT*GW*1900.5~
+NM1*QC*1*MAE*SALLIE*M***MI*987654321~
+OTI*IE*IX*NA***040812*1253*1000001*0021*837*
+004010X098A1~
+REF*EJ*8767657645765~
+AMT*GW*787~
+NM1*QC*1*DOE*JANE****MI*777553333~
+TED*024**N4*113*3**27387~
+RED*NA**94**IBP*E038~
+TED*024**N4*124*3**27378~
+RED*NA**94**IBP*E038~
+SE*52*0001~
+GE*1*22~
+IEA*1*000000022~

data/spec/fixtures/X186-AG824/3-good.txt

@@ -0,0 +1,61 @@
+Business Scenario 3 
+
+Partial Transaction Set Reject Reporting.
+
+ISA*00*          *00*          *ZZ*RECEIVERS ID   *ZZ*SUBMITTERS ID  *040831*1500*^*00501*000000022*0*P*:~
+GS*AG*RECEIVERID*SENDERID*20040831*150057*22*X*005010X186~
+ST*824*0001*005010X186~
+BGN*11*12345*20040831*150057**0123**RU~
+N1*41*CONSOLIDATED INSURANCE CO*46*00000~
+PER*IC*CUSTOMER SERVICE*TE*8005551212~
+N1*40*PHIL GOOD, M.D.*46*TXX23~
+OTI*BP*BT*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*F8*0123~
+DTM*050*20040814~
+AMT*GW*16970.33~
+QTY*TO*5~
+NM1*41*2*PHIL GOOD, M.D.*****46*TXX23~
+TED*024~
+RED*NA**94**IBP*W050~
+OTI*BP*BT*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*1C*99983000~
+AMT*2*16970.33~
+QTY*46*5~
+NM1*85*2*GOOD AND ASSOCIATES*****24*555667777~
+TED*024~
+OTI*IA*IX*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*EJ*26462967~
+AMT*GW*540~
+NM1*QC*1*SMITH*TED****MI*000221111A~
+OTI*IE*IX*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*EJ*78945639837~
+AMT*GW*1100.67~
+NM1*QC*1*BROWN*ROBERT*W***MI*888553737~
+TED*024**N4*32*3**10407~
+RED*NA**94**IBP*E038~
+OTI*IR*IX*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*EJ*8437450584598~
+AMT*GW*12642.16~
+NM1*QC*1*JAMES*JIM*D***MI*011332211~
+TED*024**N4*54*3**73076~
+RED*NA**94**IBP*E038~
+TED*024**REF*68~
+CTX*2310A REFERRING PROVIDER*NM1*65*2310~
+CTX*2010BB PAYER NAME*NM1*18*2010~
+CTX*CLAIM FILING INDICATOR CODE*SBR*13*2000*9~
+RED*NA**94**IBP*E019~
+OTI*IA*IX*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*EJ*984576898~
+AMT*GW*1900.5~
+NM1*QC*1*MAE*SALLIE*M***MI*987654321~
+OTI*IE*IX*NA***20040812*1253*1000001*0021*837*004010X098A1~
+REF*EJ*8767657645765~
+AMT*GW*787~
+NM1*QC*1*DOE*JANE****MI*777553333~
+TED*024**N4*113*3**27387~
+RED*NA**94**IBP*E038~
+TED*024**N4*124*3**27378~
+RED*NA**94**IBP*E038~
+SE*53*0001~
+GE*1*22~
+IEA*1*000000022~