Found 11 matching results.
Posted by MacRohard at 2026-03-01 01:13:21.158
Posted by MacRohard at 2025-06-01 20:11:08.828
Posted by solar at 2024-08-05 17:53:56.849
Posted by null at 2023-12-20 21:07:20.524
Posted by gears at 2017-10-23 01:32:31.53
Posted by gears at 2017-10-15 17:58:02.26
Posted by gears at 2017-10-15 17:57:27.386
Posted by gears at 2017-09-08 04:18:40.235
Posted by solar at 2017-08-08 21:44:38.713
Posted by gears at 2017-07-27 04:43:15.128
Posted by MacRohard at 2017-05-30 04:28:01.131
Posted by MacRohard at 2026-03-01 01:13:09.319 Posted by null at 2026-03-01 01:12:01.807 Posted by MacRohard at 2026-03-01 01:10:55.232 Posted by matthewjdorre at 2026-03-01 01:05:00.865 Posted by yang at 2026-03-01 01:04:11.285 Posted by MacRohard at 2026-02-28 23:29:42.804 Posted by MacRohard at 2026-02-28 22:47:08.303 Posted by solar at 2026-02-28 21:03:34.864 Posted by solar at 2026-02-28 19:58:41.097 Posted by MacRohard at 2026-02-28 17:56:05.848 Posted by solar at 2026-02-28 02:58:53.89...
advertising /32 null routes
--- source/input.c.orig Wed May 21 21:23:37 2003 +++ source/input.c Thu Jun 19
23:41:15 2003 @@ -1130,17 +1130,20 @@ NickList
*lookup_nickcompletion(ChannelList *chan, char *possible) { -NickList *nick,
*ntmp = NULL, *bestmatch = NULL; +NickList *nick, *ntmp = NULL; for (nick =
next_nicklist(chan, NULL); nick; nick = next_nicklist(chan, nick)) { if
(!my_stricmp(possible, nick->nick)) - bestmatch = ntmp = nick; + return nick;
/* match */ else if (!my_strnicmp(possible, nick->nick, strlen...