Date: Sun, 20 Oct 2024 13:17:35 +0100
Hi Phil,
I'm very busy for the next four weeks. However, thereafter, I hope to have
significant free cycles and so will provisionally plan to have a go at
implementing your new ideas. It seemed a helpful exercise last time around,
so hopefully will be similarly illuminating.
O.
On Fri, 18 Oct 2024 at 22:21, Phil Ratzloff <Phil.Ratzloff_at_[hidden]> wrote:
> I’m preparing to make a big change to the library to use descriptors like
> boost::graph uses. There are three implications. The first, is that the
> vertex functions in the Graph Container Interface will replace vertex id
> and vertex reference with a vertex descriptor, and edge functions will
> replace edge reference with vertex descriptor. The second implication is
> that the number of concepts, views and functions will shrink because of
> this. Lastly, it will become easier to write generic algorithms without
> specializations for vertices in random-access vs. bidirectional containers.
>
>
>
> In practice, the descriptor is either an integral index (contiguous or
> random-access container) or an iterator (bidirectional or forward
> container).
>
>
>
> The structure and logic of the proposal won’t change.
>
>
>
> There are already structs using the “descriptor” name, like
> vertex_descriptor, which will need to be changed to something else, like
> vertex_info. I felt it was better to retain the term from boost::graph to
> help people transition easier.
>
>
>
>
>
>
>
> *From:* Jeremy Murphy <jeremy.william.murphy_at_[hidden]>
> *Sent:* Sunday, October 13, 2024 7:05 AM
> *To:* Phil Ratzloff <Phil.Ratzloff_at_[hidden]>
> *Cc:* sg19_at_[hidden]; Oliver Rosten <oliver.rosten_at_[hidden]>
> *Subject:* Re: [isocpp-sg19] SG19 Oct 10 2024 telecon
>
>
>
> *EXTERNAL*
>
> Thanks for the update, Phil, I'll focus my attention on the active papers
> then.
>
>
>
>
>
> On Sat, 12 Oct 2024 at 01:42, Phil Ratzloff <Phil.Ratzloff_at_[hidden]> wrote:
>
> Hey, Jeremy. P1709 has been expanded into multiple papers and is no longer
> active. P3126..3131 are the currently active papers. They’re the chapters
> from P1709 to avoid a mega-paper no one will read. There’s an additional
> paper that hasn’t been written yet (P3337) to compare boost::graph with the
> proposal in terms of syntax and performance – we’re still gathering
> information before it can be written.
>
>
>
> Things have evolved since then. I’d suggest that you get familiar with the
> updated papers. Ideally you’d attend the monthly SG19 meetings, or
> alternatively, send your comments/suggestions here.
>
>
>
>
>
> *From:* SG19 <sg19-bounces_at_[hidden]> *On Behalf Of *Jeremy Murphy
> via SG19
> *Sent:* Friday, October 11, 2024 6:46 AM
> *To:* sg19_at_[hidden]
> *Cc:* Jeremy Murphy <jeremy.william.murphy_at_[hidden]>; Oliver Rosten <
> oliver.rosten_at_[hidden]>
> *Subject:* Re: [isocpp-sg19] SG19 Oct 10 2024 telecon
>
>
>
> *EXTERNAL*
>
> Hi everyone,
>
>
>
> I've been lurking on the list for a while and after I read through
> Michael's email and had a quick look at P1709R3c, I thought maybe I can
> actually contribute something here. I'm the current maintainer of
> Boost.Graph, so I have some familiarity with the area. Anyway, that's just
> a quick introduction and hello so that you're not surprised by someone
> unfamiliar making suggestions in Google Docs, which I might not get around
> to for a few days yet.
>
>
>
> Cheers.
>
>
>
> Jeremy
>
>
>
>
>
> On Fri, 11 Oct 2024 at 05:02, Michael Wong via SG19 <sg19_at_[hidden]>
> wrote:
>
> Get well. We will miss you. Make sure its not covid.
>
>
>
> On Thu, Oct 10, 2024 at 4:26 AM Oliver Rosten via SG19 <
> sg19_at_[hidden]> wrote:
>
> Unfortunately I've caught a really heavy cold so won't be able to attend
> either.
>
>
>
> But I hope to catch up on Phil's latest ideas once I'm better.
>
>
>
> O.
>
>
>
> On Thu, 10 Oct 2024 at 09:08, Guy Davidson via SG19 <sg19_at_[hidden]>
> wrote:
>
> I will be in Breda at C++ Under The Sea so I won't be able to attend.
>
>
>
> Cheers,
>
> G
>
>
>
> On Tue, 8 Oct 2024 at 21:11, Michael Wong via SG19 <sg19_at_[hidden]>
> wrote:
>
> Hi, this SG19 meeting will focus on stats and graphs. I know we just met 2
> weeks ago so there may not be a lot of progress yet,
> in which case this will be just a short recap/planning meeting.
>
> Michael Wong is inviting you to a scheduled Zoom meeting.
>
> Topic: SG19 monthly
> Time: 2nd Thursdays 02:00 PM Eastern Time (US and Canada)
> Every month on the Second Thu,
>
>
> Join from PC, Mac, Linux, iOS or Android:
>
> https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MjI4OjY1NmM1MzU5NjdiZmZiN2M1MjU3NmE0YTNiZTY5OGZiM2JiYTQ3NzAwMjQ3M2UwZTY1Yzc4MzI0NjYzOWFhZDc6aDpUOk4>
> Password: 035530
>
> Or iPhone one-tap :
> US: +13017158592,,93084591725# or +13126266799,,93084591725#
> Or Telephone:
> Dial(for higher quality, dial a number based on your current location):
> US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1
> 408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782
> or 877 853 5247 (Toll Free)
> Meeting ID: 930 8459 1725
> Password: 035530
> International numbers available: https://iso.zoom.us/u/agewu4X97
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/u/agewu4X97___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozN2ViOjIxY2U1ZjNiZGZhNDUzNDVmZTJmZmFlYWYzMjNjYWMzOTFiY2Y4YzY1ZmIzM2VmYzM0MGNmOTg5MDc5MTMzYjI6aDpUOk4>
>
> Or Skype for Business (Lync):
> https://iso.zoom.us/skype/93084591725
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/skype/93084591725___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmZmU5Ojk3OWE3ZjU2YTUyYjM1Y2Q4OGVlN2UxZGYxODA3MjZmMzY3ODRlNzkwNDU1YTA2NDNjODZjMGVmZmVkMWViYjE6aDpUOk4>
>
> Agenda:
>
> 1. Opening and introductions
>
> The ISO Code of conduct:
> https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf
> <https://protect.checkpoint.com/v2/r01/___https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5ZTlhOjliZDEyYTI0ZDAyZTc5NzI2N2Q3ZDRlZjcwY2EyZDhhMzViYmVjYWQ1YTQxMmE4NTkzYzJiNjM1NTBiNDdmNDY6aDpUOk4>
>
> IEC Code of Conduct:
>
> https://www.iec.ch/basecamp/iec-code-conduct-technical-work
> <https://protect.checkpoint.com/v2/r01/___https://www.iec.ch/basecamp/iec-code-conduct-technical-work___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MDMxOjRjYzdmOWVlZWVhMWJmYTYxMWEwZmRiYjZmNzYzM2EzMTA1MDFjOTBlYzI4YjNlZDZiNzg4ZTI2NjM1MDkwOGU6aDpUOk4>
>
> ISO patent policy.
>
>
> https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2
> <https://protect.checkpoint.com/v2/r01/___https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkYWQ3OmVmZGFhMDA0MGU0MTFkMDZlMDVjNDdjZGRkY2M0MTc5MTY5NWRlOGRkNDYzNGFhMjNhZjlkODU0YzU3YzkyMzA6aDpUOk4>
>
> The WG21 Practices and Procedures and Code of Conduct:
>
> https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpiZmE4OjZmYmEwZTlhOWI5MmMwMzNhNTkyMWJiNDZhYjQxNmVlODU5OTdjMjg2NmUwZDVjZjI1YWQ4YWJhMTAxZDhiZjA6aDpUOk4>
>
> 1.1 Roll call of participants
>
> 1.2 Adopt agenda
>
> 1.3 Approve minutes from previous meeting, and approve publishing
> previously approved minutes to ISOCPP.org
>
> 1.4 Action items from previous meetings
>
> 2. Main issues (125 min)
>
> 2.1 General logistics
>
> Meeting plan, focus on one paper per meeting but does not preclude other
> paper
> updates.
>
> 2024 planning
> C++23 and C++26 status
> CPPCON 2024
>
>
> * Jan 11, 2024 02:00 PM ET: Graph DONE
> * Feb 8, 2024 02:00 PM ET: Graph DONE
> * Mar 14, 2024 02:00 PM ET: Cancelled due to Tokyo 3-18-23
> * Apr 11, 2024 02:00 PM ET: Stats/Graph DONE
> * May 9, 2024 02:00 PM ET: Graph DONE
> * June 13, 2024 02:00 PM ET: Graph; St.louis 6-24-29 DONE
> * July 11, 2024 02:00 PM ET: Stats/ Graphs DONE
> * Aug 15, 2024 02:00 PM ET: Graph DONE
> * Sep 12, 2024 02:00 PM ET: CPPCON Sept 15-20 so canceled DONE
> * Oct 10, 2024 02:00 PM ET: Stats
> * Nov 14, 2024 02:00 PM ET: Cancelled Wroclaw F2F
> * Dec 12, 2024 02:00 PM ET: Graph
>
>
> ISO meeting status
>
> future C++ Std meetings
>
> 2.2 Paper reviews
> Review BSI Graph feedback:
> As Oliver (Rosten) said "The basic premise is important, and it would be
> fantastic to have support for graphs in the standard."
>
> The main items identified were:
> Oliver:
> - This paper is long and incomplete, it has lots of details which I think
> to be irrelevant, however things that are definitely relevant are missing
> from the paper - for example definition of graph - since people have
> different ideas. We need to add a mathematical perspective to the paper.
>
> - The structure of the paper completely changed in the new revision, so now
> it’s hard to understand what and why they have done
>
> - Another missing part is discussion of graph invariants
>
> Tom (Deakin): There’s a big missing part in “Prior art” part, GraphBLAS (
> https://graphblas.org
> <https://protect.checkpoint.com/v2/r01/___https://graphblas.org/___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2ZDIzOjQ2ZjA1OWFlOTEyYWQ5YWE4YjJjOTQyMDlmZWU0NDQ5NDFkYTlkYzUwNzVkMzk0YWY5NzM4MjA0ODk5ZmNkY2I6aDpUOk4>)
> eminently.
>
> Some other things to add:
>
> 1. The electrical circuit example needs more explanation, and I think this
> will highlight some deep issues around representing things which are
> seemingly trivially graphs, as graphs in practice. In what sense is a
> bog-standard resistor directed? I assume the reason that the graph is
> directed is because current has a sign and in an undirected graph it
> becomes ambiguous which way the current is flowing (also you may want
> components like diodes). But the directed representation also has issues:
> "can current flow from 'Vdd' to 'n0'?" should be immediately answerable
> from the properties of Vdd and its edges. There are other ways to represent
> an electrical circuit. One is as a directed graph but with incident edges
> recorded - but iiuc, this is excluded from the latest version of the paper.
> Alternatively, one could have a mathematical object, the name of which I
> actually don't know: it looks like an undirected graph, but where each
> partial edge has additional, unique, end-point data, as well as the common
> weight. Things like this are the reason why I think we need a broader group
> to look at this proposal (i.e. beyond SG19) and if we possibly can we
> should involve someone from the mathematics community. Otherwise there's a
> real danger we end up missing important insights.
>
> 2. My comment about the structure of the paper changing was a reference to
> previous comparisons with boost::graph. I'm sure these were in an earlier
> version, or am I misremembering? Either way, it would be very helpful to
> have a proper discussion of e.g. the move away from visitors.
>
> 3. Re. the definition of a graph, there needs to be a proper discussion
> about whether the paper's definition of graph is what some authors call a
> multigraph and whether it does/does not include loops. These things are
> mentioned, in passing, when introducing algorithms, but terminology needs
> to be properly established.
>
> 4. I think we're trying to do too much in one go in this paper. I think a
> great first step would be to build on mdspan and try to standardize (or at
> least understand) what might reasonably be called an unstructured span.
> This could be represented as a vector of vectors or as a vector with some
> auxiliary storage indicating where the partitions fall. The point is that
> an unstructured span, with the right invariants, is an adjacency list. If
> we can understand unstructured span and its desirable api, I think this
> will be incredibly valuable guidance for what a standardized graph
> container might look like.
>
> 5. IIUC, this paper excludes pure connectivity graphs. These are incredibly
> helpful and, if I've understood correctly that they are not supported,
> would be a major omission. Another good reason, imo, to start with
> unstructured span!
>
> 6. I'm not convinced by the load api. We don't have a load api for vector
> etc. Moreover, would it not be preferable to have appropriate constructors?
>
>
> 2.2.1: ML topics
>
> 2.2.1.1 Graph Proposal Phil Ratsloff et al
>
> Latest paper:
>
> Here’s a link to the paper (different than the previous paper reviewed).
> There are some additional updates I’m planning on making before the
> meeting.
>
>
> https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozYzI2OmU1OWNkYWVlNDU3NDg1MWRlMzM3NzNlOTBhMmRkNWI1MDExNGFhOWUxODEzMjlmNzAyOTgxNWYxZTUyZGIxZjg6aDpUOk4>
>
>
>
>
> P1709R3:
>
> https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2YzU3OmEwNDgyMThlNjlkM2QyMGYyYWE2NWU3NTI1MThmNDFkMmE5NzdhY2I4NGE3MzU2NmUwZjRhNDhhYzk0ZmYzZmE6aDpUOk4>
>
>
> https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2OTIzOjFiMmU3YWYyMDQwYzAzOWM0ZjM0YWZlYzlmNzRhYjJiMjZkMzZjYzE3ZWM5Yjg2YjM3MTZlM2EyZGRkNWU1MTU6aDpUOk4>
>
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzphZjA0Ojk4MzI2ZDViY2U5OWExZTcyZTVmNTRkODc2MWJhZWJhN2YzMWIwMDNjMjZmZjhlZWZhY2IzNTg2MTY0ZDkyNDI6aDpUOk4>
> >
>
> <
>
> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd%23heading=h.9ogkehmdmtel___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzphMzgxOjkyYzllODQyNWIwOGNhZWFlNWE2ZDQwNTNjNjQ0MTYxODBjOWYwMmE0YTNkYmY0ZmYwYjQxNWIwZGJjNjIzZjc6aDpUOk4>
> *>*
>
> Array copy semantics:
> array copy-semantics paper P1997 "Relaxing Restrictions on Arrays",
> https://wg21.link/p1997
> <https://protect.checkpoint.com/v2/r01/___https://wg21.link/p1997___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5M2ZlOjVhZjE5NGRkMWFhMWY2MDgwYjg1OWJkMzQ1ZDFlZTUwOWI3NzMyMjQxMDI3YWJjNzJiOTk5MDE2MzQ5MjYyNDA6aDpUOk4>
>
> Stats feedback:
>
> P2376R0
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2MWNkOmQyNzAyYTQ2M2Y2YWUwY2M5NGZjMTI0MDQzYzg2OGMwNTkzMzAwNGYwMmU4MWE5YmI2ZTIyMDMzYzU0ZGI1MTk6aDpUOk4>
> >
> Comments
> on Simple Statistical Functions (p1708r4): Contracts, Exceptions and
> Special cases Johan Lundberg
>
> 2.2.1.2 Reinforcement Learning Larry Lewis Jorge Silva
>
> Reinforcement Learning proposal:
>
> 2.2.1.3 Differential Calculus:
>
>
> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd%23heading=h.9ogkehmdmtel___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozYmI4OmY2YjVkYTBkYzM2MjRjNDkwZjdlYWVhNzFhY2YwYWJjOTgwNDFiNmMxN2ZiYTVlYWYwNzBlMGJmYWRjNWE5OGM6aDpUOk4>
>
> 2.2.1.4
> <https://protect.checkpoint.com/v2/r01/___http://2.2.1.4___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkMjI3OjJhZmZkYzRkNzM0NWI1ZjQ4M2E1OWNlMTE4Mzc4NTViZjM1OTk1MDYxZjAwNGZkNTVmMjc5YjdkZTQyODA5NzY6aDpUOk4>:
> Stats paper
>
> P2681R0
> <https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2681r0.pdf
> <https://protect.checkpoint.com/v2/r01/___https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2681r0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMDE0OmJkMWMzYTgzNzA3ZWFlZmZmOWZkYzU0OWRmMjBjMDhhZjIzMWJiYjU2ZjVhZDYyMWNiZmUyZTk2NWM2NGMwMGY6aDpUOk4>>
> More
> Stats Functions Richard Dosselmann, Michael Wong
> Current github
>
> https://github.com/cplusplus/papers/issues/475
>
> https://github.com/cplusplus/papers/issues/979
>
> Stats review Richard Dosselman et al
>
> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpjZjI3OjE3Y2I3NWIzMzE5NWRjZDI3MTdlZTBlNWVhZWRjYjdmNWQ0YjgxZmUxYThlMjQyNTQ5MWQ3MjhhN2VkMmJjYzY6aDpUOk4>
>
> Feedback from Johan Lundberg and Oleksandr Korval
>
> https://isocpp.org/files/papers/D2376R0.pdf
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/files/papers/D2376R0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMWZjOjZiNDNiNTQwNTc4MTRiNWU4ZGFiODQxYzk3NjEyZWQyYzViYWQyNTc4MGFiNDAyNDU4OWU5NDFmODIyZWM4MTg6aDpUOk4>
>
> P1708R3: Math proposal for Machine Learning: 3rd review
>
> PXXXX: combinatorics: 1st Review
>
> *> std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
> <https://protect.checkpoint.com/v2/r01/___http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3ODM1OmZmMWE1NjhjOWExZTJhYjA0MmU1ZTliMDgxZjA1OGYwMTJlNmM4OGI1MGRiMzFjODhkMjVmOTMyMGE5OTU1MzQ6aDpUOk4>
> <http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
> <https://protect.checkpoint.com/v2/r01/___http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzowNWM1OmYyZmU4ZGRjYzc2YjlhZWM4Y2ZlYmQ0YTc1YmM3MGE2ZTljN2I5NzVhYzEyMjExZGU5MDk0MGU0Zjk2OWMxYjg6aDpUOk4>
> >*
> *> above is the stats paper that was reviewed in Prague*
> *> http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
> <https://protect.checkpoint.com/v2/r01/___http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpjMTRiOmZiNjRmYzliOTViMTRlNGYwZGE0ZDA3YjQxNWE4MWE1YTRmMjEwOTQxNjY1MmY5ZGFlMDU5NWI2NTlhYmUxZjM6aDpUOk4>
> <http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
> <https://protect.checkpoint.com/v2/r01/___http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzplZDBjOmUzY2UxNmViMGJjYmEyODMxMWEyYWFmNjRkYzNjOWM1MDFkYTIyZTc2ZTA0MWViNTRjN2Y0NTY5M2ZjYjEyMjE6aDpUOk4>
> >*
> *>*
> *> Review Jolanta Polish feedback.*
> *> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2MTE0OjMwZTU1Mjc3YzE2ZmRjNmVmOGMyZDY3YjFhYWJlY2M1YzcwZDY2NGFjODQ4NmU4N2M1NTI3NzQzYjZjMTM3MGM6aDpUOk4>
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo0MjhhOjUxNDAzYzhiMDU0YmYyNGQwOGZhYWRiMzc0MGQ3OTBlZjU0MjM0ZTkzOTg0OWRlMTIzZGRkNDAwMzUzOWJiMDE6aDpUOk4>
> >*
>
>
> 2.2.1.4
> <https://protect.checkpoint.com/v2/r01/___http://2.2.1.4___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkNjA4OmFlMmZmMWI5YzgxNzViYzVlMzJmZTk1ZDllZGNiNDI3NmUzYzYwYmM0OWNlMDNkZWJiNDM5ZDUyMGM3MWQwMDk6aDpUOk4>:
> Matrix paper
>
> 2.2.3 any other proposal for reviews?
>
> 2.3 Other Papers and proposals
>
> P1416R1: SG19 - Linear Algebra for Data Science and Machine Learning
>
> https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit#heading=h.tj9hitg7dbtr
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit%23heading=h.tj9hitg7dbtr___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3YTI3OjJmODQ0MTljMjI0ZTNjY2FiOGNkMjM1MmNmZTA0YTVjMzU0MzYwZDcxZTgyYmY2OGJjY2QxYTE5YWRiYTFmODg6aDpUOk4>
>
> P1415: Machine Learning Layered list
>
> https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit#heading=h.tj9hitg7dbtr
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit%23heading=h.tj9hitg7dbtr___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo4NGU2OjQwNjkwNjFiZWJjZGE0ZTg3M2Y5NDlmMDFlMjg4NjRjMDQ0ZmZmYWJhMGFjODExZWE3OGIwZmViZmJhOWJhZjU6aDpUOk4>
>
> 2.2.2 SG14 Linear Algebra progress:
> Different layers of proposal
>
> https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMzkwOmMzMjBjMGJkMzUwOTk3NmE5M2NmYjYzN2NkNzliZjI2YjA1ZjQwODA0ZTU2ODg3YmVlYjRmOTMxMDlkMDZiZmU6aDpUOk4>
>
> 2.5 Future F2F meetings:
>
> 2.6 future C++ Standard meetings:
> https://isocpp.org/std/meetings-and-participation/upcoming-meetings
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/std/meetings-and-participation/upcoming-meetings___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MDZkOmE1YjdkNmEyODM1YjJhNjJiYzg0NmJlNjRlYzUxMjA0N2E2MjkzMGE4NGUxNmVmNjEwYWUxOWUyZWRmMTNlN2Y6aDpUOk4>
>
> None
>
> 3. Any other business
>
> New reflector
>
> http://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___http://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoyYWY4OjMyOTA0ODM5ZWE4MmEwZTU1NzYwNzY0OWQ2YTdmZWI3ODRmYTk0NDE0OTNkZDQzMjM4NWE0NTYyYTA4MTI3NGI6aDpUOk4>
>
> Old Reflector
> https://groups.google.com/a/isocpp.org/forum/#!newtopic/sg19
> <https://protect.checkpoint.com/v2/r01/___https://groups.google.com/a/isocpp.org/forum/%23!newtopic/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpiZTY4OjU1ZTI2YmU0NDAwN2ExNTU4MTJiOWY1YjE2MGE2YTQ4MTdjMDIwNTNmZTAxNjNjZmZjMTYyNDdkYTkyZDBiNzI6aDpUOk4>
> <https://groups.google.com/a/isocpp.org/forum/?fromgroups=#!forum/sg14
> <https://protect.checkpoint.com/v2/r01/___https://groups.google.com/a/isocpp.org/forum/?fromgroups=%23!forum/sg14___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmMGFlOjZlNmJkZjY2ODliNGU2YTMwYzQ4YjllNzllNWMxZGNkY2Y4NTNlYTExZGEzZjNjNzVjM2UwNzg3ZDI2OTM4NGM6aDpUOk4>
> >
>
> Code and proposal Staging area
>
> 4. Review
>
> 4.1 Review and approve resolutions and issues [e.g., changes to SG's
> working draft]
>
> 4.2 Review action items (5 min)
>
> 5. Closing process
>
> 5.1 Establish next agenda
>
>
> 5.2 Future meeting
> * Jan 11, 2024 02:00 PM ET: Graph DONE
> * Feb 8, 2024 02:00 PM ET: Graph DONE
> * Mar 14, 2024 02:00 PM ET: Cancelled due to Tokyo 3-18-23
> * Apr 11, 2024 02:00 PM ET: Stats/Graph DONE
> * May 9, 2024 02:00 PM ET: Graph DONE
> * June 13, 2024 02:00 PM ET: Graph; St.louis 6-24-29 DONE
> * July 11, 2024 02:00 PM ET: Stats
> * Aug 15, 2024 02:00 PM ET: Graph
> * Sep 12, 2024 02:00 PM ET: CPPCON Sept 15-20 so cancelled
> * Oct 10, 2024 02:00 PM ET: Stats
> * Nov 14, 2024 02:00 PM ET: Cancelled Wroclaw F2F
> * Dec 12, 2024 02:00 PM ET: Graph
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozZWU5OjhiODlhMDBlZjhhODVjN2E2YjNkYjE4ZWRiYTEzMGZhMjM3NzI0ZGZjNzI0MzBjMzg4NDU1ZGNjMzM5NzdiMmE6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozM2ZmOmRmYjM1OThlZjZhN2Y3Zjc0ZWFkYzkwN2QxMjk1NzA2MTExMTYyMWMyZjcxM2JhMTU4NTU5ODY4ZjBlMDAyY2I6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3N2RlOmE5N2Q4NTg5YzdmYzk1ZjIxZGQ3YmNlYmMxM2E1NWRiZDU1ZGU2NWJkZTg0OGEzYmZiMmEyMGM4NmZhYzYwMGU6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmZjE3Ojk2NjlkOTIxNmJiNDMxZjgxY2E1MmQ1NzNjYTAzNTI3MDM4NDc0NTYxYzBlYjQ3NDYyZDEzYTA3OWU1ZWUwYzg6aDpUOk4>
>
>
I'm very busy for the next four weeks. However, thereafter, I hope to have
significant free cycles and so will provisionally plan to have a go at
implementing your new ideas. It seemed a helpful exercise last time around,
so hopefully will be similarly illuminating.
O.
On Fri, 18 Oct 2024 at 22:21, Phil Ratzloff <Phil.Ratzloff_at_[hidden]> wrote:
> I’m preparing to make a big change to the library to use descriptors like
> boost::graph uses. There are three implications. The first, is that the
> vertex functions in the Graph Container Interface will replace vertex id
> and vertex reference with a vertex descriptor, and edge functions will
> replace edge reference with vertex descriptor. The second implication is
> that the number of concepts, views and functions will shrink because of
> this. Lastly, it will become easier to write generic algorithms without
> specializations for vertices in random-access vs. bidirectional containers.
>
>
>
> In practice, the descriptor is either an integral index (contiguous or
> random-access container) or an iterator (bidirectional or forward
> container).
>
>
>
> The structure and logic of the proposal won’t change.
>
>
>
> There are already structs using the “descriptor” name, like
> vertex_descriptor, which will need to be changed to something else, like
> vertex_info. I felt it was better to retain the term from boost::graph to
> help people transition easier.
>
>
>
>
>
>
>
> *From:* Jeremy Murphy <jeremy.william.murphy_at_[hidden]>
> *Sent:* Sunday, October 13, 2024 7:05 AM
> *To:* Phil Ratzloff <Phil.Ratzloff_at_[hidden]>
> *Cc:* sg19_at_[hidden]; Oliver Rosten <oliver.rosten_at_[hidden]>
> *Subject:* Re: [isocpp-sg19] SG19 Oct 10 2024 telecon
>
>
>
> *EXTERNAL*
>
> Thanks for the update, Phil, I'll focus my attention on the active papers
> then.
>
>
>
>
>
> On Sat, 12 Oct 2024 at 01:42, Phil Ratzloff <Phil.Ratzloff_at_[hidden]> wrote:
>
> Hey, Jeremy. P1709 has been expanded into multiple papers and is no longer
> active. P3126..3131 are the currently active papers. They’re the chapters
> from P1709 to avoid a mega-paper no one will read. There’s an additional
> paper that hasn’t been written yet (P3337) to compare boost::graph with the
> proposal in terms of syntax and performance – we’re still gathering
> information before it can be written.
>
>
>
> Things have evolved since then. I’d suggest that you get familiar with the
> updated papers. Ideally you’d attend the monthly SG19 meetings, or
> alternatively, send your comments/suggestions here.
>
>
>
>
>
> *From:* SG19 <sg19-bounces_at_[hidden]> *On Behalf Of *Jeremy Murphy
> via SG19
> *Sent:* Friday, October 11, 2024 6:46 AM
> *To:* sg19_at_[hidden]
> *Cc:* Jeremy Murphy <jeremy.william.murphy_at_[hidden]>; Oliver Rosten <
> oliver.rosten_at_[hidden]>
> *Subject:* Re: [isocpp-sg19] SG19 Oct 10 2024 telecon
>
>
>
> *EXTERNAL*
>
> Hi everyone,
>
>
>
> I've been lurking on the list for a while and after I read through
> Michael's email and had a quick look at P1709R3c, I thought maybe I can
> actually contribute something here. I'm the current maintainer of
> Boost.Graph, so I have some familiarity with the area. Anyway, that's just
> a quick introduction and hello so that you're not surprised by someone
> unfamiliar making suggestions in Google Docs, which I might not get around
> to for a few days yet.
>
>
>
> Cheers.
>
>
>
> Jeremy
>
>
>
>
>
> On Fri, 11 Oct 2024 at 05:02, Michael Wong via SG19 <sg19_at_[hidden]>
> wrote:
>
> Get well. We will miss you. Make sure its not covid.
>
>
>
> On Thu, Oct 10, 2024 at 4:26 AM Oliver Rosten via SG19 <
> sg19_at_[hidden]> wrote:
>
> Unfortunately I've caught a really heavy cold so won't be able to attend
> either.
>
>
>
> But I hope to catch up on Phil's latest ideas once I'm better.
>
>
>
> O.
>
>
>
> On Thu, 10 Oct 2024 at 09:08, Guy Davidson via SG19 <sg19_at_[hidden]>
> wrote:
>
> I will be in Breda at C++ Under The Sea so I won't be able to attend.
>
>
>
> Cheers,
>
> G
>
>
>
> On Tue, 8 Oct 2024 at 21:11, Michael Wong via SG19 <sg19_at_[hidden]>
> wrote:
>
> Hi, this SG19 meeting will focus on stats and graphs. I know we just met 2
> weeks ago so there may not be a lot of progress yet,
> in which case this will be just a short recap/planning meeting.
>
> Michael Wong is inviting you to a scheduled Zoom meeting.
>
> Topic: SG19 monthly
> Time: 2nd Thursdays 02:00 PM Eastern Time (US and Canada)
> Every month on the Second Thu,
>
>
> Join from PC, Mac, Linux, iOS or Android:
>
> https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/j/93084591725?pwd=K3QxZjJlcnljaE13ZWU5cTlLNkx0Zz09___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MjI4OjY1NmM1MzU5NjdiZmZiN2M1MjU3NmE0YTNiZTY5OGZiM2JiYTQ3NzAwMjQ3M2UwZTY1Yzc4MzI0NjYzOWFhZDc6aDpUOk4>
> Password: 035530
>
> Or iPhone one-tap :
> US: +13017158592,,93084591725# or +13126266799,,93084591725#
> Or Telephone:
> Dial(for higher quality, dial a number based on your current location):
> US: +1 301 715 8592 or +1 312 626 6799 or +1 346 248 7799 or +1
> 408 638 0968 or +1 646 876 9923 or +1 669 900 6833 or +1 253 215 8782
> or 877 853 5247 (Toll Free)
> Meeting ID: 930 8459 1725
> Password: 035530
> International numbers available: https://iso.zoom.us/u/agewu4X97
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/u/agewu4X97___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozN2ViOjIxY2U1ZjNiZGZhNDUzNDVmZTJmZmFlYWYzMjNjYWMzOTFiY2Y4YzY1ZmIzM2VmYzM0MGNmOTg5MDc5MTMzYjI6aDpUOk4>
>
> Or Skype for Business (Lync):
> https://iso.zoom.us/skype/93084591725
> <https://protect.checkpoint.com/v2/r01/___https://iso.zoom.us/skype/93084591725___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmZmU5Ojk3OWE3ZjU2YTUyYjM1Y2Q4OGVlN2UxZGYxODA3MjZmMzY3ODRlNzkwNDU1YTA2NDNjODZjMGVmZmVkMWViYjE6aDpUOk4>
>
> Agenda:
>
> 1. Opening and introductions
>
> The ISO Code of conduct:
> https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf
> <https://protect.checkpoint.com/v2/r01/___https://www.iso.org/files/live/sites/isoorg/files/store/en/PUB100397.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5ZTlhOjliZDEyYTI0ZDAyZTc5NzI2N2Q3ZDRlZjcwY2EyZDhhMzViYmVjYWQ1YTQxMmE4NTkzYzJiNjM1NTBiNDdmNDY6aDpUOk4>
>
> IEC Code of Conduct:
>
> https://www.iec.ch/basecamp/iec-code-conduct-technical-work
> <https://protect.checkpoint.com/v2/r01/___https://www.iec.ch/basecamp/iec-code-conduct-technical-work___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MDMxOjRjYzdmOWVlZWVhMWJmYTYxMWEwZmRiYjZmNzYzM2EzMTA1MDFjOTBlYzI4YjNlZDZiNzg4ZTI2NjM1MDkwOGU6aDpUOk4>
>
> ISO patent policy.
>
>
> https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2
> <https://protect.checkpoint.com/v2/r01/___https://isotc.iso.org/livelink/livelink/fetch/2000/2122/3770791/Common_Policy.htm?nodeid=6344764&vernum=-2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkYWQ3OmVmZGFhMDA0MGU0MTFkMDZlMDVjNDdjZGRkY2M0MTc5MTY5NWRlOGRkNDYzNGFhMjNhZjlkODU0YzU3YzkyMzA6aDpUOk4>
>
> The WG21 Practices and Procedures and Code of Conduct:
>
> https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/std/standing-documents/sd-4-wg21-practices-and-procedures___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpiZmE4OjZmYmEwZTlhOWI5MmMwMzNhNTkyMWJiNDZhYjQxNmVlODU5OTdjMjg2NmUwZDVjZjI1YWQ4YWJhMTAxZDhiZjA6aDpUOk4>
>
> 1.1 Roll call of participants
>
> 1.2 Adopt agenda
>
> 1.3 Approve minutes from previous meeting, and approve publishing
> previously approved minutes to ISOCPP.org
>
> 1.4 Action items from previous meetings
>
> 2. Main issues (125 min)
>
> 2.1 General logistics
>
> Meeting plan, focus on one paper per meeting but does not preclude other
> paper
> updates.
>
> 2024 planning
> C++23 and C++26 status
> CPPCON 2024
>
>
> * Jan 11, 2024 02:00 PM ET: Graph DONE
> * Feb 8, 2024 02:00 PM ET: Graph DONE
> * Mar 14, 2024 02:00 PM ET: Cancelled due to Tokyo 3-18-23
> * Apr 11, 2024 02:00 PM ET: Stats/Graph DONE
> * May 9, 2024 02:00 PM ET: Graph DONE
> * June 13, 2024 02:00 PM ET: Graph; St.louis 6-24-29 DONE
> * July 11, 2024 02:00 PM ET: Stats/ Graphs DONE
> * Aug 15, 2024 02:00 PM ET: Graph DONE
> * Sep 12, 2024 02:00 PM ET: CPPCON Sept 15-20 so canceled DONE
> * Oct 10, 2024 02:00 PM ET: Stats
> * Nov 14, 2024 02:00 PM ET: Cancelled Wroclaw F2F
> * Dec 12, 2024 02:00 PM ET: Graph
>
>
> ISO meeting status
>
> future C++ Std meetings
>
> 2.2 Paper reviews
> Review BSI Graph feedback:
> As Oliver (Rosten) said "The basic premise is important, and it would be
> fantastic to have support for graphs in the standard."
>
> The main items identified were:
> Oliver:
> - This paper is long and incomplete, it has lots of details which I think
> to be irrelevant, however things that are definitely relevant are missing
> from the paper - for example definition of graph - since people have
> different ideas. We need to add a mathematical perspective to the paper.
>
> - The structure of the paper completely changed in the new revision, so now
> it’s hard to understand what and why they have done
>
> - Another missing part is discussion of graph invariants
>
> Tom (Deakin): There’s a big missing part in “Prior art” part, GraphBLAS (
> https://graphblas.org
> <https://protect.checkpoint.com/v2/r01/___https://graphblas.org/___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2ZDIzOjQ2ZjA1OWFlOTEyYWQ5YWE4YjJjOTQyMDlmZWU0NDQ5NDFkYTlkYzUwNzVkMzk0YWY5NzM4MjA0ODk5ZmNkY2I6aDpUOk4>)
> eminently.
>
> Some other things to add:
>
> 1. The electrical circuit example needs more explanation, and I think this
> will highlight some deep issues around representing things which are
> seemingly trivially graphs, as graphs in practice. In what sense is a
> bog-standard resistor directed? I assume the reason that the graph is
> directed is because current has a sign and in an undirected graph it
> becomes ambiguous which way the current is flowing (also you may want
> components like diodes). But the directed representation also has issues:
> "can current flow from 'Vdd' to 'n0'?" should be immediately answerable
> from the properties of Vdd and its edges. There are other ways to represent
> an electrical circuit. One is as a directed graph but with incident edges
> recorded - but iiuc, this is excluded from the latest version of the paper.
> Alternatively, one could have a mathematical object, the name of which I
> actually don't know: it looks like an undirected graph, but where each
> partial edge has additional, unique, end-point data, as well as the common
> weight. Things like this are the reason why I think we need a broader group
> to look at this proposal (i.e. beyond SG19) and if we possibly can we
> should involve someone from the mathematics community. Otherwise there's a
> real danger we end up missing important insights.
>
> 2. My comment about the structure of the paper changing was a reference to
> previous comparisons with boost::graph. I'm sure these were in an earlier
> version, or am I misremembering? Either way, it would be very helpful to
> have a proper discussion of e.g. the move away from visitors.
>
> 3. Re. the definition of a graph, there needs to be a proper discussion
> about whether the paper's definition of graph is what some authors call a
> multigraph and whether it does/does not include loops. These things are
> mentioned, in passing, when introducing algorithms, but terminology needs
> to be properly established.
>
> 4. I think we're trying to do too much in one go in this paper. I think a
> great first step would be to build on mdspan and try to standardize (or at
> least understand) what might reasonably be called an unstructured span.
> This could be represented as a vector of vectors or as a vector with some
> auxiliary storage indicating where the partitions fall. The point is that
> an unstructured span, with the right invariants, is an adjacency list. If
> we can understand unstructured span and its desirable api, I think this
> will be incredibly valuable guidance for what a standardized graph
> container might look like.
>
> 5. IIUC, this paper excludes pure connectivity graphs. These are incredibly
> helpful and, if I've understood correctly that they are not supported,
> would be a major omission. Another good reason, imo, to start with
> unstructured span!
>
> 6. I'm not convinced by the load api. We don't have a load api for vector
> etc. Moreover, would it not be preferable to have appropriate constructors?
>
>
> 2.2.1: ML topics
>
> 2.2.1.1 Graph Proposal Phil Ratsloff et al
>
> Latest paper:
>
> Here’s a link to the paper (different than the previous paper reviewed).
> There are some additional updates I’m planning on making before the
> meeting.
>
>
> https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1OpH-xxRri7tJTtJJIZTYmSHkkrZJkdBwm9zJ7LqolfQ/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozYzI2OmU1OWNkYWVlNDU3NDg1MWRlMzM3NzNlOTBhMmRkNWI1MDExNGFhOWUxODEzMjlmNzAyOTgxNWYxZTUyZGIxZjg6aDpUOk4>
>
>
>
>
> P1709R3:
>
> https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1kLHhbSTX7j0tPeTYECQFSNx3R35Mu3xO5_dyYdRy4dM/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2YzU3OmEwNDgyMThlNjlkM2QyMGYyYWE2NWU3NTI1MThmNDFkMmE5NzdhY2I4NGE3MzU2NmUwZjRhNDhhYzk0ZmYzZmE6aDpUOk4>
>
>
> https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1QkfDzGyfNQKs86y053M0YHOLP6frzhTJqzg1Ug_vkkE/edit?usp=sharing___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2OTIzOjFiMmU3YWYyMDQwYzAzOWM0ZjM0YWZlYzlmNzRhYjJiMjZkMzZjYzE3ZWM5Yjg2YjM3MTZlM2EyZGRkNWU1MTU6aDpUOk4>
>
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzphZjA0Ojk4MzI2ZDViY2U5OWExZTcyZTVmNTRkODc2MWJhZWJhN2YzMWIwMDNjMjZmZjhlZWZhY2IzNTg2MTY0ZDkyNDI6aDpUOk4>
> >
>
> <
>
> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd%23heading=h.9ogkehmdmtel___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzphMzgxOjkyYzllODQyNWIwOGNhZWFlNWE2ZDQwNTNjNjQ0MTYxODBjOWYwMmE0YTNkYmY0ZmYwYjQxNWIwZGJjNjIzZjc6aDpUOk4>
> *>*
>
> Array copy semantics:
> array copy-semantics paper P1997 "Relaxing Restrictions on Arrays",
> https://wg21.link/p1997
> <https://protect.checkpoint.com/v2/r01/___https://wg21.link/p1997___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5M2ZlOjVhZjE5NGRkMWFhMWY2MDgwYjg1OWJkMzQ1ZDFlZTUwOWI3NzMyMjQxMDI3YWJjNzJiOTk5MDE2MzQ5MjYyNDA6aDpUOk4>
>
> Stats feedback:
>
> P2376R0
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p2376r0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2MWNkOmQyNzAyYTQ2M2Y2YWUwY2M5NGZjMTI0MDQzYzg2OGMwNTkzMzAwNGYwMmU4MWE5YmI2ZTIyMDMzYzU0ZGI1MTk6aDpUOk4>
> >
> Comments
> on Simple Statistical Functions (p1708r4): Contracts, Exceptions and
> Special cases Johan Lundberg
>
> 2.2.1.2 Reinforcement Learning Larry Lewis Jorge Silva
>
> Reinforcement Learning proposal:
>
> 2.2.1.3 Differential Calculus:
>
>
> https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd#heading=h.9ogkehmdmtel
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/175wIm8o4BNGti0WLq8U6uZORegKVjmnpfc-_E8PoGS0/edit?ts=5fff27cd%23heading=h.9ogkehmdmtel___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozYmI4OmY2YjVkYTBkYzM2MjRjNDkwZjdlYWVhNzFhY2YwYWJjOTgwNDFiNmMxN2ZiYTVlYWYwNzBlMGJmYWRjNWE5OGM6aDpUOk4>
>
> 2.2.1.4
> <https://protect.checkpoint.com/v2/r01/___http://2.2.1.4___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkMjI3OjJhZmZkYzRkNzM0NWI1ZjQ4M2E1OWNlMTE4Mzc4NTViZjM1OTk1MDYxZjAwNGZkNTVmMjc5YjdkZTQyODA5NzY6aDpUOk4>:
> Stats paper
>
> P2681R0
> <https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2681r0.pdf
> <https://protect.checkpoint.com/v2/r01/___https://www.open-std.org/jtc1/sc22/wg21/docs/papers/2022/p2681r0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMDE0OmJkMWMzYTgzNzA3ZWFlZmZmOWZkYzU0OWRmMjBjMDhhZjIzMWJiYjU2ZjVhZDYyMWNiZmUyZTk2NWM2NGMwMGY6aDpUOk4>>
> More
> Stats Functions Richard Dosselmann, Michael Wong
> Current github
>
> https://github.com/cplusplus/papers/issues/475
>
> https://github.com/cplusplus/papers/issues/979
>
> Stats review Richard Dosselman et al
>
> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2021/p1708r4.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpjZjI3OjE3Y2I3NWIzMzE5NWRjZDI3MTdlZTBlNWVhZWRjYjdmNWQ0YjgxZmUxYThlMjQyNTQ5MWQ3MjhhN2VkMmJjYzY6aDpUOk4>
>
> Feedback from Johan Lundberg and Oleksandr Korval
>
> https://isocpp.org/files/papers/D2376R0.pdf
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/files/papers/D2376R0.pdf___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMWZjOjZiNDNiNTQwNTc4MTRiNWU4ZGFiODQxYzk3NjEyZWQyYzViYWQyNTc4MGFiNDAyNDU4OWU5NDFmODIyZWM4MTg6aDpUOk4>
>
> P1708R3: Math proposal for Machine Learning: 3rd review
>
> PXXXX: combinatorics: 1st Review
>
> *> std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
> <https://protect.checkpoint.com/v2/r01/___http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3ODM1OmZmMWE1NjhjOWExZTJhYjA0MmU1ZTliMDgxZjA1OGYwMTJlNmM4OGI1MGRiMzFjODhkMjVmOTMyMGE5OTU1MzQ6aDpUOk4>
> <http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2
> <https://protect.checkpoint.com/v2/r01/___http://std.org/jtc1/sc22/wg21/docs/papers/2020/p1708r2___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzowNWM1OmYyZmU4ZGRjYzc2YjlhZWM4Y2ZlYmQ0YTc1YmM3MGE2ZTljN2I5NzVhYzEyMjExZGU5MDk0MGU0Zjk2OWMxYjg6aDpUOk4>
> >*
> *> above is the stats paper that was reviewed in Prague*
> *> http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
> <https://protect.checkpoint.com/v2/r01/___http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpjMTRiOmZiNjRmYzliOTViMTRlNGYwZGE0ZDA3YjQxNWE4MWE1YTRmMjEwOTQxNjY1MmY5ZGFlMDU5NWI2NTlhYmUxZjM6aDpUOk4>
> <http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19
> <https://protect.checkpoint.com/v2/r01/___http://wiki.edg.com/bin/view/Wg21prague/P1708R2SG19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzplZDBjOmUzY2UxNmViMGJjYmEyODMxMWEyYWFmNjRkYzNjOWM1MDFkYTIyZTc2ZTA0MWViNTRjN2Y0NTY5M2ZjYjEyMjE6aDpUOk4>
> >*
> *>*
> *> Review Jolanta Polish feedback.*
> *> http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo2MTE0OjMwZTU1Mjc3YzE2ZmRjNmVmOGMyZDY3YjFhYWJlY2M1YzcwZDY2NGFjODQ4NmU4N2M1NTI3NzQzYjZjMTM3MGM6aDpUOk4>
> <http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html
> <https://protect.checkpoint.com/v2/r01/___http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2020/p2119r0.html___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo0MjhhOjUxNDAzYzhiMDU0YmYyNGQwOGZhYWRiMzc0MGQ3OTBlZjU0MjM0ZTkzOTg0OWRlMTIzZGRkNDAwMzUzOWJiMDE6aDpUOk4>
> >*
>
>
> 2.2.1.4
> <https://protect.checkpoint.com/v2/r01/___http://2.2.1.4___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpkNjA4OmFlMmZmMWI5YzgxNzViYzVlMzJmZTk1ZDllZGNiNDI3NmUzYzYwYmM0OWNlMDNkZWJiNDM5ZDUyMGM3MWQwMDk6aDpUOk4>:
> Matrix paper
>
> 2.2.3 any other proposal for reviews?
>
> 2.3 Other Papers and proposals
>
> P1416R1: SG19 - Linear Algebra for Data Science and Machine Learning
>
> https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit#heading=h.tj9hitg7dbtr
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1IKUNiUhBgRURW-UkspK7fAAyIhfXuMxjk7xKikK4Yp8/edit%23heading=h.tj9hitg7dbtr___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3YTI3OjJmODQ0MTljMjI0ZTNjY2FiOGNkMjM1MmNmZTA0YTVjMzU0MzYwZDcxZTgyYmY2OGJjY2QxYTE5YWRiYTFmODg6aDpUOk4>
>
> P1415: Machine Learning Layered list
>
> https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit#heading=h.tj9hitg7dbtr
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1elNFdIXWoetbxjO1OKol_Wj8fyi4Z4hogfj5tLVSj64/edit%23heading=h.tj9hitg7dbtr___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo4NGU2OjQwNjkwNjFiZWJjZGE0ZTg3M2Y5NDlmMDFlMjg4NjRjMDQ0ZmZmYWJhMGFjODExZWE3OGIwZmViZmJhOWJhZjU6aDpUOk4>
>
> 2.2.2 SG14 Linear Algebra progress:
> Different layers of proposal
>
> https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit
> <https://protect.checkpoint.com/v2/r01/___https://docs.google.com/document/d/1poXfr7mUPovJC9ZQ5SDVM_1Nb6oYAXlK_d0ljdUAtSQ/edit___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoxMzkwOmMzMjBjMGJkMzUwOTk3NmE5M2NmYjYzN2NkNzliZjI2YjA1ZjQwODA0ZTU2ODg3YmVlYjRmOTMxMDlkMDZiZmU6aDpUOk4>
>
> 2.5 Future F2F meetings:
>
> 2.6 future C++ Standard meetings:
> https://isocpp.org/std/meetings-and-participation/upcoming-meetings
> <https://protect.checkpoint.com/v2/r01/___https://isocpp.org/std/meetings-and-participation/upcoming-meetings___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo5MDZkOmE1YjdkNmEyODM1YjJhNjJiYzg0NmJlNjRlYzUxMjA0N2E2MjkzMGE4NGUxNmVmNjEwYWUxOWUyZWRmMTNlN2Y6aDpUOk4>
>
> None
>
> 3. Any other business
>
> New reflector
>
> http://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___http://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzoyYWY4OjMyOTA0ODM5ZWE4MmEwZTU1NzYwNzY0OWQ2YTdmZWI3ODRmYTk0NDE0OTNkZDQzMjM4NWE0NTYyYTA4MTI3NGI6aDpUOk4>
>
> Old Reflector
> https://groups.google.com/a/isocpp.org/forum/#!newtopic/sg19
> <https://protect.checkpoint.com/v2/r01/___https://groups.google.com/a/isocpp.org/forum/%23!newtopic/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpiZTY4OjU1ZTI2YmU0NDAwN2ExNTU4MTJiOWY1YjE2MGE2YTQ4MTdjMDIwNTNmZTAxNjNjZmZjMTYyNDdkYTkyZDBiNzI6aDpUOk4>
> <https://groups.google.com/a/isocpp.org/forum/?fromgroups=#!forum/sg14
> <https://protect.checkpoint.com/v2/r01/___https://groups.google.com/a/isocpp.org/forum/?fromgroups=%23!forum/sg14___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmMGFlOjZlNmJkZjY2ODliNGU2YTMwYzQ4YjllNzllNWMxZGNkY2Y4NTNlYTExZGEzZjNjNzVjM2UwNzg3ZDI2OTM4NGM6aDpUOk4>
> >
>
> Code and proposal Staging area
>
> 4. Review
>
> 4.1 Review and approve resolutions and issues [e.g., changes to SG's
> working draft]
>
> 4.2 Review action items (5 min)
>
> 5. Closing process
>
> 5.1 Establish next agenda
>
>
> 5.2 Future meeting
> * Jan 11, 2024 02:00 PM ET: Graph DONE
> * Feb 8, 2024 02:00 PM ET: Graph DONE
> * Mar 14, 2024 02:00 PM ET: Cancelled due to Tokyo 3-18-23
> * Apr 11, 2024 02:00 PM ET: Stats/Graph DONE
> * May 9, 2024 02:00 PM ET: Graph DONE
> * June 13, 2024 02:00 PM ET: Graph; St.louis 6-24-29 DONE
> * July 11, 2024 02:00 PM ET: Stats
> * Aug 15, 2024 02:00 PM ET: Graph
> * Sep 12, 2024 02:00 PM ET: CPPCON Sept 15-20 so cancelled
> * Oct 10, 2024 02:00 PM ET: Stats
> * Nov 14, 2024 02:00 PM ET: Cancelled Wroclaw F2F
> * Dec 12, 2024 02:00 PM ET: Graph
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozZWU5OjhiODlhMDBlZjhhODVjN2E2YjNkYjE4ZWRiYTEzMGZhMjM3NzI0ZGZjNzI0MzBjMzg4NDU1ZGNjMzM5NzdiMmE6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzozM2ZmOmRmYjM1OThlZjZhN2Y3Zjc0ZWFkYzkwN2QxMjk1NzA2MTExMTYyMWMyZjcxM2JhMTU4NTU5ODY4ZjBlMDAyY2I6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6Nzo3N2RlOmE5N2Q4NTg5YzdmYzk1ZjIxZGQ3YmNlYmMxM2E1NWRiZDU1ZGU2NWJkZTg0OGEzYmZiMmEyMGM4NmZhYzYwMGU6aDpUOk4>
>
> --
> SG19 mailing list
> SG19_at_[hidden]
> https://lists.isocpp.org/mailman/listinfo.cgi/sg19
> <https://protect.checkpoint.com/v2/r01/___https://lists.isocpp.org/mailman/listinfo.cgi/sg19___.YzJ1OnNhc2luc3RpdHV0ZTpjOm86ZjUzZWI1NDgxNDhlMWY1YjM0Y2QzY2U2MDhhNDQwY2Q6NzpmZjE3Ojk2NjlkOTIxNmJiNDMxZjgxY2E1MmQ1NzNjYTAzNTI3MDM4NDc0NTYxYzBlYjQ3NDYyZDEzYTA3OWU1ZWUwYzg6aDpUOk4>
>
>
Received on 2024-10-20 12:17:54