Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit31c9b9c

Browse files
Add syntax highlighting to readme code snippets.
1 parent56be07f commit31c9b9c

File tree

1 file changed

+22
-12
lines changed

1 file changed

+22
-12
lines changed

‎README.md‎

Lines changed: 22 additions & 12 deletions
Original file line numberDiff line numberDiff line change
@@ -29,15 +29,19 @@ Include it through [RequireJS](http://requirejs.org/) or
2929
[Browserify](http://browserify.org). Or, to pollute your global scope, insert
3030
this in your HTML:
3131

32-
<script src="priority-queue.js"></script>
32+
```html
33+
<scriptsrc="priority-queue.js"></script>
34+
```
3335

3436
Then write code like this:
3537

36-
var queue = new PriorityQueue({ comparator: function(a, b) { return b - a; }});
37-
queue.queue(5);
38-
queue.queue(3);
39-
queue.queue(2);
40-
var lowest = queue.dequeue(); // returns 5
38+
```js
39+
var queue=newPriorityQueue({comparator:function(a,b) {return b- a; }});
40+
queue.queue(5);
41+
queue.queue(3);
42+
queue.queue(2);
43+
var lowest=queue.dequeue();// returns 5
44+
```
4145

4246
Options
4347
=======
@@ -46,13 +50,17 @@ How exactly will these elements be ordered? Let's use the `comparator` option.
4650
This is the argument we would pass to
4751
[Array.prototype.sort](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/sort):
4852

49-
var compareNumbers = function(a, b) { return a - b; };
50-
var queue = new PriorityQueue({ comparator: compareNumbers });
53+
```js
54+
varcompareNumbers=function(a,b) {return a- b; };
55+
var queue=newPriorityQueue({ comparator: compareNumbers });
56+
```
5157

5258
You can also pass initial values, in any order. With lots of values, it's
5359
faster to load them all at once than one at a time.
5460

55-
var queue = new PriorityQueue({ initialValues: [ 1, 2, 3 ] })
61+
```js
62+
var queue=newPriorityQueue({ initialValues: [1,2,3 ] })
63+
```
5664

5765
Strategies
5866
==========
@@ -73,9 +81,11 @@ instead of a bit-shift). So while it's fast in theory, it's slower in practice.
7381

7482
Create the queues like this:
7583

76-
var queue = new PriorityQueue({ strategy: PriorityQueue.ArrayStrategy }); // Array
77-
var queue = new PriorityQueue({ strategy: PriorityQueue.BinaryHeapStrategy }); // Default
78-
var queue = new PriorityQueue({ strategy: PriorityQueue.BHeapStrategy }); // Slower
84+
```js
85+
var queue=newPriorityQueue({ strategy:PriorityQueue.ArrayStrategy });// Array
86+
var queue=newPriorityQueue({ strategy:PriorityQueue.BinaryHeapStrategy });// Default
87+
var queue=newPriorityQueue({ strategy:PriorityQueue.BHeapStrategy });// Slower
88+
```
7989

8090
You'll see running times like this:
8191

0 commit comments

Comments
 (0)

[8]ページ先頭

©2009-2025 Movatter.jp