473,323 Members | 1,570 Online
Bytes | Software Development & Data Engineering Community
Post Job

Home Posts Topics Members FAQ

Join Bytes to post your question to a community of 473,323 software developers and data experts.

Specialising for iterators over contiguous memory (e.g. vector, string)

Dear All,

For some reason I had got it into my head that std::vector<T>::iterator
and std::basic_string<T>::iterator were certain to be T*. I now see
that this isn't true.

So here's why this matters to me. I have a function that is templated
on an iterator type:

template <typename Iter>
void func(Iter i) { ...... }

A common case is Iter = std::some-container<char>::iterator. For those
containers where the elements are certain to be stored contiguously in
memory (i.e. string and vector, right?), I want to provide an optimised
specialisation: if the elements have suitable alignment, I'll cast to
int* and process them 4 or 8 at a time, rather than one at a time.
(I've already established that this is worthwhile; it's similar to
specialising std::copy to invoke memcpy().)

So, in my mistaken belief that std::vector/basic_string<char>::iterator
was char*, I wrote this:

template <>
void func(char* i) <char*{ ...... }

which of course didn't work.

So presumably I could specifically detect basic_string and vector, and
invoke the char* specialisation on the address of the element:

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{
func<char*>(&(*i));
}

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{
func<char*>(&(*i));
}

Question: does that work?

But I'd really like to be able to detect any container, including
user-defined ones, where the elements are stored contiguously in memory.
Is there some way to enable the specialisation in these cases?

Many thanks for any suggestions.

Phil.

Feb 20 '08 #1
5 1772
Phil Endecott wrote:
Dear All,

For some reason I had got it into my head that
std::vector<T>::iterator and std::basic_string<T>::iterator were
certain to be T*. I now see that this isn't true.

So here's why this matters to me. I have a function that is templated
on an iterator type:

template <typename Iter>
void func(Iter i) { ...... }

A common case is Iter = std::some-container<char>::iterator. For
those containers where the elements are certain to be stored
contiguously in memory (i.e. string and vector, right?), I want to
provide an optimised specialisation: if the elements have suitable
alignment, I'll cast to int* and process them 4 or 8 at a time,
rather than one at a time. (I've already established that this is
worthwhile; it's similar to specialising std::copy to invoke
memcpy().)
So, in my mistaken belief that
std::vector/basic_string<char>::iterator was char*, I wrote this:

template <>
void func(char* i) <char*{ ...... }
Ahem... Did you mean

template<>
void func<char*>(char* i) { ....... }

Because the way you wrote it is a syntax error.

which of course didn't work.
In what way didn't it work?
So presumably I could specifically detect basic_string and vector, and
invoke the char* specialisation on the address of the element:

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{
Again, what is the template argument list doing after the function
argument list? It must follow the name.
func<char*>(&(*i));
}

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{
Same here. BTW, 'std::string' is the synonym for 'std::basic_string<char>'.
func<char*>(&(*i));
}

Question: does that work?
No, those are syntax errors.
>
But I'd really like to be able to detect any container, including
user-defined ones, where the elements are stored contiguously in
memory. Is there some way to enable the specialisation in these
cases?
Many thanks for any suggestions.
Please post real code, and post what errors do you get.

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask
Feb 20 '08 #2
Victor Bazarov wrote:
Phil Endecott wrote:
>Dear All,

For some reason I had got it into my head that
std::vector<T>::iterator and std::basic_string<T>::iterator were
certain to be T*. I now see that this isn't true.

So here's why this matters to me. I have a function that is templated
on an iterator type:

template <typename Iter>
void func(Iter i) { ...... }

A common case is Iter = std::some-container<char>::iterator. For
those containers where the elements are certain to be stored
contiguously in memory (i.e. string and vector, right?), I want to
provide an optimised specialisation: if the elements have suitable
alignment, I'll cast to int* and process them 4 or 8 at a time,
rather than one at a time. (I've already established that this is
worthwhile; it's similar to specialising std::copy to invoke
memcpy().)
So, in my mistaken belief that
std::vector/basic_string<char>::iterator was char*, I wrote this:

template <>
void func(char* i) <char*{ ...... }

Ahem... Did you mean

template<>
void func<char*>(char* i) { ....... }

Because the way you wrote it is a syntax error.
Yes, sorry :-(
>which of course didn't work.

In what way didn't it work?
The specialisation was not used, and the default implementation of the
function was used.
>So presumably I could specifically detect basic_string and vector, and
invoke the char* specialisation on the address of the element:

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{

Again, what is the template argument list doing after the function
argument list? It must follow the name.
> func<char*>(&(*i));
}

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{

Same here. BTW, 'std::string' is the synonym for 'std::basic_string<char>'.
> func<char*>(&(*i));
}

Question: does that work?

No, those are syntax errors.
I'll try again:

template <>
void func<std::basic_string<char>::iterator>
(std::basic_string<char>::iterator i) {
func<char*>(&(*i));
}

template <>
void func<std::basic_string<char>::iterator>
(std::basic_string<char>::iterator i) {
func<char*>(&(*i));
}
Feb 20 '08 #3
Phil Endecott wrote:
Victor Bazarov wrote:
>Phil Endecott wrote:
>>Dear All,

For some reason I had got it into my head that
std::vector<T>::iterator and std::basic_string<T>::iterator were
certain to be T*. I now see that this isn't true.

So here's why this matters to me. I have a function that is
templated on an iterator type:

template <typename Iter>
void func(Iter i) { ...... }

A common case is Iter = std::some-container<char>::iterator. For
those containers where the elements are certain to be stored
contiguously in memory (i.e. string and vector, right?), I want to
provide an optimised specialisation: if the elements have suitable
alignment, I'll cast to int* and process them 4 or 8 at a time,
rather than one at a time. (I've already established that this is
worthwhile; it's similar to specialising std::copy to invoke
memcpy().)
So, in my mistaken belief that
std::vector/basic_string<char>::iterator was char*, I wrote this:

template <>
void func(char* i) <char*{ ...... }

Ahem... Did you mean

template<>
void func<char*>(char* i) { ....... }

Because the way you wrote it is a syntax error.

Yes, sorry :-(
>>which of course didn't work.

In what way didn't it work?

The specialisation was not used, and the default implementation of the
function was used.
>>So presumably I could specifically detect basic_string and vector,
and invoke the char* specialisation on the address of the element:

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{

Again, what is the template argument list doing after the function
argument list? It must follow the name.
>> func<char*>(&(*i));
}

template <>
void func(std::basic_string<char>::iterator i)
<std::basic_string<char>::iterator{

Same here. BTW, 'std::string' is the synonym for
'std::basic_string<char>'.
>> func<char*>(&(*i));
}

Question: does that work?

No, those are syntax errors.

I'll try again:

template <>
void func<std::basic_string<char>::iterator>
(std::basic_string<char>::iterator i) {
func<char*>(&(*i));
}

template <>
void func<std::basic_string<char>::iterator>
(std::basic_string<char>::iterator i) {
func<char*>(&(*i));
}
Phil,

With all due respect to your effort so far, it's not enough for me
to verify that whatever you are trying to get to work does not work
and why. Please post the _complete_ _compileable_ code. We really
do not care for your proprietary stuff, but you have to post the
minimal set that anyone here can copy from your message and paste
into their IDE or the text editor and run the complier over it to
see what errors we get, and then compare them with your reported
errors. And then try to tweak your code to make it compile and
behave the way you need it to behave.

Best of luck!

V
--
Please remove capital 'A's when replying by e-mail
I do not respond to top-posted replies, please don't ask
Feb 20 '08 #4
Victor Bazarov wrote:
With all due respect to your effort so far, it's not enough for me
to verify that whatever you are trying to get to work does not work
and why. Please post the _complete_ _compileable_ code.
Victor, don't worry about the syntax errors and so on. I can fix those.
The important bit is this question, which does not depend on any of
the code that I posted (and which got lost in the quoting):

"I'd really like to be able to detect any container, including
user-defined ones, where the elements are stored contiguously in memory.
Is there some way to enable the specialisation in these cases?"

Phil.
Feb 20 '08 #5
On Feb 20, 11:03*pm, red floyd <no.s...@here.dudewrote:
red floyd wrote:

Damn. *I had it written out, copied, pasted, and everything, and still
missed one element.
#include <iterator>
template<typename ForwardIterator>
bool is_continguous(ForwardIterator first, ForwardIterator last)
{
* * bool is_contiguous = false;
* * if (first != last)
* * {
* * * * is_contiguous = true;
* * * * typename std::iterator_traits<ForwardIterator>::pointer p =
&*first;
* * * * while (is_contiguous && first != last)
* * * * {
* * * * * * if (&*first != ++p)

* * * * * * * * is_contiguous = false;
* * * * * * * else
* * * * * * * * *++first.
* * * * }
* * }
* * return is_contiguous;
}
Shouldn't "first" and "p" move at the same rate meaning they should
move ahead together and then compared for pointer equality? Currently,
p is always ahead of first in the comparison for != in the if-block
within while and hence the != will always return "true" resulting in
the function to return false.

Also, this would tell if the container has contiguous blocks allocated
at runtime or not for that particular object, which could
theoretically be possible for even a non-contiguous container but
should work on that container object as it is just that instance's
contiguity that is important. It cannot be used as a generic test for
a type, though. Right?
Feb 21 '08 #6

This thread has been closed and replies have been disabled. Please start a new discussion.

Similar topics

0
by: panbru | last post by:
I'm doing some native code stuff and want to pass continguos memory blocks of data back and forth between Python and C, with the memory blocks modifiable in both realms. What is a good way to do...
2
by: Gary Kuehn | last post by:
Is Reserve guaranteed to allocate contiguous memory? How safe is the following: vector<char> vbuff; int sz = numeric_limits<short int>::max();
5
by: Alfonso Morra | last post by:
Hi, I am writing a messaging library which will allow me to send a generic message structure with custom "payloads". In many cases, a message must store a non-linear data structure (i.e....
1
by: richardconnor | last post by:
Hi, Is it possible to get use of a block of contiguous memory using JavaScript? - I'd like to use it for a project but it's efficiency-critical and I want access to a memory-addressable block. If...
2
by: Sheldon | last post by:
Hi, Can someone tell me how to remove the conflicts here ? #include <stdlib> static char*** Memory2DStr(int R, int C); static void MemoryFreeStr(int C, char*** array); void main() {...
3
by: n.torrey.pines | last post by:
I'd like to be able to view two contiguous elements of a vector as a pair. Assuming I'm not accessing the last element, of course, and the element type is not bool, when is it safe to do so,...
5
by: Azaz ul haq | last post by:
Hello! What is meant by contiguous memory allocation in C++?
1
by: efittery | last post by:
I need to modify the following code to handle a vector of pairs of floats. I was just thinking of casting my vector of floats into being a vector of pairs of floats. Alternately, I have...
3
by: chachi | last post by:
Hi, I want to know how to instantiate a data structure which has n bytes (given by me) and is internally stored in a contiguous fashion. I know list is not implemented like this, so I am in a...
0
by: DolphinDB | last post by:
Tired of spending countless mintues downsampling your data? Look no further! In this article, you’ll learn how to efficiently downsample 6.48 billion high-frequency records to 61 million...
0
by: ryjfgjl | last post by:
ExcelToDatabase: batch import excel into database automatically...
0
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
1
isladogs
by: isladogs | last post by:
The next Access Europe meeting will be on Wednesday 6 Mar 2024 starting at 18:00 UK time (6PM UTC) and finishing at about 19:15 (7.15PM). In this month's session, we are pleased to welcome back...
1
by: PapaRatzi | last post by:
Hello, I am teaching myself MS Access forms design and Visual Basic. I've created a table to capture a list of Top 30 singles and forms to capture new entries. The final step is a form (unbound)...
1
by: CloudSolutions | last post by:
Introduction: For many beginners and individual users, requiring a credit card and email registration may pose a barrier when starting to use cloud servers. However, some cloud server providers now...
1
by: Defcon1945 | last post by:
I'm trying to learn Python using Pycharm but import shutil doesn't work
1
by: Shællîpôpï 09 | last post by:
If u are using a keypad phone, how do u turn on JavaScript, to access features like WhatsApp, Facebook, Instagram....
0
isladogs
by: isladogs | last post by:
The next Access Europe User Group meeting will be on Wednesday 3 Apr 2024 starting at 18:00 UK time (6PM UTC+1) and finishing by 19:30 (7.30PM). In this session, we are pleased to welcome former...

By using Bytes.com and it's services, you agree to our Privacy Policy and Terms of Use.

To disable or enable advertisements and analytics tracking please visit the manage ads & tracking page.