OK, thanks Benedikt.
I've attached the PNG files and the source SVG.
I've made 4 versions to see what kind of style is the most appreciate...
Hoping you will appreciate one of them... ;-)
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 17:39, Benedikt Ritter a écrit :
> Hello Loic,
>
No, it's close to but not the same.
I don't known what font is used in the new ASF logo.
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 17:36, Emmanuel Bourg a écrit :
> Le 28/01/2016 14:12, Loic Guibert a écrit :
>> I just do a quick shot.
>> I use DejaVu fonts. It
Yes, good idea.
Are you creating it ?
I'll be able to push the PNG format of my first shot ;-)
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 17:02, Benedikt Ritter a écrit :
> Hi Loic,
>
> very good! Would probably be best to create a ticket for the COMMONSSITE
> project in j
Thanks Benedikt,
I didn't know that page !!
So; it seems to be OK to use that font for the logo...
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 17:17, Benedikt Ritter a écrit :
> Hello Loic,
>
>
> 2016-01-28 14:12 GMT+01:00 Loic Guibert :
>
>> I just do a quick shot.
&
Ah,
I sent 2 files, the PNG and the SVG format but only the SVG is shown in
the mail I received from the mail list...
I try again...
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 17:12, Loic Guibert a écrit :
> I just do a quick shot.
> I use DejaVu fonts. It's a free derivative work o
e
http://dejavu-fonts.org/wiki/License
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 16:13, Loic Guibert a écrit :
> Hi,
> I can try and make propositions.
> I'll get the logo sources...
>
> Loic Guibert
> PGP : 0x65EB4F33
>
> Le 28/01/2016 16:01, Benedikt Ritter a éc
Hi,
I can try and make propositions.
I'll get the logo sources...
Loic Guibert
PGP : 0x65EB4F33
Le 28/01/2016 16:01, Benedikt Ritter a écrit :
> Hi all,
>
> we're still using the "old" Feather logo throughout our websites. Is
> anybody capable of creating a lo
I'm currently pretty busy at work, i don't have much time to work on
Commons-Lang too.
Sorry.
Regards,
Loic Guibert
PGP : 0x65EB4F33
Le 18/01/2016 15:52, Benedikt Ritter a écrit :
> Hi,
>
> 2016-01-16 6:41 GMT+01:00 Loic Guibert :
>
>> Hi, great !
>>
>> T
e.org/jira/browse/LANG-1124
Regards,
Loic Guibert
PGP : 0x65EB4F33
Le 16/01/2016 04:21, Gary Gregory a écrit :
> Shall we have a go at releasing 3.5? There is quite a change set to push
> out :-)
>
> Gary
>
-
To
StringUtils.equalsAnyIgnoreCase(FOO, new
CustomCharSequence("fOo")));
assertTrue(StringUtils.equalsAnyIgnoreCase(FOO, new
StringBuilder("fOo")));
If nobody objects or disagree with it, I'll :
- close LANG-704 (duplicate LANG-1169)
- merge PR #109
- add the supplementary t
3ff89
Loic Guibert
PGP : 0x65EB4F33
Le 20/10/2015 17:24, Loic Guibert a écrit :
> Hi Benedikt,
> There are exactly the two options I was considering.
>
> If nobody objects, I'll go on the second way and exclude those methods in
> StringUtilsTest.testStringUtilsCharSequenceContract
g two CharSequence of distinct nature
(like StringBuilder & CharBuffer for exemple)
may be undefined and can cause some problems
(like in CharBuffer where length method return remaining char
and not the total CharSequence length
or charAt(int index) that return the (current position + index)th char).
Loi
f nobody objects, I'll go on and commit the proposed changes.
Loic Guibert
PGP : 0x65EB4F33
Le 28/05/2015 16:42, Loic Guibert a écrit :
> Hello,
> I implemented 2 null safe methods to replace into a String with regular
> expression :
> - String replaceAll(String text, String re
ept a String
I use String parameters instead of CharSequence because in the Java
conception, only String are Comparable and not CharSequence.
I call String#compareTo(String) in the implementation.
So what should I do ?
Loic Guibert
PGP : 0x65EB4F33
Le 05/10/2015 17:19, Loic Guibert a écrit :
&g
bc", *) = 0
* StringUtils.compareIgnoreCase("abc", "ABC", *) = 0
* StringUtils.compareIgnoreCase("a", "b", *) < 0
* StringUtils.compareIgnoreCase("b", "a", *) > 0
*
Hello Benedikt,
LANG version 3.5 being about to be released, have you had time to look
at these 2 methods ?
https://issues.apache.org/jira/browse/LANG-1139
https://github.com/apache/commons-lang/pull/92
Loic Guibert
PGP : 0x65EB4F33
Le 02/06/2015 10:24, Benedikt Ritter a écrit :
> Hello L
Hello Benedikt,
Have you had time to look at these elements and my feedback comments on
github ?
https://github.com/apache/commons-lang/pull/75
Loic Guibert
PGP : 0x65EB4F33
Le 01/05/2015 13:47, Benedikt Ritter a écrit :
> Hey Loic,
>
> thank you for this proposal. I'll have a l
long mask = 1L << 32;// -> mask = 4294967296 (0x1)
I opened a JIRA ticket (LANG-1147) and an associated Pull Request (#97)
https://issues.apache.org/jira/browse/LANG-1147
https://github.com/apache/commons-lang/pull/97
Regards,
st("ABCabc123abc", "[^A-Z0-9]+", "_") =
"ABC_123abc"
* StringUtils.replaceFirst("ABCabc123abc", "[^A-Z0-9]+", "") =
"ABC123abc"
* StringUtils.replaceFirst("Lorem ipsum dolor sit", "( +)([a-z]+)",
&
ed("abcdefg", 2, 0, 1, 0) = ["ab",
"", "c", "",
*
"de", "", "f", "",
* "g",
null, null, null]
* StringUtils.splitByLengthRepeated("abcdefg", -1) =
{@link IllegalArgumentException}
* StringUtils.splitByLengthRepeated("abcdefg", 0, 0)=
{@link IllegalArgumentException}
*
*
* @param str the String to parse, may be null
* @param lengths the string lengths where to cut, may be null,
must not be negative
* @return an array of splitted Strings, {@code null} if null String
input
* @throws IllegalArgumentException
* if one of the lengths is negative or if lengths sum
is less than 1
*/
public static String[] splitByLengthRepeatedly(String str, int ...
lengths);
--
Loic Guibert
PGP : 0x65EB4F33
-
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For additional commands, e-mail: dev-h...@commons.apache.org
plitByLength("abc") = []
* StringHelper.splitByLength("", 2, 4, 1) = [null, null, null]
* StringHelper.splitByLength("abcdefg", 2, 4, 1) = ["ab", "cdef", "g"]
* StringHelper.splitByLength("abcdefghij", 2, 4, 1) = ["ab",
"cdef", "g"]
* StringHelper.splitByLength("abcdef", 2, 4, 1) = ["ab", "cdef", null]
* StringHelper.splitByLength("abcdef ", 2, 4, 1) = ["ab", "cdef", " "]
* StringHelper.splitByLength(" abcdefg", 2, 4, 1) = [" a", "bcde",
"f"]
* StringHelper.splitByLength("abcdefg", 2, 4, 0, 1) = ["ab",
"cdef", null, "g"]
*
* @return String[] or {@code null} if pString == null
*/
public static String[] splitByLength(String pString, int ... pColLengths);
/**
* Return {@link Matcher} from pRegex.matcher(pString)
* @return {@link Matcher} ou null
*/
public static Matcher matcher(CharSequence pString, Pattern pRegex);
/**
* Return {@link Matcher} from
Pattern.compile(pRegex).matcher(pString)
* @return {@link Matcher} ou null
*/
public static Matcher matcher(CharSequence pString, String pRegex);
public static boolean matches(CharSequence pString, Pattern pRegex);
public static boolean matches(CharSequence pString, String pRegex);
I will rename parameters and add final qualifier to respect your coding
practices.
I will translate the JavaDoc and comments in English.
If you are interested, I can add those to StringUtils (and associated
test cases) in my github repository.
It's my first contribution, so how would you like it to be done ?
1- make a JIRA ticket by logical group of methods and related git
pull request
2- make a single detailed JIRA ticket with all methods and a single
git pull request with one commit by logical group of methods
Best regards,
--
Loic Guibert
-
To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org
For additional commands, e-mail: dev-h...@commons.apache.org
21 matches
Mail list logo