summaryrefslogtreecommitdiff
path: root/src/keeper.lua
diff options
context:
space:
mode:
authorBenoit Germain <bnt.germain@gmail.com>2011-01-04 21:31:17 +0100
committerBenoit Germain <bnt.germain@gmail.com>2011-01-04 21:31:17 +0100
commit79e46938c5d8daf164ab2d934f668fa27b32e4cf (patch)
tree407761f25bbdc3d5b2066a705dcbcf8711690242 /src/keeper.lua
parented07b457b6b45ece85d367dc8b89bf3c040abd9a (diff)
downloadlanes-79e46938c5d8daf164ab2d934f668fa27b32e4cf.tar.gz
lanes-79e46938c5d8daf164ab2d934f668fa27b32e4cf.tar.bz2
lanes-79e46938c5d8daf164ab2d934f668fa27b32e4cf.zip
Take all code from Asko Kauppi's SVN server, and push it here so that the github repository becomes the official Lanes source codebase.
Note that Asko's SVN server holds version 2.0.9, whereas this is version 2.0.10, but I don't see any real need to update SVN if it is to become deprecated. Next steps: - upgrade the rockspec to the latest version - make the html help available online somewhere Signed-off-by: Benoit Germain <bnt.germain@gmail.com>
Diffstat (limited to 'src/keeper.lua')
-rw-r--r--src/keeper.lua4
1 files changed, 2 insertions, 2 deletions
diff --git a/src/keeper.lua b/src/keeper.lua
index f76173b..9256a4b 100644
--- a/src/keeper.lua
+++ b/src/keeper.lua
@@ -11,7 +11,7 @@
11--[[ 11--[[
12=============================================================================== 12===============================================================================
13 13
14Copyright (C) 2008 Asko Kauppi <akauppi@gmail.com> 14Copyright (C) 2008-10 Asko Kauppi <akauppi@gmail.com>
15 15
16Permission is hereby granted, free of charge, to any person obtaining a copy 16Permission is hereby granted, free of charge, to any person obtaining a copy
17of this software and associated documentation files (the "Software"), to deal 17of this software and associated documentation files (the "Software"), to deal
@@ -135,7 +135,7 @@ function send( ud, key, ... )
135 local m= limits[key] 135 local m= limits[key]
136 136
137 if m and len+n > m then 137 if m and len+n > m then
138 return false -- would exceed the limit; try again later 138 return false -- would exceed the limit; try again later
139 end 139 end
140 140
141 for i=1,n do 141 for i=1,n do