yeah but there is still no cleavage
fun fact : the angle is now around 3" 26' which is just slightly over ¹/₂₀ of a degree !
bruh jury deliberation can take days , no need to check up on them every few minutes
to my knowledge disabled apps do not run so you must have misunderstood something
minor nitpick but the value of π is technically a parameter of the space you are operating in . which means it can have any arbitrary value as long as you are willing to operate in non euclidean spaces (and the space we live in is not euclidean though not to a measurable extent unless you are near a black hole)
but yeah in this context saying π is a constant is as correct as saying you cant take a square root out of a negative number .
edit : possibly better example is that a triangle's angles sum to 180°
I doubt it would affect Newpipe either honesty
No its microsofts database GUI program that's part of Microsoft Office . imagine software made for users who have a vague understanding of SQL and visual basic but then an exec. forced the designers and devs to make it accessible to everyone while giving them barely any teamembers causing a fuckton of technical debt and unintuitive quirks , making anyone who opens the software feel like they have just been placed in a highly equipped tank , in front of a wall of unlabeled levers and told to drive the tank , or at least that's how I view it.
(reposting from another account sorry if you see both comments)
sorry but I believe you are mistaken , there is both control and moderation on both the main fdroid repo and other repos .
other repos only include apps from a single project/dev
honestly , while I believe this is random=funny, I think it is interesting to interpret:
I believe that the person is a transmasc individual , who had a supportive grandma , but she died and he has been sent to conversion therapy by his unsupportive parents
alt
#include <type_traits>
// from https://stackoverflow.com/a/8625010/12469275
// cmath's sqrt is constexpr from c++26
constexpr std::size_t isqrt_impl
(std::size_t sq, std::size_t dlt, std::size_t value){
return sq <= value ?
isqrt_impl(sq+dlt, dlt+2, value) : (dlt >> 1) - 1;
}
constexpr std::size_t isqrt(std::size_t value){
return isqrt_impl(1, 3, value);
}
// because pack indexing is only in c++26
template <std::size_t I, typename T = void, std::size_t... V>
struct At;
template <std::size_t I>
struct At<I, void> {};
template <std::size_t V0, std::size_t... V>
struct At<0, void, V0, V...> {
static const std::size_t value = V0;
};
template <std::size_t I, std::size_t V0, std::size_t... V>
struct At<I, std::enable_if_t<I != 0 && I <= sizeof...(V),void>, V0, V...> {
static const std::size_t value = At<I-1, void, V...>::value;
};
template <std::size_t A, std::size_t B>
struct Add {
static const std::size_t value = A + B;
};
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t A, std::size_t B> typename R, std::size_t I, typename _, std::size_t... V>
struct _ReduceFor;
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t A, std::size_t B> typename R, std::size_t I, std::size_t... V>
struct _ReduceFor<begin, end, step, R, I, std::enable_if_t<(begin < end),void>, V...> {
typedef R<At<begin,void, V...>::value,_ReduceFor<begin+step, end, step, R, I, void, V...>::type::value> type;
};
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t A, std::size_t B> typename R, std::size_t I, std::size_t... V>
struct _ReduceFor<begin, end, step, R, I, std::enable_if_t<(begin >= end), void>, V...> {
typedef std::integral_constant<std::size_t,I> type;
};
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t A, std::size_t B> typename R, std::size_t I, std::size_t... V>
using ReduceFor = _ReduceFor<begin,end,step,R,I,void,V...>;
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t I, typename T> typename V, typename T, typename _>
struct AllFor;
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t I, typename T> typename V, typename T>
struct AllFor<begin, end, step, V, T, std::enable_if_t<(begin < end), void>> {
typedef std::enable_if_t<std::is_same<typename V<begin, bool>::type, bool>::value, typename AllFor<begin+step, end, step, V, T, void>::type> type;
};
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t I, typename T> typename V, typename T>
struct AllFor<begin, end, step, V, T, std::enable_if_t<(begin >= end), void>> {
typedef T type;
};
template <std::size_t begin, std::size_t end, std::size_t step, template<std::size_t I, typename T> typename V, typename T>
using AllFor_t = typename AllFor<begin, end, step, V, T, void>::type;
template <std::size_t S, typename T, std::size_t... V>
struct ValidRows {
template <std::size_t I, typename T2>
struct Inner {
typedef std::enable_if_t<ReduceFor<I, I+S, 1, Add, 0, V...>::type::value == S * (S*S + 1)/2, T2> type;
};
typedef AllFor_t<0, S*S, S, Inner, T> type;
};
template <std::size_t S, typename T, std::size_t... V>
struct ValidColumns {
template <std::size_t I, typename T2>
struct Inner {
typedef std::enable_if_t<ReduceFor<I, I+S*S, S, Add, 0, V...>::type::value == S * (S*S + 1)/2, T2> type;
};
typedef AllFor_t<0, S, 1, Inner, T> type;
};
template <std::size_t S, typename T, std::size_t... V>
struct ValidDiags {
typedef std::enable_if_t<ReduceFor<0,S*S,S+1,Add, 0, V...>::type::value == S * (S*S + 1)/2 && ReduceFor<S-1,S*S-1,S-1,Add, 0, V...>::type::value == S * (S*S + 1)/2, T> type;
};
template <typename T, std::size_t... V>
struct Unique;
template <typename T, std::size_t N, std::size_t... V>
struct Unique<T,N,V...> {
template <std::size_t I, typename T2>
struct Inner {
typedef std::enable_if_t<N != At<I,void,V...>::value,T2> type;
};
typedef AllFor_t<0,sizeof...(V),1,Inner,T> type;
};
template <typename T, std::size_t V>
struct Unique<T, V> {
typedef T type;
};
template <typename T, std::size_t... V>
struct InRange {
template <std::size_t I, typename T2>
struct Inner {
typedef typename std::enable_if<1 <= At<I,void, V...>::value && At<I,void,V...>::value <= sizeof...(V), T2>::type type;
};
typedef AllFor_t<0,sizeof...(V),1,Inner,T> type;
};
template <typename T, std::size_t... V>
struct Grid {
static const std::size_t S = isqrt(sizeof...(V));
typedef std::enable_if_t<S*S == sizeof...(V), typename ValidRows<S, typename ValidColumns<S, typename ValidDiags<S, typename Unique<typename InRange<T,V...>::type, V...>::type, V...>::type, V...>::type, V...>::type> type;
};
using ok = Grid<void,
2, 7, 6,
9, 5, 1,
4, 3, 8>::type;
int main() {}
TL;DR: Grid<A,B,C,D,E,F,G,H> simplifies to true, if and only if it is a 3x3 magic square.
full explanation
Fifteen is an array of length 15T<A,B,C> checks if an array of length A+B+C is equivalent to an array of length 15, thus checking if A+B+C is equal to 15And<A,X> is simplifies to X if A is true, else it simplifies to falseDf<A,B,X> checks if A and B are Diffrent , simplifying to X if they areGrid<A,B,C,D,E,F,G,H> first checks if every row, column and diagonal is equal to 15, then checks if every item is unique.
I mean I know its likely gonna change once the big waves wash over but still.
Alt: Drake meme template but with a anime girl. Top row with the girl gesturing approvingly says: if reddit is gonna kill 3rd party clients then I'm just gonna switch to Lemmy. Bottom row, with the girl showing distress, says: there arent as many funny trans people on Lemmy rn
I genuinely can't tell if this is a joke or not , but I really hope it is because its so perfect