any

I am implementing simple library for lists in C, and I have a problem with writing find function. I would like my function to accept any type of argument to find, both: find(my_list, 3) and find(my_list, my_int_var_to_find) . I already have information what is type of list's elements . For now I've found couple of ways dealing with this: different function with suffix for different types: int findi(void* list, int i) , int findd(void* list, double d) - but I don't like this approach, it seems like redundancy for me and an API is confusing. using union: typedef union { int i; double d; char c;

In this article http://www.jroller.com/eyallupu/entry/hibernate_the_any_annotation and also in this question How to use Hibernate @Any-related annotations? , how @Any annotation can be used was explained. But how can I get borrows for each DVD/VHS/BOOK? How can I do mapping definition on DVD/VHS/BOOK? I don't think this is supported and, as mentioned in the documentation: 2.4.5.2. @Any The @Any annotation defines a polymorphic association to classes from multiple tables. This type of mapping always requires more than one column. The first column holds the type of the associated entity. The

>>> l = list(range(10)) >>> l [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] >>> if filter(lambda x: x > 10, l): ... print "foo" ... else: # the list will be empty, so bar will be printed ... print "bar" ... bar I'd like to use any() for this instead, but any() only takes one argument: the iterable. Is there a better way? Use a generator expression as that one argument: any(x > 10 for x in l) Here the predicate is in the expression side of the generator expression, but you can use any expression there, including using functions. Demo: >>> l = range(10) >>> any(x > 10 for x in l) False >>> l = range(20) >>>

I wrote quantification functions exists , forall , and none for Haskell's build-in [] list data type. On multiple occasions, these seemed to prove much more efficient than Prelude / Data.List s any and all . I naively suspect that this performance is due to any and all being implemented using Θ(n) folds. Since I am relatively new to Haskell, I think I must be mistaken, or that there would be a good reason for this phenomenon. From Data.Foldable : -- | Determines whether any element of the structure satisfies the predicate. any :: Foldable t => (a -> Bool) -> t a -> Bool any p = getAny #.

According to the blog post here , an any() + generator expression should run quicker than a for loop, and it seems like his reasoning makes sense. But I've tried to use this method (albeit on some other function), but it seems to take a longer time to run than an explicit for loop. def with_loop(a, b): for x in xrange(1, b): if x * a % b == 1: return True return False def with_generator(a, b): return any(x * a % b == 1 for x in xrange(1, b)) Basically the code loops through all the numbers from 1 to b to find whether the number a has a modular inverse. The times I got from running the

This question already has an answer here: How to tell what is in one vector and not another? 5 answers I guess it is a very easy question. v1 = 1:10 v2 = c(2,4,7) (none of the numbers are repeated. No need to use unique() ) I want a vector containing all the values in v1 that are not in v2. solution = c(1,3,5,6,8,9,10) I can do this using a for loop but I'm sure there are easier solution. setdiff(v1, v2) # [1] 1 3 5 6 8 9 10 Use the %in% operator with logical NOT ( ! ) to subset v1 by values not in v2 : v1[ ! v1 %in% v2 ] #[1] 1 3 5 6 8 9 10 Or you could look for non-matches of v1 in v2 (this

In Mathematics and many programming languages (and I think standard SQL as well), parentheses change precedence (grouping parts to be evaluated first) or to enhance readability (for human eyes). Equivalent Examples: SELECT array[1,2] @> array[1] SELECT (array[1,2]) @> array[1] SELECT array[1,2] @> (array[1]) SELECT ((array[1,2]) @> (array[1])) But SELECT 1 = ANY array[1,2] is a syntax error (!), and SELECT 1 = ANY (array[1,2]) is valid. Why? OK, because "the manual says so" . But what the logic for humans to remember all exceptions? Is there a guide about it? I do not understand why