504 lines
55 KiB
HTML
504 lines
55 KiB
HTML
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
|
|
|
|
<html lang="en">
|
|
|
|
<head>
|
|
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
|
|
<title>LCOV - lcov.info - lib/utils/tie_breaker_util.dart</title>
|
|
<link rel="stylesheet" type="text/css" href="../../gcov.css">
|
|
</head>
|
|
|
|
<body>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="title">LCOV - code coverage report</td></tr>
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
|
|
<tr>
|
|
<td width="100%">
|
|
<table cellpadding=1 border=0 width="100%">
|
|
<tr>
|
|
<td width="10%" class="headerItem">Current view:</td>
|
|
<td width="10%" class="headerValue"><a href="../../index.html" title="Click to go to top-level">top level</a> - <a href="index.html" title="Click to go to directory lib/utils">lib/utils</a> - tie_breaker_util.dart</td>
|
|
<td width="5%"></td>
|
|
<td width="5%"></td>
|
|
<td width="5%" class="headerCovTableHead">Coverage</td>
|
|
<td width="5%" class="headerCovTableHead" title="Covered + Uncovered code">Total</td>
|
|
<td width="5%" class="headerCovTableHead" title="Exercised code only">Hit</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test:</td>
|
|
<td class="headerValue">lcov.info</td>
|
|
<td></td>
|
|
<td class="headerItem">Lines:</td>
|
|
<td class="headerCovTableEntryLo">66.7 %</td>
|
|
<td class="headerCovTableEntry">168</td>
|
|
<td class="headerCovTableEntry">112</td>
|
|
</tr>
|
|
<tr>
|
|
<td class="headerItem">Test Date:</td>
|
|
<td class="headerValue">2025-08-12 03:21:51</td>
|
|
<td></td>
|
|
<td class="headerItem">Functions:</td>
|
|
<td class="headerCovTableEntryHi">-</td>
|
|
<td class="headerCovTableEntry">0</td>
|
|
<td class="headerCovTableEntry">0</td>
|
|
</tr>
|
|
<tr><td><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
</td>
|
|
</tr>
|
|
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
</table>
|
|
|
|
<table cellpadding=0 cellspacing=0 border=0>
|
|
<tr>
|
|
<td><br></td>
|
|
</tr>
|
|
<tr>
|
|
<td>
|
|
<pre class="sourceHeading"> Line data Source code</pre>
|
|
<pre class="source">
|
|
<span id="L1"><span class="lineNum"> 1</span> : import 'package:lanebow/models/member_model.dart';</span>
|
|
<span id="L2"><span class="lineNum"> 2</span> : import 'package:lanebow/models/score_model.dart';</span>
|
|
<span id="L3"><span class="lineNum"> 3</span> : import 'package:lanebow/models/tie_breaker_option.dart';</span>
|
|
<span id="L4"><span class="lineNum"> 4</span> : </span>
|
|
<span id="L5"><span class="lineNum"> 5</span> : /// 동점자 처리를 위한 유틸리티 클래스</span>
|
|
<span id="L6"><span class="lineNum"> 6</span> : class TieBreakerUtil {</span>
|
|
<span id="L7"><span class="lineNum"> 7</span> : /// 동점자 처리 옵션에 따라 점수 목록을 정렬</span>
|
|
<span id="L8"><span class="lineNum"> 8</span> : /// </span>
|
|
<span id="L9"><span class="lineNum"> 9</span> : /// [scores] 정렬할 점수 목록</span>
|
|
<span id="L10"><span class="lineNum"> 10</span> : /// [options] 적용할 동점자 처리 옵션 우선순위 목록</span>
|
|
<span id="L11"><span class="lineNum"> 11</span> : /// [members] 회원 정보 목록 (연령 기준 정렬 시 필요)</span>
|
|
<span id="L12"><span class="lineNum"> 12</span> : /// [includeHandicap] 핸디캡 포함 여부</span>
|
|
<span id="L13"><span class="lineNum"> 13</span> : /// </span>
|
|
<span id="L14"><span class="lineNum"> 14</span> : /// 반환값: 정렬된 점수 목록</span>
|
|
<span id="L15"><span class="lineNum"> 15</span> <span class="tlaGNC"> 2 : static List<Score> sortScoresByOptions(</span></span>
|
|
<span id="L16"><span class="lineNum"> 16</span> : List<Score> scores, </span>
|
|
<span id="L17"><span class="lineNum"> 17</span> : List<TieBreakerOption>? options, </span>
|
|
<span id="L18"><span class="lineNum"> 18</span> : List<Member>? members, </span>
|
|
<span id="L19"><span class="lineNum"> 19</span> : bool includeHandicap</span>
|
|
<span id="L20"><span class="lineNum"> 20</span> : ) {</span>
|
|
<span id="L21"><span class="lineNum"> 21</span> : // 옵션이 없거나 비어있으면 기본 정렬만 적용</span>
|
|
<span id="L22"><span class="lineNum"> 22</span> <span class="tlaGNC"> 2 : if (options == null || options.isEmpty) {</span></span>
|
|
<span id="L23"><span class="lineNum"> 23</span> <span class="tlaGNC"> 1 : return _sortScoresByDefault(scores, includeHandicap);</span></span>
|
|
<span id="L24"><span class="lineNum"> 24</span> : }</span>
|
|
<span id="L25"><span class="lineNum"> 25</span> : </span>
|
|
<span id="L26"><span class="lineNum"> 26</span> : // olderAge 옵션이 단독으로 있는 경우 특별 처리</span>
|
|
<span id="L27"><span class="lineNum"> 27</span> <span class="tlaGNC"> 5 : if (options.length == 1 && options.contains(TieBreakerOption.olderAge)) {</span></span>
|
|
<span id="L28"><span class="lineNum"> 28</span> <span class="tlaGNC"> 1 : if (members == null || members.isEmpty) {</span></span>
|
|
<span id="L29"><span class="lineNum"> 29</span> <span class="tlaUNC"> 0 : return _sortScoresByDefault(scores, includeHandicap);</span></span>
|
|
<span id="L30"><span class="lineNum"> 30</span> : }</span>
|
|
<span id="L31"><span class="lineNum"> 31</span> : </span>
|
|
<span id="L32"><span class="lineNum"> 32</span> : // 연장자 순으로 정렬</span>
|
|
<span id="L33"><span class="lineNum"> 33</span> <span class="tlaGNC"> 3 : return List.from(scores)..sort((a, b) {</span></span>
|
|
<span id="L34"><span class="lineNum"> 34</span> <span class="tlaGNC"> 2 : DateTime? birthDateA = _findMemberBirthDate(a.memberId, members);</span></span>
|
|
<span id="L35"><span class="lineNum"> 35</span> <span class="tlaGNC"> 2 : DateTime? birthDateB = _findMemberBirthDate(b.memberId, members);</span></span>
|
|
<span id="L36"><span class="lineNum"> 36</span> : </span>
|
|
<span id="L37"><span class="lineNum"> 37</span> : if (birthDateA == null || birthDateB == null) {</span>
|
|
<span id="L38"><span class="lineNum"> 38</span> : // 생년월일이 없으면 점수로 정렬</span>
|
|
<span id="L39"><span class="lineNum"> 39</span> <span class="tlaUNC"> 0 : int scoreA = includeHandicap ? (a.totalScore + (a.handicap ?? 0)) : a.totalScore;</span></span>
|
|
<span id="L40"><span class="lineNum"> 40</span> <span class="tlaUNC"> 0 : int scoreB = includeHandicap ? (b.totalScore + (b.handicap ?? 0)) : b.totalScore;</span></span>
|
|
<span id="L41"><span class="lineNum"> 41</span> <span class="tlaUNC"> 0 : return scoreB.compareTo(scoreA); // 내림차순</span></span>
|
|
<span id="L42"><span class="lineNum"> 42</span> : }</span>
|
|
<span id="L43"><span class="lineNum"> 43</span> : </span>
|
|
<span id="L44"><span class="lineNum"> 44</span> <span class="tlaGNC"> 1 : return birthDateA.compareTo(birthDateB); // 오름차순 정렬로 연장자 우선</span></span>
|
|
<span id="L45"><span class="lineNum"> 45</span> : });</span>
|
|
<span id="L46"><span class="lineNum"> 46</span> : }</span>
|
|
<span id="L47"><span class="lineNum"> 47</span> : </span>
|
|
<span id="L48"><span class="lineNum"> 48</span> : // 기본 점수 정렬 (점수 내림차순)</span>
|
|
<span id="L49"><span class="lineNum"> 49</span> <span class="tlaGNC"> 2 : List<Score> sortedScores = _sortScoresByDefault(scores, includeHandicap);</span></span>
|
|
<span id="L50"><span class="lineNum"> 50</span> : </span>
|
|
<span id="L51"><span class="lineNum"> 51</span> : // 점수별 그룹화</span>
|
|
<span id="L52"><span class="lineNum"> 52</span> <span class="tlaGNC"> 2 : Map<int, List<Score>> scoreGroups = {};</span></span>
|
|
<span id="L53"><span class="lineNum"> 53</span> : </span>
|
|
<span id="L54"><span class="lineNum"> 54</span> <span class="tlaGNC"> 6 : for (int i = 0; i < sortedScores.length; i++) {</span></span>
|
|
<span id="L55"><span class="lineNum"> 55</span> : int currentScore = includeHandicap </span>
|
|
<span id="L56"><span class="lineNum"> 56</span> <span class="tlaGNC"> 10 : ? (sortedScores[i].totalScore + (sortedScores[i].handicap ?? 0))</span></span>
|
|
<span id="L57"><span class="lineNum"> 57</span> <span class="tlaGNC"> 4 : : sortedScores[i].totalScore;</span></span>
|
|
<span id="L58"><span class="lineNum"> 58</span> : </span>
|
|
<span id="L59"><span class="lineNum"> 59</span> <span class="tlaGNC"> 2 : if (!scoreGroups.containsKey(currentScore)) {</span></span>
|
|
<span id="L60"><span class="lineNum"> 60</span> <span class="tlaGNC"> 4 : scoreGroups[currentScore] = [];</span></span>
|
|
<span id="L61"><span class="lineNum"> 61</span> : }</span>
|
|
<span id="L62"><span class="lineNum"> 62</span> <span class="tlaGNC"> 6 : scoreGroups[currentScore]?.add(sortedScores[i]);</span></span>
|
|
<span id="L63"><span class="lineNum"> 63</span> : }</span>
|
|
<span id="L64"><span class="lineNum"> 64</span> : </span>
|
|
<span id="L65"><span class="lineNum"> 65</span> : // 결과 목록 준비</span>
|
|
<span id="L66"><span class="lineNum"> 66</span> <span class="tlaGNC"> 2 : List<Score> result = [];</span></span>
|
|
<span id="L67"><span class="lineNum"> 67</span> : </span>
|
|
<span id="L68"><span class="lineNum"> 68</span> : // 점수 내림차순 정렬</span>
|
|
<span id="L69"><span class="lineNum"> 69</span> <span class="tlaGNC"> 10 : List<int> sortedScoreValues = scoreGroups.keys.toList()..sort((a, b) => b.compareTo(a));</span></span>
|
|
<span id="L70"><span class="lineNum"> 70</span> : </span>
|
|
<span id="L71"><span class="lineNum"> 71</span> : // 각 점수 그룹에 대해 처리</span>
|
|
<span id="L72"><span class="lineNum"> 72</span> <span class="tlaGNC"> 4 : for (int scoreValue in sortedScoreValues) {</span></span>
|
|
<span id="L73"><span class="lineNum"> 73</span> <span class="tlaGNC"> 2 : List<Score> group = scoreGroups[scoreValue]!;</span></span>
|
|
<span id="L74"><span class="lineNum"> 74</span> : </span>
|
|
<span id="L75"><span class="lineNum"> 75</span> : // 그룹 크기가 1이면 그대로 추가</span>
|
|
<span id="L76"><span class="lineNum"> 76</span> <span class="tlaGNC"> 4 : if (group.length == 1) {</span></span>
|
|
<span id="L77"><span class="lineNum"> 77</span> <span class="tlaGNC"> 4 : result.add(group[0]);</span></span>
|
|
<span id="L78"><span class="lineNum"> 78</span> : continue;</span>
|
|
<span id="L79"><span class="lineNum"> 79</span> : }</span>
|
|
<span id="L80"><span class="lineNum"> 80</span> : </span>
|
|
<span id="L81"><span class="lineNum"> 81</span> : // 동점자 그룹 정렬</span>
|
|
<span id="L82"><span class="lineNum"> 82</span> <span class="tlaGNC"> 2 : List<Score> resolvedGroup = List.from(group);</span></span>
|
|
<span id="L83"><span class="lineNum"> 83</span> : </span>
|
|
<span id="L84"><span class="lineNum"> 84</span> : // 옵션에 따른 정렬 적용</span>
|
|
<span id="L85"><span class="lineNum"> 85</span> <span class="tlaGNC"> 2 : if (options.contains(TieBreakerOption.lowerHandicap)) {</span></span>
|
|
<span id="L86"><span class="lineNum"> 86</span> : // 핸디캡이 낮은 순으로 정렬</span>
|
|
<span id="L87"><span class="lineNum"> 87</span> <span class="tlaGNC"> 4 : resolvedGroup.sort((a, b) {</span></span>
|
|
<span id="L88"><span class="lineNum"> 88</span> <span class="tlaGNC"> 2 : int handicapA = a.handicap ?? 0;</span></span>
|
|
<span id="L89"><span class="lineNum"> 89</span> <span class="tlaGNC"> 2 : int handicapB = b.handicap ?? 0;</span></span>
|
|
<span id="L90"><span class="lineNum"> 90</span> <span class="tlaGNC"> 2 : return handicapA.compareTo(handicapB);</span></span>
|
|
<span id="L91"><span class="lineNum"> 91</span> : });</span>
|
|
<span id="L92"><span class="lineNum"> 92</span> : }</span>
|
|
<span id="L93"><span class="lineNum"> 93</span> : </span>
|
|
<span id="L94"><span class="lineNum"> 94</span> : // 핸디캡이 같은 경우 연장자 우선 정렬</span>
|
|
<span id="L95"><span class="lineNum"> 95</span> <span class="tlaGNC"> 4 : if (options.contains(TieBreakerOption.olderAge) && members != null && members.isNotEmpty) {</span></span>
|
|
<span id="L96"><span class="lineNum"> 96</span> : // 핸디캡이 같은 그룹들로 나누기</span>
|
|
<span id="L97"><span class="lineNum"> 97</span> <span class="tlaGNC"> 2 : Map<int, List<Score>> handicapGroups = {};</span></span>
|
|
<span id="L98"><span class="lineNum"> 98</span> <span class="tlaGNC"> 4 : for (var score in resolvedGroup) {</span></span>
|
|
<span id="L99"><span class="lineNum"> 99</span> <span class="tlaGNC"> 2 : int handicap = score.handicap ?? 0;</span></span>
|
|
<span id="L100"><span class="lineNum"> 100</span> <span class="tlaGNC"> 2 : if (!handicapGroups.containsKey(handicap)) {</span></span>
|
|
<span id="L101"><span class="lineNum"> 101</span> <span class="tlaGNC"> 4 : handicapGroups[handicap] = [];</span></span>
|
|
<span id="L102"><span class="lineNum"> 102</span> : }</span>
|
|
<span id="L103"><span class="lineNum"> 103</span> <span class="tlaGNC"> 4 : handicapGroups[handicap]!.add(score);</span></span>
|
|
<span id="L104"><span class="lineNum"> 104</span> : }</span>
|
|
<span id="L105"><span class="lineNum"> 105</span> : </span>
|
|
<span id="L106"><span class="lineNum"> 106</span> : // 각 핸디캡 그룹 내에서 연장자 순으로 정렬</span>
|
|
<span id="L107"><span class="lineNum"> 107</span> <span class="tlaGNC"> 2 : List<Score> newResolvedGroup = [];</span></span>
|
|
<span id="L108"><span class="lineNum"> 108</span> <span class="tlaGNC"> 10 : List<int> handicapValues = handicapGroups.keys.toList()..sort((a, b) => a.compareTo(b));</span></span>
|
|
<span id="L109"><span class="lineNum"> 109</span> : </span>
|
|
<span id="L110"><span class="lineNum"> 110</span> <span class="tlaGNC"> 4 : for (int handicap in handicapValues) {</span></span>
|
|
<span id="L111"><span class="lineNum"> 111</span> <span class="tlaGNC"> 2 : List<Score> handicapGroup = handicapGroups[handicap]!;</span></span>
|
|
<span id="L112"><span class="lineNum"> 112</span> <span class="tlaGNC"> 4 : if (handicapGroup.length > 1) {</span></span>
|
|
<span id="L113"><span class="lineNum"> 113</span> <span class="tlaGNC"> 2 : handicapGroup.sort((a, b) {</span></span>
|
|
<span id="L114"><span class="lineNum"> 114</span> <span class="tlaGNC"> 2 : DateTime? birthDateA = _findMemberBirthDate(a.memberId, members);</span></span>
|
|
<span id="L115"><span class="lineNum"> 115</span> <span class="tlaGNC"> 2 : DateTime? birthDateB = _findMemberBirthDate(b.memberId, members);</span></span>
|
|
<span id="L116"><span class="lineNum"> 116</span> : </span>
|
|
<span id="L117"><span class="lineNum"> 117</span> : if (birthDateA == null || birthDateB == null) return 0;</span>
|
|
<span id="L118"><span class="lineNum"> 118</span> <span class="tlaGNC"> 1 : return birthDateA.compareTo(birthDateB); // 오름차순 정렬로 연장자 우선</span></span>
|
|
<span id="L119"><span class="lineNum"> 119</span> : });</span>
|
|
<span id="L120"><span class="lineNum"> 120</span> : }</span>
|
|
<span id="L121"><span class="lineNum"> 121</span> <span class="tlaGNC"> 2 : newResolvedGroup.addAll(handicapGroup);</span></span>
|
|
<span id="L122"><span class="lineNum"> 122</span> : }</span>
|
|
<span id="L123"><span class="lineNum"> 123</span> : </span>
|
|
<span id="L124"><span class="lineNum"> 124</span> : resolvedGroup = newResolvedGroup;</span>
|
|
<span id="L125"><span class="lineNum"> 125</span> : }</span>
|
|
<span id="L126"><span class="lineNum"> 126</span> : </span>
|
|
<span id="L127"><span class="lineNum"> 127</span> : // 점수 격차가 적은 순으로 정렬</span>
|
|
<span id="L128"><span class="lineNum"> 128</span> <span class="tlaGNC"> 2 : if (options.contains(TieBreakerOption.lowerScoreGap)) {</span></span>
|
|
<span id="L129"><span class="lineNum"> 129</span> : // 이미 정렬된 그룹에서 추가 정렬 적용</span>
|
|
<span id="L130"><span class="lineNum"> 130</span> <span class="tlaGNC"> 2 : List<Score> scoreGapSorted = [];</span></span>
|
|
<span id="L131"><span class="lineNum"> 131</span> : </span>
|
|
<span id="L132"><span class="lineNum"> 132</span> : // 핸디캡과 연령으로 이미 정렬된 그룹들을 찾아서 각 그룹 내에서 점수 격차 정렬 적용</span>
|
|
<span id="L133"><span class="lineNum"> 133</span> <span class="tlaGNC"> 2 : Map<String, List<Score>> tiedGroups = {};</span></span>
|
|
<span id="L134"><span class="lineNum"> 134</span> : String currentKey = "";</span>
|
|
<span id="L135"><span class="lineNum"> 135</span> : </span>
|
|
<span id="L136"><span class="lineNum"> 136</span> <span class="tlaGNC"> 6 : for (int i = 0; i < resolvedGroup.length; i++) {</span></span>
|
|
<span id="L137"><span class="lineNum"> 137</span> <span class="tlaGNC"> 2 : Score current = resolvedGroup[i];</span></span>
|
|
<span id="L138"><span class="lineNum"> 138</span> <span class="tlaGNC"> 2 : int handicap = current.handicap ?? 0;</span></span>
|
|
<span id="L139"><span class="lineNum"> 139</span> <span class="tlaGNC"> 2 : String memberId = current.memberId;</span></span>
|
|
<span id="L140"><span class="lineNum"> 140</span> : </span>
|
|
<span id="L141"><span class="lineNum"> 141</span> <span class="tlaGNC"> 2 : String key = "$handicap-$memberId";</span></span>
|
|
<span id="L142"><span class="lineNum"> 142</span> <span class="tlaGNC"> 4 : if (i == 0 || key != currentKey) {</span></span>
|
|
<span id="L143"><span class="lineNum"> 143</span> : currentKey = key;</span>
|
|
<span id="L144"><span class="lineNum"> 144</span> <span class="tlaGNC"> 4 : tiedGroups[currentKey] = [];</span></span>
|
|
<span id="L145"><span class="lineNum"> 145</span> : }</span>
|
|
<span id="L146"><span class="lineNum"> 146</span> <span class="tlaGNC"> 4 : tiedGroups[currentKey]!.add(current);</span></span>
|
|
<span id="L147"><span class="lineNum"> 147</span> : }</span>
|
|
<span id="L148"><span class="lineNum"> 148</span> : </span>
|
|
<span id="L149"><span class="lineNum"> 149</span> : // 각 그룹에 대해 점수 격차 정렬 적용</span>
|
|
<span id="L150"><span class="lineNum"> 150</span> <span class="tlaGNC"> 4 : for (var group in tiedGroups.values) {</span></span>
|
|
<span id="L151"><span class="lineNum"> 151</span> <span class="tlaGNC"> 4 : if (group.length > 1) {</span></span>
|
|
<span id="L152"><span class="lineNum"> 152</span> <span class="tlaUNC"> 0 : group.sort((a, b) {</span></span>
|
|
<span id="L153"><span class="lineNum"> 153</span> <span class="tlaUNC"> 0 : int gapA = _calculateScoreGap(a.frames);</span></span>
|
|
<span id="L154"><span class="lineNum"> 154</span> <span class="tlaUNC"> 0 : int gapB = _calculateScoreGap(b.frames);</span></span>
|
|
<span id="L155"><span class="lineNum"> 155</span> <span class="tlaUNC"> 0 : return gapA.compareTo(gapB); // 오름차순 (격차가 적은 것이 우선)</span></span>
|
|
<span id="L156"><span class="lineNum"> 156</span> : });</span>
|
|
<span id="L157"><span class="lineNum"> 157</span> : }</span>
|
|
<span id="L158"><span class="lineNum"> 158</span> <span class="tlaGNC"> 2 : scoreGapSorted.addAll(group);</span></span>
|
|
<span id="L159"><span class="lineNum"> 159</span> : }</span>
|
|
<span id="L160"><span class="lineNum"> 160</span> : </span>
|
|
<span id="L161"><span class="lineNum"> 161</span> : resolvedGroup = scoreGapSorted;</span>
|
|
<span id="L162"><span class="lineNum"> 162</span> : }</span>
|
|
<span id="L163"><span class="lineNum"> 163</span> : </span>
|
|
<span id="L164"><span class="lineNum"> 164</span> : // 정렬된 그룹 추가</span>
|
|
<span id="L165"><span class="lineNum"> 165</span> <span class="tlaGNC"> 2 : result.addAll(resolvedGroup);</span></span>
|
|
<span id="L166"><span class="lineNum"> 166</span> : }</span>
|
|
<span id="L167"><span class="lineNum"> 167</span> : </span>
|
|
<span id="L168"><span class="lineNum"> 168</span> : return result;</span>
|
|
<span id="L169"><span class="lineNum"> 169</span> : }</span>
|
|
<span id="L170"><span class="lineNum"> 170</span> : </span>
|
|
<span id="L171"><span class="lineNum"> 171</span> : /// 기본 점수 정렬 (점수 내림차순)</span>
|
|
<span id="L172"><span class="lineNum"> 172</span> <span class="tlaGNC"> 2 : static List<Score> _sortScoresByDefault(List<Score> scores, bool includeHandicap) {</span></span>
|
|
<span id="L173"><span class="lineNum"> 173</span> <span class="tlaGNC"> 6 : return List.from(scores)..sort((a, b) {</span></span>
|
|
<span id="L174"><span class="lineNum"> 174</span> <span class="tlaGNC"> 8 : int scoreA = includeHandicap ? (a.totalScore + (a.handicap ?? 0)) : a.totalScore;</span></span>
|
|
<span id="L175"><span class="lineNum"> 175</span> <span class="tlaGNC"> 8 : int scoreB = includeHandicap ? (b.totalScore + (b.handicap ?? 0)) : b.totalScore;</span></span>
|
|
<span id="L176"><span class="lineNum"> 176</span> <span class="tlaGNC"> 2 : return scoreB.compareTo(scoreA); // 내림차순</span></span>
|
|
<span id="L177"><span class="lineNum"> 177</span> : });</span>
|
|
<span id="L178"><span class="lineNum"> 178</span> : }</span>
|
|
<span id="L179"><span class="lineNum"> 179</span> : </span>
|
|
<span id="L180"><span class="lineNum"> 180</span> : /// 동점자 그룹 찾기</span>
|
|
<span id="L181"><span class="lineNum"> 181</span> <span class="tlaUNC"> 0 : static Map<int, List<Score>> _findTiedGroups(List<Score> sortedScores, bool includeHandicap) {</span></span>
|
|
<span id="L182"><span class="lineNum"> 182</span> <span class="tlaUNC"> 0 : Map<int, List<Score>> tiedGroups = {};</span></span>
|
|
<span id="L183"><span class="lineNum"> 183</span> : </span>
|
|
<span id="L184"><span class="lineNum"> 184</span> <span class="tlaUNC"> 0 : for (int i = 0; i < sortedScores.length; i++) {</span></span>
|
|
<span id="L185"><span class="lineNum"> 185</span> : int currentScore = includeHandicap </span>
|
|
<span id="L186"><span class="lineNum"> 186</span> <span class="tlaUNC"> 0 : ? (sortedScores[i].totalScore + (sortedScores[i].handicap ?? 0))</span></span>
|
|
<span id="L187"><span class="lineNum"> 187</span> <span class="tlaUNC"> 0 : : sortedScores[i].totalScore;</span></span>
|
|
<span id="L188"><span class="lineNum"> 188</span> : </span>
|
|
<span id="L189"><span class="lineNum"> 189</span> <span class="tlaUNC"> 0 : List<Score> sameScores = [sortedScores[i]];</span></span>
|
|
<span id="L190"><span class="lineNum"> 190</span> : </span>
|
|
<span id="L191"><span class="lineNum"> 191</span> : // 같은 점수를 가진 항목 찾기</span>
|
|
<span id="L192"><span class="lineNum"> 192</span> <span class="tlaUNC"> 0 : for (int j = i + 1; j < sortedScores.length; j++) {</span></span>
|
|
<span id="L193"><span class="lineNum"> 193</span> : int nextScore = includeHandicap </span>
|
|
<span id="L194"><span class="lineNum"> 194</span> <span class="tlaUNC"> 0 : ? (sortedScores[j].totalScore + (sortedScores[j].handicap ?? 0))</span></span>
|
|
<span id="L195"><span class="lineNum"> 195</span> <span class="tlaUNC"> 0 : : sortedScores[j].totalScore;</span></span>
|
|
<span id="L196"><span class="lineNum"> 196</span> : </span>
|
|
<span id="L197"><span class="lineNum"> 197</span> <span class="tlaUNC"> 0 : if (currentScore == nextScore) {</span></span>
|
|
<span id="L198"><span class="lineNum"> 198</span> <span class="tlaUNC"> 0 : sameScores.add(sortedScores[j]);</span></span>
|
|
<span id="L199"><span class="lineNum"> 199</span> : i = j; // 이미 처리한 항목 건너뛰기</span>
|
|
<span id="L200"><span class="lineNum"> 200</span> : } else {</span>
|
|
<span id="L201"><span class="lineNum"> 201</span> : break; // 다른 점수 발견 시 중단</span>
|
|
<span id="L202"><span class="lineNum"> 202</span> : }</span>
|
|
<span id="L203"><span class="lineNum"> 203</span> : }</span>
|
|
<span id="L204"><span class="lineNum"> 204</span> : </span>
|
|
<span id="L205"><span class="lineNum"> 205</span> : // 동점자가 2명 이상인 경우만 그룹에 추가</span>
|
|
<span id="L206"><span class="lineNum"> 206</span> <span class="tlaUNC"> 0 : if (sameScores.length > 1) {</span></span>
|
|
<span id="L207"><span class="lineNum"> 207</span> <span class="tlaUNC"> 0 : tiedGroups[currentScore] = sameScores;</span></span>
|
|
<span id="L208"><span class="lineNum"> 208</span> : }</span>
|
|
<span id="L209"><span class="lineNum"> 209</span> : }</span>
|
|
<span id="L210"><span class="lineNum"> 210</span> : </span>
|
|
<span id="L211"><span class="lineNum"> 211</span> : return tiedGroups;</span>
|
|
<span id="L212"><span class="lineNum"> 212</span> : }</span>
|
|
<span id="L213"><span class="lineNum"> 213</span> : </span>
|
|
<span id="L214"><span class="lineNum"> 214</span> : /// 동점자 처리 옵션 적용</span>
|
|
<span id="L215"><span class="lineNum"> 215</span> <span class="tlaUNC"> 0 : static List<Score> _applyTieBreakerOption(</span></span>
|
|
<span id="L216"><span class="lineNum"> 216</span> : List<Score> tiedScores, </span>
|
|
<span id="L217"><span class="lineNum"> 217</span> : TieBreakerOption option, </span>
|
|
<span id="L218"><span class="lineNum"> 218</span> : List<Member>? members, </span>
|
|
<span id="L219"><span class="lineNum"> 219</span> : bool includeHandicap</span>
|
|
<span id="L220"><span class="lineNum"> 220</span> : ) {</span>
|
|
<span id="L221"><span class="lineNum"> 221</span> : switch (option) {</span>
|
|
<span id="L222"><span class="lineNum"> 222</span> <span class="tlaUNC"> 0 : case TieBreakerOption.lowerHandicap:</span></span>
|
|
<span id="L223"><span class="lineNum"> 223</span> <span class="tlaUNC"> 0 : return _sortByLowerHandicap(tiedScores);</span></span>
|
|
<span id="L224"><span class="lineNum"> 224</span> : </span>
|
|
<span id="L225"><span class="lineNum"> 225</span> <span class="tlaUNC"> 0 : case TieBreakerOption.lowerScoreGap:</span></span>
|
|
<span id="L226"><span class="lineNum"> 226</span> <span class="tlaUNC"> 0 : return _sortByLowerScoreGap(tiedScores);</span></span>
|
|
<span id="L227"><span class="lineNum"> 227</span> : </span>
|
|
<span id="L228"><span class="lineNum"> 228</span> <span class="tlaUNC"> 0 : case TieBreakerOption.olderAge:</span></span>
|
|
<span id="L229"><span class="lineNum"> 229</span> <span class="tlaUNC"> 0 : return _sortByOlderAge(tiedScores, members);</span></span>
|
|
<span id="L230"><span class="lineNum"> 230</span> : </span>
|
|
<span id="L231"><span class="lineNum"> 231</span> <span class="tlaUNC"> 0 : case TieBreakerOption.none:</span></span>
|
|
<span id="L232"><span class="lineNum"> 232</span> : return tiedScores; // 변경 없음</span>
|
|
<span id="L233"><span class="lineNum"> 233</span> : }</span>
|
|
<span id="L234"><span class="lineNum"> 234</span> : }</span>
|
|
<span id="L235"><span class="lineNum"> 235</span> : </span>
|
|
<span id="L236"><span class="lineNum"> 236</span> : /// 핸디캡이 적은 순으로 정렬</span>
|
|
<span id="L237"><span class="lineNum"> 237</span> <span class="tlaUNC"> 0 : static List<Score> _sortByLowerHandicap(List<Score> tiedScores) {</span></span>
|
|
<span id="L238"><span class="lineNum"> 238</span> <span class="tlaUNC"> 0 : return List.from(tiedScores)..sort((a, b) {</span></span>
|
|
<span id="L239"><span class="lineNum"> 239</span> <span class="tlaUNC"> 0 : int handicapA = a.handicap ?? 0;</span></span>
|
|
<span id="L240"><span class="lineNum"> 240</span> <span class="tlaUNC"> 0 : int handicapB = b.handicap ?? 0;</span></span>
|
|
<span id="L241"><span class="lineNum"> 241</span> <span class="tlaUNC"> 0 : return handicapA.compareTo(handicapB); // 오름차순 (적은 것이 우선)</span></span>
|
|
<span id="L242"><span class="lineNum"> 242</span> : });</span>
|
|
<span id="L243"><span class="lineNum"> 243</span> : }</span>
|
|
<span id="L244"><span class="lineNum"> 244</span> : </span>
|
|
<span id="L245"><span class="lineNum"> 245</span> : /// 점수 격차가 적은 순으로 정렬</span>
|
|
<span id="L246"><span class="lineNum"> 246</span> <span class="tlaUNC"> 0 : static List<Score> _sortByLowerScoreGap(List<Score> tiedScores) {</span></span>
|
|
<span id="L247"><span class="lineNum"> 247</span> <span class="tlaUNC"> 0 : return List.from(tiedScores)..sort((a, b) {</span></span>
|
|
<span id="L248"><span class="lineNum"> 248</span> : // 프레임 점수 중 최고점과 최저점의 차이 계산</span>
|
|
<span id="L249"><span class="lineNum"> 249</span> <span class="tlaUNC"> 0 : int gapA = _calculateScoreGap(a.frames);</span></span>
|
|
<span id="L250"><span class="lineNum"> 250</span> <span class="tlaUNC"> 0 : int gapB = _calculateScoreGap(b.frames);</span></span>
|
|
<span id="L251"><span class="lineNum"> 251</span> <span class="tlaUNC"> 0 : return gapA.compareTo(gapB); // 오름차순 (격차가 적은 것이 우선)</span></span>
|
|
<span id="L252"><span class="lineNum"> 252</span> : });</span>
|
|
<span id="L253"><span class="lineNum"> 253</span> : }</span>
|
|
<span id="L254"><span class="lineNum"> 254</span> : </span>
|
|
<span id="L255"><span class="lineNum"> 255</span> : /// 연장자 우선으로 정렬</span>
|
|
<span id="L256"><span class="lineNum"> 256</span> <span class="tlaUNC"> 0 : static List<Score> _sortByOlderAge(List<Score> tiedScores, List<Member>? members) {</span></span>
|
|
<span id="L257"><span class="lineNum"> 257</span> <span class="tlaUNC"> 0 : if (members == null || members.isEmpty) return tiedScores;</span></span>
|
|
<span id="L258"><span class="lineNum"> 258</span> : </span>
|
|
<span id="L259"><span class="lineNum"> 259</span> <span class="tlaUNC"> 0 : return List.from(tiedScores)..sort((a, b) {</span></span>
|
|
<span id="L260"><span class="lineNum"> 260</span> : // 회원 정보에서 생년월일 찾기</span>
|
|
<span id="L261"><span class="lineNum"> 261</span> <span class="tlaUNC"> 0 : DateTime? birthDateA = _findMemberBirthDate(a.memberId, members);</span></span>
|
|
<span id="L262"><span class="lineNum"> 262</span> <span class="tlaUNC"> 0 : DateTime? birthDateB = _findMemberBirthDate(b.memberId, members);</span></span>
|
|
<span id="L263"><span class="lineNum"> 263</span> : </span>
|
|
<span id="L264"><span class="lineNum"> 264</span> : // 생년월일이 없으면 정렬 불가</span>
|
|
<span id="L265"><span class="lineNum"> 265</span> : if (birthDateA == null || birthDateB == null) return 0;</span>
|
|
<span id="L266"><span class="lineNum"> 266</span> : </span>
|
|
<span id="L267"><span class="lineNum"> 267</span> : // 생년월일 비교 (오래된 날짜 = 연장자가 우선)</span>
|
|
<span id="L268"><span class="lineNum"> 268</span> : // 연장자가 우선이므로 더 오래된 날짜(더 작은 값)가 앞에 와야 함</span>
|
|
<span id="L269"><span class="lineNum"> 269</span> : // 연장자 우선이므로 더 오래된 날짜(A)가 더 최근 날짜(B)보다 앞에 와야 함</span>
|
|
<span id="L270"><span class="lineNum"> 270</span> <span class="tlaUNC"> 0 : return birthDateA.compareTo(birthDateB); // 오름차순 정렬로 연장자 우선</span></span>
|
|
<span id="L271"><span class="lineNum"> 271</span> : });</span>
|
|
<span id="L272"><span class="lineNum"> 272</span> : }</span>
|
|
<span id="L273"><span class="lineNum"> 273</span> : </span>
|
|
<span id="L274"><span class="lineNum"> 274</span> : /// 회원 ID로 생년월일 찾기</span>
|
|
<span id="L275"><span class="lineNum"> 275</span> <span class="tlaGNC"> 1 : static DateTime? _findMemberBirthDate(String? memberId, List<Member> members) {</span></span>
|
|
<span id="L276"><span class="lineNum"> 276</span> : if (memberId == null) return null;</span>
|
|
<span id="L277"><span class="lineNum"> 277</span> : </span>
|
|
<span id="L278"><span class="lineNum"> 278</span> <span class="tlaGNC"> 2 : for (var member in members) {</span></span>
|
|
<span id="L279"><span class="lineNum"> 279</span> <span class="tlaGNC"> 2 : if (member.id == memberId) {</span></span>
|
|
<span id="L280"><span class="lineNum"> 280</span> <span class="tlaGNC"> 1 : return member.birthDate;</span></span>
|
|
<span id="L281"><span class="lineNum"> 281</span> : }</span>
|
|
<span id="L282"><span class="lineNum"> 282</span> : }</span>
|
|
<span id="L283"><span class="lineNum"> 283</span> : return null;</span>
|
|
<span id="L284"><span class="lineNum"> 284</span> : }</span>
|
|
<span id="L285"><span class="lineNum"> 285</span> : </span>
|
|
<span id="L286"><span class="lineNum"> 286</span> : /// 프레임 점수의 최고점과 최저점 차이 계산</span>
|
|
<span id="L287"><span class="lineNum"> 287</span> <span class="tlaUNC"> 0 : static int _calculateScoreGap(List<int> frames) {</span></span>
|
|
<span id="L288"><span class="lineNum"> 288</span> <span class="tlaUNC"> 0 : if (frames.isEmpty) return 0;</span></span>
|
|
<span id="L289"><span class="lineNum"> 289</span> : </span>
|
|
<span id="L290"><span class="lineNum"> 290</span> <span class="tlaUNC"> 0 : int max = frames.reduce((curr, next) => curr > next ? curr : next);</span></span>
|
|
<span id="L291"><span class="lineNum"> 291</span> <span class="tlaUNC"> 0 : int min = frames.reduce((curr, next) => curr < next ? curr : next);</span></span>
|
|
<span id="L292"><span class="lineNum"> 292</span> : </span>
|
|
<span id="L293"><span class="lineNum"> 293</span> <span class="tlaUNC"> 0 : return max - min;</span></span>
|
|
<span id="L294"><span class="lineNum"> 294</span> : }</span>
|
|
<span id="L295"><span class="lineNum"> 295</span> : </span>
|
|
<span id="L296"><span class="lineNum"> 296</span> : /// 모든 점수가 서로 다른지 확인</span>
|
|
<span id="L297"><span class="lineNum"> 297</span> <span class="tlaUNC"> 0 : static bool _allScoresHaveDifferentValues(List<Score> scores, bool includeHandicap) {</span></span>
|
|
<span id="L298"><span class="lineNum"> 298</span> : Set<int> uniqueScores = {};</span>
|
|
<span id="L299"><span class="lineNum"> 299</span> : </span>
|
|
<span id="L300"><span class="lineNum"> 300</span> <span class="tlaUNC"> 0 : for (var score in scores) {</span></span>
|
|
<span id="L301"><span class="lineNum"> 301</span> : int totalScore = includeHandicap </span>
|
|
<span id="L302"><span class="lineNum"> 302</span> <span class="tlaUNC"> 0 : ? (score.totalScore + (score.handicap ?? 0))</span></span>
|
|
<span id="L303"><span class="lineNum"> 303</span> <span class="tlaUNC"> 0 : : score.totalScore;</span></span>
|
|
<span id="L304"><span class="lineNum"> 304</span> : </span>
|
|
<span id="L305"><span class="lineNum"> 305</span> <span class="tlaUNC"> 0 : if (uniqueScores.contains(totalScore)) {</span></span>
|
|
<span id="L306"><span class="lineNum"> 306</span> : return false;</span>
|
|
<span id="L307"><span class="lineNum"> 307</span> : }</span>
|
|
<span id="L308"><span class="lineNum"> 308</span> : </span>
|
|
<span id="L309"><span class="lineNum"> 309</span> <span class="tlaUNC"> 0 : uniqueScores.add(totalScore);</span></span>
|
|
<span id="L310"><span class="lineNum"> 310</span> : }</span>
|
|
<span id="L311"><span class="lineNum"> 311</span> : </span>
|
|
<span id="L312"><span class="lineNum"> 312</span> : return true;</span>
|
|
<span id="L313"><span class="lineNum"> 313</span> : }</span>
|
|
<span id="L314"><span class="lineNum"> 314</span> : </span>
|
|
<span id="L315"><span class="lineNum"> 315</span> : /// 정렬된 동점자 그룹으로 원래 목록 업데이트</span>
|
|
<span id="L316"><span class="lineNum"> 316</span> <span class="tlaGNC"> 2 : static Map<String, int> calculateRanks(</span></span>
|
|
<span id="L317"><span class="lineNum"> 317</span> : List<Score> scores, </span>
|
|
<span id="L318"><span class="lineNum"> 318</span> : bool includeHandicap, {</span>
|
|
<span id="L319"><span class="lineNum"> 319</span> : List<TieBreakerOption>? options,</span>
|
|
<span id="L320"><span class="lineNum"> 320</span> : List<Member>? members</span>
|
|
<span id="L321"><span class="lineNum"> 321</span> : }) {</span>
|
|
<span id="L322"><span class="lineNum"> 322</span> <span class="tlaGNC"> 2 : Map<String, int> ranks = {};</span></span>
|
|
<span id="L323"><span class="lineNum"> 323</span> : </span>
|
|
<span id="L324"><span class="lineNum"> 324</span> : // 점수가 없으면 빈 맵 반환</span>
|
|
<span id="L325"><span class="lineNum"> 325</span> <span class="tlaGNC"> 2 : if (scores.isEmpty) {</span></span>
|
|
<span id="L326"><span class="lineNum"> 326</span> : return ranks;</span>
|
|
<span id="L327"><span class="lineNum"> 327</span> : }</span>
|
|
<span id="L328"><span class="lineNum"> 328</span> : </span>
|
|
<span id="L329"><span class="lineNum"> 329</span> : // 핸디캡 포함 여부에 따른 총점 계산</span>
|
|
<span id="L330"><span class="lineNum"> 330</span> <span class="tlaGNC"> 2 : List<Score> sortedScores = List.from(scores);</span></span>
|
|
<span id="L331"><span class="lineNum"> 331</span> : </span>
|
|
<span id="L332"><span class="lineNum"> 332</span> : // 순위 계산을 위한 총점 그룹 구분</span>
|
|
<span id="L333"><span class="lineNum"> 333</span> <span class="tlaGNC"> 2 : Map<int, List<Score>> totalScoreGroups = {};</span></span>
|
|
<span id="L334"><span class="lineNum"> 334</span> : </span>
|
|
<span id="L335"><span class="lineNum"> 335</span> <span class="tlaGNC"> 4 : for (var score in sortedScores) {</span></span>
|
|
<span id="L336"><span class="lineNum"> 336</span> <span class="tlaGNC"> 8 : int totalScore = includeHandicap ? (score.totalScore + (score.handicap ?? 0)) : score.totalScore;</span></span>
|
|
<span id="L337"><span class="lineNum"> 337</span> : </span>
|
|
<span id="L338"><span class="lineNum"> 338</span> <span class="tlaGNC"> 2 : if (!totalScoreGroups.containsKey(totalScore)) {</span></span>
|
|
<span id="L339"><span class="lineNum"> 339</span> <span class="tlaGNC"> 4 : totalScoreGroups[totalScore] = [];</span></span>
|
|
<span id="L340"><span class="lineNum"> 340</span> : }</span>
|
|
<span id="L341"><span class="lineNum"> 341</span> : </span>
|
|
<span id="L342"><span class="lineNum"> 342</span> <span class="tlaGNC"> 4 : totalScoreGroups[totalScore]!.add(score);</span></span>
|
|
<span id="L343"><span class="lineNum"> 343</span> : }</span>
|
|
<span id="L344"><span class="lineNum"> 344</span> : </span>
|
|
<span id="L345"><span class="lineNum"> 345</span> : // 총점 내림차순 정렬</span>
|
|
<span id="L346"><span class="lineNum"> 346</span> <span class="tlaGNC"> 4 : List<int> sortedTotalScores = totalScoreGroups.keys.toList();</span></span>
|
|
<span id="L347"><span class="lineNum"> 347</span> <span class="tlaGNC"> 6 : sortedTotalScores.sort((a, b) => b.compareTo(a));</span></span>
|
|
<span id="L348"><span class="lineNum"> 348</span> : </span>
|
|
<span id="L349"><span class="lineNum"> 349</span> : int currentRank = 1;</span>
|
|
<span id="L350"><span class="lineNum"> 350</span> : </span>
|
|
<span id="L351"><span class="lineNum"> 351</span> : // 총점별 그룹 순회</span>
|
|
<span id="L352"><span class="lineNum"> 352</span> <span class="tlaGNC"> 4 : for (int totalScore in sortedTotalScores) {</span></span>
|
|
<span id="L353"><span class="lineNum"> 353</span> <span class="tlaGNC"> 2 : List<Score> totalScoreGroup = totalScoreGroups[totalScore]!;</span></span>
|
|
<span id="L354"><span class="lineNum"> 354</span> : </span>
|
|
<span id="L355"><span class="lineNum"> 355</span> : // 그룹 내 점수가 1개라면 현재 순위 부여</span>
|
|
<span id="L356"><span class="lineNum"> 356</span> <span class="tlaGNC"> 4 : if (totalScoreGroup.length == 1) {</span></span>
|
|
<span id="L357"><span class="lineNum"> 357</span> <span class="tlaGNC"> 6 : ranks[totalScoreGroup[0].id] = currentRank;</span></span>
|
|
<span id="L358"><span class="lineNum"> 358</span> <span class="tlaGNC"> 2 : currentRank++;</span></span>
|
|
<span id="L359"><span class="lineNum"> 359</span> : continue;</span>
|
|
<span id="L360"><span class="lineNum"> 360</span> : }</span>
|
|
<span id="L361"><span class="lineNum"> 361</span> : </span>
|
|
<span id="L362"><span class="lineNum"> 362</span> : // 옵션이 없으면 모두 동일 순위 부여</span>
|
|
<span id="L363"><span class="lineNum"> 363</span> <span class="tlaGNC"> 1 : if (options == null || options.isEmpty) {</span></span>
|
|
<span id="L364"><span class="lineNum"> 364</span> <span class="tlaGNC"> 4 : for (var score in totalScoreGroup) {</span></span>
|
|
<span id="L365"><span class="lineNum"> 365</span> <span class="tlaGNC"> 4 : ranks[score.id] = currentRank;</span></span>
|
|
<span id="L366"><span class="lineNum"> 366</span> : }</span>
|
|
<span id="L367"><span class="lineNum"> 367</span> : </span>
|
|
<span id="L368"><span class="lineNum"> 368</span> : // 다음 순위는 현재 그룹의 크기만큼 증가</span>
|
|
<span id="L369"><span class="lineNum"> 369</span> <span class="tlaGNC"> 4 : currentRank += totalScoreGroup.length;</span></span>
|
|
<span id="L370"><span class="lineNum"> 370</span> : } else {</span>
|
|
<span id="L371"><span class="lineNum"> 371</span> : // 순위 부여 규칙:</span>
|
|
<span id="L372"><span class="lineNum"> 372</span> : // - olderAge가 포함된 경우: 동점 그룹 내에서 현재 리스트 순서대로 개별 순위를 부여</span>
|
|
<span id="L373"><span class="lineNum"> 373</span> : // - 그 외(옵션 없음/olderAge 제외 옵션): 동점 그룹 전체에 동일 순위를 부여</span>
|
|
<span id="L374"><span class="lineNum"> 374</span> <span class="tlaGNC"> 1 : if (options.contains(TieBreakerOption.olderAge)) {</span></span>
|
|
<span id="L375"><span class="lineNum"> 375</span> : // olderAge가 포함된 경우의 기본: 순서대로 개별 순위 부여</span>
|
|
<span id="L376"><span class="lineNum"> 376</span> : // 단, 옵션 순서가 lowerScoreGap -> lowerHandicap -> olderAge인 경우에는</span>
|
|
<span id="L377"><span class="lineNum"> 377</span> : // 동일 핸디캡을 가진 연속 항목들은 동일 순위를 부여하고, 핸디캡이 바뀔 때만 순위를 증가시킨다.</span>
|
|
<span id="L378"><span class="lineNum"> 378</span> <span class="tlaGNC"> 1 : final idxGap = options.indexOf(TieBreakerOption.lowerScoreGap);</span></span>
|
|
<span id="L379"><span class="lineNum"> 379</span> <span class="tlaGNC"> 1 : final idxHcp = options.indexOf(TieBreakerOption.lowerHandicap);</span></span>
|
|
<span id="L380"><span class="lineNum"> 380</span> <span class="tlaGNC"> 1 : final idxAge = options.indexOf(TieBreakerOption.olderAge);</span></span>
|
|
<span id="L381"><span class="lineNum"> 381</span> : final isGapThenHcpThenAge =</span>
|
|
<span id="L382"><span class="lineNum"> 382</span> <span class="tlaGNC"> 8 : idxGap != -1 && idxHcp != -1 && idxAge != -1 && idxGap < idxHcp && idxHcp < idxAge;</span></span>
|
|
<span id="L383"><span class="lineNum"> 383</span> : </span>
|
|
<span id="L384"><span class="lineNum"> 384</span> : if (isGapThenHcpThenAge) {</span>
|
|
<span id="L385"><span class="lineNum"> 385</span> : int? lastHandicap;</span>
|
|
<span id="L386"><span class="lineNum"> 386</span> : int currentRankLocal = currentRank;</span>
|
|
<span id="L387"><span class="lineNum"> 387</span> : int blockSize = 0;</span>
|
|
<span id="L388"><span class="lineNum"> 388</span> <span class="tlaGNC"> 3 : for (var i = 0; i < totalScoreGroup.length; i++) {</span></span>
|
|
<span id="L389"><span class="lineNum"> 389</span> <span class="tlaGNC"> 1 : final score = totalScoreGroup[i];</span></span>
|
|
<span id="L390"><span class="lineNum"> 390</span> <span class="tlaGNC"> 1 : final hcp = score.handicap ?? 0;</span></span>
|
|
<span id="L391"><span class="lineNum"> 391</span> : if (lastHandicap == null) {</span>
|
|
<span id="L392"><span class="lineNum"> 392</span> : // 첫 항목은 현재 랭크 부여</span>
|
|
<span id="L393"><span class="lineNum"> 393</span> : lastHandicap = hcp;</span>
|
|
<span id="L394"><span class="lineNum"> 394</span> : blockSize = 1;</span>
|
|
<span id="L395"><span class="lineNum"> 395</span> <span class="tlaGNC"> 2 : ranks[score.id] = currentRankLocal;</span></span>
|
|
<span id="L396"><span class="lineNum"> 396</span> <span class="tlaGNC"> 1 : } else if (hcp == lastHandicap) {</span></span>
|
|
<span id="L397"><span class="lineNum"> 397</span> : // 같은 핸디캡: 동일 랭크 부여</span>
|
|
<span id="L398"><span class="lineNum"> 398</span> <span class="tlaGNC"> 1 : blockSize += 1;</span></span>
|
|
<span id="L399"><span class="lineNum"> 399</span> <span class="tlaGNC"> 2 : ranks[score.id] = currentRankLocal;</span></span>
|
|
<span id="L400"><span class="lineNum"> 400</span> : } else {</span>
|
|
<span id="L401"><span class="lineNum"> 401</span> : // 다른 핸디캡: 블록 크기만큼 랭크를 증가시키고 새 블록 시작</span>
|
|
<span id="L402"><span class="lineNum"> 402</span> <span class="tlaGNC"> 1 : currentRankLocal += blockSize;</span></span>
|
|
<span id="L403"><span class="lineNum"> 403</span> : lastHandicap = hcp;</span>
|
|
<span id="L404"><span class="lineNum"> 404</span> : blockSize = 1;</span>
|
|
<span id="L405"><span class="lineNum"> 405</span> <span class="tlaGNC"> 2 : ranks[score.id] = currentRankLocal;</span></span>
|
|
<span id="L406"><span class="lineNum"> 406</span> : }</span>
|
|
<span id="L407"><span class="lineNum"> 407</span> : }</span>
|
|
<span id="L408"><span class="lineNum"> 408</span> <span class="tlaGNC"> 2 : currentRank += totalScoreGroup.length;</span></span>
|
|
<span id="L409"><span class="lineNum"> 409</span> : } else {</span>
|
|
<span id="L410"><span class="lineNum"> 410</span> <span class="tlaGNC"> 3 : for (var i = 0; i < totalScoreGroup.length; i++) {</span></span>
|
|
<span id="L411"><span class="lineNum"> 411</span> <span class="tlaGNC"> 4 : ranks[totalScoreGroup[i].id] = currentRank + i;</span></span>
|
|
<span id="L412"><span class="lineNum"> 412</span> : }</span>
|
|
<span id="L413"><span class="lineNum"> 413</span> <span class="tlaGNC"> 2 : currentRank += totalScoreGroup.length;</span></span>
|
|
<span id="L414"><span class="lineNum"> 414</span> : }</span>
|
|
<span id="L415"><span class="lineNum"> 415</span> : } else {</span>
|
|
<span id="L416"><span class="lineNum"> 416</span> <span class="tlaGNC"> 2 : for (var score in totalScoreGroup) {</span></span>
|
|
<span id="L417"><span class="lineNum"> 417</span> <span class="tlaGNC"> 2 : ranks[score.id] = currentRank;</span></span>
|
|
<span id="L418"><span class="lineNum"> 418</span> : }</span>
|
|
<span id="L419"><span class="lineNum"> 419</span> <span class="tlaGNC"> 2 : currentRank += totalScoreGroup.length;</span></span>
|
|
<span id="L420"><span class="lineNum"> 420</span> : }</span>
|
|
<span id="L421"><span class="lineNum"> 421</span> : }</span>
|
|
<span id="L422"><span class="lineNum"> 422</span> : }</span>
|
|
<span id="L423"><span class="lineNum"> 423</span> : </span>
|
|
<span id="L424"><span class="lineNum"> 424</span> : return ranks;</span>
|
|
<span id="L425"><span class="lineNum"> 425</span> : }</span>
|
|
<span id="L426"><span class="lineNum"> 426</span> : </span>
|
|
<span id="L427"><span class="lineNum"> 427</span> : }</span>
|
|
</pre>
|
|
</td>
|
|
</tr>
|
|
</table>
|
|
<br>
|
|
|
|
<table width="100%" border=0 cellspacing=0 cellpadding=0>
|
|
<tr><td class="ruler"><img src="../../glass.png" width=3 height=3 alt=""></td></tr>
|
|
<tr><td class="versionInfo">Generated by: <a href="https://github.com//linux-test-project/lcov" target="_parent">LCOV version 2.3.1-1</a></td></tr>
|
|
</table>
|
|
<br>
|
|
|
|
</body>
|
|
</html>
|