Object? You Keep Using that Word

Object? You keep
using that word...
@KevlinHenney

Agglutination is a process in linguistic morphology
derivation in which complex words are formed by
stringing together morphemes, each with a single
grammatical or semantic meaning. Languages that
use agglutination widely are called agglutinative
languages.
http://en.wikipedia.org/wiki/Agglutination

pneumonoultramicroscopicsilicovolcanoconiosis
Rindfleischetikettierungsüberwachungsaufgabenübertragungsgesetz
fylkestrafikksikkerhetsutvalgssekretariatslederfunksjonene
muvaffakiyetsizleştiricileştiriveremeyebileceklerimizdenmişsinizcesine
hippopotomonstrosesquipedaliophobia

http://www.bonkersworld.net/object-world/

http://www.bonkersworld.net/object-world/
OBJECT-ORIENTED
VenetianBlind Door
Television
Picture
Glass
Sofa
TelevisionRemoteControl
Peephole

People will be using the
words you choose in their
conversation for the next 20
years. You want to be sure
you do it right.
Unfortunately, many people
get all formal [...]. Just calling
it what it is isn't enough.

They have to tack on a
flowery, computer science-y,
impressive sounding, but
ultimately meaningless word,
like Object, Thing,
Component, Part, Manager,
Entity, or Item.

http://classnamer.com/

http://methodnamer.com/

public interface BookEntity ...
public interface BookEntityFactory ...
public interface ISBNValidator ...
public interface CatalogueRepository ...
public interface CatalogueRepositoryProvider ...
public abstract class AbstractBookEntity
implements BookEntity
public class BookEntityImpl
extends AbstractBookEntity ...
public class BookEntityFactoryImpl
implements BookEntityFactory ...
public class ISBNValidatorImpl
implements ISBNValidator ...
public class CatalogueRepositoryImpl
implements CatalogueRepository ...
public class CatalogueRepositoryProviderImpl
implements CatalogueRepositoryProvider ...

public interface Book ...
public final class ISBN ...
public interface Catalogue ...
public class DescriptionOfCatalogueImplementation
implements Catalogue ...

managerialism, noun
 belief in or reliance on the use of professional
managers in administering or planning an activity
 application of managerial techniques of businesses
to the running of other organisations, such as the
civil service or local authorities
 belief in the importance of tightly managed
organisations, as opposed to individuals, or
groups that do not resemble an organisation
Concise Oxford English Dictionary ∙ Dictionary.com ∙ Wikipedia

One way to name classes is to
give each a unique name,
indicative of its purpose. Unique
names give you the opportunity
to convey a lot of information
without creating names that are
long and unwieldy.
This is exactly the right thing to do
if the names are in common use.

LoanIMember IBookCopy
Member BookCopy

role, noun
 an actor's part in a play, film, etc.
 a person or thing's function in a particular
situation
 a function, part or expected behaviour
performed in a particular operation or process
Concise Oxford English Dictionary ∙ Merriam-Webster's Collegiate Dictionary

LoanBorrower LoanItem
Member BookCopy

TreeParserListenerParser
Builder

Tree
ParserListenerParser
Builder

You can communicate how the new
class is the same by naming some
superclass. It need not be the
immediate superclass, if some distant
ancestor communicates more
clearly.
You can communicate how the new
class is different by finding a word
that accurately highlights the reason
the new class isn't just the superclass.

Connection
Connection
Factory
Connection
Impl

Connection
Connection
Pool
Pooled
Connection

public Connection createConnection(Provider provider)
throws ConnectionFailureException
...

public Connection connectTo(Provider ofUpdates)
throws ConnectionFailure
...

OOP to me means only messaging,
local retention and protection and
hiding of state-process, and
extreme late-binding of all things.
It can be done in Smalltalk and in
LISP. There are possibly other
systems in which this is possible,
but I'm not aware of them.
Alan Kay

William Cook, "On Understanding Data Abstraction, Revisited"

Stack[T]
{
push(T),
pop(),
depth() : Integer,
top() : T
}

An interface is a contract to deliver
a certain amount of service.
Clients of the interface depend on
the contract, which is usually
documented in the interface
specification.
Butler W Lampson
"Hints for Computer System Design"

Stack[T]
{
push(T item),
pop(),
depth() : Integer,
top() : T
}
given:
before = depth()
postcondition:
depth() = before + 1 ∧ top() = item
precondition:
depth() > 0
given:
before = depth()
precondition:
before > 0
postcondition:
depth() = before – 1
given:
result = depth()
postcondition:
result ≥ 0

alphabet(Stack) =
{push, pop, depth, top}

trace(Stack) =
{⟨ ⟩,
⟨push⟩, ⟨depth⟩,
⟨push, pop⟩, ⟨push, top⟩,
⟨push, depth⟩, ⟨push, push⟩,
⟨depth, push⟩, ⟨depth, depth⟩,
⟨push, push, pop⟩,
...}

Non-EmptyEmpty
depth depth
top
push
pop [depth > 1]
push
pop [depth = 1]

public class Stack_spec
{
public static class A_new_stack
{
@Test
public void has_no_depth() 
@Test()
public void has_no_top() 
}
public static class An_empty_stack
{
@Test()
public void throws_when_popped() 
@Test
public void acquires_depth_by_retaining_a_pushed_item_as_its_top() 
}
public static class A_non_empty_stack
{
@Test
public void becomes_deeper_by_retaining_a_pushed_item_as_its_top() 
@Test
public void on_popping_reveals_tops_in_reverse_order_of_pushing() 
}
}

public class
Stack_spec
{
public static class
A_new_stack
{
@Test
public void has_no_depth() 
@Test()
public void has_no_top() 
}
public static class
An_empty_stack
{
@Test()
public void throws_when_popped() 
@Test
public void acquires_depth_by_retaining_a_pushed_item_as_its_top() 
}
public static class
A_non_empty_stack
{
@Test
public void becomes_deeper_by_retaining_a_pushed_item_as_its_top() 
@Test
public void on_popping_reveals_tops_in_reverse_order_of_pushing() 
}
}

Many objects have no conceptual
identity. These objects describe
some characteristic of a thing.

When you care only about the
attributes of an element of the
model, classify it as a value
object. Make it express the
meaning of the attributes it
conveys and give it related
functionality. Treat the value
object as immutable. Don't give it
any identity and avoid the design
complexities necessary to
maintain entities.

Encapsulation
Inheritance
Polymorphism

Encapsulation
Polymorphism
Inheritance

encapsulate, verb
 enclose (something) in or as if in a capsule.
 express the essential feature of (someone or
something) succinctly.
 provide an interface for (a piece of software or
hardware) to allow or simplify access for the user.
The New Oxford Dictionary of English

In many object-oriented programming languages the concept of
inheritance is present, which provides a mechanism for sharing code
among several classes of objects. Many people even regard inheritance
as the hallmark of object-orientedness in programming languages. We
do not agree with this view, and argue that the essence of object-
oriented programming is the encapsulation of data and operations in
objects and the protection of individual objects against each other.
Pierre America
"A Behavioural Approach to Subtyping in Object-Oriented Programming Languages"

In many object-oriented programming languages the concept of
inheritance is present, which provides a mechanism for sharing code
among several classes of objects. Many people even regard inheritance
as the hallmark of object-orientedness in programming languages. We
do not agree with this view, and argue that the essence of object-
oriented programming is the encapsulation of data and operations in
objects and the protection of individual objects against each other.
The author considers this principle of protection of objects against each
other as the basic and essential characteristic of object-oriented
programming. It is a refinement of the technique of abstract data types,
because it does not only protect one type of objects against all other
types, but one object against all other ones. As a programmer we can
consider ourselves at any moment to be sitting in exactly one object and
looking at all the other objects from outside.
Pierre America
"A Behavioural Approach to Subtyping in Object-Oriented Programming Languages"

Object-oriented programming does not
have an exclusive claim to all these good
properties. Systems may be modeled by
other paradigms.
Resilience can be achieved just as well
by organizing programs around abstract
data types, independently of taxonomies;
in fact, data abstraction alone is
sometimes taken as the essence of object
orientation.

abstraction, n. (Logic)
 the process of formulating a generalized concept of
a common property by disregarding the differences
between a number of particular instances. On such
an account, we acquired the concept of red by
recognizing it as common to, and so abstracting it
from the other properties of, those individual
objects we were originally taught to call red.
 an operator that forms a class name or predicate
from any given expression.
E J Borowski and J M Borwein
Dictionary of Mathematics

 T   RecentlyUsedList 
{
new : RecentlyUsedList[T],
isEmpty : RecentlyUsedList[T]  Boolean,
size : RecentlyUsedList[T]  Integer,
add : RecentlyUsedList[T]  T  RecentlyUsedList[T],
get : RecentlyUsedList[T]  Integer  T,
equals : RecentlyUsedList[T]  RecentlyUsedList[T]  Boolean
}

public class RecentlyUsedList
{
private …
public boolean isEmpty() …
public int size() …
public void add(String toAdd) …
public String get(int index) …
public boolean equals(RecentlyUsedList other) …
}

{
private …
public boolean equals(Object other) …
}

{
private List<String> items = new ArrayList<String>();
public boolean isEmpty()
{
return items.isEmpty();
}
public int size()
{
return items.size();
}
public void add(String toAdd)
{
items.remove(toAdd);
items.add(toAdd);
}
public String get(int index)
{
return items.get(size() – index – 1);
}
public boolean equals(RecentlyUsedList other)
{
return other != null && items.equals(other.items);
}
public boolean equals(Object other)
{
return
other instanceof RecentlyUsedList &&
equals((RecentlyUsedList) other);
}
}

typedef struct RecentlyUsedList RecentlyUsedList;
RecentlyUsedList * create();
void destroy(RecentlyUsedList *);
bool isEmpty(const RecentlyUsedList *);
int size(const RecentlyUsedList *);
void add(RecentlyUsedList *, int toAdd);
int get(const RecentlyUsedList *, int index);
bool equals(const RecentlyUsedList *, const RecentlyUsedList *);

struct RecentlyUsedList
{
int * items;
int length;
};

RecentlyUsedList * create()
{
RecentlyUsedList * result = (RecentlyUsedList *) malloc(sizeof(RecentlyUsedList));
result->items = 0;
result->length = 0;
return result;
}
void destroy(RecentlyUsedList * self)
{
free(self->items);
free(self);
}
bool isEmpty(const RecentlyUsedList * self)
{
return self->length == 0;
}
int size(const RecentlyUsedList * self)
{
return self->length;
}
static int indexOf(const RecentlyUsedList * self, int toFind)
{
int result = -1;
for(int index = 0; result == -1 && index != self->length; ++index)
if(self->items[index] == toFind)
result = index;
return result;
}
static void removeAt(RecentlyUsedList * self, int index)
{
memmove(&self->items[index], &self->items[index + 1], (self->length - index - 1) * sizeof(int));
--self->length;
}
void add(RecentlyUsedList * self, int toAdd)
{
int found = indexOf(self, toAdd);
if(found != -1)
removeAt(self, found);
self->items = (int *) realloc(self->items, (self->length + 1) * sizeof(int));
self->items[self->length] = toAdd;
++self->length;
}
int get(const RecentlyUsedList * self, int index)
{
return self->items[self->length - index - 1];
}
bool equals(const RecentlyUsedList * lhs, const RecentlyUsedList * rhs)
{
return lhs->length == rhs->length && memcmp(lhs->items, rhs->items, lhs->length * sizeof(int)) == 0;
}

struct RecentlyUsedList
{
std::vector<int> items;
};

extern "C"
{
RecentlyUsedList * create()
{
return new RecentlyUsedList;
}
void destroy(RecentlyUsedList * self)
{
delete self;
}
bool isEmpty(const RecentlyUsedList * self)
{
return self->items.empty();
}
int size(const RecentlyUsedList * self)
{
return self->items.size();
}
void add(RecentlyUsedList * self, int toAdd)
{
std::vector<int>::iterator found =
std::find(self->items.begin(), self->items.end(), toAdd);
if(found != self->items.end())
self->items.erase(found);
self->items.push_back(toAdd);
}
int get(const RecentlyUsedList * self, int index)
{
return self->items[self->items.size() - index - 1];
}
{
return lhs->items == rhs->items;
}
}

{
...
{
return other != null && items.equals(other.items);
}
{
return
}
}

{
return
lhs->length == rhs->length &&
memcmp(lhs->items, rhs->items, lhs->length * sizeof(int)) == 0;
}

extern "C"
{
...
{
return lhs->items == rhs->items;
}
}

bool equals(
const RecentlyUsedList * lhs, const RecentlyUsedList * rhs)
{
bool result = size(lhs) == size(rhs);
for(int index = 0; result && index != size(lhs); ++index)
result = get(lhs, index) == get(rhs, index);
return result;
}

extern "C" bool equals(
const RecentlyUsedList * lhs, const RecentlyUsedList * rhs)
{
bool result = size(lhs) == size(rhs);
for(int index = 0; result && index != size(lhs); ++index)
result = get(lhs, index) == get(rhs, index);
return result;
}

{
...
{
boolean result = other != null && size() == other.size();
for(int index = 0; result && index != size(); ++index)
result = get(index).equals(other.get(index));
return result;
}
{
return
}
}

One of the most pure object-oriented
programming models yet defined is the
Component Object Model (COM). It
enforces all of these principles rigorously.
Programming in COM is very flexible and
powerful as a result. There is no built-in notion
of equality. There is no way to determine if
an object is an instance of a given class.
William Cook
"On Understanding Data Abstraction, Revisited"

{
...
{
boolean result = other != null && size() == other.size();
for(int index = 0; result && index != size(); ++index)
result = get(index).equals(other.get(index));
return result;
}
}

In a purist view of object-oriented
methodology, dynamic dispatch is the only
mechanism for taking advantage of attributes
that have been forgotten by subsumption.
This position is often taken on abstraction
grounds: no knowledge should be obtainable
about objects except by invoking their
methods. In the purist approach,
subsumption provides a simple and effective
mechanism for hiding private attributes.

public interface RecentlyUsedList
{
boolean isEmpty();
int size();
void add(String toAdd);
String get(int index);
boolean equals(RecentlyUsedList other);
}

public class RecentlyUsedListImpl
implements RecentlyUsedList
{
private List<String> items = …;
}

public class ArrayListBasedRecentlyUsedList
{
}

public class RandomAccessRecentlyUsedList
{
}

RecentlyUsedList list =
new RandomAccessRecentlyUsedList();

Object? You Keep Using that Word

More Related Content

What's hot (20)

Viewers also liked (20)

Similar to Object? You Keep Using that Word (20)

More from Kevlin Henney (20)

Recently uploaded (20)

Object? You Keep Using that Word