A-M baby

Task/Binary-strings/Factor/binary-strings-1.factor

@@ -0,0 +1 @@
+"Hello, byte-array!" utf8 encode .

Task/Binary-strings/Factor/binary-strings-2.factor

@@ -0,0 +1 @@
+B{ 147 250 150 123 } shift-jis decode .

Task/Binary-strings/Icon/binary-strings-1.icon

@@ -0,0 +1,14 @@
+s := "\x00" # strings can contain any value, even nulls
+s := "abc"             # create a string
+s := &null             # destroy a string (well sbsnfon it for garbage collection)
+v := s                 # assignment
+s == t                 # expression s equals t
+s << t                 # expression s less than t
+s <<= t                # expression s less than or equal to t
+v := s                 # strings are immutable, no copying or cloning are needed
+s == ""                # equal empty string
+*s = 0                 # string length is zero
+s ||:= "a"             # append a byte "a" to s via concatenation
+t := s[2+:3]           # t is set to position 2 for 3 characters
+s := replace(s,s2,s3)  # IPL replace function
+s := s1 || s2          # concatenation (joining) of strings

Task/Binary-strings/Icon/binary-strings-2.icon

@@ -0,0 +1,16 @@
+procedure replace(s1, s2, s3)		#: string replacement
+   local result, i
+
+   result := ""
+   i := *s2
+   if i = 0 then fail			# would loop on empty string
+
+   s1 ? {
+      while result ||:= tab(find(s2)) do {
+         result ||:= s3
+         move(i)
+         }
+      return result || tab(0)
+      }
+
+end

Task/Binary-strings/J/binary-strings-1.j

@@ -0,0 +1 @@
+   name=: ''

Task/Binary-strings/J/binary-strings-10.j

@@ -0,0 +1 @@
+   'string1','string2'

Task/Binary-strings/J/binary-strings-11.j

@@ -0,0 +1 @@
+   n{a.

Task/Binary-strings/J/binary-strings-12.j

@@ -0,0 +1 @@
+1 0 255{a.

Task/Binary-strings/J/binary-strings-2.j

@@ -0,0 +1 @@
+   name=: 0

Task/Binary-strings/J/binary-strings-3.j

@@ -0,0 +1 @@
+   name=: 'value'

Task/Binary-strings/J/binary-strings-4.j

@@ -0,0 +1 @@
+   name1 -: name2

Task/Binary-strings/J/binary-strings-5.j

@@ -0,0 +1,2 @@
+   name1= 'example'
+   name2= name1

Task/Binary-strings/J/binary-strings-6.j

@@ -0,0 +1 @@
+   0=#string

Task/Binary-strings/J/binary-strings-7.j

@@ -0,0 +1,3 @@
+   string=: 'example'
+   byte=: DEL
+   string=: string,byte

Task/Binary-strings/J/binary-strings-8.j

@@ -0,0 +1 @@
+   3{.5}.'The quick brown fox runs...'

Task/Binary-strings/J/binary-strings-9.j

@@ -0,0 +1,2 @@
+require 'strings'
+'The quick brown fox runs...' rplc ' ';' !!! '

Task/Binary-strings/Liberty-BASIC/binary-strings.liberty

@@ -0,0 +1,33 @@
+'string creation
+s$ = "Hello, world!"
+
+'string destruction - not needed because of garbage collection
+s$ = ""
+
+'string comparison
+s$ = "Hello, world!"
+If s$ = "Hello, world!" then print "Equal Strings"
+
+'string copying
+a$ = s$
+
+'check If empty
+If s$ = "" then print "Empty String"
+
+'append a byte
+s$ = s$ + Chr$(33)
+
+'extract a substring
+a$ = Mid$(s$, 1, 5)
+
+'replace bytes
+a$ = "Hello, world!"
+for i = 1 to len(a$)
+    if mid$(a$,i,1)="l" then
+        a$=left$(a$,i-1)+"L"+mid$(a$,i+1)
+    end if
+next
+print a$
+
+'join strings
+s$ = "Good" + "bye" + " for now."

Task/Binary-strings/Mathematica/binary-strings.mathematica

@@ -0,0 +1,19 @@
+(* String creation and destruction *)  BinaryString = {}; BinaryString = . ;
+(* String assignment *)   BinaryString1 = {12,56,82,65} ,  BinaryString2 = {83,12,56,65}
+-> {12,56,82,65}
+-> {83,12,56,65}
+(* String comparison *)   BinaryString1 === BinaryString2
+-> False
+(* String cloning and copying *)  BinaryString3 = BinaryString1
+-> {12,56,82,65}
+(* Check if a string is empty *)  BinaryString3 === {}
+-> False
+(* Append a byte to a string *)   AppendTo[BinaryString3, 22]
+-> {12,56,82,65,22}
+(* Extract a substring from a string *)  Take[BinaryString3, {2, 5}]
+-> {56,82,65,22}
+(* Replace every occurrence of a byte (or a string) in a string with another string *)
+BinaryString3 /. {22 -> Sequence[33, 44]}
+-> {12,56,82,65,33,44}
+(* Join strings *)  BinaryString4 = Join[BinaryString1 , BinaryString2]
+-> {12,56,82,65,83,12,56,65}