id
related bits
0
processing priority
4
site type
3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)
review version
11
html import
20 (imported)
first seen date
2024-11-10 16:17:07
expired found date
-
created at
2024-11-10 16:17:07
updated at
2026-03-02 15:17:35
length
28
crc
35735
tld
2211
nm parts
0
nm random digits
0
nm rare letters
0
is subdomain of id
13642151 (wordpress.com)
previous id
0
replaced with id
0
related id
-
dns primary id
0
dns alternative id
0
lifecycle status
0 (unclassified, or currently active)
deleted subdomains
0
page imported products
0
page imported random
0
page imported parking
0
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
0
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 bits
—
server ip
-
mp import status
20
mp rejected date
-
mp saved date
-
mp size orig
169725
mp size raw text
68182
mp inner links count
6
mp inner links status
20 (imported)
title
Lisp Chronicles
description
Lisp in modern times
site name
Lisp Chronicles
author
updated
2026-02-23 23:24:20
raw text
Lisp Chronicles | Lisp in modern times Lisp Chronicles Lisp in modern times Menu Skip to content Home About New Home The Lisp Chronicles blog has moved to lispchronicles.com . June 25, 2017 Vijay Mathew Leave a comment A heap for proletarians Hash tables and arrays typically support efficient access to arbitrary elements. What if we need efficient access to elements based on some priority? Say for example, we need to fetch the minimum element in O(1) time. The data type that provide this kind of access is known as a priority queue. Priority queues are typically implemented as heap-ordered trees , in which the element at each node has higher “priority” than the elements at its children. Under this invariant, the element with the top priority will always be at the root of the tree. The priority of each node will be determined by a predicate, like one of the comparison operators. In this post we take a detailed look at the implementation of a purely func...
redirect type
0 (-)
block type
0 (no issues)
detected language
1 (English)
category id
SEC and Crypto [en] (228)
index version
2025123101
spam phrases
0
text nonlatin
0
text cyrillic
0
text characters
48475
text words
10354
text unique words
1713
text lines
1626
text sentences
526
text paragraphs
169
text words per sentence
19
text matched phrases
1
text matched dictionaries
5
links self subdomains
0
links other subdomains
links other domains
22 - lispchronicles.com, clojure.org, clojuredocs.org, schemer.in, insideclojure.org, leiningen.org, ocaml-book.com, pragprog.com, lispworks.com, r7rs.org, dreamsongs.com, paulgraham.com, forth.com
links spam adult
0
links spam random
0
links spam expired
0
links ext activities
3
links ext ecommerce
1 - amazon.com
links ext finance
0
links ext crypto
0
links ext booking
0
links ext news
0
links ext leaks
0
links ext ugc
40 - s0.wp.com, wp.me, s1.wp.com, wordpress.com, en.wikipedia.org, twitter.com
links ext klim
0
links ext generic
0
dol status
0
dol updated
2026-02-23 23:24:20
rss status
32 (unknown)
rss found date
2024-11-10 16:17:08
rss size orig
91747
rss items
6
rss spam phrases
0
rss detected language
1 (English)
inbefore feed id
-
inbefore status
0 (new)
sitemap path
sitemap status
40 (completed successful import of reports.txt file to table in_pages)
sitemap review version
2
sitemap urls count
8
sitemap urls adult
0
sitemap filtered products
0
sitemap filtered videos
0
sitemap found date
2024-11-10 16:17:07
sitemap process date
2024-11-25 07:04:53
sitemap first import date
-
sitemap last import date
2025-10-21 07:32:44