Page Comparison

...

so the more (term, pattern) comparisons match requires the more expensive it is. The actual cost of comparing term against pattern is proportional to the byte size of the smaller object. This is based on the java equality method.

Methods

nth

toByteArray

hexToBytes

toUtf8Bytes

union

diff

add

delete

contains

get

getOrElse

set

keys

size

length

slice

append

interpolate

List

C

--

n/a

C

proportional to value of higher index

Proportional

proportional to

sum

the length of

lengths

underlying string

n/a

GByteArray

n/a

na

n/a

proportional to value of higher index

Proportional to sum of lengths

proportional to the logarithm of length of target byte array n/a

Tuple C -- n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a

Set n/a -- n/a n/a proportional to the size of collection that is an argument method proportional to the size of collection that is an argument method C C C n/a n/a n/a n/a proportional to the size of base collection on which this method is called. Complexity of the size method is O(n) n/a n/a same as union n/a

Map n/a -- n/a n/a proportional to the size of collection that is an argument method proportional to the size of collection that is an argument method n/a C C C C C C proportional to the size of base collection on which this method is called. Complexity of the size method is O(n) n/a n/a same as union n/a

any term n/a proportional to the byte size of the underlying rholang term n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a

String n/a -- proportional to the length of underlying string proportional to the length of underlying string n/a n/a n/a n/a n/a n/a n/a n/a n/a n/a C proportional to value of higher index proportional to the sum of the lengths

, because that's how string concatenation works in Java.

of both strings proportional to length_of_string * number_of_entries_in_map

C - constant
n/a - method not available

...

Versions Compared

Old Version 21

New Version 22

Key

Methods