c# - Merging lists of dictionaries -

-

suppose have lists of dictionaries ld1 , ld2. both have dictionary objects in common. suppose dictionary object "a" in both lists. want merge list of dictionaries such same object in both lists should come once in merged list.

linq's .union should work nicely:

onelist.union(twolist)

if need list, call tolist() on result.


Comments

Post a Comment

Popular posts from this blog

sql server - NHibernate incorrectly creating ManyToMany table - Cannot define PRIMARY KEY constraint on nullable column error -

-
i have started implementing iset 's instead of ilist 's in project better reflects collection's have. this has thrown odd error in creation of 1 table. error i'm getting is. cannot define primary key constraint on nullable column in table 'useraddressassignments'. i have many many relationship between users , addresses. public class user : baseentity { public virtual system.guid userguid { get; set; } public virtual string username { get; set; } public virtual company company { get; set; } public virtual iesi.collections.generic.iset<address> useraddressassignments { get; set; } } the sql generating lookup column causing issue , shown below. userid column being nullable causing problem. create table useraddressassignments ( useraddressassignmentid int not null, addressid int identity not null, userid int null, primary key (userid, addressid) ) the odd part here have identical relationship between company...
Read more

All overlapping substrings matching a java regex -

-
is there api method returns (possibly overlapping) substrings match regular expression? for example, have text string: string t = 04/31 412-555-1235; , , have pattern: pattern p = new pattern("\\d\\d+"); matches strings of 2 or more characters. the matches are: 04, 31, 412, 555, 1235. how overlapping matches? i want code return: 04, 31, 41, 412, 12, 55, 555, 55, 12, 123, 1235, 23, 235, 35. theoretically should possible -- there obvious o(n^2) algorithm enumerates , checks substrings against pattern. edit rather enumerating substrings, safer use region(int start, int end) method in matcher . checking pattern against separate, extracted substring might change result of match (e.g. if there non-capturing group or word boundary check @ start/end of pattern). edit 2 actually, it's unclear whether region() expect zero-width matches. specification vague, , experiments yield disappointing results. for example: string line = "xx90xx"; strin...
Read more

c++ - Using OpenSSL in a multi-threaded application -

-
i have been writing soap client application in c++ on ubuntu using openssl https transport , pthreads threading. have number of threads - 1 central data acquisition thread periodically gets worker threads make soap requests via shared mutex protected queues. reading documentation openssl found is openssl thread-safe? in openssl faq describes mechanisms required ensure thread safety when using openssl. implemented , works fine. the reason question conceptual difficulty really. thinking implementing same functionality application has already, instead of using threads, create 2 seperate applications : 1 worker thread (of multiple copies running) , main data acquisition thread. use tcp sockets communicate between 2 rather mutex protected queues. may bad idea not important - confusing me would have implement same functions required ensure openssl thread safety in second approach or not? my guess not have , treated independent (indeed surely must many applications use openssl) re...
Read more