![\"\"](\"https://substackcdn.com/image/fetch/$s_!g9TJ!,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F3bbd5b12-065d-4250-ac02-be3a277fcf7a_3840x2160.jpeg\")
Before moving on, it’s worth looking at how we would handle more complex predicates than the ones present in the haversine loop.
\nSep 23, 2026
\n∙ Paid
\n
This is the eighteenth video in Part 5 of the Performance-Aware Programming series. Please see the Table of Contents to quickly navigate through the rest of the course as it is updated, and the code repository for downloadable code listings.
\nAlready a paid subscriber? Sign in
\n![\"Computer,](\"https://substackcdn.com/image/fetch/$s_!FgJW!,w_96,h_96,c_fill,f_auto,q_auto:good,fl_progressive:steep,g_auto/https%3A%2F%2Fsubstack.com%2Fimg%2Fpodcast%2Fgeneric.png\")
Programming Courses
\nA series of courses on programming topics.
\n", "content_markdown": "Before moving on, it’s worth looking at how we would handle more complex predicates than the ones present in the haversine loop.\n\nSep 23, 2026\n\n∙ Paid\n\n[](https://substackcdn.com/image/fetch/$s_!g9TJ!,f_auto,q_auto:good,fl_progressive:steep/https%3A%2F%2Fsubstack-post-media.s3.amazonaws.com%2Fpublic%2Fimages%2F3bbd5b12-065d-4250-ac02-be3a277fcf7a_3840x2160.jpeg)\n\n*This is the eighteenth video in Part 5 of the Performance-Aware Programming series. Please see the [Table of Contents](https://www.computerenhance.com/p/table-of-contents) to quickly navigate through the rest of the course as it is updated, and [the code repository](https://github.com/cmuratori/computer_enhance) for downloadable code listings.*\n\n## The full video is for paid subscribers\n\n[Already a paid subscriber? **Sign in**](https://substack.com/sign-in?redirect=%2Fp%2Fnested-simd-predicates&for_pub=computerenhance&change_user=false)\n\n[](https://www.computerenhance.com/s/programming-courses)\n\nProgramming Courses\n\nA series of courses on programming topics.\n", "dateCreated": "2026-09-23T22:13:44.124112615+00:00", "date_created": "2026-09-23T19:29:51+00:00", "date_modified": "2026-09-23T19:29:51+00:00", "date_published": "2026-09-23T19:29:51+00:00", "description": "Before moving on, it’s worth looking at how we would handle more complex predicates than the ones present in the haversine loop.", "external_url": "https://www.computerenhance.com/p/nested-simd-predicates", "git": { "commit": "ebb0941c5c06a2ab2377342d607535262a3e969e", "path": "items/computerenhance-com/2026/09/2026-09-23-nested-simd-predicates.md", "permalink": "https://github.com/aymericbeaumet/aggr-instance/blob/ebb0941c5c06a2ab2377342d607535262a3e969e/items/computerenhance-com/2026/09/2026-09-23-nested-simd-predicates.md" }, "id": "urn:aggr:item:a2814718a88c40982e5f06bf4f0ab90679549ede", "isBasedOn": { "@id": "https://www.computerenhance.com/p/nested-simd-predicates" }, "mainEntity": { "@id": "https://www.computerenhance.com/p/nested-simd-predicates", "@type": "CreativeWork", "archivedAt": { "@id": "https://aggr.aymericbeaumet.com/items/computerenhance-com/2026-09-23-nested-simd-predicates/#webpage" }, "dateModified": "2026-09-23T19:29:51+00:00", "datePublished": "2026-09-23T19:29:51+00:00", "headline": "Nested SIMD Predicates", "timeRequired": "PT1M", "url": "https://www.computerenhance.com/p/nested-simd-predicates", "wordCount": 89 }, "name": "Archived snapshot: Nested SIMD Predicates", "preview": null, "reading_minutes": 1, "replicated_at": null, "source": "computerenhance-com", "source_name": "Computer, Enhance!", "summary": "Before moving on, it’s worth looking at how we would handle more complex predicates than the ones present in the haversine loop.", "tags": [], "temporalCoverage": "2026-09-23T22:13:44.124112615+00:00", "title": "Nested SIMD Predicates", "url": "https://aggr.aymericbeaumet.com/items/computerenhance-com/2026-09-23-nested-simd-predicates/", "word_count": 89 }