2018-04-10 04:38:41 +02:00
|
|
|
// Matrix Construct
|
|
|
|
//
|
|
|
|
// Copyright (C) Matrix Construct Developers, Authors & Contributors
|
|
|
|
// Copyright (C) 2016-2018 Jason Volk <jason@zemos.net>
|
|
|
|
//
|
|
|
|
// Permission to use, copy, modify, and/or distribute this software for any
|
|
|
|
// purpose with or without fee is hereby granted, provided that the above
|
|
|
|
// copyright notice and this permission notice is present in all copies. The
|
|
|
|
// full license for this software is available in the LICENSE file.
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
#define HAVE_IRCD_M_ROOMS_H
|
|
|
|
|
2018-10-24 23:01:21 +02:00
|
|
|
/// Convenience iterface for rooms; utilities for the server's collection of
|
|
|
|
/// rooms and some rooms list related linkages.
|
2018-04-10 04:38:41 +02:00
|
|
|
///
|
|
|
|
namespace ircd::m::rooms
|
|
|
|
{
|
2019-04-18 05:35:34 +02:00
|
|
|
struct each_opts;
|
2018-10-24 23:15:36 +02:00
|
|
|
|
2019-03-01 23:51:30 +01:00
|
|
|
bool is_public(const room::id &);
|
2019-04-18 05:35:34 +02:00
|
|
|
size_t count_public(const string_view &server = {});
|
|
|
|
|
|
|
|
bool for_each(const each_opts &);
|
|
|
|
template<class... args> bool for_each(args&&...);
|
2018-10-24 23:22:10 +02:00
|
|
|
|
2018-10-24 23:01:21 +02:00
|
|
|
// Linkage to utils that build a publicrooms summary from room state.
|
|
|
|
void summary_chunk(const m::room &, json::stack::object &chunk);
|
|
|
|
json::object summary_chunk(const m::room &, const mutable_buffer &out);
|
2018-10-25 02:51:33 +02:00
|
|
|
event::id::buf summary_set(const m::room::id &, const json::object &summary);
|
|
|
|
event::id::buf summary_set(const m::room &);
|
2019-03-14 23:07:19 +01:00
|
|
|
event::id::buf summary_del(const m::room &);
|
2019-06-18 08:05:31 +02:00
|
|
|
std::pair<size_t, std::string> fetch_update(const net::hostport &, const string_view &since = {}, const size_t &limit = 64);
|
2018-04-10 04:38:41 +02:00
|
|
|
}
|
2019-04-18 05:35:34 +02:00
|
|
|
|
|
|
|
/// Arguments structure to rooms::for_each(). This reduces the API surface to
|
|
|
|
/// handle a rich set of ways to iterate over the rooms. Several convenience
|
|
|
|
/// constructors based on common usage are provided; note that these are not
|
|
|
|
/// the only options patterns.
|
|
|
|
struct ircd::m::rooms::each_opts
|
|
|
|
{
|
|
|
|
/// If set, seek to this room_id or lower-bound to the closest room_id.
|
|
|
|
string_view key;
|
|
|
|
|
|
|
|
/// All public rooms only; key may be a server hostname or room_id.
|
|
|
|
/// - for server hostname: iterates known rooms from that server.
|
|
|
|
/// - for room_id: starts iteration from that (or closest) room_id
|
|
|
|
/// which can be used as a since/pagination token.
|
|
|
|
bool public_rooms {false};
|
|
|
|
|
|
|
|
/// Principal closure for results; invoked synchronously during the call;
|
|
|
|
/// for-each protocol: return true to continue, false to break.
|
|
|
|
room::id::closure_bool closure;
|
|
|
|
|
|
|
|
each_opts(room::id::closure_bool);
|
|
|
|
each_opts(const string_view &key, room::id::closure_bool);
|
|
|
|
each_opts() = default;
|
|
|
|
};
|
|
|
|
|
|
|
|
inline
|
|
|
|
ircd::m::rooms::each_opts::each_opts(room::id::closure_bool closure)
|
|
|
|
:closure{std::move(closure)}
|
|
|
|
{}
|
|
|
|
|
|
|
|
inline
|
|
|
|
ircd::m::rooms::each_opts::each_opts(const string_view &key,
|
|
|
|
room::id::closure_bool closure)
|
|
|
|
:key{key}
|
|
|
|
,closure{std::move(closure)}
|
|
|
|
{}
|
|
|
|
|
|
|
|
template<class... args>
|
|
|
|
bool
|
|
|
|
ircd::m::rooms::for_each(args&&... a)
|
|
|
|
{
|
|
|
|
const each_opts opts
|
|
|
|
{
|
|
|
|
std::forward<args>(a)...
|
|
|
|
};
|
|
|
|
|
|
|
|
return for_each(opts);
|
|
|
|
}
|