(item (3 v) of [some-list v])

(item (name v) of [person v])

define dictionary index [key]
set [i v] to [1]
repeat until <(item (i) of [keys v]) = (key)>
change [i v] by (1)
end
set [result v] to (item (i) of [values v])

AonymousGuy wrote:

But that would make lists seem more like classes, which they aren't…

Scratch source code wrote:

public class ListCell extends Sprite {

davidkt wrote:

AonymousGuy wrote:

But that would make lists seem more like classes, which they aren't…

*ahem*

Scratch source code wrote:

public class ListCell extends Sprite {

AonymousGuy wrote:

But that would make lists seem more like classes, which they aren't…

AonymousGuy wrote:

Lists are Arrays in functionality, not classes.

sudoyum wrote:

If you've ever programmed in python, dictionaries and classes are defined differently:

public class person //This is a class called "person"
{
     public string name; //A string value called 'name'
     public int age; //An integer value called "age"
     public string food;  //A string value called "food"
     public person() //A constructor for the class, will return an object encapsulating all the data
     {
          name = "John";
          age = 5555;
          food = "pizza";
     }
     /* Now, if a "person" class is constructed with the above constructor, say a "person" class names testPerson, then testPerson.name will equal John, testPerson.age will equal 5555, and testPerson.food will equal pizza. */
}
public class school //A class called "school"
{
     public string[] textBookTitles; //This is what an array looks like in most object-oriented languages. This is an array of strings called "textBookTitles".
}

define index [key]
set [i v] to [1]
repeat until <(item (i) of [keys v]) = (key)>
    change [i v] by (1)
end

define getValue [key]
index (key)
set [result v] to (item (i) of [values v])

define setValue [key] [value]
index (key)
replace item (i) of [values v] with (value)

define deleteValue [key]
index (key)
delete (i) of [values v]
delete (i) of [keys v]

define addValue [key] [value]
add (key) to [keys v]
add (value) to [values v]

AonymousGuy wrote:

In a lot of object oriented languages, a dictionary would in fact be a class, while an array would be completely different:

astro-mechanic wrote:

Old topic, but they're actually called hashtables. Or key/value pair arrays.

davidkt wrote:

In Python they're called dictionaries, in Ruby they're called hashtables, and key/value pair arrays is the definition.

(Why does everyone hate Python? I actually wrote an essay for school on how Python is better than Java )

Chainmanner wrote:

We've already got the “List Contains” block, and if I search for something I'd prefer if it was done from top to bottom, not going straight to it. Sorry, but no support.

<[list v] contains [thing]>

when green flag clicked
if <[usernames v] contains key (username)> 
  set [highscore v] to (value of key (username))
else
  add key (username) value (0)
end

define setdefault(key)(value)
if <[keys v] contains (key) ?> then 
replace item (item # of (key) in [keys v] :: list) of [values v] with (value)

else
add (key) to [keys v]
add (value) to [values v]

end



define get(key)
set [value v] to (item(item # of (key) in [keys v] :: list) of [values v])



define clear
delete [all v] of [keys v]
delete [all v] of [values v]