mirror of
				https://github.com/superseriousbusiness/gotosocial.git
				synced 2025-10-31 12:12:25 -05:00 
			
		
		
		
	
		
			
	
	
		
			439 lines
		
	
	
	
		
			11 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
		
		
			
		
	
	
			439 lines
		
	
	
	
		
			11 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
|  | /* | ||
|  |    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 timeline_test | ||
|  | 
 | ||
|  | import ( | ||
|  | 	"testing" | ||
|  | 	"time" | ||
|  | 
 | ||
|  | 	"github.com/stretchr/testify/suite" | ||
|  | 	"github.com/superseriousbusiness/gotosocial/internal/timeline" | ||
|  | 	"github.com/superseriousbusiness/gotosocial/testrig" | ||
|  | ) | ||
|  | 
 | ||
|  | type GetTestSuite struct { | ||
|  | 	TimelineStandardTestSuite | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) SetupSuite() { | ||
|  | 	suite.testAccounts = testrig.NewTestAccounts() | ||
|  | 	suite.testStatuses = testrig.NewTestStatuses() | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) SetupTest() { | ||
|  | 	suite.config = testrig.NewTestConfig() | ||
|  | 	suite.db = testrig.NewTestDB() | ||
|  | 	suite.log = testrig.NewTestLog() | ||
|  | 	suite.tc = testrig.NewTestTypeConverter(suite.db) | ||
|  | 
 | ||
|  | 	testrig.StandardDBSetup(suite.db, nil) | ||
|  | 
 | ||
|  | 	// let's take local_account_1 as the timeline owner | ||
|  | 	tl, err := timeline.NewTimeline(suite.testAccounts["local_account_1"].ID, suite.db, suite.tc, suite.log) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// prepare the timeline by just shoving all test statuses in it -- let's not be fussy about who sees what | ||
|  | 	for _, s := range suite.testStatuses { | ||
|  | 		_, err := tl.IndexAndPrepareOne(s.CreatedAt, s.ID, s.BoostOfID, s.AccountID, s.BoostOfAccountID) | ||
|  | 		if err != nil { | ||
|  | 			suite.FailNow(err.Error()) | ||
|  | 		} | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.timeline = tl | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TearDownTest() { | ||
|  | 	testrig.StandardDBTeardown(suite.db) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetDefault() { | ||
|  | 	// get 10 20 the top and don't prepare the next query | ||
|  | 	statuses, err := suite.timeline.Get(20, "", "", "", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we only have 12 statuses in the test suite | ||
|  | 	suite.Len(statuses, 12) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetDefaultPrepareNext() { | ||
|  | 	// get 10 from the top and prepare the next query | ||
|  | 	statuses, err := suite.timeline.Get(10, "", "", "", true) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.Len(statuses, 10) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// sleep a second so the next query can run | ||
|  | 	time.Sleep(1 * time.Second) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetMaxID() { | ||
|  | 	// ask for 10 with a max ID somewhere in the middle of the stack | ||
|  | 	statuses, err := suite.timeline.Get(10, "01F8MHBQCBTDKN6X5VHGMMN4MA", "", "", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 6 statuses back, since we asked for a max ID that excludes some of our entries | ||
|  | 	suite.Len(statuses, 6) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetMaxIDPrepareNext() { | ||
|  | 	// ask for 10 with a max ID somewhere in the middle of the stack | ||
|  | 	statuses, err := suite.timeline.Get(10, "01F8MHBQCBTDKN6X5VHGMMN4MA", "", "", true) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 6 statuses back, since we asked for a max ID that excludes some of our entries | ||
|  | 	suite.Len(statuses, 6) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// sleep a second so the next query can run | ||
|  | 	time.Sleep(1 * time.Second) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetMinID() { | ||
|  | 	// ask for 10 with a min ID somewhere in the middle of the stack | ||
|  | 	statuses, err := suite.timeline.Get(10, "", "01F8MHBQCBTDKN6X5VHGMMN4MA", "", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 5 statuses back, since we asked for a min ID that excludes some of our entries | ||
|  | 	suite.Len(statuses, 5) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetSinceID() { | ||
|  | 	// ask for 10 with a since ID somewhere in the middle of the stack | ||
|  | 	statuses, err := suite.timeline.Get(10, "", "", "01F8MHBQCBTDKN6X5VHGMMN4MA", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 5 statuses back, since we asked for a since ID that excludes some of our entries | ||
|  | 	suite.Len(statuses, 5) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetSinceIDPrepareNext() { | ||
|  | 	// ask for 10 with a since ID somewhere in the middle of the stack | ||
|  | 	statuses, err := suite.timeline.Get(10, "", "", "01F8MHBQCBTDKN6X5VHGMMN4MA", true) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 5 statuses back, since we asked for a since ID that excludes some of our entries | ||
|  | 	suite.Len(statuses, 5) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// sleep a second so the next query can run | ||
|  | 	time.Sleep(1 * time.Second) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetBetweenID() { | ||
|  | 	// ask for 10 between these two IDs | ||
|  | 	statuses, err := suite.timeline.Get(10, "01F8MHCP5P2NWYQ416SBA0XSEV", "", "01F8MHBQCBTDKN6X5VHGMMN4MA", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 2 statuses back, since there are only two statuses between the given IDs | ||
|  | 	suite.Len(statuses, 2) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetBetweenIDPrepareNext() { | ||
|  | 	// ask for 10 between these two IDs | ||
|  | 	statuses, err := suite.timeline.Get(10, "01F8MHCP5P2NWYQ416SBA0XSEV", "", "01F8MHBQCBTDKN6X5VHGMMN4MA", true) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should only get 2 statuses back, since there are only two statuses between the given IDs | ||
|  | 	suite.Len(statuses, 2) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// sleep a second so the next query can run | ||
|  | 	time.Sleep(1 * time.Second) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXFromTop() { | ||
|  | 	// get 5 from the top | ||
|  | 	statuses, err := suite.timeline.GetXFromTop(5) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.Len(statuses, 5) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBehindID() { | ||
|  | 	// get 3 behind the 'middle' id | ||
|  | 	var attempts *int | ||
|  | 	a := 0 | ||
|  | 	attempts = &a | ||
|  | 	statuses, err := suite.timeline.GetXBehindID(3, "01F8MHBQCBTDKN6X5VHGMMN4MA", attempts) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.Len(statuses, 3) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	// all status IDs should be less than the behindID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 		suite.Less(s.ID, "01F8MHBQCBTDKN6X5VHGMMN4MA") | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBehindID0() { | ||
|  | 	// try to get behind 0, the lowest possible ID | ||
|  | 	var attempts *int | ||
|  | 	a := 0 | ||
|  | 	attempts = &a | ||
|  | 	statuses, err := suite.timeline.GetXBehindID(3, "0", attempts) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// there's nothing beyond it so len should be 0 | ||
|  | 	suite.Len(statuses, 0) | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBehindNonexistentReasonableID() { | ||
|  | 	// try to get behind an id that doesn't exist, but is close to one that does so we should still get statuses back | ||
|  | 	var attempts *int | ||
|  | 	a := 0 | ||
|  | 	attempts = &a | ||
|  | 	statuses, err := suite.timeline.GetXBehindID(3, "01F8MHBQCBTDKN6X5VHGMMN4MB", attempts) // change the last A to a B | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 	suite.Len(statuses, 3) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	// all status IDs should be less than the behindID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 		suite.Less(s.ID, "01F8MHBCN8120SYH7D5S050MGK") | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBehindVeryHighID() { | ||
|  | 	// try to get behind an id that doesn't exist, and is higher than any other ID we could possibly have | ||
|  | 	var attempts *int | ||
|  | 	a := 0 | ||
|  | 	attempts = &a | ||
|  | 	statuses, err := suite.timeline.GetXBehindID(7, "9998MHBQCBTDKN6X5VHGMMN4MA", attempts) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	// we should get all 7 statuses we asked for because they all have lower IDs than the very high ID given in the query | ||
|  | 	suite.Len(statuses, 7) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	// all status IDs should be less than the behindID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 		suite.Less(s.ID, "9998MHBQCBTDKN6X5VHGMMN4MA") | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBeforeID() { | ||
|  | 	// get 3 before the 'middle' id | ||
|  | 	statuses, err := suite.timeline.GetXBeforeID(3, "01F8MHBQCBTDKN6X5VHGMMN4MA", true) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.Len(statuses, 3) | ||
|  | 
 | ||
|  | 	// statuses should be sorted highest to lowest ID | ||
|  | 	// all status IDs should be greater than the beforeID | ||
|  | 	var highest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			highest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Less(s.ID, highest) | ||
|  | 			highest = s.ID | ||
|  | 		} | ||
|  | 		suite.Greater(s.ID, "01F8MHBQCBTDKN6X5VHGMMN4MA") | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func (suite *GetTestSuite) TestGetXBeforeIDNoStartFromTop() { | ||
|  | 	// get 3 before the 'middle' id | ||
|  | 	statuses, err := suite.timeline.GetXBeforeID(3, "01F8MHBQCBTDKN6X5VHGMMN4MA", false) | ||
|  | 	if err != nil { | ||
|  | 		suite.FailNow(err.Error()) | ||
|  | 	} | ||
|  | 
 | ||
|  | 	suite.Len(statuses, 3) | ||
|  | 
 | ||
|  | 	// statuses should be sorted lowest to highest ID | ||
|  | 	// all status IDs should be greater than the beforeID | ||
|  | 	var lowest string | ||
|  | 	for i, s := range statuses { | ||
|  | 		if i == 0 { | ||
|  | 			lowest = s.ID | ||
|  | 		} else { | ||
|  | 			suite.Greater(s.ID, lowest) | ||
|  | 			lowest = s.ID | ||
|  | 		} | ||
|  | 		suite.Greater(s.ID, "01F8MHBQCBTDKN6X5VHGMMN4MA") | ||
|  | 	} | ||
|  | } | ||
|  | 
 | ||
|  | func TestGetTestSuite(t *testing.T) { | ||
|  | 	suite.Run(t, new(GetTestSuite)) | ||
|  | } |