MYWOT

Child safety

N/A

Confidence

0%

Trustworthiness

N/A

Confidence

0%

MALICIOUS CONTENT INDICATORS

Availability or unavailability of the flaggable/dangerous content on this website has not been fully explored by us, so you should rely on the following indicators with caution.

Dhconnelly.com most likely does not offer any malicious content.

  • Siteadvisor

    Safety status

    N/A

  • SAFEBROWSING

    Safety status

    Safe

  • Phishtank

    Safety status

    N/A

Secure connection support

HTTPS

Dhconnelly.com provides SSL-encrypted connection.

ADULT CONTENT INDICATORS

Availability or unavailability of the flaggable/dangerous content on this website has not been fully explored by us, so you should rely on the following indicators with caution.

Dhconnelly.com most likely does not offer any adult content.

Popular pages

  • Advent of Code 2019: Commentary

    [home] December 1, 2019 Here's my running commentary on Advent of Code 2019, for which I'm using Go. The full code is available on GitHub. Edit: Retrospective is here Table of Contents Day 1 Both part...

  • Advent of Code 2019: Retrospective

    [home] December 27, 2019 Note: Per-problem commentary is here This year I participated in Advent of Code for the first time, and yesterday, on Christmas Day, I finished all fifty stars! After finishin...

  • Daniel Connelly

    Daniel Connelly Principal Engineer at Teads in Paris. Find me on GitHub, LinkedIn, or send me an email. Projects An R-Tree library in Go: rtreego Advent of Code: 2022 in C++ (50/50), 2021 in Rust (45/...

  • pathfinding.py

    pathfinding.py An application of A* pathfinding: find the best path through a map. The map is represented as a grid, where 1 is an obstacle and 0 is an open space. Movement can be up, down, left, righ...

  • logic.py

    logic.py Introduction Logic programming is declarative, not procedural. In the procedural programming paradigm, the programmer specifies data and the algorithms that should be executed on those data ...

  • gps.py

    gps.py def cost(states): sum = len([s for s in states if s.startswith(prefix)]) sum += len([g for g in goal_states if g not in states]) return sum final = ...

Open neighbouring websites list