-
2035500·text·1.9 KB·2011-01-01 06:55 UTC
Index: resources/lib/scrapers/lyricstime/lyricsScraper.py
===================================================================
--- resources/lib/scrapers/lyricstime/lyricsScraper.py
+++ resources/lib/s
-
2035450·mirc·1.0 KB·2011-01-01 03:18 UTC
on *:open:?:{
;This will only trigger when someone PMs yuo, not visa vera
if ([??:??:??] iswm $1) return
;check for the nework
if ($network == DALnet) {
;Check to see if they
-
2035275·php·88.4 KB·2010-12-31 20:55 UTC
-
2035245·cpp·523 B·2010-12-31 19:52 UTC
// for loop.:)
#include <csdtio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int nNumberofArgs, char* pszArgs[])
{
// input loop count
int nLoopCount;
cout
-
2035243·cpp·523 B·2010-12-31 19:47 UTC
// for loop.:)
#include <csdtio>
#include <cstdlib>
#include <iostream>
using namespace std;
int main(int nNumberofArgs, char* pszArgs[])
{
// input loop count
int nLoopCount;
cout
-
2035186·text·30.2 KB·2010-12-31 17:33 UTC
------------------
System Information
------------------
Time of this report: 12/31/2010, 12:10:07
Machine name: ANDREW-PC
Operating System: Windows 7 Home Premium 64-bit (6.1, Build 76
-
2035121·vb·191 B·2010-12-31 15:25 UTC
Public Class Form1
Private Sub Button1_Click(ByVal sender As System.Object, ByVal e As System.EventArgs) Handles Button1.Click
ProgressBar1.Value = 100
End Sub
End Class
-
2035080·text·5.5 KB·2010-12-31 14:08 UTC
# Default Fonts
use_xft yes
xftfont Liberation Sans:size=7
override_utf8_locale yes
# Performance Settings
update_interval 1
total_run_times 0
double_buffer yes
no_buffers yes
net_avg_s
-
2035079·text·1.2 KB·2010-12-31 14:04 UTC
Index: src/common/paws/pawslistbox.cpp
===================================================================
--- src/common/paws/pawslistbox.cpp (Revision 6659)
+++ src/common/paws/pawslistbox.cpp (A
-
2035067·text·807 B·2010-12-31 13:42 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2035057·text·4.5 KB·2010-12-31 13:22 UTC
1 :: 2
4 :: 24
9 :: 108
16 :: 320
25 :: 750
36 :: 1512
49 :: 2744
64 :: 4608
81 :: 7290
100 :: 11000
121 :: 15972
144 :: 22464
169 :: 30758
196 :: 41160
225 :: 54000
256 :: 69632
289 :: 88434
324 :: 1
-
2035052·text·807 B·2010-12-31 13:06 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou
-
2035036·text·382 B·2010-12-31 12:38 UTC
on *:TEXT:*done*:#:{
if ($nick != St) { halt }
/scon 1 /msg #Complete-Chan 9 $+ $strip($1-) $+
}
}
on *:TEXT:COMPLETE*:#:{
if ($nick != SCRAP) { halt }
-
2035009·diff·539 B·2010-12-31 11:52 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035008·diff·539 B·2010-12-31 11:50 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035005·diff·539 B·2010-12-31 11:49 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2035004·text·539 B·2010-12-31 11:49 UTC
diff -r f6ba4e16addd -r 378e86913081 v4l/compat.h
--- a/v4l/compat.h Fri Dec 31 12:26:51 2010 +0100
+++ b/v4l/compat.h Fri Dec 31 12:33:14 2010 +0100
@@ -14,7 +14,7 @@
#define INIT_DELAYED_WORK(a
-
2034893·text·4.5 KB·2010-12-31 07:50 UTC
1 :: 2
4 :: 24
9 :: 108
16 :: 320
25 :: 750
36 :: 1512
49 :: 2744
64 :: 4608
81 :: 7290
100 :: 11000
121 :: 15972
144 :: 22464
169 :: 30758
196 :: 41160
225 :: 54000
256 :: 69632
289 :: 88434
324 :: 1
-
2034883·text·288 B·2010-12-31 07:22 UTC
/* example code: `gcc -o prd krk.c -lm` */
#include <stdio.h>
#include <math.h>
unsigned main(void)
{
unsigned m, n, l;
m = n = 1;
l = pow(255, 2);
for(n = 1; n <= l; n = pow(++m, 2)) {
unsig
-
2034882·text·823 B·2010-12-31 07:21 UTC
/* sample example: `gcc -o foo bar -lm`
* having inane equation n(n+sqrt(n))=L where:
* n increments as m=1; n=(++m)**2 .. so only integers are used
* the highest value of sqrt(n) is FF (255) so n cou