hkaiser changed the topic of #ste||ar to: STE||AR: Systems Technology, Emergent Parallelism, and Algorithm Research | stellar.cct.lsu.edu | HPX: A cure for performance impaired parallel applications | github.com/STEllAR-GROUP/hpx | Buildbot: http://rostam.cct.lsu.edu/ | Log: http://irclog.cct.lsu.edu/ | GSoC: https://github.com/STEllAR-GROUP/hpx/wiki/Google-Summer-of-Code-%28GSoC%29-2020
akheir has quit [Quit: Leaving]
shahrzad has quit [Quit: Leaving]
bita_ has quit [Ping timeout: 260 seconds]
hkaiser has quit [Quit: bye]
kale[m] has quit [Ping timeout: 265 seconds]
kale[m] has joined #ste||ar
kale[m] has quit [Ping timeout: 240 seconds]
kale[m] has joined #ste||ar
jaafar has quit [Quit: Konversation terminated!]
kale[m] has quit [Read error: Connection reset by peer]
kale[m] has joined #ste||ar
<gonidelis[m]> I cannot understand what is this build fail about
hkaiser has joined #ste||ar
akheir has joined #ste||ar
jaafar has joined #ste||ar
RostamLog has joined #ste||ar
kale[m] has joined #ste||ar
bita_ has joined #ste||ar
<gonidelis[m]> repost: I cannot understand what this build fail is about
K-ballo has quit [Ping timeout: 240 seconds]
K-ballo has joined #ste||ar
<hkaiser> gonidelis[m]: it's one of the know problems we have, unrelated to your work
<gonidelis[m]> hkaiser: thanks
<gonidelis[m]> hkaiser: so should I assume that everything is fine with the pr by now?
<hkaiser> yes
<gonidelis[m]> good
<hkaiser> if that's the only failure
<gonidelis[m]> hkaiser: I have removed the projection documentation comments from hpx::transform doxygen part
<gonidelis[m]> I only keep them for hpx::ranges::transform
<gonidelis[m]> is that correct?
<hkaiser> yes
<gonidelis[m]> ;)
<gonidelis[m]> hkaiser: yt?
<hkaiser> here
<gonidelis[m]> this overload does not have `InIter1`
<gonidelis[m]> I think it means `begin(rng)`
<gonidelis[m]> should I leave it as is ?
<gonidelis[m]> ahhh.... actually I don't think that such an overload even exists in std
<gonidelis[m]> hkaiser: ^^
<hkaiser> it's range_iterator<Rng>::type
<hkaiser> good catch
ramses[m] has joined #ste||ar
kale[m] has quit [Ping timeout: 240 seconds]
kale[m] has joined #ste||ar
<gonidelis[m]> any help on how I should treat that?
<gonidelis[m]> hkaiser:
kale[m] has quit [Ping timeout: 260 seconds]
kale[m] has joined #ste||ar
<hkaiser> gonidelis[m]: isn't that the same as for the other algorithms?
<gonidelis[m]> hkaiser: ok you are right
<gonidelis[m]> my bad
<gonidelis[m]> What do we mean by "signature" ?
<K-ballo> usually the type of a function, or a function type representing the types in a call expression
<K-ballo> what's the context?
<K-ballo> that's some unusual wording
<gonidelis[m]> what's the suggestion
<gonidelis[m]> ?
<K-ballo> the function type, or the function call operator of the given callable, or..., does not need to have const
<K-ballo> `[](const Type &a) -> Ret {}` will do, but so will `[](Type &a) -> Ret {}`
<K-ballo> uhm, that sounds wrong
<K-ballo> I'm guessing it's supposed to say "does not need to have `const Type &`"
<K-ballo> ah, no, it's saying `[](Type a) -> Ret {}` will work too
<K-ballo> the whole phrasing is... off
<K-ballo> it also says predicate, but it seems this is not actually a predicate?
<K-ballo> it is definitely not a predicate
<K-ballo> hah, that odd wording is copied verbatim from cppreference
<K-ballo> not really.. it's the same, isn't it? it has all the same mistakes
<K-ballo> you want to say that `f`, which is not a predicate (may be an operation if you wish to give it some sort of name), is callable with a `const Type &`
<K-ballo> btw, verbatim from cppref explains the odd const placement
<K-ballo> except `Type` is a magic placeholder here..
<K-ballo> it's callable with whatever the iterator yields when dereferenced
kale[m] has quit [Ping timeout: 240 seconds]
<K-ballo> don't get stuck on it, looks like a pervasive defect
kale[m] has joined #ste||ar
<gonidelis[m]> K-ballo: cool thanks
<gonidelis[m]> K-ballo: why f is not a predicate?
<K-ballo> predicates are boolean
<K-ballo> they serve as conditions
<K-ballo> copy_if gets a predicate, transform gets an ordinary operation
<gonidelis[m]> hmm
<gonidelis[m]> ?
<K-ballo> in some form or other, yeah
<gonidelis[m]> the other two overloads accordingly:
<gonidelis[m]> the other one* overload actually
<gonidelis[m]> ...two in total
<gonidelis[m]> K-ballo: what do you think?
<gonidelis[m]> (feel free to comment as a review if you want to)
<gonidelis[m]> hkaiser: we wait for the tests and we are set ;)
<gonidelis[m]> next stop: `min_max`
<K-ballo> can't give any useful feedback when the entire wording is broken
<K-ballo> I could tell you the text is incorrect, but we knew that already
<K-ballo> let it be for now, it's going to require an entire overhaul for all algorithms' docs
<gonidelis[m]> K-ballo: the thing that `f` does is that it takes the range and applies its functionality on it, right?
<K-ballo> rephrase?
<K-ballo> the algorithm operates on the range, f only operates on an element/pair of elements
<gonidelis[m]> it applies some transformation on the given range
<gonidelis[m]> ok yeah
<gonidelis[m]> does `f` define the kind of transformation that is going to take place?
<K-ballo> yes
kale[m] has quit [Ping timeout: 265 seconds]
kale[m] has joined #ste||ar
kale[m] has quit [Ping timeout: 265 seconds]
kale[m] has joined #ste||ar
kale[m] has quit [Ping timeout: 265 seconds]
kale[m] has joined #ste||ar
kale[m] has quit [Ping timeout: 264 seconds]
kale[m] has joined #ste||ar
kale[m] has quit [Quit: Quit]