2,951
edits
Grade: Difference between revisions
Jump to navigation
Jump to search
m
→History: Clarify
m (→History) |
m (→History: Clarify) |
||
| Line 107: | Line 107: | ||
Grade up and down were defined with the standard glyphs <syntaxhighlight lang=apl inline>⍋⍒</syntaxhighlight> and [[index origin]]-dependent definition in [[APL\360]]. By 1968 it had been defined to grade along a particular [[function axis|axis]], defaulting to the last;<ref>[[IBM]]. [http://www.softwarepreservation.org/projects/apl/Manuals/APL360CONTRIBUTEDPROGRAMLIBRARY/view Contributed Program Library: APL\360]. 1968.</ref> however, this extension has often not been maintained in later APLs. | Grade up and down were defined with the standard glyphs <syntaxhighlight lang=apl inline>⍋⍒</syntaxhighlight> and [[index origin]]-dependent definition in [[APL\360]]. By 1968 it had been defined to grade along a particular [[function axis|axis]], defaulting to the last;<ref>[[IBM]]. [http://www.softwarepreservation.org/projects/apl/Manuals/APL360CONTRIBUTEDPROGRAMLIBRARY/view Contributed Program Library: APL\360]. 1968.</ref> however, this extension has often not been maintained in later APLs. | ||
In 1980 [[SHARP APL]] extended Grade to sort the [[major cell]]s of its argument, and introduced the dyadic Grade functions,<ref>Peter Wooster. "Extended Upgrade and Downgrade". SATN-35. 1980-09-15.</ref> following a suggestion by Howard Smith of [[IBM]] motivated by string sorting.<ref>Howard J. Smith. [https://dl.acm.org/doi/10.1145/800136.804449 Sorting - a new/old problem] at [[APL79]].</ref> While sorting cells is consistent with [[leading axis theory]], it predates the beginning of this model's development in 1982. The extension to monadic Grade is incompatible with APL\360's definition of grading along an axis. Both extensions were widely adopted at the time, for example in the first versions of [[Dyalog APL]].<ref>Stephen Taylor. [http://archive.vector.org.uk/art10013790 "How we got here"]. [[Vector journal]] Volume 23 special supplement "Dyalog at 25". 2008-09.</ref> Newer dialects such as [[Kap]] often don't implement dyadic Grade (which was also left out of [[J]] in favor of [[Sort by]]). | In 1980 [[SHARP APL]] extended Grade to sort the [[major cell]]s of its argument, and introduced the dyadic Grade functions,<ref>Peter Wooster. "Extended Upgrade and Downgrade". SATN-35. 1980-09-15.</ref> following a suggestion by Howard Smith of [[IBM]] motivated by string sorting.<ref>Howard J. Smith. [https://dl.acm.org/doi/10.1145/800136.804449 Sorting - a new/old problem] at [[APL79]].</ref> While sorting cells is consistent with [[leading axis theory]], it predates the beginning of this model's development in 1982. The extension to monadic Grade is incompatible with APL\360's definition of grading along an axis. Both SHARP extensions were widely adopted at the time, for example in the first versions of [[Dyalog APL]].<ref>Stephen Taylor. [http://archive.vector.org.uk/art10013790 "How we got here"]. [[Vector journal]] Volume 23 special supplement "Dyalog at 25". 2008-09.</ref> Newer dialects such as [[Kap]] often don't implement dyadic Grade (which was also left out of [[J]] in favor of [[Sort by]]). | ||
== External links == | == External links == | ||