| ??? 01/26/05 16:00 Read: times |
#85828 - Pure Logic Responding to: ???'s previous message |
My understanding is that a function is "pure" if it always returns the same result for the same parameters and has no side effects.
An example might be a square root function. The fact that a function is known to be pure can by used by a compiler to perform certain optimisations. By implication, a pure function will be re-enterant because it cannot make use of any global or static local variables. |
| Topic | Author | Date |
| Pure Code | 01/01/70 00:00 | |
| Pure Code | 01/01/70 00:00 | |
| Pure Code | 01/01/70 00:00 | |
| Impure code? | 01/01/70 00:00 | |
| Pure Code | 01/01/70 00:00 | |
| do not use the wrong processor | 01/01/70 00:00 | |
| Awash with Pure Code examples! | 01/01/70 00:00 | |
| Does this term have any general meaning? | 01/01/70 00:00 | |
| Does this term have any general meaning? | 01/01/70 00:00 | |
| OK, so what is your question? | 01/01/70 00:00 | |
| My question | 01/01/70 00:00 | |
| all code is pure ! | 01/01/70 00:00 | |
| To put it the opposite way,... | 01/01/70 00:00 | |
Mel | 01/01/70 00:00 | |
| applications in which we can use this | 01/01/70 00:00 | |
| applications in which we can use this | 01/01/70 00:00 | |
| Pure Logic | 01/01/70 00:00 | |
| Not "Pure Code", Pure code | 01/01/70 00:00 | |
| no local variables | 01/01/70 00:00 | |
| Some did in the past | 01/01/70 00:00 | |
| Nothing Special | 01/01/70 00:00 |