annotate Lists.lua @ 35:ecd37523ae04

More todos
author John@Yosemite-PC
date Sun, 11 Mar 2012 23:57:38 -0400
parents 0e03db65c1fe
children 6362fe301d43
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@35 15 -- TODO: players list, drop the "main" sub-entry for people with no alts
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@34 86 bsk.db.profile.lists = {}
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@34 172 local lists = self.db.profile.lists
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@34 179 bsk:tcopy(bsk.lists,lists)
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@27 231 elseif change.action == "RemovePerson" then
John@27 232 bsk:DoRemovePerson(change)
John@22 233 elseif change.action == "RemovePersonFromList" then
John@22 234 bsk:DoRemovePersonFromList(change)
John@16 235 elseif change.action == "SuicidePerson" then
John@16 236 bsk:DoSuicidePerson(change)
John@16 237 else
John@16 238 bsk:Print("Unknown message encountered")
John@16 239 bsk:PrintTable(change)
John@16 240 assert(false)
John@16 241 end
John@16 242 end
John@16 243
John@16 244 --}}}
John@27 245 -- holy crap long winded {{{
John@0 246 -- timestamp logic:
John@0 247 -- use time() for comparisons - local clients use date() to make it pretty. only
John@0 248 -- dowisde - we can't have a server timestamp. Which kind of sucks, but it turns
John@0 249 -- out you can change timezones when you enter an instance server, so you really
John@0 250 -- never know what time it is.
John@0 251 -- There's unfortunately no hard-and-proven method for determining the true time
John@0 252 -- difference between local time and server time. You can't just query the two
John@0 253 -- and compare them because your server timezone can change (!) if you go into
John@0 254 -- an instance server with a different timezone. This is apparently a big
John@0 255 -- problem on Oceanic realms.
John@0 256 --
John@0 257 -- Timestamp handling (brainstorming how to deal with drift):
John@0 258 -- (not an issue) if someone sends you time in the future, update your offset so you won't
John@0 259 -- send out events in the "past" to that person
John@0 260 -- (not an issue - using local UTC now) on change-zone-event: check if you've changed timezones - might need update
John@0 261 -- each time you add a change, check the tail of the change list; if this is
John@0 262 -- less than that, you have a problem. Print a message. if this is equal, then
John@0 263 -- that's ok, just bump it by 1 second. This could happen in the case of, say,
John@0 264 -- spam-clicking the undo button or adding names to the list. The recipients
John@0 265 -- should be ok with this since they'll follow the same algorithm. The only
John@0 266 -- real chance for a problem is if two people click within the 1 second window?
John@0 267 -- if someone sends you a past event,
John@0 268 -- it's ok if it's newer than anything in the changes list
John@0 269 -- otherwise ... causality has been violated.
John@0 270 -- Whenever an admin signon event happens, have the admins each perform a
John@0 271 -- timestamp check. Issue warnings for anyone with a clock that's more than
John@0 272 -- X seconds out of sync with the others. Seriously, why isn't NTP a standard
John@0 273 -- setting on all operating systems ...
John@27 274 --}}}
John@0 275
John@1 276 -- Action and DoAction defs {{{
John@27 277 -- Action Discussion {{{
John@0 278 -- The actual actions for changes start here
John@0 279 --
John@0 280 -- Each action occurs as a pair of functions. The bsk:Action() function is from
John@0 281 -- a list admin's point of view. Each will check for admin status, then create a
John@0 282 -- change bundle, call the handler for that change (ie the DoAction func), and
John@0 283 -- then record/transmist the bundle. These are simple and repetitive functions.
John@0 284 --
John@0 285 -- The bsk:DoAction() function is tasked with executing the bundle and is what
John@0 286 -- non-admins and admins alike will call to transform their working state via a
John@0 287 -- change packet. Each Do() function will accept *only* a change packet, and
John@0 288 -- it's assumed that the change has been vetted elsewhere. These are very blunt
John@0 289 -- routines.
John@0 290 --
John@0 291 -- Note that "undo" has no special voodoo to it. It's basically a change that
John@27 292 -- reverses the prior change on the stack.--}}}
John@26 293 function bsk:DoAddPerson(change)--{{{
John@0 294 assert(change)
John@8 295 assert(change.arg.id)
John@0 296 local arg = change.arg
John@0 297 -- require admin
John@8 298 local persons = bsk.persons
John@0 299 local name = arg.name
John@8 300 local id = arg.id
John@8 301 assert(persons[id]==nil)
John@8 302 persons[id] = {main=name}
John@8 303 persons.time=change.time
John@16 304 personName2id[name] = id
John@0 305 return true
John@26 306 end--}}}
John@26 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@26 330 end--}}}
John@26 331 function bsk:DoCreateList(change)--{{{
John@18 332 --if bsk:GetListIndex(change.arg.name) then
John@18 333 -- self:Print(sformat("List %s already exists",v.name))
John@18 334 -- return false
John@18 335 --end
John@19 336 bsk.lists[change.arg.id]={name=change.arg.name,time=change.time}
John@0 337 return true
John@26 338 end--}}}
John@26 339 function bsk:CreateList(name)--{{{
John@0 340 -- require admin
John@0 341 local change={action="CreateList",arg={name=name}}
John@0 342 bsk:StartChange(change)
John@18 343 change.arg.id=change.time -- use the creation timestamp as the list's index. it's as unique as anything...
John@0 344 self:Print("Creating ... " .. name)
John@0 345 if bsk:DoCreateList(change) then
John@0 346 bsk:CommitChange(change)
John@0 347 end
John@26 348 end--}}}
John@26 349 function bsk:DoAddPersonToListEnd(change)--{{{
John@10 350 local list = bsk.lists[change.arg.listIndex]
John@22 351 local index
John@22 352 if getn(list) > 0 then
John@22 353 index = list[#list].index + 0.1
John@22 354 else
John@22 355 index = 0.1
John@22 356 end
John@10 357 local entry = {index=index, id=change.arg.id}
John@0 358
John@10 359 tinsert(list,entry)
John@10 360 list.time = change.time
John@10 361 list.closedRandom = true
John@10 362
John@0 363 return true
John@26 364 end--}}}
John@26 365 function bsk:AddPersonToListEnd(name,listName)--{{{
John@0 366 -- require admin
John@16 367 local listIndex = bsk:GetListIndex(listName)
John@16 368 local id = personName2id[name]
John@13 369 if bsk:IdIsInList(id,bsk.lists[listIndex]) then
John@13 370 bsk:Print(sformat("Person %s is already on the reqeuested list",name))
John@17 371 return false
John@13 372 end
John@16 373 bsk:Print(sformat("Adding %s (%s) to list %s (%s)", name, id, listName, listIndex))
John@10 374 local change = {action="AddToListEnd",arg={id=id,listIndex=listIndex}}
John@0 375 bsk:StartChange(change)
John@10 376 if bsk:DoAddPersonToListEnd(change) then
John@10 377 bsk:CommitChange(change)
John@10 378 end
John@26 379 end--}}}
John@26 380 function bsk:DoAddPersonToListRandom(change)--{{{
John@10 381 local list = bsk.lists[change.arg.listIndex]
John@10 382 local entry = {index=change.arg.roll, id=change.arg.id}
John@10 383
John@10 384 tinsert(list,entry)
John@12 385 table.sort(list,function(a,b) return a.index < b.index end)
John@10 386 list.time = change.time
John@10 387
John@10 388 return true
John@26 389 end--}}}
John@26 390 function bsk:AddPersonToListRandom(name,listName)--{{{
John@10 391 -- require admin
John@16 392 local listIndex = bsk:GetListIndex(listName)
John@10 393 if bsk.lists[listIndex].closedRandom then
John@10 394 self:Print("Cannot add person to list by random roll because an add-to-end operation has already occurred")
John@12 395 return false
John@10 396 end
John@17 397 local id = personName2id[name]
John@13 398 if bsk:IdIsInList(id,bsk.lists[listIndex]) then
John@13 399 bsk:Print(sformat("Person %s is already on the reqeuested list",name))
John@17 400 return false
John@13 401 end
John@10 402 local roll = math.random()
John@16 403 bsk:Print(sformat("Adding %s (%s) to list %s (%s) with roll (%f)", name, id, listName, listIndex, roll))
John@10 404 local change = {action="AddToListRand",arg={id=id,listIndex=listIndex,roll=roll}}
John@10 405 bsk:StartChange(change)
John@10 406 if bsk:DoAddPersonToListRandom(change) then
John@0 407 bsk:CommitChange(change)
John@0 408 end
John@26 409 end--}}}
John@26 410 function bsk:DoRemovePerson(change)--{{{
John@27 411 local person = bsk.persons[change.arg.id]
John@27 412 personName2id[person.main] = nil
John@27 413 bsk.persons[change.arg.id] = nil
John@27 414 bsk.persons.time = change.time
John@27 415 return true
John@26 416 end--}}}
John@26 417 function bsk:RemovePerson(name)--{{{
John@27 418 local id = personName2id[name]
John@27 419 if not id then
John@27 420 bsk:Print(sformat("%s is not in the persons list, please check your spelling", name))
John@27 421 return false
John@27 422 end
John@28 423 local listsTheyreOn = {}
John@28 424 -- check if they're active on any loot list
John@28 425 for i,v in pairs(bsk.lists) do
John@29 426 if bsk:IdIsInList(id,v) then
John@29 427 tinsert(listsTheyreOn,v.name)
John@29 428 break
John@28 429 end
John@28 430 end
John@28 431 if getn(listsTheyreOn) > 0 then
John@28 432 self:Print(sformat("Cannot remove person %s because they are on one or more lists (%s)",name,table.concat(listsTheyreOn,", ")))
John@28 433 return false
John@28 434 end
John@27 435 local change = {action="RemovePerson",arg={id=id}}
John@27 436 bsk:StartChange(change)
John@28 437 if bsk:DoRemovePerson(change) then
John@27 438 bsk:CommitChange(change)
John@27 439 end
John@26 440 end--}}}
John@26 441 function bsk:DoSuicidePerson(change)--{{{
John@16 442 local list = bsk.lists[change.arg.listIndex]
John@16 443 local affected = shallowCopy(change.arg.affect)
John@0 444 -- the goal here is to rotate the suicide list by 1
John@0 445 -- then we can just mash it on top of the intersection between the original
John@0 446 -- list and the working copy
John@17 447
John@16 448 local replacement = shallowCopy(change.arg.affect)
John@16 449 local temp = table.remove(replacement,1) -- pop
John@16 450 tinsert(replacement,temp) -- push_back
John@0 451 --bsk:Print(sformat("Before suicide of %s on list %s",slist[1],list.name))
John@0 452 --bsk:PrintTable(list)
John@0 453 for i = 1, #list do
John@17 454 if list[i].id == affected[1] then
John@17 455 table.remove(affected,1)
John@16 456 list[i].id = replacement[1]
John@16 457 table.remove(replacement,1)
John@0 458 end
John@0 459 end
John@0 460 list.time=change.time
John@0 461 return true
John@26 462 end--}}}
John@26 463 function bsk:SuicidePerson(name,listName)--{{{
John@0 464 -- require admin
John@0 465 bsk:PopulateRaidList()
John@16 466 local listIndex = bsk:GetListIndex(listName)
John@16 467 local id = personName2id[name]
John@16 468 local affect=bsk:GetSuicideList(id,bsk.lists[listIndex])
John@16 469 local change = {action="SuicidePerson",arg={affect=affect,listIndex=listIndex}}
John@0 470 bsk:StartChange(change)
John@8 471 if bsk:DoSuicidePerson(change) then
John@0 472 bsk:CommitChange(change)
John@0 473 end
John@26 474 end--}}}
John@26 475 function bsk:DoRenameList(change)--{{{
John@20 476 bsk.lists[change.arg.listIndex].name = change.arg.name
John@20 477 bsk.lists[change.arg.listIndex].time = change.time
John@20 478 return true
John@26 479 end--}}}
John@26 480 function bsk:RenameList(listName,newListName)--{{{
John@20 481 -- require admin
John@20 482 local listIndex = bsk:GetListIndex(listName)
John@20 483 local change = {action="RenameList",arg={listIndex=listIndex,name=newListName}}
John@20 484 bsk:StartChange(change)
John@20 485 if bsk:DoRenameList(change) then
John@20 486 bsk:CommitChange(change)
John@20 487 end
John@26 488 end--}}}
John@26 489 function bsk:DoDeleteList(change)--{{{
John@21 490 bsk.lists[change.arg.listIndex] = nil
John@21 491 return true
John@26 492 end--}}}
John@26 493 function bsk:DeleteList(listName)--{{{
John@21 494 local listIndex = bsk:GetListIndex(listName)
John@21 495 local change = {action="DeleteList",arg={listIndex=listIndex}}
John@21 496 bsk:StartChange(change)
John@21 497 if bsk:DoDeleteList(change) then
John@21 498 bsk:CommitChange(change)
John@21 499 end
John@26 500 end--}}}
John@26 501 function bsk:DoRemovePersonFromList(change)--{{{
John@22 502 local list = bsk.lists[change.arg.listIndex]
John@22 503
John@29 504 for i,v in ipairs(list) do
John@22 505 if v.id == change.arg.id then
John@22 506 table.remove(list,i)
John@22 507 break
John@22 508 end
John@22 509 end
John@22 510 table.sort(list,function(a,b) return a.index < b.index end)
John@22 511 list.time = change.time
John@22 512 return true
John@26 513 end--}}}
John@26 514 function bsk:RemovePersonFromList(name,listName)--{{{
John@22 515 local listIndex = bsk:GetListIndex(listName)
John@22 516 local pid = personName2id[name]
John@29 517 -- todo: check that they're on the list in the first place
John@22 518 local change = {action="RemovePersonFromList",arg={id=pid,listIndex=listIndex}}
John@22 519 bsk:StartChange(change)
John@22 520 if bsk:DoRemovePersonFromList(change) then
John@22 521 bsk:CommitChange(change)
John@22 522 end
John@22 523 end
John@20 524 --}}}
John@26 525 --}}}
John@20 526 -- Higher order actions (ie calls other standard actions){{{
John@20 527
John@5 528 function bsk:TrimLists(time)
John@5 529 if not bsk:CheckListCausality() then
John@18 530 self:Print("Unable to trim changelist due to violated causality")
John@5 531 return false
John@5 532 end
John@5 533
John@5 534 if type(time) ~= "number" then
John@5 535 time = tonumber(time)
John@5 536 end
John@5 537
John@5 538 -- bisect the changes list by "time"
John@5 539 local before = {}
John@5 540 for i,v in ipairs(self.db.profile.changes) do
John@5 541 if v.time <= time then
John@5 542 tinsert(before,v)
John@5 543 else
John@5 544 break
John@5 545 end
John@5 546 end
John@5 547
John@5 548 -- apply first half
John@5 549 bsk:CreateWorkingStateFromChanges(before)
John@5 550
John@5 551 -- save this state permanently; trim the changes permanently
John@8 552 bsk:tcopy(bsk.db.profile.persons,bsk.persons)
John@34 553 bsk:tcopy(bsk.db.profile.lists,bsk.lists)
John@8 554 while bsk.db.profile.changes ~= nil and bsk.db.profile.changes[1] ~= nil and bsk.db.profile.changes[1].time <= time do
John@5 555 table.remove(bsk.db.profile.changes,1)
John@5 556 end
John@5 557
John@5 558 -- using the trimmed list and the new bases, recreate the working state
John@5 559 bsk:CreateWorkingStateFromChanges(bsk.db.profile.changes)
John@5 560 end
John@5 561
John@8 562 function bsk:AddMissingPersons()
John@1 563 bsk:PopulateRaidList()
John@1 564 local t = {}
John@17 565 for id,_ in pairs(bsk.persons) do
John@17 566 t[id] = true
John@1 567 end
John@17 568 for name,_ in pairs(raidNameP) do
John@17 569 if personName2id[name] == nil then
John@17 570 bsk:Print(sformat("Person %s is missing from the persons list - adding",name))
John@17 571 bsk:AddPerson(name)
John@1 572 end
John@1 573 end
John@1 574 -- TODO: batch into a single op - no need to spam 25 messages in a row
John@1 575 end
John@29 576
John@17 577 function bsk:PopulateListRandom(listIndex)
John@17 578 -- difference (raid+reserve)-list, then random shuffle that, then add
John@3 579 bsk:PopulateRaidList()
John@17 580 local list = bsk.lists[listIndex]
John@3 581
John@17 582 local t = {} -- after loops, contains intersection of IDs present between raid and reserve
John@17 583 for i,v in pairs(raidIdP) do
John@17 584 if v then t[i] = true end
John@17 585 end
John@17 586 for i,v in pairs(reserveIdP) do
John@17 587 if v then t[i] = true end
John@17 588 end
John@17 589
John@17 590 -- now remove from t all of the people already present on the list
John@21 591 if list then
John@21 592 for i = 1,#list do
John@21 593 if t[list[i].id] then
John@21 594 t[list[i].id] = false
John@21 595 end
John@17 596 end
John@17 597 end
John@17 598
John@17 599 -- add all remaining
John@17 600 for i,v in pairs(t) do
John@17 601 if v then
John@17 602 bsk:AddPersonToListRandom(bsk.persons[i].main,list.name) -- TODO: APTLR keys off of string names. probably need to change this.
John@17 603 end
John@17 604 end
John@3 605 end
John@30 606
John@30 607 function bsk:NukePerson(name) -- delete from all lists and then from persons
John@30 608 local pid = personName2id[name]
John@30 609 for i,v in pairs(bsk.lists) do
John@30 610 bsk:RemovePersonFromList(name,v.name)
John@30 611 end
John@30 612 bsk:RemovePerson(name)
John@30 613 end
John@1 614 --}}}
John@1 615 -- "Soft" actions- ie things that cause nonpermanent state {{{
John@1 616
John@1 617 -- reserves
John@1 618 function bsk:AddReserve(name)
John@16 619 reserveIdP[personName2id[name]]=true
John@1 620 -- TODO: communicate to others. don't store this in any way.
John@1 621 end
John@1 622
John@1 623 function bsk:RemoveReserve(name)
John@16 624 reserveIdP[personName2id[name]]=false
John@1 625 -- TODO: communicate to others. don't store this in any way.
John@1 626 end
John@1 627
John@1 628
John@1 629 --function bsk:GetActiveList()
John@1 630 -- return bsk.lists[1] -- todo!
John@1 631 --end
John@1 632
John@1 633 --}}}
John@0 634
John@17 635 -- The following (adapted) code is from Xinhuan (wowace forum member)
John@0 636 -- Pre-create the unitID strings we will use
John@0 637 local pID = {}
John@0 638 local rID = {}
John@0 639 for i = 1, 4 do
John@0 640 pID[i] = format("party%d", i)
John@0 641 end
John@0 642 for i = 1, 40 do
John@0 643 rID[i] = format("raid%d", i)
John@0 644 end
John@0 645 function bsk:PopulateRaidList()
John@0 646 local inParty = GetNumPartyMembers()
John@0 647 local inRaid = GetNumRaidMembers()
John@17 648 local add = function(unitNameArg)
John@17 649 local name = UnitName(unitNameArg)
John@17 650 raidNameP[name]=true
John@17 651 if personName2id[name] ~= nil then
John@17 652 raidIdP[personName2id[name]]=true
John@17 653 end
John@17 654 end
John@0 655
John@16 656 wipe(raidNameP)
John@16 657 wipe(raidIdP)
John@0 658 if inRaid > 0 then
John@0 659 for i = 1, inRaid do
John@17 660 add(rID[i])
John@0 661 end
John@0 662 elseif inParty > 0 then
John@0 663 for i = 1, inParty do
John@17 664 add(pID[i])
John@0 665 end
John@0 666 -- Now add yourself as the last party member
John@17 667 add("player")
John@0 668 else
John@0 669 -- You're alone
John@17 670 add("player")
John@0 671 end
John@19 672 --bsk:PrintTable(raidNameP)
John@0 673 end
John@0 674
John@0 675 -- undo rules!
John@0 676 -- only the most recent event can be undone
John@0 677 -- ^^^ on a given list?
John@0 678 -- algorithm is easy, given "Suicide A B C"
John@0 679 -- just find A,B,C in the list and replace in order from the s message
John@0 680 -- while undo is allowed *per-list*, certain events in the stream will
John@0 681 -- prevent proper undo, such as add/delete player or add/delete list
John@0 682
John@0 683
John@12 684 function bsk:GetSuicideList(id,list)
John@1 685 --self:Print("Calculating changeset for "..name.." from list -")
John@1 686 --self:PrintTable(list)
John@1 687 local t = {}
John@1 688 local ret = {}
John@1 689 local pushing = false
John@1 690 for i = 1, #list do
John@12 691 if list[i].id == id then
John@1 692 pushing = true
John@1 693 end
John@16 694 if pushing and (raidIdP[list[i].id] or reserveIdP[list[i].id]) then
John@10 695 tinsert(ret,list[i].id)
John@1 696 end
John@1 697 end
John@16 698 --bsk:Print("GSL")
John@16 699 --bsk:PrintTable(ret)
John@16 700 --bsk:Print("GSL")
John@1 701 return ret
John@0 702 end
John@0 703
John@13 704 function bsk:IdIsInList(id,listRef)
John@13 705 for i = 1,#listRef do
John@13 706 if id == listRef[i].id then
John@13 707 return true
John@13 708 end
John@13 709 end
John@13 710 return false
John@13 711 end
John@13 712
John@5 713 -- returns true if the events in the list are in time order
John@5 714 function bsk:CheckListCausality()
John@5 715 local t = nil
John@5 716 for i,v in ipairs(bsk.db.profile.changes) do
John@5 717 if t ~= nil then
John@5 718 if v.time <= t then
John@5 719 return false
John@5 720 end
John@5 721 end
John@5 722 t = v.time
John@5 723 end
John@5 724 return true
John@5 725 end
John@0 726
John@0 727 -- Support functions
John@0 728
John@0 729 function bsk:GetListIndex(name)
John@0 730 for i,v in pairs(bsk.lists) do
John@0 731 if v.name == name then
John@0 732 return i
John@0 733 end
John@0 734 end
John@17 735 return nil
John@0 736 end
John@1 737
John@3 738 local shuffleArray = function(array)
John@3 739 local arrayCount = #array
John@3 740 for i = arrayCount, 2, -1 do
John@3 741 local j = math.random(1, i)
John@3 742 array[i], array[j] = array[j], array[i]
John@3 743 end
John@3 744 return array
John@3 745 end
John@3 746