Mercurial > wow > breuesk

annotate Lists.lua @ 24:2bac61505025

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