How to resolve the algorithm Named parameters step by step in the E programming language

Published on 12 May 2024 09:40 PM
#E

How to resolve the algorithm Named parameters step by step in the E programming language

Table of Contents

Problem Statement

Create a function which takes in a number of arguments which are specified by name rather than (necessarily) position, and show how to call the function. If the language supports reordering the arguments or optionally omitting some of them, note this. Note: See also:

Let's start with the solution:

Step by Step solution about How to resolve the algorithm Named parameters step by step in the E programming language

Source code in the e programming language

def printName([=> first := null, => last := null]) {
    if (last == null) {
        print("?")
    } else {
        print(last)
    }
    if (first != null) {
        print(", ")
        print(first)
    }
}

? printName(["first" => "John"])
?, John

? printName(["last" => "Doe"])
Doe

? printName(["first" => "John", "last" => "Doe"])
Doe, John

You may also check:How to resolve the algorithm Pell's equation step by step in the Sidef programming language
You may also check:How to resolve the algorithm Fibonacci word/fractal step by step in the Fōrmulæ programming language
You may also check:How to resolve the algorithm Logical operations step by step in the Brat programming language
You may also check:How to resolve the algorithm Scope modifiers step by step in the Ruby programming language
You may also check:How to resolve the algorithm Pell numbers step by step in the Common Lisp programming language