enlightenment/efl
enlightenment
/
efl
8
7
Fork 14
Code Issues 13 Pull Requests 1 Projects Releases Wiki Activity

Fix typos 

"he->the" where appropriate



SVN revision: 52493
This commit is contained in:
Lucas De Marchi 2010-09-20 17:09:13 +00:00
parent 5ba2cc9c6b
commit 71cba7da35
3 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
legacy/ecore/src/lib/ecore/ecore_thread.c
View File

@ -264,16 +264,15 @@ _ecore_thread_pri_drop(void)
#ifdef __linux__
else
{
tid = syscall(SYS_gettid);
errno = 0;
prio = getpriority(PRIO_PROCESS, tid);
prio = getpriority(PRIO_PROCESS, 0);
if (errno == 0)
{
prio += 5;
if (prio > 19)
prio = 19;
setpriority(PRIO_PROCESS, tid, prio);
setpriority(PRIO_PROCESS, 0, prio);
}
}
#endif

6
legacy/eina/src/lib/eina_list.c
View File

@ -1788,7 +1788,7 @@ eina_list_sorted_merge(Eina_List *left, Eina_List *right, Eina_Compare_Cb func)
* elements it will do a maximum of 20 comparisons. This is much
* faster than the 1,000,000 comparisons made naively walking the list
* from head to tail, so depending on the number of searches and
* insertions, it may be worth to eina_list_sort() the list and do he
* insertions, it may be worth to eina_list_sort() the list and do the
* searches later. As lists do not have O(1) access time, walking to
* the correct node can be costly, consider worst case to be almost
* O(n) pointer dereference (list walk).
@ -1905,7 +1905,7 @@ end:
* faster than the 1,000,000 comparisons made by
* eina_list_search_unsorted_list(), so depending on the number of
* searches and insertions, it may be worth to eina_list_sort() the
* list and do he searches later. As said in
* list and do the searches later. As said in
* eina_list_search_sorted_near_list(), lists do not have O(1) access
* time, so walking to the correct node can be costly, consider worst
* case to be almost O(n) pointer dereference (list walk).
@ -1956,7 +1956,7 @@ eina_list_search_sorted_list(const Eina_List *list,
* faster than the 1,000,000 comparisons made by
* eina_list_search_unsorted(), so depending on the number of
* searches and insertions, it may be worth to eina_list_sort() the
* list and do he searches later. As said in
* list and do the searches later. As said in
* eina_list_search_sorted_near_list(), lists do not have O(1) access
* time, so walking to the correct node can be costly, consider worst
* case to be almost O(n) pointer dereference (list walk).

2
legacy/evas/src/modules/engines/fb/evas_fb.h
View File

@ -50,7 +50,7 @@ int fb_postinit(FB_Mode *mode);
int fb_await_switch(int block);
/* list all current possible video modes listed in /etc/fb.modes */
/* returns pointer to an aray of FB_Mode, and sets num_return to the number */
/* of elements int he returned array */
/* of elements in the returned array */
FB_Mode *fb_list_modes(unsigned int *num_return);
/* sets the fb mode to the resolution width x height and the depth to depth. */
/* and if refresh > 0 attempts to use a mode with a refresh rate (in Hz) of */