Planet Free Software

need · Did this article solve a problem you had with Firefox?

(define (dtft samples)
  (lambda (omega)
    (sum 0 (vector-length samples)
         (lambda (n)
           (* (vector-ref samples n)
              (make-polar 1 (* omega n)))))))

(define (dtft original sample-interval sample-count)
  (lambda (omega)
    (sum 0 sample-count
         (lambda (n)
           (* (original (* sample-interval n))
              (make-polar 1 (* omega n)))))))

;; Non robust.  Assumes N is a fixnum in the right range.
(define (vector->function sample-vector)
  (lambda (n) (vector-ref sample-vector n)))

(define (memoize f)
  (let ((table (make-eqv-hash-table))) ;; eqv works on floats
    (lambda (arg)
      (or (hash-table/get table arg #f)
          (let ((value (f arg)))
            (hash-table/put! table arg value)
            value)))))

(define ym
  (memoize
   (dtft (vector->function *data*) 1 8192)))

(define (inverse-dtft y domega)
  (lambda (n)
    (define (f omega)
      (* (y omega)
         (make-polar 1 (* omega (- n)))))

    (/ (real-part (integrate f (- *pi*) *pi* domega))
       (* *pi* 2))))

(define (trapezoid f a b h)
  (let* ((n (/ 1 h)) 
         (dx (/ (- b a) n)))
    (define (iter j sum)
      (if (>= j n) 
          sum
          (let ((x (+ a (* j dx))))
            (iter (+ j 1) (+ sum (f x))))))
    (* dx (iter 1 (+ (/ (f a) 2) (/ (f b) 2))))))

(define integrate trapezoid)

(do ((i 1 (+ i 1))
     (d-omega 1.0 (/ d-omega 2)))
    ((>= i 13))
  (display i)
  (display " ")
  (display d-omega)
  (display " ")
  (display ((inverse-dtft ym d-omega) 250))
  (newline))

1 1. -161.
2 .5 32215.
3 .25 16091.999999999949
4 .125 8074.
5 .0625 4074.000000000024
6 .03125 2048.0000000000246
7 .015625 1050.0000000000236
8 .0078125 571.9999999999932
9 .00390625 336.9999999999946
10 .001953125 235.99999999999997
11 .0009765625 184.9999999999997
12 .00048828125 160.99999999999937
13 .000244140625 153.00000000000196

    @font-face {
      font-family: "My Font";
      src: URL("data:font/opentype;base64,[base-encoded font here]");
    }

    body { font-family: "My Font", serif }

ERROR: ActiveRecord oracle_enhanced adapter could not load ruby-oci8 library. Please install ruby-oci8 library or gem.
/usr/lib/ruby/gems/1.8/gems/activerecord-2.3.2/lib/active_record/connection_adapters/abstract/connection_specification.rb:76:in
`establish_connection':RuntimeError: Please install the oracle_enhanced adapter:
`gem install activerecord-oracle_enhanced-adapter` (LoadError)

@interface Server : Updatable {
NSString *name;  <-- declare the property 
}

@property (nonatomic,retain) NSString *name; <--- declare the property again

@synthesize name;  <-- implement getter/setter

-(void) dealloc {
[name release];  <-- release memory
}

commit f884a1ae954d14928a6a7055d4d4b182fbb2a3bc
Author: Richard Hughes <richard_at_hughsie.com>
Date:   Fri Jul 3 13:49:05 2009 +0100
    HAL is no longer a dependency of gnome-power-manager
#EXTM3U
#EXTINF:224,Mario Vazquez - 4 The 1
F:\Music\RnB\2000s\4 The 1 - Mario Vazquez.mp3
#EXTINF:232,Kylie Minogue ft. Mims - All I See
F:\Music\RnB\2000s\All I See - Kylie Minogue Ft. Mims.mp3
#EXTINF:184,Kylie Minogue - All I See
F:\Music\RnB\2000s\All I See - Kylie Minogue.mp3

#EXTM3U
#EXTINF:294,Motherless Children
E:\Music\01-Motherless Children.Flac
#EXTINF:247,Better Make It Through Today
E:\Music\02-Better Make It Through Today.Flac

if ($line =~ m/^\//) {  # Check if the line begins with just a /
                        # indicating a UNIX OS being used (escaping of course)
  $line =~ s/\//\\/g;   # Replace / with \ with appropriate escaping of characters
}

import Text.PrettyPrint.Leijen
myPrettyList :: Pretty a => [a] -> Doc
myPrettyList = vcat . map pretty
getChoice vt opts = let
        _converted_opts = myPrettyList opts
    in do
        (sx, sy) <- getSize vt
        _getChoice vt (lines $ show _converted_opts) 0 sx sy
import qualified Data.Set as S

closure xs fs = closure' S.empty (S.fromList xs) where
    closure' interior boundary
        | S.null boundary = S.toList interior
        | otherwise =
            let interior' = S.union interior boundary
                boundary' = S.fromList [f x | x - S.toList boundary, f - fs] S.\\ interior'
            in closure' interior' boundary' 

conjClassReps gs = conjClassReps' (elts gs) where
    conjClassReps' (h:hs) =
        let cc = conjClass gs h in (h, length cc) : conjClassReps' (hs \\ cc)
    conjClassReps' [] = []

export PATH=$prefix/bin:$PATH
export PKG_CONFIG_PATH=$prefix/lib/pkgconfig

CREATE TABLE _TREE_ (
    id int(11) NOT NULL auto_increment,
    parent_id   int(11)  NOT NULL DEFAULT 0,
    seqid int(11)  NOT NULL DEFAULT 0,
    depth int(11)  NOT NULL DEFAULT 0,
    leaf int(1)  NOT NULL DEFAULT 0,
    name varchar(128) default '',
    fullpath TEXT default '',
    PRIMARY KEY  (`id`),
    INDEX qlookup( parent_id , seqid , depth)
);

DROP PROCEDURE IF EXISTS _TREE__resequence;

DELIMITER $$
CREATE PROCEDURE _TREE__resequence(i_sep VARCHAR(4))   DETERMINISTIC
  BEGIN
        DECLARE v_p, v_d, v_s INT(11);
        DECLARE v_fp TEXT;
        SET v_fp = '';
        SET v_p =0;
        SET v_d =0;
        SET v_s =0;
        SET max_sp_recursion_depth=255;
        CALL _TREE__resequence_sub(v_p, v_d, v_fp, i_sep, v_s);

    END $$
DELIMITER ;

DROP PROCEDURE IF EXISTS _TREE__resequence_sub;

DELIMITER $$
CREATE PROCEDURE _TREE__resequence_sub(
    i_parent INT(11),
    i_depth INT(11),
    i_fullpath TEXT,
    i_sep VARCHAR(4),
    INOUT i_seqid INT(11)
    )   DETERMINISTIC
    BEGIN
        DECLARE v_nid, v_ex_seqid  INT(11);
        DECLARE v_name VARCHAR(128);
        DECLARE v_leaf INT(1);
        DECLARE v_fullpath TEXT;
        DECLARE done INT DEFAULT 0;

        DECLARE qry CURSOR FOR SELECT id, seqid, name  FROM _TREE_ 
              WHERE parent_id = i_parent ORDER BY seqid;
        DECLARE CONTINUE HANDLER FOR NOT FOUND SET done = 1;
        OPEN qry;

        REPEAT
            FETCH qry INTO v_nid, v_ex_seqid, v_name;

            IF NOT done THEN
                IF v_ex_seqid != i_seqid THEN 
                    UPDATE _TREE_ SET seqid = i_seqid, depth=i_depth WHERE id=v_nid;
                END IF;
                IF i_depth > 0 THEN 
                    SET v_fullpath = CONCAT(i_fullpath, i_sep, v_name);
                ELSE 
                    SET v_fullpath = v_name;
                END IF;
                SET v_leaf =0;
                SELECT COUNT(id) INTO v_leaf FROM _TREE_ where parent_id = v_nid;

                UPDATE _TREE_ SET 
                    fullpath = v_fullpath,
                    leaf = IF (v_leaf > 0, 0 , 1)
                    WHERE id=v_nid;

                SET i_seqid = i_seqid +1;
                #// do the children..
                CALL _TREE__resequence_sub(v_nid, i_depth+1, v_fullpath, i_sep, i_seqid);
            END IF;
        UNTIL done END REPEAT;

        CLOSE qry;

    END $$
DELIMITER ;

DROP FUNCTION IF EXISTS _TREE__add_node;

DELIMITER $$
CREATE FUNCTION _TREE__add_node(
    i_parent INT(11),
    i_after INT(11),
    i_name VARCHAR(128)
    ) RETURNS INT(11) DETERMINISTIC
    BEGIN

        DECLARE v_depth INT(11);
        DECLARE v_seqid INT(11);
        DECLARE v_ret INT(11);
        DECLARE v_tmp INT(11);

        SET v_depth = 0;
        SET v_seqid = 0;
        SET
void createSparkThread (Capability *cap) {
    StgTSO *tso;
    tso = createIOThread (cap, RtsFlags.GcFlags.initialStkSize,
                                  &base_GHCziConc_runSparks_closure);
    postEvent(cap, EVENT_CREATE_SPARK_THREAD, 0, tso->id);
    appendToRunQueue(cap,tso);
}

## in main.o ##################### (linked into main.exe)
main:
    call fun
    ....
    call dword ptr [__imp_fun]
    …. 

## in base.lib ###################### (linked into main.exe)
fun:
    jmp dword ptr [__imp_fun]

__imp_fun:
.data
    .dword fun

## in base.dll ######################
fun:
    .. actual code for fun   

xs:untypedAtomic("-P1Y1M1DT1H1M1.123S") castable as xs:yearMonthDuration

<div id="header">
    <h1>My Awesome Website</h1>
    <form> </form>
</div>
<div id="content">
    <ul id="nav"></ul>
    My website rocks!
</div>
<div id="footer"></div>

<div id="header" role="banner">
    <h1>My Awesome Website</h1>
    <form role="search"> </form>
</div>
<div id="content" role="main">
    <ul id="nav" role="navigation"></ul>
    My website rocks!
</div>
<div id="footer"></div>

<form id="searchform" role="search">
      <p class="error">You did not enter a search term</p>
      <input name="query" value="" aria-required="true" aria-invalid="true" />
</form>

    <div id="sidecontent" aria-live="polite"> AJAX content goes here... <div>

  recipes_view = <<_JS
{
  "views": {
    "by_date": {
      "map": "function (doc) {
        if (typeof(doc['preparations']) != 'undefined') {
          emit(doc['date'], [doc['_id'], doc['title']]);
        }
      }"
    },
  },
  "language": "javascript"
}
_JS

  RestClient.put "#{@@db}/_design/recipes",
    recipes_view,
    :content_type => 'application/json'
  url = "#{@@db}/_design/recipes/_view/by_date?limit=10&descending=true"
  data = RestClient.get url
  @recipe_view = JSON.parse(data)['rows']
Feature: RSS

  So that I tell my user when there are updates to this great cooking site
  As an RSS bot
  I want to be able to consume your RSS

  Scenario: Recipe RSS

    Given 20 delicious, easy to prepare recipes
    When I access the recipe RSS feed
    Then I should see the 10 most recent recipes
    And I should see the summary of each recipe
When /^I access the recipe RSS feed$/ do
  visit('/recipes.rss')
  response.should be_ok
end

Then /^I should see the 10 most recent recipes$/ do
  response.
    should have_selector("channel > item > title",
                         :count => 10)
  response.
    should have_selector("channel > item > title",
                         :content => "delicious, easy to prepare")
end
var lis = document.getElementsByTagName("li");
for (var i=0; i<lis.length; i++) { // yes this could be more efficient, don't care
  // do something here to lis[i]
};
$("li").each(function() {
  // do something here to this
});
var lis = document.getElementsByTagName("li");
for (var i=0; i<lis.length; i++) { // yes this could be more efficient, don't care
  // do something here to lis[i]
  progressMonitor.innerHTML = "processing list item " + i; // fail
};
var lis = document.getElementsByTagName("li");
var counter = 0;
function doWork() {
  // do something here to lis[i]
  counter += 1;
  progressMonitor.innerHTML = "processing list item " + counter;
  if (counter < lis.length) {
    setTimeout(doWork, 1);
  }
};
setTimeout(doWork, 1);

jQuery.eachCallback = function(arr, process, callback) {
    var cnt = 0;
    function work() {
        var item = arr[cnt];
        process.apply(item);
        callback.apply(item, [cnt]);
        cnt += 1;
        if (cnt < arr.length) {
            setTimeout(work, 1);
        }
    }
    setTimeout(work, 1);
};
jQuery.fn.eachCallback = function(process, callback) {
    var cnt = 0;
    var jq = this;
    function work() {
        var item = jq.get(cnt);
        process.apply(item);
        callback.apply(item, [cnt]);
        cnt += 1;
        if (cnt < jq.length) {
            setTimeout(work, 1);
        }
    }
    setTimeout(work, 1);
};
$.eachCallback(someArray, function() {
  // "this" is the array item, just like $.each
}, function(loopcount) {
  // here you get to do some UI updating
  // loopcount is how far into the loop you are
});

$("li").eachCallback(function() {
  // do something to this
}, function(loopcount) {
  // update the UI
});
#include <cstring>

int main() {
  char *foo = strchr("ciao", 'a');
}
% g++-4.3.3 test-const.cc -o test-const    
% g++-4.4.0 test-const.cc -o test-const 
test-const.cc: In function ‘int main()’:
test-const.cc:4: error: invalid conversion from ‘const char*’ to ‘char*’
#include <cstring>

int main() {
  char *foo = strchr("ciao", 'a');
  *foo = 'e';
}
#include <cstring>

int main() {
  char *foo = (char*)strchr("ciao", 'a');
}
#include <cstring>

int main() {
  const char *foo = strchr("ciao", 'a');
}
#include <cstring>

int main() {
  char *foo = const_cast<char*>(strchr("ciao", 'a'));
  *foo = 'e';
}
graphs.mozilla.org
<Connector port="9443"
               connectionTimeout="20000"
               maxHttpHeaderSize="8192"
               maxThreads="150"
               minSpareThreads="25"
               maxSpareThreads="75"
               enableLookups="false"
               disableUploadTimeout="true"
               acceptCount="100"
               scheme="https"
               secure="true"
               clientAuth="false"
               keystoreFile="ibm-team-ssl.keystore"
               keystorePass="ibm-team"
               sslProtocol="TLS"
			   algorithm="SunX509"
			   URIEncoding="UTF-8" />

Planet Free Software

PostgreSQL: Hubert Lubaczewski: Waiting for 8.5 – let’s start

Mozilla: Firefox Support Blog: Measuring the success of the knowledge base

OSFlash: Projects

OSFlash: flvlib - created

OpenBSD: New Ports of The Week (June 29)

OSFlash: Open Source Flash Projects

Scheme: Joe Marshall: A little Scheme code

Smalltalk: More readable code with less typing

Eclipse: Doug Schaefer: MinGW on Linux on Windows 7???

KDE: Carsten Niehaus (carsten): Progress in the predator prey simulation

OpenID: Kaliya Hamlin: Cultivating Community

OpenID: Kaliya Hamlin: IIW & Identity Community Bumps in the Road

OpenID: Kaliya Hamlin: Facebook Changing Privacy Settings

OpenID: Kaliya Hamlin: OpenID goes mainstream – Sears and KMart are now relying parties

SuSE: Marcus Meissner: Update

Planet Haskell: "Osfameron": Bids for YAPC::EU::2010 - Pisa and Kiev!

Mozilla: Alex Vincent: Scott Adams vs AdBlock Plus

RDF: We’re Hiring

SuSE: Chenthill P: GUADEC!

Eclipse: Robert Konigsberg: Generic types are not required for covariance

CouchDB: The P2P Web (part one)

Mozilla: Aakash Desai: What’s Next for Testdays?

Mozilla: Robert Accettura: Optimizing @font-face For Performance

OpenOffice: Hubert Figuiere: A real paper cut

OSFlash: desuade motion package

Gentoo: Alex Legler: LinuxTag: Booth Review

Ubuntu: Juanje Ojeda: Last advices for the GCDS

SuSE: Roger Whittaker: EuroPython 2009

SuSE: Roger Whittaker: Recent photos

Ubuntu: Vincent Untz: GNOME Foundation Board Meeting at GUADEC

Ubuntu: Mirco Müller: Hit Las Palmas

KernelPlanet: Valerie Aurora: Soft updates explained

Mozilla: Gervase Markham: Gerv Status 2009-07-03

This Week

Governance

Bugzilla

Other

Next Week

PostgreSQL: Peter Eisentraut: Do you have a good idea for PostgreSQL?

Ubuntu: Martin Owens: Why do you Like Microsoft?

Mozilla: Neil Deakin: What’s Next for Focus

GNOME: Behdad Esfahbod: GUADEC Day 0

OpenOffice: IssueZilla: New issues: Fri Jul 3 15:43:00 UTC 2009

Debian: David Welton: ruby-oci8 and libaio

GStreamer: Felipe Contreras: libmtag-0.3.0: moved to git

Smalltalk: Smalltalk Daily 7/3/09: Code Visibility in Web Velocity

KDE: Stefan Majewsky: Kolf: Creating a terrain texture, and the 4.3 release

Ubuntu: Siegfried Gevatter: Zeitgeist since UDS

Python: Isotoma: Black Box BlackBerry

XMLhack: Junepix 3: Global Roses

OpenOffice: Gullfoss: Hanging out with Open Solaris Guys

Ubuntu: Pedro Villavicencio: En Gran Canaria!

KernelPlanet: Evgeniy Polyakov: Say NO to SQL database storages?

GNOME: Dan Williams: Die HAL Die

Python: Tarek Ziade: Distutils nighlty builds

Eclipse: David Green: Android versus iPhone Development: A Comparison

Language, Programming Model and Platform

Language

Platform

Programming Model

Testing and Continuous Integration

Resources

Tooling

IDE

UI Builder

Debugger

Profiler and Heap Analysis

App Store

Summary

Planet Haskell: Sebastian Fischer: FP Overview

Mozilla: Robert Kaiser: Changes to SeaMonkey nightlies and tinderbox waterfalls

RDF: First Public Working Draft of SPARQL New Features and Rationale

Smalltalk: [Smalltalk Tidbits, Industry Rants] Eating our own Dogfood

GNOME: Richard Hughes: HALectomy of gnome-power-manager complete

Debian: Luca Favatella: kFreeBSD progress report week 6

Symfony: Symfony Components : The Event Dispatcher

Python: Python African Tour: We’re in Senegal next week

PHP: DPC 2009 Day 1 - Ibuildings Blog

Python: Python Software Foundation: Python 3.0 is an ex-release! Long live Python 3.1!