How do I transpose the 1st and -1th levels of an arbitrarily nested array? The Next CEO of Stack OverflowA question about transforming one List into two Lists with additional requirementsEmulating R data frame getters with UpValuesQuickly pruning elements in one structured array that exist in a separate unordered array`Part` like `Delete`: How to delete list of columns or arbitrarily deeper levelsHow to mesh a region using adaptive cubic elementsHow to efficiently Flatten nested lists while preserving select levels?Distribute elements of one line across arbitrary dimension of another listDeep level nested list addition`Transpose` nested `Association`Reformatting the pattern inside a list

How do I make a variable always equal to the result of some calculations?

How to invert MapIndexed on a ragged structure? How to construct a tree from rules?

How did people program for Consoles with multiple CPUs?

Can we say or write : "No, it'sn't"?

Bold, vivid family

Is there a way to save my career from absolute disaster?

What happened in Rome, when the western empire "fell"?

What benefits would be gained by using human laborers instead of drones in deep sea mining?

What does "Its cash flow is deeply negative" mean?

Can I equip Skullclamp on a creature I am sacrificing?

How to solve a differential equation with a term to a power?

Won the lottery - how do I keep the money?

Has this building technique been used in an official set?

How did the Bene Gesserit know how to make a Kwisatz Haderach?

What flight has the highest ratio of time difference to flight time?

What connection does MS Office have to Netscape Navigator?

Why didn't Khan get resurrected in the Genesis Explosion?

Are there any limitations on attacking while grappling?

Between two walls

RegionPlot of annulus gives a mesh

Limits on contract work without pre-agreed price/contract (UK)

In excess I'm lethal

Why don't programming languages automatically manage the synchronous/asynchronous problem?

I believe this to be a fraud - hired, then asked to cash check and send cash as Bitcoin



How do I transpose the 1st and -1th levels of an arbitrarily nested array?



The Next CEO of Stack OverflowA question about transforming one List into two Lists with additional requirementsEmulating R data frame getters with UpValuesQuickly pruning elements in one structured array that exist in a separate unordered array`Part` like `Delete`: How to delete list of columns or arbitrarily deeper levelsHow to mesh a region using adaptive cubic elementsHow to efficiently Flatten nested lists while preserving select levels?Distribute elements of one line across arbitrary dimension of another listDeep level nested list addition`Transpose` nested `Association`Reformatting the pattern inside a list










6












$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
    5 hours ago










  • $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
    5 hours ago











  • $begingroup$
    Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $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
    5 hours ago
















6












$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
    5 hours ago










  • $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
    5 hours ago











  • $begingroup$
    Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $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
    5 hours ago














6












6








6





$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 31 mins ago









Peter Mortensen

33627




33627










asked 6 hours ago









Kuba♦Kuba

107k12210531




107k12210531











  • $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
    5 hours ago










  • $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
    5 hours ago











  • $begingroup$
    Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $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
    5 hours ago

















  • $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
    5 hours ago










  • $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
    5 hours ago











  • $begingroup$
    Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
    $endgroup$
    – Roman
    5 hours ago











  • $begingroup$
    @Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
    $endgroup$
    – Kuba♦
    5 hours ago










  • $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
    5 hours ago
















$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
5 hours ago




$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
5 hours ago












$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
5 hours ago





$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
5 hours ago













$begingroup$
Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
$endgroup$
– Roman
5 hours ago





$begingroup$
Does your list always contain a,b at the lowest level, or can there be anything there as long as they're all of same length?
$endgroup$
– Roman
5 hours ago













$begingroup$
@Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
$endgroup$
– Kuba♦
5 hours ago




$begingroup$
@Roman Level[arr, -2]` should be a rectangular array but rows do not need to be the same.
$endgroup$
– Kuba♦
5 hours ago












$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
5 hours ago





$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
5 hours ago











3 Answers
3






active

oldest

votes


















8












$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$




















      1












      $begingroup$

      Terrible solution using Table but works:



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





      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-1st-and-1th-levels-of-an-arbitrarily-nested-array%23new-answer', 'question_page');

        );

        Post as a guest















        Required, but never shown

























        3 Answers
        3






        active

        oldest

        votes








        3 Answers
        3






        active

        oldest

        votes









        active

        oldest

        votes






        active

        oldest

        votes









        8












        $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$

















          8












          $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$















            8












            8








            8





            $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 5 hours ago









            andre314andre314

            12.3k12352




            12.3k12352





















                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 5 hours ago









                    C. E.C. E.

                    50.9k399205




                    50.9k399205





















                        1












                        $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$

                          Terrible solution using Table but works:



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





                          share|improve this answer









                          $endgroup$















                            1












                            1








                            1





                            $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 5 hours ago









                            RomanRoman

                            3,9761022




                            3,9761022



























                                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-1st-and-1th-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

                                Disable / Remove link to Product Items in Cart Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?How can I limit products that can be bought / added to cart?Remove item from cartHide “Add to Cart” button if specific products are already in cart“Prettifying” the custom options in cart pageCreate link in cart sidebar to view all added items After limit reachedLink products together in checkout/cartHow to Get product from cart and add it againHide action-edit on cart page if simple productRemoving Cart items - ObserverRemove wishlist items when added to cart

                                Image
                                How were pictures turned from film to a big picture in a picture frame before digital scanning? Why is it faster to reheat something than it is to cook it? Has negative voting ever been officially implemented in elections, or seriously proposed, or even studied? Project Euler #1 in C++ What does 丫 mean? 丫是什么意思？ Do I really need to have a message in a novel to appeal to readers? Co-worker has annoying ringtone macOS: Name for app shortcut screen found by pinching with thumb and three fingers Amount of permutations on an NxNxN Rubik's Cube How does light 'choose' between wave and particle behaviour? What makes a man succeed? The test team as an enemy of development? And how can this be avoided? Should a wizard buy fine inks every time he want to copy spells into his spellbook? Most bit efficient text communication method? Do wooden building fires get hotter than 600°C? Is the IBM 5153 color display ...
                                Read more

                                Helsingin valtaus Sisällysluettelo Taustaa | Yleistä sotatoimista | Osapuolet | Taistelut Helsingin ympäristössä | Punaisten antautumissuunnitelma | Taistelujen kulku Helsingissä | Valtauksen jälkeen | Tappiot | Muistaminen | Kirjallisuutta | Lähteet | Aiheesta muualla | NavigointivalikkoTeoksen verkkoversioTeoksen verkkoversioGoogle BooksSisällissota Helsingissä päättyi tasan 95 vuotta sittenSaksalaisten ylivoima jyräsi punaisen HelsinginSuomalaiset kuvaavat sotien jälkiä kaupungeissa – katso kuvat ja tarinat tutuilta kulmiltaHelsingin valtaus 90 vuotta sittenSaksalaiset valtasivat HelsinginHyökkäys HelsinkiinHelsingin valtaus 12.–13.4. 1918Saksalaiset käyttivät ihmiskilpiä Helsingin valtauksessa 1918Teoksen verkkoversioTeoksen verkkoversioSaksalaiset hyökkäävät Etelä-SuomeenTaistelut LeppävaarassaSotilaat ja taistelutLeppävaara 1918 huhtikuussa. KapinatarinaHelsingin taistelut 1918Saksalaisten voitonparaati HelsingissäHelsingin valtausta juhlittiinSaksalaisten Helsinki vuonna 1918Helsingin taistelussa kaatuneet valkokaartilaisetHelsinkiin haudatut taisteluissa kaatuneet punaiset12.4.1918 Helsingin valtauksessa saksalaiset apujoukot vapauttavat kaupunginVapaussodan muistomerkkejä Helsingissä ja pääkaupunkiseudullaCrescendo / Vuoden 1918 Kansalaissodan uhrien muistomerkkim

                                Image
                                Saksalaisten taistelut Suomen sisällissodassaHelsingin historia Helsinki Saksan Itämeren-divisioona Saksan keisarikunnan laivasto valkoiset Helsingin punakaarti Rüdiger von der Goltz Hugo Meurer Carl Voss-Schrader F. E. Johansson Edvard NyqvistSuomen sisällissodanSaksan Itämeren-divisioonapunaistenHelsinginHangossavalkoisiavankileireilleRüdiger von der GoltzinEspoossaMannerheimintietäTöölönlahdenPasilastaSmolnaPitkänsillanSiltasaareenHakaniemeenTampereen taistelussaKymijoenMannerheimTilkanIlmalan mäelläKampissaTurun kasarmillaRuotsalaisella teatterillaHelsingin työväentalollaVesilinnanmäelläLasipalatsinTarkk’ampujankatuensimmäisen maailmansodanNeuvosto-VenäjänViaporinBrest-Litovskin rauhansopimukseenHangon sopimuksenVenäjän Itämeren-laivastooma evakuointiPunavuoressaKaartinkaupungissaUllanlinnassaRüdiger von der GoltzinHelsingin suojeluskunnanCarl Voss-SchraderKu...
                                Read more

                                Adjektiivitarina Tarinan tekeminen | Esimerkki: ennen | Esimerkki: jälkeen | Navigointivalikko

                                Sanaleikit adjektiivitsubstantiiviverbitarinoita Adjektiivitarina on seuraleikki, jossa leikkijät lisäävät etukäteen kirjoitettuun tarinaan adjektiivit tarinaa tuntematta. On olemassa myös substantiivi- ja verbitarinoita, jotka tehdään samalla periaatteella. Tarinan tekeminen | Ensin pitää tehdä tai hankkia tarina, josta jätetään adjektiivit pois. Sitten tarinan kirjoittaja kysyy muilta ihmisiltä adjektiiveja, taivuttaa ne oikeaan muotoon ja lisää tarinaan tyhjille paikoille. Kun kaikki paikat on täytetty, tarina luetaan ääneen. Esimerkki: ennen | Liisalla oli _______ synttärit. Hän täytti 18 ________ vuotta. Liisan _______ äiti oli ostanut hänelle ________ lautapelin, jota voi pelata _________ kavereiden kanssa. Liisan ________ isoäiti, Margaretta, oli ostanut Liisalle paljon ________ kukkia, koska ei tiennyt mistä _________ lapsenlapsensa piti. Es...
                                Read more