Main

id

3241454

related bits

0

processing priority

4

site type

0 (generic, awaiting analysis)

review version

11

html import

20 (imported)

Events

first seen date

2024-02-22 09:04:40

expired found date

-

created at

2024-05-28 16:36:24

updated at

2025-12-24 05:26:26

Domain name statistics

length

15

crc

33582

tld

2688

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

-

previous id

0

replaced with id

0

related id

-

dns primary id

256482523

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

9

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

70922

mp size raw text

41647

mp inner links count

19

mp inner links status

20 (imported)

Open Graph

title

description

A collection of articles on software development written by Thomas Guest.

image

site name

author

Thomas Guest

updated

2025-12-06 17:49:33

raw text

Word Aligned Word Aligned tales from the code face Priority queues in Python 2022-02-25 • Python • Comments In the previous article I noted that Python’s heapq module is the only part of standard Python I could think of which deals with sorting, but which doesn’t give you full control over the sort order. That means you need to take care when using a heapq as a priority queue. For example, the A* search algorithm is a best first path finder. It maintains a priority queue of possible steps to take, ordered by an estimate of the total distance of the path routed through these steps. At each stage it pops the next step — the one with the shortest estimated total distance — from the queue, then updates based on the new position. import heapq def a_star(start, heuristic, moves): """A* graph search - start: initial state - heuristic(s): estimates path length from state s to finish. heuristic(s) == 0 => finished - moves(s): neig...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Python i Perl (135)

index version

2025110801

spam phrases

3

Text statistics

text nonlatin

0

text cyrillic

0

text characters

30328

text words

6610

text unique words

1859

text lines

1126

text sentences

374

text paragraphs

130

text words per sentence

17

text matched phrases

14

text matched dictionaries

10

RSS

rss path

rss status

0 (new)

rss found date

-

rss size orig

0

rss items

0

rss spam phrases

0

rss detected language

0 (awaiting analysis)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap path

sitemap status

0 (new)

sitemap review version

1

sitemap urls count

0

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

-

sitemap process date

-

sitemap first import date

-

sitemap last import date

-