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)

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 - (3341 Reads)

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

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