Say you have, e.g.: $ cat my.props first: primo second: secondo third: terzo i.e. would be a .config format except that it’s missing a leading section name. Then, it easy to fake the section header: import ConfigParser class FakeSecHead(object): def __init__(self, fp): self.fp = fp self.sechead = ‘[asection]\n’ def readline(self): if self.sechead: try: return self.sechead … Read more
The keys are accessed using an exclamation point: ${!array[@]}, the values are accessed using ${array[@]}. You can iterate over the key/value pairs like this: for i in “${!array[@]}” do echo “key : $i” echo “value: ${array[$i]}” done Note the use of quotes around the variable in the for statement (plus the use of @ instead … Read more
An EAV ‘database’ [sic] is literally mathematically straightforwardly an undocumented description in triples of a database and its metadata, with no functionality to tablulate relationships, or query relationships, or query metadata, or type check, or maintain integrity, or optimize, or transact atomically, or control concurrency. Software engineering principles dictate that sound EAV database [sic] use … Read more
You can use a java Map and map a char to an int. You can then iterate over the characters in the string and check if they have been added to the map, if they have, you can then increment its value. For example: HashMap<Character, Integer> map = new HashMap<Character, Integer>(); String s = “aasjjikkk”; … Read more
If I can rephrase your question, what you want is a dictionary with the years as keys and an array for each year containing a list of values associated with that year, right? Here’s how I’d do it: years_dict = dict() for line in list: if line[0] in years_dict: # append the new number to … Read more
I suggest a LinkedHashMap or a TreeMap. A LinkedHashMap keeps the keys in the order they were inserted, while a TreeMap is kept sorted via a Comparator or the natural Comparable ordering of the elements. Since it doesn’t have to keep the elements sorted, LinkedHashMap should be faster for most cases; TreeMap has O(log n) … Read more
There’s a few general pros and cons I can think of, there are situations where one is better than the other: Option 1, EAV Model: Pro: less time to design and develop a simple application Pro: new entities easy to add (might even be added by users?) Pro: “generic” interface components Con: complex code required … Read more
Iterate your list in reverse with a for loop: for (int i = safePendingList.Count – 1; i >= 0; i–) { // some code // safePendingList.RemoveAt(i); } Example: var list = new List<int>(Enumerable.Range(1, 10)); for (int i = list.Count – 1; i >= 0; i–) { if (list[i] > 5) list.RemoveAt(i); } list.ForEach(i => Console.WriteLine(i)); … Read more
Try this // file path $file=”orderdata.txt”; // REMEMBER TO MENTION THE CORRECT FILE WITH EXTENSION // open the file and get the resource handle with errors suppressed $handle = @fopen($file,’r’); // DONT USE @ while at development since it will suppress errors // array to hold our values $params = array(); if($handle) { // if … Read more
Try str.join(): the_dict = { “pres”: [“the President right now is”, “Joe Biden”], “FSUNick”: [“the seminoles”, “unconquerd”], “class”: [“introcution to Python”] } while True: print(“we have these keys”) print(“\n”.join(the_dict.keys())) print(“enter zz to end program or the word you want a listing for”) choice = input(“enter the string you want typed out”) if choice == “zz”: … Read more