OnlineWoerterBuecher.de
Internes

Lexikon


last call optimisation


Normally when procedure A callS procedureS B, C, .., Z, the environment of procedure A iS only diScarded when procedure Z returnS and procedure A itSelf terminateS. USing laSt call optimiSation, A' S environment iS diScarded aS Z iS called. ThiS allowS arbitrarily deep neSting of procedure callS without conSuming memory to Store uSeleSS environmentS. A Special caSe of thiS iS tail recurSion optimiSation where the laSt procedure called iS the calling procedure itSelf.

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ ai ] [ al ] [ an ] [ ar ] [ aS ] [ at ] [ B ] [ b ] [ bi ] [ bit ] [ C ] [ ca ] [ card ] [ caSe ] [ ci ] [ co ] [ con ] [ conS ] [ cu ] [ de ] [ diSc ] [ du ] [ ec ] [ ed ] [ edu ] [ ee ] [ environment ] [ er ] [ eS ] [ et ] [ h ] [ il ] [ in ] [ io ] [ ir ] [ iron ] [ iS ] [ it ] [ la ] [ li ] [ lS ] [ ly ] [ ma ] [ mall ] [ memory ] [ mo ] [ N ] [ na ] [ ne ] [ ng ] [ nl ] [ nS ] [ op ] [ pe ] [ pr ] [ procedure ] [ pt ] [ re ] [ recurSion ] [ ro ] [ Sa ] [ Sc ] [ Se ] [ Si ] [ Spec ] [ St ] [ Store ] [ Su ] [ Sum ] [ T ] [ tail recurSion ] [ tail recurSion optimiSation ] [ th ] [ to ] [ tr ] [ um ] [ uS ] [ vi ] [ wS ] [ Z ]






Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (2602 Reads)

All logos and trademarks in this site are property of their respective owner.

Page Generation in 0.0929 Seconds, with 17 Database-Queries
Zurück zur Startseite