Mercurial > wow > breuesk

annotate Lists.lua @ 13:e62cbf3a0c07

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