regina 7.3.1__cp311-cp311-macosx_11_0_arm64.whl → 7.3.1.1__cp311-cp311-macosx_11_0_arm64.whl

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Potentially problematic release.


This version of regina might be problematic. Click here for more details.

@@ -2,35 +2,35 @@ Help on instancemethod in module regina.engine:
2
2
 
3
3
  boundaryComponents(...)
4
4
  boundaryComponents(self: regina.Triangulation6) -> <internal>.ListView[regina.BoundaryComponent6]
5
-
5
+
6
6
  Returns an object that allows iteration through and random access to
7
7
  all boundary components of this triangulation.
8
-
8
+
9
9
  Note that, in Regina's standard dimensions, each ideal vertex forms
10
10
  its own boundary component, and some invalid vertices do also. See the
11
11
  BoundaryComponent class notes for full details on what constitutes a
12
12
  boundary component in standard and non-standard dimensions.
13
-
13
+
14
14
  The object that is returned is lightweight, and can be happily copied
15
15
  by value. The C++ type of the object is subject to change, so C++
16
16
  users should use ``auto`` (just like this declaration does).
17
-
17
+
18
18
  The returned object is guaranteed to be an instance of ListView, which
19
19
  means it offers basic container-like functions and supports range-
20
20
  based ``for`` loops. Note that the elements of the list will be
21
21
  pointers, so your code might look like:
22
-
22
+
23
23
  ```
24
24
  for (BoundaryComponent<dim>* b : tri.boundaryComponents()) { ... }
25
25
  ```
26
-
26
+
27
27
  The object that is returned will remain up-to-date and valid for as
28
28
  long as the triangulation exists. In contrast, however, remember that
29
29
  the individual boundary components _within_ this list will be deleted
30
30
  and replaced each time the triangulation changes. Therefore it is best
31
31
  to treat this object as temporary only, and to call
32
32
  boundaryComponents() again each time you need it.
33
-
33
+
34
34
  Returns:
35
35
  access to the list of all boundary components.
36
36
 
@@ -38,30 +38,30 @@ Help on instancemethod in module regina.engine:
38
38
 
39
39
  components(...)
40
40
  components(self: regina.Triangulation6) -> <internal>.ListView[regina.Component6]
41
-
41
+
42
42
  Returns an object that allows iteration through and random access to
43
43
  all components of this triangulation.
44
-
44
+
45
45
  The object that is returned is lightweight, and can be happily copied
46
46
  by value. The C++ type of the object is subject to change, so C++
47
47
  users should use ``auto`` (just like this declaration does).
48
-
48
+
49
49
  The returned object is guaranteed to be an instance of ListView, which
50
50
  means it offers basic container-like functions and supports range-
51
51
  based ``for`` loops. Note that the elements of the list will be
52
52
  pointers, so your code might look like:
53
-
53
+
54
54
  ```
55
55
  for (Component<dim>* c : tri.components()) { ... }
56
56
  ```
57
-
57
+
58
58
  The object that is returned will remain up-to-date and valid for as
59
59
  long as the triangulation exists. In contrast, however, remember that
60
60
  the individual component objects _within_ this list will be deleted
61
61
  and replaced each time the triangulation changes. Therefore it is best
62
62
  to treat this object as temporary only, and to call components() again
63
63
  each time you need it.
64
-
64
+
65
65
  Returns:
66
66
  access to the list of all components.
67
67
 
@@ -69,11 +69,11 @@ Help on instancemethod in module regina.engine:
69
69
 
70
70
  faces(...)
71
71
  faces(self: regina.Triangulation6, arg0: int) -> Union[<internal>.ListView[regina.Vertex6], <internal>.ListView[regina.Edge6], <internal>.ListView[regina.Triangle6], <internal>.ListView[regina.Tetrahedron6], <internal>.ListView[regina.Pentachoron6], <internal>.ListView[regina.Face6_5]]
72
-
72
+
73
73
  Returns an object that allows iteration through and random access to
74
74
  all *subdim*-faces of this triangulation, in a way that is optimised
75
75
  for Python programmers.
76
-
76
+
77
77
  C++ users should not use this routine. The return type must be fixed
78
78
  at compile time, and so it is a std::variant that can hold any of the
79
79
  lightweight return types from the templated faces<subdim>() function.
@@ -81,19 +81,19 @@ faces(...)
81
81
  knowledge of *subdim* to extract and use the appropriate face objects.
82
82
  However, once you know *subdim* at compile time, you are much better
83
83
  off using the (simpler and faster) routine faces<subdim>() instead.
84
-
84
+
85
85
  For Python users, this routine is much more useful: the return type
86
86
  can be chosen at runtime, and so this routine returns a Python list of
87
87
  Face<dim, subdim> objects (holding all the *subdim*-faces of the
88
88
  triangulation), which you can use immediately.
89
-
89
+
90
90
  Exception ``InvalidArgument``:
91
91
  The face dimension *subdim* is outside the supported range (i.e.,
92
92
  negative, or greater than or equal to *dim*).
93
-
93
+
94
94
  Parameter ``subdim``:
95
95
  the face dimension; this must be between 0 and *dim*-1 inclusive.
96
-
96
+
97
97
  Returns:
98
98
  access to the list of all *subdim*-faces.
99
99
 
@@ -101,10 +101,10 @@ Help on instancemethod in module regina.engine:
101
101
 
102
102
  face(...)
103
103
  face(self: regina.Triangulation6, arg0: int, arg1: int) -> Union[regina.Vertex6, regina.Edge6, regina.Triangle6, regina.Tetrahedron6, regina.Pentachoron6, regina.Face6_5]
104
-
104
+
105
105
  Returns the requested *subdim*-face of this triangulation, in a way
106
106
  that is optimised for Python programmers.
107
-
107
+
108
108
  For C++ users, this routine is not very useful: since precise types
109
109
  must be know at compile time, this routine returns a std::variant *v*
110
110
  that could store a pointer to any class Face<dim, ...>. This means you
@@ -113,26 +113,26 @@ face(...)
113
113
  appropriate Face<dim, subdim> object from *v*. However, once you know
114
114
  *subdim* at compile time, you are better off using the (simpler and
115
115
  faster) routine face<subdim>() instead.
116
-
116
+
117
117
  For Python users, this routine is much more useful: the return type
118
118
  can be chosen at runtime, and so this routine simply returns a
119
119
  Face<dim, subdim> object of the appropriate face dimension that you
120
120
  can use immediately.
121
-
121
+
122
122
  The specific return type for C++ programmers will be
123
123
  std::variant<Face<dim, 0>*, ..., Face<dim, dim-1>*>.
124
-
124
+
125
125
  Exception ``InvalidArgument``:
126
126
  The face dimension *subdim* is outside the supported range (i.e.,
127
127
  negative, or greater than or equal to *dim*).
128
-
128
+
129
129
  Parameter ``subdim``:
130
130
  the face dimension; this must be between 0 and *dim*-1 inclusive.
131
-
131
+
132
132
  Parameter ``index``:
133
133
  the index of the desired face, ranging from 0 to
134
134
  countFaces<subdim>()-1 inclusive.
135
-
135
+
136
136
  Returns:
137
137
  the requested face.
138
138
 
@@ -140,30 +140,30 @@ Help on instancemethod in module regina.engine:
140
140
 
141
141
  simplices(...)
142
142
  simplices(self: regina.Triangulation6) -> <internal>.ListView[regina.Simplex6]
143
-
143
+
144
144
  Returns an object that allows iteration through and random access to
145
145
  all top-dimensional simplices in this triangulation.
146
-
146
+
147
147
  The object that is returned is lightweight, and can be happily copied
148
148
  by value. The C++ type of the object is subject to change, so C++
149
149
  users should use ``auto`` (just like this declaration does).
150
-
150
+
151
151
  The returned object is guaranteed to be an instance of ListView, which
152
152
  means it offers basic container-like functions and supports range-
153
153
  based ``for`` loops. Note that the elements of the list will be
154
154
  pointers, so your code might look like:
155
-
155
+
156
156
  ```
157
157
  for (Simplex<dim>* s : tri.simplices()) { ... }
158
158
  ```
159
-
159
+
160
160
  The object that is returned will remain up-to-date and valid for as
161
161
  long as the triangulation exists: even as simplices are added and/or
162
162
  removed, it will always reflect the simplices that are currently in
163
163
  the triangulation. Nevertheless, it is recommended to treat this
164
164
  object as temporary only, and to call simplices() again each time you
165
165
  need it.
166
-
166
+
167
167
  Returns:
168
168
  access to the list of all top-dimensional simplices.
169
169
 
@@ -171,11 +171,11 @@ Help on instancemethod in module regina.engine:
171
171
 
172
172
  faces(...)
173
173
  faces(self: regina.Triangulation4, arg0: int) -> Union[<internal>.ListView[regina.Vertex4], <internal>.ListView[regina.Edge4], <internal>.ListView[regina.Triangle4], <internal>.ListView[regina.Tetrahedron4]]
174
-
174
+
175
175
  Returns an object that allows iteration through and random access to
176
176
  all *subdim*-faces of this triangulation, in a way that is optimised
177
177
  for Python programmers.
178
-
178
+
179
179
  C++ users should not use this routine. The return type must be fixed
180
180
  at compile time, and so it is a std::variant that can hold any of the
181
181
  lightweight return types from the templated faces<subdim>() function.
@@ -183,19 +183,19 @@ faces(...)
183
183
  knowledge of *subdim* to extract and use the appropriate face objects.
184
184
  However, once you know *subdim* at compile time, you are much better
185
185
  off using the (simpler and faster) routine faces<subdim>() instead.
186
-
186
+
187
187
  For Python users, this routine is much more useful: the return type
188
188
  can be chosen at runtime, and so this routine returns a Python list of
189
189
  Face<dim, subdim> objects (holding all the *subdim*-faces of the
190
190
  triangulation), which you can use immediately.
191
-
191
+
192
192
  Exception ``InvalidArgument``:
193
193
  The face dimension *subdim* is outside the supported range (i.e.,
194
194
  negative, or greater than or equal to *dim*).
195
-
195
+
196
196
  Parameter ``subdim``:
197
197
  the face dimension; this must be between 0 and *dim*-1 inclusive.
198
-
198
+
199
199
  Returns:
200
200
  access to the list of all *subdim*-faces.
201
201
 
@@ -203,10 +203,10 @@ Help on instancemethod in module regina.engine:
203
203
 
204
204
  face(...)
205
205
  face(self: regina.Triangulation4, arg0: int, arg1: int) -> Union[regina.Vertex4, regina.Edge4, regina.Triangle4, regina.Tetrahedron4]
206
-
206
+
207
207
  Returns the requested *subdim*-face of this triangulation, in a way
208
208
  that is optimised for Python programmers.
209
-
209
+
210
210
  For C++ users, this routine is not very useful: since precise types
211
211
  must be know at compile time, this routine returns a std::variant *v*
212
212
  that could store a pointer to any class Face<dim, ...>. This means you
@@ -215,26 +215,26 @@ face(...)
215
215
  appropriate Face<dim, subdim> object from *v*. However, once you know
216
216
  *subdim* at compile time, you are better off using the (simpler and
217
217
  faster) routine face<subdim>() instead.
218
-
218
+
219
219
  For Python users, this routine is much more useful: the return type
220
220
  can be chosen at runtime, and so this routine simply returns a
221
221
  Face<dim, subdim> object of the appropriate face dimension that you
222
222
  can use immediately.
223
-
223
+
224
224
  The specific return type for C++ programmers will be
225
225
  std::variant<Face<dim, 0>*, ..., Face<dim, dim-1>*>.
226
-
226
+
227
227
  Exception ``InvalidArgument``:
228
228
  The face dimension *subdim* is outside the supported range (i.e.,
229
229
  negative, or greater than or equal to *dim*).
230
-
230
+
231
231
  Parameter ``subdim``:
232
232
  the face dimension; this must be between 0 and *dim*-1 inclusive.
233
-
233
+
234
234
  Parameter ``index``:
235
235
  the index of the desired face, ranging from 0 to
236
236
  countFaces<subdim>()-1 inclusive.
237
-
237
+
238
238
  Returns:
239
239
  the requested face.
240
240
 
@@ -242,41 +242,41 @@ Help on instancemethod in module regina.engine:
242
242
 
243
243
  embeddings(...)
244
244
  embeddings(self: regina.Vertex6) -> <internal>.ListView[regina.VertexEmbedding6]
245
-
245
+
246
246
  Returns an object that allows iteration through and random access to
247
247
  all of the ways in which this face appears within a top-dimensional
248
248
  simplex of the underlying triangluation.
249
-
249
+
250
250
  The object that is returned is lightweight, and can be happily copied
251
251
  by value. The C++ type of the object is subject to change, so C++
252
252
  users should use ``auto`` (just like this declaration does).
253
-
253
+
254
254
  The returned object is guaranteed to be an instance of ListView, which
255
255
  means it offers basic container-like functions and supports range-
256
256
  based ``for`` loops. The elements of the list will be read-only
257
257
  objects of type FaceEmbedding<dim, subdim>. For example, your code
258
258
  might look like:
259
-
259
+
260
260
  ```
261
261
  Face<dim, subdim>* face = ...;
262
262
  for (const auto& emb : face->embeddings()) { ... }
263
263
  ```
264
-
264
+
265
265
  In most cases, the ordering of appearances is arbitrary. The exception
266
266
  is for codimension 2, where these appearances are ordered in a way
267
267
  that follows the link around the face (which in codimension 2 is
268
268
  always a path or a cycle).
269
-
269
+
270
270
  Using embeddings() is equivalent to iterating over the face itself. It
271
271
  generates a tiny amount of extra overhead, but also may be considered
272
272
  more readable. In particular, the code above is equivalent to both of
273
273
  the following alternatives:
274
-
274
+
275
275
  ```
276
276
  Face<dim, subdim>* face = ...;
277
277
  for (const auto& emb : *face) { ... }
278
278
  ```
279
-
279
+
280
280
  ```
281
281
  Face<dim, subdim>* face = ...;
282
282
  for (size_t i = 0; i < face->degree(); ++i) {
@@ -284,7 +284,7 @@ embeddings(...)
284
284
  ...
285
285
  }
286
286
  ```
287
-
287
+
288
288
  Returns:
289
289
  access to the list of all appearances of this face within a top-
290
290
  dimensional simplex of the underlying triangulation.
@@ -293,41 +293,41 @@ Help on instancemethod in module regina.engine:
293
293
 
294
294
  embeddings(...)
295
295
  embeddings(self: regina.Vertex3) -> <internal>.ListView[regina.VertexEmbedding3]
296
-
296
+
297
297
  Returns an object that allows iteration through and random access to
298
298
  all of the ways in which this face appears within a top-dimensional
299
299
  simplex of the underlying triangluation.
300
-
300
+
301
301
  The object that is returned is lightweight, and can be happily copied
302
302
  by value. The C++ type of the object is subject to change, so C++
303
303
  users should use ``auto`` (just like this declaration does).
304
-
304
+
305
305
  The returned object is guaranteed to be an instance of ListView, which
306
306
  means it offers basic container-like functions and supports range-
307
307
  based ``for`` loops. The elements of the list will be read-only
308
308
  objects of type FaceEmbedding<dim, subdim>. For example, your code
309
309
  might look like:
310
-
310
+
311
311
  ```
312
312
  Face<dim, subdim>* face = ...;
313
313
  for (const auto& emb : face->embeddings()) { ... }
314
314
  ```
315
-
315
+
316
316
  In most cases, the ordering of appearances is arbitrary. The exception
317
317
  is for codimension 2, where these appearances are ordered in a way
318
318
  that follows the link around the face (which in codimension 2 is
319
319
  always a path or a cycle).
320
-
320
+
321
321
  Using embeddings() is equivalent to iterating over the face itself. It
322
322
  generates a tiny amount of extra overhead, but also may be considered
323
323
  more readable. In particular, the code above is equivalent to both of
324
324
  the following alternatives:
325
-
325
+
326
326
  ```
327
327
  Face<dim, subdim>* face = ...;
328
328
  for (const auto& emb : *face) { ... }
329
329
  ```
330
-
330
+
331
331
  ```
332
332
  Face<dim, subdim>* face = ...;
333
333
  for (size_t i = 0; i < face->degree(); ++i) {
@@ -335,7 +335,7 @@ embeddings(...)
335
335
  ...
336
336
  }
337
337
  ```
338
-
338
+
339
339
  Returns:
340
340
  access to the list of all appearances of this face within a top-
341
341
  dimensional simplex of the underlying triangulation.
@@ -344,20 +344,20 @@ Help on instancemethod in module regina.engine:
344
344
 
345
345
  vertex(...)
346
346
  vertex(self: regina.Edge6, arg0: int) -> regina.Vertex6
347
-
347
+
348
348
  A dimension-specific alias for face<0>().
349
-
349
+
350
350
  This alias is available for all facial dimensions *subdim*.
351
-
351
+
352
352
  See face() for further information.
353
353
 
354
354
  Help on instancemethod in module regina.engine:
355
355
 
356
356
  triangulation(...)
357
357
  triangulation(self: regina.BoundaryComponent3) -> regina.Triangulation3
358
-
358
+
359
359
  Returns the triangulation to which this boundary component belongs.
360
-
360
+
361
361
  Returns:
362
362
  a reference to the triangulation containing this boundary
363
363
  component.
@@ -366,33 +366,33 @@ Help on instancemethod in module regina.engine:
366
366
 
367
367
  packet(...)
368
368
  packet(self: regina.Link) -> regina.PacketOfLink
369
-
369
+
370
370
  Returns the packet that holds this data, if there is one.
371
-
371
+
372
372
  If this object is being held by a packet *p* of type PacketOf<Held>,
373
373
  then that packet *p* will be returned. Otherwise, if this is a
374
374
  "standalone" object of type Held, then this routine will return
375
375
  ``None``.
376
-
376
+
377
377
  There is a special case when dealing with a packet *q* that holds a
378
378
  SnapPea triangulation. Here *q* is of type
379
379
  PacketOf<SnapPeaTriangulation>, and it holds a Triangulation<3>
380
380
  "indirectly" in the sense that Packetof<SnapPeaTriangulation> derives
381
381
  from SnapPeaTriangulation, which in turn derives from
382
382
  Triangulation<3>. In this scenario:
383
-
383
+
384
384
  * calling Triangulation<3>::packet() will return ``None``, since there
385
385
  is no "direct" PacketOf<Triangulation<3>>;
386
-
386
+
387
387
  * calling SnapPeaTriangulation::packet() will return the enclosing
388
388
  packet *q*, since there is a PacketOf<SnapPeaTriangulation>;
389
-
389
+
390
390
  * calling the special routine Triangulation<3>::inAnyPacket() will
391
391
  also return the "indirect" enclosing packet *q*.
392
-
392
+
393
393
  The function inAnyPacket() is specific to Triangulation<3>, and is not
394
394
  offered for other *Held* types.
395
-
395
+
396
396
  Returns:
397
397
  the packet that holds this data, or ``None`` if this data is not
398
398
  (directly) held by a packet.
@@ -402,91 +402,91 @@ Help on instancemethod in module regina.engine:
402
402
  __init__(...)
403
403
  __init__(*args, **kwargs)
404
404
  Overloaded function.
405
-
405
+
406
406
  1. __init__(self: regina.Integer) -> None
407
-
407
+
408
408
  Initialises this integer to zero.
409
-
409
+
410
410
  2. __init__(self: regina.Integer, arg0: int) -> None
411
-
411
+
412
412
  Initialises this integer to the given value.
413
-
413
+
414
414
  Python:
415
415
  In Python, this is the only native-integer constructor available.
416
-
416
+
417
417
  Parameter ``value``:
418
418
  the new value of this integer.
419
-
419
+
420
420
  3. __init__(self: regina.Integer, arg0: regina.Integer) -> None
421
-
421
+
422
422
  Initialises this integer to the given value.
423
-
423
+
424
424
  Parameter ``value``:
425
425
  the new value of this integer.
426
-
426
+
427
427
  4. __init__(self: regina.Integer, arg0: regina.LargeInteger) -> None
428
-
428
+
429
429
  Initialises this integer to the given value.
430
-
430
+
431
431
  Precondition:
432
432
  The given integer is not infinite.
433
-
433
+
434
434
  Parameter ``value``:
435
435
  the new value of this integer.
436
-
436
+
437
437
  5. __init__(self: regina.Integer, arg0: int) -> None
438
-
438
+
439
439
  Initialises this to the given native Python integer.
440
-
440
+
441
441
  The argument is of the Python ``int`` type, which Python uses to store
442
442
  integers of arbitrary magnitude (much like Regina does with its
443
443
  Integer and LargeInteger classes).
444
-
444
+
445
445
  Parameter ``value``:
446
446
  the new value of this integer.
447
-
447
+
448
448
  6. __init__(self: regina.Integer, arg0: float) -> None
449
-
449
+
450
450
  Initialises this integer to the truncation of the given real number.
451
-
451
+
452
452
  Parameter ``value``:
453
453
  the real number to be truncated.
454
-
454
+
455
455
  7. __init__(self: regina.Integer, arg0: str, base: int = 10) -> None
456
-
456
+
457
457
  Initialises this integer to the given value which is represented as a
458
458
  string of digits in a given base.
459
-
459
+
460
460
  If not specified, the base defaults to 10. If the given base is zero,
461
461
  the base will be automatically determined. If the given string begins
462
462
  with ``0x`` or ``0X``, the base will be assumed to be 16. Otherwise,
463
463
  if the string begins with ``0``, the base will be assumed to be 8.
464
464
  Otherwise it will be taken as base 10.
465
-
465
+
466
466
  If the template argument *supportInfinity* is ``True``, then any
467
467
  string beginning with "inf" (after any initial whitesapce) will be
468
468
  interpreted as infinity.
469
-
469
+
470
470
  Whitespace may be present at the beginning or the end of the given
471
471
  string, and will simply be ignored.
472
-
472
+
473
473
  For finer details on how the string parsing works, see strtol() from
474
474
  the standard C library (on which this method is based).
475
-
475
+
476
476
  Precondition:
477
477
  The given base is zero, or is between 2 and 36 inclusive.
478
-
478
+
479
479
  Precondition:
480
480
  The given string represents an integer in the given base, with
481
481
  optional whitespace beforehand.
482
-
482
+
483
483
  Exception ``InvalidArgument``:
484
484
  The given string was not a valid large integer representation.
485
-
485
+
486
486
  Parameter ``value``:
487
487
  the new value of this integer, represented as a string of digits
488
488
  in base *base*.
489
-
489
+
490
490
  Parameter ``base``:
491
491
  the base in which *value* is given.
492
492
 
@@ -495,120 +495,120 @@ Help on instancemethod in module regina.engine:
495
495
  __init__(...)
496
496
  __init__(*args, **kwargs)
497
497
  Overloaded function.
498
-
498
+
499
499
  1. __init__(self: regina.LargeInteger) -> None
500
-
500
+
501
501
  Initialises this integer to zero.
502
-
502
+
503
503
  2. __init__(self: regina.LargeInteger, arg0: int) -> None
504
-
504
+
505
505
  Initialises this integer to the given value.
506
-
506
+
507
507
  Python:
508
508
  In Python, this is the only native-integer constructor available.
509
-
509
+
510
510
  Parameter ``value``:
511
511
  the new value of this integer.
512
-
512
+
513
513
  3. __init__(self: regina.LargeInteger, arg0: regina.LargeInteger) -> None
514
-
514
+
515
515
  Initialises this integer to the given value.
516
-
516
+
517
517
  Parameter ``value``:
518
518
  the new value of this integer.
519
-
519
+
520
520
  4. __init__(self: regina.LargeInteger, arg0: regina.Integer) -> None
521
-
521
+
522
522
  Initialises this integer to the given value.
523
-
523
+
524
524
  Precondition:
525
525
  The given integer is not infinite.
526
-
526
+
527
527
  Parameter ``value``:
528
528
  the new value of this integer.
529
-
529
+
530
530
  5. __init__(self: regina.LargeInteger, arg0: int) -> None
531
-
531
+
532
532
  Initialises this to the given native Python integer.
533
-
533
+
534
534
  The argument is of the Python ``int`` type, which Python uses to store
535
535
  integers of arbitrary magnitude (much like Regina does with its
536
536
  Integer and LargeInteger classes).
537
-
537
+
538
538
  Parameter ``value``:
539
539
  the new value of this integer.
540
-
540
+
541
541
  6. __init__(self: regina.LargeInteger, arg0: float) -> None
542
-
542
+
543
543
  Initialises this integer to the truncation of the given real number.
544
-
544
+
545
545
  Parameter ``value``:
546
546
  the real number to be truncated.
547
-
547
+
548
548
  7. __init__(self: regina.LargeInteger, arg0: str, base: int = 10) -> None
549
-
549
+
550
550
  Initialises this integer to the given value which is represented as a
551
551
  string of digits in a given base.
552
-
552
+
553
553
  If not specified, the base defaults to 10. If the given base is zero,
554
554
  the base will be automatically determined. If the given string begins
555
555
  with ``0x`` or ``0X``, the base will be assumed to be 16. Otherwise,
556
556
  if the string begins with ``0``, the base will be assumed to be 8.
557
557
  Otherwise it will be taken as base 10.
558
-
558
+
559
559
  If the template argument *supportInfinity* is ``True``, then any
560
560
  string beginning with "inf" (after any initial whitesapce) will be
561
561
  interpreted as infinity.
562
-
562
+
563
563
  Whitespace may be present at the beginning or the end of the given
564
564
  string, and will simply be ignored.
565
-
565
+
566
566
  For finer details on how the string parsing works, see strtol() from
567
567
  the standard C library (on which this method is based).
568
-
568
+
569
569
  Precondition:
570
570
  The given base is zero, or is between 2 and 36 inclusive.
571
-
571
+
572
572
  Precondition:
573
573
  The given string represents an integer in the given base, with
574
574
  optional whitespace beforehand.
575
-
575
+
576
576
  Exception ``InvalidArgument``:
577
577
  The given string was not a valid large integer representation.
578
-
578
+
579
579
  Parameter ``value``:
580
580
  the new value of this integer, represented as a string of digits
581
581
  in base *base*.
582
-
582
+
583
583
  Parameter ``base``:
584
584
  the base in which *value* is given.
585
585
 
586
- Help on ListView object:
586
+ Help on ListView_Triangulation3_vertices in module regina.engine.internal object:
587
587
 
588
- class ListView(pybind11_object)
588
+ class ListView_Triangulation3_vertices(pybind11_builtins.pybind11_object)
589
589
  | A lightweight object that can be used for iteration and random access
590
590
  | to all elements of a given list.
591
- |
591
+ |
592
592
  | This access is read-only, in the sense that both the list itself and
593
593
  | the list elements are read-only. (Of course, if the list elements are
594
594
  | non-const pointers then this means that the _pointers_ cannot be
595
595
  | reassigned to point to different objects, but the objects they _point_
596
596
  | to can still be modified.)
597
- |
597
+ |
598
598
  | Typically a ListView would be returned from a class member function to
599
599
  | grant the user some basic read-only access to a much richer private
600
600
  | data structure, in a way that allows the internal data structure to
601
601
  | change at some later date without affecting the public API.
602
- |
602
+ |
603
603
  | The ListView class supports several different ways of representing a
604
604
  | list:
605
- |
605
+ |
606
606
  | * If your list is stored using a container class (e.g., std::vector or
607
607
  | regina::MarkedVector), then you can create a ListView directly from
608
608
  | the container using the syntax ``ListView(container)``. This uses
609
609
  | the generic ListView<Container> class template. There is no need to
610
610
  | explicitly specify the ListView template arguments.
611
- |
611
+ |
612
612
  | * If your list is stored using a C-style array whose size is not known
613
613
  | at compile-time, you can create a ListView using either the syntax
614
614
  | ``ListView(array, size)`` or ``ListView(begin, end)``. Here *array*
@@ -617,23 +617,23 @@ class ListView(pybind11_object)
617
617
  | + size``). This syntax uses the specialised ListView<Element*> class
618
618
  | template. Again, there is no need to explicitly specify the ListView
619
619
  | template arguments.
620
- |
620
+ |
621
621
  | * If your list is stored using a C-style array whose size is fixed at
622
622
  | compile-time (i.e., the type is ``Element[n]`` for some constant
623
623
  | *n*), you can create a ListView using the syntax
624
624
  | ``ListView(array)``. Once again, there is no need to explicitly
625
625
  | specify the ListView template arguments.
626
- |
626
+ |
627
627
  | End users should always store ListView objects using ``auto``, not by
628
628
  | explicitly writing out the full ListView type. One reason for this is
629
629
  | that, if/when Regina moves to C++20, the ListView class will most
630
630
  | likely be removed completely (in favour of the new C++20 ranges
631
631
  | library).
632
- |
632
+ |
633
633
  | ListView objects are small enough to pass by value and swap with
634
634
  | std::swap(), with no need for any specialised move operations or swap
635
635
  | functions.
636
- |
636
+ |
637
637
  | Python:
638
638
  | The ListView classes are deliberately difficult to access: they
639
639
  | live within their own private Python namespaces, and are all give
@@ -642,169 +642,167 @@ class ListView(pybind11_object)
642
642
  | (e.g., ``Link.crossings()``), and in most cases you would simply
643
643
  | iterate over this resulting ListView without ever knowing its
644
644
  | exact type.
645
- |
645
+ |
646
646
  | Template parameter ``Container``:
647
647
  | the internal type of the list that this object grants access to.
648
648
  | This type must support at least the same operations as this class
649
649
  | itself, except for the copy semantics. In particular, both
650
650
  | std::vector and regina::MarkedVector types (as well as many other
651
651
  | standard container types) are suitable.
652
- |
652
+ |
653
653
  | Method resolution order:
654
- | ListView
655
- | pybind11_object
654
+ | ListView_Triangulation3_vertices
655
+ | pybind11_builtins.pybind11_object
656
656
  | builtins.object
657
- |
657
+ |
658
658
  | Methods defined here:
659
- |
659
+ |
660
660
  | __eq__(...)
661
661
  | __eq__(*args, **kwargs)
662
662
  | Overloaded function.
663
- |
663
+ |
664
664
  | 1. __eq__(self: <internal>.ListView[regina.Vertex3], arg0: <internal>.ListView[regina.Vertex3]) -> bool
665
- |
665
+ |
666
666
  | Determines whether this and the given list view are accessing the same
667
667
  | underlying container.
668
- |
668
+ |
669
669
  | Here the containers are compared by _reference_ (i.e., they must be
670
670
  | the same container object at the same location in memory; it is not
671
671
  | enough to be two containers with identical contents).
672
- |
672
+ |
673
673
  | Parameter ``other``:
674
674
  | the list view to compare with this.
675
- |
675
+ |
676
676
  | Returns:
677
677
  | ``True`` if and only if this and the given list use the same
678
678
  | underlying container.
679
- |
679
+ |
680
680
  | 2. __eq__(self: <internal>.ListView[regina.Vertex3], arg0: None) -> bool
681
- |
681
+ |
682
682
  | Always returns ``False``, since an object of this type is never equal
683
683
  | to ``None``.
684
- |
684
+ |
685
685
  | __getitem__(...)
686
686
  | __getitem__(self: <internal>.ListView[regina.Vertex3], arg0: int) -> regina.Vertex3
687
- |
687
+ |
688
688
  | Returns the requested element of this list.
689
- |
689
+ |
690
690
  | Parameter ``index``:
691
691
  | indicates which element to return; this must be between 0 and
692
692
  | size()-1 inclusive.
693
- |
693
+ |
694
694
  | Returns:
695
695
  | the (*index*)th element in this list.
696
- |
696
+ |
697
697
  | __init__(...)
698
- | __init__(self: pybind11_builtins.ListView, arg0: <internal>.ListView[regina.Vertex3]) -> None
699
- |
698
+ | __init__(self: regina.internal.ListView_Triangulation3_vertices, arg0: <internal>.ListView[regina.Vertex3]) -> None
699
+ |
700
700
  | Creates a new copy of the given list view.
701
- |
701
+ |
702
702
  | __iter__(...)
703
- | __iter__(self: <internal>.ListView[regina.Vertex3]) -> Iterator
704
- |
703
+ | __iter__(self: <internal>.ListView[regina.Vertex3]) -> Iterator[regina.Vertex3]
704
+ |
705
705
  | Returns a Python iterator over the elements of this list.
706
- |
706
+ |
707
707
  | Returns:
708
708
  | an iterator over the elements of this list.
709
- |
709
+ |
710
710
  | __len__(...)
711
711
  | __len__(self: <internal>.ListView[regina.Vertex3]) -> int
712
- |
712
+ |
713
713
  | Returns the number of elements in this list.
714
- |
714
+ |
715
715
  | Python:
716
716
  | This is also used to implement the Python special method
717
717
  | __len__().
718
- |
718
+ |
719
719
  | Returns:
720
720
  | the number of elements.
721
- |
721
+ |
722
722
  | __ne__(...)
723
723
  | __ne__(*args, **kwargs)
724
724
  | Overloaded function.
725
- |
725
+ |
726
726
  | 1. __ne__(self: <internal>.ListView[regina.Vertex3], arg0: <internal>.ListView[regina.Vertex3]) -> bool
727
- |
727
+ |
728
728
  | Determines whether this and the given list view are accessing
729
729
  | different underlying containers.
730
- |
730
+ |
731
731
  | Here the containers are compared by _reference_ (i.e., to be
732
732
  | considered equal they must be the same container object at the same
733
733
  | location in memory; it is not enough to be two containers with
734
734
  | identical contents).
735
- |
735
+ |
736
736
  | Parameter ``other``:
737
737
  | the list view to compare with this.
738
- |
738
+ |
739
739
  | Returns:
740
740
  | ``True`` if and only if this and the given list use different
741
741
  | underlying containers.
742
- |
742
+ |
743
743
  | 2. __ne__(self: <internal>.ListView[regina.Vertex3], arg0: None) -> bool
744
- |
744
+ |
745
745
  | Always returns ``True``, since an object of this type is never equal
746
746
  | to ``None``.
747
- |
747
+ |
748
748
  | __repr__(...)
749
749
  | __repr__(self: <internal>.ListView[regina.Vertex3]) -> str
750
- |
750
+ |
751
751
  | __str__(...)
752
752
  | __str__(self: <internal>.ListView[regina.Vertex3]) -> str
753
- |
753
+ |
754
754
  | back(...)
755
755
  | back(self: <internal>.ListView[regina.Vertex3]) -> regina.Vertex3
756
- |
756
+ |
757
757
  | Returns the last element of this list.
758
- |
758
+ |
759
759
  | Precondition:
760
760
  | This list is not empty.
761
- |
761
+ |
762
762
  | Returns:
763
763
  | the last element in this list.
764
- |
764
+ |
765
765
  | empty(...)
766
766
  | empty(self: <internal>.ListView[regina.Vertex3]) -> bool
767
- |
767
+ |
768
768
  | Determines if this list is empty.
769
- |
769
+ |
770
770
  | Returns:
771
771
  | ``True`` if and only if this list is empty.
772
- |
772
+ |
773
773
  | front(...)
774
774
  | front(self: <internal>.ListView[regina.Vertex3]) -> regina.Vertex3
775
- |
775
+ |
776
776
  | Returns the first element of this list.
777
- |
777
+ |
778
778
  | Precondition:
779
779
  | This list is not empty.
780
- |
780
+ |
781
781
  | Returns:
782
782
  | the first element in this list.
783
- |
783
+ |
784
784
  | size(...)
785
785
  | size(self: <internal>.ListView[regina.Vertex3]) -> int
786
- |
786
+ |
787
787
  | Returns the number of elements in this list.
788
- |
788
+ |
789
789
  | Python:
790
790
  | This is also used to implement the Python special method
791
791
  | __len__().
792
- |
792
+ |
793
793
  | Returns:
794
794
  | the number of elements.
795
- |
795
+ |
796
796
  | ----------------------------------------------------------------------
797
797
  | Data and other attributes defined here:
798
- |
798
+ |
799
799
  | __hash__ = None
800
- |
801
- | __pybind11_module_local__ = ...
802
- |
800
+ |
803
801
  | equalityType = <EqualityType.BY_VALUE: 1>
804
- |
802
+ |
805
803
  | ----------------------------------------------------------------------
806
- | Static methods inherited from pybind11_object:
807
- |
804
+ | Static methods inherited from pybind11_builtins.pybind11_object:
805
+ |
808
806
  | __new__(*args, **kwargs) from pybind11_builtins.pybind11_type
809
807
  | Create and return a new object. See help(type) for accurate signature.
810
808