duplicates = multiple editions
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
A Classical Introduction to Modern Number Theory, Kenneth Ireland Michael Rosen
Summary of and excerpts from chapter 9 and 10 of On Lisp. Examples are mainly in Common Lisp.
#include <functional> | |
#include <iostream> | |
using namespace std; | |
template <typename F> | |
struct Y | |
{ | |
Y(F f) : m_f(f) {} | |
template <typename T> |
template <typename Predicate, typename Head, typename... Tail> | |
struct typelist_sort_t<Predicate, typelist<Head, Tail...>> | |
{ | |
using predicate = meta_partial_apply<Predicate, Head>; | |
using notpredicate = meta_negate<predicate>; | |
using smaller_than = typelist_filter<notpredicate, typelist<Tail...>>; | |
using greater_than = typelist_filter<predicate, typelist<Tail...>>; | |
using type = typelist_cat< | |
typelist_sort<Predicate, smaller_than>, | |
typelist<Head>, |
(by @andrestaltz)
If you prefer to watch video tutorials with live-coding, then check out this series I recorded with the same contents as in this article: Egghead.io - Introduction to Reactive Programming.
def distinct(iterable, keyfunc=None): | |
seen = set() | |
for item in iterable: | |
key = item if keyfunc is None else keyfunc(item) | |
if key not in seen: | |
seen.add(key) | |
yield item | |
if __name__ == '__main__': | |
x = [0, 0, 1, 0, 1, 2, 2, 1, 0] |
function remoteActionDeferredWrap(remoteActionMethod, paramArr, escape){ | |
//Create the deferred object | |
var deferredObj=$j.Deferred(); | |
//Create the callback method, this will manipulate the deferred object to show when complete | |
var callback = function(result,status){ | |
if(status.status==true){ | |
deferredObj.resolve(result); | |
} | |
else{ | |
deferredObj.reject('Error: '+status.message); |