I have made a possibly useful improvement to the JS search code.
It's not pushed, yet, but I dropped the revised JS code on the
pre-built pages so you can try it out here:
http://pre.racket-lang.org/docs/html/search/
and compare searches with the usual page:
On Tue, May 29, 2012 at 7:17 AM, Eli Barzilay e...@barzilay.org wrote:
** More about the change (especially if you want to try to improve
things):
This is not real ranking, but it should give better results overall.
The thing is that the search assigns a small integer score for each
term,
Just now, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:17 AM, Eli Barzilay e...@barzilay.org wrote:
** More about the change (especially if you want to try to improve
things):
This is not real ranking, but it should give better results overall.
The thing is that the search
Eli Barzilay wrote at 05/29/2012 07:17 AM:
I have made a possibly useful improvement to the JS search code.
It's not pushed, yet, but I dropped the revised JS code on the
pre-built pages so you can try it out here:
http://pre.racket-lang.org/docs/html/search/
[...]
Eli, looks like a
A few minutes ago, Neil Van Dyke wrote:
Eli Barzilay wrote at 05/29/2012 07:17 AM:
I have made a possibly useful improvement to the JS search code.
It's not pushed, yet, but I dropped the revised JS code on the
pre-built pages so you can try it out here:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
That can currently get to ~20k things to sort and adjust for
additional entries that get added on each release, planet packages,
etc.
Have you measured how long this takes? On my machine, the `sort()`
method on an array of
20 minutes ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
That can currently get to ~20k things to sort and adjust for
additional entries that get added on each release, planet
packages, etc.
Have you measured how long this takes?
On Tue, May 29, 2012 at 8:16 AM, Eli Barzilay e...@barzilay.org wrote:
20 minutes ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
That can currently get to ~20k things to sort and adjust for
additional entries that get added on each
2012/5/29 Eli Barzilay e...@barzilay.org:
I have made a possibly useful improvement to the JS search code.
It's not pushed, yet, but I dropped the revised JS code on the
pre-built pages so you can try it out here:
http://pre.racket-lang.org/docs/html/search/
and compare searches with the
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
Just now, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:17 AM, Eli Barzilay e...@barzilay.org wrote:
** More about the change (especially if you want to try to improve
things):
This is not real ranking, but
An hour and a half ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 8:16 AM, Eli Barzilay e...@barzilay.org wrote:
20 minutes ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
That can currently get to ~20k things to sort and
The search still doesn't find words in function descriptions. For
example, http://pre.racket-lang.org/docs/html/search/index.html?q=sine
returns no results. This is especially frustrating since the very
first exercise in HTDP 1e is to use the search to find out whether
DrRacket has a sine
Just now, Justin Zamora wrote:
The search still doesn't find words in function descriptions.
[It's not a full-text search, and as long as it's required to run on
client machines (needed to run on your local copy), it's unlikely to
become a full-text search.]
--
((lambda (x) (x x))
On May 29, 2012, at 10:18 AM, Justin Zamora wrote:
This is especially frustrating since the very first exercise in HTDP 1e is
to use the search to find out whether DrRacket has a sine function.
(It is okay for students to guess that sometimes they may have to search for a
slightly
20 minutes ago, Eli Barzilay wrote:
An hour and a half ago, Sam Tobin-Hochstadt wrote:
To stop the sort in the middle, use a custom comparison function,
a bit of state, and an exception.
This might work.
I was confused. It does work, but it's not enough to be able to throw
an
On May 29, 2012, at 10:25 AM, Eli Barzilay wrote:
20 minutes ago, Eli Barzilay wrote:
An hour and a half ago, Sam Tobin-Hochstadt wrote:
To stop the sort in the middle, use a custom comparison function,
a bit of state, and an exception.
This might work.
I was confused. It does work,
Just now, Matthias Felleisen wrote:
On May 29, 2012, at 10:25 AM, Eli Barzilay wrote:
20 minutes ago, Eli Barzilay wrote:
An hour and a half ago, Sam Tobin-Hochstadt wrote:
To stop the sort in the middle, use a custom comparison function,
a bit of state, and an exception.
This
On Tue, May 29, 2012 at 10:25 AM, Eli Barzilay e...@barzilay.org wrote:
20 minutes ago, Eli Barzilay wrote:
An hour and a half ago, Sam Tobin-Hochstadt wrote:
To stop the sort in the middle, use a custom comparison function,
a bit of state, and an exception.
This might work.
I was
Four hours ago, Eli Barzilay wrote:
A few minutes ago, Neil Van Dyke wrote:
Eli Barzilay wrote at 05/29/2012 07:17 AM:
I have made a possibly useful improvement to the JS search code.
It's not pushed, yet, but I dropped the revised JS code on the
pre-built pages so you can try it out
Three hours ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
Just now, Sam Tobin-Hochstadt wrote:
I think you probably want to rank/divide '1' here based on how
much of the identifier is matched by the search. For example, if
you
On Tue, May 29, 2012 at 11:53 AM, Eli Barzilay e...@barzilay.org wrote:
Three hours ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
Just now, Sam Tobin-Hochstadt wrote:
I think you probably want to rank/divide '1' here based on how
On May 29, 2012, at 11:53 AM, Eli Barzilay wrote:
Three hours ago, Sam Tobin-Hochstadt wrote:
On Tue, May 29, 2012 at 7:33 AM, Eli Barzilay e...@barzilay.org wrote:
Just now, Sam Tobin-Hochstadt wrote:
I think you probably want to rank/divide '1' here based on how
much of the identifier is
I just noticed something about the way I use search.
Just now, I wanted to find the reference docs that describe threads. So
I typed thread into the search box and got documentation about the
(thread ...) form, in both the old and new search pages.
But the reference describes Threads, not
23 matches
Mail list logo
