Main

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)

Events

first seen date

2024-08-15 02:46:54

expired found date

-

created at

2024-08-15 02:46:54

updated at

2026-03-02 20:29:54

Domain name statistics

length

20

crc

20016

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

137301

mp size raw text

25295

mp inner links count

17

mp inner links status

20 (imported)

Open Graph

title

Ricardo Galli, de software

description

De software libre, internet, legales

image

site name

Ricardo Galli, de software

author

updated

2026-01-30 04:48:03

raw text

Ricardo Galli, de software | De software libre, internet, legales Del autor Principios y algoritmos de concurrencia Ricardo Galli, de software ~ De software libre, internet, legales Buscar: Un actor útil y eficiente en Go 03 miércoles Ago 2016 Posted by gallir in concurrencia , desarrollo , programación ≈ Comentarios desactivados en Un actor útil y eficiente en Go Etiquetas actor , actores , golang Este es un truco en Go muy útil y eficiente para hacer tareas de «mantenimiento» en estructuras de forma concurrente (y seguramente paralela). Supongamos que tenéis una lista de elementos, a esta lista se agregan u obtienen elementos pero hay que mantener solamente los últimos N , donde N puede estar basado en una límite temporal. Las operaciones sobre la lista deben responder muy rápidamente por lo que no es posible llamar a la función que elimina los más antiguos porque tiene un coste computacional ( O(n) o O(log n) en el mejor de los ...

Text analysis

redirect type

31 (document.location)

block type

0 (no issues)

detected language

8 (Spanish)

category id

Celebryci (32)

index version

2025123101

spam phrases

0

Text statistics

text nonlatin

0

text cyrillic

0

text characters

19743

text words

4045

text unique words

1444

text lines

391

text sentences

166

text paragraphs

76

text words per sentence

24

text matched phrases

2

text matched dictionaries

6

RSS

rss status

32 (unknown)

rss found date

2024-11-08 22:02:00

rss size orig

343930

rss items

20

rss spam phrases

1

rss detected language

8 (Spanish)

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

521

sitemap urls adult

0

sitemap filtered products

0

sitemap filtered videos

0

sitemap found date

2024-09-30 10:37:47

sitemap process date

2024-09-30 10:37:50

sitemap first import date

-

sitemap last import date

2026-03-02 20:29:54