Skip to content
PodSubs
ShowsPeopleGuestsJobsNewsEvents
More
BlogPodCred
Menu
ShowsPeopleGuestsJobsNewsEventsBlogPodCredNetworksSign in
Join nowSign in
  • Shows
  • People
  • Jobs
  • News
  • More
    • Guests
    • Events
    • Blog
    • PodCred
    • Networks
    Join nowSign in

ADSP: Algorithms + Data Structures = Programs

ADSP: Algorithms + Data Structures = Programs artwork

Episode 225: CppNorth & Flux Plans, The Slow Death of Twitter and More!

Mar 14, 202531 minAudio

In this episode, Conor and Ben chat with Tristan Brindle about plans for CppNorth 2025, plans for Flux, the slow death of Twitter and more! Link to Episode 225 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast: Twitter Conor Hoekstra: Twitter | BlueSky | Mastodon Ben Deane: Twitter | BlueSky About the Guest Tristan Brindle a freelance programmer and trainer based in London, mostly focussing on C++. He is a member of the UK national body (BSI) and ISO WG21. Occasionally I can be found at C++ conferences. He is also a director of C++ London Uni, a not-for-profit organisation offering free beginner programming classes in London and online. He has a few fun projects on GitHub that you can find out about here. Show Notes Date Generated: 2025-02-17 Date Released: 2025-03-14 CppNorth 2025 Flux Iteration Revisited: A Safer Iteration Model for C++ - Tristan Brindle - CppNorth 2023 ADSP Episode 126: Flux (and Flow) with Tristan Brindle Iterators and Ranges: Comparing C++ to D to Rust - Barry Revzin - [CppNow 2021] Keynote: Iterators and Ranges: Comparing C++ to D, Rust, and Others - Barry Revzin - CPPP 2021 Iteration Inside and Out - Bob Nystrom Blog Expanding the internal iteration API #99 std::distance std::ranges::distance C++ London Meetup Denver C++ Meetup Intro Song Info Miss You by Sarah Jansen https://soundcloud.com/sarahjansenmusic Creative Commons - Attribution 3.0 Unported - CC BY 3.0 Free Download / Stream: http://bit.ly/l-miss-you Music promoted by Audio Library https://youtu.be/iYYxnasvfx8

Audio and video play straight from the show's own hosting. PodSubs stores and serves no media.

Transcript

From the show. Tap a time to play from there.

Trinstan BrindlePhil told me once, Phil Nash, who organized a bunch of conferences, he he told me, I think he said that like they get 80% of their submissions in the last 24 hours before closing. So I am definitely uh one of those people. Leave it to the last minute.

ConorWelcome to ADSP the Podcast, episode 225, recorded on February 17th, 2025. My name is Connor, and today with my co-host Ben, we conclude our conversation with Tristan Brindle. In this episode, we talk about plans for CPP North 2025, plans for flux, the slow death of Twitter, and more.

BenWell, I was gonna I mean I don't know if you were gonna wrap that up, Connor, but I had I was gonna ask Tristan, are you are you playing uh will will we see you in Toronto this year?

Trinstan BrindleOh yeah, absolutely. Well, uh all being well, I I mean I'm going to uh uh if I if I get uh accepted uh for for CPP North, I'd certainly uh like to go again. I've was it it's this will be the fourth one, right?

ConorThis is the fourth, yes. Two of them were at uh the King Edward Hotel, and I believe this one last year was at Microsoft. Yeah, I think it's at Microsoft again. July 20th to 23rd. And Call for Papers is open. Yeah. I know it closes. Today we're recording on February 17th, which is a holiday in Canada.

BenWell, this part of our recording won't maybe come out next week, but part of our recording will.

ConorImportant dates right at the top. It says Call for Speakers closes on the 23rd, which is six days from now, which means by the time you're listening to it, the CFP is closed. However, uh if it gets extended by a month, um it's that like which sometimes it does get extended. I I did see that C now's um CFP window uh got extended.

BenWell it got extended because of the committee meeting, I think. That was the reason they gave, you know, we're extending it to to allow the folks who were at the committee meeting to have time to submit afterwards. Yeah.

ConorSo I mean, odds are listeners, uh, if you were thinking of submitting CFP is closed. I'll say now that maybe there was a possibility that uh future me according to today, but past me according to when you're hearing this, had the energy to insert a CFP closes soon. But these days, whenever I say if I have the energy, I rarely do. Or it's not even that I rarely do, it's that I don't hear myself reminding me to go and do it. So by the time I'm editing this, I've forgotten that I need to add it, and then it's a month later, and I was like, oh yeah, I said I might do that, and then I've forgotten.

BenHave you submitted a talk to CPP North?

ConorI have not. I am still thinking. I've got a couple different ideas, and um, there's a chance too I might be going to uh uh a couple conferences in Australia, actually.

BenOh cranky.

ConorAnd uh they've got a series of conferences um in I believe the three cities are Adelaide, Brisbane, and actually I should get this right uh before, although it might not even be on their website right now.

Trinstan BrindleWhat are the conferences?

ConorThe series of conferences, they're called Yao. Oh, I know them. Which is yeah, I've seen a ton of their talks. In fact, one of my favorite talks of all time is by an individual. Ooh, am I gonna forget his name? Um there's actually two of them, and people confuse them all the time. I can just go to the my list of every single talk I've ever watched, actually. And it was uh the title of it is Vectors in the title. Uh, yes, by Dave Thomas. There's two Dave Thomases, and this is only one of them.

BenThat's the Dave Thomas who wrote Ruby on Reddit?

ConorYes.

BenAm I getting that right? Uh that might have been.

ConorBut this uh Dave Thomas was heavily involved, I think, with organizing the go-to uh conferences, and Yao is like uh sibling or under the same umbrella. And there's a talk that he gave back in 2014 called Living in Big Data with Vector Functional Programming, and it was one of the talks that I watched back in December of 2019 that like was me at the edge of the Alice in Wonderland rabbit hole that is APL and array languages, and uh it's not online anymore though.

ConorIt got moved and it uh actually might be on the internet archive. I always forget to check the internet archive. Anyways, anyways, the point being is they're asking me about topics right now, so I've been trying to think. I will definitely be submitting a talk. But yeah, I I uh I I mean I have a bunch of talk topics, but these days a lot of them are more functional programming, less C.

BenWell, CPP North is looking for general has in previous years been looking for general programming talks as not just C specific things, right?

ConorI mean I wrote the first CFP, but I've gotta be honest, I actually haven't read it since I wasn't program chair. So my guess is it has changed.

BenI haven't submitted yet, although I have been, especially in the last few days, I have been I've been waking up at like 5 a.m. full of thoughts and having to note them down by the side of the case.

ConorAny any preview thoughts? And I will ask Tristan as well, because it sounds like you already submitted. So uh Me? Uh no, I I I have not submitted.

BenSo none of us have submitted, uh yes. And I shouldn't uh I shouldn't prejudice the uh program committee process.

Trinstan BrindlePhil told me once, Phil Nash, who organized a bunch of conferences, he uh he told me, I think he said that like they get 80% of their submissions in the last 24 hours before closing. Wow. Um so I am definitely uh one of those people leave it to the last minute.

ConorI usually put on my calendar one day, one calendar day before the actual deadline that says this is the deadline. And then so usually I'm actually 24 hours in advance, but that's only because I lie to myself about when the deadline is. Um otherwise there's a chance I'll end up missing. But uh but yes, we might all be in the same spot. The question I was gonna circle back to uh was you you mentioned, and it it might have to do with this GitHub PR that I came across um from 2023 about future design plans for Flux.

ConorAnd the the PR title is expanding the internal iteration API, which I'm not sure if that's the same thing, but you meant you mentioned that you have potential future um design plans. So, anyways, uh if you want to share with us and the listeners what those are, um if it's of interest, uh yeah, I'd be curious to where to start.

Trinstan BrindleSo it is um that that PR, well, I think it's an issue uh that was open. Um it it it kind of morphed into what I'm thinking about now. Because uh Fox is kind of uh strangely for a library called Flux, it's it's kind of stable. Um now it's in it's in kind of a good place. Um but there are changes I want to make. Um and one of the things in particular is when I started, I really didn't realize the importance of this this internal iteration that we were talking about. Because right now it's it's purely an optimization.

Trinstan BrindleIt's something that if you are lucky well, you know, if you know the library very well, then you know when you're gonna hit this internal code, you know, internal iteration code path, and you know that that's gonna happen. What I would like to do is to is to allow users to like be sure that they are going to uh be able to have this this nice internal iteration uh happening, uh, you know, to make that kind of a first class uh citizen of the the flux world as it were.

Trinstan BrindleUm so at the moment we have uh and while I'm at it, really fix the design around single pass sequences because uh I have never been particularly happy about the way that that works um in Flux. So the design at the moment that I've I've kind of been fleshing out in like notebooks and um uh uh experiments over the past few months uh is to have a a whatever you want to call it, uh an interface, a protocol uh based purely around internal iteration.

Trinstan BrindleSo we'll have a sequence is something on which you can call a function, let's call it iterate, uh, that performs internal iteration, right? So you will you will call this iterate or iterate while or whatever I end up calling it, and you will pass it some predicate, and it will iterate through the sequence and call your predicate for each function and uh for each element until that predicate returns false, at which point iteration stops. Now this is actually kind of weaker than uh the input iterators that we have in C at the moment because it's unspecified in this model what happens if you try to restart iteration.

Trinstan BrindleAfter you know, if your predicate returns false, we we stop iterating. And then it's unspecified in this model what happens if you try to restart iteration. Because if you think about it, if you if you're doing this over something like a vector, the natural thing to do would be to restart iteration from the beginning again. Um whereas if you're you you if you're using something like uh a stream, like a uh uh a C input stream, then it's natural to just pick up from where you left off.

BenRight.

Trinstan BrindleRight. And so for the the this new kind of basic sequence API that are based around internal iteration, it's going to be unspecified whether you know what happens. So really you need to only write algorithms that just stop somewhere and and that and then they are complete. Which is fine. We we can do that. But it's it it means that the algorithms that you write using this protocol are slightly more limited than what you can write today with uh input iterators in C or with the the single pass model as it currently exists in Flux.

Trinstan BrindleSo that's kind of one end of the scale, and then the other thing that I that I want to do is to have the current cursor model keep that, but only for multi-pass sequences. So the current model that we have is that the operations of increment and uh dereference, that is access, these are separate operations. So this is the same as with uh C iterators. And that works really, really well for multi-pass sequences. That is where we can repeatedly get the same element uh get the same element out.

Trinstan BrindleForward iterators. Um because these have yeah, these have a notion of position, right? That's kind of like fundamentally multi-pass sequences. They have some idea of of uh of position, and we can we can have the cursor, as we call it, corresponds to a position, and it is natural to be able to copy a cursor to like save a position and to come back to it. And so the the this API works really well for for multi-pass sequences. However, it doesn't work so well for pure single pass sequences.

Trinstan BrindleUm so I'm planning to kind of on the one hand we have the internal iteration scheme to do almost what we can currently do with single pass influx, and at the other end to introduce and my current thing because I want to call it collection. Uh the protocol is going to be called collection for like multi-pass um based on cursors. And that leaves us with just a little gap in the middle uh in functionality, which is uh things that require you to be able to restart iteration but are not multi-pass.

Trinstan BrindleRight? Do you do you follow where I'm where I'm coming from? Yeah. Maybe I'm not expect um and so there's uh uh there's a question of um like how do I it does there need to be a kind of a third a third kind of protocol in the middle for things that are that are not multipass but where we we know what happens when we restart. Um and unfortunately, I think that we actually do need uh something to fill this gap.

Trinstan BrindleSo it's uh kind of an interesting like design thing of how to do this nicely and how to um how to implement this kind of progressively so that um so that users know exactly what's going to happen at each point and they're they're not surprised about it. But um yeah, it's it's one of these things that's quite hard to describe when it's audio only. And if I was doing a presentation, I could show you the slides, and um it would make it much easier uh to explain. But anyway, exciting things happening in the flux world, and maybe maybe I should do a talk about it.

Trinstan BrindleWho knows?

ConorIt sounds like a fantastic idea. Uh I mean it's it's interesting. This um someone someone uh what do you call it? Well, tweet for lack of a better word on Mastodon uh tweeted in response to a discussion that happened on ArrayCast about the discovery that a bunch of these array language implementations use the they're called different things in each language, but like arrays that store like metadata or attributes about the properties of the array.

ConorSo for instance, if you sort an array, uh you can then dispatch the next operation, depending on what it is, to a very, very efficient. So you know, a maximum, obviously, why would you be doing a maximum after a sort? But that's an O1 operation. Uh and what's interesting is that there are a bunch of operations where you know you end up with sorted info. So a Mac scan, you end up with sorted info. So it's this, you know, this set of metadata that you attach to your arrays that enable you to dispatch to basically like different algorithms within a single algorithm that have um different uh you know complexities.

ConorAnd uh someone on Mastodon commented that this was not dissimilar to what happens in C with iterators. Uh you potentially have you know several different algorithm implementations depending on the iterator that you have.

Trinstan BrindleUm rotate famously. Yeah, yeah.

ConorI mean that was the conversation that we had with Sean Parent just uh um I guess maybe tens of episodes ago now.

Trinstan BrindleBut I believe I believe D does something like this. So you can um uh they have a sorted range type. And so then if you do like if you call find on this, instead of doing a linear search, it does a binary search, I believe. I can't remember the exact details, but uh but it's definitely like uh Yeah, yeah.

ConorA similarity here. And I I just find it incredibly um uh like you said, uh uh it's something that I find myself thinking about um a lot now in terms of uh I think about it from the array language angle, but it's this it's app applicable in a ton of different spaces where like whether it's in the form of uh you know concepts in C ⁇ or iterator types, or it's in this uh form of you know some kind of metadata that you're holding on to that sometimes even if you're if you're gonna do like that was what uh Marshall, the creator of BQM, was saying, you know, if you're gonna do a sort, you know, the smartest thing to do is to do a a check up front, a linear check, is this already sorted?

ConorUm and if so, like you're done. But in doing that check, you can actually compute some of this metadata, you know. Like if if you're checking if it's sorted, you're setting that flag. But there's a couple other, depending on the set of metadata that you're tracking, you can actually do like uh get the you can get the range, you know. Uh in checking if it's sorted, even if it's not sorted, you can still get the minimum and the maximum value.

BenYeah. So you can get a good start on computing a pivot, for example.

ConorYeah, yeah. Anyway, so it's just uh it's very interesting. That basically that's what you're talking about uh here, Tristan, is coming up with this kind of hierarchy of uh you know, uh what you would call collections and sequences and multipass. And this basically dispatches to different implementations which have different performance characteristics. And uh I thought that this was a thing that I had in my head, and then I discovered these array languages, and then the individual on Mastodon pointed it out, and I was like, maybe this is just actually like a common thing that happens all over the place, but there's just no collective term for well I I think the idea is like the more information you can give the compiler, the better, right?

BenAnd and and you are limited by which level you're working at. So everything in C is based around iterators, and ranges are also based on iterators. So the limitation there is there isn't a really good way to describe a property of a collection. There are there are some things where there are some cases that happens with ranges, I guess. Um But like you were saying, like if you can if you work not not at the or as well as at the iterator or the cursor level, if you work at the collection level, then you can express properties of the collections after having run certain algorithms.

BenRight? And that gives the compiler more grist to optimize.

Trinstan BrindleYes. And um, we we actually see this in in ranges actually, because there are uh you know, traditionally it was a range was just an iterator pair. Um whereas the the actual the container type itself sometimes has more information than it cannot convey uh just via its iterators. So the the uh example I always think of is standard list, which uh knows how many elements it has, but iterators are not random access.

Trinstan BrindleYou can't ask just via the iterator interface how many elements.

BenExactly, exactly, exactly. Yes.

ConorI didn't realize that for a while, yeah, that there was a a difference between or maybe this is a different itch is uh different issue, but like std ranges distance versus std distance uh has different runtime depending on the sequence. No?

Trinstan BrindleUm I think uh standard ranges distance, if you call it on a sized range, it will call uh standard ranges size, which is guaranteed to be constant time. Whereas I think s I think standard distance just always uh like counts um the number of the number of increments until it gets to the distance is you know using the original iterator model.

BenSo if you have a by die or a forward iterator, it has to be order n.

ConorYeah. I think I I I was I discovered that or was told that in a uh slide in a talk where I had a slide using std distance, and then someone raised their hand and was like. I mean, I know it's slideware, but you might be curious to know. And I was like, I am very curious to know that, thank you. That is something uh worth putting in the next version of this, because that's uh Yeah.

Trinstan BrindleBut then some people prefer to call standard distance or standard ranges distance anyway because that gives you a signed value, whereas standard size, standard range of size gives you an unsigned value, and people prefer working with signed values, and so some people choose to use did the distance function anyway. But no, so we added standard ranges S size, I think, for precisely that reason. We all love C. Oh yeah.

ConorAlright, well, we're past the hour mark. Are there any final thoughts, comments, you know, hot takes to be shared with the listener? Predictions? I mean, we uh Bryce and I did some predictions last time. If you got some 2025, I mean at this point, these predictions are happening a month and a half into the year and won't be coming out until like March. But it's always still fun to, you know, throw up a basketball, see if it lands in the hoop.

Trinstan BrindleI mean, just with everything that seems to have happened in the world in the last um couple of weeks, I I don't think I want to make any predictions for the rest of this year. Um yeah, who know who knows?

BenWho knows what's going to uh Yeah, I'm not gonna make any predictions. I have I have more hopes than predictions. Fair enough.

ConorAlrighty. Well, until uh until next time. I mean uh CPP North is in July. I mean I I should we should ask Tristan. Uh plug all your stuff, and also uh for the listener that uh may want to say hi if you're at a a conference this year, do you have plans to and also uh are you still doing um training and stuff? I mean plug up plug all your stuff. I don't know why I'm still talking about it.

Trinstan BrindleYeah, so um uh I'm hope I I don't have any confirmed conferences yet. I unfortunately I missed out on ACCU, which is the next one that's happening in the UK, but I hope I'd I would love I would love to again go to Toronto uh for CPP North. Um hopefully I'll be able to go to C on C, which is the the other one that happens in the UK, maybe CPPCon um later this year, who knows? Um so yes, if uh and um if you are in the UK, uh come along to C London, the London meetup.

Trinstan BrindleI always go to those, I'm one of the co-organizers now, um, sort of. Um so yes, what else was there I was supposed to plug? Uh I've been talking all about flux, so that will bore people. I um I'm technically on Twitter still at Tristan Brindle, although I don't use it very much. Um Blue Sky, um my handle is at tristanbrindle.com. Um training stuff if you're interested, uh kind of LinkedIn is probably best for that. Uh, because that's really boring. Um but yes, uh that's um that's that's me.

Trinstan BrindleUm thank you for having me on again, by the way.

BenI I don't know why you keep inviting me because uh because the conversation is interesting, I suspect.

ConorYeah. You're on the short list of algorithm, you know. If there's a like a set of uh collection, I don't know if the numbers five or ten or whatever, if I'm collecting, you know, the round table of uh people excited to talk about algorithms, you you're on that list. Uh so no, it's always uh it's always a pleasure.

Trinstan BrindleI always have a good time.

BenI enjoy the episodes where well I enjoy the five minutes of the episode where you say to Bryce, here's the quiz, I've got a list of the algorithms in front of me. How many can you name? Oh yeah, yeah, yeah. The truth is I listen to those episodes and I'm like most of the episodes I listen to, I'm like, surely they're gonna mention this in a minute. Surely they're gonna mention this in a minute. They can't they can't not mention this. And then as you know, and then afterwards I'm like, oh, they didn't mention that. I need to talk to God.

ConorThere's a double-digit number of times at this point through 220 plus episodes where you know the next follow-up, it's like uh we're uh we've got to apologize personally to Sean Parent uh for not having read the third chapter of EOP and not knowing uh about insert thing. And uh and yes, I mean that's uh part of the beauty of this uh uh podcast is you know for the times that we are ignorant, hopefully the next time uh we've learned from our ignorance and and now know the thing. And uh on I mean on the topic of Twitter, I meant to mention that I think it is actually slowly dying because the reason I I'm pretty sure I tweeted that ranking of back ends where flux was number one.

ConorAnd when I went to the media on my profile, half of it is just black squares or like things you can't click on. So I think the media is slow, like everyone has said that they don't, you know, it's pretty much the same. This is the first mega difference I've noticed is that my and that is I think the best uh value for me in Twitter is it's actually like a source of things that I can go and screenshot and include in talk. Sometimes when I know I've discovered something, I'll go and tweet it just for the sole purpose of uh screenshotting it in the future.

ConorBut now they they the history of media seems to be disappearing. So because I'm pretty sure I tweeted that. And uh anyways, so we will make sure to link to both the Twitter and Blue Sky. Or what you're gonna add Ben that you you or you said you're off of Twitter though, I yeah, I deleted all of my tweets.

BenI just I haven't looked at it in well, I stopped tweeting in 2020. And I and I just unfollowed. I I went through a gradual process of unfollowing more and more, and then you know, six. You found yourself in zero follows. No, I still, you know, I still had some followers, I don't know how I don't even know how many, but um I trimmed back the people I was following over time. I would uh you know, every few months I would wake up and I would be like, Oh, let's just trim my follow list again, take out another fifty.

BenAnd then three months ago or so I just removed everything.

Trinstan BrindleI I think almost everybody I know personally that I used to follow is no longer tweeting on tweeting on Twitter or or X. Um there are a bunch of kind of uh organizations um that haven't moved over to Blue Sky or other platforms yet, you know, news and sport things that I follow, but that's kind of all I get from Twitter now. Yeah, um the actual like personal stuff. I uh yeah.

BenTwitter's in the realm of a legacy app for me now that the only reason I still have an account there is for DMs with one or two people. You know, so in the same it's the same way with Facebook.

ConorI was gonna I was literally just gonna say the same thing with Facebook. I actually never go to Facebook.com anymore, or like in a in a blue moon. They have the messenger.com um site where you you just directly go for it because uh most folks I chat to on WhatsApp, but there's still a couple that primarily use Messenger, and so uh I mean same company at the end of the day, but uh but yeah, Twitter's not there for me yet. But I I when I saw that my past tweets were gone, I was like, this is and also too, the search engine, uh the search functionality used to be amazing.

ConorIt still is, but you have to go to advanced search and plug in people's handles for from and then the keywords. You used to just be able to go at a person's username and then uh the keywords that you wanted. So anyways, you know, uh it does it does actually seem to me like Twitter's dying, and um yeah, Mastodon and Blue Sky. Although I Blue Sky it's got some work to do. Why do they have a separate button for videos and images? Like, what's the design choice between that? Because I always click on the images one and I was like, I know my video.

ConorOh right, I clicked on the picture one, then I gotta go back.

Trinstan BrindleIt's open source, Connor. You can uh Is it open source? Submit a PR. Yeah, yeah. You can fix it, you don't have to complain.

BenSocial media as a whole is I I'm feeling increasingly not worth my time. Like like all the value I used to get from social media now I get from from knowing the people like yourselves from from being on being going to meetups, you know, things like that. Attend your local meetup. Yeah. I don't have a local meetup, I got a local conference, but not you. Listeners in general should should attend the local meetups.

BenLondon or Denver or programming languages virtual. Tristan, if you want to come talk at the Denver meetup, you'd be you'd be very welcome. We're always well you, Connor.

ConorWhat Ben said, go attend your local meetup, wherever that is. There seems to be quite a bit of them these days, at least from pandemic days when they were all virtual.

BenThe the Denver meetup is hybrid. Um we tend to only do in-person talks, but but we have plenty of people who attend online. In other words, the speaker is the speaker is physical.

ConorGood to know. We will link to the Denver one, we will link to the C London one, we will link to if you've got other meetups. I think I linked to the Budapest one uh a couple times ago. But uh what were you gonna say, Tristan?

Trinstan BrindleOh, just on the subject of of linking to things, because I I should have mentioned this oh about three episodes ago, possibly now. Um there's a a great um a great couple of blog posts by uh a guy called Bob Nystrom, who you might know. Game programming patterns, Dart language. Crafting interpreters. Also, he's the uh person who came up with the um the term uh function colouring, I believe. That was his. But anyway, uh he has uh a couple of blog posts from 2013 uh called Iteration Inside and Out. Uh so I'm sure we'll put the link in the show notes.

Trinstan BrindleBut uh I didn't do a great job of explaining internal iteration, I don't think. Uh, but uh he does in this blog in these posts. So uh yeah, highly recommended if you're interested to go and and check those out.

ConorAwesome, yeah. I will link that in this episode and in the episodes where we talked about uh flux and internal iteration, as well as a link to flux. I mean, if you're if you're a longtime listener, this isn't the first time you've heard about it. Um but it is uh becoming, I think, uh the the C under the C talk, is that uh yeah Is that available? There's a couple people probably listening being like, oh, can I go watch that talk? So I the talks were the talks were recorded, and I had it on good authority from the people running the conference that they thought they said that probably a couple weeks, two to three weeks.

ConorHowever, unless if it's like a incognito, indiscoverable um YouTube channel, or maybe it's posted somewhere else, I have never been able to find uh these online yet. The recordings did happen. There were cameras in the room and footage being filmed. So my guess is it's just priorities. They're probably in the midst of uh preparing for the next conference, and this is uh lower priority on their list of things to do. Um so yeah, currently it's not available. The slide deck is is there, um, which does have the little table of of rankings of stuff if you download the PDF.

ConorBut um when it does come online, because I do check uh I'd say once every two or three weeks, but honestly, usually what happens is I'll get added on some social media when someone posts it, and then I'll be like, ah, here it is. I was finally um waiting for this. So uh that's a long answer to the uh short answer being no, it's not it's not online yet, but should be later. Um all right, this has been a blast. Until until next time. I mean, hopefully, yeah, we'll see each other all either in Toronto or maybe a different conference. And uh yeah, this has been this has been a blast.

ConorHopefully, folks enjoyed. Uh came away with a couple movie recommendations and uh a one library recommendation.

Trinstan BrindleUh thanks again for having me on.

ConorAbsolutely, Tristan. Thanks.

Trinstan BrindleUntil next time.

ConorBe sure to check these show notes either in your podcast app or at adspthepodcast.com for links to anything we mentioned in today's episode, as well as a link to a GitHub discussion where you can leave thoughts, comments, and questions. Thanks for listening. We hope you enjoyed and have a great day. I am the anti Bryce.

BenUm

Open the transcript file

Hosts and Guests

Guests

  • Tristan Brindle Guest Inferred

Credit the people on this episode

Be the first to rate this episode

More episodes

All episodes
  1. Episode 313: C++26 Reflection vs CRTP, AI, Kids & More with Zach Laine

    Nov 20, 202647 minAudio

    In this episode, Conor and Bryce chat with Zach Laine about C++26 Reflection vs CRTP, AI, kids & more. Link to Episode 313 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP:...

    • Apple Podcasts

    Credit the people on this episode

  2. Episode 312: The C++26 Contracts Fiasco

    Nov 13, 202652 minAudio

    In this episode, Conor and Bryce chat with Zach Laine about the C++26 contracts fiasco. Link to Episode 312 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast:...

    • Apple Podcasts

    Credit the people on this episode

  3. Episode 311: Career Changes, GPUs & More with Zach Laine

    Nov 6, 202628 minAudio

    In this episode, Conor and Bryce talk with Zach Laine about his career and the career changes he has made. Link to Episode 311 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials...

    • Apple Podcasts

    Credit the people on this episode

  4. Episode 310: Leaving NVIDIA for... ?

    Oct 30, 202624 minAudio

    In this episode, Conor and Bryce talk about Bryce's next chapter and where he is leaving NVIDIA for. Link to Episode 310 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The...

    • Apple Podcasts

    Credit the people on this episode

  5. Episode 309: Default Construction & CppCon 2026 with Jason Turner

    Oct 23, 202629 minAudio

    In this episode, Conor and Ben chat with Jason Turner about default construction in C++. Link to Episode 309 on Website Discuss this episode, leave a comment, or ask a question (on GitHub) Socials ADSP: The Podcast:...

    • Apple Podcasts

    Credit the people on this episode