duplicates

I have an array of values that I use as a reference for order when I'm printing out hash values. I'd like to modify the array so that the array values are "prettier". I figured I'd just dup or clone the array, change the values and the original object would remain unchanaged. However (in irb)... @arr = ['stuff', 'things'] a = @arr.clone b = @arr.dup So, at the very least, a and @arr are different objects: a.object_id == @arr.object_id => false But now it gets strange a[0].capitalize! a => ['Stuff', 'things'] @arr => ['Stuff', 'things'] ##<-what? b => ['Stuff', 'things']## <-what??? ok... so

I am hitting a brick wall with this problem. I have a data frame (dates) with some document ids and dates stored in a character vector: Doc Dates 1 12345 c("06/01/2000","08/09/2002") 2 23456 c("07/01/2000", 09/08/2003", "07/01/2000") 3 34567 c("09/06/2004", "09/06/2004", "12/30/2006") 4 45678 c("06/01/2000","08/09/2002") I am trying to remove the duplicate elements in the Dates to get this result: Doc Dates 1 12345 c("06/01/2000","08/09/2002") 2 23456 c("07/01/2000", 09/08/2003") 3 34567 c("09/06/2004", "12/30/2006") 4 45678 c("06/01/2000","08/09/2002") I have tried: R>unique(dates$dates) but

I have a namespace with inline function that will be used if several source files. When trying to link my application, the inline function are reported as duplicate symbols. It seems as if my code would simply not inline the functions and I was wondering if this is the expected behavior and how to best deal with it. I use the following gcc options: -g -Wextra -pedantic -Wmissing-field-initializers -Wredundant-decls -Wfloat-equal -Wno-reorder -Wno-long-long The same code style seems to compile and link properly when build in a VC7 environment. The following code example shows the structure of

So I am using this code var duplicates = mg.GroupBy(i => new { i.addr1, i.addr2 }) .Where(g => g.Count() > 1) .Select(g=>g.Key); GridView1.DataSource = duplicates; GridView1.DataBind(); to find and list the duplicates in a table based on addr1 and addr2. The only problem with this code is that it only gives me the pair of addr1 and addr2 that are duplicates when i actually want to display all the fields of the records. ( all the fields like ID, addr1, addr2, city, state...) Any ideas ? To get all values, you can use ToList() on IGrouping var duplicates = mg.GroupBy(i => new { i.addr1, i.addr2

I have a list of sets : L = [set([1, 4]), set([1, 4]), set([1, 2]), set([1, 2]), set([2, 4]), set([2, 4]), set([5, 6]), set([5, 6]), set([3, 6]), set([3, 6]), set([3, 5]), set([3, 5])] (actually in my case a conversion of a list of reciprocal tuples) and I want to remove duplicates to get : L = [set([1, 4]), set([1, 2]), set([2, 4]), set([5, 6]), set([3, 6]), set([3, 5])] But if I try : >>> list(set(L)) TypeError: unhashable type: 'set' Or >>> list(np.unique(L)) TypeError: cannot compare sets using cmp() How do I get a list of sets with distinct sets? The best way is to convert your sets to

I want to merge data. Following are my MySQL tables. I want to use Python to traverse though a list of both Lists (one with dupe = 'x' and other with null dupes). This is sample data. Actual data is humongous. For instance : a b c d e f key dupe -------------------- 1 d c f k l 1 x 2 g h j 1 3 i h u u 2 4 u r t 2 x From the above sample table, the desired output is : a b c d e f key dupe -------------------- 2 g c h k j 1 3 i r h u u 2 What I have so far : import string, os, sys import MySQLdb from EncryptedFile import EncryptedFile enc = EncryptedFile( os.getenv("HOME") + '/.py-encrypted-file

Hi, what is the index of the search key if we search for 24 in the following array using binary search. array = [10,20,21,24,24,24,24,24,30,40,45] I have a doubt regarding binary search that how does it works if a array has duplicate values.Can anybody clarify... The array you proposed has the target value in the middle index, and in the most efficient implementations will return this value before the first level of recursion. This implementation would return '5' (the middle index). To understand the algorithm, just step through the code in a debugger. public class BinarySearch { public static