BitNot does not flip bits in the way I expected












3












$begingroup$


Can anyone explain why the last result in these statements is not the bit-flipped version of arr?



(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) In[190]:= FromDigits[%, 2]



(Debug) Out[190]= 34



(Debug) In[191]:= BitNot[%]



(Debug) Out[191]= -35



(Debug) In[192]:= IntegerDigits[%, 2, 8]



(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}





binary







share|improve this question









New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 4




    $begingroup$
    "IntegerDigits[n] discards the sign of n."
    $endgroup$
    – kglr
    3 hours ago












  • $begingroup$
    Is there a work around?
    $endgroup$
    – bc888
    3 hours ago










  • $begingroup$
    not any I know of.
    $endgroup$
    – kglr
    3 hours ago










  • $begingroup$
    BitNot should yield 221
    $endgroup$
    – bc888
    3 hours ago






  • 6




    $begingroup$
    Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
    $endgroup$
    – Chip Hurst
    2 hours ago
















3












$begingroup$


Can anyone explain why the last result in these statements is not the bit-flipped version of arr?



(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) In[190]:= FromDigits[%, 2]



(Debug) Out[190]= 34



(Debug) In[191]:= BitNot[%]



(Debug) Out[191]= -35



(Debug) In[192]:= IntegerDigits[%, 2, 8]



(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}





binary







share|improve this question









New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$








  • 4




    $begingroup$
    "IntegerDigits[n] discards the sign of n."
    $endgroup$
    – kglr
    3 hours ago












  • $begingroup$
    Is there a work around?
    $endgroup$
    – bc888
    3 hours ago










  • $begingroup$
    not any I know of.
    $endgroup$
    – kglr
    3 hours ago










  • $begingroup$
    BitNot should yield 221
    $endgroup$
    – bc888
    3 hours ago






  • 6




    $begingroup$
    Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
    $endgroup$
    – Chip Hurst
    2 hours ago














3












3








3


1



$begingroup$


Can anyone explain why the last result in these statements is not the bit-flipped version of arr?



(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) In[190]:= FromDigits[%, 2]



(Debug) Out[190]= 34



(Debug) In[191]:= BitNot[%]



(Debug) Out[191]= -35



(Debug) In[192]:= IntegerDigits[%, 2, 8]



(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}





binary







share|improve this question









New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.







$endgroup$




Can anyone explain why the last result in these statements is not the bit-flipped version of arr?



(Debug) In[189]:= arr = {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) Out[189]= {0, 0, 1, 0, 0, 0, 1, 0}



(Debug) In[190]:= FromDigits[%, 2]



(Debug) Out[190]= 34



(Debug) In[191]:= BitNot[%]



(Debug) Out[191]= -35



(Debug) In[192]:= IntegerDigits[%, 2, 8]



(Debug) Out[192]= {0, 0, 1, 0, 0, 0, 1, 1}





binary




binary






share|improve this question









New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.











share|improve this question









New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this question




share|improve this question








edited 2 hours ago









m_goldberg

87.4k872198




87.4k872198






New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









asked 3 hours ago









bc888bc888

363




363




New contributor




bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 4




    $begingroup$
    "IntegerDigits[n] discards the sign of n."
    $endgroup$
    – kglr
    3 hours ago












  • $begingroup$
    Is there a work around?
    $endgroup$
    – bc888
    3 hours ago










  • $begingroup$
    not any I know of.
    $endgroup$
    – kglr
    3 hours ago










  • $begingroup$
    BitNot should yield 221
    $endgroup$
    – bc888
    3 hours ago






  • 6




    $begingroup$
    Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
    $endgroup$
    – Chip Hurst
    2 hours ago














  • 4




    $begingroup$
    "IntegerDigits[n] discards the sign of n."
    $endgroup$
    – kglr
    3 hours ago












  • $begingroup$
    Is there a work around?
    $endgroup$
    – bc888
    3 hours ago










  • $begingroup$
    not any I know of.
    $endgroup$
    – kglr
    3 hours ago










  • $begingroup$
    BitNot should yield 221
    $endgroup$
    – bc888
    3 hours ago






  • 6




    $begingroup$
    Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
    $endgroup$
    – Chip Hurst
    2 hours ago








4




4




$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
3 hours ago






$begingroup$
"IntegerDigits[n] discards the sign of n."
$endgroup$
– kglr
3 hours ago














$begingroup$
Is there a work around?
$endgroup$
– bc888
3 hours ago




$begingroup$
Is there a work around?
$endgroup$
– bc888
3 hours ago












$begingroup$
not any I know of.
$endgroup$
– kglr
3 hours ago




$begingroup$
not any I know of.
$endgroup$
– kglr
3 hours ago












$begingroup$
BitNot should yield 221
$endgroup$
– bc888
3 hours ago




$begingroup$
BitNot should yield 221
$endgroup$
– bc888
3 hours ago




6




6




$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
$endgroup$
– Chip Hurst
2 hours ago




$begingroup$
Integers can have arbitrary length, so how many leading zeros should be flipped? The documentation clarifies: "Integers are assumed to be represented in two's complement form, with an unlimited number of digits, so that BitNot[n] is simply equivalent to -1-n."
$endgroup$
– Chip Hurst
2 hours ago










4 Answers
4






active

oldest

votes


















2












$begingroup$

I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.



twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]

twosComplement[35, 8]

(* {1, 1, 0, 1, 1, 1, 0, 1} *)





share|improve this answer









$endgroup$





















    4












    $begingroup$

    twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
    
twosComplement[35, 8]



    {1, 1, 0, 1, 1, 1, 0, 1}







    share|improve this answer









    $endgroup$





















      1












      $begingroup$

      FlipBits[num_Integer, len_.] := 
      
 Module[{arr}, arr = IntegerDigits[num, 2, len];
      
  1 - arr]





      share|improve this answer








      New contributor




      bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
      Check out our Code of Conduct.






      $endgroup$





















        1












        $begingroup$

        Without using IntegerDigits:



        With[{n = 34}, 
        
     {n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
        
   {100010₂, 11101₂}
        

        
With[{n = 34, p = 8},
        
     {n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
        
   {100010₂, 11011101₂}





        share|improve this answer









        $endgroup$













          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          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
          });


          }
          });






          bc888 is a new contributor. Be nice, and check out our Code of Conduct.










          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f193136%2fbitnot-does-not-flip-bits-in-the-way-i-expected%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          4 Answers
          4






          active

          oldest

          votes








          4 Answers
          4






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          2












          $begingroup$

          I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.



          twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
          
twosComplement[35, 8]
          
(* {1, 1, 0, 1, 1, 1, 0, 1} *)





          share|improve this answer









          $endgroup$


















            2












            $begingroup$

            I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.



            twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
            
twosComplement[35, 8]
            
(* {1, 1, 0, 1, 1, 1, 0, 1} *)





            share|improve this answer









            $endgroup$
















              2












              2








              2





              $begingroup$

              I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.



              twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
              
twosComplement[35, 8]
              
(* {1, 1, 0, 1, 1, 1, 0, 1} *)





              share|improve this answer









              $endgroup$



              I don't think there is a built-in function to generate the two's complement representation. Easy to implement though.



              twosComplement[x_, n_] := IntegerDigits[2^x - n, 2, n]
              
twosComplement[35, 8]
              
(* {1, 1, 0, 1, 1, 1, 0, 1} *)






              share|improve this answer












              share|improve this answer



              share|improve this answer










              answered 2 hours ago









              Rohit NamjoshiRohit Namjoshi

              1,2961213




              1,2961213























                  4












                  $begingroup$

                  twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
                  
twosComplement[35, 8]



                  {1, 1, 0, 1, 1, 1, 0, 1}







                  share|improve this answer









                  $endgroup$


















                    4












                    $begingroup$

                    twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
                    
twosComplement[35, 8]



                    {1, 1, 0, 1, 1, 1, 0, 1}







                    share|improve this answer









                    $endgroup$
















                      4












                      4








                      4





                      $begingroup$

                      twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
                      
twosComplement[35, 8]



                      {1, 1, 0, 1, 1, 1, 0, 1}







                      share|improve this answer









                      $endgroup$



                      twosComplement[x_, n_] := UnitBox@IntegerDigits[x, 2, n]
                      
twosComplement[35, 8]



                      {1, 1, 0, 1, 1, 1, 0, 1}








                      share|improve this answer












                      share|improve this answer



                      share|improve this answer










                      answered 2 hours ago









                      Okkes DulgerciOkkes Dulgerci

                      5,3441918




                      5,3441918























                          1












                          $begingroup$

                          FlipBits[num_Integer, len_.] := 
                          
 Module[{arr}, arr = IntegerDigits[num, 2, len];
                          
  1 - arr]





                          share|improve this answer








                          New contributor




                          bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                          Check out our Code of Conduct.






                          $endgroup$


















                            1












                            $begingroup$

                            FlipBits[num_Integer, len_.] := 
                            
 Module[{arr}, arr = IntegerDigits[num, 2, len];
                            
  1 - arr]





                            share|improve this answer








                            New contributor




                            bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                            Check out our Code of Conduct.






                            $endgroup$
















                              1












                              1








                              1





                              $begingroup$

                              FlipBits[num_Integer, len_.] := 
                              
 Module[{arr}, arr = IntegerDigits[num, 2, len];
                              
  1 - arr]





                              share|improve this answer








                              New contributor




                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.






                              $endgroup$



                              FlipBits[num_Integer, len_.] := 
                              
 Module[{arr}, arr = IntegerDigits[num, 2, len];
                              
  1 - arr]






                              share|improve this answer








                              New contributor




                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.









                              share|improve this answer



                              share|improve this answer






                              New contributor




                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.









                              answered 2 hours ago









                              bc888bc888

                              363




                              363




                              New contributor




                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.





                              New contributor





                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.






                              bc888 is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
                              Check out our Code of Conduct.























                                  1












                                  $begingroup$

                                  Without using IntegerDigits:



                                  With[{n = 34}, 
                                  
     {n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
                                  
   {100010₂, 11101₂}
                                  

                                  
With[{n = 34, p = 8},
                                  
     {n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
                                  
   {100010₂, 11011101₂}





                                  share|improve this answer









                                  $endgroup$


















                                    1












                                    $begingroup$

                                    Without using IntegerDigits:



                                    With[{n = 34}, 
                                    
     {n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
                                    
   {100010₂, 11101₂}
                                    

                                    
With[{n = 34, p = 8},
                                    
     {n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
                                    
   {100010₂, 11011101₂}





                                    share|improve this answer









                                    $endgroup$
















                                      1












                                      1








                                      1





                                      $begingroup$

                                      Without using IntegerDigits:



                                      With[{n = 34}, 
                                      
     {n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
                                      
   {100010₂, 11101₂}
                                      

                                      
With[{n = 34, p = 8},
                                      
     {n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
                                      
   {100010₂, 11011101₂}





                                      share|improve this answer









                                      $endgroup$



                                      Without using IntegerDigits:



                                      With[{n = 34}, 
                                      
     {n, BitXor[BitShiftLeft[1, BitLength[n]] - 1, n]} // BaseForm[#, 2] &]
                                      
   {100010₂, 11101₂}
                                      

                                      
With[{n = 34, p = 8},
                                      
     {n, BitXor[BitShiftLeft[1, p] - 1, n]} // BaseForm[#, 2] &]
                                      
   {100010₂, 11011101₂}






                                      share|improve this answer












                                      share|improve this answer



                                      share|improve this answer










                                      answered 2 hours ago









                                      J. M. is slightly pensive♦J. M. is slightly pensive

                                      97.8k10304464




                                      97.8k10304464






















                                          bc888 is a new contributor. Be nice, and check out our Code of Conduct.










                                          draft saved

                                          draft discarded


















                                          bc888 is a new contributor. Be nice, and check out our Code of Conduct.













                                          bc888 is a new contributor. Be nice, and check out our Code of Conduct.












                                          bc888 is a new contributor. Be nice, and check out our Code of Conduct.
















                                          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%2f193136%2fbitnot-does-not-flip-bits-in-the-way-i-expected%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

                                          Усть-Каменогорск

                                          Image
                                          У этого термина существуют и другие значения, см. Усть-Каменогорск. Город Усть-Каменогорск каз. Өскемен Флаг Герб 49°57′ с. ш. 82°37′ в. д. H G Я O L Страна Казахстан   Казахстан Статус областной центр Область Восточно-Казахстанская Аким Жаксылык Омар [1] История и география Основан 1720 Город с 1868 Площадь 303,15 [2] км² Высота центра 283 ± 1 м Тип климата резко-континентальный Часовой пояс UTC+6 Население Население 329 090 [3]  человек ( 2018 ) Национальности русские 53,56 % казахи 42,99 % немцы 0,82 % украинцы 0,57 % татары 0,79 % белорусы 0,14 % азербайджанцы 0,23 % корейцы 0,20 % прочие 1,08 % -1 шт [4] Этнохороним усть-каменогорцы, усть-каменогорец Цифровые идентификаторы Телефонный код +7 (7232) Почтовый индекс F0***** [5] Автомобильный код 16 (ранее F) oskemen.kz Усть-Каменогорск Усть-Каменогорск ...
                                          Read more

                                          Халкинская богословская школа

                                          Image
                                          Халкинская богословская школа тур. Rum Ortodoks Ruhban Okulu греч. Ιερά Θεολογική Σχολή της Χάλκης Главное здание Халкинской школы Международное название Theological School of Halki Год основания 1844 Конфессия православие Церковь Константинопольская Ректор Елпидифор (Ламбриниадис) Расположение о. Хейбелиада, Турция Юридический адрес Ümit tepesi No 5, 34973 Heybeliada, Istanbul, Turkey Сайт www.greece.org  [[commons:Category:Halki seminary|Халкинская богословская школа тур. Rum Ortodoks Ruhban Okulu греч. Ιερά Θεολογική Σχολή της Χάλκης на Викискладе]] Ха́лкинская богосло́вская шко́ла (или Духовная семинария на Халки , тур. Rum Ortodoks Ruhban Okulu , греч. Ιερά Θεολογική Σχολή της Χάλκης ) — недействующее среднее специальное учебное заведение Константинопольской православной церкви, расположенное на территории Свято-Троицкого мужского монастыря на вершине холма Надежды (тур. Ümit Tepesi ) острова Хейбелиада, в Турции....
                                          Read more

                                          Высокополье (Харьковская область)

                                          Image
                                          У этого термина существуют и другие значения, см. Высокополье. Село Высокополье укр. Високопілля Герб 49°55′07″ с. ш. 35°25′13″ в. д. H G Я O L Страна Украина   Украина Область Харьковская Район Валковский Сельский совет Высокопольский История и география Основан 1670 Прежние названия Хмелевое Площадь 55,56 км² Часовой пояс UTC+2, летом UTC+3 Население Население 1957 человек ( 2001 ) Плотность 35,220 чел./км² Цифровые идентификаторы Телефонный код +380 5753 Почтовый индекс 63020 Автомобильный код AX, КХ / 21 КОАТУУ 6321281501 Высокополье Высокополье Высокополье  Аудио, фото и видео на Викискладе Высокопо́лье (укр. Високопілля ) — село, Высокопольский сельский совет, Валковский район, Харьковская область, Украина. Код КОАТУУ — 6321281501. Население по переписи 2001 г. составляет 1957 (866/1091 м/ж) человек. Является административным центр...
                                          Read more