2d:null 2e:["$","title",null,{"children":"Relative Placement | Brian J. Cardiff | Observable"}] 33:T48a,viewof votes = { const element = html`

` element.value = { data: repeat(params.competitors, i => ({name: `Comp ${i+1}`, votes: []})), judges: repeat(params.judges, i => `Jurado ${i+1}`) } var table = new Tabulator(element, { // height:205, // set height of table (in CSS or here), this enables the Virtual DOM and improves render speed dramatically (can be any valid css height value) data: element.value.data, //assign data to table layout:"fitColumns", //fit columns to width of table (optional) columns:[ //Define Table Columns {title:"Nombre", field:"name", editor: "input"}, ...repeat(params.judges, i => ({title:element.value.judges[i], field:`votes.${i}`, editor:"number", editableTitle:true})) ], dataEdited:function(data){ element.value.data = data element.dispatchEvent(new CustomEvent("input")) }, columnTitleChanged:function(column){ const {field, title} = column.getDefinition() const index = parseInt(field.replace("votes.", "")) element.value.judges[index] = title element.dispatchEvent(new CustomEvent("input")) }, }) return element }34:T586,{ // result.contest.candidateList const candidateList = result.contest.candidateList const majority = Math.floor(params.competitors / 2) + 1; const header = ["Pos", "Comp", ...votes.judges, " ", ...repeat(params.competitors, n => ` 1 - ${n+1} `)] const separator = header.map(() => "---") let data = repeat(params.competitors, (c) => { const compName = result.order[c] const candidate = candidateList[compName] return [ c+1, compName.replace(" ", " "), ...repeat(params.judges, (j) => votes.data.find(d => d.name == compName).votes[j]), "", ...repeat(params.competitors, (i) => { const hasMajority = candidate.placements[i] >= majority ? "**" : "" return candidate.placements[i] > 0 ? `${hasMajority}${candidate.placements[i]} (${candidate.cumulativePlacement[i]})${hasMajority}` : "-" }) // {placements: candidate.placements, // cumulativePlacement: candidate.cumulativePlacement} ]}) return md`${[header, separator, ...data].map(row => row.join(" | ")).join("\n")}` }35:[] 31:{"id":"32d9344af842180a","slug":"relative-placement","title":"Relative Placement","thumbnail":"6012f520c11e079820f3cade7cb2a2e140ae49d7bc0eee78c9b28f6e6b5d10e6","access_level":"public","create_time":"$D2019-11-02T21:27:02.991Z","update_time":"$D2022-11-03T22:54:55.813Z","view_time":null,"first_public_time":"$D2019-11-03T20:14:04.620Z","has_unpublished_edits":null,"fork":false,"stars":0,"starred":false,"owner":{"type":"team","id":"e21daad72cefad47","login":"bcardiff","name":"Brian J. Cardiff","avatar_url":"https://avatars-next.observableusercontent.com/0abf5b5392695f4aaaf5d28cc4b279e7824e11bc88a7b1368809350db927c833","tier":"starter_2024"},"version":209,"publish_version":209,"role":null,"authored":false,"authors":[{"type":"individual","id":"9bdeca5f4bd953fa","login":"bcardiff","name":"Brian J. Cardiff","avatar_url":"https://avatars-next.observableusercontent.com/0abf5b5392695f4aaaf5d28cc4b279e7824e11bc88a7b1368809350db927c833","tier":null}],"members":[{"type":"individual","id":"9bdeca5f4bd953fa","login":"bcardiff","name":"Brian J. Cardiff","avatar_url":"https://avatars-next.observableusercontent.com/0abf5b5392695f4aaaf5d28cc4b279e7824e11bc88a7b1368809350db927c833","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":5,"collection":null,"type":"notebook","body":{"title":"Relative Placement","cells":[{"id":0,"value":"md`# Relative Placement`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":154,"value":"md`Relative placement is a placement system where electors (judges) provide there own placement of each candidates.\n\nThe algorithm consist to search for each place a majority of votes for a candidate at this placement or a greater placement. [Read more](https://shuffleprojects.com/2011/swing-dance-competition-relative-placement-scoring-system/).\n\nThe implementations is based on [dancerankcalc.com](http://dancerankcalc.com/) and uses [an open source implementation of the Relative Placement algorithm](https://www.npmjs.com/package/relative-placement-js), available under the MIT license.`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":200,"value":"viewof title = text({title: 'Title', value: 'Strictly Lindy'})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":15,"value":"viewof params = columns({judges: number({title: 'Judges', value: 3}), competitors: number({title: 'Competitors', value: 5})})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":27,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":171,"value":"md`## ${title}`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":109,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":150,"value":"html`

Ignoreme

`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":85,"value":"result = {\n const competitorNames = votes.data.map(d => d.name)\n const votesUsingNames = repeat(params.judges, j => \n votes.data\n .map(d => ({name: d.name, pos: d.votes[j]}))\n .sort((a, b) => a.pos - b.pos)\n .map(a => a.name)\n )\n \n const contest = new RelativePlacement()\n contest.addCandidates(competitorNames)\n contest.addVotes(votesUsingNames)\n const order = contest.getResult()\n \n return {order: order, contest: contest} // candidateList: contest.candidateList, v: votesUsingNames}\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":63,"value":"repeat = (n, fn) => {\n let res = []\n for(let i = 0; i < n; i++) {\n res.push(fn(i))\n }\n return res\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"import {columns} from \"@bcardiff/observable-columns\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":16,"value":"import {number, text} from \"@jashkenas/inputs\"","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"RelativePlacement = require('relative-placement-js@1.0.1/dist/relative-placement.js').catch(() => window[\"RelativePlacement\"])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"Tabulator = require('tabulator-tables')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":30,"value":"html``","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W35","stdlib":"1","titling":"auto"}} 32:"$31:body"