Search results

Jump to navigation Jump to search
Results 1 – 21 of 45
Advanced search

Search in namespaces:

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • == Example == ...n example from [[Clojure]]:<ref>[http://clojuredocs.org/clojure_core/1.2.0/clojure.core/map map] from ClojureDocs</ref> ...
    11 KB (1,619 words) - 11:52, 30 April 2025
  • ...rivative]], also a function. Higher-order functions should not be confused with other uses of the word "functor" throughout mathematics, see [[Functor (dis ...ived, higher-order functions that take one function as argument are values with types of the form <math>(\tau_1\to\tau_2)\to\tau_3</math>. ...
    24 KB (3,173 words) - 18:43, 23 March 2025
  • ...s the ability to create multiple [[subprogram|functions]] of the same name with different implementations. Calls to an overloaded function will run a speci ...arameter]], whereas the former does not require a parameter, and is called with an empty parameter field. A common error would be to assign a default value ...
    12 KB (1,746 words) - 07:25, 27 May 2025
  • Consider the following example in mathematical [[set-builder notation]]. In this annotated version of the example: ...
    22 KB (2,951 words) - 03:26, 3 March 2025
  • ...nt]]s (IDEs).<ref>Server mode command-line: <code>haxe --wait [host:]port</code></ref> ...208134720/http://ncannasse.fr/blog/haxe_interview |url-status=dead}}</ref> Code written in Haxe can be [[source-to-source compiler|compiled]] into [[JavaSc ...
    10 KB (1,375 words) - 11:20, 29 May 2025
  • ...[[JVM]]-based language ([[Java (programming language)|Java]], [[JRuby]], [[Clojure]], etc.), hiding the underlying complexity of [[MapReduce]] jobs. It is op ...hadoop-and-cascading/ Blog post by Etsy describing their use of Cascading with Hadoop]</ref>{{Better source needed|date=October 2013}} Developers use Cas ...
    10 KB (1,325 words) - 21:37, 30 April 2025
  • For example, the expression "5 mod 2" evaluates to 1, because 5 divided by 2 has a [[qu Although typically performed with {{math|''a''}} and {{math|''n''}} both being [[integer]]s, many computing s ...
    46 KB (6,243 words) - 13:39, 24 June 2025
  • ...tements which also pass parameters, and can be uniformly coded as [machine code] JUMP instructions."<ref name="aim-443" /> ...Generator.html#sibling-call-optimization|title=The LLVM Target-Independent Code Generator — LLVM 7 documentation|website=llvm.org}}</ref> ...
    41 KB (5,881 words) - 10:00, 1 June 2025
  • ...e referred to as "contracts", in accordance with a [[conceptual metaphor]] with the conditions and obligations of business contracts. ...fore, or while, processing the ''client component'''s request) and replies with a suitable error message if not. ...
    16 KB (2,265 words) - 19:57, 12 November 2025
  • ...allows computing representations of mathematical objects to be manipulated with the same syntax as on paper. ...nction calls. For example, consider variables {{code|a}}, {{code|b}} and {{code|c}} of some user-defined type, such as [[Matrix (mathematics)|matrices]]: ...
    23 KB (3,214 words) - 01:53, 16 November 2025
  • ...ave submitted code samples from various programming languages. When adding code samples, *please* include no extraneous characters or symbols that are not ...le to compile without error, when copied and pasted directly into a source code file. ...
    125 KB (16,034 words) - 12:50, 22 February 2025
  • ...a system used and further developed by both scientists and artists working with sound. It is a [[dynamic programming language]] providing a framework for [ Starting with version 3, the SuperCollider environment has been split into two components ...
    16 KB (2,062 words) - 17:14, 15 March 2025
  • ...; they are treated like ordinary [[variable (computer science)|variable]]s with a [[function type]].<ref>{{cite journal |title=The Implementation of Lua 5. ...ich the use of [[higher-order function]]s is a standard practice. A simple example of a higher-ordered function is the ''[[map (higher-order function)|map]]'' ...
    28 KB (3,724 words) - 16:04, 30 June 2025
  • {{Short description|Validating the behavior of isolated source code}} ...e''' testing, is a form of [[software testing]] by which isolated [[source code]] is tested to validate expected behavior.<ref name="kolawa">{{cite book | ...
    35 KB (4,967 words) - 23:09, 1 June 2025
  • ...the object's state appears unchanging from an external point of view. For example, an object that uses <!-- ...re by default immutable, and must be explicitly marked with <code>mutable</code> to be so. ...
    33 KB (4,780 words) - 16:53, 24 January 2025
  • ...nterpreted contents of the remaining arguments, and outputs the result.|An example call to the printf function]] ...format specifier found. A format specifier starts with a [[percent sign|{{code|%}}]] character and has one or more following characters that specify how t ...
    35 KB (5,059 words) - 14:06, 24 May 2025
  • ...nnaire-Sergeant |first=Ambrose |title=A Practical Optional Type System for Clojure|publisher=The University of Western Australia |year=2012}}</ref> [[Rust (pr ...ess-date=2011-08-15}}</ref> and set of tools supporting development on and with Racket.<ref>{{cite web |title=Welcome to Racket |url=http://docs.racket-lan ...
    35 KB (4,709 words) - 22:48, 24 May 2025
  • ...code in the function is executed by ''calling'' it – executing a piece of code that references its ''name''. This transfers control temporarily to the cal ...e at the function call site is not sufficient for identifying the block of code to be executed. Instead, the number and type of the arguments to the functi ...
    52 KB (7,008 words) - 11:40, 28 May 2025
  • ...ord spotting]], [[computational linguistics]], and [[bioinformatics]]. For example, in [[speech-to-text]] (speech recognition), the acoustic signal is treated ...sonal History]</ref> It has, however, a history of [[multiple invention]], with at least seven independent discoveries, including those by Viterbi, [[Needl ...
    20 KB (2,891 words) - 22:57, 10 April 2025
  • ...stituent parts, building up a return value. Typically, a fold is presented with a combining [[Subroutine|function]], a top [[Node (computer science)|node]] ...cture, whereas a fold recursively breaks that structure down, replacing it with the results of applying a combining function at each node on its [[Terminal ...
    39 KB (5,509 words) - 17:28, 5 December 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)