aima-python/utils.py at gitignore · OrkoHunter/aima-python · GitHub

Repository navigation

History

965 lines (810 loc) · 28.5 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

"""Provide some widely useful utilities. Safe for "from utils import *".

"""

from __future__ import generators

import operator, math, random, copy, sys, os.path, bisect, re

assert (2,5) <= sys.version_info < (3,), """\

This code is meant for Python 2.5 through 2.7.

You might find that the parts you care about still work in older

Pythons or happen to work in newer ones, but you're on your own --

edit utils.py if you want to try it."""

#______________________________________________________________________________

# Compatibility with Python 2.2, 2.3, and 2.4

# The AIMA code was originally designed to run in Python 2.2 and up.

# The first part of this file implements for Python 2.2 through 2.4

# the parts of 2.5 that the original code relied on. Now we're

# starting to go beyond what can be filled in this way, but here's

# the compatibility code still since it doesn't hurt:

try: bool, True, False ## Introduced in 2.3

except NameError:

class bool(int):

"Simple implementation of Booleans, as in PEP 285"

def __init__(self, val): self.val = val

def __int__(self): return self.val

def __repr__(self): return ('False', 'True')[self.val]

True, False = bool(1), bool(0)

try: sum ## Introduced in 2.3

except NameError:

def sum(seq, start=0):

"""Sum the elements of seq.

>>> sum([1, 2, 3])

"""

return reduce(operator.add, seq, start)

try: enumerate ## Introduced in 2.3

except NameError:

def enumerate(collection):

"""Return an iterator that enumerates pairs of (i, c[i]). PEP 279.

>>> list(enumerate('abc'))

[(0, 'a'), (1, 'b'), (2, 'c')]

"""

## Copied from PEP 279

i = 0

it = iter(collection)

while 1:

yield (i, it.next())

i += 1

try: reversed ## Introduced in 2.4

except NameError:

def reversed(seq):

"""Iterate over x in reverse order.

>>> list(reversed([1,2,3]))

[3, 2, 1]

"""

if hasattr(seq, 'keys'):

raise TypeError("mappings do not support reverse iteration")

i = len(seq)

while i > 0:

i -= 1

yield seq[i]

try: sorted ## Introduced in 2.4

except NameError:

def sorted(seq, cmp=None, key=None, reverse=False):

"""Copy seq and sort and return it.

>>> sorted([3, 1, 2])

[1, 2, 3]

"""

seq2 = copy.copy(seq)

if key:

if cmp == None:

cmp = __builtins__.cmp

seq2.sort(lambda x,y: cmp(key(x), key(y)))

else:

if cmp == None:

seq2.sort()

else:

seq2.sort(cmp)

if reverse:

seq2.reverse()

return seq2

try:

set, frozenset ## set builtin introduced in 2.4

except NameError:

try:

import sets ## sets module introduced in 2.3

set, frozenset = sets.Set, sets.ImmutableSet

except (NameError, ImportError):

class BaseSet:

"set type (see http://docs.python.org/lib/types-set.html)"

def __init__(self, elements=[]):

self.dict = {}

for e in elements:

self.dict[e] = 1

def __len__(self):

return len(self.dict)

def __iter__(self):

for e in self.dict:

yield e

def __contains__(self, element):

return element in self.dict

def issubset(self, other):

for e in self.dict.keys():

if e not in other:

return False

return True

def issuperset(self, other):

for e in other:

if e not in self:

return False

return True

def union(self, other):

return type(self)(list(self) + list(other))

def intersection(self, other):

return type(self)([e for e in self.dict if e in other])

def difference(self, other):

return type(self)([e for e in self.dict if e not in other])

def symmetric_difference(self, other):

return type(self)([e for e in self.dict if e not in other] +

[e for e in other if e not in self.dict])

def copy(self):

return type(self)(self.dict)

def __repr__(self):

elements = ", ".join(map(str, self.dict))

return "%s([%s])" % (type(self).__name__, elements)

__le__ = issubset

__ge__ = issuperset

__or__ = union

__and__ = intersection

__sub__ = difference

__xor__ = symmetric_difference

class frozenset(BaseSet):

"A frozenset is a BaseSet that has a hash value and is immutable."

def __init__(self, elements=[]):

BaseSet.__init__(elements)

self.hash = 0

for e in self:

self.hash |= hash(e)

def __hash__(self):

return self.hash

class set(BaseSet):

"A set is a BaseSet that does not have a hash, but is mutable."

def update(self, other):

for e in other:

self.add(e)

return self

def intersection_update(self, other):

for e in self.dict.keys():

if e not in other:

self.remove(e)

return self

def difference_update(self, other):

for e in self.dict.keys():

if e in other:

self.remove(e)

return self

def symmetric_difference_update(self, other):

to_remove1 = [e for e in self.dict if e in other]

to_remove2 = [e for e in other if e in self.dict]

self.difference_update(to_remove1)

self.difference_update(to_remove2)

return self

def add(self, element):

self.dict[element] = 1

def remove(self, element):

del self.dict[element]

def discard(self, element):

if element in self.dict:

del self.dict[element]

def pop(self):

key, val = self.dict.popitem()

return key

def clear(self):

self.dict.clear()

__ior__ = update

__iand__ = intersection_update

__isub__ = difference_update

__ixor__ = symmetric_difference_update

#______________________________________________________________________________

# Simple Data Structures: infinity, Dict, Struct

infinity = 1.0e400

def Dict(**entries):

"""Create a dict out of the argument=value arguments.

>>> Dict(a=1, b=2, c=3)

{'a': 1, 'c': 3, 'b': 2}

"""

return entries

class DefaultDict(dict):

"""Dictionary with a default value for unknown keys."""

def __init__(self, default):

self.default = default

def __getitem__(self, key):

if key in self: return self.get(key)

return self.setdefault(key, copy.deepcopy(self.default))

def __copy__(self):

copy = DefaultDict(self.default)

copy.update(self)

return copy

class Struct:

"""Create an instance with argument=value slots.

This is for making a lightweight object whose class doesn't matter."""

def __init__(self, **entries):

self.__dict__.update(entries)

def __cmp__(self, other):

if isinstance(other, Struct):

return cmp(self.__dict__, other.__dict__)

else:

return cmp(self.__dict__, other)

def __repr__(self):

args = ['%s=%s' % (k, repr(v)) for (k, v) in vars(self).items()]

return 'Struct(%s)' % ', '.join(sorted(args))

def update(x, **entries):

"""Update a dict; or an object with slots; according to entries.

>>> update({'a': 1}, a=10, b=20)

{'a': 10, 'b': 20}

>>> update(Struct(a=1), a=10, b=20)

Struct(a=10, b=20)

"""

if isinstance(x, dict):

x.update(entries)

else:

x.__dict__.update(entries)

return x

#______________________________________________________________________________

# Functions on Sequences (mostly inspired by Common Lisp)

# NOTE: Sequence functions (count_if, find_if, every, some) take function

# argument first (like reduce, filter, and map).

def removeall(item, seq):

"""Return a copy of seq (or string) with all occurences of item removed.

>>> removeall(3, [1, 2, 3, 3, 2, 1, 3])

[1, 2, 2, 1]

>>> removeall(4, [1, 2, 3])

[1, 2, 3]

"""

if isinstance(seq, str):

return seq.replace(item, '')

else:

return [x for x in seq if x != item]

def unique(seq):

"""Remove duplicate elements from seq. Assumes hashable elements.

>>> unique([1, 2, 3, 2, 1])

[1, 2, 3]

"""

return list(set(seq))

def product(numbers):

"""Return the product of the numbers.

>>> product([1,2,3,4])

"""

return reduce(operator.mul, numbers, 1)

def count_if(predicate, seq):

"""Count the number of elements of seq for which the predicate is true.

>>> count_if(callable, [42, None, max, min])

"""

f = lambda count, x: count + (not not predicate(x))

return reduce(f, seq, 0)

def find_if(predicate, seq):

"""If there is an element of seq that satisfies predicate; return it.

>>> find_if(callable, [3, min, max])

<built-in function min>

>>> find_if(callable, [1, 2, 3])

"""

for x in seq:

if predicate(x): return x

return None

def every(predicate, seq):

"""True if every element of seq satisfies predicate.

>>> every(callable, [min, max])

>>> every(callable, [min, 3])

"""

for x in seq:

if not predicate(x): return False

return True

def some(predicate, seq):

"""If some element x of seq satisfies predicate(x), return predicate(x).

>>> some(callable, [min, 3])

>>> some(callable, [2, 3])

"""

for x in seq:

px = predicate(x)

if px: return px

return False

def isin(elt, seq):

"""Like (elt in seq), but compares with is, not ==.

>>> e = []; isin(e, [1, e, 3])

True

>>> isin(e, [1, [], 3])

False

"""

for x in seq:

if elt is x: return True

return False

#______________________________________________________________________________

# Functions on sequences of numbers

# NOTE: these take the sequence argument first, like min and max,

# and like standard math notation: \sigma (i = 1..n) fn(i)

# A lot of programing is finding the best value that satisfies some condition;

# so there are three versions of argmin/argmax, depending on what you want to

# do with ties: return the first one, return them all, or pick at random.

def argmin(seq, fn):

"""Return an element with lowest fn(seq[i]) score; tie goes to first one.

>>> argmin(['one', 'to', 'three'], len)

'to'

"""

best = seq[0]; best_score = fn(best)

for x in seq:

x_score = fn(x)

if x_score < best_score:

best, best_score = x, x_score

return best

def argmin_list(seq, fn):

"""Return a list of elements of seq[i] with the lowest fn(seq[i]) scores.

>>> argmin_list(['one', 'to', 'three', 'or'], len)

['to', 'or']

"""

best_score, best = fn(seq[0]), []

for x in seq:

x_score = fn(x)

if x_score < best_score:

best, best_score = [x], x_score

elif x_score == best_score:

best.append(x)

return best

def argmin_random_tie(seq, fn):

"""Return an element with lowest fn(seq[i]) score; break ties at random.

Thus, for all s,f: argmin_random_tie(s, f) in argmin_list(s, f)"""

best_score = fn(seq[0]); n = 0

for x in seq:

x_score = fn(x)

if x_score < best_score:

best, best_score = x, x_score; n = 1

elif x_score == best_score:

n += 1

if random.randrange(n) == 0:

best = x

return best

def argmax(seq, fn):

"""Return an element with highest fn(seq[i]) score; tie goes to first one.

>>> argmax(['one', 'to', 'three'], len)

'three'

"""

return argmin(seq, lambda x: -fn(x))

def argmax_list(seq, fn):

"""Return a list of elements of seq[i] with the highest fn(seq[i]) scores.

>>> argmax_list(['one', 'three', 'seven'], len)

['three', 'seven']

"""

return argmin_list(seq, lambda x: -fn(x))

def argmax_random_tie(seq, fn):

"Return an element with highest fn(seq[i]) score; break ties at random."

return argmin_random_tie(seq, lambda x: -fn(x))

#______________________________________________________________________________

# Statistical and mathematical functions

def histogram(values, mode=0, bin_function=None):

"""Return a list of (value, count) pairs, summarizing the input values.

Sorted by increasing value, or if mode=1, by decreasing count.

If bin_function is given, map it over values first."""

if bin_function: values = map(bin_function, values)

bins = {}

for val in values:

bins[val] = bins.get(val, 0) + 1

if mode:

return sorted(bins.items(), key=lambda x: (x[1],x[0]), reverse=True)

else:

return sorted(bins.items())

def log2(x):

"""Base 2 logarithm.

>>> log2(1024)

10.0

"""

return math.log10(x) / math.log10(2)

def mode(values):

"""Return the most common value in the list of values.

>>> mode([1, 2, 3, 2])

"""

return histogram(values, mode=1)[0][0]

def median(values):

"""Return the middle value, when the values are sorted.

If there are an odd number of elements, try to average the middle two.

If they can't be averaged (e.g. they are strings), choose one at random.

>>> median([10, 100, 11])

>>> median([1, 2, 3, 4])

2.5

"""

n = len(values)

values = sorted(values)

if n % 2 == 1:

return values[n/2]

else:

middle2 = values[(n/2)-1:(n/2)+1]

try:

return mean(middle2)

except TypeError:

return random.choice(middle2)

def mean(values):

"""Return the arithmetic average of the values."""

return sum(values) / float(len(values))

def stddev(values, meanval=None):

"""The standard deviation of a set of values.

Pass in the mean if you already know it."""

if meanval is None: meanval = mean(values)

return math.sqrt(sum([(x - meanval)**2 for x in values]) / (len(values)-1))

def dotproduct(X, Y):

"""Return the sum of the element-wise product of vectors x and y.

>>> dotproduct([1, 2, 3], [1000, 100, 10])

1230

"""

return sum([x * y for x, y in zip(X, Y)])

def vector_add(a, b):

"""Component-wise addition of two vectors.

>>> vector_add((0, 1), (8, 9))

(8, 10)

"""

return tuple(map(operator.add, a, b))

def probability(p):

"Return true with probability p."

return p > random.uniform(0.0, 1.0)

def weighted_sample_with_replacement(seq, weights, n):

"""Pick n samples from seq at random, with replacement, with the

probability of each element in proportion to its corresponding

weight."""

sample = weighted_sampler(seq, weights)

return [sample() for s in range(n)]

def weighted_sampler(seq, weights):

"Return a random-sample function that picks from seq weighted by weights."

totals = []

for w in weights:

totals.append(w + totals[-1] if totals else w)

return lambda: seq[bisect.bisect(totals, random.uniform(0, totals[-1]))]

def num_or_str(x):

"""The argument is a string; convert to a number if possible, or strip it.

>>> num_or_str('42')

>>> num_or_str(' 42x ')

'42x'

"""

if isnumber(x): return x

try:

return int(x)

except ValueError:

try:

return float(x)

except ValueError:

return str(x).strip()

def normalize(numbers):

"""Multiply each number by a constant such that the sum is 1.0

>>> normalize([1,2,1])

[0.25, 0.5, 0.25]

"""

total = float(sum(numbers))

return [n / total for n in numbers]

def clip(x, lowest, highest):

"""Return x clipped to the range [lowest..highest].

>>> [clip(x, 0, 1) for x in [-1, 0.5, 10]]

[0, 0.5, 1]

"""

return max(lowest, min(x, highest))

#______________________________________________________________________________

## OK, the following are not as widely useful utilities as some of the other

## functions here, but they do show up wherever we have 2D grids: Wumpus and

## Vacuum worlds, TicTacToe and Checkers, and markov decision Processes.

orientations = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def turn_heading(heading, inc, headings=orientations):

return headings[(headings.index(heading) + inc) % len(headings)]

def turn_right(heading):

return turn_heading(heading, -1)

def turn_left(heading):

return turn_heading(heading, +1)

def distance((ax, ay), (bx, by)):

"The distance between two (x, y) points."

return math.hypot((ax - bx), (ay - by))

def distance2((ax, ay), (bx, by)):

"The square of the distance between two (x, y) points."

return (ax - bx)**2 + (ay - by)**2

def vector_clip(vector, lowest, highest):

"""Return vector, except if any element is less than the corresponding

value of lowest or more than the corresponding value of highest, clip to

those values.

>>> vector_clip((-1, 10), (0, 0), (9, 9))

(0, 9)

"""

return type(vector)(map(clip, vector, lowest, highest))

#______________________________________________________________________________

# Misc Functions

def printf(format, *args):

"""Format args with the first argument as format string, and write.

Return the last arg, or format itself if there are no args."""

sys.stdout.write(str(format) % args)

return if_(args, lambda: args[-1], lambda: format)

def caller(n=1):

"""Return the name of the calling function n levels up in the frame stack.

>>> caller(0)

'caller'

>>> def f():

... return caller()

>>> f()

'f'

"""

import inspect

return inspect.getouterframes(inspect.currentframe())[n][3]

def memoize(fn, slot=None):

"""Memoize fn: make it remember the computed value for any argument list.

If slot is specified, store result in that slot of first argument.

If slot is false, store results in a dictionary."""

if slot:

def memoized_fn(obj, *args):

if hasattr(obj, slot):

return getattr(obj, slot)

else:

val = fn(obj, *args)

setattr(obj, slot, val)

return val

else:

def memoized_fn(*args):

if not memoized_fn.cache.has_key(args):

memoized_fn.cache[args] = fn(*args)

return memoized_fn.cache[args]

memoized_fn.cache = {}

return memoized_fn

def if_(test, result, alternative):

"""Like C++ and Java's (test ? result : alternative), except

both result and alternative are always evaluated. However, if

either evaluates to a function, it is applied to the empty arglist,

so you can delay execution by putting it in a lambda.

>>> if_(2 + 2 == 4, 'ok', lambda: expensive_computation())

'ok'

"""

if test:

if callable(result): return result()

return result

else:

if callable(alternative): return alternative()

return alternative

def name(object):

"Try to find some reasonable name for the object."

return (getattr(object, 'name', 0) or getattr(object, '__name__', 0)

or getattr(getattr(object, '__class__', 0), '__name__', 0)

or str(object))

def isnumber(x):

"Is x a number? We say it is if it has a __int__ method."

return hasattr(x, '__int__')

def issequence(x):

"Is x a sequence? We say it is if it has a __getitem__ method."

return hasattr(x, '__getitem__')

def print_table(table, header=None, sep=' ', numfmt='%g'):

"""Print a list of lists as a table, so that columns line up nicely.

header, if specified, will be printed as the first row.

numfmt is the format for all numbers; you might want e.g. '%6.2f'.

(If you want different formats in different columns, don't use print_table.)

sep is the separator between columns."""

justs = [if_(isnumber(x), 'rjust', 'ljust') for x in table[0]]

if header:

table = [header] + table

table = [[if_(isnumber(x), lambda: numfmt % x, lambda: x) for x in row]

for row in table]

maxlen = lambda seq: max(map(len, seq))

sizes = map(maxlen, zip(*[map(str, row) for row in table]))

for row in table:

print sep.join(getattr(str(x), j)(size)

for (j, size, x) in zip(justs, sizes, row))

def AIMAFile(components, mode='r'):

"Open a file based at the AIMA root directory."

import utils

dir = os.path.dirname(utils.__file__)

return open(apply(os.path.join, [dir] + components), mode)

def DataFile(name, mode='r'):

"Return a file in the AIMA /data directory."

return AIMAFile(['..', 'data', name], mode)

def unimplemented():

"Use this as a stub for not-yet-implemented functions."

raise NotImplementedError

#______________________________________________________________________________

# Queues: Stack, FIFOQueue, PriorityQueue

class Queue:

"""Queue is an abstract class/interface. There are three types:

Stack(): A Last In First Out Queue.

FIFOQueue(): A First In First Out Queue.

PriorityQueue(order, f): Queue in sorted order (default min-first).

Each type supports the following methods and functions:

q.append(item) -- add an item to the queue

q.extend(items) -- equivalent to: for item in items: q.append(item)

q.pop() -- return the top item from the queue

len(q) -- number of items in q (also q.__len())

item in q -- does q contain item?

Note that isinstance(Stack(), Queue) is false, because we implement stacks

as lists. If Python ever gets interfaces, Queue will be an interface."""

def __init__(self):

abstract

def extend(self, items):

for item in items: self.append(item)

def Stack():

"""Return an empty list, suitable as a Last-In-First-Out Queue."""

return []

class FIFOQueue(Queue):

"""A First-In-First-Out Queue."""

def __init__(self):

self.A = []; self.start = 0

def append(self, item):

self.A.append(item)

def __len__(self):

return len(self.A) - self.start

def extend(self, items):

self.A.extend(items)

def pop(self):

e = self.A[self.start]

self.start += 1

if self.start > 5 and self.start > len(self.A)/2:

self.A = self.A[self.start:]

self.start = 0

return e

def __contains__(self, item):

return item in self.A[self.start:]

class PriorityQueue(Queue):

"""A queue in which the minimum (or maximum) element (as determined by f and

order) is returned first. If order is min, the item with minimum f(x) is

returned first; if order is max, then it is the item with maximum f(x).

Also supports dict-like lookup."""

def __init__(self, order=min, f=lambda x: x):

update(self, A=[], order=order, f=f)

def append(self, item):

bisect.insort(self.A, (self.f(item), item))

def __len__(self):

return len(self.A)

def pop(self):

if self.order == min:

return self.A.pop(0)[1]

else:

return self.A.pop()[1]

def __contains__(self, item):

return some(lambda (_, x): x == item, self.A)

def __getitem__(self, key):

for _, item in self.A:

if item == key:

return item

def __delitem__(self, key):

for i, (value, item) in enumerate(self.A):

if item == key:

self.A.pop(i)

return

## Fig: The idea is we can define things like Fig[3,10] later.

## Alas, it is Fig[3,10] not Fig[3.10], because that would be the same

## as Fig[3.1]

Fig = {}

#______________________________________________________________________________

# Support for doctest

def ignore(x): None

def random_tests(text):

"""Some functions are stochastic. We want to be able to write a test

with random output. We do that by ignoring the output."""

def fixup(test):

if " = " in test:

return ">>> " + test

else:

return ">>> ignore(" + test + ")"

tests = re.findall(">>> (.*)", text)

return '\n'.join(map(fixup, tests))

#______________________________________________________________________________

__doc__ += """

>>> d = DefaultDict(0)

>>> d['x'] += 1

>>> d['x']

>>> d = DefaultDict([])

>>> d['x'] += [1]

>>> d['y'] += [2]

>>> d['x']

[1]

>>> s = Struct(a=1, b=2)

>>> s.a

>>> s.a = 3

>>> s

Struct(a=3, b=2)

>>> def is_even(x):

... return x % 2 == 0

>>> sorted([1, 2, -3])

[-3, 1, 2]

>>> sorted(range(10), key=is_even)

[1, 3, 5, 7, 9, 0, 2, 4, 6, 8]

>>> sorted(range(10), lambda x,y: y-x)

[9, 8, 7, 6, 5, 4, 3, 2, 1, 0]

>>> removeall(4, [])

[]

>>> removeall('s', 'This is a test. Was a test.')

'Thi i a tet. Wa a tet.'

>>> removeall('s', 'Something')

'Something'

>>> removeall('s', '')

>>> list(reversed([]))

[]

>>> count_if(is_even, [1, 2, 3, 4])

>>> count_if(is_even, [])

>>> argmax([1], lambda x: x*x)

>>> argmin([1], lambda x: x*x)

# Test of memoize with slots in structures

>>> countries = [Struct(name='united states'), Struct(name='canada')]

# Pretend that 'gnp' was some big hairy operation:

>>> def gnp(country):

... print 'calculating gnp ...'

... return len(country.name) * 1e10

>>> gnp = memoize(gnp, '_gnp')

>>> map(gnp, countries)

calculating gnp ...

[130000000000.0, 60000000000.0]

>>> countries

[Struct(_gnp=130000000000.0, name='united states'), Struct(_gnp=60000000000.0, name='canada')]

# This time we avoid re-doing the calculation

>>> map(gnp, countries)

[130000000000.0, 60000000000.0]

# Test Queues:

>>> nums = [1, 8, 2, 7, 5, 6, -99, 99, 4, 3, 0]

>>> def qtest(q):

... q.extend(nums)

... for num in nums: assert num in q

... assert 42 not in q

... return [q.pop() for i in range(len(q))]

>>> qtest(Stack())

[0, 3, 4, 99, -99, 6, 5, 7, 2, 8, 1]

>>> qtest(FIFOQueue())

[1, 8, 2, 7, 5, 6, -99, 99, 4, 3, 0]

>>> qtest(PriorityQueue(min))

[-99, 0, 1, 2, 3, 4, 5, 6, 7, 8, 99]

>>> qtest(PriorityQueue(max))

[99, 8, 7, 6, 5, 4, 3, 2, 1, 0, -99]

>>> qtest(PriorityQueue(min, abs))

[0, 1, 2, 3, 4, 5, 6, 7, 8, -99, 99]

>>> qtest(PriorityQueue(max, abs))

[99, -99, 8, 7, 6, 5, 4, 3, 2, 1, 0]

>>> vals = [100, 110, 160, 200, 160, 110, 200, 200, 220]

>>> histogram(vals)

[(100, 1), (110, 2), (160, 2), (200, 3), (220, 1)]

>>> histogram(vals, 1)

[(200, 3), (160, 2), (110, 2), (220, 1), (100, 1)]

>>> histogram(vals, 1, lambda v: round(v, -2))

[(200.0, 6), (100.0, 3)]

>>> log2(1.0)

0.0

>>> def fib(n):

... return (n<=1 and 1) or (fib(n-1) + fib(n-2))

>>> fib(9)

# Now we make it faster:

>>> fib = memoize(fib)

>>> fib(9)

>>> q = Stack()

>>> q.append(1)

>>> q.append(2)

>>> q.pop(), q.pop()

(2, 1)

>>> q = FIFOQueue()

>>> q.append(1)

>>> q.append(2)

>>> q.pop(), q.pop()

(1, 2)

>>> abc = set('abc')

>>> bcd = set('bcd')

>>> 'a' in abc

True

>>> 'a' in bcd

False

>>> list(abc.intersection(bcd))

['c', 'b']

>>> list(abc.union(bcd))

['a', 'c', 'b', 'd']

## From "What's new in Python 2.4", but I added calls to sl

>>> def sl(x):

... return sorted(list(x))

>>> a = set('abracadabra') # form a set from a string

>>> 'z' in a # fast membership testing

False

>>> sl(a) # unique letters in a

['a', 'b', 'c', 'd', 'r']

>>> b = set('alacazam') # form a second set

>>> sl(a - b) # letters in a but not in b

['b', 'd', 'r']

>>> sl(a | b) # letters in either a or b

['a', 'b', 'c', 'd', 'l', 'm', 'r', 'z']

>>> sl(a & b) # letters in both a and b

['a', 'c']

>>> sl(a ^ b) # letters in a or b but not both

['b', 'd', 'l', 'm', 'r', 'z']

>>> a.add('z') # add a new element

>>> a.update('wxy') # add multiple new elements

>>> sl(a)

['a', 'b', 'c', 'd', 'r', 'w', 'x', 'y', 'z']

>>> a.remove('x') # take one element out

>>> sl(a)

['a', 'b', 'c', 'd', 'r', 'w', 'y', 'z']

>>> weighted_sample_with_replacement([], [], 0)

[]

>>> weighted_sample_with_replacement('a', [3], 2)

['a', 'a']

>>> weighted_sample_with_replacement('ab', [0, 3], 3)

['b', 'b', 'b']

"""

__doc__ += random_tests("""

>>> weighted_sample_with_replacement(range(10), [x*x for x in range(10)], 3)

[8, 9, 6]

""")

aima-python/utils.py at gitignore · OrkoHunter/aima-python · GitHub

Repository navigation

Expand file tree

Breadcrumbs

utils.py

Latest commit

History

Breadcrumbs

utils.py

File metadata and controls