- Boost - lists.preview.boost.org

Idea Suggestion for GsOC'21
by Sanyam Bhaskar 01 Apr '21

01 Apr '21

Hey! This is Sanyam Bhaskar. I read over the default Ideas provided to us and XML Parser really caught my eye. I would like to contribute to the same but don’t know where to start. Also, as per my understanding, XML is relatively outdated , when compared to data languages like JSON. So in addition to this being an XML Parser, I think adding a JSON parser alongside it would boost the library’s utility in the modern day industry. I Would appreciate it if someone could tell me how to get started and some feedback on the suggestion. Looking forward to contributing to the project. Yours, Sanyam Bhaskar

4 7

[range] the strange behavior of adjacent_filter
by Andrzej Krzemienski 31 Mar '21

31 Mar '21

Hi everyone, Boost.Range has two GitHub issues on the strange behavior of adjacent_find that have been sitting there for more than two years: https://github.com/boostorg/range/issues/80 https://github.com/boostorg/range/issues/81 The behavior of the algorithm is not well described, but the intuitive expectation would be that it returns for every pair of adjacent elements that match the predicate the second of the pair. However, the unexpected behavior of the algorithm is that for a non-empty range it literally always returns the first element. I do not think that this is by accident, because Ranges V3 also expose the same behavior: https://godbolt.org/z/P33j1qvT6 Does anyone happen to know the reasoning or motivation behind this behavior? Regards, &rzej;

1 0

Interested in creating new matrix and vector types
by Gagandeep Bhatia 31 Mar '21

31 Mar '21

Hey, I'm Gagandeep Bhatia, currently pursuing the 2nd year in Christ University, Bangalore, India. You can reach me at gagandeepbhatia2303(a)gmail.com or +919466935025. I went through your upcoming projects on Google Summer of Code, your idea on creating new matrix and vector types is really impressive. The best part about your project is It supports all matrix sizes, from small fixed-size matrices to arbitrarily large dense matrices, and even sparse matrices. It supports all standard numeric types, including std::complex, integers, and is easily extensible to custom numeric types. It supports various matrix decompositions and geometry features I truly want to become part of this project for a better mutual achievement, in the past I have done a few projects, which will help me to contribute my best in this project. It will be really kind if you can share some more details about your project, so I learn more about your project. with regards.

2 2

Boost.Lambda2 usage
by Barry Revzin 31 Mar '21

31 Mar '21

Hey all, I spent this morning implementing views::zip using Boost.Lambda2 (because views::zip requires writing lots of single-operator lambdas, so it fits the problem quite well). You can see the implementation here: https://godbolt.org/z/jcjdd3xeo I ran into a few issues I wanted to point out. First, several operators are missing. This is the standard library's fault (it's weird that not even dereference is there). But if the standard library isn't going to provide them, I figure Boost.Lambda2 should, since these are probably going to come up so may as well just add a few more lines of code and call it a day. I needed to define five: * (unary), ++ and -- (prefix), +=, and -=. Second, this library has name lookup issues. Here's a reduced example ( https://godbolt.org/z/z8oEqnTnG) #include < https://raw.githubusercontent.com/pdimov/lambda2/develop/include/boost/lamb… > namespace N { struct Irrelevant { }; void operator+(Irrelevant, Irrelevant); int plus_one(int i) { using namespace boost::lambda2; return (_1 + 1)(i); } } This doesn't compile. _1 + 1 finds the appropriately-named irrelevant operator+ and stops there, and we never get to the operator+ in namespace boost::lambda2. Either the operators need to be put in namespace std::placeholders for ADL (which seems naughty, but also seems like something the standard library could potentially do?) or the library should provide its own placeholders. That would lose the nice _1 name, but gain the ability to provide both [] and (). Thanks for the library, Barry

3 3

Re: [boost] [Boost][GIL][GSOC21]Wish to know about code review process
by sayan chaudhuri 30 Mar '21

30 Mar '21

Hello Everyone, I am a bit new to the world of open source and so I would like to know how the code review of pull requests is actually done. I have come to know that when I add a new feature to the library, I have to submit a test file along with my pull request. After that,what happens is unknown to me.Understanding this would help me to realize the entire process from pull requests to merging and therefore increase the quality of my contribution. I shall be highly thankful to anyone who may take time out of his/her busy schedule to explain this a bit to me. Thank you all.

2 1

gsoc21: Boost.Multiprecision: New Quad-Double Backend Type: Project 1: Implement a Feasible Realization of Quad-Double
by Orlando Nkengafac 29 Mar '21

29 Mar '21

Hello, My Name is Orlando. I am a nursing student at the Faculty of Health Sciences at the University of Buea, Cameroon. However, I have had in-depth private studies in C++. What is my next step for the test and submission of a proposal, for gsoc21: “Project 1: Implement a Feasible Realization of Quad-Double”. I would like to have a mentor? Sincerely, Orlando

1 0

gsoc21: Boost.uBlas: Matrix and Tensor Computations: Project 3: Finalize Dataframe Implementation
by Fatima Zifac 29 Mar '21

29 Mar '21

Hello, My name is Fatima. I study accounting in the University of Buea, Cameroon. However, I am very good in C++. I want to do the test and submit a proposal for gsoc21: “Project 3: Finalize Dataframe Implementation”. I would like to have a mentor? Sincerely, Fatima

1 0

gsoc21: Boost.uBlas: Matrix and Tensor Computations: Project 2: Create New Matrix and Vector Types
by Forcha Pearl 29 Mar '21

29 Mar '21

Hello, My name is Pearl. I am a student at the Faculty of Engineering, in University of Buea, Cameroon. I am enrolled for a Master’s Degree in Network Engineering and Security. I would like to do gsoc21: “Project 2: Create new matrix and vector types”. I would like to have a mentor? Regards, Pearl

1 0

gsoc21: Boost.uBlas: Matrix and Tensor Computations: Project 1: Finalize and Improve the Subtensor Type
by Glen forcha 29 Mar '21

29 Mar '21

Hello, I am Glen. I am doing my Phd in Software Engineering, at the University of Buea, Cameroon. I am interested in gsoc21: “Project 1: Finalize and Improve the Subtensor Type”. I would like to have a mentor? Regards, Glen

1 0

Re: [boost] [Boost][GIL][GSOC 2021] Contribute to the library
by sayan chaudhuri 28 Mar '21

28 Mar '21

Hello Everyone, I wish to convey my thanks to Matseuz Loskot and Pranam Lashkari, maintainers of Boost GIL for taking out time to go through my mail posting and also my pull request for KMeans Clustering. I have made the changes as suggested by Pranam Lashkari by replacing the .cpp file in example folder with .hpp file in the image_processing folder. I would request to kindly have a look at the submitted changes. Here is the link for the pull request : https://github.com/boostorg/gil/pull/587.. I shall soon be posting my project proposal in the mailing list.

1 0