tuples

I have a list of tuples that I'm trying to sort. The tuples contain strings: connectionsList = [('C', 'B'), ('A', 'C'), ('D', 'B'), ('C','D')] The strings in the tuples have numeric values stored in a dict: valuesDict = {'A':3, 'B':5, 'C':1, 'D':2} What I'd like to do is sort the list by the sum of the values in the dict for the tuples. Desired output for this toy example would be: [(C,D), (A,C), (C,B), (D,B)] which would have the sums of: [3, 4, 6, 7] Using itemgetter, I can sort alphabetically by position: sortedView = sorted(connectionsList, key=itemgetter(0,1)) However, I'm having trouble

I have a function in python that does error checking on a string. If the function finds an error it will return a tuple with an error code and an identifier for that error. Later in the program I have the function that handles the error. It accepts the tuple into two variables. errCode, i = check_string(s,pathType) check_string is the function that produces the tuple. What I want it to does is return just zero if there is no error. When a zero is returned the above code seems to fail because there is nothing for the variable i. Is there an easy way to get this to work or do I just need to have

Here is a code sample: // file main.cpp #include <iostream> #include <boost/tuple/tuple.hpp> #include <boost/tuple/tuple_io.hpp> #include <boost/spirit/include/qi.hpp> int main() { std::string s( "1 A" ); boost::tuple<double, char> p; complex_matrix_parser::iterator b = s.begin(); complex_matrix_parser::iterator e = s.end(); qi::phrase_parse( b, e, ( qi::double_ >> qi::char_('A') ), qi::space, qi::skip_flag::postskip, p ); std::cerr << "==== " << p << std::endl; return 0; } This should print ==== (1 A) right? But it prints ==== (1 ) , so it skips the 'A' character. What am I doing wrong here?

I need to separate a tuple based on a value from a nested dictionary as below and put it in another list. I want to separate tuple with values 'bb' original_list= [[('aa','1'),('bb','2')],[('cc','3'),('bb','4')],[('dd','5'),('dd','6')]] I need two lists as below, final_list= [[('aa','1')],[('cc','3')],[('dd','5'),('dd','6')]] deleted_list = [[('bb','2')],[('bb','4')]] I used the following recursive code, def remove_items(lst, item): r = [] for i in lst: if isinstance(i, list): r.append(remove_items(i, item)) elif item not in i: r.append(i) return r It could produce the result list after

I am a newbie in python, I have two lists: l1 = ['a','b','c','d'] l2 = ['new'] i want to get new list like this l3 = [('a','new'),('b','new'),('c','new'),('d','new')] What is the best way to combine the two lists? >>> from itertools import product >>> l1 = ['a','b','c','d'] >>> l2 = ['new'] >>> list(product(l1,l2)) [('a', 'new'), ('b', 'new'), ('c', 'new'), ('d', 'new')] If l2 always just has the one element there is no need to overcomplicate things l3 = [(x, l2[0]) for x in l1] See the itertools docs . In particular, use product for a Cartesian product: from itertools import product: l1 = ['a

Consider this int foo (int a, char c, bool b) {std::cout << a << ' ' << c << ' ' << b << '\n'; return 8;} double bar (int a, char c, bool b, int d) {std::cout << a << ' ' << c << ' ' << b << ' ' << d << '\n'; return 2.5;} char baz (bool a, bool b) {std::cout << a << ' ' << b << '\n'; return 'a';} int main() { const auto tuple = std::make_tuple(5, true, 'a', 3.5, false, 1000, 't', 2, true, 5.8); const std::tuple<int, double, char> t = searchArguments (tuple, foo, bar, baz); } So the arguments for foo are first searched (from tuple ). Searching from left to right, the first int found is 5 , the