SWI-Prolog Did You Know Did you know? SWI-Prolog has a Graphic Debugger Search Documentation:
Predicate string_concat/3
Availability:built-in
string_concat(?String1, ?String2, ?String3)
Similar to atom_concat/3, but the unbound argument will be unified with a string object rather than an atom. Also, if both String1 and String2 are unbound and String3 is bound to text, it breaks String3, unifying the start with String1 and the end with String2 as append does with lists. Note that this is not particularly fast on long strings, as for each redo the system has to create two entirely new strings, while the list equivalent only creates a single new list-cell and moves some pointers around.
Tags are associated to your profile if you are logged in
Tags:
LogicalCaptain said (2021-06-12T10:24:22):0 upvotes 0 0 downvotes
Picture of user LogicalCaptain.

Your choices

Your choice of predicate is as follows:

Two concatenable terms as input (can split)

Two more general concatenable terms as input (cannot split because arguments 1 and 2 are too general)

A list of concatenable terms as input (never split)

  • atomic_list_concat/2 - generates atom at argument 2. Refuses string at argument 2 in accept mode (that's likely a bug).
  • atomics_to_string/2 - generates string at argument 2. Refuses atom at argument 2 in accept mode (that's likely a bug).

A list of concatenable terms as input, and intersperse another string (can split at interspersed string)

  • atomic_list_concat/3 - concatenate with separator ("intersperse", "join"). Refuses string at argument 3 in accept mode (that's likely a bug).
  • atomics_to_string/3 - concatenate with separator ("intersperse", "join"). Refuses atom at argument 3 in accept mode (that's likely a bug).