| 00:09.19 | *** join/#uphpu mrkrow (n=chad@c-76-27-25-249.hsd1.ut.comcast.net) |
| 00:09.19 | *** mode/#UPHPU [+v mrkrow] by ChanServ |
| 06:25.46 | *** join/#uphpu mrkrow (n=chad@c-76-27-25-249.hsd1.ut.comcast.net) |
| 06:25.46 | *** mode/#UPHPU [+v mrkrow] by ChanServ |
| 10:09.59 | *** join/#uphpu mrkrow (n=chad@c-76-27-25-249.hsd1.ut.comcast.net) |
| 10:09.59 | *** mode/#UPHPU [+v mrkrow] by ChanServ |
| 14:06.44 | *** join/#uphpu nvrpunk (n=Tim@81.90.21.233) |
| 14:07.06 | nvrpunk | I am trying to make a function that will search through a rate table for calls, where the user inputs the whole number they intend to call and where it matches the longest match of their input and displays the rate of that row. What would be the easiest way to go about this? |
| 15:28.10 | *** join/#uphpu Tim__ (n=Tim@81.90.21.233) |
| 15:49.15 | herlo | a regular expression |
| 16:55.25 | *** join/#uphpu nvrpunk (n=Tim@80.78.22.153) |
| 17:18.31 | *** join/#uphpu nvrpunk (n=Tim@81.90.21.233) |
| 17:53.15 | *** join/#uphpu romanovic (n=romanovi@c-67-186-209-120.hsd1.ut.comcast.net) |
| 18:06.58 | *** join/#uphpu josephscott (n=josephsc@75-169-252-142.slkc.qwest.net) |
| 18:06.58 | *** mode/#UPHPU [+v josephscott] by ChanServ |
| 19:32.11 | *** join/#uphpu redroy (n=kenner@c-67-172-255-37.hsd1.ut.comcast.net) |
| 20:02.29 | *** join/#uphpu Tim__ (n=Tim@81.90.21.232) |
| 21:58.44 | *** join/#uphpu redroy (n=kenner@c-67-172-255-37.hsd1.ut.comcast.net) |