cpython/Modules/_collectionsmodule.c at 3.3 · python/cpython

Repository navigation

History

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

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

#include "Python.h"

#include "structmember.h"

/* collections module implementation of a deque() datatype

Written and maintained by Raymond D. Hettinger <python@rcn.com>

/* The block length may be set to any number over 1. Larger numbers

* reduce the number of calls to the memory allocator but take more

* memory. Ideally, BLOCKLEN should be set with an eye to the

* length of a cache line.

#define BLOCKLEN 62

#define CENTER ((BLOCKLEN - 1) / 2)

/* A `dequeobject` is composed of a doubly-linked list of `block` nodes.

* This list is not circular (the leftmost block has leftlink==NULL,

* and the rightmost block has rightlink==NULL). A deque d's first

* element is at d.leftblock[leftindex] and its last element is at

* d.rightblock[rightindex]; note that, unlike as for Python slice

* indices, these indices are inclusive on both ends. By being inclusive

* on both ends, algorithms for left and right operations become

* symmetrical which simplifies the design.

* The list of blocks is never empty, so d.leftblock and d.rightblock

* are never equal to NULL.

* The indices, d.leftindex and d.rightindex are always in the range

* 0 <= index < BLOCKLEN.

* Their exact relationship is:

* (d.leftindex + d.len - 1) % BLOCKLEN == d.rightindex.

* Empty deques have d.len == 0; d.leftblock==d.rightblock;

* d.leftindex == CENTER+1; and d.rightindex == CENTER.

* Checking for d.len == 0 is the intended way to see whether d is empty.

* Whenever d.leftblock == d.rightblock,

* d.leftindex + d.len - 1 == d.rightindex.

* However, when d.leftblock != d.rightblock, d.leftindex and d.rightindex

* become indices into distinct blocks and either may be larger than the

* other.

typedef struct BLOCK {

struct BLOCK *leftlink;

struct BLOCK *rightlink;

PyObject *data[BLOCKLEN];

} block;

#define MAXFREEBLOCKS 10

static Py_ssize_t numfreeblocks = 0;

static block *freeblocks[MAXFREEBLOCKS];

static block *

newblock(block *leftlink, block *rightlink, Py_ssize_t len) {

block *b;

/* To prevent len from overflowing PY_SSIZE_T_MAX on 64-bit machines, we

* refuse to allocate new blocks if the current len is dangerously

* close. There is some extra margin to prevent spurious arithmetic

* overflows at various places. The following check ensures that

* the blocks allocated to the deque, in the worst case, can only

* have PY_SSIZE_T_MAX-2 entries in total.

if (len >= PY_SSIZE_T_MAX - 2*BLOCKLEN) {

PyErr_SetString(PyExc_OverflowError,

"cannot add more blocks to the deque");

return NULL;

}

if (numfreeblocks) {

numfreeblocks -= 1;

b = freeblocks[numfreeblocks];

} else {

b = PyMem_Malloc(sizeof(block));

if (b == NULL) {

PyErr_NoMemory();

return NULL;

}

b->leftlink = leftlink;

b->rightlink = rightlink;

return b;

}

static void

freeblock(block *b)

{

if (numfreeblocks < MAXFREEBLOCKS) {

freeblocks[numfreeblocks] = b;

numfreeblocks++;

} else {

PyMem_Free(b);

}

typedef struct {

PyObject_HEAD

block *leftblock;

block *rightblock;

Py_ssize_t leftindex; /* in range(BLOCKLEN) */

Py_ssize_t rightindex; /* in range(BLOCKLEN) */

Py_ssize_t len;

Py_ssize_t maxlen;

long state; /* incremented whenever the indices move */

PyObject *weakreflist; /* List of weak references */

} dequeobject;

/* The deque's size limit is d.maxlen. The limit can be zero or positive.

* If there is no limit, then d.maxlen == -1.

* After an item is added to a deque, we check to see if the size has grown past

* the limit. If it has, we get the size back down to the limit by popping an

* item off of the opposite end. The methods that can trigger this are append(),

* appendleft(), extend(), and extendleft().

#define TRIM(d, popfunction) \

if (d->maxlen != -1 && d->len > d->maxlen) { \

PyObject *rv = popfunction(d, NULL); \

assert(rv != NULL && d->len <= d->maxlen); \

Py_DECREF(rv); \

}

static PyTypeObject deque_type;

static PyObject *

deque_new(PyTypeObject *type, PyObject *args, PyObject *kwds)

{

dequeobject *deque;

block *b;

/* create dequeobject structure */

deque = (dequeobject *)type->tp_alloc(type, 0);

if (deque == NULL)

return NULL;

b = newblock(NULL, NULL, 0);

if (b == NULL) {

Py_DECREF(deque);

return NULL;

}

assert(BLOCKLEN >= 2);

deque->leftblock = b;

deque->rightblock = b;

deque->leftindex = CENTER + 1;

deque->rightindex = CENTER;

deque->len = 0;

deque->state = 0;

deque->weakreflist = NULL;

deque->maxlen = -1;

return (PyObject *)deque;

}

static PyObject *

deque_pop(dequeobject *deque, PyObject *unused)

{

PyObject *item;

block *prevblock;

if (deque->len == 0) {

PyErr_SetString(PyExc_IndexError, "pop from an empty deque");

return NULL;

}

item = deque->rightblock->data[deque->rightindex];

deque->rightindex--;

deque->len--;

deque->state++;

if (deque->rightindex == -1) {

if (deque->len == 0) {

assert(deque->leftblock == deque->rightblock);

assert(deque->leftindex == deque->rightindex+1);

/* re-center instead of freeing a block */

deque->leftindex = CENTER + 1;

deque->rightindex = CENTER;

} else {

prevblock = deque->rightblock->leftlink;

assert(deque->leftblock != deque->rightblock);

freeblock(deque->rightblock);

prevblock->rightlink = NULL;

deque->rightblock = prevblock;

deque->rightindex = BLOCKLEN - 1;

}

return item;

}

PyDoc_STRVAR(pop_doc, "Remove and return the rightmost element.");

static PyObject *

deque_popleft(dequeobject *deque, PyObject *unused)

{

PyObject *item;

block *prevblock;

if (deque->len == 0) {

PyErr_SetString(PyExc_IndexError, "pop from an empty deque");

return NULL;

}

assert(deque->leftblock != NULL);

item = deque->leftblock->data[deque->leftindex];

deque->leftindex++;

deque->len--;

deque->state++;

if (deque->leftindex == BLOCKLEN) {

if (deque->len == 0) {

assert(deque->leftblock == deque->rightblock);

assert(deque->leftindex == deque->rightindex+1);

/* re-center instead of freeing a block */

deque->leftindex = CENTER + 1;

deque->rightindex = CENTER;

} else {

assert(deque->leftblock != deque->rightblock);

prevblock = deque->leftblock->rightlink;

freeblock(deque->leftblock);

assert(prevblock != NULL);

prevblock->leftlink = NULL;

deque->leftblock = prevblock;

deque->leftindex = 0;

}

return item;

}

PyDoc_STRVAR(popleft_doc, "Remove and return the leftmost element.");

static PyObject *

deque_append(dequeobject *deque, PyObject *item)

{

deque->state++;

if (deque->rightindex == BLOCKLEN-1) {

block *b = newblock(deque->rightblock, NULL, deque->len);

if (b == NULL)

return NULL;

assert(deque->rightblock->rightlink == NULL);

deque->rightblock->rightlink = b;

deque->rightblock = b;

deque->rightindex = -1;

}

Py_INCREF(item);

deque->len++;

deque->rightindex++;

deque->rightblock->data[deque->rightindex] = item;

TRIM(deque, deque_popleft);

Py_RETURN_NONE;

}

PyDoc_STRVAR(append_doc, "Add an element to the right side of the deque.");

static PyObject *

deque_appendleft(dequeobject *deque, PyObject *item)

{

deque->state++;

if (deque->leftindex == 0) {

block *b = newblock(NULL, deque->leftblock, deque->len);

if (b == NULL)

return NULL;

assert(deque->leftblock->leftlink == NULL);

deque->leftblock->leftlink = b;

deque->leftblock = b;

deque->leftindex = BLOCKLEN;

}

Py_INCREF(item);

deque->len++;

deque->leftindex--;

deque->leftblock->data[deque->leftindex] = item;

TRIM(deque, deque_pop);

Py_RETURN_NONE;

}

PyDoc_STRVAR(appendleft_doc, "Add an element to the left side of the deque.");

/* Run an iterator to exhaustion. Shortcut for

the extend/extendleft methods when maxlen == 0. */

static PyObject*

consume_iterator(PyObject *it)

{

PyObject *item;

while ((item = PyIter_Next(it)) != NULL) {

Py_DECREF(item);

}

Py_DECREF(it);

if (PyErr_Occurred())

return NULL;

Py_RETURN_NONE;

}

static PyObject *

deque_extend(dequeobject *deque, PyObject *iterable)

{

PyObject *it, *item;

/* Handle case where id(deque) == id(iterable) */

if ((PyObject *)deque == iterable) {

PyObject *result;

PyObject *s = PySequence_List(iterable);

if (s == NULL)

return NULL;

result = deque_extend(deque, s);

Py_DECREF(s);

return result;

}

it = PyObject_GetIter(iterable);

if (it == NULL)

return NULL;

if (deque->maxlen == 0)

return consume_iterator(it);

while ((item = PyIter_Next(it)) != NULL) {

deque->state++;

if (deque->rightindex == BLOCKLEN-1) {

block *b = newblock(deque->rightblock, NULL,

deque->len);

if (b == NULL) {

Py_DECREF(item);

Py_DECREF(it);

return NULL;

}

assert(deque->rightblock->rightlink == NULL);

deque->rightblock->rightlink = b;

deque->rightblock = b;

deque->rightindex = -1;

}

deque->len++;

deque->rightindex++;

deque->rightblock->data[deque->rightindex] = item;

TRIM(deque, deque_popleft);

}

Py_DECREF(it);

if (PyErr_Occurred())

return NULL;

Py_RETURN_NONE;

}

PyDoc_STRVAR(extend_doc,

"Extend the right side of the deque with elements from the iterable");

static PyObject *

deque_extendleft(dequeobject *deque, PyObject *iterable)

{

PyObject *it, *item;

/* Handle case where id(deque) == id(iterable) */

if ((PyObject *)deque == iterable) {

PyObject *result;

PyObject *s = PySequence_List(iterable);

if (s == NULL)

return NULL;

result = deque_extendleft(deque, s);

Py_DECREF(s);

return result;

}

it = PyObject_GetIter(iterable);

if (it == NULL)

return NULL;

if (deque->maxlen == 0)

return consume_iterator(it);

while ((item = PyIter_Next(it)) != NULL) {

deque->state++;

if (deque->leftindex == 0) {

block *b = newblock(NULL, deque->leftblock,

deque->len);

if (b == NULL) {

Py_DECREF(item);

Py_DECREF(it);

return NULL;

}

assert(deque->leftblock->leftlink == NULL);

deque->leftblock->leftlink = b;

deque->leftblock = b;

deque->leftindex = BLOCKLEN;

}

deque->len++;

deque->leftindex--;

deque->leftblock->data[deque->leftindex] = item;

TRIM(deque, deque_pop);

}

Py_DECREF(it);

if (PyErr_Occurred())

return NULL;

Py_RETURN_NONE;

}

PyDoc_STRVAR(extendleft_doc,

"Extend the left side of the deque with elements from the iterable");

static PyObject *

deque_inplace_concat(dequeobject *deque, PyObject *other)

{

PyObject *result;

result = deque_extend(deque, other);

if (result == NULL)

return result;

Py_DECREF(result);

Py_INCREF(deque);

return (PyObject *)deque;

}

static int

_deque_rotate(dequeobject *deque, Py_ssize_t n)

{

Py_ssize_t m, len=deque->len, halflen=len>>1;

if (len <= 1)

return 0;

if (n > halflen || n < -halflen) {

n %= len;

if (n > halflen)

n -= len;

else if (n < -halflen)

n += len;

}

assert(len > 1);

assert(-halflen <= n && n <= halflen);

deque->state++;

while (n > 0) {

if (deque->leftindex == 0) {

block *b = newblock(NULL, deque->leftblock, len);

if (b == NULL)

return -1;

assert(deque->leftblock->leftlink == NULL);

deque->leftblock->leftlink = b;

deque->leftblock = b;

deque->leftindex = BLOCKLEN;

}

assert(deque->leftindex > 0);

m = n;

if (m > deque->rightindex + 1)

m = deque->rightindex + 1;

if (m > deque->leftindex)

m = deque->leftindex;

assert (m > 0 && m <= len);

memcpy(&deque->leftblock->data[deque->leftindex - m],

&deque->rightblock->data[deque->rightindex + 1 - m],

m * sizeof(PyObject *));

deque->rightindex -= m;

deque->leftindex -= m;

n -= m;

if (deque->rightindex == -1) {

block *prevblock = deque->rightblock->leftlink;

assert(deque->rightblock != NULL);

assert(deque->leftblock != deque->rightblock);

freeblock(deque->rightblock);

prevblock->rightlink = NULL;

deque->rightblock = prevblock;

deque->rightindex = BLOCKLEN - 1;

}

while (n < 0) {

if (deque->rightindex == BLOCKLEN - 1) {

block *b = newblock(deque->rightblock, NULL, len);

if (b == NULL)

return -1;

assert(deque->rightblock->rightlink == NULL);

deque->rightblock->rightlink = b;

deque->rightblock = b;

deque->rightindex = -1;

}

assert (deque->rightindex < BLOCKLEN - 1);

m = -n;

if (m > BLOCKLEN - deque->leftindex)

m = BLOCKLEN - deque->leftindex;

if (m > BLOCKLEN - 1 - deque->rightindex)

m = BLOCKLEN - 1 - deque->rightindex;

assert (m > 0 && m <= len);

memcpy(&deque->rightblock->data[deque->rightindex + 1],

&deque->leftblock->data[deque->leftindex],

m * sizeof(PyObject *));

deque->leftindex += m;

deque->rightindex += m;

n += m;

if (deque->leftindex == BLOCKLEN) {

block *nextblock = deque->leftblock->rightlink;

assert(deque->leftblock != deque->rightblock);

freeblock(deque->leftblock);

assert(nextblock != NULL);

nextblock->leftlink = NULL;

deque->leftblock = nextblock;

deque->leftindex = 0;

}

return 0;

}

static PyObject *

deque_rotate(dequeobject *deque, PyObject *args)

{

Py_ssize_t n=1;

if (!PyArg_ParseTuple(args, "|n:rotate", &n))

return NULL;

if (_deque_rotate(deque, n) == 0)

Py_RETURN_NONE;

return NULL;

}

PyDoc_STRVAR(rotate_doc,

"Rotate the deque n steps to the right (default n=1). If n is negative, rotates left.");

static PyObject *

deque_reverse(dequeobject *deque, PyObject *unused)

{

block *leftblock = deque->leftblock;

block *rightblock = deque->rightblock;

Py_ssize_t leftindex = deque->leftindex;

Py_ssize_t rightindex = deque->rightindex;

Py_ssize_t n = (deque->len)/2;

Py_ssize_t i;

PyObject *tmp;

for (i=0 ; i<n ; i++) {

/* Validate that pointers haven't met in the middle */

assert(leftblock != rightblock || leftindex < rightindex);

/* Swap */

tmp = leftblock->data[leftindex];

leftblock->data[leftindex] = rightblock->data[rightindex];

rightblock->data[rightindex] = tmp;

/* Advance left block/index pair */

leftindex++;

if (leftindex == BLOCKLEN) {

if (leftblock->rightlink == NULL)

break;

leftblock = leftblock->rightlink;

leftindex = 0;

}

/* Step backwards with the right block/index pair */

rightindex--;

if (rightindex == -1) {

if (rightblock->leftlink == NULL)

break;

rightblock = rightblock->leftlink;

rightindex = BLOCKLEN - 1;

}

Py_RETURN_NONE;

}

PyDoc_STRVAR(reverse_doc,

"D.reverse() -- reverse *IN PLACE*");

static PyObject *

deque_count(dequeobject *deque, PyObject *v)

{

block *leftblock = deque->leftblock;

Py_ssize_t leftindex = deque->leftindex;

Py_ssize_t n = deque->len;

Py_ssize_t i;

Py_ssize_t count = 0;

PyObject *item;

long start_state = deque->state;

int cmp;

for (i=0 ; i<n ; i++) {

item = leftblock->data[leftindex];

cmp = PyObject_RichCompareBool(item, v, Py_EQ);

if (cmp > 0)

count++;

else if (cmp < 0)

return NULL;

if (start_state != deque->state) {

PyErr_SetString(PyExc_RuntimeError,

"deque mutated during iteration");

return NULL;

}

/* Advance left block/index pair */

leftindex++;

if (leftindex == BLOCKLEN) {

if (leftblock->rightlink == NULL) /* can occur when i==n-1 */

break;

leftblock = leftblock->rightlink;

leftindex = 0;

}

return PyLong_FromSsize_t(count);

}

PyDoc_STRVAR(count_doc,

"D.count(value) -> integer -- return number of occurrences of value");

static Py_ssize_t

deque_len(dequeobject *deque)

{

return deque->len;

}

static PyObject *

deque_remove(dequeobject *deque, PyObject *value)

{

Py_ssize_t i, n=deque->len;

for (i=0 ; i<n ; i++) {

PyObject *item = deque->leftblock->data[deque->leftindex];

int cmp = PyObject_RichCompareBool(item, value, Py_EQ);

if (deque->len != n) {

PyErr_SetString(PyExc_IndexError,

"deque mutated during remove().");

return NULL;

}

if (cmp > 0) {

PyObject *tgt = deque_popleft(deque, NULL);

assert (tgt != NULL);

Py_DECREF(tgt);

if (_deque_rotate(deque, i) == -1)

return NULL;

Py_RETURN_NONE;

}

else if (cmp < 0) {

_deque_rotate(deque, i);

return NULL;

}

_deque_rotate(deque, -1);

}

PyErr_SetString(PyExc_ValueError, "deque.remove(x): x not in deque");

return NULL;

}

PyDoc_STRVAR(remove_doc,

"D.remove(value) -- remove first occurrence of value.");

static void

deque_clear(dequeobject *deque)

{

PyObject *item;

while (deque->len) {

item = deque_pop(deque, NULL);

assert (item != NULL);

Py_DECREF(item);

}

assert(deque->leftblock == deque->rightblock &&

deque->leftindex - 1 == deque->rightindex &&

deque->len == 0);

}

static PyObject *

deque_item(dequeobject *deque, Py_ssize_t i)

{

block *b;

PyObject *item;

Py_ssize_t n, index=i;

if (i < 0 || i >= deque->len) {

PyErr_SetString(PyExc_IndexError,

"deque index out of range");

return NULL;

}

if (i == 0) {

i = deque->leftindex;

b = deque->leftblock;

} else if (i == deque->len - 1) {

i = deque->rightindex;

b = deque->rightblock;

} else {

i += deque->leftindex;

n = i / BLOCKLEN;

i %= BLOCKLEN;

if (index < (deque->len >> 1)) {

b = deque->leftblock;

while (n--)

b = b->rightlink;

} else {

n = (deque->leftindex + deque->len - 1) / BLOCKLEN - n;

b = deque->rightblock;

while (n--)

b = b->leftlink;

}

item = b->data[i];

Py_INCREF(item);

return item;

}

/* delitem() implemented in terms of rotate for simplicity and reasonable

performance near the end points. If for some reason this method becomes

popular, it is not hard to re-implement this using direct data movement

(similar to code in list slice assignment) and achieve a two or threefold

performance boost.

static int

deque_del_item(dequeobject *deque, Py_ssize_t i)

{

PyObject *item;

assert (i >= 0 && i < deque->len);

if (_deque_rotate(deque, -i) == -1)

return -1;

item = deque_popleft(deque, NULL);

assert (item != NULL);

Py_DECREF(item);

return _deque_rotate(deque, i);

}

static int

deque_ass_item(dequeobject *deque, Py_ssize_t i, PyObject *v)

{

PyObject *old_value;

block *b;

Py_ssize_t n, len=deque->len, halflen=(len+1)>>1, index=i;

if (i < 0 || i >= len) {

PyErr_SetString(PyExc_IndexError,

"deque index out of range");

return -1;

}

if (v == NULL)

return deque_del_item(deque, i);

i += deque->leftindex;

n = i / BLOCKLEN;

i %= BLOCKLEN;

if (index <= halflen) {

b = deque->leftblock;

while (n--)

b = b->rightlink;

} else {

n = (deque->leftindex + len - 1) / BLOCKLEN - n;

b = deque->rightblock;

while (n--)

b = b->leftlink;

}

Py_INCREF(v);

old_value = b->data[i];

b->data[i] = v;

Py_DECREF(old_value);

return 0;

}

static PyObject *

deque_clearmethod(dequeobject *deque)

{

deque_clear(deque);

Py_RETURN_NONE;

}

PyDoc_STRVAR(clear_doc, "Remove all elements from the deque.");

static void

deque_dealloc(dequeobject *deque)

{

PyObject_GC_UnTrack(deque);

if (deque->weakreflist != NULL)

PyObject_ClearWeakRefs((PyObject *) deque);

if (deque->leftblock != NULL) {

deque_clear(deque);

assert(deque->leftblock != NULL);

freeblock(deque->leftblock);

}

deque->leftblock = NULL;

deque->rightblock = NULL;

Py_TYPE(deque)->tp_free(deque);

}

static int

deque_traverse(dequeobject *deque, visitproc visit, void *arg)

{

block *b;

PyObject *item;

Py_ssize_t index;

Py_ssize_t indexlo = deque->leftindex;

for (b = deque->leftblock; b != NULL; b = b->rightlink) {

const Py_ssize_t indexhi = b == deque->rightblock ?

deque->rightindex :

BLOCKLEN - 1;

for (index = indexlo; index <= indexhi; ++index) {

item = b->data[index];

Py_VISIT(item);

}

indexlo = 0;

}

return 0;

}

static PyObject *

deque_copy(PyObject *deque)

{

if (((dequeobject *)deque)->maxlen == -1)

return PyObject_CallFunction((PyObject *)(Py_TYPE(deque)), "O", deque, NULL);

else

return PyObject_CallFunction((PyObject *)(Py_TYPE(deque)), "Oi",

deque, ((dequeobject *)deque)->maxlen, NULL);

}

PyDoc_STRVAR(copy_doc, "Return a shallow copy of a deque.");

static PyObject *

deque_reduce(dequeobject *deque)

{

PyObject *dict, *result, *aslist;

_Py_IDENTIFIER(__dict__);

dict = _PyObject_GetAttrId((PyObject *)deque, &PyId___dict__);

if (dict == NULL)

PyErr_Clear();

aslist = PySequence_List((PyObject *)deque);

if (aslist == NULL) {

Py_XDECREF(dict);

return NULL;

}

if (dict == NULL) {

if (deque->maxlen == -1)

result = Py_BuildValue("O(O)", Py_TYPE(deque), aslist);

else

result = Py_BuildValue("O(On)", Py_TYPE(deque), aslist, deque->maxlen);

} else {

if (deque->maxlen == -1)

result = Py_BuildValue("O(OO)O", Py_TYPE(deque), aslist, Py_None, dict);

else

result = Py_BuildValue("O(On)O", Py_TYPE(deque), aslist, deque->maxlen, dict);

}

Py_XDECREF(dict);

Py_DECREF(aslist);

return result;

}

PyDoc_STRVAR(reduce_doc, "Return state information for pickling.");

static PyObject *

deque_repr(PyObject *deque)

{

PyObject *aslist, *result;

int i;

i = Py_ReprEnter(deque);

if (i != 0) {

if (i < 0)

return NULL;

return PyUnicode_FromString("[...]");

}

aslist = PySequence_List(deque);

if (aslist == NULL) {

Py_ReprLeave(deque);

return NULL;

}

if (((dequeobject *)deque)->maxlen != -1)

result = PyUnicode_FromFormat("deque(%R, maxlen=%zd)",

aslist, ((dequeobject *)deque)->maxlen);

else

result = PyUnicode_FromFormat("deque(%R)", aslist);

Py_DECREF(aslist);

Py_ReprLeave(deque);

return result;

}

static PyObject *

deque_richcompare(PyObject *v, PyObject *w, int op)

{

PyObject *it1=NULL, *it2=NULL, *x, *y;

Py_ssize_t vs, ws;

int b, cmp=-1;

if (!PyObject_TypeCheck(v, &deque_type) ||

!PyObject_TypeCheck(w, &deque_type)) {

Py_RETURN_NOTIMPLEMENTED;

}

/* Shortcuts */

vs = ((dequeobject *)v)->len;

ws = ((dequeobject *)w)->len;

if (op == Py_EQ) {

if (v == w)

Py_RETURN_TRUE;

if (vs != ws)

Py_RETURN_FALSE;

}

if (op == Py_NE) {

if (v == w)

Py_RETURN_FALSE;

if (vs != ws)

Py_RETURN_TRUE;

}

/* Search for the first index where items are different */

it1 = PyObject_GetIter(v);

if (it1 == NULL)

goto done;

it2 = PyObject_GetIter(w);

if (it2 == NULL)

goto done;

for (;;) {

x = PyIter_Next(it1);

if (x == NULL && PyErr_Occurred())

goto done;

y = PyIter_Next(it2);

if (x == NULL || y == NULL)

break;

b = PyObject_RichCompareBool(x, y, Py_EQ);

if (b == 0) {

cmp = PyObject_RichCompareBool(x, y, op);

Py_DECREF(x);

Py_DECREF(y);

goto done;

}

Py_DECREF(x);

Py_DECREF(y);

if (b == -1)

goto done;

}

/* We reached the end of one deque or both */

Py_XDECREF(x);

Py_XDECREF(y);

if (PyErr_Occurred())

goto done;

switch (op) {

case Py_LT: cmp = y != NULL; break; /* if w was longer */

case Py_LE: cmp = x == NULL; break; /* if v was not longer */

case Py_EQ: cmp = x == y; break; /* if we reached the end of both */

case Py_NE: cmp = x != y; break; /* if one deque continues */

case Py_GT: cmp = x != NULL; break; /* if v was longer */

case Py_GE: cmp = y == NULL; break; /* if w was not longer */

}

done:

Py_XDECREF(it1);

Py_XDECREF(it2);

if (cmp == 1)

Py_RETURN_TRUE;

if (cmp == 0)

Py_RETURN_FALSE;

return NULL;

}

static int

deque_init(dequeobject *deque, PyObject *args, PyObject *kwdargs)

{

PyObject *iterable = NULL;

PyObject *maxlenobj = NULL;

Py_ssize_t maxlen = -1;

char *kwlist[] = {"iterable", "maxlen", 0};

if (!PyArg_ParseTupleAndKeywords(args, kwdargs, "|OO:deque", kwlist, &iterable, &maxlenobj))

return -1;

if (maxlenobj != NULL && maxlenobj != Py_None) {

maxlen = PyLong_AsSsize_t(maxlenobj);

if (maxlen == -1 && PyErr_Occurred())

return -1;

if (maxlen < 0) {

PyErr_SetString(PyExc_ValueError, "maxlen must be non-negative");

return -1;

}

deque->maxlen = maxlen;

deque_clear(deque);

if (iterable != NULL) {

PyObject *rv = deque_extend(deque, iterable);

if (rv == NULL)

return -1;

Py_DECREF(rv);

}

return 0;

}

static PyObject *

deque_sizeof(dequeobject *deque, void *unused)

{

Py_ssize_t res;

Py_ssize_t blocks;

res = sizeof(dequeobject);

blocks = (deque->leftindex + deque->len + BLOCKLEN - 1) / BLOCKLEN;

assert(deque->leftindex + deque->len - 1 ==

(blocks - 1) * BLOCKLEN + deque->rightindex);

res += blocks * sizeof(block);

return PyLong_FromSsize_t(res);

}

PyDoc_STRVAR(sizeof_doc,

"D.__sizeof__() -- size of D in memory, in bytes");

static PyObject *

View remainder of file in raw view

FilesExpand file tree

_collectionsmodule.c

Latest commit

History

_collectionsmodule.c

File metadata and controls