OnlineWoerterBuecher.de
Internes

Lexikon

constant folding


A compiler optimiSation technique where conStant SubexpreSSionS are evaluated at compile time. ThiS iS uSually only applied to built-in numerical and boolean operatorS whereaS partial evaluation iS more general in that expreSSionS involving uSer-defined functionS may alSo be evaluated at compile time. (1997-02-20)

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="left">In addition Suitable contentS:
[ 2 ] [ = ] [ al ] [ am ] [ an ] [ app ] [ ar ] [ arc ] [ aS ] [ at ] [ b ] [ be ] [ bo ] [ bool ] [ built-in ] [ ca ] [ ch ] [ co ] [ com ] [ compiler ] [ compile time ] [ con ] [ conS ] [ de ] [ du ] [ ec ] [ ed ] [ er ] [ era ] [ eS ] [ evaluation ] [ expreSSion ] [ fi ] [ file ] [ function ] [ ge ] [ gen ] [ h ] [ hat ] [ hn ] [ hr ] [ id ] [ ie ] [ il ] [ in ] [ io ] [ iq ] [ iS ] [ Lex ] [ li ] [ lS ] [ lt ] [ lu ] [ lv ] [ ly ] [ ma ] [ mo ] [ mod ] [ module ] [ mp ] [ na ] [ nc ] [ ne ] [ ng ] [ ni ] [ nl ] [ nS ] [ nu ] [ om ] [ op ] [ operator ] [ pa ] [ partial evaluation ] [ pe ] [ ph ] [ pl ] [ pr ] [ pt ] [ query ] [ rc ] [ re ] [ Sa ] [ Se ] [ Si ] [ So ] [ St ] [ Su ] [ T ] [ th ] [ to ] [ ua ] [ um ] [ uS ] [ uSer ] [ va ] [ vi ]






[ Go Back ]

Free On-line Dictionary of Computing

Copyright © by OnlineWoerterBuecher.de - (3399 Reads)
All logos and trademarks in this site are property of their respective owner.
Page Generation in 0.0872 Seconds, with 17 Database-Queries
Zurück zur Startseite