Basic Data Operation
This is a basic data operation. It represents a fundamental action on a basic data type.

You may see other such operations in theBasic Data Operations category, or:

V s = ‘abcdefgh’V n = 2V m = 3V char = ‘d’V chars = ‘cd’print(s[n - 1 .+ m])          // starting from n=2 characters in and m=3 in lengthprint(s[n - 1 ..])            // starting from n characters in, up to the end of the stringprint(s[0 .< (len)-1])        // whole string minus last characterprint(s[s.index(char) .+ m])  // starting from a known character char="d" within the string and of m lengthprint(s[s.index(chars) .+ m]) // starting from a known substring chars="cd" within the string and of m length

Output:

/* ARM assembly AARCH64 Raspberry PI 3B *//*  program subString64.s   */ /*******************************************//* Constantes file                         *//*******************************************//* for this file see task include a file in language AArch64 assembly*/.include "../includeConstantesARM64.inc"/*******************************************//* Initialized data                        *//*******************************************/.dataszMessString:            .asciz "Result : " szString1:               .asciz "abcdefghijklmnopqrstuvwxyz"szStringStart:           .asciz "abcdefg"szCarriageReturn:        .asciz "\n"/*******************************************/ /* UnInitialized data                      *//*******************************************/.bss szSubString:             .skip 500             // buffer result /*******************************************//*  code section                           *//*******************************************/.text.global main main:      ldr x0,qAdrszString1                        // address input string    ldr x1,qAdrszSubString                      // address output string    mov x2,22                                   // location    mov x3,4                                    // length    bl subStringNbChar                          // starting from n characters in and of m length    ldr x0,qAdrszMessString                     // display message    bl affichageMess    ldr x0,qAdrszSubString                      // display substring result    bl affichageMess    ldr x0,qAdrszCarriageReturn                 // display line return    bl affichageMess    //    ldr x0,qAdrszString1    ldr x1,qAdrszSubString    mov x2,15                                   // location    bl subStringEnd                             //starting from n characters in, up to the end of the string    ldr x0,qAdrszMessString                     // display message    bl affichageMess    ldr x0,qAdrszSubString    bl affichageMess    ldr x0,qAdrszCarriageReturn                 // display line return    bl affichageMess    //    ldr x0,qAdrszString1    ldr x1,qAdrszSubString    bl subStringMinus                           // whole string minus last character    ldr x0,qAdrszMessString                     // display message    bl affichageMess    ldr x0,qAdrszSubString    bl affichageMess    ldr x0,qAdrszCarriageReturn                 // display line return    bl affichageMess    //    ldr x0,qAdrszString1    ldr x1,qAdrszSubString    mov x2,'c'                                  // start character    mov x3,5                                    // length    bl subStringStChar                          //starting from a known character within the string and of m length    cmp x0,-1                                   // error ?    beq 2f    ldr x0,qAdrszMessString                     // display message    bl affichageMess    ldr x0,qAdrszSubString    bl affichageMess    ldr x0,qAdrszCarriageReturn                 // display line return    bl affichageMess    //2:    ldr x0,qAdrszString1    ldr x1,qAdrszSubString    ldr x2,qAdrszStringStart                    // sub string to start    mov x3,10                                   // length    bl subStringStString                        // starting from a known substring within the string and of m length    cmp x0,-1                                   // error ?    beq 3f    ldr x0,qAdrszMessString                     // display message    bl affichageMess    ldr x0,qAdrszSubString    bl affichageMess    ldr x0,qAdrszCarriageReturn                 // display line return    bl affichageMess3:100:                                            // standard end of the program    mov x0,0                                    // return code    mov x8,EXIT                                 // request to exit program    svc 0                                       // perform system callqAdrszMessString:         .quad szMessStringqAdrszString1:            .quad szString1qAdrszSubString:          .quad szSubStringqAdrszStringStart:        .quad szStringStartqAdrszCarriageReturn:     .quad szCarriageReturn/******************************************************************//*     sub strings  index start  number of characters             */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of the output string *//* x2 contains the start index                  *//* x3 contains numbers of characters to extract *//* x0 returns number of characters or -1 if error */subStringNbChar:    stp x1,lr,[sp,-16]!            // save  registers    mov x14,#0                     // counter byte output string 1:    ldrb w15,[x0,x2]               // load byte string input    cbz x15,2f                     // zero final ?    strb w15,[x1,x14]              // store byte output string    add x2,x2,1                    // increment counter    add x14,x14,1    cmp x14,x3                     // end ?    blt 1b                         // no -> loop2:    strb wzr,[x1,x14]              // store final zero byte string 2    mov x0,x14100:    ldp x1,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/******************************************************************//*     sub strings  index start at end of string             */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of the output string *//* x2 contains the start index                  *//* x0 returns number of characters or -1 if error */subStringEnd:    stp x2,lr,[sp,-16]!            // save  registers    mov x14,0                      // counter byte output string 1:    ldrb w15,[x0,x2]               // load byte string 1    cbz x15,2f                     // zero final ?    strb w15,[x1,x14]    add x2,x2,1    add x14,x14,1    b 1b                           // loop2:    strb wzr,[x1,x14]              // store final zero byte string 2    mov x0,x14100:    ldp x2,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/******************************************************************//*      whole string minus last character                        */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of the output string *//* x0 returns number of characters or -1 if error */subStringMinus:    stp x1,lr,[sp,-16]!            // save  registers    mov x12,0                      // counter byte input string    mov x14,0                      // counter byte output string 1:    ldrb w15,[x0,x12]              // load byte string     cbz x15,2f                     // zero final ?    strb w15,[x1,x14]    add x12,x12,1    add x14,x14,1    b 1b                           //  loop2:    sub x14,x14,1    strb wzr,[x1,x14]              // store final zero byte string 2    mov x0,x14100:    ldp x1,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/******************************************************************//*   starting from a known character within the string and of m length  */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of the output string *//* x2 contains the character    *//* x3 contains the length/* x0 returns number of characters or -1 if error */subStringStChar:    stp x1,lr,[sp,-16]!            // save  registers    mov x16,0                      // counter byte input string    mov x14,0                      // counter byte output string 1:    ldrb w15,[x0,x16]              // load byte string     cbz x15,4f                     // zero final ?    cmp x15,x2                     // character find ?    beq 2f                         // yes    add x16,x16,1                  // no -> increment indice    b 1b                           //  loop2:    strb w15,[x1,x14]    add x16,x16,1    add x14,x14,1    cmp x14,x3    bge 3f    ldrb w15,[x0,x16]              // load byte string     cbnz x15,2b                    // loop if no zero final3:    strb wzr,[x1,x14]              // store final zero byte string 2    mov x0,x14    b 100f4:    strb w15,[x1,x14]    mov x0,#-1100:    ldp x1,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/******************************************************************//*   starting from a known substring within the string and of m length  */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of the output string *//* x2 contains the address of string to start    *//* x3 contains the length/* x0 returns number of characters or -1 if error */subStringStString:    stp x1,lr,[sp,-16]!            // save  registers    stp x20,x21,[sp,-16]!          // save  registers    mov x20,x0                     // save address    mov x21,x1                     // save address output string    mov x1,x2    bl searchSubString    cmp x0,-1                      // not found ?    beq 100f    mov x16,x0                     // counter byte input string    mov x14,01:    ldrb w15,[x20,x16]             // load byte string     strb w15,[x21,x14]    cmp x15,#0                     // zero final ?    csel x0,x14,x0,eq    beq 100f    add x14,x14,1    cmp x14,x3    add x15,x16,1    csel x16,x15,x16,lt    blt 1b                         //  loop    strb wzr,[x21,x14]    mov x0,x14                     // return indice100:    ldp x20,x21,[sp],16              // restaur  2 registers    ldp x1,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/******************************************************************//*   search a substring in the string                            */ /******************************************************************//* x0 contains the address of the input string *//* x1 contains the address of substring *//* x0 returns index of substring in string or -1 if not found */searchSubString:    stp x1,lr,[sp,-16]!            // save  registers    mov x12,0                      // counter byte input string    mov x13,0                      // counter byte string     mov x16,-1                     // index found    ldrb w14,[x1,x13]1:    ldrb w15,[x0,x12]              // load byte string     cbz x15,4f                     // zero final ?    cmp x15,x14                    // compare character     beq 2f    mov x16,-1                     // no equals - > raz index     mov x13,0                      // and raz counter byte    add x12,x12,1                  // and increment counter byte    b 1b                           // and loop2:                                 // characters equals    cmp x16,-1                     // first characters equals ?    csel x16,x12,x16,eq   // moveq x6,x2                  // yes -> index begin in x6    add x13,x13,1                  // increment counter substring    ldrb w14,[x1,x13]              // and load next byte    cbz x14,3f                     // zero final ? yes -> end search    add x12,x12,1                  // else increment counter string    b 1b                           // and loop3:    mov x0,x16                     // return indice    b 100f4:   mov x0,#-1                      // yes returns error100:    ldp x1,lr,[sp],16              // restaur  2 registers    ret                            // return to address lr x30/********************************************************//*        File Include fonctions                        *//********************************************************//* for this file see task include a file in language AArch64 assembly */.include "../includeARM64.inc"

Output:

BYTE FUNC FindC(CHAR ARRAY text CHAR c)  BYTE i  i=1  WHILE i<=text(0)  DO    IF text(i)=c THEN      RETURN (i)    FI    i==+1  ODRETURN (0)BYTE FUNC FindS(CHAR ARRAY text,sub)  BYTE i,j,found  i=1  WHILE i<=text(0)-sub(0)+1  DO    found=0    FOR j=1 TO sub(0)    DO      IF text(i+j-1)#sub(j) THEN        found=0 EXIT      ELSE        found=1      FI    OD    IF found THEN      RETURN (i)    FI    i==+1  ODRETURN (0)PROC Main()  CHAR ARRAY text="qwertyuiop"  CHAR ARRAY sub="tyu"  CHAR ARRAY res(20)  BYTE n,m  CHAR c  PrintF("Original string:%E  ""%S""%E%E",text)  n=3 m=5  SCopyS(res,text,n,n+m-1)  PrintF("Substring start from %B and length %B:%E  ""%S""%E%E",n,m,res)  n=4  SCopyS(res,text,n,text(0))  PrintF("Substring start from %B up to the end:%E  ""%S""%E%E",n,res)  SCopyS(res,text,1,text(0)-1)  PrintF("Whole string without the last char:%E  ""%S""%E%E",res)  c='w m=4  n=FindC(text,c)  IF n=0 THEN    PrintF("Character '%C' not found in string%E%E",c)  ELSE    SCopyS(res,text,n,n+m-1)    PrintF("Substring start from '%C' and len %B:%E  ""%S""%E%E",c,m,res)  FI  n=FindS(text,sub)  m=6  IF n=0 THEN    PrintF("String ""%S"" not found in string%E%E",sub)  ELSE    SCopyS(res,text,n,n+m-1)    PrintF("Substring start from '%S' and len %B:  ""%S""%E%E",sub,m,res)  FIRETURN

Output:

typeStringisarray(Positiverange<>)ofCharacter;

A(<first-index>..<last-index>)

withAda.Text_IO;useAda.Text_IO;withAda.Strings.Fixed;useAda.Strings.Fixed;procedureTest_SlicesisStr:constantString:="abcdefgh";N:constant:=2;M:constant:=3;beginPut_Line(Str(Str'First+N-1..Str'First+N+M-2));Put_Line(Str(Str'First+N-1..Str'Last));Put_Line(Str(Str'First..Str'Last-1));Put_Line(Head(Tail(Str,Str'Last-Index(Str,"d",1)),M));Put_Line(Head(Tail(Str,Str'Last-Index(Str,"de",1)-1),M));endTest_Slices;

Output:

const str = "abcdefg"var n = 2var m = 3println (str[n:n+m-1])    // pos 2 length 3println (str[n:])           // pos 2 to endprintln (str >> 1)      // remove last charactervar p = find (str, 'c')println (str[p:p+m-1])    // from pos of p length 3var s = find (str, "bc")println (str[s, s+m-1])    // pos of bc length 3

text s;data b, d;s = "The quick brown fox jumps over the lazy dog.";o_text(cut(s, 4, 15));o_newline();o_text(cut(s, 4, length(s)));o_newline();o_text(delete(s, -1));o_newline();o_text(cut(s, index(s, 'q'), 5));o_newline();b_cast(b, s);b_cast(d, "brown");o_text(cut(s, b_find(b, d), 15));o_newline();

Output:

main: (  STRING s = "abcdefgh";  INT n = 2, m = 3;   CHAR char = "d";   STRING chars = "cd";  printf(($gl$, s[n:n+m-1]));  printf(($gl$, s[n:]));  printf(($gl$, s[:UPB s-1]));   INT pos;   char in string("d", pos, s);  printf(($gl$, s[pos:pos+m-1]));  string in string("de", pos, s);  printf(($gl$, s[pos:pos+m-1])))

Output:

String x = 'testing123';//Test1: testing123System.debug('Test1: ' + x.substring(0,x.length()));//Test2: esting123System.debug('Test2: ' + x.substring(1,x.length()));//Test3: testing123System.debug('Test3: ' + x.substring(0));//Test4: 3System.debug('Test4: ' + x.substring(x.length()-1));//Test5: System.debug('Test5: ' + x.substring(1,1));//Test 6: testing123System.debug('Test6: ' + x.substring(x.indexOf('testing')));//Test7: eSystem.debug('Test7: ' + x.substring(1,2));

-- SUBSTRINGS -------------------------------------------------------------------  take :: Int -> Text -> Textontake(n,s)text1thrunofsendtake--  drop :: Int -> Text -> Textondrop(n,s)text(n+1)thru-1ofsenddrop-- breakOn :: Text -> Text -> (Text, Text)onbreakOn(strPattern,s)set{dlm,mytext item delimiters}to{mytext item delimiters,strPattern}setlstPartstotextitemsofssetmytext item delimiterstodlm{item1oflstParts,strPattern&(item2oflstParts)}endbreakOn--  init :: Text -> Textoninit(s)iflengthofs>0thentext1thru-2ofselsemissing valueendifendinit-- TEST -----------------------------------------------------------------------onrunsetstrto"一二三四五六七八九十"setlegendsto{¬"from n in, of n length",¬"from n in, up to end",¬"all but last",¬"from matching char, of m length",¬"from matching string, of m length"}setpartsto{¬take(3,drop(4,str)),¬drop(3,str),¬init(str),¬take(3,item2ofbreakOn("五",str)),¬take(4,item2ofbreakOn("六七",str))}scripttabulatepropertystrPad:"                                        "on|λ|(l,r)l&drop(lengthofl,strPad)&rend|λ|endscriptlinefeed&intercalate(linefeed,¬zipWith(tabulate,¬legends,parts))&linefeedendrun-- GENERIC FUNCTIONS FOR TEST --------------------------------------------------- intercalate :: Text -> [Text] -> Textonintercalate(strText,lstText)set{dlm,mytext item delimiters}to{mytext item delimiters,strText}setstrJoinedtolstTextastextsetmytext item delimiterstodlmreturnstrJoinedendintercalate-- min :: Ord a => a -> a -> aonmin(x,y)ify<xthenyelsexendifendmin-- Lift 2nd class handler function into 1st class script wrapper-- mReturn :: Handler -> ScriptonmReturn(f)ifclassoffisscriptthenfelsescriptproperty|λ|:fendscriptendifendmReturn-- zipWith :: (a -> b -> c) -> [a] -> [b] -> [c]onzipWith(f,xs,ys)setlngtomin(lengthofxs,lengthofys)setlstto{}tellmReturn(f)repeatwithifrom1tolngsetendoflstto|λ|(itemiofxs,itemiofys)endrepeatreturnlstendtellendzipWith

Output:

/* ARM assembly Raspberry PI  *//*  program substring.s   *//* Constantes    */.equ STDOUT, 1                           @ Linux output console.equ EXIT,   1                           @ Linux syscall.equ WRITE,  4                           @ Linux syscall.equ BUFFERSIZE,          100/* Initialized data */.dataszMessString:            .asciz "Result : " szString1:               .asciz "abcdefghijklmnopqrstuvwxyz"szStringStart:           .asciz "abcdefg"szCarriageReturn:        .asciz "\n"/* UnInitialized data */.bss szSubString:             .skip 500             @ buffer result/*  code section */.text.global main main:     ldr r0,iAdrszString1                        @ address input string    ldr r1,iAdrszSubString                      @ address output string    mov r2,#22                                  @ location    mov r3,#4                                   @ length    bl subStringNbChar                          @ starting from n characters in and of m length    ldr r0,iAdrszMessString                     @ display message    bl affichageMess    ldr r0,iAdrszSubString                      @ display substring result    bl affichageMess    ldr r0,iAdrszCarriageReturn                 @ display line return    bl affichageMess    @    ldr r0,iAdrszString1    ldr r1,iAdrszSubString    mov r2,#15                                  @ location    bl subStringEnd                             @starting from n characters in, up to the end of the string    ldr r0,iAdrszMessString                     @ display message    bl affichageMess    ldr r0,iAdrszSubString    bl affichageMess    ldr r0,iAdrszCarriageReturn                 @ display line return    bl affichageMess    @    ldr r0,iAdrszString1    ldr r1,iAdrszSubString    bl subStringMinus                           @ whole string minus last character    ldr r0,iAdrszMessString                     @ display message    bl affichageMess    ldr r0,iAdrszSubString    bl affichageMess    ldr r0,iAdrszCarriageReturn                 @ display line return    bl affichageMess    @    ldr r0,iAdrszString1    ldr r1,iAdrszSubString    mov r2,#'c'                                 @ start character    mov r3,#5                                   @ length    bl subStringStChar                          @starting from a known character within the string and of m length    cmp r0,#-1                                  @ error ?    beq 2f    ldr r0,iAdrszMessString                     @ display message    bl affichageMess    ldr r0,iAdrszSubString    bl affichageMess    ldr r0,iAdrszCarriageReturn                 @ display line return    bl affichageMess    @2:    ldr r0,iAdrszString1    ldr r1,iAdrszSubString    ldr r2,iAdrszStringStart                    @ sub string to start    mov r3,#10                                  @ length    bl subStringStString                        @ starting from a known substring within the string and of m length    cmp r0,#-1                                  @ error ?    beq 3f    ldr r0,iAdrszMessString                     @ display message    bl affichageMess    ldr r0,iAdrszSubString    bl affichageMess    ldr r0,iAdrszCarriageReturn                 @ display line return    bl affichageMess3:100:                                            @ standard end of the program    mov r0, #0                                  @ return code    mov r7, #EXIT                               @ request to exit program    svc 0                                       @ perform system calliAdrszMessString:         .int szMessStringiAdrszString1:            .int szString1iAdrszSubString:            .int szSubStringiAdrszStringStart:            .int szStringStartiAdrszCarriageReturn:     .int szCarriageReturn/******************************************************************//*     sub strings  index start  number of characters             */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of the output string *//* r2 contains the start index                  *//* r3 contains numbers of characters to extract *//* r0 returns number of characters or -1 if error */subStringNbChar:    push {r1-r5,lr}                             @ save  registers     mov r4,#0                                   @ counter byte output string 1:    ldrb r5,[r0,r2]                             @ load byte string input    cmp r5,#0                                   @ zero final ?    beq 2f    strb r5,[r1,r4]                             @ store byte output string    add r2,#1                                   @ increment counter    add r4,#1    cmp r4,r3                                   @ end ?    blt 1b                                      @ no -> loop2:    mov r5,#0    strb r5,[r1,r4]                             @ load byte string 2    mov r0,r4100:    pop {r1-r5,lr}                              @ restaur registers    bx lr                                       @ return/******************************************************************//*     sub strings  index start at end of string             */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of the output string *//* r2 contains the start index                  *//* r0 returns number of characters or -1 if error */subStringEnd:    push {r1-r5,lr}                             @ save registers     mov r4,#0                                   @ counter byte output string 1:    ldrb r5,[r0,r2]                             @ load byte string 1    cmp r5,#0                                   @ zero final ?    beq 2f    strb r5,[r1,r4]    add r2,#1    add r4,#1    b 1b                                        @ loop2:    mov r5,#0    strb r5,[r1,r4]                             @ load byte string 2    mov r0,r4100:    pop {r1-r5,lr}                              @ restaur registers    bx lr   /******************************************************************//*      whole string minus last character                        */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of the output string *//* r0 returns number of characters or -1 if error */subStringMinus:    push {r1-r5,lr}                             @ save  registers     mov r2,#0                                   @ counter byte input string    mov r4,#0                                   @ counter byte output string 1:    ldrb r5,[r0,r2]                             @ load byte string     cmp r5,#0                                   @ zero final ?    beq 2f    strb r5,[r1,r4]    add r2,#1    add r4,#1    b 1b                                        @  loop2:    sub r4,#1    mov r5,#0    strb r5,[r1,r4]                             @ load byte string 2    mov r0,r4100:    pop {r1-r5,lr}                              @ restaur registers    bx lr   /******************************************************************//*   starting from a known character within the string and of m length  */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of the output string *//* r2 contains the character    *//* r3 contains the length/* r0 returns number of characters or -1 if error */subStringStChar:    push {r1-r5,lr}                             @ save  registers     mov r6,#0                                   @ counter byte input string    mov r4,#0                                   @ counter byte output string 1:    ldrb r5,[r0,r6]                             @ load byte string     cmp r5,#0                                   @ zero final ?    streqb r5,[r1,r4]    moveq r0,#-1    beq 100f    cmp r5,r2    beq 2f    add r6,#1    b 1b                                        @  loop2:    strb r5,[r1,r4]    add r6,#1    add r4,#1    cmp r4,r3    bge 3f    ldrb r5,[r0,r6]                             @ load byte string     cmp r5,#0    bne 2b3:    mov r5,#0    strb r5,[r1,r4]                             @ load byte string 2    mov r0,r4100:    pop {r1-r5,lr}                              @ restaur registers    bx lr   /******************************************************************//*   starting from a known substring within the string and of m length  */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of the output string *//* r2 contains the address of string to start    *//* r3 contains the length/* r0 returns number of characters or -1 if error */subStringStString:    push {r1-r8,lr}                             @ save  registers     mov r7,r0                                   @ save address    mov r8,r1                                   @ counter byte string     mov r1,r2    bl searchSubString    cmp r0,#-1    beq 100f    mov r6,r0                                   @ counter byte input string    mov r4,#01:    ldrb r5,[r7,r6]                             @ load byte string     strb r5,[r8,r4]    cmp r5,#0                                   @ zero final ?    moveq r0,r4    beq 100f    add r4,#1    cmp r4,r3    addlt r6,#1    blt 1b                                      @  loop    mov r5,#0    strb r5,[r8,r4]    mov r0,r4100:    pop {r1-r8,lr}                              @ restaur registers    bx lr   /******************************************************************//*   search a substring in the string                            */ /******************************************************************//* r0 contains the address of the input string *//* r1 contains the address of substring *//* r0 returns index of substring in string or -1 if not found */searchSubString:    push {r1-r6,lr}                       @ save registers     mov r2,#0                             @ counter byte input string    mov r3,#0                             @ counter byte string     mov r6,#-1                            @ index found    ldrb r4,[r1,r3]1:    ldrb r5,[r0,r2]                       @ load byte string     cmp r5,#0                             @ zero final ?    moveq r0,#-1                          @ yes returns error    beq 100f    cmp r5,r4                             @ compare character     beq 2f    mov r6,#-1                            @ no equals - > raz index     mov r3,#0                             @ and raz counter byte    add r2,#1                             @ and increment counter byte    b 1b                                  @ and loop2:                                        @ characters equals    cmp r6,#-1                            @ first characters equals ?    moveq r6,r2                           @ yes -> index begin in r6    add r3,#1                             @ increment counter substring    ldrb r4,[r1,r3]                       @ and load next byte    cmp r4,#0                             @ zero final ?    beq 3f                                @ yes -> end search    add r2,#1                             @ else increment counter string    b 1b                                  @ and loop3:    mov r0,r6100:    pop {r1-r6,lr}                        @ restaur registers    bx lr   /******************************************************************//*     display text with size calculation                         */ /******************************************************************//* r0 contains the address of the message */affichageMess:    push {r0,r1,r2,r7,lr}                       @ save  registers     mov r2,#0                                   @ counter length */1:                                              @ loop length calculation    ldrb r1,[r0,r2]                             @ read octet start position + index     cmp r1,#0                                   @ if 0 its over    addne r2,r2,#1                              @ else add 1 in the length    bne 1b                                      @ and loop                                                 @ so here r2 contains the length of the message     mov r1,r0                                   @ address message in r1     mov r0,#STDOUT                              @ code to write to the standard output Linux    mov r7, #WRITE                              @ code call system "write"     svc #0                                      @ call system    pop {r0,r1,r2,r7,lr}                        @ restaur registers    bx lr                                       @ return

str:"abcdefgh"n:2m:3; starting from n=2 characters in and m=3 in lengthprintslicestrn-1n+m-2; starting from n characters in, up to the end of the stringprintslicestrn-1(size str)-1; whole string minus last characterprintslicestr0(size str)-2; starting from a known character char="d"; within the string and of m lengthprintslicestrindexstr"d"m+(indexstr"d")-1; starting from a known substring chars="cd"; within the string and of m lengthprintslicestrindexstr"cd"m+(indexstr"cd")-1

Output:

String:="abcdefghijklmnopqrstuvwxyz"; also: String = abcdefghijklmnopqrstuvwxyzn:=12m:=5; starting from n characters in and of m length;subString:=SubStr(String,n,m); alternative:  StringMid, subString, String, n, mMsgBox%subString; starting from n characters in, up to the end of the string;subString:=SubStr(String,n); alternative:  StringMid, subString, String, nMsgBox%subString; whole string minus last character;StringTrimRight,subString,String,1; alternatives: subString := SubStr(String, 1, StrLen(String) - 1);               StringMid, subString, String, 1, StrLen(String) - 1MsgBox%subString; starting from a known character within the string and of m length;findChar:="q"subString:=SubStr(String,InStr(String,findChar),m); alternatives: RegExMatch(String, findChar . ".{" . m - 1 . "}", subString);               StringMid, subString, String, InStr(String, findChar), mMsgBox%subString; starting from a known character within the string and of m length;findString:="pq"subString:=SubStr(String,InStr(String,findString),m); alternatives: RegExMatch(String, findString . ".{" . m - StrLen(findString) . "}", subString);               StringMid, subString, String, InStr(String, findString), mMsgBox%subString

Output:

BEGIN{str="abcdefghijklmnopqrstuvwxyz"n=12m=5printsubstr(str,n,m)printsubstr(str,n)printsubstr(str,1,length(str)-1)printsubstr(str,index(str,"q"),m)printsubstr(str,index(str,"pq"),m)}

Output:

Lbl SUB10→{r₁+r₂+r₃}r₁+r₂ReturnLbl SUB2r₁+r₂ReturnLbl SUB30→{r₁+length(r₁)-1}r₁ReturnLbl SUB4inData(r₂,r₁)-1→I0→{r₁+I+r₃}r₁+IReturn

0READN,M,S$:L=LEN(S$):GOSUB1:END:DATA5,11,THEQUICKBROWNFOXJUMPSOVERTHELAZYDOG,J,FOXREM          starting from   n   characters in and of   m   length;1PRINTMID$(S$,N,M)REM          starting from   n   characters in,   up to the end of the string;2PRINTRIGHT$(S$,L-N+1)REM          whole string minus the last character;3PRINTLEFT$(S$,L-1)REM          starting from a known   character   within the string and of   m   length;4READF$:GOSUB6REM          starting from a known   substring   within the string and of   m   length.5READF$6FORI=1TOL:IFMID$(S$,I,LEN(F$))=F$THENPRINTMID$(S$,I,M):RETURN7NEXT:RETURN

REM SubstringBase$="abcdefghijklmnopqrstuvwxyz"N=12M=5REM Starting from N characters in and of M length.Sub$=MID$(Base$,N,M)PRINTSub$REM Starting from N characters in, up to the end of the string.L=LEN(Base$)L=L-NL=L+1Sub$=MID$(Base$,N,L)PRINTSub$REM Whole string minus last character.L=LEN(Base$)L=L-1Sub$=LEFT$(Base$,L)PRINTSub$REM Starting from a known character within the string and of M length.B=INSTR(Base$,"b")Sub$=MID$(Base$,B,M)PRINTSub$REM Starting from a known substring within the string and of M length.Find$="pq"B=INSTR(Base$,Find$)Sub$=MID$(Base$,B,M)PRINTSub$END

Output:

c$ = "abcdefghijklmnopqrstuvwxyz"n = 12m = 5# starting from n characters in and of m length;print mid(c$, n, m)# starting from n characters in, up to the end of the string;print mid(c$, n, length(c$))# whole string minus last character;print left(c$, length(c$) - 1)# starting from a known character within the string and of m length;print mid(c$, instr(c$, "b"), m)# starting from a known substring within the string and of m length.f$ = "pq"print mid(c$, instr(c$, f$), m)end

Output:

basestring$="The five boxing wizards jump quickly"n%=10m%=5REM starting from n characters in and of m length:substring$=MID$(basestring$,n%,m%)PRINTsubstring$REM starting from n characters in, up to the end of the string:substring$=MID$(basestring$,n%)PRINTsubstring$REM whole string minus last character:substring$=LEFT$(basestring$)PRINTsubstring$REM starting from a known character within the string and of m length:char$="w"substring$=MID$(basestring$,INSTR(basestring$,char$),m%)PRINTsubstring$REM starting from a known substring within the string and of m length:find$="iz"substring$=MID$(basestring$,INSTR(basestring$,find$),m%)PRINTsubstring$

Output:

10REM SUBSTRING ... ROSETTACODE.ORG20A$="THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG"30X$="J":S$="FOX"40N=5:M=1150PRINT"THE STRING:"60PRINTA$70PRINT80PRINT"SUBSTRING STARTING FROM"N"CHARACTERS IN AND OF"M"LENGTH:"90PRINTMID$(A$,N,M)100PRINT110PRINT"STARTING FROM"N"CHARACTERS IN, UP TO THE END OF THE STRING:"120PRINTRIGHT$(A$,LEN(A$)+1-N)130PRINT140PRINT"WHOLE STRING MINUS LAST CHARACTER:"150PRINTLEFT$(A$,LEN(A$)-1)160PRINT170PRINT"STARTING FROM '";X$;"' AND OF"M"LENGTH:"180I=1190IFMID$(A$,I,1)=X$THEN220200I=I+1210GOTO190220PRINTRIGHT$(A$,LEN(A$)+1-I)230PRINT240PRINT"STARTING FROM '";S$;"' AND OF"M"LENGTH:"250I=1260IFMID$(A$,I,LEN(S$))=S$THEN290270I=I+1280GOTO260290PRINTRIGHT$(A$,LEN(A$)+1-I)300END

Output:

' FB 1.05.0 Win64DimsAsString="123456789"DimAsIntegern=3,m=4PrintMid(s,n,m)PrintMid(s,n)PrintLeft(s,Len(s)-1)'start from "5" sayPrintMid(s,Instr(s,"5"),m)' start from "12" sayPrintMid(s,Instr(s,"12"),m)Sleep

Output:

PublicSubMain()DimsStringAsString="THE QUICK BROWN FOX JUMPS OVER THE LAZY DOG"PrintMid(sString,11,5)'Starting from n characters in and of m lengthPrintMid(sString,17)'Starting from n characters in, up to the end of the stringPrintLeft(sString,-1)'Whole string minus last characterPrintMid(sString,InStr(sString,"B"),9)'Starting from a known character within the string and of m lengthPrintMid(sString,InStr(sString,"OVER"),8)'Starting from a known substring within the string and of m lengthEnd

100 LET A$="abcdefghijklmnopqrstuvwxyz"110 LET N=10:LET M=7120 PRINT A$(N:N+M-1)130 PRINT A$(N:)140 PRINT A$(:LEN(A$)-1)150 LET I=POS(A$,"g")160 PRINT A$(I:I+M-1)170 LET I=POS(A$,"ijk")180 PRINT A$(I:I+M-1)

'These tasks can be completed with various combinations of Liberty Basic's'built in Mid$()/ Instr()/ Left$()/ Right$()/ and Len() functions, but these'examples only use the Mid$()/ Instr()/ and Len() functions.baseString$ = "Thequickbrownfoxjumpsoverthelazydog."n = 12m = 5'starting from n characters in and of m lengthPrint Mid$(baseString$, n, m)'starting from n characters in, up to the end of the stringPrint Mid$(baseString$, n)'whole string minus last characterPrint Mid$(baseString$, 1, (Len(baseString$) - 1))'starting from a known character within the string and of m lengthPrint Mid$(baseString$, Instr(baseString$, "f", 1), m)'starting from a known substring within the string and of m lengthPrint Mid$(baseString$, Instr(baseString$, "jump", 1), m)

10REM Substring20BAS$="abcdefghijklmnopqrstuvwxyz"30N=12:M=540REM Starting from N characters in50REM and of M length60SB$=MID$(BAS$,N,M)70PRINTSB$80REM Starting from N characters in,90REM up to the end of the string100SB$=MID$(BAS$,N,LEN(BAS$)-N+1)110PRINTSB$120REM Whole string minus last character130SB$=LEFT$(BAS$,LEN(BAS$)-1)140PRINTSB$150REM Starting from a known character160REM within the string and of M length170A$=BAS$:B$="b":GOSUB270180SB$=MID$(BAS$,C,M)190PRINTSB$200REM Starting from a known substring210REM within the string and of M length220A$=BAS$:B$="pq":GOSUB270230SB$=MID$(BAS$,C,M)240PRINTSB$250END260REM ** INSTR subroutine270LB=LEN(B$):C=0280FORI=1TOLEN(A$)-LB+1290IFMID$(A$,I,LB)=B$THENC=I:RETURN300NEXTI310RETURN

Output:

IfOpenConsole()DefinebaseString.s,m,nbaseString="Thequickbrownfoxjumpsoverthelazydog."n=12m=5;Displaythesubstringstartingfromncharactersinandofmlength.PrintN(Mid(baseString,n,m));Displaythesubstringstartingfromncharactersin,uptotheendofthestring.PrintN(Mid(baseString,n));orPrintN(Right(baseString,Len(baseString)-n));DisplaythesubstringwholestringminuslastcharacterPrintN(Left(baseString,Len(baseString)-1));Displaythesubstringstartingfromaknowncharacterwithinthestringandofmlength.PrintN(Mid(baseString,FindString(baseString,"b",1),m));Displaythesubstringstartingfromaknownsubstringwithinthestringandofmlength.PrintN(Mid(baseString,FindString(baseString,"ju",1),m))Print(#CRLF$+#CRLF$+"Press ENTER to exit")Input()CloseConsole()EndIf

Output:

DefStr SDefInt Istring1 = "abcdefghijklmnopqrstuvwxyz"substring = "klm"Dim Achar As String * 1Istart = 6Ilength = 10Achar = "c"'  starting from   n   characters in and of   m   length;Print Mid$(string1, Istart, Ilength)'  starting from   n   characters in,   up to the end of the string;Print Mid$(string1, Istart)Print Right$(string1, Len(string1) - Istart + 1)'  whole string minus the last character;Print Left$(string1, Len(string1) - 1)Print Mid$(string1, 1, Len(string1) - 1)'  starting from a known   character   within the string and of   m   length;Print Mid$(string1, InStr(string1, Achar), Ilength)'  starting from a known   substring   within the string and of   m   length.Print Mid$(string1, InStr(string1, substring), Ilength)End

DIMbaseStringASSTRING,subStringASSTRING,findStringASSTRINGDIMmASINTEGER,nASINTEGERbaseString="abcdefghijklmnopqrstuvwxyz"n=12m=5' starting from n characters in and of m length;subString=MID$(baseString,n,m)PRINTsubString' starting from n characters in, up to the end of the string;subString=MID$(baseString,n)PRINTsubString' whole string minus last character;subString=LEFT$(baseString,LEN(baseString)-1)PRINTsubString' starting from a known character within the string and of m length;subString=MID$(baseString,INSTR(baseString,"b"),m)PRINTsubString' starting from a known substring within the string and of m length.findString="pq"subString=MID$(baseString,INSTR(baseString,findString),m)PRINTsubString

Output:

n  = 2m  = 3s$ = "abcd"a$ = mid$(a$,n,m)                  ' starting from n characters in and of m lengtha$ = mid$(a$,n)                    ' starting from n characters in, up to the end of the stringa$ = Print mid$(a$,1,(len(a$)-1))  ' whole string minus last charactera$ = mid$(a$,instr(a$,s$,1),m)     ' starting from a known character within the string and of m lengtha$ = mid$(a$,instr(a$,s$,1), m)    ' starting from a known substring within the string and of m length.

LETbasestring$="abcdefghijklmnopqrstuvwxyz"LETn=12LETm=5!startingfromncharactersinandofmlength;PRINT(basestring$)[n:n+m-1]!startingfromncharactersin,uptotheendofthestring;PRINT(basestring$)[n:MAXNUM]!wholestringminuslastcharacter;PRINT(basestring$)[1:LEN(basestring$)-1]!startingfromaknowncharacterwithinthestringandofmlength;PRINT(basestring$)[POS(basestring$,"b"):POS(basestring$,"b")+m-1]!startingfromaknownsubString$withinthestringandofmlength.LETfindstring$="pq"PRINT(basestring$)[POS(basestring$,findstring$):POS(basestring$,findstring$)+m-1]END

PublicSubsubstring()'(1) starting from n characters in and of m length;'(2) starting from n characters in, up to the end of the string;'(3) whole string minus last character;'(4) starting from a known character within the string and of m length;'(5) starting from a known substring within the string and of m length.sentence="the last thing the man said was the"n=10:m=5'(1)Debug.PrintMid(sentence,n,5)'(2)Debug.PrintRight(sentence,Len(sentence)-n+1)'(3)Debug.PrintLeft(sentence,Len(sentence)-1)'(4)k=InStr(1,sentence,"m")Debug.PrintMid(sentence,k,5)'(5)k=InStr(1,sentence,"aid")Debug.PrintMid(sentence,k,5)EndSub

Output:

s="rosettacode.org"'starting from n characters in and of m lengthWScript.StdOut.WriteLineMid(s,8,4)'starting from n characters in, up to the end of the stringWScript.StdOut.WriteLineMid(s,8,Len(s)-7)'whole string minus last characterWScript.StdOut.WriteLineMid(s,1,Len(s)-1)'starting from a known character within the string and of m lengthWScript.StdOut.WriteLineMid(s,InStr(1,s,"c"),4)'starting from a known substring within the string and of m lengthWScript.StdOut.WriteLineMid(s,InStr(1,s,"ose"),6)

Output:

c$ = "abcdefghijklmnopqrstuvwxyz"n = 12m = 5// starting from n characters in and of m length;print mid$(c$, n, m)// starting from n characters in, up to the end of the string;print mid$(c$, n)// whole string minus last character;print left$(c$, len(c$) - 1)// starting from a known character within the string and of m length;print mid$(c$, instr(c$, "b"), m)// starting from a known substring within the string and of m length.f$ = "pq"print mid$(c$, instr(c$, f$), m)end

Output:

10LETA$="abcdefghijklmnopqrstuvwxyz"15LETn=10:LETm=720PRINTA$(nTOn+m-1)30PRINTA$(nTO)40PRINTA$(TOLEN(A$)-1)50FORi=1TOLEN(A$)60IFA$(i)="g"THENPRINTA$(iTOi+m-1):LETi=LEN(A$):GOTO7070NEXTi80LETB$="ijk"90FORi=1TOLEN(A$)-LEN(B$)+1100IFA$(iTOi+LEN(B$)-1)=B$THENPRINTA$(iTOi+m-1):LETi=LEN(A$)-LEN(B$)+1:GOTO110110NEXTi120STOP

10LETA$="abcdefghijklmnopqrstuvwxyz":LETla=LENA$20LETn=10:LETm=730PRINTA$(nTOn+m-1)40PRINTA$(nTO)50PRINTA$(TOla-1)60FORi=1TOla70IFA$(i)="g"THENPRINTA$(iTOi+m-1):LETi=la80NEXTi90LETB$="ijk":LETlb=LENb$100FORi=1TOla-lb+1110IFA$(iTOi+lb-1)=B$THENPRINTA$(iTOi+m-1):LETi=la-lb+1120NEXTi

Output:

5↑3↓"Marshmallow""shmal"3↓"Marshmallow""shmallow"¯1↓"Marshmallow""Marshmallo"(⊑∘/'m'⊸=)⊸↓"Marshmallow""mallow"(⊑∘/"sh"⊸⍷)⊸↓"Marshmallow""shmallow"

( (basestring = "The five boxing wizards jump quickly")& (n = 10)& (m = 5)  { starting from n characters in and of m length: }& @(!basestring:? [(!n+-1) ?substring [(!n+!m+-1) ?)& out$!substring  { starting from n characters in, up to the end of the string: }& @(!basestring:? [(!n+-1) ?substring)& out$!substring  { whole string minus last character: }& @(!basestring:?substring [-2 ?)& out$!substring  { starting from a known character within the string and of m length: }& (char = "w")& @(!basestring:? ([?p !char ?: ?substring [(!p+!m) ?))& out$!substring  { starting from a known substring within the string and of m length: }& (find = "iz")& @(!basestring:? ([?p !find ?: ?substring [(!p+!m) ?))& out$!substring&)

Output:

blsq ) "RosettaCode"5.+"Roset"blsq ) "RosettaCode"5.+2.-"set"blsq ) "RosettaCode""set"ss2blsq ) "RosettaCode"J"set"ss.-"settaCode"blsq ) "RosettaCode"~]"RosettaCod"blsq ) "RosettaCode"[-"osettaCode"

blsq ) "RosettaCode"{0 1 3 5}si"Roet"blsq ) "RosettaCode"{0 1 3 5}di"oetaCde"

/* * RosettaCode: Substring, C89 * * In this task display a substring: starting from n characters in and of m * length; starting from n characters in, up to the end of the string; whole * string minus last character; starting from a known character within the * string and of m length; starting from a known substring within the string * and of m length. * * This example program DOES NOT make substrings. The program simply displays * certain parts of the input string. * */#define _CRT_SECURE_NO_WARNINGS/* MSVS compilers need this */#include<stdio.h>#include<stdlib.h>#include<string.h>/* * Put no more than m characters from string to standard output. * * It is worth noting that printf("%*s",width,string) does not limit the number * of characters to be printed. * * @param string null terminated string * @param m      number of characters to display */voidputm(char*string,size_tm){while(*string&&m--)putchar(*string++);}intmain(void){charstring[]="Programs for other encodings (such as 8-bit ASCII, or EUC-JP)."intn=3;intm=4;charknownCharacter='(';charknownSubstring[]="encodings";putm(string+n-1,m);putchar('\n');puts(string+n+1);putchar('\n');putm(string,strlen(string)-1);putchar('\n');putm(strchr(string,knownCharacter),m);putchar('\n');putm(strstr(string,knownSubstring),m);putchar('\n');returnEXIT_SUCCESS;}

/* * RosettaCode: Substring, C89, Unicode * * In this task display a substring: starting from n characters in and of m * length; starting from n characters in, up to the end of the string; whole * string minus last character; starting from a known character within the * string and of m length; starting from a known substring within the string * and of m length. * * This example program DOES NOT make substrings. The program simply displays * certain parts of the input string. * */#include<stdio.h>#include<stdlib.h>#include<string.h>/* * Put all characters from string to standard output AND write newline. * BTW, _putws may not be avaliable. */voidput(wchar_t*string){while(*string)putwchar(*string++);putwchar(L'\n');}/* * Put no more than m characters from string to standard output AND newline. */voidputm(wchar_t*string,size_tm){while(*string&&m--)putwchar(*string++);putwchar(L'\n');}intmain(void){wchar_tstring[]=L"Programs for other encodings (such as 8-bit ASCII).";intn=3;intm=4;wchar_tknownCharacter=L'(';wchar_tknownSubstring[]=L"encodings";putm(string+n-1,m);put(string+n+1);putm(string,wcslen(string)-1);putm(wcschr(string,knownCharacter),m);putm(wcsstr(string,knownSubstring),m);returnEXIT_SUCCESS;}

#include<stddef.h>#include<stdio.h>#include<stdlib.h>#include<string.h>char*substring(constchar*s,size_tn,ptrdiff_tm){char*result;/* check for null s */if(NULL==s)returnNULL;/* negative m to mean 'up to the mth char from right' */if(m<0)m=strlen(s)+m-n+1;/* n < 0 or m < 0 is invalid */if(n<0||m<0)returnNULL;/* make sure string does not end before n   * and advance the "s" pointer to beginning of substring */for(;n>0;s++,n--)if(*s=='\0')/* string ends before n: invalid */returnNULL;result=malloc(m+1);if(NULL==result)/* memory allocation failed */returnNULL;result[0]=0;strncat(result,s,m);/* strncat() will automatically add null terminator                          * if string ends early or after reading m characters */returnresult;}char*str_wholeless1(constchar*s){returnsubstring(s,0,strlen(s)-1);}char*str_fromch(constchar*s,intch,ptrdiff_tm){returnsubstring(s,strchr(s,ch)-s,m);}char*str_fromstr(constchar*s,char*in,ptrdiff_tm){returnsubstring(s,strstr(s,in)-s,m);}#define TEST(A) do {\    char *r = (A);\    if (NULL == r)\      puts("--error--");\    else {\      puts(r);\      free(r);\    }\  } while(0)intmain(){constchar*s="hello world shortest program";TEST(substring(s,12,5));// get "short"TEST(substring(s,6,-1));// get "world shortest program"TEST(str_wholeless1(s));// "... progra"TEST(str_fromch(s,'w',5));// "world"TEST(str_fromstr(s,"ro",3));// "rog"return0;}

#include<iostream>#include<string>intmain(){std::strings="0123456789";intconstn=3;intconstm=4;charconstc='2';std::stringconstsub="456";std::cout<<s.substr(n,m)<<"\n";std::cout<<s.substr(n)<<"\n";std::cout<<s.substr(0,s.size()-1)<<"\n";std::cout<<s.substr(s.find(c),m)<<"\n";std::cout<<s.substr(s.find(sub),m)<<"\n";}

usingSystem;namespaceSubString{classProgram{staticvoidMain(string[]args){strings="0123456789";constintn=3;constintm=2;constcharc='3';conststringz="345";// A: starting from n characters in and of m length;Console.WriteLine(s.Substring(n,m));// B: starting from n characters in, up to the end of the string;Console.WriteLine(s.Substring(n,s.Length-n));// C: whole string minus the last character;Console.WriteLine(s.Substring(0,s.Length-1));// D: starting from a known character within the string and of m length;Console.WriteLine(s.Substring(s.IndexOf(c),m));// E: starting from a known substring within the string and of m length.Console.WriteLine(s.Substring(s.IndexOf(z),m));}}}

// B: starting from n characters in, up to the end of the string;Console.WriteLine(s[n..]);// C: whole string minus the last character;Console.WriteLine(s[..^1]);

(defstring"alphabet")(defn2)(defm4)(deflen(countstring));starting from n characters in and of m length;(println(subsstringn(+nm)));phab;starting from n characters in, up to the end of the string;(println(subsstringn));phabet;whole string minus last character;(println(subsstring0(declen)));alphabe;starting from a known character within the string and of m length;(let[pos(.indexOfstring(int\l))](println(subsstringpos(+posm))));lpha;starting from a known substring within the string and of m length.(let[pos(.indexOfstring"ph")](println(subsstringpos(+posm))));phab

identificationdivision.program-id.substring.environmentdivision.configurationsection.repository.functionallintrinsic.datadivision.working-storagesection.01original.05value"this is a string".01startingpic 99value3.01widthpic 99value8.01pospic 99.01enderpic 99.01lookingpic 99.01indicatorpic x.88foundvaluehigh-valuewhensettofalseislow-value.01look-forpic x(8).proceduredivision.substring-main.display"Original |"original"|, n = "starting" m = "widthdisplayoriginal(starting:width)displayoriginal(starting:)displayoriginal(1:length(original)-1)move"a"tolook-formove1tolookingperformfind-positioniffounddisplayoriginal(pos:width)end-ifmove"is a st"tolook-formovelength(trim(look-for))tolookingperformfind-positioniffounddisplayoriginal(pos:width)end-ifgoback.find-position.setfoundtofalsecomputeender=length(original)-lookingperformvaryingposfrom1by1untilpos>enderiforiginal(pos:looking)equallook-forthensetfoundtotrueexitperformend-ifend-perform.endprogramsubstring.

Output:

<cfoutput><cfsetstr="abcdefg"><cfsetn=2><cfsetm=3><!--- Note: In CF index starts at 1 rather than 0starting from n characters in and of m length --->#mid(str,n,m)#<!--- starting from n characters in, up to the end of the string ---><cfsetcountFromRight=Len(str)-n+1>#right(str,countFromRight)#<!--- whole string minus last character ---><cfsetallButLast=Len(str)-1>#left(str,allButLast)#<!--- starting from a known character within the string and of m length ---><cfsetstartingIndex=find("b",str)>#mid(str,startingIndex,m)#<!--- starting from a known substring within the string and of m length ---><cfsetstartingIndexSubString=find("bc",str)>#mid(str,startingIndexSubString,m)#</cfoutput>

Output:

<cfscript>str="abcdefg";n=2;m=3;// Note: In CF index starts at 1 rather than 0// starting from n characters in and of m lengthwriteOutput(mid(str,n,m));// starting from n characters in, up to the end of the stringcountFromRight=Len(str)-n+1;writeOutput(right(str,countFromRight));// whole string minus last characterallButLast=Len(str)-1;writeOutput(left(str,allButLast));// starting from a known character within the string and of m lengthstartingIndex=find("b",str);writeOutput(mid(str,startingIndex,m));// starting from a known substring within the string and of m lengthstartingIndexSubString=find("bc",str);writeOutput(mid(str,startingIndexSubString,m));</cfscript>

Output:

(let((string"0123456789")(n2)(m3)(start#\5)(substring"34"))(list(subseqstringn(+nm))(subseqstringn)(subseqstring0(1-(lengthstring)))(let((pos(positionstartstring)))(subseqstringpos(+posm)))(let((pos(searchsubstringstring)))(subseqstringpos(+posm)))))

MODULESubstrings;IMPORTStdLog,Strings;PROCEDUREDo*;CONSTaStr="abcdefghijklmnopqrstuvwxyz";VARstr:ARRAY128OFCHAR;pos:INTEGER;BEGINStrings.Extract(aStr,3,10,str);StdLog.String("from 3, 10 characters:> ");StdLog.String(str);StdLog.Ln;Strings.Extract(aStr,3,LEN(aStr)-3,str);StdLog.String("from 3, until the end:> ");StdLog.String(str);StdLog.Ln;Strings.Extract(aStr,0,LEN(aStr)-1,str);StdLog.String("whole string but last:> ");StdLog.String(str);StdLog.Ln;Strings.Find(aStr,'d',0,pos);Strings.Extract(aStr,pos+1,10,str);StdLog.String("from 'd', 10 characters:> ");StdLog.String(str);StdLog.Ln;Strings.Find(aStr,"de",0,pos);Strings.Extract(aStr,pos+LEN("de"),10,str);StdLog.String("from 'de', 10 characters:> ");StdLog.String(str);StdLog.Ln;ENDDo;ENDSubstrings.

Output:

defsubstring_demo(string,n,m,known_character,known_substring)n-=1putsstring[n...n+m]putsstring[n...]putsstring.rchopknown_character_index=string.index(known_character).not_nil!putsstring[known_character_index...known_character_index+m]known_substring_index=string.index(known_substring).not_nil!putsstring[known_substring_index...known_substring_index+m]endsubstring_demo("crystalline",3,5,'t',"st")

Output:

importstd.stdio,std.string;voidmain(){consts="the quick brown fox jumps over the lazy dog";enumn=5,m=3;writeln(s[n..n+m]);writeln(s[n..$]);writeln(s[0..$-1]);consti=s.indexOf("q");writeln(s[i..i+m]);constj=s.indexOf("qu");writeln(s[j..j+m]);}

Output:

;starting from n characters in and of m length;SUB_STR = STR(n:m) ;starting from n characters in, up to the end of the string;SUB_STR = STR(n,$LEN(STR)) ;whole string minus last character;SUB_STR = STR(1,%TRIM(STR)-1) ;starting from a known character f within the string and of m length;;starting from a known substring f within the string and of m length.SUB_STR = STR(%INSTR(1,STR,f):m)

programShowSubstring;{$APPTYPE CONSOLE}usesSysUtils;consts='0123456789';n=3;m=4;c='2';sub='456';beginWriteln(Copy(s,n,m));// starting from n characters in and of m length;Writeln(Copy(s,n,Length(s)));// starting from n characters in, up to the end of the string;Writeln(Copy(s,1,Length(s)-1));// whole string minus last character;Writeln(Copy(s,Pos(c,s),m));// starting from a known character within the string and of m length;Writeln(Copy(s,Pos(sub,s),m));// starting from a known substring within the string and of m length.end.

Output:

#Forbrevity,wewilluseatable-valuedfunctionfordefiningthesamplestring(s):createorreplacefunctions()astable(select'一二三四五六七八九十'ass);#startingfromncharactersinandofmlength:s[n:n+m-1]selects[1:2]froms();#startingfromncharactersin,uptotheendofthestring:s[n:]selects[9:]froms();#wholestringminusthelastcharacter:.[:-2]selects[0:-2]froms();#startingfromaknowncharacterwithinthestringandofmlength,say2:selects[ix:ix+(2-1)]from(selects,position('五'ins)asixfroms());#startingfromaknownsubstringwithinthestringandofmlength,say2:selects[ix:ix+(2-1)]from(selects,position('五六'ins)asixfroms());#Forclaritywe'll use DuckDB's'list'outputmode:.modelist

Output:

let s = "0123456789"let n = 3let m = 2let c = '3'let z = "345" // A: starting from n characters in and of m length;print(s.Substring(n, m))// B: starting from n characters in, up to the end of the string;print(s[n..])// C: whole string minus the last character;print(s[..-1])// D: starting from a known character within the string and of m length;print(s.Substring(s.IndexOf(c),m))// E: starting from a known substring within the string and of m length.print(s.Substring(s.IndexOf(z),m))

def string := "aardvarks"def n := 4def m := 4println(string(n, n + m))println(string(n))println(string(0, string.size() - 1))println({string(def i := string.indexOf1('d'), i + m)})println({string(def i := string.startOf("ard"), i + m)})

Output:

a$ = timestr systimeprint substr a$ 12 5print substr a$ 12 99#a$ = "Hallo Österreich!"print substr a$ 1 (len a$ - 1)#c$ = "Ö"m = 2i = 1while substr a$ i 1 <> c$   i += 1.print substr a$ i m#c$ = "re"m = 5i = 1while substr a$ i len c$ <> c$   i += 1.print substr a$ i m

/* In this task display a substring:1.       starting from n characters in and of m length;2.       starting from n characters in, up to the end of the string;3.       whole string minus last character;4.       starting from a known character within the string and of m length;5.       starting from a known substring within the string and of m length.*/IMPORTSTD;//imports a standard string libraryTheString:='abcdefghij';CharIn:=3;//nStrLength:=4;//mKnownChar:='f';KnownSub:='def';FindKnownChar:=STD.Str.Find(TheString,KnownChar,1);FindKnownSub:=STD.Str.Find(TheString,KnownSub,1);OUTPUT(TheString[Charin..CharIn+StrLength-1]);//task1OUTPUT(TheString[Charin..]);//task2OUTPUT(TheString[1..LENGTH(TheString)-1]);//task3OUTPUT(TheString[FindKnownChar..FindKnownChar+StrLength-1]);//task4OUTPUT(TheString[FindKnownSub..FindKnownSub+StrLength-1]);//task5/* OUTPUTS:   defg   cdefghij   abcdefghi   fghi   defg*/

module Substrings {    void run(String[] args = []) {        @Inject Console console;        if (args.size < 4) {            console.print(                $|                 |Usage:                 |                 |  xec Substrings <str> <offset> <count> <substr>                 |            );            return;        }        String s   = args[0];        Int    n   = new Int(args[1]);        Int    m   = new Int(args[2]);        String sub = args[3];        Char   c   = sub[0];        console.print($|                       |{s                   .quoted()=}                       |{substring(s, n, m  ).quoted()=}                       |{substring(s, n     ).quoted()=}                       |{substring(s        ).quoted()=}                       |{substring(s, c, m  ).quoted()=}                       |{substring(s, sub, m).quoted()=}                       |                     );    }    // starting from n characters in and of m length    static String substring(String s, Int n, Int m) {        assert 0 <= n <= n+m;        return n < s.size ? s[n..<(n+m).notGreaterThan(s.size)] : "";    }    // starting from n characters in, up to the end of the string    static String substring(String s, Int n) {        assert 0 <= n;        return s.substring(n);    }    // whole string minus the last character    static String substring(String s) {        return s.size > 1 ? s[0..<s.size-1] : "";    }    // starting from a known character within the string and of m length    static String substring(String s, Char c, Int m){        assert 0 <= m;        return substring(s, s.indexOf(c) ?: 0, m);    }    // starting from a known substring within the string and of m length    static String substring(String s, String sub, Int m){        assert 0 <= m;        return substring(s, s.indexOf(sub) ?: 0, m);    }}

Output:

# by Artyom BologovHt0t0t0t01s/..\(.\{2\}\).*/\1/2s/..\(.*\)/\1/3s/.$//4s/.*\(c.\{2\}\).*/\1/5s/.*\(cd.\{3\}\).*/\1/,pQ

Output:

#import <Foundation/Foundation.h>intmain()autoreleasepoolstr:='abcdefgh'n:=2m:=3Log('%@',str[0..str.length-1])// abcdefghLog('%@',str[n..m])// cdLog('%@',str[n..str.length-1])// cdefghLog('%@',str.substringFromIndex:n)// cdefghLog('%@',str[(str.rangeOfString:'b').location..m])// bcdreturn0

classRC_SUBSTRING_TEST_SETinheritTEST_SET_SUPPORTfeature-- Test routinesrc_substring_test-- New test routinenotetask:"[Display a substring:- starting from   n   characters in and of   m   length;- starting from   n   characters in,   up to the end of the string;- whole string minus the last character;- starting from a known   character   within the string and of   m   length;- starting from a known   substring   within the string and of   m   length.]"testing:"execution/isolated","execution/serial"localstr,str2:STRINGn,m:INTEGERdostr:="abcdefgh"m:=2-- starting from   n   characters in and of   m   length;n:=str.index_of('e',1)str2:=str.substring(n,n+m-1)assert_strings_equal("start_n","ef",str2)assert_integers_equal("m_length_1",2,str2.count)-- starting from   n   characters in,   up to the end of the string;str2:=str.substring(n,n+(str.count-n))assert_strings_equal("start_n_to_end","efgh",str2)assert_integers_equal("len_1a",4,str2.count)-- whole string minus the last character;str2:=str.substring(1,str.count-1)assert_strings_equal("one_less_than_whole","abcdefg",str2)assert_integers_equal("len_1b",7,str2.count)-- starting from a known   character   within the string and of   m   length;n:=str.index_of('d',1)str2:=str.substring(n,n+m-1)assert_strings_equal("known_char","de",str2)assert_integers_equal("m_length_2",2,str2.count)-- starting from a known   substring   within the string and of   m   length.n:=str.substring_index("bc",1)str2:=str.substring(n,n+m-1)assert_strings_equal("known_substr","bc",str2)assert_integers_equal("m_length_3",2,str2.count)endend