Tags: | text, algorithms |
Authors: | Slava Pestov |
Word | Stack effect |
![]() | ( n i str -- n ) |
![]() | ( str -- str ? ) |
![]() | ( str -- str ) |
![]() | ( str -- str ) |
![]() | ( str -- str ? ) |
![]() | ( str -- newstr ) |
![]() | ( n seq -- ? ) |
![]() | ( str -- n ) |
![]() | ( i str -- ? ) |
![]() | ( str -- ? ) |
![]() | ( i str -- ? ) |
![]() | ( str possibilities -- ? ) |
![]() | ( str -- newstr ) |
![]() | ( str oldsuffix newsuffix -- str ) |
![]() | ( str -- newstr ) |
![]() | ( str -- ? ) |
![]() | ( i str -- i str ) |
![]() | ( i str -- i str ) |
![]() | ( str -- newstr ) |
![]() | ( str -- ? ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
![]() | ( str -- newstr ) |
Vocabulary | Summary |
![]() |