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

Does it take more energy to get to Venus or to Mars?

If the heap is initialized for security, then why is the stack uninitialized?

Unreliable Magic - Is it worth it?

Are there any unintended negative consequences to allowing PCs to gain multiple levels at once in a short milestone-XP game?

How to avoid supervisors with prejudiced views?

Is there a difference between "Fahrstuhl" and "Aufzug"

multiple labels for a single equation

Do I need to enable Dev Hub in my PROD Org?

If a black hole is created from light, can this black hole then move at speed of light?

Interfacing a button to MCU (and PC) with 50m long cable

What happens if you roll doubles 3 times then land on "Go to jail?"

Has this building technique been used in an official set?

WOW air has ceased operation, can I get my tickets refunded?

What's the best way to handle refactoring a big file?

Skipping indices in a product

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

Received an invoice from my ex-employer billing me for training; how to handle?

Why does standard notation not preserve intervals (visually)

Complex fractions

Help understanding this unsettling image of Titan, Epimetheus, and Saturn's rings?

What is the purpose of the Evocation wizard's Potent Cantrip feature?

Why do airplanes bank sharply to the right after air-to-air refueling?

Is it ever safe to open a suspicious html file (e.g. email attachment)?

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



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

                                How should I use the fbox command correctly to avoid producing a Bad Box message?How to put a long piece of text in a box?How to specify height and width of fboxIs there an arrayrulecolor-like command to change the rule color of fbox?What is the command to highlight bad boxes in pdf?Why does fbox sometimes place the box *over* the graphic image?how to put the text in the boxHow to create command for a box where text inside the box can automatically adjust?how can I make an fbox like command with certain color, shape and width of border?how to use fbox in align modeFbox increase the spacing between the box and it content (inner margin)how to change the box height of an equationWhat is the use of the hbox in a newcommand command?

                                Image
                                Is there a problem with hiding "forgot password" until it's needed? Time travel short story where a man arrives in the late 19th century in a time machine and then sends the machine back into the past Go Pregnant or Go Home Why Were Madagascar and New Zealand Discovered So Late? How can my private key be revealed if I use the same nonce while generating the signature? Modify casing of marked letters Trouble understanding overseas colleagues Best way to store options for panels Was Spock the First Vulcan in Starfleet? How do I keep an essay about "feeling flat" from feeling flat? How does a character multiclassing into warlock get a focus? Why does John Bercow say “unlock” after reading out the results of a vote? The Riley Riddle Mine Print name if parameter passed to function How can I replace every global instance of "x[2]" with "x_2" Hide Select Output from T-SQL Can I convert a rim brake wheel to a disc brak...
                                Read more

                                Doxepinum Nexus interni Notae | Tabula navigationis3158DB01142WHOa682390"Structural Analysis of the Histamine H1 Receptor""Transdermal and Topical Drug Administration in the Treatment of Pain""Antidepressants as antipruritic agents: A review"

                                Image
                                Antidepressiva depressionuminsomniareceptorium H 1 agonista inversapruritusdermatitis atopicaelichenis simplicis chronici (neurodermatitis) Cave: notitiae huius paginae nec praescriptiones nec consilia medica sunt. Doxepinum Natura chemica Formula chemica C 19 H 21 NO Massa molaris 279.376 g/mol PubChem 3158 DrugBank DB01142 Natura pharmacologica Codex ATC N06AA12 ( WHO ) Tempus semivitae biologicum 17 (8-24) h Nor-Doxepinum: 31 h Metabolismus iecore (hepaticus): CYP2D6 CYP2C19 Metabolitus Nor-Doxepinum Excretio renibus (ca. 50%), faecibus: minus Ad usum therapeuticum Applicatio per os, i.v., i.m. MedlinePlus a682390 .mw-parser-output .existinglinksgray a,.mw-parser-output .existinglinksgray a:visitedcolor:gray.mw-parser-output .existinglinksgray a.newcolor:#ba0000.mw-parser-output .existinglinksgray a.new:visitedcolor:#a55858 (Anglice) Doxepinum est substantia psychoanaleptica et antidepressiva, ergo medicamentum tractationis depressionum, praesertim cum insomnia praesente, effectu...
                                Read more

                                inputenc: Unicode character … not set up for use with LaTeX The Next CEO of Stack OverflowEntering Unicode characters in LaTeXHow to solve the `Package inputenc Error: Unicode char not set up for use with LaTeX` problem?solve “Unicode char is not set up for use with LaTeX” without special handling of every new interesting UTF-8 characterPackage inputenc Error: Unicode character ² (U+B2)(inputenc) not set up for use with LaTeX. acroI2C[I²C]package inputenc error unicode char (u + 190) not set up for use with latexPackage inputenc Error: Unicode char u8:′ not set up for use with LaTeX. 3′inputenc Error: Unicode char u8: not set up for use with LaTeX with G-BriefPackage Inputenc Error: Unicode char u8: not set up for use with LaTeXPackage inputenc Error: Unicode char ́ (U+301)(inputenc) not set up for use with LaTeX. includePackage inputenc Error: Unicode char ̂ (U+302)(inputenc) not set up for use with LaTeX. … $widehatleft (OA,AA' right )$Package inputenc Error: Unicode char â„¡ (U+2121)(inputenc) not set up for use with LaTeX. printbibliography[heading=bibintoc]Package inputenc Error: Unicode char − (U+2212)(inputenc) not set up for use with LaTeXPackage inputenc Error: Unicode character α (U+3B1) not set up for use with LaTeXPackage inputenc Error: Unicode characterError: ! Package inputenc Error: Unicode char ⊘ (U+2298)(inputenc) not set up for use with LaTeX

                                Image
                                Monthly twice production release for my software project How to make a software documentation "officially" citable? Was a professor correct to chastise me for writing "Prof. X" rather than "Professor X"? How to safely derail a train during transit? How can I filter or show only one of the duplicates in the results when using Find-Item command? What happens if you roll doubles 3 times then land on "Go to jail?" Clustering points and summing up attributes per cluster in QGIS How easy is it to start Magic from scratch? What can we do to stop prior company from asking us questions? Science fiction short story involving a paper written by a schizophrenic Is a stroke of luck acceptable after a series of unfavorable events? I believe this to be a fraud - hired, then asked to cash check and send cash as Bitcoin Why does standard notation not preserve intervals (visually) How to prepend a string to only the lines of text which ar...
                                Read more