@HyeockJinKim
I 'd like to recommend to implement dict by wrapping the map throw using the delegate pattern.

type Dict struct {
...
}

func (d *Dict) Put(...) (Object, error) {
...
}

func (d *Dict) Get(...) (Object, error) {
...
}

cc @ncw

cc @sbinet

if I am not mistaken, CPython dicts are not ordered (there's collections.OrderedDict for that.)

so, couldn't we just use map[Object]Object at the core of this data structure?

@sbinet
FYI

Changed in version 3.7: Dictionary order is guaranteed to be insertion order. This behavior was an implementation detail of CPython from 3.6.

He might want to implement this feature.
It is okay that we decide to broken 3.4 compatibilities.
(#74 (comment))

@HyeockJinKim
However, as @sbinet commented.
I'd like to recommend you implement unordered key dictionary as the 1st milestone.
That will be enough for the 1st step.

cc @ncw @sbinet

I stand corrected :)

ok, then what about:

type Dict struct {
    keys map[Object]int // key to index into slice of vals
    vals []Object       // values associated with the above keys
}

(I think we can rely on Go's map hashing mechanism)

and if we want to retain insertion order:

type Dict struct {
    keys  map[Object]int
    items [][2]Object // key-value pair
}

Does anyone have a fork for this issue? Would be willing to give it a shot.

@ashermancinelli please ping to @HyeockJinKim
He might work on this issue :)

I'm working on this issue right now.
I will work quickly and PR.