Understanding takeWhile termination condition during Iterator.iterate in Scala












0














I am having some trouble understanding why this code seemingly terminates early:



object intersectionDemo {
val arr = Array(2, 4, 7, 8, 12, 20)
val arr2 = Array(3, 4, 8, 9, 11, 20)
Iterator.iterate((arr, arr2, List[Int]())) {
case (one, two, res) =>
if (one.head == two.head)
(one.tail, two.tail, one.head :: res)
else if (one.head > two.head)
(one, two.tail, res)
else
(one.tail, two, res)
}.takeWhile { case (a, b, _) => a.nonEmpty && b.nonEmpty }
.toList.last._3.reverse
}


It returns List(4, 8) though it should return List(4, 8, 20) and if I inspect the first or second arrays here: _._1 or _._2 I get Array(20). I do know there are other ways to solve the intersection of two arrays problem, I am just a little confused as to why the last element doesn't get inserted.



My guess is that it sees that one.tail and two.tail are empty and terminates the iteration, but shouldn't one.head get inserted still?










share|improve this question



























    0














    I am having some trouble understanding why this code seemingly terminates early:



    object intersectionDemo {
    val arr = Array(2, 4, 7, 8, 12, 20)
    val arr2 = Array(3, 4, 8, 9, 11, 20)
    Iterator.iterate((arr, arr2, List[Int]())) {
    case (one, two, res) =>
    if (one.head == two.head)
    (one.tail, two.tail, one.head :: res)
    else if (one.head > two.head)
    (one, two.tail, res)
    else
    (one.tail, two, res)
    }.takeWhile { case (a, b, _) => a.nonEmpty && b.nonEmpty }
    .toList.last._3.reverse
    }


    It returns List(4, 8) though it should return List(4, 8, 20) and if I inspect the first or second arrays here: _._1 or _._2 I get Array(20). I do know there are other ways to solve the intersection of two arrays problem, I am just a little confused as to why the last element doesn't get inserted.



    My guess is that it sees that one.tail and two.tail are empty and terminates the iteration, but shouldn't one.head get inserted still?










    share|improve this question

























      0












      0








      0







      I am having some trouble understanding why this code seemingly terminates early:



      object intersectionDemo {
      val arr = Array(2, 4, 7, 8, 12, 20)
      val arr2 = Array(3, 4, 8, 9, 11, 20)
      Iterator.iterate((arr, arr2, List[Int]())) {
      case (one, two, res) =>
      if (one.head == two.head)
      (one.tail, two.tail, one.head :: res)
      else if (one.head > two.head)
      (one, two.tail, res)
      else
      (one.tail, two, res)
      }.takeWhile { case (a, b, _) => a.nonEmpty && b.nonEmpty }
      .toList.last._3.reverse
      }


      It returns List(4, 8) though it should return List(4, 8, 20) and if I inspect the first or second arrays here: _._1 or _._2 I get Array(20). I do know there are other ways to solve the intersection of two arrays problem, I am just a little confused as to why the last element doesn't get inserted.



      My guess is that it sees that one.tail and two.tail are empty and terminates the iteration, but shouldn't one.head get inserted still?










      share|improve this question













      I am having some trouble understanding why this code seemingly terminates early:



      object intersectionDemo {
      val arr = Array(2, 4, 7, 8, 12, 20)
      val arr2 = Array(3, 4, 8, 9, 11, 20)
      Iterator.iterate((arr, arr2, List[Int]())) {
      case (one, two, res) =>
      if (one.head == two.head)
      (one.tail, two.tail, one.head :: res)
      else if (one.head > two.head)
      (one, two.tail, res)
      else
      (one.tail, two, res)
      }.takeWhile { case (a, b, _) => a.nonEmpty && b.nonEmpty }
      .toList.last._3.reverse
      }


      It returns List(4, 8) though it should return List(4, 8, 20) and if I inspect the first or second arrays here: _._1 or _._2 I get Array(20). I do know there are other ways to solve the intersection of two arrays problem, I am just a little confused as to why the last element doesn't get inserted.



      My guess is that it sees that one.tail and two.tail are empty and terminates the iteration, but shouldn't one.head get inserted still?







      scala






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked Dec 28 '18 at 5:35









      Ahmad RagabAhmad Ragab

      4731722




      4731722
























          1 Answer
          1






          active

          oldest

          votes


















          3














          Think about it. (I'm using List syntax to demonstrate the Array status, but you get the idea.)



          //   20::Nil     20::Nil       (Nil,      Nil,       20 :: 8 :: 4 :: Nil)
          if (one.head == two.head) (one.tail, two.tail, one.head :: res)


          The 20 gets inserted when one and two are emptied so if you takeWhile neither is empty then it hasn't been inserted yet.



          If you change it to .dropWhile{ ... }.next._3.reverse then you get the results you're looking for.






          share|improve this answer





















            Your Answer






            StackExchange.ifUsing("editor", function () {
            StackExchange.using("externalEditor", function () {
            StackExchange.using("snippets", function () {
            StackExchange.snippets.init();
            });
            });
            }, "code-snippets");

            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "1"
            };
            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: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            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%2fstackoverflow.com%2fquestions%2f53954091%2funderstanding-takewhile-termination-condition-during-iterator-iterate-in-scala%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            3














            Think about it. (I'm using List syntax to demonstrate the Array status, but you get the idea.)



            //   20::Nil     20::Nil       (Nil,      Nil,       20 :: 8 :: 4 :: Nil)
            if (one.head == two.head) (one.tail, two.tail, one.head :: res)


            The 20 gets inserted when one and two are emptied so if you takeWhile neither is empty then it hasn't been inserted yet.



            If you change it to .dropWhile{ ... }.next._3.reverse then you get the results you're looking for.






            share|improve this answer


























              3














              Think about it. (I'm using List syntax to demonstrate the Array status, but you get the idea.)



              //   20::Nil     20::Nil       (Nil,      Nil,       20 :: 8 :: 4 :: Nil)
              if (one.head == two.head) (one.tail, two.tail, one.head :: res)


              The 20 gets inserted when one and two are emptied so if you takeWhile neither is empty then it hasn't been inserted yet.



              If you change it to .dropWhile{ ... }.next._3.reverse then you get the results you're looking for.






              share|improve this answer
























                3












                3








                3






                Think about it. (I'm using List syntax to demonstrate the Array status, but you get the idea.)



                //   20::Nil     20::Nil       (Nil,      Nil,       20 :: 8 :: 4 :: Nil)
                if (one.head == two.head) (one.tail, two.tail, one.head :: res)


                The 20 gets inserted when one and two are emptied so if you takeWhile neither is empty then it hasn't been inserted yet.



                If you change it to .dropWhile{ ... }.next._3.reverse then you get the results you're looking for.






                share|improve this answer












                Think about it. (I'm using List syntax to demonstrate the Array status, but you get the idea.)



                //   20::Nil     20::Nil       (Nil,      Nil,       20 :: 8 :: 4 :: Nil)
                if (one.head == two.head) (one.tail, two.tail, one.head :: res)


                The 20 gets inserted when one and two are emptied so if you takeWhile neither is empty then it hasn't been inserted yet.



                If you change it to .dropWhile{ ... }.next._3.reverse then you get the results you're looking for.







                share|improve this answer












                share|improve this answer



                share|improve this answer










                answered Dec 28 '18 at 6:01









                jwvhjwvh

                25.8k52038




                25.8k52038






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Stack Overflow!


                    • 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.


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





                    Some of your past answers have not been well-received, and you're in danger of being blocked from answering.


                    Please pay close attention to the following guidance:


                    • 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.


                    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%2fstackoverflow.com%2fquestions%2f53954091%2funderstanding-takewhile-termination-condition-during-iterator-iterate-in-scala%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

                    Monofisismo

                    Angular Downloading a file using contenturl with Basic Authentication

                    Olmecas