Main

related bits

29

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)

Events

first seen date

2025-01-05 09:23:21

expired found date

-

created at

2025-01-05 09:23:21

updated at

2026-03-12 05:20:26

Domain name statistics

length

20

crc

19118

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

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)

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

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

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

185636

mp size raw text

45139

mp inner links count

41

mp inner links status

10 (links queued, awaiting import)

Open Graph

title

Murilo :P

description

C++, Computação, Programação, Web e afins :)

image

site name

Murilo :P

author

updated

2026-03-11 17:05:44

raw text

Murilo :P | C++, Computação, Programação, Web e afins :) Murilo :P C++, Computação, Programação, Web e afins :) Deeper look at PHP’s array: worst case with 2 comments As I did in the post about the PHP sort functions , I was looking at the PHP source , I found this an interesting thing: the hashing function used on PHP’s hash tables  (aka associative  arrays ). Above the function definition, a PHP contributor explained the function : This is Daniel J. Bernstein’s popular `times 33′ hash function as posted by him years ago on comp.lang.c. It basically uses a function like hash(i) hash(i-1) * 33 + str[i] . This is one of the best known hash functions for strings. Because it is both computed very fast and distributes very well. This function, known as DJBX33A, is very fast and indeed it distributes very well when the data follows an uniform distribution . That is the problem. A user can easily produce keys for an array that would collide in the same hash, making the ...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

10 (Portuguese)

category id

C i C++ (132)

index version

1

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

31476

text words

6921

text unique words

1681

text lines

1340

text sentences

205

text paragraphs

106

text words per sentence

33

text matched phrases

0

text matched dictionaries

0

RSS

rss status

32 (unknown)

rss found date

2025-01-05 09:23:22

rss size orig

73438

rss items

10

rss spam phrases

0

rss detected language

10 (Portuguese)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

45

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2025-01-05 09:23:22

sitemap process date

2025-03-24 05:36:57

sitemap first import date

-

sitemap last import date

2025-08-02 05:14:18