StackOverflow2013

Note that there are some explanatory texts on larger screens.

plurals

PO
primarykey
Id
18802750
data
AcceptedAnswerId
0
AnswerCount
0
ClosedDate
CommentCount
0
CommunityOwnedDate
CreationDate
2013-09-14T14:25:08.123
FavoriteCount
0
LastActivityDate
2018-01-10T04:09:33.400
LastEditDate
2018-01-10T04:09:33.400
LastEditorUserId
402891
OwnerUserId
1609356
ParentId
18753765
PostTypeId
2
Score
3
ViewCount
0
LastEditorDisplayName
text
Body
Finally I have implemented the <code>sin</code> metafunction through Taylor series, using series of 10 terms by default (Could be configurable). I have based my implementation in <a href="https://web.archive.org/web/20131010041400/http://www10.informatik.uni-erlangen.de/~pflaum/pflaum/ProSeminar/meta-art.html" rel="nofollow noreferrer">this interesting article</a>. My library includes an implementation of a tmp for loop using iterators, and <a href="https://stackoverflow.com/questions/18688678/disabling-operators-overloads-if-a-given-template-is-not-specialized-for-the-ope">expression templates to allow write complex expressions in a "clear" way</a> (Clear compared to the common template-meta-programming syntax <code>add<mul<sub<1,2>>></code>...). This allows me to literally copy-paste the C implementation provided by the article: <pre><code>template<typename T , typename TERMS_COUNT = mpl::uinteger<4>> struct sin_t; template<typename T , typename TERMS_COUNT = mpl::uinteger<4>> using sin = typename sin_t<T,TERMS_COUNT>::result; /* * sin() function implementation through Taylor series (Check http://www10.informatik.uni-erlangen.de/~pflaum/pflaum/ProSeminar/meta-art.html) * * The C equivalent code is: * * // Calculate sin(x) using j terms * float sine(float x, int j) * { * float val = 1; * * for (int k = j - 1; k >= 0; --k) * val = 1 - x*x/(2*k+2)/(2*k+3)*val; * * return x * val; * } */ template<mpl::fpbits BITS , mpl::fbcount PRECISION , unsigned int TERMS_COUNT> struct sin_t<mpl::fixed_point<BITS,PRECISION>,mpl::uinteger<TERMS_COUNT>> { private: using x = mpl::fixed_point<BITS,PRECISION>; using begin = mpl::make_integer_backward_iterator<TERMS_COUNT-1>; using end = mpl::make_integer_backward_iterator<-1>; using one = mpl::decimal<1,0,PRECISION>; using two = mpl::decimal<2,0,PRECISION>; using three = mpl::decimal<3,0,PRECISION>; template<typename K , typename VAL> struct kernel : public mpl::function<decltype( one() - ( x() * x() )/(two() * K() + two())/(two()*K()+three())*VAL() )> {}; public: using result = decltype( x() * mpl::for_loop<begin , end , one , kernel>() ); }; </code></pre> <a href="https://github.com/Manu343726/Turbo/blob/ad6ca3188bd68f27db1b49417c4c03ff1dd2186e/trigonometry.hpp" rel="nofollow noreferrer">Here</a> is the header of the implementation in the project repo.
Tags
Title
singulars
PostAcceptedAnswerId
1. This table or related slice is empty.
PostParentId
1. POSimple trigonometric algorithm to compute sin() and cos() of fixed-point numbers
 singulars
 PostTypePostTypeId
 PTQuestion
PostTypePostTypeId
1. PTAnswer
UserLastEditorUserId
1. USinterfect
UserOwnerUserId
1. USManu343726
plurals
PostLinksPostIdRelatedPostId
1. This table or related slice is empty.
PostLinksRelatedPostIdPostId
1. This table or related slice is empty.
PostsAcceptedAnswerId
1. POSimple trigonometric algorithm to compute sin() and cos() of fixed-point numbers
 singulars
 PostTypePostTypeId
 PTQuestion
PostsParentIdCreationDate
1. This table or related slice is empty.
VotesPostIdCreationDate
1. VO
 singulars
 PostPostId
 PO
 UserUserId
 This table or related slice is empty.
 VoteTypeVoteTypeId
 VTAcceptedByOriginator
CommentsPostId
1. This table or related slice is empty.

Querying!

Guidance

A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.