-
Notifications
You must be signed in to change notification settings - Fork 6
/
presence.go
140 lines (124 loc) · 3.85 KB
/
presence.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
// Copyright 2015 Ericsson AB
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package events
import (
"sync"
"sync/atomic"
"github.com/matrix-org/bullettime/core/types"
"github.com/matrix-org/bullettime/matrix/interfaces"
matrixTypes "github.com/matrix-org/bullettime/matrix/types"
)
type presenceStream struct {
lock sync.RWMutex
events map[types.UserId]indexedPresenceEvent
max uint64
members interfaces.MembershipStore
asyncEventSink interfaces.AsyncEventSink
}
type indexedPresenceEvent struct {
event matrixTypes.PresenceEvent
index uint64
}
func (m *indexedPresenceEvent) Event() types.Event {
return &m.event
}
func (s *indexedPresenceEvent) Index() uint64 {
return s.index
}
type updateFunc func(*matrixTypes.User)
func NewPresenceStream(
members interfaces.MembershipStore,
asyncEventSink interfaces.AsyncEventSink,
) (interfaces.PresenceStream, error) {
return &presenceStream{
events: map[types.UserId]indexedPresenceEvent{},
members: members,
asyncEventSink: asyncEventSink,
}, nil
}
func (s *presenceStream) SetUserProfile(userId types.UserId, profile matrixTypes.UserProfile) (types.IndexedEvent, matrixTypes.Error) {
return s.update(userId, func(user *matrixTypes.User) {
user.UserProfile = profile
})
}
func (s *presenceStream) SetUserStatus(userId types.UserId, status matrixTypes.UserStatus) (types.IndexedEvent, matrixTypes.Error) {
return s.update(userId, func(user *matrixTypes.User) {
user.UserStatus = status
})
}
func (s *presenceStream) update(userId types.UserId, updateFunc updateFunc) (types.IndexedEvent, matrixTypes.Error) {
s.lock.Lock()
defer s.lock.Unlock()
indexed, existed := s.events[userId]
if !existed {
indexed.event.Content.UserId = userId
indexed.event.EventType = matrixTypes.EventTypePresence
}
updateFunc(&indexed.event.Content)
index := atomic.AddUint64(&s.max, 1) - 1
indexed.index = index
s.events[userId] = indexed
peerSet, err := s.members.Peers(userId)
if err != nil {
return nil, err
}
peers := make([]types.UserId, len(peerSet))
for peer := range peerSet {
peers = append(peers, peer)
}
s.asyncEventSink.Send(peers, &indexed)
return &indexed, nil
}
func (s *presenceStream) Profile(user types.UserId) (matrixTypes.UserProfile, matrixTypes.Error) {
s.lock.RLock()
defer s.lock.RUnlock()
if indexed, ok := s.events[user]; ok {
return indexed.event.Content.UserProfile, nil
}
return matrixTypes.UserProfile{}, nil
}
func (s *presenceStream) Status(user types.UserId) (matrixTypes.UserStatus, matrixTypes.Error) {
s.lock.RLock()
defer s.lock.RUnlock()
if indexed, ok := s.events[user]; ok {
return indexed.event.Content.UserStatus, nil
}
return matrixTypes.UserStatus{}, nil
}
func (s *presenceStream) Max() uint64 {
return atomic.LoadUint64(&s.max)
}
// Ignores user, roomSet, and limit
func (s *presenceStream) Range(
_ *types.UserId,
userSet map[types.UserId]struct{},
roomSet map[types.RoomId]struct{},
from, to uint64,
limit uint,
) ([]types.IndexedEvent, matrixTypes.Error) {
var result []types.IndexedEvent
if len(userSet) == 0 || from >= to {
return result, nil
}
s.lock.RLock()
defer s.lock.RUnlock()
result = make([]types.IndexedEvent, 0, len(userSet))
for user := range userSet {
event := s.events[user]
if event.index >= from && event.index < to {
result = append(result, &event)
}
}
return result, nil
}