New paste›Public feed

Public feed

Pastes people chose to make public. Author names hidden.
  • Mine

    1431508·text·39.4 KB·2009-05-22 23:03 UTC
    
        
  • eina-0.7.3.91.ebuild

    1431442·text·897 B·2009-05-22 22:32 UTC
    # Copyright 1999-2009 Gentoo Foundation
    # Distributed under the terms of the GNU General Public License v2
    # $Header: $
    
    EAPI="2"
    
    inherit eutils flag-o-matic
    
    DESCRIPTION="Network focused por
  • Untitled

    1431423·text·1.4 KB·2009-05-22 22:12 UTC
    leuhmanu: rpm name match `ntfs':
     libntfs10
     libntfs-devel
     ntfs-3g
     ntfs-3g-debug
     ntfs-3g-devel
     ntfs-config
     ntfs-config-debug
     ntfsprogs
     ntfsprogs-debug
     ntfsprogs-g
  • Something

    1431408·text·54.1 KB·2009-05-22 21:54 UTC
    
        
  • Miscellany

    1431372·text·113.4 KB·2009-05-22 21:11 UTC
    
        
  • root

    1431343·text·17 B·2009-05-22 20:16 UTC
    testing 2 4 6 8 9
  • root

    1431341·text·10 B·2009-05-22 20:14 UTC
    test 1 2 3
  • root

    1431339·text·22.8 KB·2009-05-22 20:14 UTC
    !!################################
    !!ALSA Information Script v 0.4.41
    !!################################
    
    !!Script ran on: Fri May 22 17:04:00 BRT 2009
    
    !!Linux Distribution
    !!------------------
    
    Fe
  • josh

    1431278·text·14.9 KB·2009-05-22 18:57 UTC
    !!################################
    !!ALSA Information Script v 0.4.56
    !!################################
    
    !!Script ran on: Fri May 22 18:57:48 UTC 2009
    
    !!Linux Distribution
    !!------------------
    
    Ar
  • Mine

    1431263·text·288 B·2009-05-22 18:41 UTC
    def geotrac(self):
     if not hasattr(self, 'geotrac'):
     assert self.env.is_component_enabled(GeoTrac)
     geotrac = self.env.components[GeoTrac]
     assert geot
  • comhem_server_data

    1431255·text·4.7 KB·2009-05-22 18:36 UTC
    root@server:~# tcpdump -n -vv -X 'tcp port 65095'
    tcpdump: listening on eth0, link-type EN10MB (Ethernet), capture size 96 bytes
    16:36:33.410740 IP (tos 0x0, ttl 119, id 17502, offset 0, flags [DF],
  • comhem_client_data

    1431252·text·2.8 KB·2009-05-22 18:35 UTC
    root@client:~# tcpdump -n -vv -X 'tcp port 65095'
    tcpdump: listening on eth0, link-type EN10MB (Ethernet), capture size 96 bytes
    16:35:22.439095 IP (tos 0x0, ttl 64, id 50831, offset 0, flags [DF],
  • 2cc lang check

    1431223·text·650 B·2009-05-22 18:16 UTC
    marcel@inspiron:~/hg/2cctrainset> ./scripts/lang.check.sh
    ---------------------------------
    File 7F_english.nfo
    Lang code: 7F
    rows: 288
    Action4: 50
    Translated: 42
    generic: 7
    --------------------------
  • Anonymous

    1430952·text·2.0 KB·2009-05-22 13:10 UTC
    [-] Allocated 475488 bytes for 18 tables.
    [-] Searching for tables...
    [-] Loaded table 'Play Chip 213' (Window: 1000,600)
    [-] Found 1 tables.
    
    [-] Table Limit Game Type
  • gergap

    1430940·text·53.9 KB·2009-05-22 12:55 UTC
    
        
  • Mine

    1430937·text·2.7 KB·2009-05-22 12:48 UTC
    #!/usr/bin/python
    
    import sys
    import urllib
    from string import maketrans
    #from xml.sax import make_parser, handler
    from xml.sax import handler, parseString
    class ElementProcesser(handler.Conten
  • Miscellany

    1430861·c·657 B·2009-05-22 10:31 UTC
    #include <stdio.h>
    
    int fibonacci(int liczba)
    {
     if(liczba == 0) return 0; // F0 = 0
     else if(liczba == 1) return 1; // F1 = 1
     else if(liczba < 0) return -1; // zabezpieczenie gdyby ktos wpisal
  • Stuff

    1430859·text·314 B·2009-05-22 10:29 UTC
    Olorin2: 1.9.0.10-0.1mdv2009.0 in main/updates, 2009.0 for i586
    Olorin2: 1.9.0.8-0.1mdv2009.0 in main/updates, 2009.0 for i586
    Olorin2: 1.9.0.7-0.1mdv2009.0 in main/updates, 2009.0 for i586
    Olorin2: 1
  • Something

    1430837·text·50.4 KB·2009-05-22 10:01 UTC
    
        
  • SearchProcessMemory

    1430823·c·1.1 KB·2009-05-22 09:38 UTC
    int findBytes(char *b, int bl, char *f, int fl)
    {
     int i=0,x;
     for (;i<bl-fl;i++) 
     for (x=0;x<fl;x++) 
     if (b[i+x]!=f[x]) break; 
     else if (x==fl-1) return i;
     return -1;
    }

older pastes →