Remove count_if, find_if, every, some, Struct; replace them with modern
Python equivalents.

- Fix relative imports in base of is a package or not
- Fix not working notebooks
- Add notebooks to packages sources

Used tool 2to3 to finish the porting to Python 3 plus some fixes by
hand.

These functions, which I had to implement in Python 2.2, are now
available in standard Python.

use “raise NotImplementedError” for abstract methods

This is really the pull request from tmrts, but as a novice git user, I couldn't figure out how to do the merge after there were some other changes, so I did it manually. Sorry that you don't get official credit, tmrts, but thanks!

To make product to work in python 3+ , loop over the list
Or in case if you want to make the code precise  import following statment and change the return statment
import operator
import functools
return functools.reduce(operator.mul, numbers, 1)

 * Use weighted_sampler() for the sampling.
 * By not using a defaultdict, keep n_obs always up to date.
 * Don't inherit from ProbDist, at least for now, since we don't
   use anything from the superclass, and if we did it would break
   (e.g. __setitem__).
 * Remove __len__ since nobody uses it.
 * Use heapq.nlargest.

Also separate random doctests from others, and tweak docs.

 * graph_search missed deduping nodes in the frontier
 * astar_search didn't use 3rd-edition pseudocode
 * InstrumentedProblem didn't forward the path_cost method,
   so all the doctest results on instrumented cost-sensitive
   problems were wrong

Also filled in breadth_first_search and per-node memoization 
of h (to fulfill the doc comment saying that was done).

There's a remaining problem that sometimes trivial refactorings
change the amount of search that is done, slightly, which should
not happen since the code is supposed to be deterministic.