processing/core/src/processing/data/IntDict.java at master · h2oop/processing · GitHub

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

package processing.data;

import java.io.*;

import java.util.HashMap;

import java.util.Iterator;

import processing.core.PApplet;

/**

* A simple class to use a String as a lookup for an int value.

* @webref data:composite

* @see FloatDict

* @see StringDict

public class IntDict {

/** Number of elements in the table */

protected int count;

protected String[] keys;

protected int[] values;

/** Internal implementation for faster lookups */

private HashMap<String, Integer> indices = new HashMap<String, Integer>();

// /**

// * Create a new object by counting the number of times each unique entry

// * shows up in the specified String array.

// */

// static public IntHash fromTally(String[] list) {

// IntHash outgoing = new IntHash();

// for (String s : list) {

// outgoing.inc(s);

// }

// outgoing.crop();

// return outgoing;

// }

// static public IntHash fromOrder(String[] list) {

// IntHash outgoing = new IntHash();

// for (int i = 0; i < list.length; i++) {

// outgoing.set(list[i], i);

// }

// return outgoing;

// }

public IntDict() {

count = 0;

keys = new String[10];

values = new int[10];

}

/**

* Create a new lookup with a specific size. This is more efficient than not

* specifying a size. Use it when you know the rough size of the thing you're creating.

* @nowebref

public IntDict(int length) {

count = 0;

keys = new String[length];

values = new int[length];

}

/**

* Read a set of entries from a Reader that has each key/value pair on

* a single line, separated by a tab.

* @nowebref

public IntDict(BufferedReader reader) {

String[] lines = PApplet.loadStrings(reader);

keys = new String[lines.length];

values = new int[lines.length];

for (int i = 0; i < lines.length; i++) {

String[] pieces = PApplet.split(lines[i], '\t');

if (pieces.length == 2) {

keys[count] = pieces[0];

values[count] = PApplet.parseInt(pieces[1]);

indices.put(pieces[0], count);

count++;

}

/**

* @nowebref

public IntDict(String[] keys, int[] values) {

if (keys.length != values.length) {

throw new IllegalArgumentException("key and value arrays must be the same length");

}

this.keys = keys;

this.values = values;

count = keys.length;

for (int i = 0; i < count; i++) {

indices.put(keys[i], i);

}

/**

* Returns the number of key/value pairs

* @webref intdict:method

* @brief Returns the number of key/value pairs

public int size() {

return count;

}

/**

* Remove all entries.

* @webref intdict:method

* @brief Remove all entries

public void clear() {

count = 0;

indices = new HashMap<String, Integer>();

}

public String key(int index) {

return keys[index];

}

// private void crop() {

// if (count != keys.length) {

// keys = PApplet.subset(keys, 0, count);

// values = PApplet.subset(values, 0, count);

// }

/**

* Return the internal array being used to store the keys. Allocated but

* unused entries will be removed. This array should not be modified.

* @webref intdict:method

* @brief Return the internal array being used to store the keys

// public String[] keys() {

// crop();

// return keys;

// }

// public Iterable<String> keys() {

// return new Iterable<String>() {

// @Override

// public Iterator<String> iterator() {

// return new Iterator<String>() {

// int index = -1;

// public void remove() {

// removeIndex(index);

// }

// public String next() {

// return key(++index);

// }

// public boolean hasNext() {

// return index+1 < size();

// }

// };

// }

// };

// }

// Use this with 'for' loops

public Iterable<String> keys() {

return new Iterable<String>() {

@Override

public Iterator<String> iterator() {

return keyIterator();

// return new Iterator<String>() {

// int index = -1;

// public void remove() {

// removeIndex(index);

// }

// public String next() {

// return key(++index);

// }

// public boolean hasNext() {

// return index+1 < size();

// }

// };

}

};

}

// Use this to iterate when you want to be able to remove elements along the way

public Iterator<String> keyIterator() {

return new Iterator<String>() {

int index = -1;

public void remove() {

removeIndex(index);

}

public String next() {

return key(++index);

}

public boolean hasNext() {

return index+1 < size();

}

};

}

/**

* Return a copy of the internal keys array. This array can be modified.

* @webref intdict:method

* @brief Return a copy of the internal keys array

public String[] keyArray() {

return keyArray(null);

}

public String[] keyArray(String[] outgoing) {

if (outgoing == null || outgoing.length != count) {

outgoing = new String[count];

}

System.arraycopy(keys, 0, outgoing, 0, count);

return outgoing;

}

public int value(int index) {

return values[index];

}

/**

* @webref intdict:method

* @brief Return the internal array being used to store the keys

public Iterable<Integer> values() {

return new Iterable<Integer>() {

@Override

public Iterator<Integer> iterator() {

return valueIterator();

}

};

}

public Iterator<Integer> valueIterator() {

return new Iterator<Integer>() {

int index = -1;

public void remove() {

removeIndex(index);

}

public Integer next() {

return value(++index);

}

public boolean hasNext() {

return index+1 < size();

}

};

}

/**

* Create a new array and copy each of the values into it.

* @webref intdict:method

* @brief Create a new array and copy each of the values into it

public int[] valueArray() {

return valueArray(null);

}

/**

* Fill an already-allocated array with the values (more efficient than

* creating a new array each time). If 'array' is null, or not the same

* size as the number of values, a new array will be allocated and returned.

* @param array values to copy into the array

public int[] valueArray(int[] array) {

if (array == null || array.length != size()) {

array = new int[count];

}

System.arraycopy(values, 0, array, 0, count);

return array;

}

/**

* Return a value for the specified key.

* @webref intdict:method

* @brief Return a value for the specified key

public int get(String key) {

int index = index(key);

if (index == -1) return 0;

return values[index];

}

/**

* Create a new key/value pair or change the value of one.

* @webref intdict:method

* @brief Create a new key/value pair or change the value of one

public void set(String key, int amount) {

int index = index(key);

if (index == -1) {

create(key, amount);

} else {

values[index] = amount;

}

/**

* @webref intdict:method

* @brief Check if a key is a part of the data structure

public boolean hasKey(String key) {

return index(key) != -1;

}

/**

* Increase the value associated with a specific key by 1.

* @webref intdict:method

* @brief Increase the value of a specific key value by 1

public void increment(String key) {

add(key, 1);

}

/**

* @webref intdict:method

* @brief Add to a value

public void add(String key, int amount) {

int index = index(key);

if (index == -1) {

create(key, amount);

} else {

values[index] += amount;

}

/**

* @webref intdict:method

* @brief Subtract from a value

public void sub(String key, int amount) {

add(key, -amount);

}

/**

* @webref intdict:method

* @brief Multiply a value

public void mult(String key, int amount) {

int index = index(key);

if (index != -1) {

values[index] *= amount;

}

/**

* @webref intdict:method

* @brief Divide a value

public void div(String key, int amount) {

int index = index(key);

if (index != -1) {

values[index] /= amount;

}

private void checkMinMax(String functionName) {

if (count == 0) {

String msg =

String.format("Cannot use %s() on an empty %s.",

functionName, getClass().getSimpleName());

throw new RuntimeException(msg);

}

// return the index of the minimum value

public int minIndex() {

checkMinMax("minIndex");

int index = 0;

int value = values[0];

for (int i = 1; i < count; i++) {

if (values[i] < value) {

index = i;

value = values[i];

}

return index;

}

// return the minimum value

public int minValue() {

checkMinMax("minValue");

return values[minIndex()];

}

// return the key for the minimum value

public String minKey() {

checkMinMax("minKey");

return keys[minIndex()];

}

// return the index of the max value

public int maxIndex() {

checkMinMax("maxIndex");

int index = 0;

int value = values[0];

for (int i = 1; i < count; i++) {

if (values[i] > value) {

index = i;

value = values[i];

}

return index;

}

// return the maximum value

public int maxValue() {

checkMinMax("maxValue");

return values[maxIndex()];

}

// return the key corresponding to the maximum value

public String maxKey() {

checkMinMax("maxKey");

return keys[maxIndex()];

}

public int index(String what) {

Integer found = indices.get(what);

return (found == null) ? -1 : found.intValue();

}

protected void create(String what, int much) {

if (count == keys.length) {

keys = PApplet.expand(keys);

values = PApplet.expand(values);

}

indices.put(what, new Integer(count));

keys[count] = what;

values[count] = much;

count++;

}

/**

* @webref intdict:method

* @brief Remove a key/value pair

public int remove(String key) {

int index = index(key);

if (index != -1) {

removeIndex(index);

}

return index;

}

public String removeIndex(int index) {

if (index < 0 || index >= count) {

throw new ArrayIndexOutOfBoundsException(index);

}

//System.out.println("index is " + which + " and " + keys[which]);

String key = keys[index];

indices.remove(keys[index]);

for (int i = index; i < count-1; i++) {

keys[i] = keys[i+1];

values[i] = values[i+1];

indices.put(keys[i], i);

}

count--;

keys[count] = null;

values[count] = 0;

return key;

}

public void swap(int a, int b) {

String tkey = keys[a];

int tvalue = values[a];

keys[a] = keys[b];

values[a] = values[b];

keys[b] = tkey;

values[b] = tvalue;

indices.put(keys[a], new Integer(a));

indices.put(keys[b], new Integer(b));

}

/**

* Sort the keys alphabetically (ignoring case). Uses the value as a

* tie-breaker (only really possible with a key that has a case change).

* @webref intdict:method

* @brief Sort the keys alphabetically

public void sortKeys() {

sortImpl(true, false);

}

/**

* Sort the keys alphabetically in reverse (ignoring case). Uses the value as a

* tie-breaker (only really possible with a key that has a case change).

* @webref intdict:method

* @brief Sort the keys alphabetially in reverse

public void sortKeysReverse() {

sortImpl(true, true);

}

/**

<<<<<<< HEAD

* Sort by values in descending order (largest value will be at [0]).

=======

* Sort by values in ascending order. The smallest value will be at [0].

>>>>>>> cd467dc12a42d588638aaab06746bebdfb333cc4

* @webref intdict:method

* @brief Sort by values in ascending order

public void sortValues() {

sortImpl(false, false);

}

/**

* Sort by values in descending order. The largest value will be at [0].

* @webref intdict:method

* @brief Sort by values in descending order

public void sortValuesReverse() {

sortImpl(false, true);

}

protected void sortImpl(final boolean useKeys, final boolean reverse) {

Sort s = new Sort() {

@Override

public int size() {

return count;

}

@Override

public float compare(int a, int b) {

int diff = 0;

if (useKeys) {

diff = keys[a].compareToIgnoreCase(keys[b]);

if (diff == 0) {

return values[a] - values[b];

}

} else { // sort values

diff = values[a] - values[b];

if (diff == 0) {

diff = keys[a].compareToIgnoreCase(keys[b]);

}

return reverse ? -diff : diff;

}

@Override

public void swap(int a, int b) {

IntDict.this.swap(a, b);

}

};

s.run();

}

/**

* Sum all of the values in this dictionary, then return a new FloatDict of

* each key, divided by the total sum. The total for all values will be ~1.0.

* @return a Dict with the original keys, mapped to their pct of the total

public FloatDict getPercent() {

double sum = 0;

for (int value : valueArray()) {

sum += value;

}

FloatDict outgoing = new FloatDict();

for (int i = 0; i < size(); i++) {

double percent = value(i) / sum;

outgoing.set(key(i), (float) percent);

}

return outgoing;

}

/** Returns a duplicate copy of this object. */

public IntDict copy() {

IntDict outgoing = new IntDict(count);

System.arraycopy(keys, 0, outgoing.keys, 0, count);

System.arraycopy(values, 0, outgoing.values, 0, count);

for (int i = 0; i < count; i++) {

outgoing.indices.put(keys[i], i);

}

outgoing.count = count;

return outgoing;

}

/**

* Write tab-delimited entries out to

* @param writer

public void write(PrintWriter writer) {

for (int i = 0; i < count; i++) {

writer.println(keys[i] + "\t" + values[i]);

}

writer.flush();

}

public void print() {

for (int i = 0; i < size(); i++) {

System.out.println(keys[i] + " = " + values[i]);

}

@Override

public String toString() {

StringBuilder sb = new StringBuilder();

sb.append(getClass().getSimpleName() + " size=" + size() + " { ");

for (int i = 0; i < size(); i++) {

if (i != 0) {

sb.append(", ");

}

sb.append("\"" + keys[i] + "\": " + values[i]);

}

sb.append(" }");

return sb.toString();

}

processing/core/src/processing/data/IntDict.java at master · h2oop/processing · GitHub

Repository navigation

Expand file tree

Breadcrumbs

IntDict.java

Latest commit

History

Breadcrumbs

IntDict.java

File metadata and controls