Mercurial > wow > breuesk

annotate Lists.lua @ 34:0e03db65c1fe

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
listBase -> lists for symmetry project-revision turned into a string so you can dev on repo
author John@Yosemite-PC
date Sun, 11 Mar 2012 23:27:02 -0400
parents d27c28e5f964
children ecd37523ae04
rev   line source
John@0 1 -- lists consist of three things
John@0 2 -- 1) a base state - agreed on by one or more list holders
John@0 3 -- 2) change sets - incremental list changes (can be rolled forwards or
John@0 4 -- backwards)
John@0 5 -- 3) working state - not saved because it can be so easily calculated
John@0 6 --
John@0 7 -- A separate user list is held - lists index into this
John@0 8
John@0 9
John@27 10 -- TODO: switch all action functions to use identifiers rather than names
John@27 11 -- TODO: collaborative list trimming
John@24 12 -- TODO: collapse slists into delimited strings for space (premature optimization?)
John@18 13 -- TODO: organize working state data a little more carefully - hard to keep
John@18 14 -- track of all the arrays that are floating out there
John@18 15
John@17 16 -- holy crap long notes {{{
John@4 17 -- notes on list storage:
John@7 18 -- Using names as keys as I do now is atrocious.
John@4 19 -- It prevents insertions (twss) to the middle of the list because then it acts
John@4 20 -- as a side effect onto all the others. ie ABCD -> AXBCD would be phrased as
John@4 21 -- "insert X and shift down B,C,D" which sucks. BCD haven't really been affected
John@4 22 -- (yet) because their relative positions to the others are still intact - ie
John@4 23 -- they are still below A right where they belong. But really X hasn't done
John@4 24 -- anything to affect their relative standing.
John@4 25 --
John@4 26 -- Ok so we can't use names.
John@4 27 --
John@4 28 -- We can't use monotonic integers either because it suffers the same problem.
John@4 29 -- Also consider, randoming in someone to a list of ABCD. Say they roll spot 2.
John@4 30 -- What if someone else runs a separate raid and also randoms someone into slot
John@4 31 -- 2? How do you handle that conflict? Difficult. Also, consider this:
John@4 32 -- List of ABCD on night 1.
John@4 33 -- Admin 1 on night 2 rolls in 30 new people. ABCD's indexes are shuffled to be
John@4 34 -- between 1-35.
John@4 35 -- Admin 2 on night 3 rolls in 5 new ones and people ABCD and PQRST now all have
John@4 36 -- indexes between 1-9.
John@4 37 -- When these two are resolved against one another, do the 1-9 peopole end up on
John@4 38 -- top of the list compared to those other 30?
John@4 39 --
John@4 40 -- Solution:
John@4 41 -- Need a huge random space with purposely left gaps to leave plenty of room for
John@4 42 -- conflicts.
John@4 43 -- So if ABCD had randomed on a space of say, 10,000 and then were sorted into
John@4 44 -- order, then the next 30 could roll into that same space and have a proper
John@4 45 -- ordering. Then the next 5, etc.
John@4 46 --
John@4 47 -- Handling conflicts:
John@4 48 --
John@9 49 -- Executive decision: random on a range of [0,1], ie math.random
John@9 50 -- then on an add-to-end event just do last + .1
John@9 51 -- disallow random after any add-to-end event occurs
John@9 52 -- because the list either elongates beyond 1 OR becomes
John@9 53 -- ridiculously bottom heavy, thus meaning that randoms
John@9 54 -- don't get an even distibution from then on (in fact
John@9 55 -- they'll end up getting top favor)
John@9 56 -- * if a stream contains a random-add after an add-to-end
John@9 57 -- it is declared invalid. tough tits. it's just not a fair
John@9 58 -- distribution at that point.
John@10 59 -- * actually, fuck it. I'll give them an unlock command and
John@10 60 -- let them screw over their lists :)
John@17 61 --}}}
John@18 62
John@17 63 -- there are some dep chains here. for instance, to have a raidIdP value, a
John@17 64 -- person must have a bsk.persons value which leads to a personName2id which
John@17 65 -- leads to a raidIdP
John@0 66
John@0 67 bsk.lists = {}
John@8 68 bsk.persons = {}
John@0 69
John@16 70 local raidNameP = {} -- "name" is present in raid
John@16 71 local raidIdP = {} -- "id" is present in raid
John@16 72 local reserveIdP = {} -- "reserve id present"
John@8 73 local activeListKey = 1 -- temporary
John@16 74 local personName2id = {} -- given "name" get that person's id
John@0 75
John@0 76 local tinsert = table.insert
John@0 77 local sformat = string.format
John@0 78 local getn = table.getn
John@0 79
John@17 80 function bsk:SelfDestruct()
John@17 81 bsk.lists = {}
John@17 82 bsk.persons = {}
John@17 83 bsk.db.profile.persons = {}
John@17 84 bsk.db.profile.changes = {}
John@34 85 bsk.db.profile.lists = {}
John@17 86 raidNameP = {}
John@17 87 raidIdP = {}
John@17 88 reserveIdP = {}
John@17 89 personName2id = {}
John@17 90 end
John@0 91 function bsk:tcopy(to, from)
John@0 92 for k,v in pairs(from) do
John@0 93 if(type(v)=="table") then
John@0 94 to[k] = {}
John@0 95 bsk:tcopy(to[k], v);
John@0 96 else
John@0 97 to[k] = v;
John@0 98 end
John@0 99 end
John@0 100 end
John@0 101 local shallowCopy = function(t)
John@0 102 local u = { }
John@0 103 for k, v in pairs(t) do u[k] = v end
John@0 104 return setmetatable(u, getmetatable(t))
John@0 105 end
John@0 106
John@1 107 -- Debugging {{{
John@9 108 function bsk:PrettyPrintList(listIndex)
John@9 109 local list = bsk.lists[listIndex]
John@19 110 bsk:Print("List: " .. list.name .. " (" .. listIndex .. ") - last modified " .. date("%m/%d/%y %H:%M:%S", list.time) .. " (",list.time,")" )
John@9 111 for i = 1,#list do
John@12 112 bsk:Print(" " .. i .. " - " .. bsk.persons[list[i].id].main)
John@9 113 end
John@9 114 end
John@9 115 function bsk:PrettyPrintLists()
John@9 116 for i,_ in pairs(bsk.lists) do
John@9 117 bsk:PrettyPrintList(i)
John@9 118 end
John@9 119 end
John@1 120 function bsk:PrintLists()
John@1 121 bsk:PrintTable(bsk.lists)
John@1 122 end
John@1 123 function bsk:PrintChanges()
John@1 124 bsk:PrintTable(bsk.db.profile.changes)
John@1 125 end
John@8 126 function bsk:PrintPersons()
John@8 127 bsk:PrintTable(bsk.persons)
John@1 128 end
John@0 129 function bsk:PrintTable(table, depth)
John@0 130 depth = depth or ""
John@0 131 if not table then return end
John@0 132 for i,v in pairs(table) do
John@0 133 if( type(v) == "string" ) then
John@0 134 self:Print(depth .. i .. " - " .. v)
John@0 135 elseif( type(v) == "number" ) then
John@0 136 self:Print(depth .. i .. " - " .. tostring(v))
John@0 137 elseif( type(v) == "table" ) then
John@0 138 self:Print(depth .. i .." - ")
John@0 139 self:PrintTable(v,depth.." ")
John@0 140 elseif( type(v) == "boolean" ) then
John@0 141 self:Print(depth .. i .. " - " .. tostring(v))
John@0 142 else
John@0 143 self:Print(depth .. i .. " - not sure how to print type: " .. type(v) )
John@0 144 end
John@0 145 end
John@0 146 end
John@0 147
John@17 148 function bsk:PrintRaidAndReserve()
John@17 149 bsk:Print("RaidNameP")
John@17 150 bsk:PrintTable(raidNameP)
John@17 151 bsk:Print("RaidIdP")
John@17 152 bsk:PrintTable(raidIdP)
John@17 153 bsk:Print("ReserveP")
John@17 154 bsk:PrintTable(reserveIdP)
John@17 155 bsk:Print("personName2id")
John@17 156 bsk:PrintTable(personName2id)
John@17 157 end
John@0 158 --}}}
John@0 159
John@9 160 function bsk:UpdatePersonsReverse()
John@9 161 for i,v in pairs(bsk.persons) do
John@9 162 if i ~= "time" then
John@16 163 personName2id[v.main] = i
John@9 164 end
John@9 165 end
John@9 166 end
John@9 167
John@16 168 -- Change processing {{{
John@5 169 function bsk:CreateWorkingStateFromChanges(changes)
John@8 170 local personsBase = self.db.profile.persons
John@34 171 local lists = self.db.profile.lists
John@0 172
John@0 173 -- copy the base to the working state
John@0 174 wipe(bsk.lists)
John@8 175 wipe(bsk.persons)
John@16 176 wipe(personName2id)
John@8 177
John@34 178 bsk:tcopy(bsk.lists,lists)
John@8 179 bsk:tcopy(bsk.persons,personsBase)
John@0 180
John@0 181 -- now just go through the changes list applying each
John@5 182 for i,v in ipairs(changes) do
John@0 183 bsk:ProcessChange(v)
John@0 184 end
John@9 185
John@9 186 -- update the persons reverse list
John@9 187 bsk:UpdatePersonsReverse()
John@0 188 end
John@0 189
John@0 190 function bsk:CreateChange(change)
John@0 191 -- sanity
John@0 192 assert(change)
John@0 193 assert(change.action)
John@0 194 assert(change.arg)
John@0 195
John@0 196 bsk:StartChange(change)
John@0 197 bsk:CommitChange(change)
John@0 198 end
John@0 199
John@0 200 function bsk:StartChange(change)
John@0 201 local changes = self.db.profile.changes
John@0 202 change.time = time()
John@0 203 local n = getn(changes)
John@0 204 if n > 0 then
John@0 205 if changes[n].time >= change.time then
John@0 206 change.time = changes[n].time + 1
John@0 207 end
John@0 208 end
John@0 209 end
John@0 210
John@0 211 function bsk:CommitChange(change)
John@0 212 local changes = self.db.profile.changes
John@0 213 tinsert(changes,change)
John@0 214 -- TODO: broadcast change
John@0 215 end
John@0 216
John@16 217 function bsk:ProcessChange(change)
John@16 218 if change.action == "AddPerson" then
John@16 219 bsk:DoAddPerson(change)
John@20 220 elseif change.action == "RenameList" then
John@20 221 bsk:DoRenameList(change)
John@16 222 elseif change.action == "CreateList" then
John@16 223 bsk:DoCreateList(change)
John@21 224 elseif change.action == "DeleteList" then
John@21 225 bsk:DoDeleteList(change)
John@16 226 elseif change.action == "AddToListEnd" then
John@16 227 bsk:DoAddPersonToListEnd(change)
John@16 228 elseif change.action == "AddToListRand" then
John@16 229 bsk:DoAddPersonToListRandom(change)
John@27 230 elseif change.action == "RemovePerson" then
John@27 231 bsk:DoRemovePerson(change)
John@22 232 elseif change.action == "RemovePersonFromList" then
John@22 233 bsk:DoRemovePersonFromList(change)
John@16 234 elseif change.action == "SuicidePerson" then
John@16 235 bsk:DoSuicidePerson(change)
John@16 236 else
John@16 237 bsk:Print("Unknown message encountered")
John@16 238 bsk:PrintTable(change)
John@16 239 assert(false)
John@16 240 end
John@16 241 end
John@16 242
John@16 243 --}}}
John@27 244 -- holy crap long winded {{{
John@0 245 -- timestamp logic:
John@0 246 -- use time() for comparisons - local clients use date() to make it pretty. only
John@0 247 -- dowisde - we can't have a server timestamp. Which kind of sucks, but it turns
John@0 248 -- out you can change timezones when you enter an instance server, so you really
John@0 249 -- never know what time it is.
John@0 250 -- There's unfortunately no hard-and-proven method for determining the true time
John@0 251 -- difference between local time and server time. You can't just query the two
John@0 252 -- and compare them because your server timezone can change (!) if you go into
John@0 253 -- an instance server with a different timezone. This is apparently a big
John@0 254 -- problem on Oceanic realms.
John@0 255 --
John@0 256 -- Timestamp handling (brainstorming how to deal with drift):
John@0 257 -- (not an issue) if someone sends you time in the future, update your offset so you won't
John@0 258 -- send out events in the "past" to that person
John@0 259 -- (not an issue - using local UTC now) on change-zone-event: check if you've changed timezones - might need update
John@0 260 -- each time you add a change, check the tail of the change list; if this is
John@0 261 -- less than that, you have a problem. Print a message. if this is equal, then
John@0 262 -- that's ok, just bump it by 1 second. This could happen in the case of, say,
John@0 263 -- spam-clicking the undo button or adding names to the list. The recipients
John@0 264 -- should be ok with this since they'll follow the same algorithm. The only
John@0 265 -- real chance for a problem is if two people click within the 1 second window?
John@0 266 -- if someone sends you a past event,
John@0 267 -- it's ok if it's newer than anything in the changes list
John@0 268 -- otherwise ... causality has been violated.
John@0 269 -- Whenever an admin signon event happens, have the admins each perform a
John@0 270 -- timestamp check. Issue warnings for anyone with a clock that's more than
John@0 271 -- X seconds out of sync with the others. Seriously, why isn't NTP a standard
John@0 272 -- setting on all operating systems ...
John@27 273 --}}}
John@0 274
John@1 275 -- Action and DoAction defs {{{
John@27 276 -- Action Discussion {{{
John@0 277 -- The actual actions for changes start here
John@0 278 --
John@0 279 -- Each action occurs as a pair of functions. The bsk:Action() function is from
John@0 280 -- a list admin's point of view. Each will check for admin status, then create a
John@0 281 -- change bundle, call the handler for that change (ie the DoAction func), and
John@0 282 -- then record/transmist the bundle. These are simple and repetitive functions.
John@0 283 --
John@0 284 -- The bsk:DoAction() function is tasked with executing the bundle and is what
John@0 285 -- non-admins and admins alike will call to transform their working state via a
John@0 286 -- change packet. Each Do() function will accept *only* a change packet, and
John@0 287 -- it's assumed that the change has been vetted elsewhere. These are very blunt
John@0 288 -- routines.
John@0 289 --
John@0 290 -- Note that "undo" has no special voodoo to it. It's basically a change that
John@27 291 -- reverses the prior change on the stack.--}}}
John@26 292 function bsk:DoAddPerson(change)--{{{
John@0 293 assert(change)
John@8 294 assert(change.arg.id)
John@0 295 local arg = change.arg
John@0 296 -- require admin
John@8 297 local persons = bsk.persons
John@0 298 local name = arg.name
John@8 299 local id = arg.id
John@8 300 assert(persons[id]==nil)
John@8 301 persons[id] = {main=name}
John@8 302 persons.time=change.time
John@16 303 personName2id[name] = id
John@0 304 return true
John@26 305 end--}}}
John@26 306 function bsk:AddPerson(name)--{{{
John@8 307 local persons = bsk.persons
John@0 308 local guid = UnitGUID(name)
John@0 309 -- TODO: check guid to be sure it's a player
John@0 310 if not guid then
John@0 311 self:Print(sformat("Could not add player %s - they must be in range or group",name))
John@0 312 return
John@0 313 end
John@8 314 local id = string.sub(guid,6) -- skip at least 0x0580 ...
John@8 315 id = id:gsub("^0*(.*)","%1") -- nom all leading zeroes remaining
John@8 316
John@8 317 if persons[id] and persons[id] ~= name then
John@17 318 self:Print(sformat("Namechange detected for %s - new is %s, please rename the existing entry", persons[id].main, name))
John@0 319 return
John@0 320 end
John@8 321 if persons[id] ~= nil then
John@8 322 self:Print(sformat("%s is already in the persons list; disregarding", name))
John@0 323 return
John@0 324 end
John@8 325 local change = {action="AddPerson",arg={name=name,id=id}}
John@8 326 if bsk:DoAddPerson(change) then
John@0 327 bsk:CreateChange(change)
John@0 328 end
John@26 329 end--}}}
John@26 330 function bsk:DoCreateList(change)--{{{
John@18 331 --if bsk:GetListIndex(change.arg.name) then
John@18 332 -- self:Print(sformat("List %s already exists",v.name))
John@18 333 -- return false
John@18 334 --end
John@19 335 bsk.lists[change.arg.id]={name=change.arg.name,time=change.time}
John@0 336 return true
John@26 337 end--}}}
John@26 338 function bsk:CreateList(name)--{{{
John@0 339 -- require admin
John@0 340 local change={action="CreateList",arg={name=name}}
John@0 341 bsk:StartChange(change)
John@18 342 change.arg.id=change.time -- use the creation timestamp as the list's index. it's as unique as anything...
John@0 343 self:Print("Creating ... " .. name)
John@0 344 if bsk:DoCreateList(change) then
John@0 345 bsk:CommitChange(change)
John@0 346 end
John@26 347 end--}}}
John@26 348 function bsk:DoAddPersonToListEnd(change)--{{{
John@10 349 local list = bsk.lists[change.arg.listIndex]
John@22 350 local index
John@22 351 if getn(list) > 0 then
John@22 352 index = list[#list].index + 0.1
John@22 353 else
John@22 354 index = 0.1
John@22 355 end
John@10 356 local entry = {index=index, id=change.arg.id}
John@0 357
John@10 358 tinsert(list,entry)
John@10 359 list.time = change.time
John@10 360 list.closedRandom = true
John@10 361
John@0 362 return true
John@26 363 end--}}}
John@26 364 function bsk:AddPersonToListEnd(name,listName)--{{{
John@0 365 -- require admin
John@16 366 local listIndex = bsk:GetListIndex(listName)
John@16 367 local id = personName2id[name]
John@13 368 if bsk:IdIsInList(id,bsk.lists[listIndex]) then
John@13 369 bsk:Print(sformat("Person %s is already on the reqeuested list",name))
John@17 370 return false
John@13 371 end
John@16 372 bsk:Print(sformat("Adding %s (%s) to list %s (%s)", name, id, listName, listIndex))
John@10 373 local change = {action="AddToListEnd",arg={id=id,listIndex=listIndex}}
John@0 374 bsk:StartChange(change)
John@10 375 if bsk:DoAddPersonToListEnd(change) then
John@10 376 bsk:CommitChange(change)
John@10 377 end
John@26 378 end--}}}
John@26 379 function bsk:DoAddPersonToListRandom(change)--{{{
John@10 380 local list = bsk.lists[change.arg.listIndex]
John@10 381 local entry = {index=change.arg.roll, id=change.arg.id}
John@10 382
John@10 383 tinsert(list,entry)
John@12 384 table.sort(list,function(a,b) return a.index < b.index end)
John@10 385 list.time = change.time
John@10 386
John@10 387 return true
John@26 388 end--}}}
John@26 389 function bsk:AddPersonToListRandom(name,listName)--{{{
John@10 390 -- require admin
John@16 391 local listIndex = bsk:GetListIndex(listName)
John@10 392 if bsk.lists[listIndex].closedRandom then
John@10 393 self:Print("Cannot add person to list by random roll because an add-to-end operation has already occurred")
John@12 394 return false
John@10 395 end
John@17 396 local id = personName2id[name]
John@13 397 if bsk:IdIsInList(id,bsk.lists[listIndex]) then
John@13 398 bsk:Print(sformat("Person %s is already on the reqeuested list",name))
John@17 399 return false
John@13 400 end
John@10 401 local roll = math.random()
John@16 402 bsk:Print(sformat("Adding %s (%s) to list %s (%s) with roll (%f)", name, id, listName, listIndex, roll))
John@10 403 local change = {action="AddToListRand",arg={id=id,listIndex=listIndex,roll=roll}}
John@10 404 bsk:StartChange(change)
John@10 405 if bsk:DoAddPersonToListRandom(change) then
John@0 406 bsk:CommitChange(change)
John@0 407 end
John@26 408 end--}}}
John@26 409 function bsk:DoRemovePerson(change)--{{{
John@27 410 local person = bsk.persons[change.arg.id]
John@27 411 personName2id[person.main] = nil
John@27 412 bsk.persons[change.arg.id] = nil
John@27 413 bsk.persons.time = change.time
John@27 414 return true
John@26 415 end--}}}
John@26 416 function bsk:RemovePerson(name)--{{{
John@27 417 local id = personName2id[name]
John@27 418 if not id then
John@27 419 bsk:Print(sformat("%s is not in the persons list, please check your spelling", name))
John@27 420 return false
John@27 421 end
John@28 422 local listsTheyreOn = {}
John@28 423 -- check if they're active on any loot list
John@28 424 for i,v in pairs(bsk.lists) do
John@29 425 if bsk:IdIsInList(id,v) then
John@29 426 tinsert(listsTheyreOn,v.name)
John@29 427 break
John@28 428 end
John@28 429 end
John@28 430 if getn(listsTheyreOn) > 0 then
John@28 431 self:Print(sformat("Cannot remove person %s because they are on one or more lists (%s)",name,table.concat(listsTheyreOn,", ")))
John@28 432 return false
John@28 433 end
John@27 434 local change = {action="RemovePerson",arg={id=id}}
John@27 435 bsk:StartChange(change)
John@28 436 if bsk:DoRemovePerson(change) then
John@27 437 bsk:CommitChange(change)
John@27 438 end
John@26 439 end--}}}
John@26 440 function bsk:DoSuicidePerson(change)--{{{
John@16 441 local list = bsk.lists[change.arg.listIndex]
John@16 442 local affected = shallowCopy(change.arg.affect)
John@0 443 -- the goal here is to rotate the suicide list by 1
John@0 444 -- then we can just mash it on top of the intersection between the original
John@0 445 -- list and the working copy
John@17 446
John@16 447 local replacement = shallowCopy(change.arg.affect)
John@16 448 local temp = table.remove(replacement,1) -- pop
John@16 449 tinsert(replacement,temp) -- push_back
John@0 450 --bsk:Print(sformat("Before suicide of %s on list %s",slist[1],list.name))
John@0 451 --bsk:PrintTable(list)
John@0 452 for i = 1, #list do
John@17 453 if list[i].id == affected[1] then
John@17 454 table.remove(affected,1)
John@16 455 list[i].id = replacement[1]
John@16 456 table.remove(replacement,1)
John@0 457 end
John@0 458 end
John@0 459 list.time=change.time
John@0 460 return true
John@26 461 end--}}}
John@26 462 function bsk:SuicidePerson(name,listName)--{{{
John@0 463 -- require admin
John@0 464 bsk:PopulateRaidList()
John@16 465 local listIndex = bsk:GetListIndex(listName)
John@16 466 local id = personName2id[name]
John@16 467 local affect=bsk:GetSuicideList(id,bsk.lists[listIndex])
John@16 468 local change = {action="SuicidePerson",arg={affect=affect,listIndex=listIndex}}
John@0 469 bsk:StartChange(change)
John@8 470 if bsk:DoSuicidePerson(change) then
John@0 471 bsk:CommitChange(change)
John@0 472 end
John@26 473 end--}}}
John@26 474 function bsk:DoRenameList(change)--{{{
John@20 475 bsk.lists[change.arg.listIndex].name = change.arg.name
John@20 476 bsk.lists[change.arg.listIndex].time = change.time
John@20 477 return true
John@26 478 end--}}}
John@26 479 function bsk:RenameList(listName,newListName)--{{{
John@20 480 -- require admin
John@20 481 local listIndex = bsk:GetListIndex(listName)
John@20 482 local change = {action="RenameList",arg={listIndex=listIndex,name=newListName}}
John@20 483 bsk:StartChange(change)
John@20 484 if bsk:DoRenameList(change) then
John@20 485 bsk:CommitChange(change)
John@20 486 end
John@26 487 end--}}}
John@26 488 function bsk:DoDeleteList(change)--{{{
John@21 489 bsk.lists[change.arg.listIndex] = nil
John@21 490 return true
John@26 491 end--}}}
John@26 492 function bsk:DeleteList(listName)--{{{
John@21 493 local listIndex = bsk:GetListIndex(listName)
John@21 494 local change = {action="DeleteList",arg={listIndex=listIndex}}
John@21 495 bsk:StartChange(change)
John@21 496 if bsk:DoDeleteList(change) then
John@21 497 bsk:CommitChange(change)
John@21 498 end
John@26 499 end--}}}
John@26 500 function bsk:DoRemovePersonFromList(change)--{{{
John@22 501 local list = bsk.lists[change.arg.listIndex]
John@22 502
John@29 503 for i,v in ipairs(list) do
John@22 504 if v.id == change.arg.id then
John@22 505 table.remove(list,i)
John@22 506 break
John@22 507 end
John@22 508 end
John@22 509 table.sort(list,function(a,b) return a.index < b.index end)
John@22 510 list.time = change.time
John@22 511 return true
John@26 512 end--}}}
John@26 513 function bsk:RemovePersonFromList(name,listName)--{{{
John@22 514 local listIndex = bsk:GetListIndex(listName)
John@22 515 local pid = personName2id[name]
John@29 516 -- todo: check that they're on the list in the first place
John@22 517 local change = {action="RemovePersonFromList",arg={id=pid,listIndex=listIndex}}
John@22 518 bsk:StartChange(change)
John@22 519 if bsk:DoRemovePersonFromList(change) then
John@22 520 bsk:CommitChange(change)
John@22 521 end
John@22 522 end
John@20 523 --}}}
John@26 524 --}}}
John@20 525 -- Higher order actions (ie calls other standard actions){{{
John@20 526
John@5 527 function bsk:TrimLists(time)
John@5 528 if not bsk:CheckListCausality() then
John@18 529 self:Print("Unable to trim changelist due to violated causality")
John@5 530 return false
John@5 531 end
John@5 532
John@5 533 if type(time) ~= "number" then
John@5 534 time = tonumber(time)
John@5 535 end
John@5 536
John@5 537 -- bisect the changes list by "time"
John@5 538 local before = {}
John@5 539 for i,v in ipairs(self.db.profile.changes) do
John@5 540 if v.time <= time then
John@5 541 tinsert(before,v)
John@5 542 else
John@5 543 break
John@5 544 end
John@5 545 end
John@5 546
John@5 547 -- apply first half
John@5 548 bsk:CreateWorkingStateFromChanges(before)
John@5 549
John@5 550 -- save this state permanently; trim the changes permanently
John@8 551 bsk:tcopy(bsk.db.profile.persons,bsk.persons)
John@34 552 bsk:tcopy(bsk.db.profile.lists,bsk.lists)
John@8 553 while bsk.db.profile.changes ~= nil and bsk.db.profile.changes[1] ~= nil and bsk.db.profile.changes[1].time <= time do
John@5 554 table.remove(bsk.db.profile.changes,1)
John@5 555 end
John@5 556
John@5 557 -- using the trimmed list and the new bases, recreate the working state
John@5 558 bsk:CreateWorkingStateFromChanges(bsk.db.profile.changes)
John@5 559 end
John@5 560
John@8 561 function bsk:AddMissingPersons()
John@1 562 bsk:PopulateRaidList()
John@1 563 local t = {}
John@17 564 for id,_ in pairs(bsk.persons) do
John@17 565 t[id] = true
John@1 566 end
John@17 567 for name,_ in pairs(raidNameP) do
John@17 568 if personName2id[name] == nil then
John@17 569 bsk:Print(sformat("Person %s is missing from the persons list - adding",name))
John@17 570 bsk:AddPerson(name)
John@1 571 end
John@1 572 end
John@1 573 -- TODO: batch into a single op - no need to spam 25 messages in a row
John@1 574 end
John@29 575
John@17 576 function bsk:PopulateListRandom(listIndex)
John@17 577 -- difference (raid+reserve)-list, then random shuffle that, then add
John@3 578 bsk:PopulateRaidList()
John@17 579 local list = bsk.lists[listIndex]
John@3 580
John@17 581 local t = {} -- after loops, contains intersection of IDs present between raid and reserve
John@17 582 for i,v in pairs(raidIdP) do
John@17 583 if v then t[i] = true end
John@17 584 end
John@17 585 for i,v in pairs(reserveIdP) do
John@17 586 if v then t[i] = true end
John@17 587 end
John@17 588
John@17 589 -- now remove from t all of the people already present on the list
John@21 590 if list then
John@21 591 for i = 1,#list do
John@21 592 if t[list[i].id] then
John@21 593 t[list[i].id] = false
John@21 594 end
John@17 595 end
John@17 596 end
John@17 597
John@17 598 -- add all remaining
John@17 599 for i,v in pairs(t) do
John@17 600 if v then
John@17 601 bsk:AddPersonToListRandom(bsk.persons[i].main,list.name) -- TODO: APTLR keys off of string names. probably need to change this.
John@17 602 end
John@17 603 end
John@3 604 end
John@30 605
John@30 606 function bsk:NukePerson(name) -- delete from all lists and then from persons
John@30 607 local pid = personName2id[name]
John@30 608 for i,v in pairs(bsk.lists) do
John@30 609 bsk:RemovePersonFromList(name,v.name)
John@30 610 end
John@30 611 bsk:RemovePerson(name)
John@30 612 end
John@1 613 --}}}
John@1 614 -- "Soft" actions- ie things that cause nonpermanent state {{{
John@1 615
John@1 616 -- reserves
John@1 617 function bsk:AddReserve(name)
John@16 618 reserveIdP[personName2id[name]]=true
John@1 619 -- TODO: communicate to others. don't store this in any way.
John@1 620 end
John@1 621
John@1 622 function bsk:RemoveReserve(name)
John@16 623 reserveIdP[personName2id[name]]=false
John@1 624 -- TODO: communicate to others. don't store this in any way.
John@1 625 end
John@1 626
John@1 627
John@1 628 --function bsk:GetActiveList()
John@1 629 -- return bsk.lists[1] -- todo!
John@1 630 --end
John@1 631
John@1 632 --}}}
John@0 633
John@17 634 -- The following (adapted) code is from Xinhuan (wowace forum member)
John@0 635 -- Pre-create the unitID strings we will use
John@0 636 local pID = {}
John@0 637 local rID = {}
John@0 638 for i = 1, 4 do
John@0 639 pID[i] = format("party%d", i)
John@0 640 end
John@0 641 for i = 1, 40 do
John@0 642 rID[i] = format("raid%d", i)
John@0 643 end
John@0 644 function bsk:PopulateRaidList()
John@0 645 local inParty = GetNumPartyMembers()
John@0 646 local inRaid = GetNumRaidMembers()
John@17 647 local add = function(unitNameArg)
John@17 648 local name = UnitName(unitNameArg)
John@17 649 raidNameP[name]=true
John@17 650 if personName2id[name] ~= nil then
John@17 651 raidIdP[personName2id[name]]=true
John@17 652 end
John@17 653 end
John@0 654
John@16 655 wipe(raidNameP)
John@16 656 wipe(raidIdP)
John@0 657 if inRaid > 0 then
John@0 658 for i = 1, inRaid do
John@17 659 add(rID[i])
John@0 660 end
John@0 661 elseif inParty > 0 then
John@0 662 for i = 1, inParty do
John@17 663 add(pID[i])
John@0 664 end
John@0 665 -- Now add yourself as the last party member
John@17 666 add("player")
John@0 667 else
John@0 668 -- You're alone
John@17 669 add("player")
John@0 670 end
John@19 671 --bsk:PrintTable(raidNameP)
John@0 672 end
John@0 673
John@0 674 -- undo rules!
John@0 675 -- only the most recent event can be undone
John@0 676 -- ^^^ on a given list?
John@0 677 -- algorithm is easy, given "Suicide A B C"
John@0 678 -- just find A,B,C in the list and replace in order from the s message
John@0 679 -- while undo is allowed *per-list*, certain events in the stream will
John@0 680 -- prevent proper undo, such as add/delete player or add/delete list
John@0 681
John@0 682
John@12 683 function bsk:GetSuicideList(id,list)
John@1 684 --self:Print("Calculating changeset for "..name.." from list -")
John@1 685 --self:PrintTable(list)
John@1 686 local t = {}
John@1 687 local ret = {}
John@1 688 local pushing = false
John@1 689 for i = 1, #list do
John@12 690 if list[i].id == id then
John@1 691 pushing = true
John@1 692 end
John@16 693 if pushing and (raidIdP[list[i].id] or reserveIdP[list[i].id]) then
John@10 694 tinsert(ret,list[i].id)
John@1 695 end
John@1 696 end
John@16 697 --bsk:Print("GSL")
John@16 698 --bsk:PrintTable(ret)
John@16 699 --bsk:Print("GSL")
John@1 700 return ret
John@0 701 end
John@0 702
John@13 703 function bsk:IdIsInList(id,listRef)
John@13 704 for i = 1,#listRef do
John@13 705 if id == listRef[i].id then
John@13 706 return true
John@13 707 end
John@13 708 end
John@13 709 return false
John@13 710 end
John@13 711
John@5 712 -- returns true if the events in the list are in time order
John@5 713 function bsk:CheckListCausality()
John@5 714 local t = nil
John@5 715 for i,v in ipairs(bsk.db.profile.changes) do
John@5 716 if t ~= nil then
John@5 717 if v.time <= t then
John@5 718 return false
John@5 719 end
John@5 720 end
John@5 721 t = v.time
John@5 722 end
John@5 723 return true
John@5 724 end
John@0 725
John@0 726 -- Support functions
John@0 727
John@0 728 function bsk:GetListIndex(name)
John@0 729 for i,v in pairs(bsk.lists) do
John@0 730 if v.name == name then
John@0 731 return i
John@0 732 end
John@0 733 end
John@17 734 return nil
John@0 735 end
John@1 736
John@3 737 local shuffleArray = function(array)
John@3 738 local arrayCount = #array
John@3 739 for i = arrayCount, 2, -1 do
John@3 740 local j = math.random(1, i)
John@3 741 array[i], array[j] = array[j], array[i]
John@3 742 end
John@3 743 return array
John@3 744 end
John@3 745