FEED Validator

for Atom and RSS and KML

Sorry

This feed does not validate.

line 1, column 0: Undefined root element: br [help]
```
 
```
line 2, column 0: XML parsing error: <unknown>:2:0: junk after document element [help]
```
Warning:  Undefined variable $out in /home/bakers/html/perturb.cla ...
```

In addition, interoperability with the widest range of feed readers could be improved by implementing the following recommendation.

"text/xml" media type is not specific enough [help]

Source: http://www.perturb.org/atom.php

 
Warning: Undefined variable $out in /home/bakers/html/perturb.class.php on line 1197 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
 
Warning: Undefined variable $summary in /home/bakers/html/perturb.class.php on line 1236 
<?xml version="1.0" encoding="iso-8859-1"?>
<?xml-stylesheet type="text/css" href="/css/atom-browser.css" ?>
<feed version="0.3" xmlns="http://purl.org/atom/ns#" xmlns:dc="http://purl.org/dc/elements/1.1/" xml:lang="en"> <title>Perturb.org - Scott's Geek Blog</title>
<modified>2025-04-02T15:59:57-07:00</modified> <link rel="alternate" type="text/html" href="http://www.perturb.org" /> <tagline>Geek blog</tagline>
<id>tag:www.perturb.org,2025://04</id>
<generator>Perturb ATOM v0.1</generator>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1424/" />
<title mode="escaped">Vim: Insert a line of characters</title>
<modified>2025-04-01T00:00:00-07:00</modified>
<issued>2025-04-01T00:00:00-07:00</issued>
<created>2025-04-01T00:00:00-07:00</created>
<id>http://www.perturb.org/display/entry/1424/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I need an 80 character divider of text in Vim. I can never remember the sequence so I'm writing it down: 
 
```
80i/<ESC> 
```
 
Will generate: 
 
```text
//////////////////////////////////////////////////////////////////////////////// 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1423/" />
<title mode="escaped">Comparing 32bit and 64bit performance on low end micro-controllers</title>
<modified>2025-03-05T13:47:09-08:00</modified>
<issued>2025-03-05T13:47:09-08:00</issued>
<created>2025-03-05T13:47:09-08:00</created>
<id>http://www.perturb.org/display/entry/1423/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
Testing 32bit vs 64bit PRNGs on a 32bit ESP32-C3 [I'm seeing](https://gist.github.com/scottchiefbaker/e4c87de8d6c1ad4a33b1ffe5a3ce707f): 
 
| PRNG | Iterations per second | Output Bits | Bytes per second | 
| ------------- | --------------------- | ----------- | ---------------- | 
| pcg32 | 487802 | 32 | **1951266.7 b/s**| 
| xoroshiro64** | **516023** | 32 | 2050966.7 b/s | 
| xoshiro256+ | 487808 | 64 | **3878726.7 b/s**| 
| xoshiro512++ | 441735 | 64 | 3514373.3 b/s | 
| splitmix64 | 462290 | 64 | 3677033.3 b/s | 
| pcg64 | **416297** | 64 | 3313060.0 b/s | 
 
Very little difference on PRNGs that use 64bit operations vs 32bit operations. Even on limited hardware like this it makes sense to use a 64bit PRNG because you get more bytes per cycle.
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1422/" />
<title mode="escaped">Vim: Convert your syntax highlighted text into HTML</title>
<modified>2025-02-26T00:00:00-08:00</modified>
<issued>2025-02-26T00:00:00-08:00</issued>
<created>2025-02-26T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1422/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
Vim is my code editor of choice as it has great features, excellent syntax highlighting, and a robust plug-in infrastructure. I'm very used to look and feel of Vim. If you want to share some of your code online, converting things to HTML can be problematic. Luckily Vim has a built in code to HTML converter: 
 
```
:TOhtml 
```
 
Simply run the `:TOhtml` command in an open text file and your buffer will be redrawn in HTML which you can then save. Here is a quick sample of my pcg32.pl script [converted to HTML](https://www.perturb.org/code/pcg32.pl.html).
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1421/" />
<title mode="escaped">What kind of number makes a good seed for a PRNG?</title>
<modified>2025-02-20T00:00:00-08:00</modified>
<issued>2025-02-20T00:00:00-08:00</issued>
<created>2025-02-20T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1421/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
[Pseudo-random number generators](https://en.wikipedia.org/wiki/Pseudorandom_number_generator) use complex math to generate random numbers on your computer. These random numbers are used for all sorts of things: simulations, fractals, games, art, and even math experiments. Computers can **only** do math, which makes generating a random number difficult. 
 
PRNGs need a "seed" number to kick off the math that generates sequences of random numbers. Some PRNGs require a 32bit seed, and some require a 64bit seed. Some PRNGs require one seed, and some require four (or more). It is important to know what type of seed your PRNG needs. 
 
A 32bit number is between 0 and 4.2 billion and a 64bit number is between 0 and 18.4 quintillion. The larger a number is, the more bits are required to store it, and the better a seed it will make. The closer your seed is to the upper end of the number range the better. As a general rule a good seed will be a decimal number with 18 or 19 digits. 
 
`12` is a small number and **not** a good seed, `4611686018427387906` is a big number but still not a great seed. Seeds should **not** have large sections of zero/one bits. This is why small numbers do not make good seeds. Bits can be visualized by printing the number in binary:
 
```bash
# Horrible 
$ perl -E 'printf("%064b\n", 4611686018427387906)' 
0100000000000000000000000000000000000000000000000000000000000010 
 
# Bad 
$ perl -E 'printf("%064b\n", 17770)' 
0000000000000000000000000000000000000000000000000100010101101010 
 
# Poor 
$ perl -E 'printf("%064b\n", 2850756010)' 
0000000000000000000000000000000010101001111010110001010110101010 
 
# Good 
$ perl -E 'printf("%064b\n", 11337502976607798025)' 
1001110101010110111001101110001101111000101001000100001100001001 
```
 
Good seeds should have a _roughly_ even mix of zero and one bits. `9223372036854775808` is a large number and looks promising but it has 63 zeros, and only a single one bit. You can visualize the quality of your seed with [seed_quality.pl](https://www.perturb.org/code/seed_quality.pl). Quality above 75% should make for good seed numbers.
 
Seeds should **not** be predictable. Do not use dates, times, or phone numbers as they are potentially guessable. Combinations of numbers can be good sources. Process PID, UID, unixtime are good potential sources _if_ they are combined together in a non-predictable way. PID multiplied by UID multiplied by Unixtime is an example of combining values. Memory locations of variables, especially if [ASLR](https://en.wikipedia.org/wiki/Address_space_layout_randomization) is in use is a potentially good source as well.
 
Hashing numbers, strings, or combinations of numbers can be a good way to generate seeds. Hashing a value with [Komihash](https://github.com/scottchiefbaker/perl-Crypt-Komihash) or [xxHash](https://metacpan.org/pod/Digest::xxHash) will generate a suitable 64bit number. Hashing a value with [SHA256](https://metacpan.org/pod/Digest::SHA) will generate a 256bit value which can be [split](https://www.perturb.org/display/1415_Perl_Using_sha256_to_hash_strings_into_integers.html) into four 64bit values. Hashing functions also do a good job of ensuring the bits are mixed well and do not include large repeating sections.
 
The best source of seed numbers is directly from your OS. On Linux this is `/dev/urandom` and on Windows you can interface with the `RtlGenRandom` API. These are carefully curated sources of _true_ randomness, but they can be slow-ish. Using them as a source for a fast PRNG is best practice.
 
```perl
sub get_64bit_seed { 
open my $urandom, '<:raw', '/dev/urandom' or croak("Couldn't open /dev/urandom: $!"); 
sysread($urandom, my $buf, 8) or croak("Couldn't read from csprng: $!"); 
 
return unpack("Q*", $buf); 
} 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1420/" />
<title mode="escaped">Perl: Multiply-Shift Hash</title>
<modified>2025-01-27T00:00:00-08:00</modified>
<issued>2025-01-27T00:00:00-08:00</issued>
<created>2025-01-27T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1420/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I've been using the multiply-shift hash lately and have had good results. It's simple, fast, and well tested. 
 
```c
// Multiply-Shift Hash 
static uint64_t hash_msh(uint64_t x) { 
uint64_t prime = 0x9e3779b97f4a7c15; // A large prime constant 
x ^= (x >> 30); 
x *= prime; 
x ^= (x >> 27); 
x *= prime; 
x ^= (x >> 31); 
return x; 
} 
```
 
Whenever I find interesting code like this I like to try and implement it in Perl: 
 
```perl
sub hash_msh { 
my $x = $_[0]; 
my $prime = 11400714819323198485; 
 
$x ^= ($x >> 30); 
$x = multiply_uv($x, $prime); 
$x ^= ($x >> 27); 
$x = multiply_uv($x, $prime); 
$x ^= ($x >> 31); 
 
return $x; 
} 
 
# Perl converts numbers larger than 2^64 - 1 to floating point so 
# we 'use integer' to force integer math which retains any overflow. 
sub multiply_uv { 
my ($one, $two) = @_; 
 
use integer; 
my $ret = $one * $two; 
no integer; 
 
# Convert signed IV to unsinged UV 
if ($ret < 0) { 
$ret += 18446744073709551615; 
$ret += 1; 
} 
 
return $ret; 
} 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1419/" />
<title mode="escaped">Perl: Calculate number of bits needed to store a number</title>
<modified>2025-01-27T00:00:00-08:00</modified>
<issued>2025-01-27T00:00:00-08:00</issued>
<created>2025-01-27T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1419/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
Quick Perl function to calculate the number of bits required to store a given number. 
 
```perl
sub bits_required { 
my ($n) = @_; 
 
# Handle special case for 0 
return 0 if $n == 0; 
 
# Use logarithm to calculate the number of bits 
my $bits = int(log($n) / log(2)) + 1; 
return $bits; 
} 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1418/" />
<title mode="escaped">Implmenting PRNGs in Perl</title>
<modified>2025-01-25T00:00:00-08:00</modified>
<issued>2025-01-25T00:00:00-08:00</issued>
<created>2025-01-25T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1418/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I'm a big fan of the [PCG32 PRNG](https://www.pcg-random.org/download.html). It's simple, fast, and well documented. As is usually the case when I find interesting code I try and find a way to implement it in Perl. PCG32 poses an interesting problem when one tries to implement it in Perl because all the math is performed using **unsigned** integers and overflow. Most PRNGs use large numbers and overflow to work, that's their secret sauce. 
 
Perl does not have a native unsigned type so I had to learn the guts of how Perl does math so I could emulate it. I ended up coming up with two different implementations, a native Perl implementation, and a version that uses `Math::Int64`. Surprisingly the native version was *significantly* faster.
 
Both implementations with detailed comments are available in [pcg32.pl](https://www.perturb.org/code/syntax_highlight.php?file=pcg32.pl) if you're interested in learning more about how to do integer style math in Perl. 
 
As a bonus I also ported the [xoshiro256 family](https://www.perturb.org/code/syntax_highlight.php?file=xoshiro256.pl) into Perl. [Splitmix64](https://www.perturb.org/code/syntax_highlight.php?file=splitmix64.pl) ended up being a little more complicated to port, but I got it as well.
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1417/" />
<title mode="escaped">C/C++: List all #define macros</title>
<modified>2025-01-22T00:00:00-08:00</modified>
<issued>2025-01-22T00:00:00-08:00</issued>
<created>2025-01-22T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1417/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I need to target a specific platform with some code I'm writing. You can list **all** of the `#define` macros on a given platform with these commands:
 
```
gcc -dM -E - < /dev/null 
```
 
```
clang -dM -E - < /dev/null 
```
 
In this big list of macros you should find something to help you target a given platform.
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1416/" />
<title mode="escaped">FFMPEG: Limit the output to only the encoding stats for quieter scripting</title>
<modified>2025-01-21T00:00:00-08:00</modified>
<issued>2025-01-21T00:00:00-08:00</issued>
<created>2025-01-21T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1416/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
FFMPEG is a great tool, but it is very chatty. If you want to encode a file you'll get about 40 lines of headers and track information, most of which you probably will not read. For scripting purposes you probably **only** want to see the statistics. If you start FFMPEG, hide the banner, and set the loglevel low you can output only the stats you need 
 
```bash
ffmpeg -y -hide_banner -loglevel quiet -stats ... 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1415/" />
<title mode="escaped">Perl: Using sha256 to hash strings into integers</title>
<modified>2025-01-20T00:00:00-08:00</modified>
<issued>2025-01-20T00:00:00-08:00</issued>
<created>2025-01-20T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1415/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I need 64bit integers to seed some PRNG work I'm doing. I found out that you can easily create four 64bit numbers from any string by using SHA256. 
 
```
use Digest::SHA; 
 
my $input = $ARGV[0] || int(rand() * 1000000); 
 
# Get raw bytes and convert to an array of uint64_t 
my $hash = Digest::SHA::sha256($input); 
my @nums = unpack("Q*", $hash); 
 
print "SHA256 Hashing '$input' to: " . join(", ", @nums) . "\n"; 
```
 
**Note:** We are using `sha256` here, not `sha256_hex` because we need raw bytes to convert to integers with `unpack`.
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1414/" />
<title mode="escaped">Komihash is pretty amazing and simple hashing algorithm</title>
<modified>2025-01-17T00:00:00-08:00</modified>
<issued>2025-01-17T00:00:00-08:00</issued>
<created>2025-01-17T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1414/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I need a simple way to hash strings into 64bit integers so I started [some research](https://en.wikipedia.org/wiki/List_of_hash_functions#Non-cryptographic_hash_functions). Initially I was focusing on [xxHash](https://github.com/Cyan4973/xxHash) but it's slightly harder to implement than other newer hashes. I ended up landing on the amazing [Komihash](https://github.com/avaneev/komihash) which bills itself as: "a very fast 64-bit hash function, mainly designed for hash-table, hash-map, and bloom-filter uses".
 
Komihash is available as a single `Komihash.h` file and is _extremely easy_ to implement into existing code.
 
```c
#include <stdio.h> 
#include <stdlib.h> 
#include "komihash.h" 
 
int main(int argc, char *argv[]) { 
int seed = 0; 
const char *buf = "Hello world"; 
 
uint64_t hash_num = komihash(buf, strlen(buf), seed); 
 
printf("Komihash: %s = %llu\n", buf, hash_num); // 3745467240760726046 
} 
```
 
As a bonus it also comes with a PRNG which is equally simple to implement: 
 
```c
#include <stdio.h> 
#include <stdlib.h> 
#include <time.h> 
#include "komihash.h" 
 
int main(int argc, char *argv[]) { 
uint64_t seed1 = time(NULL) * 0x61c8864680b583ebull; // hash64 
uint64_t seed2 = seed1 * 0x61c8864680b583ebull; // hash64 
 
for (int i = 0; i < 5; i++) { 
uint64_t rand64 = komirand(&seed1, &seed2); 
printf("Komirand: %llu\n", rand64); 
} 
} 
```
 
In fact, I liked it so much I ported it to Perl and called it [Crypt::Komihash](https://github.com/scottchiefbaker/perl-Crypt-Komihash/).
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1413/" />
<title mode="escaped">Perl: Warning about non-portable numbers</title>
<modified>2025-01-16T00:00:00-08:00</modified>
<issued>2025-01-16T00:00:00-08:00</issued>
<created>2025-01-16T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1413/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
If you get a Perl warning about non-portable numbers like this: 
 
```bash
Hexadecimal number > 0xffffffff non-portable at /tmp/x.pl line 19. 
```
 
It means that you are using a hex number greater than 2^32. I dunno why this is a warning when everything is 64bit these days, but it is. There have been a couple of times I needed this in my code so you can disable these warnings with: 
 
```perl
no warnings 'portable'; 
```
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1412/" />
<title mode="escaped">Books of 2025</title>
<modified>2025-01-08T00:00:00-08:00</modified>
<issued>2025-01-08T00:00:00-08:00</issued>
<created>2025-01-08T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1412/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
List of books I read in 2025. Also see the list of [2024](/display/1392_Books_of_2024.html). The date indicated denotes the date I started reading the book. 
 
2025-01-06 - [Mistborn](//www.google.com/search?tbo=p&q=isbn+9781250318541) by Brandon Sanderson - 643 pages 
2025-01-17 - [Ender's Game](//www.google.com/search?tbo=p&q=isbn+0812550706) by Orson Scott Card - 324 pages 
2025-01-22 - [Thinner](//www.google.com/search?tbo=p&q=isbn+0451137965) by Stephen King - 318 pages 
2025-01-26 - [The Dead Zone](//www.google.com/search?tbo=p&q=isbn+0670260770) by Stephen King - 426 pages 
2025-02-02 - [The Neverending Story](//www.google.com/search?tbo=p&q=isbn+9780140074314) by Michael Ende - 377 pages 
2025-02-08 - [The Well Of Ascension](//www.google.com/search?tbo=p&q=isbn+9781250318572) by Brandon Sanderson - 785 pages 
2025-02-21 - [Skeleton Crew - The Monkey](//www.google.com/search?tbo=p&q=isbn+9780399130397) by Stephen King - 32 pages 
2017-02-21 - [Speaker for the Dead](//www.google.com/search?tbo=p&q=9780812550757) by Orson Scott Card - 395 Pages 
2025-02-27 - [Insomnia](//www.google.com/search?tbo=p&q=isbn+0670855030) by Stephen King - 787 pages 
2025-03-11 - [Hero Of Ages](//www.google.com/search?tbo=p&q=isbn+9781250318626) by Brandon Sanderson - 752 pages 
2025-03-23 - [Xenocide](//www.google.com/search?tbo=p&q=isbn+0812509250) by Orson Scott Card - 592 pages 
2025-04-01 - [Tainted Cup](//www.google.com/search?tbo=p&q=isbn+9781984820709) by Robert Jackson Bennett - 410 pages 
 
2025-xx-xx - [The Sword Of Shannara](//www.google.com/search?tbo=p&q=isbn+9780345314253) by Terry Brooks - 726 pages
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1411/" />
<title mode="escaped">C: Nanoseconds since Unix epoch</title>
<modified>2024-12-31T00:00:00-08:00</modified>
<issued>2024-12-31T00:00:00-08:00</issued>
<created>2024-12-31T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1411/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
I needed a function to use as a simple seed for `srand()`. Unixtime in nanoseconds changes very frequently and serves as a semi-decent random seed.
 
```c
#include <time.h> // for clock_gettime() 
 
// Nanoseconds since Unix epoch 
uint64_t nanos() { 
struct timespec ts; 
 
// int8_t ok = clock_gettime(CLOCK_MONOTONIC, &ts); // Uptime 
int8_t ok = clock_gettime(CLOCK_REALTIME, &ts); // Since epoch 
 
if (ok != 0) { 
return 0; // Return 0 on failure (you can handle this differently) 
} 
 
// Calculate nanoseconds 
uint64_t ret = (uint64_t)ts.tv_sec * 1000000000ULL + (uint64_t)ts.tv_nsec; 
 
return ret; 
} 
```
 
See also: [Microseconds](/display/1409_Perl_Get_microseconds_since_Unix_epoch.html) since epoch in Perl
]]>
</content>
</entry>
<entry xmlns="http://purl.org/atom/ns#">
<link rel="alternate" type="text/html" href="http://www.perturb.org/display/entry/1410/" />
<title mode="escaped">Git: Show all changes to a given file</title>
<modified>2024-12-31T00:00:00-08:00</modified>
<issued>2024-12-31T00:00:00-08:00</issued>
<created>2024-12-31T00:00:00-08:00</created>
<id>http://www.perturb.org/display/entry/1410/</id>
<summary type="text/plain"></summary>
<author>
<name>Scott Baker</name>
<url>http://www.perturb.org/</url>
<email>scott@perturb.org</email>
</author>
<content type="text/html" mode="escaped" xml:lang="en" xml:base="http://www.perturb.org">
<![CDATA[<link rel="stylesheet" type="text/css" media="screen" href="/css/rss-feed.css" title="Default" />
If you want to view the history of all the changes you've made to a specific file in Git you can use the `log` command in Git. This will show you all the commits that touched that file, and the associated commit message.
 
```
git log README.md 
```
 
If you want to see a diff/patch for each commit you can run: 
 
```
git log --follow --patch README 
```
 
This can be very useful to track down when a specific piece of code went into (or was taken out of) a file. Be careful as this command only shows you the diff/patch for the file you request. If the commit contains changes to other files you will **not** see those unless you view the full commit.
]]>
</content>
</entry>
</feed>

Home · About · News · Docs · Terms