How to leave only the following strings?












2












$begingroup$


Consider a data having the form



data = {{1,7,4,6},{1,6,4,8},{2,4,9,2},{E,...},{1,4,6,3},{4,4,6,2},{E,...},...}


i.e., some number $n_{1}$ of rows followed by row ${E,...}$, then some number $n_{2}$ of rows followed by row ${E,...}$ and so on.



Could you please tell me how to leave only the last rows before ${E,}$, i.e. to obtain



subdata= {{2,4,9,2},{4,4,6,2},...}?





list-manipulation data







share|improve this question









$endgroup$








  • 1




    $begingroup$
    e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
    $endgroup$
    – C. E.
    3 hours ago
















2












$begingroup$


Consider a data having the form



data = {{1,7,4,6},{1,6,4,8},{2,4,9,2},{E,...},{1,4,6,3},{4,4,6,2},{E,...},...}


i.e., some number $n_{1}$ of rows followed by row ${E,...}$, then some number $n_{2}$ of rows followed by row ${E,...}$ and so on.



Could you please tell me how to leave only the last rows before ${E,}$, i.e. to obtain



subdata= {{2,4,9,2},{4,4,6,2},...}?





list-manipulation data







share|improve this question









$endgroup$








  • 1




    $begingroup$
    e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
    $endgroup$
    – C. E.
    3 hours ago














2












2








2





$begingroup$


Consider a data having the form



data = {{1,7,4,6},{1,6,4,8},{2,4,9,2},{E,...},{1,4,6,3},{4,4,6,2},{E,...},...}


i.e., some number $n_{1}$ of rows followed by row ${E,...}$, then some number $n_{2}$ of rows followed by row ${E,...}$ and so on.



Could you please tell me how to leave only the last rows before ${E,}$, i.e. to obtain



subdata= {{2,4,9,2},{4,4,6,2},...}?





list-manipulation data







share|improve this question









$endgroup$




Consider a data having the form



data = {{1,7,4,6},{1,6,4,8},{2,4,9,2},{E,...},{1,4,6,3},{4,4,6,2},{E,...},...}


i.e., some number $n_{1}$ of rows followed by row ${E,...}$, then some number $n_{2}$ of rows followed by row ${E,...}$ and so on.



Could you please tell me how to leave only the last rows before ${E,}$, i.e. to obtain



subdata= {{2,4,9,2},{4,4,6,2},...}?





list-manipulation data




list-manipulation data






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 3 hours ago









John TaylorJohn Taylor

787211




787211








  • 1




    $begingroup$
    e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
    $endgroup$
    – C. E.
    3 hours ago














  • 1




    $begingroup$
    e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
    $endgroup$
    – C. E.
    3 hours ago








1




1




$begingroup$
e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
$endgroup$
– C. E.
3 hours ago




$begingroup$
e.g. SequenceCases[data, {x_List, {E, ___}} :> x]
$endgroup$
– C. E.
3 hours ago










2 Answers
2






active

oldest

votes


















2












$begingroup$

Try SequenceCases:



data = {{1, 7, 4, 6}, {1, 6, 4, 8}, {2, 4, 9, 2}, {E, 1, 2, 3}, 

        {1, 4, 6, 3}, {4, 4, 6, 2}, {E, 4, 5, 6}}

SequenceCases[data, {p_, {E, ___}} :> p]


yields



{{2, 4, 9, 2}, {4, 4, 6, 2}}





share|improve this answer









$endgroup$





















    2












    $begingroup$

    The most idiomatic solution to this problem is, in my opinion, pattern matching (as Sakra has also answered):



    SequenceCases[data, {x_List, {E, ___}} :> x]



    {{2, 4, 9, 2}, {4, 4, 6, 2}}




    But the problem also lends itself to functional solutions, e.g.:



    pairs = Partition[data, 2, 1];
    
If[#[[2, 1]] == E, #[[1]], Nothing] & /@ pairs



    {{2, 4, 9, 2}, {4, 4, 6, 2}}




    Or in one go:



    BlockMap[If[#[[2, 1]] == E, #[[1]], Nothing] &, data, 2, 1]



    {{2, 4, 9, 2}, {4, 4, 6, 2}}







    share|improve this answer











    $endgroup$














      Your Answer








      StackExchange.ready(function() {
      var channelOptions = {
      tags: "".split(" "),
      id: "387"
      };
      initTagRenderer("".split(" "), "".split(" "), channelOptions);

      StackExchange.using("externalEditor", function() {
      // Have to fire editor after snippets, if snippets enabled
      if (StackExchange.settings.snippets.snippetsEnabled) {
      StackExchange.using("snippets", function() {
      createEditor();
      });
      }
      else {
      createEditor();
      }
      });

      function createEditor() {
      StackExchange.prepareEditor({
      heartbeatType: 'answer',
      autoActivateHeartbeat: false,
      convertImagesToLinks: false,
      noModals: true,
      showLowRepImageUploadWarning: true,
      reputationToPostImages: null,
      bindNavPrevention: true,
      postfix: "",
      imageUploader: {
      brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
      contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
      allowUrls: true
      },
      onDemand: true,
      discardSelector: ".discard-answer"
      ,immediatelyShowMarkdownHelp:true
      });


      }
      });














      draft saved

      draft discarded


















      StackExchange.ready(
      function () {
      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f195786%2fhow-to-leave-only-the-following-strings%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$

      Try SequenceCases:



      data = {{1, 7, 4, 6}, {1, 6, 4, 8}, {2, 4, 9, 2}, {E, 1, 2, 3}, 
      
        {1, 4, 6, 3}, {4, 4, 6, 2}, {E, 4, 5, 6}}
      
SequenceCases[data, {p_, {E, ___}} :> p]


      yields



      {{2, 4, 9, 2}, {4, 4, 6, 2}}





      share|improve this answer









      $endgroup$


















        2












        $begingroup$

        Try SequenceCases:



        data = {{1, 7, 4, 6}, {1, 6, 4, 8}, {2, 4, 9, 2}, {E, 1, 2, 3}, 
        
        {1, 4, 6, 3}, {4, 4, 6, 2}, {E, 4, 5, 6}}
        
SequenceCases[data, {p_, {E, ___}} :> p]


        yields



        {{2, 4, 9, 2}, {4, 4, 6, 2}}





        share|improve this answer









        $endgroup$
















          2












          2








          2





          $begingroup$

          Try SequenceCases:



          data = {{1, 7, 4, 6}, {1, 6, 4, 8}, {2, 4, 9, 2}, {E, 1, 2, 3}, 
          
        {1, 4, 6, 3}, {4, 4, 6, 2}, {E, 4, 5, 6}}
          
SequenceCases[data, {p_, {E, ___}} :> p]


          yields



          {{2, 4, 9, 2}, {4, 4, 6, 2}}





          share|improve this answer









          $endgroup$



          Try SequenceCases:



          data = {{1, 7, 4, 6}, {1, 6, 4, 8}, {2, 4, 9, 2}, {E, 1, 2, 3}, 
          
        {1, 4, 6, 3}, {4, 4, 6, 2}, {E, 4, 5, 6}}
          
SequenceCases[data, {p_, {E, ___}} :> p]


          yields



          {{2, 4, 9, 2}, {4, 4, 6, 2}}






          share|improve this answer












          share|improve this answer



          share|improve this answer










          answered 3 hours ago









          sakrasakra

          2,8231429




          2,8231429























              2












              $begingroup$

              The most idiomatic solution to this problem is, in my opinion, pattern matching (as Sakra has also answered):



              SequenceCases[data, {x_List, {E, ___}} :> x]



              {{2, 4, 9, 2}, {4, 4, 6, 2}}




              But the problem also lends itself to functional solutions, e.g.:



              pairs = Partition[data, 2, 1];
              
If[#[[2, 1]] == E, #[[1]], Nothing] & /@ pairs



              {{2, 4, 9, 2}, {4, 4, 6, 2}}




              Or in one go:



              BlockMap[If[#[[2, 1]] == E, #[[1]], Nothing] &, data, 2, 1]



              {{2, 4, 9, 2}, {4, 4, 6, 2}}







              share|improve this answer











              $endgroup$


















                2












                $begingroup$

                The most idiomatic solution to this problem is, in my opinion, pattern matching (as Sakra has also answered):



                SequenceCases[data, {x_List, {E, ___}} :> x]



                {{2, 4, 9, 2}, {4, 4, 6, 2}}




                But the problem also lends itself to functional solutions, e.g.:



                pairs = Partition[data, 2, 1];
                
If[#[[2, 1]] == E, #[[1]], Nothing] & /@ pairs



                {{2, 4, 9, 2}, {4, 4, 6, 2}}




                Or in one go:



                BlockMap[If[#[[2, 1]] == E, #[[1]], Nothing] &, data, 2, 1]



                {{2, 4, 9, 2}, {4, 4, 6, 2}}







                share|improve this answer











                $endgroup$
















                  2












                  2








                  2





                  $begingroup$

                  The most idiomatic solution to this problem is, in my opinion, pattern matching (as Sakra has also answered):



                  SequenceCases[data, {x_List, {E, ___}} :> x]



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}




                  But the problem also lends itself to functional solutions, e.g.:



                  pairs = Partition[data, 2, 1];
                  
If[#[[2, 1]] == E, #[[1]], Nothing] & /@ pairs



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}




                  Or in one go:



                  BlockMap[If[#[[2, 1]] == E, #[[1]], Nothing] &, data, 2, 1]



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}







                  share|improve this answer











                  $endgroup$



                  The most idiomatic solution to this problem is, in my opinion, pattern matching (as Sakra has also answered):



                  SequenceCases[data, {x_List, {E, ___}} :> x]



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}




                  But the problem also lends itself to functional solutions, e.g.:



                  pairs = Partition[data, 2, 1];
                  
If[#[[2, 1]] == E, #[[1]], Nothing] & /@ pairs



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}




                  Or in one go:



                  BlockMap[If[#[[2, 1]] == E, #[[1]], Nothing] &, data, 2, 1]



                  {{2, 4, 9, 2}, {4, 4, 6, 2}}








                  share|improve this answer














                  share|improve this answer



                  share|improve this answer








                  edited 1 hour ago

























                  answered 3 hours ago









                  C. E.C. E.

                  51.4k3101207




                  51.4k3101207






























                      draft saved

                      draft discarded




















































                      Thanks for contributing an answer to Mathematica Stack Exchange!


                      • Please be sure to answer the question. Provide details and share your research!

                      But avoid …



                      • Asking for help, clarification, or responding to other answers.

                      • Making statements based on opinion; back them up with references or personal experience.


                      Use MathJax to format equations. MathJax reference.


                      To learn more, see our tips on writing great answers.




                      draft saved


                      draft discarded














                      StackExchange.ready(
                      function () {
                      StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f195786%2fhow-to-leave-only-the-following-strings%23new-answer', 'question_page');
                      }
                      );

                      Post as a guest















                      Required, but never shown





















































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown

































                      Required, but never shown














                      Required, but never shown












                      Required, but never shown







                      Required, but never shown







                      -

                      Popular posts from this blog

                      How to label and detect the document text images

                      Image
                      1 $begingroup$ This is what I mean as document text image: I want to label the texts in image as separate blocks and my model should detect these labels as classes. NOTE: This is how the end result should be like: The labels like Block 1, Block 2, Block 3,.. should be Logo, Title, Date,.. Others, etc. Work done: First approach : I tried to implement this method via Object Detection, it didn't work. It didn't even detect any text. Second approach : Then I tried it using PixelLink. As this model is build for scene text detection, it detected each and every text in the image. But this method can detect multiple lines of text if the threshold values are increased. But I have no idea how do I add labels to the text blocks. PIXEL_CLS_WEIGHT_all_ones = 'PIXEL_CLS_WEIGHT_all_ones' PIXEL_C...
                      Read more

                      Vallis Paradisi

                      Image
                      Coordinata: .mw-parser-output .geo-default,.mw-parser-output .geo-dms,.mw-parser-output .geo-dec{display:inline}.mw-parser-output .geo-nondefault,.mw-parser-output .geo-multi-punct{display:none}.mw-parser-output .longitude,.mw-parser-output .latitude{white-space:nowrap} 33°03′S 71°37′W  /  33.05°S 71.617°W  / -33.05; -71.617 Vallis Paradisi Res apud Vicidata repertae: Civitas : Chilia Numerus incolarum : 296 655 Zona horaria : UTC-4 Situs interretialis Nomen officiale : Valparaíso Gubernium Consilium : municipal council of Valparaíso Geographia Superficies : 401 600 000 Metrum quadratum Coniunctiones urbium Urbes gemellae : Ovetum , Badalona , Santa Fe , Ora longa , Sciamhaevum , Quantunia , Callao , Bat Yam , Melaka , Novorossiysk , Busan , Corduba , Odessa , Rosario , Malacca , Barcino , Soteropolis , Franciscopolis (California) , Guanajuato, Silao Tabula aut despectus Despectus in portum sinumque et urbem Vallis Paradisi Vallis Para...
                      Read more

                      Tabula Rosettana

                      Image
                      Tabula multilinguis Rosettana in Museo Britannico ostenditur. Tabula Rosettana, [1] etiam titulo OGIS 90 agnita, est stela decreto de rebus sacris in Aegypto anno 196 a.C.n. lato inscripta. Tabula iuxta Rosettam Aegypti, urbem in delta Nili et ad oram maris Mediterranei iacentem, anno 1799 a milite Francico reperta est. Inventio stelae, linguis duabus scripturisque tribus inscriptae, eruditis Instituti Aegypti statim nuntiata est; ibi enim iussu imperatoris Napoleonis eruditi omnium scientiarum (sub aegide Commissionis Scientiarum et Artium) properaverant cum expeditione Francica. Qua a Britannis mox debellata, tabula Rosettana Londinium missa hodie apud Museum Britannicum iacet. Textus Graecus cito lectus interpretationi textuum Aegyptiorum (in formis hieroglyphica et demotica expressorum) gradatim adiuvit. Denique textum plene interpretatus est Ioannes Franciscus Champollion. Ab opere eruditorum cumulativo coepit hodiernus scripturae hieroglyphicae linguaeque Aegyptiae a...
                      Read more