Hide keyboard shortcuts

Hot-keys on this page

r m x p   toggle line displays

j k   next/prev highlighted chunk

0   (zero) top of page

1   (one) first highlighted chunk

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

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

# -*- coding: utf-8 -*- 

""" 

Lazy strings 

  

Based on speaklater: https://github.com/mitsuhiko/speaklater. 

  

A lazy string is an object that behaves almost exactly like a string 

but where the value is not computed until needed. To define a lazy 

string you specify a function that produces a string together with the 

appropriate arguments for that function. Sage uses lazy strings in 

:mod:`sage.misc.misc` so that the filenames for SAGE_TMP (which 

depends on the pid of the process running Sage) are not computed when 

importing the Sage library. This means that when the doctesting code 

imports the Sage library and then forks, the variable SAGE_TMP depends 

on the new pid rather than the old one. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: L = [] 

sage: s = lazy_string(lambda x: str(len(x)), L) 

sage: L.append(5) 

sage: s 

l'1' 

  

Note that the function is recomputed each time:: 

  

sage: L.append(6) 

sage: s 

l'2' 

""" 

  

#Copyright (c) 2009 by Armin Ronacher. 

# 

#Some rights reserved. 

# 

#Redistribution and use in source and binary forms, with or without 

#modification, are permitted provided that the following conditions are 

#met: 

# 

# * Redistributions of source code must retain the above copyright 

# notice, this list of conditions and the following disclaimer. 

# 

# * Redistributions in binary form must reproduce the above 

# copyright notice, this list of conditions and the following 

# disclaimer in the documentation and/or other materials provided 

# with the distribution. 

# 

# * The names of the contributors may not be used to endorse or 

# promote products derived from this software without specific 

# prior written permission. 

# 

#THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 

#"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 

#LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 

#A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 

#OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 

#SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 

#LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 

#DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 

#THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 

#(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 

#OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 

from __future__ import print_function, absolute_import 

  

from cpython.object cimport PyObject_Call, PyObject_RichCompare 

  

import types 

  

def is_lazy_string(obj): 

""" 

Checks if the given object is a lazy string. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string, is_lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: is_lazy_string(s) 

True 

""" 

return isinstance(obj, _LazyString) 

  

def lazy_string(f, *args, **kwargs): 

""" 

Creates a lazy string. 

  

INPUT: 

  

- ``f``, either a callable or a (format) string 

- positional arguments that are given to ``f``, either by calling or by 

applying it as a format string 

- named arguments, that are forwarded to ``f`` if it is not a string 

  

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda x: "laziness in "+str(x) 

sage: s = lazy_string(f, ZZ); s 

l'laziness in Integer Ring' 

  

Here, we demonstrate that the evaluation is postponed until the value is 

needed, and that the result is not cached:: 

  

sage: class C: 

....: def __repr__(self): 

....: print("determining string representation") 

....: return "a test" 

sage: c = C() 

sage: s = lazy_string("this is %s", c) 

sage: s 

determining string representation 

l'this is a test' 

sage: s == 'this is a test' 

determining string representation 

True 

sage: unicode(s) 

determining string representation 

u'this is a test' 

  

""" 

return _LazyString(f, args, kwargs) 

  

def _make_lazy_string(ftype, fpickle, args, kwargs): 

""" 

Used for pickling. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import _make_lazy_string 

sage: s = _make_lazy_string(None, lambda: "laziness", (), {}) 

sage: s 

l'laziness' 

""" 

if ftype == 'func': 

from sage.misc.fpickle import unpickle_function 

f = unpickle_function(fpickle) 

else: 

f = fpickle 

return _LazyString(f, args, kwargs) 

  

cdef class _LazyString(object): 

""" 

Lazy class for strings created by a function call or a format string. 

  

INPUT: 

  

- ``f``, either a callable or a (format) string 

- ``args``, a tuple of arguments that are given to ``f``, either by calling 

or by applying it as a format string 

- ``kwargs``, a dictionary of optional arguments, that are forwarded to ``f`` 

if it is a callable. 

  

.. NOTE:: 

  

Evaluation of ``f`` is postponed until it becomes necessary, e.g., for 

comparison. The result of evaluation is not cached. The proxy 

implementation attempts to be as complete as possible, so that the 

lazy objects should mostly work as expected, for example for sorting. 

  

The function :func:`lazy_string` creates lazy strings in a slightly more 

convenient way, because it is then not needed to provide the arguments as 

tuple and dictionary. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string, _LazyString 

sage: f = lambda x: "laziness in the " + repr(x) 

sage: s = lazy_string(f, ZZ); s 

l'laziness in the Integer Ring' 

sage: lazy_string("laziness in the %s", ZZ) 

l'laziness in the Integer Ring' 

  

Here, we demonstrate that the evaluation is postponed until the value is 

needed, and that the result is not cached. Also, we create a lazy string directly, 

without calling :func:`lazy_string`:: 

  

sage: class C: 

....: def __repr__(self): 

....: print("determining string representation") 

....: return "a test" 

sage: c = C() 

sage: s = _LazyString("this is %s", (c,), {}) 

sage: s 

determining string representation 

l'this is a test' 

sage: s == 'this is a test' 

determining string representation 

True 

sage: unicode(s) 

determining string representation 

u'this is a test' 

  

""" 

  

def __init__(self, f, args, kwargs): 

""" 

INPUT: 

  

- ``f``, either a callable or a (format) string 

- ``args``, a tuple of arguments that are given to ``f``, either by calling 

or by applying it as a format string 

- ``kwargs``, a dictionary of optional arguments, that are forwarded to ``f`` 

if it is a callable. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda x: "laziness" + repr(x) 

sage: s = lazy_string(f, 5); s 

l'laziness5' 

sage: lazy_string("This is %s", ZZ) 

l'This is Integer Ring' 

sage: lazy_string(u"This is %s", ZZ) 

lu'This is Integer Ring' 

""" 

self.func = f 

self.args = <tuple?>args 

self.kwargs = <dict?>kwargs 

  

cdef val(self): 

cdef f = self.func 

if isinstance(f, basestring): 

return f % self.args 

return PyObject_Call(f, self.args, self.kwargs) 

  

@property 

def value(self): 

""" 

Return the value of this lazy string, as an ordinary string. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: lazy_string(f).value 

'laziness' 

  

:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: lazy_string("%s", "laziness").value 

'laziness' 

""" 

return self.val() 

  

def __contains__(self, key): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: 'zi' in s 

True 

sage: 'ni' in s 

False 

""" 

return key in self.val() 

  

def __nonzero__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: bool(lazy_string(f)) 

True 

sage: f = lambda: "" 

sage: bool(lazy_string(f)) 

False 

""" 

return bool(self.val()) 

  

def __dir__(self): 

""" 

We assume that the underlying value provides the methods of a 

unicode string. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: "split" in dir(s) # indirect doctest 

True 

""" 

return dir(unicode) 

  

def __iter__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: "".join(list(s)) # indirect doctest 

'laziness' 

""" 

return iter(self.val()) 

  

def __len__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: len(s) 

8 

""" 

return len(self.val()) 

  

def __str__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: str(s) # indirect doctest 

'laziness' 

""" 

return str(self.val()) 

  

def __fspath__(self): 

""" 

Return the file system representation of ``self``, assuming that 

``self`` is a path. 

  

This is for Python 3 compatibility: see :trac:`24046`, and also 

:pep:`519` and 

https://docs.python.org/3/library/os.html#os.fspath 

  

Test :trac:`24046`:: 

  

sage: from sage.misc.misc import SAGE_TMP 

sage: tmp = os.path.join(SAGE_TMP, 'hello') 

sage: _ = os.path.exists(tmp) 

""" 

return str(self) 

  

def __unicode__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: unicode(s) # indirect doctest 

u'laziness' 

""" 

return unicode(self.val()) 

  

def __add__(self, other): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s + " supreme" 

'laziness supreme' 

""" 

if isinstance(self, _LazyString): 

return (<_LazyString>self).val() + other 

else: 

return self + (<_LazyString>other).val() 

  

def __mod__(self, other): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laz%sss" 

sage: s = lazy_string(f) 

sage: s % "ine" 

'laziness' 

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "ine" 

sage: s = lazy_string(f) 

sage: "laz%sss" % s 

'laziness' 

""" 

if isinstance(self, _LazyString): 

return (<_LazyString>self).val() % other 

else: 

return self % (<_LazyString>other).val() 

  

def __mul__(self, other): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s * 2 

'lazinesslaziness' 

sage: 2 * s 

'lazinesslaziness' 

""" 

if isinstance(self, _LazyString): 

return (<_LazyString>self).val() * other 

else: 

return self * (<_LazyString>other).val() 

  

def __richcmp__(_LazyString self, other, int op): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s < 'laziness' 

False 

sage: s < 'azi' 

False 

sage: s < s 

False 

sage: s <= 'laziness' 

True 

sage: s <= 'azi' 

False 

sage: s <= s 

True 

sage: s == 'laziness' 

True 

sage: s == 'azi' 

False 

sage: s == s 

True 

sage: s != 'laziness' 

False 

sage: s != 'azi' 

True 

sage: s != s 

False 

sage: s > 'laziness' 

False 

sage: s > 'azi' 

True 

sage: s > s 

False 

sage: s >= 'laziness' 

True 

sage: s >= 'azi' 

True 

sage: s >= s 

True 

""" 

return PyObject_RichCompare(self.val(), other, op) 

  

def __getattr__(self, name): 

""" 

We pass attribute lookup through to the underlying value. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s.endswith('ess') 

True 

sage: s.find('i') 

3 

""" 

if name == '__members__': 

return self.__dir__() 

return getattr(self.val(), name) 

  

def __reduce__(self): 

""" 

Pickling. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: TestSuite(s).run() # indirect doctest 

""" 

if isinstance(self.func, types.FunctionType): 

from sage.misc.fpickle import pickle_function 

f = pickle_function(self.func) 

ftype = 'func' 

else: 

f = self.func 

ftype = None 

return _make_lazy_string, (ftype, f, self.args, self.kwargs) 

  

def __getitem__(self, key): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s[4] 

'n' 

""" 

return self.val()[key] 

  

def __copy__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: copy(s) is s 

True 

""" 

return self 

  

def __repr__(self): 

""" 

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda: "laziness" 

sage: s = lazy_string(f) 

sage: s # indirect doctest 

l'laziness' 

""" 

try: 

return 'l' + repr(self.val()) 

except Exception: 

return '<%s broken>' % self.__class__.__name__ 

  

cpdef update_lazy_string(self, args, kwds): 

""" 

Change this lazy string in-place. 

  

INPUT: 

  

- ``args``, a tuple 

- ``kwds``, a dict 

  

.. NOTE:: 

  

Lazy strings are not hashable, and thus an in-place change is 

allowed. 

  

EXAMPLES:: 

  

sage: from sage.misc.lazy_string import lazy_string 

sage: f = lambda op,A,B:"unsupported operand parent(s) for %s: '%s' and '%s'"%(op,A,B) 

sage: R = GF(5) 

sage: S = GF(3) 

sage: D = lazy_string(f, '+', R, S) 

sage: D 

l"unsupported operand parent(s) for +: 'Finite Field of size 5' and 'Finite Field of size 3'" 

sage: D.update_lazy_string(('+', S, R), {}) 

  

Apparently, the lazy string got changed in-place:: 

  

sage: D 

l"unsupported operand parent(s) for +: 'Finite Field of size 3' and 'Finite Field of size 5'" 

  

TESTS:: 

  

sage: D.update_lazy_string(None, None) 

Traceback (most recent call last): 

... 

TypeError: Expected tuple, got NoneType 

""" 

self.args = <tuple?>args 

self.kwargs = <dict?>kwds