key-value

We are getting properties (that we can not influence) out of a database and want to access them by a key/value mapping. We are facing the problem that one of the property keys includes a blank character. foo bar = barefoot This is - correctly - interpreted as follows key: foo value: bar = barefoot Is there a way to include the blank in the key so that it's not interpreted as the delimiter? I guess this behaviour is just like intended, but I thought I could give it a try here. As it seems the delimiter should be = , not space. Hence - keyValuePair.split("=") should do. If you are loading this

I have a dictionary with key-value pair. My value contains strings. How can I search if a specific string exists in the dictionary and return the key that correspond to the key that contains the value. Let's say I want to search if the string 'Mary' exists in the dictionary value and get the key that contains it. This is what I tried but obviously it doesn't work that way. #Just an example how the dictionary may look like myDict = {'age': ['12'], 'address': ['34 Main Street, 212 First Avenue'], 'firstName': ['Alan', 'Mary-Ann'], 'lastName': ['Stone', 'Lee']} #Checking if string 'Mary' exists

This question already has an answer here: For..In loops in JavaScript - key value pairs 15 answers var user = {}; now I want to create a setUsers() method that takes a key/value pair object and initializes the user variable. setUsers = function(data) { // loop and init user } where data is like: 234: "john", 23421: "smith", .... Beware of properties inherited from the object's prototype (which could happen if you're including any libraries on your page, such as older versions of Prototype). You can check for this by using the object's hasOwnProperty() method. This is generally a good idea when

I need a fast, reliable and memory-efficient key--value database for Linux. My keys are about 128 bytes, and the maximum value size can be 128K or 256K. The database subsystem shouldn't use more than about 1 MB of RAM. The total database size is 20G (!), but only a small random fraction of the data is accessed at a time. If necessary, I can move some data blobs out of the database (to regular files), so the size gets down to 2 GB maximum. The database must survive a system crash without any loss in recently unmodified data. I'll have about 100 times more reads than writes. It is a plus if it

What is a clean/efficient method for storing the directory Hierarchy/tree in a Key-Value database (in my case MongoDB but any of them)? For example a tree structure - Cars + Audi + BMW - M5 + Ford - Color + Red - Apple - Cherry + Purple - Funny The method I am using now, each object links to it's parent { dir: "red" parent-dir: "color" } This makes it very efficient/fast to insert and reorder any aspect of the tree (for example if I want to move Red and all it's children to the Cars directory). But this method sucks when I want to all subdirectories and their children for a given directory

I am reading RSS feed and pushing both Title and Link into an Array in Jquery . What i did is var arr = []; $.getJSON("displayjson.php",function(data){ $.each(data.news, function(i,news){ var title = news.title; var link = news.link; arr.push({title : link}); }); }); And i am reading that array again using $('#show').click(function(){ $.each(arr, function(index, value){ alert( index +' : '+value); }); }); But it Giving me Output as 1:[Object Object] 2:[Object Object] 3:[Object Object] like this ... How i can get both tile and link as a pair ( title as key and link as value ) There are no keys