2018-01-25 04:57:33 +00:00
|
|
|
package common
|
|
|
|
|
2018-01-26 05:53:34 +00:00
|
|
|
import (
|
|
|
|
"database/sql"
|
|
|
|
"encoding/json"
|
2018-02-15 13:15:27 +00:00
|
|
|
"errors"
|
|
|
|
"log"
|
|
|
|
"strconv"
|
2018-01-26 05:53:34 +00:00
|
|
|
|
2019-12-07 06:27:01 +00:00
|
|
|
qgen "github.com/Azareal/Gosora/query_gen"
|
2018-01-26 05:53:34 +00:00
|
|
|
)
|
2018-01-25 04:57:33 +00:00
|
|
|
|
|
|
|
var Polls PollStore
|
|
|
|
|
2018-01-26 05:53:34 +00:00
|
|
|
type PollOption struct {
|
|
|
|
ID int
|
|
|
|
Value string
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
type Pollable interface {
|
2018-01-27 07:30:44 +00:00
|
|
|
GetID() int
|
|
|
|
GetTable() string
|
2018-01-25 04:57:33 +00:00
|
|
|
SetPoll(pollID int) error
|
|
|
|
}
|
|
|
|
|
|
|
|
type PollStore interface {
|
|
|
|
Get(id int) (*Poll, error)
|
|
|
|
Exists(id int) bool
|
2018-01-26 05:53:34 +00:00
|
|
|
Create(parent Pollable, pollType int, pollOptions map[int]string) (int, error)
|
2018-01-25 04:57:33 +00:00
|
|
|
Reload(id int) error
|
2019-06-01 12:31:48 +00:00
|
|
|
//Count() int
|
2018-01-25 04:57:33 +00:00
|
|
|
|
|
|
|
SetCache(cache PollCache)
|
|
|
|
GetCache() PollCache
|
|
|
|
}
|
|
|
|
|
|
|
|
type DefaultPollStore struct {
|
|
|
|
cache PollCache
|
|
|
|
|
2020-02-19 05:17:12 +00:00
|
|
|
get *sql.Stmt
|
|
|
|
exists *sql.Stmt
|
|
|
|
createPoll *sql.Stmt
|
|
|
|
createPollOption *sql.Stmt
|
|
|
|
delete *sql.Stmt
|
2019-06-01 12:31:48 +00:00
|
|
|
//count *sql.Stmt
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
func NewDefaultPollStore(cache PollCache) (*DefaultPollStore, error) {
|
2018-08-04 11:46:36 +00:00
|
|
|
acc := qgen.NewAcc()
|
2018-01-25 04:57:33 +00:00
|
|
|
if cache == nil {
|
|
|
|
cache = NewNullPollCache()
|
|
|
|
}
|
|
|
|
// TODO: Add an admin version of registerStmt with more flexibility?
|
2020-02-19 05:17:12 +00:00
|
|
|
p := "polls"
|
2018-01-25 04:57:33 +00:00
|
|
|
return &DefaultPollStore{
|
2020-02-19 05:17:12 +00:00
|
|
|
cache: cache,
|
|
|
|
get: acc.Select(p).Columns("parentID, parentTable, type, options, votes").Where("pollID=?").Prepare(),
|
|
|
|
exists: acc.Select(p).Columns("pollID").Where("pollID=?").Prepare(),
|
|
|
|
createPoll: acc.Insert(p).Columns("parentID, parentTable, type, options").Fields("?,?,?,?").Prepare(),
|
2021-01-02 21:46:24 +00:00
|
|
|
createPollOption: acc.Insert("polls_options").Columns("pollID,option,votes").Fields("?,?,0").Prepare(),
|
2020-02-19 05:17:12 +00:00
|
|
|
//count: acc.SimpleCount(p, "", ""),
|
2018-01-25 04:57:33 +00:00
|
|
|
}, acc.FirstError()
|
|
|
|
}
|
|
|
|
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) Exists(id int) bool {
|
2021-01-02 21:46:24 +00:00
|
|
|
e := s.exists.QueryRow(id).Scan(&id)
|
|
|
|
if e != nil && e != ErrNoRows {
|
|
|
|
LogError(e)
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
2021-01-02 21:46:24 +00:00
|
|
|
return e != ErrNoRows
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) Get(id int) (*Poll, error) {
|
2020-02-18 23:04:14 +00:00
|
|
|
p, err := s.cache.Get(id)
|
2018-01-25 04:57:33 +00:00
|
|
|
if err == nil {
|
2020-02-18 23:04:14 +00:00
|
|
|
return p, nil
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
2020-02-18 23:04:14 +00:00
|
|
|
p = &Poll{ID: id}
|
2018-01-25 04:57:33 +00:00
|
|
|
var optionTxt []byte
|
2020-02-18 23:04:14 +00:00
|
|
|
err = s.get.QueryRow(id).Scan(&p.ParentID, &p.ParentTable, &p.Type, &optionTxt, &p.VoteCount)
|
2018-01-26 05:53:34 +00:00
|
|
|
if err != nil {
|
|
|
|
return nil, err
|
|
|
|
}
|
|
|
|
|
2020-02-18 23:04:14 +00:00
|
|
|
err = json.Unmarshal(optionTxt, &p.Options)
|
2018-01-25 04:57:33 +00:00
|
|
|
if err == nil {
|
2020-02-18 23:04:14 +00:00
|
|
|
p.QuickOptions = s.unpackOptionsMap(p.Options)
|
|
|
|
s.cache.Set(p)
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
2020-02-18 23:04:14 +00:00
|
|
|
return p, err
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
2018-02-15 13:15:27 +00:00
|
|
|
// TODO: Optimise the query to avoid preparing it on the spot? Maybe, use knowledge of the most common IN() parameter counts?
|
|
|
|
// TODO: ID of 0 should always error?
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) BulkGetMap(ids []int) (list map[int]*Poll, err error) {
|
2019-10-29 01:58:04 +00:00
|
|
|
idCount := len(ids)
|
2018-02-15 13:15:27 +00:00
|
|
|
list = make(map[int]*Poll)
|
|
|
|
if idCount == 0 {
|
|
|
|
return list, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
var stillHere []int
|
2019-06-16 06:30:58 +00:00
|
|
|
sliceList := s.cache.BulkGet(ids)
|
2018-02-15 13:15:27 +00:00
|
|
|
for i, sliceItem := range sliceList {
|
|
|
|
if sliceItem != nil {
|
|
|
|
list[sliceItem.ID] = sliceItem
|
|
|
|
} else {
|
|
|
|
stillHere = append(stillHere, ids[i])
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ids = stillHere
|
|
|
|
|
|
|
|
// If every user is in the cache, then return immediately
|
|
|
|
if len(ids) == 0 {
|
|
|
|
return list, nil
|
|
|
|
}
|
|
|
|
|
2021-02-19 03:28:20 +00:00
|
|
|
idList, q := inqbuild(ids)
|
2019-08-28 06:47:54 +00:00
|
|
|
rows, err := qgen.NewAcc().Select("polls").Columns("pollID,parentID,parentTable,type,options,votes").Where("pollID IN(" + q + ")").Query(idList...)
|
2018-02-15 13:15:27 +00:00
|
|
|
if err != nil {
|
|
|
|
return list, err
|
|
|
|
}
|
|
|
|
|
|
|
|
for rows.Next() {
|
2019-10-29 01:58:04 +00:00
|
|
|
p := &Poll{ID: 0}
|
2018-02-15 13:15:27 +00:00
|
|
|
var optionTxt []byte
|
2019-10-29 01:58:04 +00:00
|
|
|
err := rows.Scan(&p.ID, &p.ParentID, &p.ParentTable, &p.Type, &optionTxt, &p.VoteCount)
|
2018-02-15 13:15:27 +00:00
|
|
|
if err != nil {
|
|
|
|
return list, err
|
|
|
|
}
|
|
|
|
|
2019-10-29 01:58:04 +00:00
|
|
|
err = json.Unmarshal(optionTxt, &p.Options)
|
2018-02-15 13:15:27 +00:00
|
|
|
if err != nil {
|
|
|
|
return list, err
|
|
|
|
}
|
2019-10-29 01:58:04 +00:00
|
|
|
p.QuickOptions = s.unpackOptionsMap(p.Options)
|
|
|
|
s.cache.Set(p)
|
2018-02-15 13:15:27 +00:00
|
|
|
|
2019-10-29 01:58:04 +00:00
|
|
|
list[p.ID] = p
|
2018-02-15 13:15:27 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// Did we miss any polls?
|
|
|
|
if idCount > len(list) {
|
|
|
|
var sidList string
|
|
|
|
for _, id := range ids {
|
|
|
|
_, ok := list[id]
|
|
|
|
if !ok {
|
|
|
|
sidList += strconv.Itoa(id) + ","
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// We probably don't need this, but it might be useful in case of bugs in BulkCascadeGetMap
|
|
|
|
if sidList == "" {
|
2018-02-19 04:26:01 +00:00
|
|
|
// TODO: Bulk log this
|
2018-02-15 13:15:27 +00:00
|
|
|
if Dev.DebugMode {
|
|
|
|
log.Print("This data is sampled later in the BulkCascadeGetMap function, so it might miss the cached IDs")
|
|
|
|
log.Print("idCount", idCount)
|
|
|
|
log.Print("ids", ids)
|
|
|
|
log.Print("list", list)
|
|
|
|
}
|
|
|
|
return list, errors.New("We weren't able to find a poll, but we don't know which one")
|
|
|
|
}
|
|
|
|
sidList = sidList[0 : len(sidList)-1]
|
|
|
|
|
|
|
|
err = errors.New("Unable to find the polls with the following IDs: " + sidList)
|
|
|
|
}
|
|
|
|
|
|
|
|
return list, err
|
|
|
|
}
|
|
|
|
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) Reload(id int) error {
|
2019-10-29 01:58:04 +00:00
|
|
|
p := &Poll{ID: id}
|
2018-01-25 04:57:33 +00:00
|
|
|
var optionTxt []byte
|
2019-10-29 01:58:04 +00:00
|
|
|
err := s.get.QueryRow(id).Scan(&p.ParentID, &p.ParentTable, &p.Type, &optionTxt, &p.VoteCount)
|
2018-01-25 04:57:33 +00:00
|
|
|
if err != nil {
|
2019-06-16 06:30:58 +00:00
|
|
|
s.cache.Remove(id)
|
2018-01-25 04:57:33 +00:00
|
|
|
return err
|
|
|
|
}
|
2018-01-26 05:53:34 +00:00
|
|
|
|
2019-10-29 01:58:04 +00:00
|
|
|
err = json.Unmarshal(optionTxt, &p.Options)
|
2018-01-26 05:53:34 +00:00
|
|
|
if err != nil {
|
2019-06-16 06:30:58 +00:00
|
|
|
s.cache.Remove(id)
|
2018-01-26 05:53:34 +00:00
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
2019-10-29 01:58:04 +00:00
|
|
|
p.QuickOptions = s.unpackOptionsMap(p.Options)
|
|
|
|
_ = s.cache.Set(p)
|
2018-01-25 04:57:33 +00:00
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) unpackOptionsMap(rawOptions map[int]string) []PollOption {
|
2021-01-02 21:46:24 +00:00
|
|
|
opts := make([]PollOption, len(rawOptions))
|
|
|
|
for id, opt := range rawOptions {
|
|
|
|
opts[id] = PollOption{id, opt}
|
2018-01-26 05:53:34 +00:00
|
|
|
}
|
2021-01-02 21:46:24 +00:00
|
|
|
return opts
|
2018-01-26 05:53:34 +00:00
|
|
|
}
|
|
|
|
|
2018-01-28 14:30:24 +00:00
|
|
|
// TODO: Use a transaction for this
|
2021-01-02 21:46:24 +00:00
|
|
|
func (s *DefaultPollStore) Create(parent Pollable, pollType int, pollOptions map[int]string) (id int, e error) {
|
2020-02-20 11:28:49 +00:00
|
|
|
// TODO: Move the option names into the polls_options table and get rid of this json sludge?
|
2021-01-02 21:46:24 +00:00
|
|
|
pollOptionsTxt, e := json.Marshal(pollOptions)
|
|
|
|
if e != nil {
|
|
|
|
return 0, e
|
2018-01-26 05:53:34 +00:00
|
|
|
}
|
2021-01-02 21:46:24 +00:00
|
|
|
res, e := s.createPoll.Exec(parent.GetID(), parent.GetTable(), pollType, pollOptionsTxt)
|
|
|
|
if e != nil {
|
|
|
|
return 0, e
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
2021-01-02 21:46:24 +00:00
|
|
|
lastID, e := res.LastInsertId()
|
|
|
|
if e != nil {
|
|
|
|
return 0, e
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
2018-01-28 14:30:24 +00:00
|
|
|
|
|
|
|
for i := 0; i < len(pollOptions); i++ {
|
2021-01-02 21:46:24 +00:00
|
|
|
_, e := s.createPollOption.Exec(lastID, i)
|
|
|
|
if e != nil {
|
|
|
|
return 0, e
|
2018-01-28 14:30:24 +00:00
|
|
|
}
|
|
|
|
}
|
2019-12-07 06:27:01 +00:00
|
|
|
|
2019-10-29 01:58:04 +00:00
|
|
|
id = int(lastID)
|
|
|
|
return id, parent.SetPoll(id) // TODO: Delete the poll (and options) if SetPoll fails
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) SetCache(cache PollCache) {
|
|
|
|
s.cache = cache
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// TODO: We're temporarily doing this so that you can do ucache != nil in getTopicUser. Refactor it.
|
2019-06-16 06:30:58 +00:00
|
|
|
func (s *DefaultPollStore) GetCache() PollCache {
|
|
|
|
_, ok := s.cache.(*NullPollCache)
|
2018-01-25 04:57:33 +00:00
|
|
|
if ok {
|
|
|
|
return nil
|
|
|
|
}
|
2019-06-16 06:30:58 +00:00
|
|
|
return s.cache
|
2018-01-25 04:57:33 +00:00
|
|
|
}
|