How do I transpose the first and deepest levels of an arbitrarily nested array?












10












$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification, it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    Mar 29 at 19:41










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    Mar 29 at 19:43












  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    Mar 29 at 19:52


















10












$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification, it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    Mar 29 at 19:41










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    Mar 29 at 19:43












  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    Mar 29 at 19:52
















10












10








10


1



$begingroup$


Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification, it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation







share|improve this question











$endgroup$




Is there a straightforward way to convert



arr = {

  {a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}

};


to:



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}


?



I need to swap the first and last dimension. Which should in principle be possible, because, although arr does not have a fixed structure, the 'bottom' is always uniform:



Level[arr, {-2}]





{{a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}, {a, b}}



Had Transpose/Flatten/MapThread accepted a negative level specification, it would have been easy. That is not the case.



One can think about that question as: How do I create arr2 so that arr[[whatever__, y_]] == arr2[[y, whatever__]]?



EDIT:



In general Level[arr, {-2}] should be a rectangular array, but rows do not need to be the same.



So this:



{{a1, b1}, {{{a2, b2}, {a3, b3}}, {{a4, b4}, {a5, b5}, {a6, b6}}}, {{{{a7,b7}}}} };


should end up:



{ {a1, {{a2, a3}, {a4, a5, a6}}, {{{a7}}} }, ...};





list-manipulation




list-manipulation






share|improve this question















share|improve this question













share|improve this question




share|improve this question








edited Mar 30 at 5:04









J. M. is away♦

98.9k10311467




98.9k10311467










asked Mar 29 at 19:09









Kuba♦Kuba

107k12211534




107k12211534












  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    Mar 29 at 19:41










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    Mar 29 at 19:43












  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    Mar 29 at 19:52




















  • $begingroup$
    Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
    $endgroup$
    – Roman
    Mar 29 at 19:41










  • $begingroup$
    Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
    $endgroup$
    – Carl Woll
    Mar 29 at 19:43












  • $begingroup$
    @Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
    $endgroup$
    – Roman
    Mar 29 at 19:52


















$begingroup$
Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
$endgroup$
– Roman
Mar 29 at 19:41




$begingroup$
Not a solution, but Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]] gives you a list of rules of what needs to be constructed. I don't know of a way to construct it though: SparseArray does not construct ragged structures.
$endgroup$
– Roman
Mar 29 at 19:41












$begingroup$
Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
$endgroup$
– Carl Woll
Mar 29 at 19:43






$begingroup$
Maybe something along the lines of arr /. {{{a,b}->a},{{a,b}->b}}? Or perhaps more generally, arr /. {{a_?VectorQ :> First@a}, {a_?VectorQ :> Last@a}}?
$endgroup$
– Carl Woll
Mar 29 at 19:43














$begingroup$
@Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
$endgroup$
– Roman
Mar 29 at 19:52






$begingroup$
@Kuba maybe you can come up with a recursion that constructs the result from the list of rules I gave 4 lines up? That would be a handy tool to have in any case.
$endgroup$
– Roman
Mar 29 at 19:52












4 Answers
4






active

oldest

votes


















11












$begingroup$

arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};



SetAttributes[f1, Listable]

Apply[f1, arr, {0, -3}] /. f1 -> List



{{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







share|improve this answer









$endgroup$





















    3












    $begingroup$

    This is what the list at the lowest level looks like:



    el = First@Level[list, {-2}];


    Using this, we can solve it with a rules-based approach:



    list /. el -> # & /@ el


    or a recursive approach like this:



    walk[lists : {__List}, i_] := walk[#, i] & /@ lists
    
walk[atoms : {__}, i_] := i
    
walk[list, #] & /@ el





    share|improve this answer









    $endgroup$





















      2












      $begingroup$

      Terrible solution using Table but works:



      Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





      share|improve this answer









      $endgroup$





















        1












        $begingroup$

        This is a bit roundabout but very versatile. First convert the structure arr into a list of rules, then reassemble these rules (after proper modification using RotateRight to transpose first and deepest levels) into a new structure.



        Using the toTree function from this answer (thanks to @b3m2a1 !):



        arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
        
toTree[Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]]]



        {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







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


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathematica.stackexchange.com%2fquestions%2f194206%2fhow-do-i-transpose-the-first-and-deepest-levels-of-an-arbitrarily-nested-array%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









          11












          $begingroup$

          arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
          

          
SetAttributes[f1, Listable]
          
Apply[f1, arr, {0, -3}] /. f1 -> List



          {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







          share|improve this answer









          $endgroup$


















            11












            $begingroup$

            arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
            

            
SetAttributes[f1, Listable]
            
Apply[f1, arr, {0, -3}] /. f1 -> List



            {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







            share|improve this answer









            $endgroup$
















              11












              11








              11





              $begingroup$

              arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
              

              
SetAttributes[f1, Listable]
              
Apply[f1, arr, {0, -3}] /. f1 -> List



              {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







              share|improve this answer









              $endgroup$



              arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
              

              
SetAttributes[f1, Listable]
              
Apply[f1, arr, {0, -3}] /. f1 -> List



              {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}








              share|improve this answer












              share|improve this answer



              share|improve this answer










              answered Mar 29 at 19:53









              andre314andre314

              12.4k12353




              12.4k12353























                  3












                  $begingroup$

                  This is what the list at the lowest level looks like:



                  el = First@Level[list, {-2}];


                  Using this, we can solve it with a rules-based approach:



                  list /. el -> # & /@ el


                  or a recursive approach like this:



                  walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                  
walk[atoms : {__}, i_] := i
                  
walk[list, #] & /@ el





                  share|improve this answer









                  $endgroup$


















                    3












                    $begingroup$

                    This is what the list at the lowest level looks like:



                    el = First@Level[list, {-2}];


                    Using this, we can solve it with a rules-based approach:



                    list /. el -> # & /@ el


                    or a recursive approach like this:



                    walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                    
walk[atoms : {__}, i_] := i
                    
walk[list, #] & /@ el





                    share|improve this answer









                    $endgroup$
















                      3












                      3








                      3





                      $begingroup$

                      This is what the list at the lowest level looks like:



                      el = First@Level[list, {-2}];


                      Using this, we can solve it with a rules-based approach:



                      list /. el -> # & /@ el


                      or a recursive approach like this:



                      walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                      
walk[atoms : {__}, i_] := i
                      
walk[list, #] & /@ el





                      share|improve this answer









                      $endgroup$



                      This is what the list at the lowest level looks like:



                      el = First@Level[list, {-2}];


                      Using this, we can solve it with a rules-based approach:



                      list /. el -> # & /@ el


                      or a recursive approach like this:



                      walk[lists : {__List}, i_] := walk[#, i] & /@ lists
                      
walk[atoms : {__}, i_] := i
                      
walk[list, #] & /@ el






                      share|improve this answer












                      share|improve this answer



                      share|improve this answer










                      answered Mar 29 at 19:42









                      C. E.C. E.

                      51k3101206




                      51k3101206























                          2












                          $begingroup$

                          Terrible solution using Table but works:



                          Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                          share|improve this answer









                          $endgroup$


















                            2












                            $begingroup$

                            Terrible solution using Table but works:



                            Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                            share|improve this answer









                            $endgroup$
















                              2












                              2








                              2





                              $begingroup$

                              Terrible solution using Table but works:



                              Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]





                              share|improve this answer









                              $endgroup$



                              Terrible solution using Table but works:



                              Table[Map[#[[i]] &, arr, {-2}], {i, Last[Dimensions[Level[arr, {-2}]]]}]






                              share|improve this answer












                              share|improve this answer



                              share|improve this answer










                              answered Mar 29 at 20:16









                              RomanRoman

                              4,65511128




                              4,65511128























                                  1












                                  $begingroup$

                                  This is a bit roundabout but very versatile. First convert the structure arr into a list of rules, then reassemble these rules (after proper modification using RotateRight to transpose first and deepest levels) into a new structure.



                                  Using the toTree function from this answer (thanks to @b3m2a1 !):



                                  arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
                                  
toTree[Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]]]



                                  {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







                                  share|improve this answer









                                  $endgroup$


















                                    1












                                    $begingroup$

                                    This is a bit roundabout but very versatile. First convert the structure arr into a list of rules, then reassemble these rules (after proper modification using RotateRight to transpose first and deepest levels) into a new structure.



                                    Using the toTree function from this answer (thanks to @b3m2a1 !):



                                    arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
                                    
toTree[Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]]]



                                    {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







                                    share|improve this answer









                                    $endgroup$
















                                      1












                                      1








                                      1





                                      $begingroup$

                                      This is a bit roundabout but very versatile. First convert the structure arr into a list of rules, then reassemble these rules (after proper modification using RotateRight to transpose first and deepest levels) into a new structure.



                                      Using the toTree function from this answer (thanks to @b3m2a1 !):



                                      arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
                                      
toTree[Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]]]



                                      {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}







                                      share|improve this answer









                                      $endgroup$



                                      This is a bit roundabout but very versatile. First convert the structure arr into a list of rules, then reassemble these rules (after proper modification using RotateRight to transpose first and deepest levels) into a new structure.



                                      Using the toTree function from this answer (thanks to @b3m2a1 !):



                                      arr = {{a, b}, {a, b}, {{{a, b}, {a, b}, {a, b}}, {{a, b}, {a, b}, {a, b}}}};
                                      
toTree[Flatten[MapIndexed[RotateRight[#2] -> #1 &, arr, {-1}]]]



                                      {{a, a, {{a, a, a}, {a, a, a}}}, {b, b, {{b, b, b}, {b, b, b}}}}








                                      share|improve this answer












                                      share|improve this answer



                                      share|improve this answer










                                      answered Mar 30 at 21:29









                                      RomanRoman

                                      4,65511128




                                      4,65511128






























                                          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%2f194206%2fhow-do-i-transpose-the-first-and-deepest-levels-of-an-arbitrarily-nested-array%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

                                          mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924

                                          Image
                                          0 I just uploaded a new plugin to my wordpress site and I got this warning: mysqli_query(): Empty query in /home/lucindabrummitt/public_html/blog/wp-includes/wp-db.php on line 1924 Usually if I have a problem, I can find answers on google but this one seems pretty particular and I'm not finding any info on it except for this forum. I'm not terribly techie but if someone can tell me how to read this and how to change it I can follow directions pretty well. Thanks All! PS If I don't have the proper tags here could someone add the appropriate tags? php mysql wordpress share | improve this question asked Nov 16 '18 at 20:41 ...
                                          Read more

                                          How to change which sound is reproduced for terminal bell?

                                          Image
                                          3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
                                          Read more

                                          Can I use Tabulator js library in my java Spring + Thymeleaf project?

                                          Image
                                          0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
                                          Read more