Presentation is loading. Please wait.

Presentation is loading. Please wait.

© Oscar Nierstrasz ST — Introduction ST 1.1 A Word about Primitives  For optimization, if a primitive fails, the code following is executed. 

Similar presentations


Presentation on theme: "© Oscar Nierstrasz ST — Introduction ST 1.1 A Word about Primitives  For optimization, if a primitive fails, the code following is executed. "— Presentation transcript:

1 © Oscar Nierstrasz ST — Introduction ST 1.1 A Word about Primitives  For optimization, if a primitive fails, the code following is executed.  Integer>>@ y —"Answer a new Point whose x value is the receiver —and whose y value is the argument."  — —^Point x: self y: y

2 © Oscar Nierstrasz ST — Introduction ST 1.2 At the End of the Smalltalk World  We need some operations that are not defined as  methods on objects but direct calls on the underlying  implementation language (C, Assembler,...)  == anObject  "Answer true if the receiver and the argument are the same object (have the same object pointer) and false otherwise. Do not redefine the message == in any other class! No Lookup." — —self primitiveFailed  + - * / = == bitShift:\\ bitAnd: bitOr: >= <= at: at:put: new new:

3 © Oscar Nierstrasz ST — Introduction ST 1.3 Encapsulation

4 © Oscar Nierstrasz ST — Introduction ST 1.4 Squeak Map Package Loader


Download ppt "© Oscar Nierstrasz ST — Introduction ST 1.1 A Word about Primitives  For optimization, if a primitive fails, the code following is executed. "

Similar presentations


Ads by Google