Fastest way to go from linear index to grid index












3














I'm sure this has been asked before but I'm interested in going from a position in a vector to the index in the grid version of the vector with given strides, for example, say I have the vector:



vec = {58, 94, 19, 68, 54, 77, 1, 18, 49, 20, 90, 44, 91, 89, 15, 0, 

   60, 18, 19, 44, 87, 5, 8, 42, 51, 55, 87, 71, 83, 68, 53, 58, 27, 

   17, 8, 14, 33, 58, 86, 3, 91, 66, 3, 16, 98, 84, 72, 98, 9, 30, 90,

    99, 15, 0, 82, 76, 86, 58, 77, 58};


And say I have strides {5, 4, 3}, the position 35 in the vector would correspond to the index {3, 4, 2}:



vec[[35]]



4



ArrayReshape[vec, {5, 4, 3}][[3, 4, 2]]



4


How can I get this index fast and in a vectorized fashion because I will have potentially many positions to extract?






list-manipulation performance-tuning







share|improve this question



























    3














    I'm sure this has been asked before but I'm interested in going from a position in a vector to the index in the grid version of the vector with given strides, for example, say I have the vector:



    vec = {58, 94, 19, 68, 54, 77, 1, 18, 49, 20, 90, 44, 91, 89, 15, 0, 
    
   60, 18, 19, 44, 87, 5, 8, 42, 51, 55, 87, 71, 83, 68, 53, 58, 27, 
    
   17, 8, 14, 33, 58, 86, 3, 91, 66, 3, 16, 98, 84, 72, 98, 9, 30, 90,
    
    99, 15, 0, 82, 76, 86, 58, 77, 58};


    And say I have strides {5, 4, 3}, the position 35 in the vector would correspond to the index {3, 4, 2}:



    vec[[35]]
    

    
4
    

    
ArrayReshape[vec, {5, 4, 3}][[3, 4, 2]]
    

    
4


    How can I get this index fast and in a vectorized fashion because I will have potentially many positions to extract?






    list-manipulation performance-tuning







    share|improve this question

























      3












      3








      3







      I'm sure this has been asked before but I'm interested in going from a position in a vector to the index in the grid version of the vector with given strides, for example, say I have the vector:



      vec = {58, 94, 19, 68, 54, 77, 1, 18, 49, 20, 90, 44, 91, 89, 15, 0, 
      
   60, 18, 19, 44, 87, 5, 8, 42, 51, 55, 87, 71, 83, 68, 53, 58, 27, 
      
   17, 8, 14, 33, 58, 86, 3, 91, 66, 3, 16, 98, 84, 72, 98, 9, 30, 90,
      
    99, 15, 0, 82, 76, 86, 58, 77, 58};


      And say I have strides {5, 4, 3}, the position 35 in the vector would correspond to the index {3, 4, 2}:



      vec[[35]]
      

      
4
      

      
ArrayReshape[vec, {5, 4, 3}][[3, 4, 2]]
      

      
4


      How can I get this index fast and in a vectorized fashion because I will have potentially many positions to extract?






      list-manipulation performance-tuning







      share|improve this question













      I'm sure this has been asked before but I'm interested in going from a position in a vector to the index in the grid version of the vector with given strides, for example, say I have the vector:



      vec = {58, 94, 19, 68, 54, 77, 1, 18, 49, 20, 90, 44, 91, 89, 15, 0, 
      
   60, 18, 19, 44, 87, 5, 8, 42, 51, 55, 87, 71, 83, 68, 53, 58, 27, 
      
   17, 8, 14, 33, 58, 86, 3, 91, 66, 3, 16, 98, 84, 72, 98, 9, 30, 90,
      
    99, 15, 0, 82, 76, 86, 58, 77, 58};


      And say I have strides {5, 4, 3}, the position 35 in the vector would correspond to the index {3, 4, 2}:



      vec[[35]]
      

      
4
      

      
ArrayReshape[vec, {5, 4, 3}][[3, 4, 2]]
      

      
4


      How can I get this index fast and in a vectorized fashion because I will have potentially many positions to extract?






      list-manipulation performance-tuning




      list-manipulation performance-tuning






      share|improve this question













      share|improve this question











      share|improve this question




      share|improve this question










      asked 1 hour ago









      b3m2a1

      26.7k257154




      26.7k257154






















          2 Answers
          2






          active

          oldest

          votes


















          2














          I think this is what you want:



          IntegerDigits[35 - 1, MixedRadix[{5, 4, 3}], 3] + 1


          In general:



          gridIndex[n_Integer, shape_List] := 
          
 IntegerDigits[n - 1, MixedRadix[shape], Length@shape] + 1





          share|improve this answer



















          • 1




            @C.E. You're right, it just needs dimension length specification
            – swish
            35 mins ago






          • 1




            This is a very nice solution, +1
            – C. E.
            33 mins ago



















          1














          Here's what I came up with:



          getSubindex[index_, stride_] := {
          
  Mod[index, stride, 1],
          
  Ceiling[index/stride]
          
  }
          
getIndex[index_, strides_] := 
          
 Reverse@FoldPairList[getSubindex, index, Reverse@strides]


          This is comparable to swish's solution speed-wise:



          gridIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



          {0.000061, {3, 2, 3, 4}}




          getIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



          {0.000052, {3, 2, 3, 4}}







          share|improve this answer























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


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f188806%2ffastest-way-to-go-from-linear-index-to-grid-index%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














            I think this is what you want:



            IntegerDigits[35 - 1, MixedRadix[{5, 4, 3}], 3] + 1


            In general:



            gridIndex[n_Integer, shape_List] := 
            
 IntegerDigits[n - 1, MixedRadix[shape], Length@shape] + 1





            share|improve this answer



















            • 1




              @C.E. You're right, it just needs dimension length specification
              – swish
              35 mins ago






            • 1




              This is a very nice solution, +1
              – C. E.
              33 mins ago
















            2














            I think this is what you want:



            IntegerDigits[35 - 1, MixedRadix[{5, 4, 3}], 3] + 1


            In general:



            gridIndex[n_Integer, shape_List] := 
            
 IntegerDigits[n - 1, MixedRadix[shape], Length@shape] + 1





            share|improve this answer



















            • 1




              @C.E. You're right, it just needs dimension length specification
              – swish
              35 mins ago






            • 1




              This is a very nice solution, +1
              – C. E.
              33 mins ago














            2












            2








            2






            I think this is what you want:



            IntegerDigits[35 - 1, MixedRadix[{5, 4, 3}], 3] + 1


            In general:



            gridIndex[n_Integer, shape_List] := 
            
 IntegerDigits[n - 1, MixedRadix[shape], Length@shape] + 1





            share|improve this answer














            I think this is what you want:



            IntegerDigits[35 - 1, MixedRadix[{5, 4, 3}], 3] + 1


            In general:



            gridIndex[n_Integer, shape_List] := 
            
 IntegerDigits[n - 1, MixedRadix[shape], Length@shape] + 1






            share|improve this answer














            share|improve this answer



            share|improve this answer








            edited 32 mins ago

























            answered 43 mins ago









            swish

            3,9611534




            3,9611534








            • 1




              @C.E. You're right, it just needs dimension length specification
              – swish
              35 mins ago






            • 1




              This is a very nice solution, +1
              – C. E.
              33 mins ago














            • 1




              @C.E. You're right, it just needs dimension length specification
              – swish
              35 mins ago






            • 1




              This is a very nice solution, +1
              – C. E.
              33 mins ago








            1




            1




            @C.E. You're right, it just needs dimension length specification
            – swish
            35 mins ago




            @C.E. You're right, it just needs dimension length specification
            – swish
            35 mins ago




            1




            1




            This is a very nice solution, +1
            – C. E.
            33 mins ago




            This is a very nice solution, +1
            – C. E.
            33 mins ago











            1














            Here's what I came up with:



            getSubindex[index_, stride_] := {
            
  Mod[index, stride, 1],
            
  Ceiling[index/stride]
            
  }
            
getIndex[index_, strides_] := 
            
 Reverse@FoldPairList[getSubindex, index, Reverse@strides]


            This is comparable to swish's solution speed-wise:



            gridIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



            {0.000061, {3, 2, 3, 4}}




            getIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



            {0.000052, {3, 2, 3, 4}}







            share|improve this answer




























              1














              Here's what I came up with:



              getSubindex[index_, stride_] := {
              
  Mod[index, stride, 1],
              
  Ceiling[index/stride]
              
  }
              
getIndex[index_, strides_] := 
              
 Reverse@FoldPairList[getSubindex, index, Reverse@strides]


              This is comparable to swish's solution speed-wise:



              gridIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



              {0.000061, {3, 2, 3, 4}}




              getIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



              {0.000052, {3, 2, 3, 4}}







              share|improve this answer


























                1












                1








                1






                Here's what I came up with:



                getSubindex[index_, stride_] := {
                
  Mod[index, stride, 1],
                
  Ceiling[index/stride]
                
  }
                
getIndex[index_, strides_] := 
                
 Reverse@FoldPairList[getSubindex, index, Reverse@strides]


                This is comparable to swish's solution speed-wise:



                gridIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



                {0.000061, {3, 2, 3, 4}}




                getIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



                {0.000052, {3, 2, 3, 4}}







                share|improve this answer














                Here's what I came up with:



                getSubindex[index_, stride_] := {
                
  Mod[index, stride, 1],
                
  Ceiling[index/stride]
                
  }
                
getIndex[index_, strides_] := 
                
 Reverse@FoldPairList[getSubindex, index, Reverse@strides]


                This is comparable to swish's solution speed-wise:



                gridIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



                {0.000061, {3, 2, 3, 4}}




                getIndex[1000, {3, 5, 4, 6}] // RepeatedTiming



                {0.000052, {3, 2, 3, 4}}








                share|improve this answer














                share|improve this answer



                share|improve this answer








                edited 14 mins ago

























                answered 35 mins ago









                C. E.

                49.9k397202




                49.9k397202






























                    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.





                    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%2fmathematica.stackexchange.com%2fquestions%2f188806%2ffastest-way-to-go-from-linear-index-to-grid-index%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

                    Morgemoulin

                    Image
                    Morgemoulin — miejscowość i gmina — Państwo   Francja Region Grand Est Departament Moza Okręg Verdun Kod INSEE 55357 Powierzchnia 6,82 km² Populacja  (1990) • liczba ludności 75 • gęstość 11 os./km² Kod pocztowy 55400 Położenie na mapie Francji Morgemoulin 49°14′N   5°35′E / 49,233333   5,583333 Portal Francja Morgemoulin – miejscowość i gmina we Francji, w regionie Grand Est, w departamencie Moza. Według danych na rok 1990 gminę zamieszkiwało 75 osób, a gęstość zaludnienia wynosiła 11 osób/km² (wśród 2335 gmin Lotaryngii Morgemoulin plasuje się na 970. miejscu pod względem liczby ludności, natomiast pod względem powierzchni na miejscu 848.). Bibliografia | Francuski urząd statystyczny ( fr. ) . p   •   d   •   e Gminy okręgu Verdun Abaucourt-Hautecourt • Aincreville • Ambly-sur-Meuse • Amel-sur-l'Étang • Ancemont • Arrancy-sur-Crusne • Aubréville • Autré
                    Read more

                    Scott Moir

                    Image
                    Scott Moir Tessa Virtue i Scott Moir w 2016 r. Reprezentacja   Kanada Data i miejsce urodzenia 2 września 1987 London Wzrost 180 cm Konkurencja Pary taneczne Partner sportowy Tessa Virtue Trener Marie-France Dubreuil, Patrice Lauzon, Romain Haguenauer Poprzednio: Marina Zujewa, Oleg Epstein, Igor Szpilband, Johnny Johns, Carol Moir, Paul MacIntosh, Suzanne Killing Klub Montreal International School of Skating Poprzednio: Arctic Edge FSC Ilderton Skating Club Lokalizacja treningowa Montreal Poprzednio: Canton Kitchener Rekordy życiowe ISU przed sezonem 2018/2019 Nota łączna 206,07 Igrzyska Olimpijskie 2018 Taniec krótki 83,67 Igrzyska Olimpijskie 2018 Taniec dowolny 122,40 Igrzyska Olimpijskie 2018 Dorobek medalowy Reprezentacja   Kanada Igrzyska olimpijskie Złoto Vancouver 2010 pary taneczne Złoto Pjongczang 2018 pary taneczne Złoto Pjongczang 2018 drużynowo Srebro S
                    Read more

                    Souastre

                    Image
                    Souastre — miejscowość i gmina — Herb Państwo   Francja Region Hauts-de-France Departament Pas-de-Calais Okręg Arras Kod INSEE 62800 Powierzchnia 7,18 km² Populacja  (1990) • liczba ludności 352 • gęstość 49 os./km² Kod pocztowy 62111 Położenie na mapie Francji Souastre 50°09′N   2°34′E / 50,150000   2,566667 Portal Francja Souastre – miejscowość i gmina we Francji, w regionie Hauts-de-France, w departamencie Pas-de-Calais. Według danych na rok 1990 gminę zamieszkiwały 352 osoby, a gęstość zaludnienia wynosiła 49 osób/km² (wśród 1549 gmin regionu Nord-Pas-de-Calais Souastre plasuje się na 887. miejscu pod względem liczby ludności, natomiast pod względem powierzchni na miejscu 507.). Bibliografia | Francuski urząd statystyczny ( fr. ) . p   •   d   •   e Gminy okręgu Arras Ablain-Saint-Nazaire Ablainzevelle Acheville Achicourt Achiet-le-Grand Achiet-le-Pe
                    Read more