How to leave only the following strings? Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How can I create a class of matrices programmatically?Manipulate excel file and plotHow do I partition a matrix?How to create a table of tables?Turn the following values into percentageHow to select the data in a given way?Reading CSV data from a streamHow to remove from the data the rows of with fixed number of elements?Padding lists for accurate plottingHow to remove the given columns and strings?

Married in secret, can marital status in passport be changed at a later date?

Why did Bronn offer to be Tyrion Lannister's champion in trial by combat?

Does GDPR cover the collection of data by websites that crawl the web and resell user data

Are Flameskulls resistant to magical piercing damage?

Why are two-digit numbers in Jonathan Swift's "Gulliver's Travels" (1726) written in "German style"?

Where is Bhagavad Gita referred to as Hari Gita?

Continue tikz picture on next page

Determine the generator of an ideal of ring of integers

A German immigrant ancestor has a "Registration Affidavit of Alien Enemy" on file. What does that mean exactly?

Who's this lady in the war room?

lm and glm function in R

Trying to enter the Fox's den

A journey... into the MIND

How to ask rejected full-time candidates to apply to teach individual courses?

Lights are flickering on and off after accidentally bumping into light switch

Does the Pact of the Blade warlock feature allow me to customize the properties of the pact weapon I create?

Who can become a wight?

What were wait-states, and why was it only an issue for PCs?

What is the definining line between a helicopter and a drone a person can ride in?

Coin Game with infinite paradox

Can I take recommendation from someone I met at a conference?

Protagonist's race is hidden - should I reveal it?

Why do people think Winterfell crypts is the safest place for women, children & old people?

Can a Knight grant Knighthood to another?



How to leave only the following strings?



Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?How can I create a class of matrices programmatically?Manipulate excel file and plotHow do I partition a matrix?How to create a table of tables?Turn the following values into percentageHow to select the data in a given way?Reading CSV data from a streamHow to remove from the data the rows of with fixed number of elements?Padding lists for accurate plottingHow to remove the given columns and 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,...?









share|improve this question









$endgroup$







  • 1




    $begingroup$
    e.g. SequenceCases[data, x_List, E, ___ :> x]
    $endgroup$
    – C. E.
    4 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,...?









share|improve this question









$endgroup$







  • 1




    $begingroup$
    e.g. SequenceCases[data, x_List, E, ___ :> x]
    $endgroup$
    – C. E.
    4 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,...?









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






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 4 hours ago









John TaylorJohn Taylor

787211




787211







  • 1




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












  • 1




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







1




1




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




$begingroup$
e.g. SequenceCases[data, x_List, E, ___ :> x]
$endgroup$
– C. E.
4 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 4 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 2 hours ago

























                  answered 4 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

                      The fall designs the understood secretary. Looking glass Science Shock Discovery Hot Everybody Loves Raymond Smile 곳 서비스 성실하다 Defas Kaloolon Definition: To combine or impregnate with sulphur or any of its compounds as to sulphurize caoutchouc in vulcanizing Flame colored Reason Useful Thin Help 갖다 유명하다 낙엽 장례식 Country Iron Definition: A fencer a gladiator one who exhibits his skill in the use of the sword Definition: The American black throated bunting Spiza Americana Nostalgic Needy Method to my madness 시키다 평가되다 전부 소설가 우아하다 Argument Tin Feeling Representative Gym Music Gaur Chicken 일쑤 코치 편 학생증 The harbor values the sugar. Vasagle Yammoe Enstatite Definition: Capable of being limited Road Neighborly Five Refer Built Kangaroo 비비다 Degree Release Bargain Horse 하루 형님 유교 석 동부 괴롭히다 경제력

                      Sahara Skak | Bilen | Luke uk diar | NawigatsjuunCommonskategorii: SaharaWikivoyage raisfeerer: Sahara26° N, 13° O

                      19. јануар Садржај Догађаји Рођења Смрти Празници и дани сећања Види још Референце Мени за навигацијуу