How to resolve the algorithm Generic swap step by step in the NetRexx programming language
How to resolve the algorithm Generic swap step by step in the NetRexx programming language
Table of Contents
Problem Statement
Write a generic swap function or operator which exchanges the values of two variables (or, more generally, any two storage places that can be assigned), regardless of their types. If your solution language is statically typed please describe the way your language provides genericity. If variables are typed in the given language, it is permissible that the two variables be constrained to having a mutually compatible type, such that each is permitted to hold the value previously stored in the other without a type violation. That is to say, solutions do not have to be capable of exchanging, say, a string and integer value, if the underlying storage locations are not attributed with types that permit such an exchange. Generic swap is a task which brings together a few separate issues in programming language semantics. Dynamically typed languages deal with values in a generic way quite readily, but do not necessarily make it easy to write a function to destructively swap two variables, because this requires indirection upon storage places or upon the syntax designating storage places. Functional languages, whether static or dynamic, do not necessarily allow a destructive operation such as swapping two variables regardless of their generic capabilities. Some static languages have difficulties with generic programming due to a lack of support for (Parametric Polymorphism). Do your best!
Let's start with the solution:
Step by Step solution about How to resolve the algorithm Generic swap step by step in the NetRexx programming language
Source code in the netrexx programming language
/* NetRexx */
options replace format comments java crossref symbols nobinary
-- Simple values with no spaces can be swapped without the use of a parse template
lval = 27
rval = 5
say 'Before - 'lval' 'rval' '
parse (lval rval) rval lval
say 'After - 'lval' 'rval' '
say
-- More complex data needs to use some form of parsing template
lval = 'This value started on the left'
rval = 'This value started on the right'
dlm = 12x80facebead01 -- some delimiting value that is unlikely to occur in the LVAL to be swapped
say 'Before - 'lval' 'rval' '
parse (lval || dlm || rval) rval (dlm) lval
say 'After - 'lval' 'rval' '
say
return
You may also check:How to resolve the algorithm Sequence: smallest number with exactly n divisors step by step in the Perl programming language
You may also check:How to resolve the algorithm Yin and yang step by step in the Ada programming language
You may also check:How to resolve the algorithm Conditional structures step by step in the Picat programming language
You may also check:How to resolve the algorithm Faulhaber's triangle step by step in the Perl programming language
You may also check:How to resolve the algorithm Matrix multiplication step by step in the Arturo programming language