« first day (193 days earlier)      last day (5068 days later) » 

15:15
@karthick87 only if the machine has a web-server installed
How to play a webm video file? http://bit.ly/fTY2Ya #mimetype
@karthick87 you can quickly start a web server on the machine by logging in via SSH and running something like this:
cd /home/username/bla
python -m SimpleHTTPServer
it will serve on port 8000 by default I think
so, then you'd type wget http://172.29.34.15:8000/file_in_bla.txt
keep in mind that your root directory ("/" in the URL) is the current working directory (cd ...)
0
Q: How to download a file using wget?

karthick87I have more than 100 systems running ubuntu. I have a configuration file in one of these systems say 172...10. Can i get that configuration file from the other sytem say 172...100 using wget? I have installed wget? And i have tried the following wget http://172.*.*.10/name.conf but i am not able ...

answered (:
Thankyou @StefanoPalazzo :)
15:27
no problem :)
Why there is no xorg.conf file in ubuntu 10.10 ?
I think this should be or most-viewed question
12
Q: Where is the X.org config file? How do I configure X there?

IvanAs Ubuntu 10.10 seems to neither detect my graphics card (Intel 82852/855GM) automatically nor use corresponding Intel driver even after manually installing it, I am looking forward to manually configure X (shouldn't I?) Where an I find configuration files I need to edit?

I'm going to be disappointed if come release our top unity questions don't smash those view numbers. :)
Yeah thankyou @StefanoPalazzo i got it :)
Oli
Oli
16:22
@Alaukik So where did this 8% number come from?
Oli
Oli
16:58
@Alaukik Disqus is getting on my nerves. The numbers thrown around by Caitlyn Martin are fairly disparate in that they're a complete munge of silly sales estimates and feelings about how well Linux should be doing.
@Oli oooh, link!
:800997 but you have got nothing else except estimation of gnu/linux usage on the desktop,do you?
Oli
Oli
For everybody else, this is a continuation of a discussion under this thread about the real market share of Linux. I'm arguing for ~1% being roughly correct, @Alaukik higher
@Alaukik Extrapolation and pure guesses are wildly different. Her end number is so contorted by layering statistical flaws on top of each other, there's no value in it at all. At least with a single source, with no reasonable, foreseeable demographic bias (ie, the Wikimedia log parsings), you know roughly how many people are using what.
ah
everyone arguing on who has the least wrong number again, heh
Oli
Oli
@JorgeCastro That's the aim of the game
The only reason I got involved in this this time is I saw somebody mention 1% and somebody else accusing them of malicious (as inferred it) misinformation.
I'm not saying I like the 1% figure, just that everything else seems to spawn from fervid fairy tales about possible sales and not what people are actually using.
17:09
@Oli i did not accuse jarek of spreading misinformation with a malicious intent
misinformation can be unintentional
Oli
Oli
@Alaukik That's true enough. I latched onto it because I really hate the two links you posted as a reason why his was misinformation.
@Oli from wikipedia there are 2 billion internet users and from here (fedoraproject.org/wiki/Statistics#Total_repository_connections) there are 29 million fedora users . lets say 4 million users dual-boot (with any other gnu/linux disto) ubuntu (being a more end-user oriented distro and popular) must have most users than fedora lets say 26 million and then lets say 1 million users dual-boot so there are 50 million users of fedora and ubuntu so 25% of internet users use gnu/linux
lets say 25%of comp users use internet
still more 5% use gnu.linux
@Alaukik this 29 million figure does not indicate nearly as many fedora users
it even states "Currently, there is no reliable way to determine the total number of Linux users, or even count the total number of users of any Linux distribution which does not have a mandatory per user registration process." → selective reading ftw! :þ
↑ nobody has this file except me :)
Oli
Oli
17:21
@Alaukik Where did 29 million come from?
@Oli fedora reports 29,746,257 unique IP addresses connecting to their repositories since fedora 7
Oli
Oli
Oh I see it. 29 million unique IPs over the course of many years connecting to the repo.
I get about five different IPs per week. I know that's not the same for everybody but it's not uncommon for people to go more than a few a month. Repo-based stats are about as useful as sales stats because there are so many issues on both side of them. Reading that Fedora page would have told you that.
what's it called when you have a block of IP's like XX.*.*.*, class B isn't it?
Oli
Oli
That's a B... That's a very big block though, only the biggest ISPs tend to get them that large
.. Not that anybody gets allocated blocks of fresh IPs anymore...
/8 is what I meant
But that's not what my ISP has, still my IP changes every day and all of the leftmost six bytes of it
Oli
Oli
17:27
Perhaps that's class A...
But yeah, even if the average rate was 1 IP per user per week, you need to divide that number by 260. You could then argue that some people NAT that IP through multiple machines. We've only been munging the numbers for a minute and they're already completely unusable.
What ever it's called, it's still a 1:178 chance that I get the same IP on two days in the same year (:
(if they were only changing the last four bytes)
Oli
Oli
Oh I see, you just rotate around a 256-address pool?
That's weird.
No, it's random
it appears random I mean
I might have 80.131 one day, and 72.231 the next day, and a smaller one the day after
Oli
Oli
I just mean that most ISPs I've observed tend to just allocate IPs based on all their IP blocks. Sounds like your ISP is geographically managing it.
@Oli for some reason I thought that changing IP addresses every 24h was normal everywhere, not just here
for cheap internet access anyway
@Oli that's an interesting point, those GeoIP databases always spit out false results for me
as in ~150 kilometres off
Whereas for other IP addresses I, let's say, know, they work with city-level accuracy
17:36
For a normal user of AU, is there a way to see what close votes are active? (For that matter, is this different than 10K users and mods?)
Oli
Oli
@StefanoPalazzo Similar experiences here although it's intermittent. Some days will be good and others they'll assume I'm in London
@StefanoPalazzo That's a class A or /8 address space.
Oli
Oli
@jgbelacqua You mean questions that have outstanding close votes?
@oli Yessir
17:37
Aha, I get a 404.
OK, but does it give you a notification in the header or whatever?
(Not really a 404, just page not found.)
Oli
Oli
@jgbelacqua Not for close votes, only flags.
OK. Thanks.
Oli
Oli
And edits that need approving
Why'd you ask? Has something slipped through?
No, just curious. What's the expiration on close votes? 4 days?
I just voted to close as "too localized" : askubuntu.com/questions/29331/…
hey I missed you getting 3k
nice work!
17:40
thanks!
close 'em :D
Unfortunately, things have gotten busy at work just as its gotten busier here.... But we do what we can do with the Important Work of AskUbuntu Watching.
So, it seems like a reasonable strategy to advertise close votes in chat....
yeah sure
just, only once, so that people don't have to tell you they disagree, that'd be rude :P
Damn. I've gone to 11.04 on my desktop, and my firefox spelling dictionary has gone wonky. Or disappeared. Every single word is underlined in red.
@StefanoPalazzo I figured that -- I tend to assume (at this point anyway) that I may be wrong/off-base, so I'm good with that.
@jgbelacqua the dafault position on close-votes is aways "don't care", that's part of why they work so well
17:47
AU has the best moderators. You guys run a tight ship. (Along with our high-rep users, as well.)
We've had a question this morning, 'asking' "just testing how long it takes until this gets closed"
that was slightly annoying
Yeah, for some reason I saw that and flagged it, as well.
(I believe that was the one I flagged as spam.)
Not really spam, just annoying.
oh right, you put a nice comment on it as well
hah really?
is the question still around?
alloo @jorge.
↑ most secret ;-)
hah
awesome
Kind of like coming into chat and testing the "forbidden words" detector.
right :-)
My first thought was: translation: "just testing if you guys really have nothing better to do"
17:55
heh
someone from Wikipedia told me that this kind of think is a big deal in the WP community
as in, everybody thinks they're the only one 'just testing', and hundreds of wp people have to clean up after them
Can you tell this gets on my nerves :D hehe
hmm, I'm only an occasional editor there, but I see lots of just adding random cursing, epithets, etc.
Some of it seems to be auto-reverted, so maybe that person tried/tested it there ....
really?
That's cool, I've never thought to test it (:
Ha. See what I've done.
If you go to one of the history links, you'll see that sometimes.
(Page history, that is.)
904
A: What is the best comment in source code you have ever encountered?

Tom Ritter //Code sanitized to protect the foolish. using System; using System.Collections.Generic; using System.Text; using System.Reflection; using System.Web.UI; namespace Mobile.Web.Control { /// <summary> /// Class used to work around Richard being a fucking idiot /// </summary&g...

this is pretty funny (:
18:01
Don't know exactly how this works though : en.wikipedia.org/wiki/User:ClueBot_NG
@StefanoPalazzo Terrible but awesome and hilarious.
I like the delicate mixture of emotion and maths (:
Fixing my link Wikipedia ClueBot_NG .
Just an example of some apparent semi-automation.
I never understood why people used hopelessly long variable names until I started using an IDE that did autocompletion.
whoops ... gotta run. see you all/
What could I use instead of the GNOME panel applet "Character Palette" in unity http://bit.ly/gvXEb3 #unity
18:19
0
A: How do I wget a file from any machine on the network?

Stefano Palazzowget will only be able to download anything if there is an HTTP server running at the other end. As you may be able to run commands via ssh in bulk, this might help: # on the client machine: cd /home/username/Pictures/ python -m SimpleHTTPServer This starts a web-server on the machine it's ru...

what happened there :D
lesson learned, don't post the first answer, post the best one.
19:01
@StefanoPalazzo do you have special retag powers?
@fluteflute huh?
I seem to remember hearing that moderators had some bulk retagging powers
I may be wrong...
It's just I don't fancy bumping 411 questions to implement this
Well, we can create synonyms
Will that help in this case?
@fluteflute no, synonyms (and merging tags, but that doesn't happen unless there's something seriously wrong) only works on the whole set of question tagged with it, we can't "bulk-retag"
19:06
Ah that's a shame
(the installation this is a good catch by the way, that's sure been confusing people)
What does merging tags entail? Merging sounds like a synonym for synonym ;)
I'm not quite happy with the solution though, because it leaves a gap for software that doesn't fall under the word "applications"
@fluteflute merging tags is the "no really, I mean it" version of synonyms, it's one of the very few things that aren't revertible , so no one ever does it :-)
Oh okay :) wonder why it exists then
maybe we'll soon need something like wikipedia, AskProjectInstallTag
you've earned the What's The Best Linux Distribution barn star
:P
19:11
Haha
this re-tagging thing is really annoying, but there just isn't a good way to re-tag things, unless it's just a straightforward re-name
I'm proud of my one wikipedia barnstar ;)
tagging is a nuisance
I don't think people really mind if you bump 30 question to the front page every once in a while, but 411 is a big ask
I wish it was a bit more like wikipedia, with categories that can be a category of each other
Hmmm I'm not really sure why tag editing causes a bump
It would be particularly cool if you could mark an edit as not causing a bump
yeah, that's been discussed on MSO for years now
doesn't seem to be coming any time soon
19:14
like wikipedia where you can mark an edit as "minor"
gosh it's all coming back to wikipedia today...
I guess (and I mean guess, I haven't read up on it) the SE people think that tagging is supposed to be fuzzy, and that it's worse for the community to be nit-picky
there are bigger issues to nit-pick over I suppose
@Stefano: Hello.
hey @GeorgeEdison
@StefanoPalazzo How's it going?
19:25
pretty good, I've been working on this server thing
@GeorgeEdison have you already done some work on live-updating the data?
@StefanoPalazzo Not yet.
I'm still trying to figure out how to improve performance.
heh, I've been pushing that to the back of the queue, since I'm not sure how to go about it
Does the C API work alright?
@GeorgeEdison I haven't used it much, I've written my own thing to see how it works, and now it's grown tentacles and it lives (:
@StefanoPalazzo Meaning...
19:28
hang on I'll show you
I really want to get the performance improved, so I'm looking for suggestions on how to go about that.
to run it, put it in the same directory as posts.xml, cd into that directory and run "python3 script.py"
then open up localhost:8080/…
@GeorgeEdison the code is full of docstrings explaining why it's so fast, but it best explain it, since I might have written some nonsense here and there :-)
Oh, okay.
so lets see, first I build an index
I "lex" the tilte of the question, meaning I split it into words, taking care of punctuation and case (so, "Ubuntu One on Windows?" turns into "ubuntu one on windows ?" turns into [ubuntu, one, windows]),
then I put every one of those words in a hash-table, with the question ID as the value
then I do the same for every pair of words in the question, that's ['ubuntu one', 'one on', 'on windows']
19:38
the keys of the index hash table are sets, and adding a word to it means doing doing a union of the value-set and a set containing the new value
4 mins ago, by Stefano Palazzo
I "lex" the tilte of the question, meaning I split it into words, taking care of punctuation and case (so, "Ubuntu One on Windows?" turns into "ubuntu one on windows ?" turns into [ubuntu, one, windows]),
Was the omission of 'to' intentional?
So which words are you omitting?
also, there is a space before the question mark in the second step
How would a question with a hyphen get dealt with?
19:40
@GeorgeEdison sorry, no :-( I forgot I changed it, it now only cuts out words with length of one, not two
Ah, so it's done on word length - not a blacklist.
@GeorgeEdison for every character that is not in the alphabet + space + numbers, I replace that character with itself enclosed in spaces (there might be a better way, like shlex, but I'm obsessed with O(1) performance :-)
So 'test-item' would become ['test', '-', 'item'] ?
no, it would become ["test", "item", "test item"]
for i in s:
    if i.lower() not in "abcdefghijklmnopqrstuvwxyz ":
        s = s.replace(i, " {} ".format(i))
result = tuple(i for i in ''.join(i for i in s.lower()
    if i in "abcdefghijklmnopqrstuvwxyz ").split()
    if len(i) > 1 or any(j in "01234567890" for j in i))
n = list(i for i in result if len(i) > 2 or
    any(j in "0123456789" for j in i))
result += tuple(' '.join(n[i:i + 2]) for i in range(len(n) - 1))
return result
↑ this is the lexing algorithm
the penultimate line adds word pairs
I'll cut out a piece of the index so I can show you how it looks, just a sec
Ah, okay.
19:46
  'anchor': {4942},
  'anchor icon': {4942},
  'ancient': {1943},
  'ancient african': {1943},
  'and': { 93,
           96,
           116,
           209,
           219,
           247,
{..} denotes a set
now, the set is stored similarly to a hash table, i.e. the memory location of the value set is (something like) the hash of the key, so, at the moment, looking things up in the index is a constant time operation
that is, both the index and the values of every key in the index have O(1) membership lookup
Wait... so it does all of this with the question titles at startup?
Now I grab some tags, 100 of them (to be tweaked), and store them in a set called IMPORTANT_WORDS
like this:
IMPORTANT_WORDS |= set(i[0] for i in important_words.most_common(100))
@GeorgeEdison right, that whole spiel takes about 10 seconds per 100 megabyte of posts.xml (au's is 30 megs I think)
@StefanoPalazzo Ooooooh.
I thought it was doing that for each search.
Now I see why you're getting good performance.
It didn't make sense to me for a while there.
Finally got to try it out, but...
> "ImportError: cannot import name lru_cache"
19:52
by the way, the |= operator is equvalent to S = S ∪ T
@GeorgeEdison what version of python are you using?
@StefanoPalazzo That's an interesting operator.
@StefanoPalazzo python3 yourscript.py
Oh, 3.1.2.
you need to have python 3.2
Ah, okay.
I could write my own LRU cache, but the one in python 3.2 is about 5% faster ;-)
[Updatesto Python 3.2]
19:54
so, now we have the index and important_words, one is a hash-table (defaultdict) and one's a set. That's the whole initialisation process, now we get on to the meaty part
Oh, the actual search itself.
this is how I search
result = Counter()
for i in lex(query):
    result.update(self.index[i])
there's more obviously ;-)
a Counter is just like a dict, only more concise to write
results.update(iterable) means

for every item in iterable, increment the counters value of the key 'item' by one
since looking up self.index[i] is a constant time operation, this is still O(1) (though for every word, let's say we're at O(k) where k is very small)
and this is the second part of search()
return {'questions': list({'question_id': i[0],
        'title': self.title[i[0]]} for i in
        sorted(result.most_common(maxsize),
        key=lambda x: lcs_len(self.title[x[0]], query)))[::-1]}
Okay... I got it working now.
Wow... performance is impressive.
Somehow I can't access the source code of Counter() on the python servers at the moment, but I'm pretty sure it's about O(n), and our n is onyl as large as maxize, which defaults to ten
this is actually the slowest part of the whole thing (asymptotically...)
when we have all of the maxsize most common items, we go about sorting them, using a score
now, the method is called lcs_len, but that's wrong (I didn't think to change it, I was doing longest common subsequence before)
Forgive me, but I'm not up on some of the math :)
I understand linear execution time, exponential execution time... that's about it :)
But I'll take your word for it. O(n) is linear, right?
Or is that O(1)...
20:05
O(1) means every operation, what ever the input, takes the same amount of time
Oh, okay.
O(n) means the time is asymptotically proportional to the size of the input
So for O(n), increasing the input exponentially increases the execution time?
this is quite cool, the first part of calculating the score of the search results:
((len(s_ & t_) * 8) - (len(s_ ^ t_)))
@GeorgeEdison yeah, if you have 10 items, it takes 10 seconds, if you have 100 items it takes 100 seconds
this is some strange notation again, I know..
the & means: "every item that appears in both s prime and t prime"
and we take the length of the resulting set
the ^ means: every item that appears in either s prime or t prime, but not both
those two absolute values (lengths) we subtract, that's our score for now
And the score is used for...?
20:11
if any of the items in the first string appears exactly in the second string, we add 5 to the score (note not five for every item, just once)
the score is used to sort the 10 items we got by looking up things in the index
(or however many you request from the server)
@GeorgeEdison Hey @GeorgeEdison
@Jacob: Hey!
@StefanoPalazzo: This is @Jacob.
He's the awesome guy hosting my FHC script.
@GeorgeEdison hey if you have it running, and if you have plenty of RAM left, try replacing the PORT constant's value with a list of ports and see what happens
...and I talked to him about this project.
@Jacob hello :-)
20:12
@StefanoPalazzo I already had to replace the port since JetHTTP was using 8080 :P
@GeorgeEdison Thats a bit much credit... I only have space to spare :)
Well, I appreciate it regardless.
@StefanoPalazzo Hello, I assume your writing the "lense"
if you give it a list, it'll create a bunch of servers and a load balancer for them :)
that's so it's faster on machines with lots of CPUs
I think you showed me something like that the other day.
20:14
@StefanoPalazzo atleast I think it was you I saw in the article?
@Jacob yeah
@GeorgeEdison I don't think I've left anything out, that's all there is to it!
ignore the server, it's only there because there's no version of cherrypy compatible with python 3.2 in the ubuntu repositories
@StefanoPalazzo Load balancer, sounds like my "profession"
Is Python 3.2 even in the repositories? I only got it installed since I was using the Blender 2.5 PPA.
@GeorgeEdison right, it's just for fun (they show up in different colours on the console), but I used it to see what the thing behaves like under heavy load
@StefanoPalazzo Lol! I just noticed the colors!
20:17
@GeorgeEdison I'm sure it is in 11.04, not sure about 10.10, but it's very easy to compile
In case I ever get my hands on real iron to run it on ;-)
@GeorgeEdison paste.ubuntu.com/592319 this is a little test front-end
It'd be cool if you could make it work with your server (i.e. make the server accept the same type of URI), so we can compare them, maybe swap out parts
@GeorgeEdison How's the DB app coming?
I'll have to change the port again... :)
@Jacob Good.
I'm making a few tweaks.
Any insite an admin can provide?
@Jacob yeah, actually
@StefanoPalazzo Ok,glade to help!
20:22
@Jacob say my server responds to an http request in 4 milliseconds on the local host (and that's on my laptop, so maybe 2 milliseconds on a proper server), how much longer will it take once it's on the public internet?
@StefanoPalazzo Well there are so many factors at play.
Assuming it's not getting hit thousands of times a minute of course :)
Anywhere from 20ms best to 500ms under horrible conditions?
SCORE. UNITY CONVERT!!
Pinging googles DNS server takes about 30 milliseconds for me, can I expect something like that in the real world?
nice @James :)
@StefanoPalazzo Well, Google uses something called anycast so all there DNS servers around the world use 8.8.8.8 so you always get the closest one
@StefanoPalazzo This is coming from a guy who absolutely HATED the 10.10 Mutter based Unity. :)
@StefanoPalazzo If you want to expect something like that, it'll take a huge budget
20:27
@StefanoPalazzo what are you working on now?
I roughly estimated my budget at around zero, plus or minus, uhm, zero
In reality, the best guestimate is 20-500ms on about 10 different factors
;-)
@Jacob That's awesome thought, the public stackexchange API responds in 700-1200 milliseconds
@StefanoPalazzo I mean, its only a guestimate, it could be anywhere
@ajmitch a server that provides parts of the stack exchange API, plus a search engine (scroll up for source code ;-))
@Jacob thanks a lot, very good to know (I just assumed it'd be around 60ms)
20:30
doesn't sounds like something that'd necessarily be fast with a bit of data
how fast it responds would depend entirely on how you wrote it & the infrastructure behind it
@ajmitch that too
picking a time out of thin air isn't going to work unless you detailed just what would happen for each http request & the time it'd take for each step
@ajmitch notice I gave a range, but under most circumstances 500-700 is a upper range
@Jacob I noticed that, but it's still a fairly arbitrary number :)
@ajmitch I know exactly what happens on the server side of things, and the client side
just the bit in between is rather uncertain
:-)
20:35
@StefanoPalazzo In all honesty,the only way to know is to test :)
@StefanoPalazzo great, then you're in a good position to work out & profile how fast it'd be :)
@ajmitch you can't really work out net latency, you can only hope
& also how it'd scale in searching across 10k+ questions, etc
@ajmitch At the moment, it looks like there isn't going to be a server to run it on
^--- Good description there.
20:36
@StefanoPalazzo @GeorgeEdison forgot to mention it didn't he....
@ajmitch well now that's the awesome part, it doesn't matter whether you search 10 question, 10,000 or 10 million, it's equally fast
I thought I did...
@Stefano: Your GUI for testing the Python server works alright... but isn't it supposed to display the answers in the big box?
Right, sure I know
I just get numbers at the bottom.
@StefanoPalazzo forgive me for being skeptical, but I doubt that it'd run in constant time on a single machine
20:37
What are the details of that?
@ajmitch I couldn't test it on the Stack Overflow data, for lack of memory, but it's just as fast on the superuser database, which is about 78k questions I think (compared to our 10k)
in the last data dump that is
@GeorgeEdison Well you didn't :P
27 mins ago, by George Edison
...and I talked to him about this project.
^---- Sort of...
@ajmitch If performance was anywhere near quadratic, I guess I'd notice
@StefanoPalazzo equally fast implies O(1), I'd think
@ajmitch that's what I'm boldly claiming :-)
20:41
you'd run into other limitations such as the memory required to hold data
So anyway, @Jacob has offered to host the app.
Last I remember, we were targeting Windows.
@GeorgeEdison oh that sounds sweet
@Jacob I made sure my only dependency is Python >= 3.2, so windows shouldn't be a problem,
maybe morally ;-)
@StefanoPalazzo Don't worry, I have linux boxes too :)
I thought we were running my app....?
:)
@ajmitch yeah I'm only talking about speed, not memory. Unfortunately, I can't profile memory usage to save my life, but it's somewhere around linear, maybe n^(1/something)
@GeorgeEdison see that's what I didn't understand :-)
20:45
Maybe we can run both on seperate ports.
(That can be your load balancing.)
@ajmitch and in terms of numbers, indexing the SuperUser database takes 600 megs of memory; and then I can use however much I want for the cache, if there's any left :)
@GeorgeEdison As long as the server is up and reliable, I'm not going to insist on running this python stuff I hacked together in a day :-)
@StefanoPalazzo I was joking... I really like your implementation.
But I would be a bit disappointed if we didn't run mine too.
Even if we only created a Python script that uses the lib I wrote.
@GeorgeEdison solution: let's make sure they provide the same API
So I should convert mine into a HTTP server then?
And respond to /similar ?
The only problem is, I can't really help you since I'm useless at C++, and I've never even looked at Qt
but, since we're both having fun, why not do two?
20:51
Sure!
...and I've only ever written one thing in Python, so I have lots to learn there.
(That would be StackApplet of course.)
@GeorgeEdison that's not set in stone, I'm open to any changes regarding the external API
I've at least got unity running now on an actual desktop, so I can get the lp lens working & not want to stab my laptop :)
@ajmitch did you already start work on that?
@GeorgeEdison we should come up with a suite of test-cases and make sure they both return the same results, to some degree
Good idea... mine doesn't sort the output though.
like, maybe assert that a particular query return a particular question at least in the top X results
20:55
@StefanoPalazzo Well I can load balance your DB, but I only have servers in 1 location
^just came to mind
I'll give you my test cases no idea if they're very good or not, but they've been used in Jorge's videos so it's important they work :PPP
@StefanoPalazzo yes I did, I haven't created a project on LP yet
nice @ajmitch, did you use David Callé's lens as a base?
no, where is that?
Before that get's too complicated, someone should turn it into an 'example lens'
20:57
I may take a look at that, thanks
did launchpad.net/unity-place-sample help you at all?
though it's in vala, the general layout looks useful
@Stefano: Feel free to stick your stuff in my project (launchpad.net/audataserver).
I can add you to the project if necessary.
@GeorgeEdison this is the most important, if you get it right, all else should fall into place. it incorporates a few common problems with search algorithms: paste.ubuntu.com/592326

« first day (193 days earlier)      last day (5068 days later) »