Mercurial > wow > breuesk

annotate Lists.lua @ 46:6c0a8acccbc8

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