diff options
| author | 2021-08-25 15:34:33 +0200 | |
|---|---|---|
| committer | 2021-08-25 15:34:33 +0200 | |
| commit | 2dc9fc1626507bb54417fc4a1920b847cafb27a2 (patch) | |
| tree | 4ddeac479b923db38090aac8bd9209f3646851c1 /internal/db/pg/timeline.go | |
| parent | Manually approves followers (#146) (diff) | |
| download | gotosocial-2dc9fc1626507bb54417fc4a1920b847cafb27a2.tar.xz | |
Pg to bun (#148)
* start moving to bun
* changing more stuff
* more
* and yet more
* tests passing
* seems stable now
* more big changes
* small fix
* little fixes
Diffstat (limited to 'internal/db/pg/timeline.go')
| -rw-r--r-- | internal/db/pg/timeline.go | 210 |
1 files changed, 0 insertions, 210 deletions
diff --git a/internal/db/pg/timeline.go b/internal/db/pg/timeline.go deleted file mode 100644 index fa8b07aab..000000000 --- a/internal/db/pg/timeline.go +++ /dev/null @@ -1,210 +0,0 @@ -/* - GoToSocial - Copyright (C) 2021 GoToSocial Authors admin@gotosocial.org - - This program is free software: you can redistribute it and/or modify - it under the terms of the GNU Affero General Public License as published by - the Free Software Foundation, either version 3 of the License, or - (at your option) any later version. - - This program is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the - GNU Affero General Public License for more details. - - You should have received a copy of the GNU Affero General Public License - along with this program. If not, see <http://www.gnu.org/licenses/>. -*/ - -package pg - -import ( - "context" - "sort" - - "github.com/go-pg/pg/v10" - "github.com/sirupsen/logrus" - "github.com/superseriousbusiness/gotosocial/internal/config" - "github.com/superseriousbusiness/gotosocial/internal/db" - "github.com/superseriousbusiness/gotosocial/internal/gtsmodel" -) - -type timelineDB struct { - config *config.Config - conn *pg.DB - log *logrus.Logger - cancel context.CancelFunc -} - -func (t *timelineDB) GetHomeTimeline(accountID string, maxID string, sinceID string, minID string, limit int, local bool) ([]*gtsmodel.Status, db.Error) { - statuses := []*gtsmodel.Status{} - q := t.conn.Model(&statuses) - - q = q.ColumnExpr("status.*"). - // Find out who accountID follows. - Join("LEFT JOIN follows AS f ON f.target_account_id = status.account_id"). - // Use a WhereGroup here to specify that we want EITHER statuses posted by accounts that accountID follows, - // OR statuses posted by accountID itself (since a user should be able to see their own statuses). - // - // This is equivalent to something like WHERE ... AND (... OR ...) - // See: https://pg.uptrace.dev/queries/#select - WhereGroup(func(q *pg.Query) (*pg.Query, error) { - q = q.WhereOr("f.account_id = ?", accountID). - WhereOr("status.account_id = ?", accountID) - return q, nil - }). - // Sort by highest ID (newest) to lowest ID (oldest) - Order("status.id DESC") - - if maxID != "" { - // return only statuses LOWER (ie., older) than maxID - q = q.Where("status.id < ?", maxID) - } - - if sinceID != "" { - // return only statuses HIGHER (ie., newer) than sinceID - q = q.Where("status.id > ?", sinceID) - } - - if minID != "" { - // return only statuses HIGHER (ie., newer) than minID - q = q.Where("status.id > ?", minID) - } - - if local { - // return only statuses posted by local account havers - q = q.Where("status.local = ?", local) - } - - if limit > 0 { - // limit amount of statuses returned - q = q.Limit(limit) - } - - err := q.Select() - if err != nil { - if err == pg.ErrNoRows { - return nil, db.ErrNoEntries - } - return nil, err - } - - if len(statuses) == 0 { - return nil, db.ErrNoEntries - } - - return statuses, nil -} - -func (t *timelineDB) GetPublicTimeline(accountID string, maxID string, sinceID string, minID string, limit int, local bool) ([]*gtsmodel.Status, db.Error) { - statuses := []*gtsmodel.Status{} - - q := t.conn.Model(&statuses). - Where("visibility = ?", gtsmodel.VisibilityPublic). - Where("? IS NULL", pg.Ident("in_reply_to_id")). - Where("? IS NULL", pg.Ident("in_reply_to_uri")). - Where("? IS NULL", pg.Ident("boost_of_id")). - Order("status.id DESC") - - if maxID != "" { - q = q.Where("status.id < ?", maxID) - } - - if sinceID != "" { - q = q.Where("status.id > ?", sinceID) - } - - if minID != "" { - q = q.Where("status.id > ?", minID) - } - - if local { - q = q.Where("status.local = ?", local) - } - - if limit > 0 { - q = q.Limit(limit) - } - - err := q.Select() - if err != nil { - if err == pg.ErrNoRows { - return nil, db.ErrNoEntries - } - return nil, err - } - - if len(statuses) == 0 { - return nil, db.ErrNoEntries - } - - return statuses, nil -} - -// TODO optimize this query and the logic here, because it's slow as balls -- it takes like a literal second to return with a limit of 20! -// It might be worth serving it through a timeline instead of raw DB queries, like we do for Home feeds. -func (t *timelineDB) GetFavedTimeline(accountID string, maxID string, minID string, limit int) ([]*gtsmodel.Status, string, string, db.Error) { - - faves := []*gtsmodel.StatusFave{} - - fq := t.conn.Model(&faves). - Where("account_id = ?", accountID). - Order("id DESC") - - if maxID != "" { - fq = fq.Where("id < ?", maxID) - } - - if minID != "" { - fq = fq.Where("id > ?", minID) - } - - if limit > 0 { - fq = fq.Limit(limit) - } - - err := fq.Select() - if err != nil { - if err == pg.ErrNoRows { - return nil, "", "", db.ErrNoEntries - } - return nil, "", "", err - } - - if len(faves) == 0 { - return nil, "", "", db.ErrNoEntries - } - - // map[statusID]faveID -- we need this to sort statuses by fave ID rather than their own ID - statusesFavesMap := map[string]string{} - - in := []string{} - for _, f := range faves { - statusesFavesMap[f.StatusID] = f.ID - in = append(in, f.StatusID) - } - - statuses := []*gtsmodel.Status{} - err = t.conn.Model(&statuses).Where("id IN (?)", pg.In(in)).Select() - if err != nil { - if err == pg.ErrNoRows { - return nil, "", "", db.ErrNoEntries - } - return nil, "", "", err - } - - if len(statuses) == 0 { - return nil, "", "", db.ErrNoEntries - } - - // arrange statuses by fave ID - sort.Slice(statuses, func(i int, j int) bool { - statusI := statuses[i] - statusJ := statuses[j] - return statusesFavesMap[statusI.ID] < statusesFavesMap[statusJ.ID] - }) - - nextMaxID := faves[len(faves)-1].ID - prevMinID := faves[0].ID - return statuses, nextMaxID, prevMinID, nil -} |
