Давши рядок x, виведіть символи xвпорядкованому відповідно до порядку появи у вихідному коді.

Приклади

Source: ThisIs A Test
 Input: Is it a Test?
Output: TissI   etta?

Source: Harry - yer a wizard.
 Input: I'm a what?
Output: aa  wh'?Imt

Source: Mr. H. Potter, The Floor, Hut-on-the-Rock, The Sea
 Input: 
Output:

Правила

• Застосовуються стандартні лазівки та правила вводу-виводу
• Введення та вихід можуть бути рядок, список символів або список байтів.
• Якщо символ використовується декілька разів у джерелі, використовуйте перше явище.
• Якщо один або кілька символів не відображаються у джерелі, вони повинні бути в кінці; їх порядок не має значення, а також не повинен бути узгодженим.
• Джерело має бути не порожнім
• Нові рядки трактуються так само, як і інші символи.
• Порядок виконання коду не має значення; просто сирий рядок.
• Вхід знаходиться в тому ж кодуванні, що і код.
• Вхід сортується за символами, а не за байтами.
• Сортування залежить від регістру
• Це код-гольф , тому найкоротша відповідь у байтах за кожну мову виграє!

let f = (s, i, o) => o.split("").map(x => [x, s.indexOf(x) == -1 ? s.length + 100 : s.indexOf(x)]).sort(([, a], [, b]) => a - b).map(([x]) => x).join("") === o && i.split("").sort().join("") === o.split("").sort().join("");let g = (s, i) => i.split("").map(x => [x, s.indexOf(x) == -1 ? s.length + 100 + Math.random() : s.indexOf(x)]).sort(([, a], [, b]) => a - b).map(([a]) => a).join("");$(() => $("button").click(() => $("#result").text(f($("#source").val(), $("#input").val(), $("#output").val()) ? "Valid" : `Invalid; example output: \`${g($("#source").val(), $("#input").val())}\``)));

body,label{display: flex;flex-direction: column;}*{white-space: pre;font-family: Inconsolata, Consolas, mono-space;font-size: 14px;}

<script src="https://cdnjs.cloudflare.com/ajax/libs/jquery/3.3.1/jquery.min.js"></script><label>Source: <textarea id="source">ThisIs A Test</textarea></label><label>Input: <textarea id="input">Is it a Test?</textarea></label><label>Output: <textarea id="output">TissI   etta?</textarea></label><div><button>Validate</button> <span id="result"></span></div>

Python 3.8 (передвипуск) , 102 100 96 85 79 76 68 61 59 60 байт

c="print(sorted(x:=input(),key=('c=%r;'%c+x).find))";exec(c)

Спробуйте в Інтернеті!

-2 байти, скориставшись цим

-4 байти, зрозумівши, що <0== ==-1та видаливши зайве+1

-11 байт завдяки Нілу

-6 байт завдяки dzaima

-3 байти завдяки стрижня

-8 байт завдяки негативним семи вказуючи на те, що програма може виводити список символів

-7 байт завдяки Втіленню Невідомості переключитися на Python 3.8 та використовувати :=

-2 байти через те, що Джо Кінг вимикав ім'я змінної s для c, тому ми могли залишити її ;c

+1 байт, тому що мінус 7 вказував на те, що він не фільтрується ;правильно

APL (Dyalog Unicode), 14 bytes^SBCS

Anonymous tacit prefix function.

'''∘⍋⊃¨⊂'∘⍋⊃¨⊂

⊂ enclose argument (to act on it as a whole)

…⊃¨ from that, pick one character for each of the following indices:

∘⍋ the indices that would sort the argument in the the order given by the following string (all non-members go in order of appearance at the end):

'''∘⍋⊃¨⊂' the characters '∘⍋⊃¨⊂

Try it online!

C# (Visual C# Interactive Compiler), 48 bytes

n=>n.OrderBy((@"n=>.OrdeBy(@""+)Ixf"+n).IndexOf)

Try it online!

JavaScript (Node.js), 60 58 56 bytes

-2 bytes from Jo King

f=_=>_.sort((a,b)=>(p=g=>`f=${f+g}`.indexOf(g))(a)-p(b))

Try it online!

Perl 6, 56 bytes

<slurp.comb.sort({"<$_>~EVAL$^a".index($a)}).say>~~.EVAL

Try it online!

Ruby, 57 bytes

->s{s.sort_by{|o|%{->s{.ort_by|%}index()9}.index(o)||99}}

Try it online!

Fairly straightforward, assuming I haven't missed a golfing trick. Take in a list of characters and sort by their index in a string consisting of all the uniq characters in the code in order of their appearance. Often their first appearance is in that very string, but that doesn't change the order.

05AB1E, 24 22 21 bytes

Σ"Σ"'"«"'«Rrk}"«Rrk}R

Try it online!

Explanation:

Σ                    }               # Sort
 "Σ"                                 # Σ string literal
    '"                               # " string literal
       «                             # Concatenate last two literals
        "'«Rrk}"                     # '«Rrk} another literal
                «                    # Concat again
                 R                   # Reverse literal (so: }krR'«'"Σ)
                  r                  # reverse stack 
                   k                 # find the current sorting index in our code string 
                     R               # reverse our sorted string

First time trying stuff in 05AB1E so probably lots to be saved

Jelly, 16 14 bytes (Jelly Code page), 25 bytes (UTF8)

“Ṿv`Ṿ;³³i@Þ”v`

Try it online!

A full program that takes a single argument, the string to be sorted.

Thanks to @JonathanAllan for pointing out a bug!

As per @EriktheOutgolfer, although the code can be input using the Jelly code page, the characters sorted are the equivalent UTF-8 ones rather than the bytes of the source. As such, I’ve included the score in UTF-8 bytes as well. Note the same probably applies to all languages with custom code pages.

Explanation

“Ṿv`Ṿ;³³i@Þ”   | The string "Ṿv`Ṿ;³³i@Þ", referred to below as S
            v` | Evaluate this string as Jelly code using the string itself as the argument

The string above evaluates as:

Ṿ          | Uneval the string S (effectively wraps it in “”)
 v`        | Eval it (effectively removes the “”)
   Ṿ       | Uneval it again, adding back in the “”
    ;³     | Concatenate the input to this
      ³i@Þ | Sort the input with respect to the first occurence of each character in the “”-wrapped string S concatenated to the input

Ṿv` is a no-op effectively here, but exists to ensure all characters are represented.

Jelly, 14 bytes

“;fɓḟṾⱮ”ṾɓfⱮ;ḟ

A full program accepting a (Python formatted) string (of Jelly code-page characters) which prints the output.
(as a monadic link it yields a list of lists of characters)

Try it online!

How?

“;fɓḟṾⱮ”ṾɓfⱮ;ḟ - Main Link: list of characters, S
“;fɓḟṾⱮ”       - list of characters = [';', 'f', 'ɓ', 'ḟ', 'Ṿ', 'Ɱ']
        Ṿ      - un-evaluate = ['“', ';', 'f', 'ɓ', 'ḟ', 'Ṿ', 'Ɱ', '”']
         ɓ     - start a new dyadic chain, F(S, T=that):
           Ɱ   - for each character, t, in T:
          f    -   (S) filter keep any of (the single character, t)
             ḟ - (S) filter discard any of (the characters in T)
            ;  - concatenate

Charcoal, 37 bytes

≔´≔´´´η´Ｆ´Φ´θ´⁼´ι´κ´¬´№ηＦηΦθ⁼ικΦθ¬№ηι

Try it online! Explanation:

≔´≔´´´η´Ｆ´Φ´θ´⁼´ι´κ´¬´№η

There are two ways of quoting characters in Charcoal; ´ quotes any single character while ”y...” quotes any character except ” and also counts as a separate string. It turns out that the overhead in having to deal with ” means that it doesn't end up any golfier.

ＦηΦθ⁼ικ

Loop over the characters in turn, outputting any matching characters from the input. This sorts the input.

Φθ¬№ηι

Output any unmatched characters in the input.

J, 14 bytes

Anonymous tacit prefix function.

]/:']/:''i'i:]

Try it online!

] the argument

…i: last occurrence (non-members get the index beyond end of lookup string) of each character in:

']/:''i' the characters ]/:'i

…/: use that to sort:

] the argument

Java 10, 129 100 bytes

s->{s.sort(java.util.Comparator.comparing(c->("s->{.ort(javuilCmpcng\"\\+)dexOf;}"+c).indexOf(c)));}

-29 bytes by porting the +c from @EmbodimentOfIgnorance's C# answer.

Try it online.

Explanation:

s->{                 // Method with char-List parameter and no return-type
  s.sort(java.util.Comparator.comparing(c->
    ("s->{.ort(javuilCmpcng\"\\+)dexOf;}"
                     //  Push a String containing the characters in the code
     +c)             //  Append the current character
        .indexOf(c)  //  And get the first index of the current character in the String

NOTE: Usually it's cheaper to use s.sort((a,b)->Long.compare(a,b)) instead of s.sort(java.util.Comparator.comparing(c->c), but in this case it would be 11 bytes longer:

s->{var v="s->{var =\"\\;.ot(,)Lngcmpe+idxOf}";s.sort((a,r)->Long.compare((v+a).indexOf(a),(v+r).indexOf(r)));}

Try it online.

05AB1E, 31 26 19 bytes

Σ'"'ÿs"Σ'ÿÿsìyk"ìyk

-7 bytes by taking inspiration of @EmbodimentOfIgnorance's approach in his C# answer of appending the current character before indexing.

Try it online or try it with added debug-line to see the strings that's being indexed into.

Explanation:

Σ                 # Sort the (implicit) input-string by:
 '"              '#  Push string '"'
   'ÿ            '#  Push string "ÿ"
     s            #  Swap the order of these two strings on the stack
      "Σ'ÿÿsìyk"  #  Push string "Σ'ÿÿsìyk", where the `ÿ` are automatically filled with
                  #  the previous strings we created: `Σ'"ÿsìyk`
                  #  (top to bottom from stack; left to right in string)
       ì          #  Prepend this string in front of the character we're sorting
        yk        #  And then get the index of the character we're sorting in this string
                  # (after the sorting the resulting string is output implicitly)

PowerShell, 68 bytes

$p=$args
&($t={$p|sort-object{"`$p=`$args
&(`$t={$t})$_"|% i*f $_}})

Try it online!

Python 2, 62 bytes

lambda a:sorted(a,key=('lambd :sorted(,ky=\'\\+).fin'+a).find)

Same concept as my C# answer.

Try it online!

Japt, 18 bytes

ñÈi"ñÈi\"\\ bX" bX

Try it

ñÈi"ñÈi\"\\ bX" bX     :Implicit input of string or character array
ñ                      :Sort by
 È                     :Passing each X through the following function
  i                    :  Prepend X with
   "ñÈi\"\\ bX"        :    Literal string (The \s are annoying me!)
                bX     :  First index of X

Jelly, 26 bytes (UTF-8*)

“®³nÞṾ©V”Ṿ©VV

Try it online!

Takes input as a Python-formatted string in the 1st command-line argument.

Unique characters:

“®³nÞṾ©V”

*Note: I discovered that this doesn't work when encoded in JELLY, since it sorts the UTF-8 characters instead of its own bytes.