 |
[6 * 9 = 42] whileTrue: [World run]
Stopařův průvodce jedním převážně neškodným programovacím jazykem
|
 |
|
Poznámky k implementaci a rozhraní tříd
Theoretical Informatics - Interfaces - Draft
IAlgorithm
- initPhase: arg
- runPhase: arg
- cycleCondition: arg
- stepPhase: arg
- cycleIterations (returns number of iterations which are done/finished)
- cycleMaxIterations (bounds space of iterations, implicit value is infinity when I dont know when I will finish, or a positive integer when I know exact count of cycles to do)
- finalizePhase: arg
Time Measuring mechanism: (first incomplete draft)
Stamp (inherits Symbol)
- isStamp
- active
- activate: aBoolean
- timeStamp: (maybe)
- timeStamp (maybe)
ITimeMeasuring
- insertTimeStamp: aSymbol
- deleteTimeStamp: aSymbol
- deleteTimeStamps
- setTimeMeasuringActive: aBoolean
- setTimeStampsActiveFrom: startStamp to: endStamp (PS: Stamp=Symbol)
- startTimeMeasuring (init procedures of time measure mechanism - init variables, init recording streams and so on)
- finishTimeMeasuring (ending time measuring eg. stop counter of seconds, finish building of list of time-stamps
- recordTimeMeasuring (how to save results end where)
nebo
TODO: inspiration in "runInMiliseconds" function, how does it work?
TODO: measuring should not affect resulting times (differential)
TODO: what about 3-adress-code instructions counting (because of compiled methods are available and instructions can be counted).
Odkaz na tuto stránku
|
|