rankConfig.go 1.8 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  1. // this file is auto create by program, don't edit manually
  2. package data
  3. import (
  4. mhayaError "github.com/mhaya/error"
  5. mhayaLogger "github.com/mhaya/logger"
  6. )
  7. type rankConfig struct {
  8. maps map[int]*RankConfigRow
  9. }
  10. type RankConfigRow struct {
  11. ID int // #排行榜ID
  12. Enable int // 是否开启(0否1是)
  13. Type int // 榜单类型(1日榜单2周榜单)
  14. Source int // 来源(1积分2邀请3抽奖)
  15. ShowTotal int // 总展示多少名
  16. Reward []ItemReward // 榜单总奖池
  17. IsBot int // 机器人是否参加(0否1是)
  18. StartTime string // 开始时间
  19. EndTime string // 结束时间
  20. ShowTime string // 展示时间
  21. }
  22. func (p *rankConfig) Name() string {
  23. return "rankConfig"
  24. }
  25. func (p *rankConfig) Init() {
  26. p.maps = make(map[int]*RankConfigRow)
  27. }
  28. func (p *rankConfig) OnLoad(maps interface{}, _ bool) (int, error) {
  29. list, ok := maps.([]interface{})
  30. if !ok {
  31. return 0, mhayaError.Error("maps convert to []interface{} error.")
  32. }
  33. loadMaps := make(map[int]*RankConfigRow)
  34. for index, data := range list {
  35. loadConfig := &RankConfigRow{}
  36. err := DecodeData(data, loadConfig)
  37. if err != nil {
  38. mhayaLogger.Warnf("decode error. [row = %d, %v], err = %s", index+1, loadConfig, err)
  39. continue
  40. }
  41. loadMaps[loadConfig.ID] = loadConfig
  42. }
  43. p.maps = loadMaps
  44. return len(list), nil
  45. }
  46. func (p *rankConfig) OnAfterLoad(_ bool) {
  47. }
  48. func (p *rankConfig) GetAll() map[int]*RankConfigRow {
  49. var ret = make(map[int]*RankConfigRow)
  50. for _, v := range p.maps {
  51. if v.Enable == 1 {
  52. ret[v.ID] = v
  53. }
  54. }
  55. return ret
  56. }
  57. func (p *rankConfig) Get(pk int) (*RankConfigRow, bool) {
  58. i, found := p.maps[pk]
  59. return i, found
  60. }
  61. func (p *rankConfig) Contain(pk int) bool {
  62. _, found := p.Get(pk)
  63. return found
  64. }