Robby Madruga

Specify descendant or ancestor in query

9

Is there a way to pattern match a descendant of arbitrary depth? I'm parsing C code and I'm trying to get all identifiers of static declarations. Something like the following...

When I ping a Ipv6 multicast address, `ff02::1` in this case, multiple hosts respond. Using the `ping6` utility, this shows up as normal responses with (DUP!) suffix. ``` $ ping6...

Multiple Bits for Flag

4

``` #[derive(EnumFlags, Copy, Clone, Debug)] #[repr(u8)] pub enum GeneralStatus { INDICATOR_IDENTIFY = 0b01000000, INDICATOR_MUTE = 0b10000000, INDICATOR_NORMAL = 0b11000000, PORT_AUTH_PANEL = 0b00010000, PORT_AUTH_NETWORK = 0b00100000, BOOT_ROM = 0b00000100, RDM_CAPABLE =...

Efficient Line Intersections

4

The current naive implementation is $O(n^2)$, whereas [Bentley–Ottmann](https://en.wikipedia.org/wiki/Bentley%E2%80%93Ottmann_algorithm) is $O((n+k)\log n)$. Plans to implement?

Added conversion from LineSegment to LineSegmentView

1

So that this works: ```rust let segments = vec![ LineSegment::new( EndPoint::Exclusive(Point::new([0, 0])), EndPoint::Exclusive(Point::new([1, 1])), ), LineSegment::new( EndPoint::Exclusive(Point::new([0, 1])), EndPoint::Exclusive(Point::new([1, 0])), ), ]; let crosses = segment_intersections(&segments).collect::(); ```

Minimum Dissection Into Rectangles of a Rectilinear Polygon

1

I'm looking for a library that can do what the title says. I don't think this one does, but was hoping it would be put up for consideration. Here is...

Requesting MTU

5

This PR will include a method to retrieve the negotiated MTU size on each platform. Info grabbed from: https://github.com/deviceplug/btleplug/issues/246 **Windows** - [GattSession.MaxPduSize](https://learn.microsoft.com/en-us/uwp/api/windows.devices.bluetooth.genericattributeprofile.gattsession.maxpdusize?view=winrt-22621) Negotiation happens on user's behalf, and a GattSession.MaxPduSizeChanged...