Functions

A q function is delimited with open and closed curly brackets. All predefined q functions can be used in both infix or prefix notations, whereas user‐defined functions must be called using a prefix notation. Using a consistent namespace also prevents us from naming conflicts and accidentally overrid...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Format: Buchkapitel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 79
container_issue
container_start_page 57
container_title
container_volume
description A q function is delimited with open and closed curly brackets. All predefined q functions can be used in both infix or prefix notations, whereas user‐defined functions must be called using a prefix notation. Using a consistent namespace also prevents us from naming conflicts and accidentally overriding existing functions one may have. Adverbs are higher‐order functions that modify the behaviour of functions applied to lists. The verbs @ and . apply a multivariate mapping to a list of arguments, written in prefix or infix form. The chapter describes the differences between the two notations. The concept of try‐catch, or protected evaluation, is implemented with the same @ and . verbs as for the apply functions covered. The chapter presents a few more native functions which cover basic time series operations. The functions are divided into two classes: aggregators and uniform functions. The chapter concludes by summarising the conventions user‐defined functions.
doi_str_mv 10.1002/9781119404729.ch3
format Book Chapter
fullrecord <record><control><sourceid>wiley</sourceid><recordid>TN_cdi_wiley_ebooks_10_1002_9781119404729_ch3_ch3</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10.1002/9781119404729.ch3</sourcerecordid><originalsourceid>FETCH-wiley_ebooks_10_1002_9781119404729_ch3_ch33</originalsourceid><addsrcrecordid>eNpjYJA0NNAzNDAw0rc0tzA0NLQ0MTAxN7LUS84wZmTgggtEMDPwIikwNeBg4C0uzjIAajQyNrU0NuBk4HQrzUsuyczPK-ZhYE1LzClO5YXS3AyGbq4hzh665Zk5qZXxqUn5-dnF8YYG8SB741HsjQfaC8LG3Ay6WPSgqq3KLACrL0hJMybHDgDuv0H3</addsrcrecordid><sourcetype>Enrichment Source</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>Functions</title><source>Ebook Central - Academic Complete</source><source>O'Reilly Online Learning: Academic/Public Library Edition</source><contributor>Novotny, Jan ; Galiotos, Aris ; Bilokon, Paul A ; Délèze, Frédéric</contributor><creatorcontrib>Novotny, Jan ; Galiotos, Aris ; Bilokon, Paul A ; Délèze, Frédéric</creatorcontrib><description>A q function is delimited with open and closed curly brackets. All predefined q functions can be used in both infix or prefix notations, whereas user‐defined functions must be called using a prefix notation. Using a consistent namespace also prevents us from naming conflicts and accidentally overriding existing functions one may have. Adverbs are higher‐order functions that modify the behaviour of functions applied to lists. The verbs @ and . apply a multivariate mapping to a list of arguments, written in prefix or infix form. The chapter describes the differences between the two notations. The concept of try‐catch, or protected evaluation, is implemented with the same @ and . verbs as for the apply functions covered. The chapter presents a few more native functions which cover basic time series operations. The functions are divided into two classes: aggregators and uniform functions. The chapter concludes by summarising the conventions user‐defined functions.</description><identifier>ISBN: 9781119404750</identifier><identifier>ISBN: 1119404754</identifier><identifier>EISBN: 111940472X</identifier><identifier>EISBN: 9781119404729</identifier><identifier>DOI: 10.1002/9781119404729.ch3</identifier><language>eng</language><publisher>Chichester, UK: John Wiley &amp; Sons, Ltd</publisher><subject>adverbs ; aggregators ; apply functions ; namespace ; protected evaluation ; uniform functions ; user‐defined functions</subject><ispartof>Machine Learning and Big Data with kdb+/q, 2019, p.57-79</ispartof><rights>2020 Jan Novotny, Paul A. Bilokon, Aris Galiotos and Frédéric Délèze.</rights><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>779,780,784,793,27925</link.rule.ids></links><search><contributor>Novotny, Jan</contributor><contributor>Galiotos, Aris</contributor><contributor>Bilokon, Paul A</contributor><contributor>Délèze, Frédéric</contributor><title>Functions</title><title>Machine Learning and Big Data with kdb+/q</title><description>A q function is delimited with open and closed curly brackets. All predefined q functions can be used in both infix or prefix notations, whereas user‐defined functions must be called using a prefix notation. Using a consistent namespace also prevents us from naming conflicts and accidentally overriding existing functions one may have. Adverbs are higher‐order functions that modify the behaviour of functions applied to lists. The verbs @ and . apply a multivariate mapping to a list of arguments, written in prefix or infix form. The chapter describes the differences between the two notations. The concept of try‐catch, or protected evaluation, is implemented with the same @ and . verbs as for the apply functions covered. The chapter presents a few more native functions which cover basic time series operations. The functions are divided into two classes: aggregators and uniform functions. The chapter concludes by summarising the conventions user‐defined functions.</description><subject>adverbs</subject><subject>aggregators</subject><subject>apply functions</subject><subject>namespace</subject><subject>protected evaluation</subject><subject>uniform functions</subject><subject>user‐defined functions</subject><isbn>9781119404750</isbn><isbn>1119404754</isbn><isbn>111940472X</isbn><isbn>9781119404729</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2019</creationdate><recordtype>book_chapter</recordtype><sourceid/><recordid>eNpjYJA0NNAzNDAw0rc0tzA0NLQ0MTAxN7LUS84wZmTgggtEMDPwIikwNeBg4C0uzjIAajQyNrU0NuBk4HQrzUsuyczPK-ZhYE1LzClO5YXS3AyGbq4hzh665Zk5qZXxqUn5-dnF8YYG8SB741HsjQfaC8LG3Ay6WPSgqq3KLACrL0hJMybHDgDuv0H3</recordid><startdate>20191104</startdate><enddate>20191104</enddate><general>John Wiley &amp; Sons, Ltd</general><scope/></search><sort><creationdate>20191104</creationdate><title>Functions</title></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-wiley_ebooks_10_1002_9781119404729_ch3_ch33</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2019</creationdate><topic>adverbs</topic><topic>aggregators</topic><topic>apply functions</topic><topic>namespace</topic><topic>protected evaluation</topic><topic>uniform functions</topic><topic>user‐defined functions</topic><toplevel>online_resources</toplevel></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Novotny, Jan</au><au>Galiotos, Aris</au><au>Bilokon, Paul A</au><au>Délèze, Frédéric</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Functions</atitle><btitle>Machine Learning and Big Data with kdb+/q</btitle><date>2019-11-04</date><risdate>2019</risdate><spage>57</spage><epage>79</epage><pages>57-79</pages><isbn>9781119404750</isbn><isbn>1119404754</isbn><eisbn>111940472X</eisbn><eisbn>9781119404729</eisbn><abstract>A q function is delimited with open and closed curly brackets. All predefined q functions can be used in both infix or prefix notations, whereas user‐defined functions must be called using a prefix notation. Using a consistent namespace also prevents us from naming conflicts and accidentally overriding existing functions one may have. Adverbs are higher‐order functions that modify the behaviour of functions applied to lists. The verbs @ and . apply a multivariate mapping to a list of arguments, written in prefix or infix form. The chapter describes the differences between the two notations. The concept of try‐catch, or protected evaluation, is implemented with the same @ and . verbs as for the apply functions covered. The chapter presents a few more native functions which cover basic time series operations. The functions are divided into two classes: aggregators and uniform functions. The chapter concludes by summarising the conventions user‐defined functions.</abstract><cop>Chichester, UK</cop><pub>John Wiley &amp; Sons, Ltd</pub><doi>10.1002/9781119404729.ch3</doi><tpages>23</tpages></addata></record>
fulltext fulltext
identifier ISBN: 9781119404750
ispartof Machine Learning and Big Data with kdb+/q, 2019, p.57-79
issn
language eng
recordid cdi_wiley_ebooks_10_1002_9781119404729_ch3_ch3
source Ebook Central - Academic Complete; O'Reilly Online Learning: Academic/Public Library Edition
subjects adverbs
aggregators
apply functions
namespace
protected evaluation
uniform functions
user‐defined functions
title Functions
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T14%3A08%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-wiley&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Functions&rft.btitle=Machine%20Learning%20and%20Big%20Data%20with%20kdb+/q&rft.au=Novotny,%20Jan&rft.date=2019-11-04&rft.spage=57&rft.epage=79&rft.pages=57-79&rft.isbn=9781119404750&rft.isbn_list=1119404754&rft_id=info:doi/10.1002/9781119404729.ch3&rft_dat=%3Cwiley%3E10.1002/9781119404729.ch3%3C/wiley%3E%3Curl%3E%3C/url%3E&rft.eisbn=111940472X&rft.eisbn_list=9781119404729&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true