C++17 implementation Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern) Announcing the arrival of Valued Associate #679: Cesar Manara Unicorn Meta Zoo #1: Why another podcast?Array-like container for uints shorter than 8 bits (Rev 1)C++ choose between runtime and compile time implementation functionsGeneric implementation of an array viewGeneric implementation of an HeapArray and StackArrayMath Vector Header Library Templated on Data Type and SizeParsing oscilloscope binary data file with C++C++ std::array wrapperImplementation of has_member_functionstd::array implementationC++17 is_integral trait implementation
What does Turing mean by this statement?
How to change the tick of the color bar legend to black
How were pictures turned from film to a big picture in a picture frame before digital scanning?
How can I prevent/balance waiting and turtling as a response to cooldown mechanics
Simple HTTP Server
Flight departed from the gate 5 min before scheduled departure time. Refund options
The Nth Gryphon Number
One-one communication
What would you call this weird metallic apparatus that allows you to lift people?
Central Vacuuming: Is it worth it, and how does it compare to normal vacuuming?
How much damage would a cupful of neutron star matter do to the Earth?
In musical terms, what properties are varied by the human voice to produce different words / syllables?
What initially awakened the Balrog?
Special flights
Why are vacuum tubes still used in amateur radios?
Why is a lens darker than other ones when applying the same settings?
Can two people see the same photon?
How often does castling occur in grandmaster games?
i2c bus hangs in master RPi access to MSP430G uC ~1 in 1000 accesses
What are the main differences between the original Stargate SG-1 and the Final Cut edition?
Simple Line in LaTeX Help!
Did any compiler fully use 80-bit floating point?
Why not send Voyager 3 and 4 following up the paths taken by Voyager 1 and 2 to re-transmit signals of later as they fly away from Earth?
Did Mueller's report provide an evidentiary basis for the claim of Russian govt election interference via social media?
C++17 implementation
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)
Announcing the arrival of Valued Associate #679: Cesar Manara
Unicorn Meta Zoo #1: Why another podcast?Array-like container for uints shorter than 8 bits (Rev 1)C++ choose between runtime and compile time implementation functionsGeneric implementation of an array viewGeneric implementation of an HeapArray and StackArrayMath Vector Header Library Templated on Data Type and SizeParsing oscilloscope binary data file with C++C++ std::array wrapperImplementation of has_member_functionstd::array implementationC++17 is_integral trait implementation
.everyoneloves__top-leaderboard:empty,.everyoneloves__mid-leaderboard:empty,.everyoneloves__bot-mid-leaderboard:empty margin-bottom:0;
$begingroup$
C++20 added the span
library under the header <span>
.
As voluntary exercise (not homework!),
I spent approximately 1.5 hours implement it under C++17.
Please tell me if I used stuff that is not available under C++17.
Most stuff is in the namespace ::my_std
, but tuple_size
, etc. are in the namespace ::std
, otherwise they are useless. The ::my_std::span_detail
namespace contains implementation details that are not to be exposed.
I used the C++ standard draft, HTML version as a reference.
Here is my code, within 400 lines:
// a C++17 implementation of <span>
#ifndef INC_SPAN_HPP_c2GLAK6Onz
#define INC_SPAN_HPP_c2GLAK6Onz
#include <array> // for std::array, etc.
#include <cassert> // for assert
#include <cstddef> // for std::size_t, etc.
#include <iterator> // for std::reverse_iterator, etc.
#include <type_traits> // for std::enable_if, etc.
#define CONSTRAINT(...)
std::enable_if_t<(__VA_ARGS__), int> = 0
#define EXPECTS(...)
assert((__VA_ARGS__))
namespace my_std
// constants
// equivalent to std::numeric_limits<std::size_t>::max()
inline constexpr std::size_t dynamic_extent = -1;
// class template span
template <class T, std::size_t N = dynamic_extent>
class span;
namespace span_detail
// detect specializations of span
template <class T>
struct is_span :std::false_type ;
template <class T, std::size_t N>
struct is_span<span<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_span_v = is_span<T>::value;
// detect specializations of std::array
template <class T>
struct is_array :std::false_type ;
template <class T, std::size_t N>
struct is_array<std::array<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_array_v = is_array<T>::value;
// ADL-aware data() and size()
using std::data;
using std::size;
template <class C>
constexpr decltype(auto) my_data(C& c)
return data(c);
template <class C>
constexpr decltype(auto) my_size(C& c)
return size(c);
// detect container
template <class C, class = void>
struct is_cont :std::false_type ;
template <class C>
struct is_cont<C,
std::void_t<
std::enable_if_t<!is_span_v<C>>,
std::enable_if_t<!is_array_v<C>>,
std::enable_if_t<!std::is_array_v<C>>,
decltype(data(std::declval<C>())),
decltype(size(std::declval<C>()))
>> :std::true_type ;
template <class C>
inline constexpr bool is_cont_v = is_cont<C>::value;
template <class T, std::size_t N>
class span N == M
&& std::is_convertible_v<std::remove_pointer_t<decltype(span_detail::my_data(std::declval<T(&)[M]>()))>(*)[], T(*)[]>)>
constexpr span(T (&arr)[M]) noexcept
: size_M, data_arr
template <std::size_t M,
CONSTRAINT(N == dynamic_extent ;
// deduction guide
template <class T, std::size_t N>
span(T (&)[N]) -> span<T, N>;
template <class T, std::size_t N>
span(std::array<T, N>&) -> span<T, N>;
template <class T, std::size_t N>
span(const std::array<T, N>&) -> span<const T, N>;
template <class Cont>
span(Cont&) -> span<typename Cont::value_type>;
template <class Cont>
span(const Cont&) -> span<const typename Cont::value_type>;
// views of objects representation
template <class T, std::size_t N>
auto as_bytes(span<T, N> s) noexcept
-> span<const std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<const std::byte*>(s.data()), s.size_bytes();
template <class T, std::size_t N,
CONSTRAINT(!std::is_const_v<T>)>
auto as_writable_bytes(span<T, N> s) noexcept
-> span<std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<std::byte*>(s.data()), s.size_bytes();
namespace std
// tuple interface
// the primary template declarations are included in <array>
template <class T, std::size_t N>
struct tuple_size<my_std::span<T, N>>
: std::integral_constant<std::size_t, N> ;
// not defined
template <class T>
struct tuple_size<my_std::span<T, my_std::dynamic_extent>>;
template <std::size_t I, class T, std::size_t N>
struct tuple_element<I, my_std::span<T, N>>
static_assert(N != my_std::dynamic_extent && I < N);
using type = T;
;
template <std::size_t I, class T, std::size_t N>
constexpr T& get(my_std::span<T, N> s) noexcept
static_assert(N != my_std::dynamic_extent && I < N);
return s[I];
#undef CONSTRAINT
#undef EXPECTS
#endif
Constructive criticism is highly appreciated!
c++ reinventing-the-wheel template-meta-programming c++17 c++20
$endgroup$
add a comment |
$begingroup$
C++20 added the span
library under the header <span>
.
As voluntary exercise (not homework!),
I spent approximately 1.5 hours implement it under C++17.
Please tell me if I used stuff that is not available under C++17.
Most stuff is in the namespace ::my_std
, but tuple_size
, etc. are in the namespace ::std
, otherwise they are useless. The ::my_std::span_detail
namespace contains implementation details that are not to be exposed.
I used the C++ standard draft, HTML version as a reference.
Here is my code, within 400 lines:
// a C++17 implementation of <span>
#ifndef INC_SPAN_HPP_c2GLAK6Onz
#define INC_SPAN_HPP_c2GLAK6Onz
#include <array> // for std::array, etc.
#include <cassert> // for assert
#include <cstddef> // for std::size_t, etc.
#include <iterator> // for std::reverse_iterator, etc.
#include <type_traits> // for std::enable_if, etc.
#define CONSTRAINT(...)
std::enable_if_t<(__VA_ARGS__), int> = 0
#define EXPECTS(...)
assert((__VA_ARGS__))
namespace my_std
// constants
// equivalent to std::numeric_limits<std::size_t>::max()
inline constexpr std::size_t dynamic_extent = -1;
// class template span
template <class T, std::size_t N = dynamic_extent>
class span;
namespace span_detail
// detect specializations of span
template <class T>
struct is_span :std::false_type ;
template <class T, std::size_t N>
struct is_span<span<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_span_v = is_span<T>::value;
// detect specializations of std::array
template <class T>
struct is_array :std::false_type ;
template <class T, std::size_t N>
struct is_array<std::array<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_array_v = is_array<T>::value;
// ADL-aware data() and size()
using std::data;
using std::size;
template <class C>
constexpr decltype(auto) my_data(C& c)
return data(c);
template <class C>
constexpr decltype(auto) my_size(C& c)
return size(c);
// detect container
template <class C, class = void>
struct is_cont :std::false_type ;
template <class C>
struct is_cont<C,
std::void_t<
std::enable_if_t<!is_span_v<C>>,
std::enable_if_t<!is_array_v<C>>,
std::enable_if_t<!std::is_array_v<C>>,
decltype(data(std::declval<C>())),
decltype(size(std::declval<C>()))
>> :std::true_type ;
template <class C>
inline constexpr bool is_cont_v = is_cont<C>::value;
template <class T, std::size_t N>
class span N == M
&& std::is_convertible_v<std::remove_pointer_t<decltype(span_detail::my_data(std::declval<T(&)[M]>()))>(*)[], T(*)[]>)>
constexpr span(T (&arr)[M]) noexcept
: size_M, data_arr
template <std::size_t M,
CONSTRAINT(N == dynamic_extent ;
// deduction guide
template <class T, std::size_t N>
span(T (&)[N]) -> span<T, N>;
template <class T, std::size_t N>
span(std::array<T, N>&) -> span<T, N>;
template <class T, std::size_t N>
span(const std::array<T, N>&) -> span<const T, N>;
template <class Cont>
span(Cont&) -> span<typename Cont::value_type>;
template <class Cont>
span(const Cont&) -> span<const typename Cont::value_type>;
// views of objects representation
template <class T, std::size_t N>
auto as_bytes(span<T, N> s) noexcept
-> span<const std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<const std::byte*>(s.data()), s.size_bytes();
template <class T, std::size_t N,
CONSTRAINT(!std::is_const_v<T>)>
auto as_writable_bytes(span<T, N> s) noexcept
-> span<std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<std::byte*>(s.data()), s.size_bytes();
namespace std
// tuple interface
// the primary template declarations are included in <array>
template <class T, std::size_t N>
struct tuple_size<my_std::span<T, N>>
: std::integral_constant<std::size_t, N> ;
// not defined
template <class T>
struct tuple_size<my_std::span<T, my_std::dynamic_extent>>;
template <std::size_t I, class T, std::size_t N>
struct tuple_element<I, my_std::span<T, N>>
static_assert(N != my_std::dynamic_extent && I < N);
using type = T;
;
template <std::size_t I, class T, std::size_t N>
constexpr T& get(my_std::span<T, N> s) noexcept
static_assert(N != my_std::dynamic_extent && I < N);
return s[I];
#undef CONSTRAINT
#undef EXPECTS
#endif
Constructive criticism is highly appreciated!
c++ reinventing-the-wheel template-meta-programming c++17 c++20
$endgroup$
add a comment |
$begingroup$
C++20 added the span
library under the header <span>
.
As voluntary exercise (not homework!),
I spent approximately 1.5 hours implement it under C++17.
Please tell me if I used stuff that is not available under C++17.
Most stuff is in the namespace ::my_std
, but tuple_size
, etc. are in the namespace ::std
, otherwise they are useless. The ::my_std::span_detail
namespace contains implementation details that are not to be exposed.
I used the C++ standard draft, HTML version as a reference.
Here is my code, within 400 lines:
// a C++17 implementation of <span>
#ifndef INC_SPAN_HPP_c2GLAK6Onz
#define INC_SPAN_HPP_c2GLAK6Onz
#include <array> // for std::array, etc.
#include <cassert> // for assert
#include <cstddef> // for std::size_t, etc.
#include <iterator> // for std::reverse_iterator, etc.
#include <type_traits> // for std::enable_if, etc.
#define CONSTRAINT(...)
std::enable_if_t<(__VA_ARGS__), int> = 0
#define EXPECTS(...)
assert((__VA_ARGS__))
namespace my_std
// constants
// equivalent to std::numeric_limits<std::size_t>::max()
inline constexpr std::size_t dynamic_extent = -1;
// class template span
template <class T, std::size_t N = dynamic_extent>
class span;
namespace span_detail
// detect specializations of span
template <class T>
struct is_span :std::false_type ;
template <class T, std::size_t N>
struct is_span<span<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_span_v = is_span<T>::value;
// detect specializations of std::array
template <class T>
struct is_array :std::false_type ;
template <class T, std::size_t N>
struct is_array<std::array<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_array_v = is_array<T>::value;
// ADL-aware data() and size()
using std::data;
using std::size;
template <class C>
constexpr decltype(auto) my_data(C& c)
return data(c);
template <class C>
constexpr decltype(auto) my_size(C& c)
return size(c);
// detect container
template <class C, class = void>
struct is_cont :std::false_type ;
template <class C>
struct is_cont<C,
std::void_t<
std::enable_if_t<!is_span_v<C>>,
std::enable_if_t<!is_array_v<C>>,
std::enable_if_t<!std::is_array_v<C>>,
decltype(data(std::declval<C>())),
decltype(size(std::declval<C>()))
>> :std::true_type ;
template <class C>
inline constexpr bool is_cont_v = is_cont<C>::value;
template <class T, std::size_t N>
class span N == M
&& std::is_convertible_v<std::remove_pointer_t<decltype(span_detail::my_data(std::declval<T(&)[M]>()))>(*)[], T(*)[]>)>
constexpr span(T (&arr)[M]) noexcept
: size_M, data_arr
template <std::size_t M,
CONSTRAINT(N == dynamic_extent ;
// deduction guide
template <class T, std::size_t N>
span(T (&)[N]) -> span<T, N>;
template <class T, std::size_t N>
span(std::array<T, N>&) -> span<T, N>;
template <class T, std::size_t N>
span(const std::array<T, N>&) -> span<const T, N>;
template <class Cont>
span(Cont&) -> span<typename Cont::value_type>;
template <class Cont>
span(const Cont&) -> span<const typename Cont::value_type>;
// views of objects representation
template <class T, std::size_t N>
auto as_bytes(span<T, N> s) noexcept
-> span<const std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<const std::byte*>(s.data()), s.size_bytes();
template <class T, std::size_t N,
CONSTRAINT(!std::is_const_v<T>)>
auto as_writable_bytes(span<T, N> s) noexcept
-> span<std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<std::byte*>(s.data()), s.size_bytes();
namespace std
// tuple interface
// the primary template declarations are included in <array>
template <class T, std::size_t N>
struct tuple_size<my_std::span<T, N>>
: std::integral_constant<std::size_t, N> ;
// not defined
template <class T>
struct tuple_size<my_std::span<T, my_std::dynamic_extent>>;
template <std::size_t I, class T, std::size_t N>
struct tuple_element<I, my_std::span<T, N>>
static_assert(N != my_std::dynamic_extent && I < N);
using type = T;
;
template <std::size_t I, class T, std::size_t N>
constexpr T& get(my_std::span<T, N> s) noexcept
static_assert(N != my_std::dynamic_extent && I < N);
return s[I];
#undef CONSTRAINT
#undef EXPECTS
#endif
Constructive criticism is highly appreciated!
c++ reinventing-the-wheel template-meta-programming c++17 c++20
$endgroup$
C++20 added the span
library under the header <span>
.
As voluntary exercise (not homework!),
I spent approximately 1.5 hours implement it under C++17.
Please tell me if I used stuff that is not available under C++17.
Most stuff is in the namespace ::my_std
, but tuple_size
, etc. are in the namespace ::std
, otherwise they are useless. The ::my_std::span_detail
namespace contains implementation details that are not to be exposed.
I used the C++ standard draft, HTML version as a reference.
Here is my code, within 400 lines:
// a C++17 implementation of <span>
#ifndef INC_SPAN_HPP_c2GLAK6Onz
#define INC_SPAN_HPP_c2GLAK6Onz
#include <array> // for std::array, etc.
#include <cassert> // for assert
#include <cstddef> // for std::size_t, etc.
#include <iterator> // for std::reverse_iterator, etc.
#include <type_traits> // for std::enable_if, etc.
#define CONSTRAINT(...)
std::enable_if_t<(__VA_ARGS__), int> = 0
#define EXPECTS(...)
assert((__VA_ARGS__))
namespace my_std
// constants
// equivalent to std::numeric_limits<std::size_t>::max()
inline constexpr std::size_t dynamic_extent = -1;
// class template span
template <class T, std::size_t N = dynamic_extent>
class span;
namespace span_detail
// detect specializations of span
template <class T>
struct is_span :std::false_type ;
template <class T, std::size_t N>
struct is_span<span<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_span_v = is_span<T>::value;
// detect specializations of std::array
template <class T>
struct is_array :std::false_type ;
template <class T, std::size_t N>
struct is_array<std::array<T, N>> :std::true_type ;
template <class T>
inline constexpr bool is_array_v = is_array<T>::value;
// ADL-aware data() and size()
using std::data;
using std::size;
template <class C>
constexpr decltype(auto) my_data(C& c)
return data(c);
template <class C>
constexpr decltype(auto) my_size(C& c)
return size(c);
// detect container
template <class C, class = void>
struct is_cont :std::false_type ;
template <class C>
struct is_cont<C,
std::void_t<
std::enable_if_t<!is_span_v<C>>,
std::enable_if_t<!is_array_v<C>>,
std::enable_if_t<!std::is_array_v<C>>,
decltype(data(std::declval<C>())),
decltype(size(std::declval<C>()))
>> :std::true_type ;
template <class C>
inline constexpr bool is_cont_v = is_cont<C>::value;
template <class T, std::size_t N>
class span N == M
&& std::is_convertible_v<std::remove_pointer_t<decltype(span_detail::my_data(std::declval<T(&)[M]>()))>(*)[], T(*)[]>)>
constexpr span(T (&arr)[M]) noexcept
: size_M, data_arr
template <std::size_t M,
CONSTRAINT(N == dynamic_extent ;
// deduction guide
template <class T, std::size_t N>
span(T (&)[N]) -> span<T, N>;
template <class T, std::size_t N>
span(std::array<T, N>&) -> span<T, N>;
template <class T, std::size_t N>
span(const std::array<T, N>&) -> span<const T, N>;
template <class Cont>
span(Cont&) -> span<typename Cont::value_type>;
template <class Cont>
span(const Cont&) -> span<const typename Cont::value_type>;
// views of objects representation
template <class T, std::size_t N>
auto as_bytes(span<T, N> s) noexcept
-> span<const std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<const std::byte*>(s.data()), s.size_bytes();
template <class T, std::size_t N,
CONSTRAINT(!std::is_const_v<T>)>
auto as_writable_bytes(span<T, N> s) noexcept
-> span<std::byte,
N == dynamic_extent ? dynamic_extent : sizeof(T) * N>
return reinterpret_cast<std::byte*>(s.data()), s.size_bytes();
namespace std
// tuple interface
// the primary template declarations are included in <array>
template <class T, std::size_t N>
struct tuple_size<my_std::span<T, N>>
: std::integral_constant<std::size_t, N> ;
// not defined
template <class T>
struct tuple_size<my_std::span<T, my_std::dynamic_extent>>;
template <std::size_t I, class T, std::size_t N>
struct tuple_element<I, my_std::span<T, N>>
static_assert(N != my_std::dynamic_extent && I < N);
using type = T;
;
template <std::size_t I, class T, std::size_t N>
constexpr T& get(my_std::span<T, N> s) noexcept
static_assert(N != my_std::dynamic_extent && I < N);
return s[I];
#undef CONSTRAINT
#undef EXPECTS
#endif
Constructive criticism is highly appreciated!
c++ reinventing-the-wheel template-meta-programming c++17 c++20
c++ reinventing-the-wheel template-meta-programming c++17 c++20
asked 8 mins ago
L. F.L. F.
17610
17610
add a comment |
add a comment |
0
active
oldest
votes
Your Answer
StackExchange.ifUsing("editor", function ()
StackExchange.using("externalEditor", function ()
StackExchange.using("snippets", function ()
StackExchange.snippets.init();
);
);
, "code-snippets");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "196"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217814%2fc17-span-implementation%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Code Review Stack Exchange!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fcodereview.stackexchange.com%2fquestions%2f217814%2fc17-span-implementation%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown