Lowest_withRunnerUp [1024837]

< > BotCompany Repo | #1024837 // Lowest_withRunnerUp

JavaX fragment (include) [tags: use-pretranspiled]

sclass Lowest_withRunnerUp<A> extends Lowest<A> {
  A runnerUp;
  double runnerUpScore;

  bool put(A a, double score) {
    bool change = false;
    synchronized(this) {
      if (a != null && isNewBest(score)) {
        runnerUp = best;
        runnerUpScore = this.score;
        best = a;
        this.score = score;
        set change;
      }
    }
    if (change)
      pcallF(onChange);
    ret change;
  }
  
  synchronized Pair<A, Double> runnerUpPair() { ret runnerUp == null ? null : main.pair(runnerUp, runnerUpScore); }
}

Author comment

Began life as a copy of #1006448

Travelled to 6 computer(s): bhatertpkbcr, mqqgnosmbjvj, pyentgdyhuwx, pzhvpgtvlbxg, tvejysmllsmz, vouqrxazstgt

Snippet ID:

#1024837

Snippet name:

Lowest_withRunnerUp

Eternal ID of this version:

#1024837/4

Text MD5:

cdcee0a3e882cd33ab55f8f0d561694b

Transpilation MD5:

9c1f65f1169736f1a9636c024cb47999

Author:

stefan

Category:

javax / genetic optimization

Type:

JavaX fragment (include)

Public (visible to everyone):

Yes

Archived (hidden from active list):

Created/modified:

2019-08-26 19:37:31

Source code size:

556 bytes / 22 lines

Pitched / IR pitched:

No / No

Views / Downloads:

255 / 649

Version history:

3 change(s)

Referenced in:

[show references]

1	sclass Lowest_withRunnerUp<A> extends Lowest<A> {
2	A runnerUp;
3	double runnerUpScore;
4
5	bool put(A a, double score) {
6	bool change = false;
7	synchronized(this) {
8	if (a != null && isNewBest(score)) {
9	runnerUp = best;
10	runnerUpScore = this.score;
11	best = a;
12	this.score = score;
13	set change;
14	}
15	}
16	if (change)
17	pcallF(onChange);
18	ret change;
19	}
20
21	synchronized Pair<A, Double> runnerUpPair() { ret runnerUp == null ? null : main.pair(runnerUp, runnerUpScore); }
22	}