200841257 九、發明說明： 【發明所屬之技術領域】 本發明係有種管理綠及其搜尋方法，尤指 法 及其掬尊方法。 【先前技術】 技中華民國專利公報公告第489287號之「商品鎖售系統，商品接收 裝置及商如齡方法」，此篇專彻容料_種商品銷㈣統，經由通訊裝 置接收商品訂單並以_預定方法送該訂貨至—接收人，包含：—錄匙資訊 記錄媒體，其巾表示該接收人有權接收，並有權使用齡該訂貨之 預定箱之触資訊；做為商品儲存裝置之箱，誠儲存該商品；錄匙資訊 t出裝l用以讀出儲存於該鑰匙資訊儲存裝置關於該預定箱錄匙資訊； I目使用者資lej綠置，用以記錄包含該输匙資訊及陳鋪之資訊之箱 使用^資a ’箱開/關控制裝置，用以將該餘匙資訊讀出裝置所讀出關於 該預疋箱之餘匙資訊和儲存於該箱觀者資訊記錄裝置之錄匙資訊比對， 以依照4核對結果控制該預定箱開/關，其中··該商品接收裝置位於包含 車站或公車站之任意公共運輸入口附近。 μ另如中華民國專利公報第249695號之「地圖化航班查詢與訂位方法」， 此4專利内谷係為一種地圖化航班查詢與訂位方法，係應用於一電子裝 置，且該電子裝置包括有一顯示榮幕，其步驟包括：⑷提供一地圖給該電 子裝置而顯示於該顯示螢幕上，該地圖包括有複數個位置點；（Β)提供複數 個航空公司之複數個航線選項給該電子裝置而顯示於該顯示螢幕之地圖 中母一航線皆在該等位置點之二個位置點之間；（C)接收一公司選 擇資訊，其包括一所選擇之航空公司，而將該航空公司之航線顯示於該顯 不螢幕之地圖上；以及(D)接收一航線選擇資訊，其包括一依據顯示於地圖 上之航線而選擇之航線，並提供對應該航線之航班選項，該航班選項係包 括有至少一選單，且該至少一選單係包括有複數個設定條件以供選擇。 200841257 雖上述之習知技術，皆可進行商品或座位預訂之功能，但上述之訂位 系統須-處理器，該些訂位方法僅描述如何於選取航班進行訂位，°如 何進行商品預訂，未實質描述鱗麟及訂位之職方法鶴—介面操控 方法，而且一般訂位系統以編碼建檔需配合資料庫建檔管理，導致搜尋^ 度’且無依順序進行編碼，可能產生重複訂位的問題，故，該習用者係 無法符合使用者於實際使用時之所需。 【發明内容】 =伽之主要目的，在於提供—種預訂管财法及其搜尋方法，利用 邏輯運算，進行物件搜尋及預訂管理，有效降低系統 運异的複雜度’減少系統運算及儲存時職之記憶體空間，增進搜尋速度。 件順ίίΓί要目的’在域供—翻訂#理綠及其搜尋方法，依物 件順序進仃編碼，具有序狀·，不會產生重複訂位之問題。 娜方法，以本 °τ彳及退位’並可讓使用者操控查詢進行訂位。 速搜尋物件财献絲射法，可快 位系統、於各種賴，如交通工具之訂 先依種預訂管理方法’進行預訂時，係 係可為交通工具、餐磨、/^一也編碼，產生一第一編碼序列，該物件 訂該些物件巾至少_^ * _座位、桌位、車位或賴；接著依據欲預 邏輯，，和，，運雜⑯—㊆進仃—進位編碼，產生―第二編碼序列；再利用 並判斷該第：碼相及第二編碼賴，產生—第三編碼序列； 二編碼序列之補數，該第二編碼序列時，即進行預訂；再取該第 編碼序列及該第四編四編碼序列；及_邏輯”和，，運算該第-預訂後之該些物件狀能。1 ’產生i五編碼序列，該第五編碼序列係為 200841257 件之係'種預訂管理方法’進行取消預訂時，係級據複數個物 具、Γ碼’產生—第—編碼相，該些物件係可為交通工 件中至物件立桌位、車位或房間’·接著依據欲取消預訂該些物 運算進位編碼’產生—第二編解列；及邏輯，，或” -第22=尋松係献據複數働狀狀態断二編碼，產生 '#a' ^^ 一第i編辦列二進位編碼，產生 列，產生一第-編床、、、 運开忒第一編碼序列及第二編碼序 即完成搜尋 判斷該第三編碼序列對應於該第二編碼序列， 店、電#座r卜該些物⑽可為賴^、餐廳、叙 碼，產生一第二編據该些物件於一第二區間之狀態進行二進位編 再利用邏輯，，和，，運算該第間係可為-位置範圍及—時間範圍’· 序列，由該第三編碼序^知及二編碼序列，產生—第三編碼 區間係包含該第-區間及三區間内該些物件之狀態，該第三 【實施方式】 之瞭^=3= 賴論職❹財更進一步 所示：本發明係提供預訂流程示意圖。如圖 八餐廳、停車場之配位系統、電影院之訂位系統、訂房系 200841257 統、火車訂位系統或其他系統。 本實施例係以火車之訂位系統為例，請一併參閱第二圖， 之一較佳實施例之車箱座位順序及狀態示意圖。如圖所示：本二: 吕丁官理方法係先執行步驟S10，依據該車箱1〇内複數個 ===預 二進位編碼，產生_第_㈣糊，其中，該二進位編觸200841257 IX. Description of the invention: [Technical field to which the invention pertains] The present invention has a management green and a search method thereof, especially a method and a method thereof. [Prior Art] Technical Republic of China Patent Gazette No. 489287 "Commodity Locking and Selling System, Commodity Receiving Device and Merchants' Ageing Method", this article is dedicated to the receipt of merchandise orders via the communication device. Sending the order to the recipient by the _ predetermined method, including: - the key information recording medium, the towel indicating that the recipient has the right to receive, and has the right to use the touch information of the predetermined box of the order; as the commodity storage device The box stores the goods in good condition; the key information t is used to read and store the information stored in the key information storage device about the predetermined box; the user of the item is set to record the key containing the key Information and Chenpu's information box uses the 'box open/close control device' to read the remaining key information about the pre-box and the information stored in the box information. The key information of the recording device is compared to control the predetermined box on/off according to the result of the 4 check, wherein the product receiving device is located near any public transportation entrance including the station or the bus station. In addition, as shown in the "Landmark Flight Inquiry and Booking Method" of the Republic of China Patent Gazette No. 249695, the 4 patent valley is a map flight inquiry and reservation method applied to an electronic device, and the electronic device Including a display screen, the steps include: (4) providing a map to the electronic device for display on the display screen, the map includes a plurality of location points; (Β) providing a plurality of airlines of a plurality of route options to the The electronic device is displayed on the map of the display screen, and the parent route is between the two points of the location; (C) receiving a company selection information, including a selected airline, and the airline The company's route is displayed on the map of the screen; and (D) receives a route selection information, including a route selected according to the route displayed on the map, and provides a flight option corresponding to the route, the flight option The system includes at least one menu, and the at least one menu includes a plurality of setting conditions for selection. 200841257 Although the above-mentioned conventional technology can perform the function of ordering goods or seats, the above-mentioned reservation system is required to be a processor, and the reservation methods only describe how to make a reservation for selecting a flight, and how to make a product reservation. The method of crane-interface control is not described in detail, and the general reservation system needs to cooperate with the database to manage the file, which leads to the search of 'degree' and is not encoded in order, which may result in duplicate ordering. The problem of the position, therefore, the user can not meet the needs of the user in actual use. [Summary of the Invention] = The main purpose of gamma is to provide a kind of reservation management method and its search method, and use logic operation to carry out object search and reservation management, effectively reducing the complexity of system differentiation. The memory space enhances the search speed. The purpose of the item is to provide the domain and the search method. The code is in the order of the object, and has a sequence. It does not cause duplicate reservations. Na method, with this ° ° 彳 and abdication ' and allows the user to manipulate the query to make a reservation. Speed search for objects and financial methods, can be fast system, in a variety of reliance, such as the transportation of the first reservation management method 'for booking, the system can be used for transportation, meal grinding, / ^ also code, Generating a first coding sequence, the object is arranged to at least _^*_seat, table, parking space or Lai; and then according to the pre-logical logic, and,,,,,,,,,,,,, a second coding sequence; reusing and determining the first: code phase and the second code ray, generating a third coding sequence; a complement of the second coding sequence, and performing the reservation when the second coding sequence is performed; a coding sequence and the fourth four-coded sequence; and _logical" and, the operation of the first-subscription of the object-like energy. 1 'generates an i-code sequence, the fifth code sequence is 200841257 When the 'reservation management method' is used to cancel the reservation, the department level is based on a plurality of objects, weights, and the first-coded phase, which can be from the traffic artifact to the object table, the parking space or the room'. According to the desire to cancel the booking Bit code 'generate|second code column; and logic, or" - 22nd = search for loose data, complex state, state, two codes, produce '#a' ^^ an i-th column binary code Generating a column, generating a first-serch, and operating the first coding sequence and the second coding sequence to complete the search and determining that the third coding sequence corresponds to the second coding sequence. The object (10) may be a Lai, a restaurant, a code, and a second code is used to perform the binary re-use logic in a state of the second interval, and, the operation of the inter-system may be - position a range and a time range '· a sequence generated by the third code sequence and the second code sequence - the third code interval includes states of the objects in the first interval and the third interval, the third embodiment 】 ^^3= Lai 论 ❹ 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更 更Figure 8 Restaurant, parking system, parking system, reservation system, 200841257 system, train reservation system or other systems. In this embodiment, a train reservation system is taken as an example. Please refer to the second figure, a preferred embodiment of the vehicle seat sequence and state diagram. As shown in the figure: Ben 2: Lu Ding's official method is to perform step S10 first, according to the number of === pre-binary codes in the car, to generate __(4) paste, wherein the binary fit
馬0)及一第一編碼⑴，該第一編碼絲示該座位12已預訂 A 係表示該座位12未預訂，因此按該座位12順序及其狀 1 一編碼 得到該第i碼序列，故該第—編碼序列係包含至少1、2二進位編碼 第二編碼，如:由第二圖可知，順序第三、五及七個座位12(h=至少一 分）已預訂，.㈣- 仅u(圖中畫斜線部 另補___ 4二、五及七個座位12之對應編竭分別為第一編碼， 以、一、四、六及八個座位之對應編碼分 、'、' 一編碼序列為11010101。 、、扁螞，所以該第 上述得到料-編碼序列後，而依據_乘客預訂該 位，進行步驟SU，依據欲預訂之該些座位12中至少-座位^卜座 編碼，產生-第二編碼序列，上述欲預訂之至少 端進行二進位 碼，其他座位12係編碼為第一編碼，如 編碼為第二編 將第一及二個座位12編碼為第二編碼，其他座位^ 時， 所以該第二編碼序列為110_。。 係編碼為第-編碼， 接著執行步驟S12,糊邏輯，，和，，⑽） t編碼相，纽-第三編碼相，如：該第-編m序列及第 第二編竭序列為__時，進行運算後 係=10101 ’該 編碼序列對應於該第二編瑪序列時，ϋ碼序列，當該第三 第三編碼序列未對應於該第二編碼序列時，即座位12;或者當該 =步Γ，由乘客重新選擇欲預訂之該車箱’ 碼序列對應於該第二編碼序列，故可預訂該=_〇〇時，該第三編 200841257 再執行步驟S14，取該第二編碼序列之補數， 如：該第二編碼相為蘭麵#， 四編碼序列， 麵細。最後執行步驟犯，利用邏輯，，和=該“編碼序列為 四編碼序列，產生一第五編碼序列，而該第五編碼；序Γ該第 箱1〇内之該些座位12之狀態，如：該第-編碼序列為11〇12後之該車 編碼序列為00111111時，進賴算後該第五編碼序列為 ’該第四 五編碼序列可知，目前該車箱10内之該些座位12狀態。 ，由該第 另於步驟S11中，若欲預訂之該些座位i 第二編碼序列係為G11 j -及二個座位12時，其 序列是否對應於該第二編碼序列，由上該第三編碼 該第二編碼序列，將不能繼續預訂座 至^二=碼序列未對應於 訂之至少-座位。 W而口至步卿卜重新選擇欲預 請參閱第三圖及第四圖，係分別為 每 訂流程示意圖及本發明之„較f x月之&“關之取消預 圖所示.上找預訂後車箱座位狀態示意圖。如 ⑽不.上返紅編碼序列為_1Gm 口 及八個座位12可預訂，若取消 p預德亥車相W内弟四、六 卿，依據該車箱1G内個座位12時，係先執行步驟 碼序列，該第-編碼序列係為^^'了進位j編碼’產生一第一編 12狀態，進行_21，依據欲取=1相，即_獻該些座位 行二進位編碼，產生―第二^=預§1麵座位12中至少-座位12進 料，料二編碼序列為：:列’如:若欲取消預訂第 產生，邏贼縣鄕—編碼序般第4碼序列， 為取消前編碼序列係為⑽醜，該第三編碼序列係 編碼示意本㈣之—崎施例之火車車班 具也例之搜尋車班流程示意圖。如圖所示： 200841257 :用上妨法_座赠，縣客未酬岭私及車辦 ^明搜尋方法先以欲停靠車站搜尋車班，先執行步驟娜，依據:車， 罪之車站物二進位編碼，產生—第_編碼序列，如··每—車: =站係包含台北、新竹、台中、台南及高雄，若該第—車班u =之 新竹及尚雄等車站，所以該第一車班14有 、’、罪口北、 T『之車站係編碼為第一編碼，所以該第一編碼序二二第二碼: =第-編碼序舰進人步驟S31’依據欲搜尋之該些停靠車站二 罪車站進行二進位編碼，產生—第二編辦列 乂一停 新竹及高雄，所以該第二編碼序列為G_。 ’尺叟哥之停靠車站為 列為麵時，經邏輯，，和，，==序弱職，該第二編碼序 進行步驟撕判斷該第三編編碼序列為，再 三編碼序列為_丨，該第二編碼序列為_^弟=碼序列，如：該第 運:’;生對應之第三編，，並判斷==:::= 二編碼序列，即可知該車班是否有停靠要尋找的該轉站疋否對應於該第 请參閱第七圖及第八圖，係分別為本發明之 流程示意圖及本發明之-較佳實施例之車班車箱狀能一土 2例之搜尋車箱 當乘客確定欲搭乘之車班16後 °如圖所示： 空座位，係先執行轉施，依^轉班16之複數鱗㈣是否有 位編碼，產生-第-編碼序列如轉 =16之該些車箱18之狀態進行二進 三、五及七個車箱㈣不含^座：t16具有八個車箱18，該第—、 ^為。i_m ’進行步‘依;===:碼 10 200841257 疋否有空雜，所職紅編碼相 ΓΓ和’’運算該第—編碼序列及第三編^產ΤΓS42 ’ h如·该第-編碼序列為01010m，該產生第二編碼序 第三編碼序列為_0 -…、、序列為Gl__時，該 應於第二編碼序列，如該第^^=43，判斷該第三編碼序列是否對 oloioooo ^, 複數個座位’ _些雜係依照綱 請參閱第九圖及第十圖，係分別為本發明 箱Γ供預訂錄讀麵意本發.另-触實之搜尋車 =2。之-車箱_個座位：=::= 碼序列，如：於台北至新竹之車班20之該車， 生第-編 座位係為可供預訂之座位，所以該第_編辦列係為=_二，七個 步驟S5卜依據於新竹至台中之車班22之該車料 接者進行 進位編碼，產生-第二編碼序列，如 之狀態進行二 該第一、二、五及七個座位係為可預訂，所以該之該車箱内， 第二、為碼序列，如：該第一編碼序列 -屋 ^ 110〇1〇1〇 a,, n〇〇〇〇；； ? Γ表示於台㈣㈣細愉版⑽ 針―圖’絲本個之另—錄實補之搜尋键流程示音 =。如圖所‘上-實施例係以火柄位為例，本實施例係以 = =、大安區、中山區、中正區、文山區、内湖區、北投區、松山：、 域區、南港區及萬華區等十二區，該連鎖餐廳係於士林區、大安區、中 200841257 正區、内湖區、信義區設有分店，因此以本發明搜 立之狀態進行—產=驟： 序列邊第、扁碼序列係為loioioiooioo,進入步驟如卓一編碼 些分店中至少一分店進行二進 61，依據欲搜尋該 該大同區及中山區是否有產生一弟二編碼序列，如：欲搜尋 _圓誦，魄進竹_，_賴，，和^序列為 第二編碼序列，產生一筮- 丈井碌弟一編碼序列及 乐二編碼序列，當兮笛 10101_誦，該k編物_丨__ 列係為 所產生之該第三編碼序列係為〇〇〇〇〇()〇〇〇〇〇〇，最後進和運算後 弟二編碼序列是否對應於該第二編碼 ς 63 ’判斷該 ’崎第二編辦顺_i__G日^ ^三^馬序列為 t與該第二編碼序列對應，故須重新回至步驟s61，重新序列係 述方法可同時搜尋其他連鎖餐廳。 菫新叹疋途仃搜尋，上 請參閱第十二圖及第+-同 r流程.及二 圖所示··當利用上述搜尋方㈣ 食嚴桌位狀恶不意圖。如 %，貝咖本發明之麵行預訂桌位 ，個桌位26之狀態進行：進位編 該=24内複 總共為八桌，該第一、二、生弟、扁碼序列，如該餐廳24 為咖_，進入編位26為可供預訂，該第一編碼序列係 行-、隹#祕 依據奴預訂該些桌位26中至少一卓仿9β ★ 仃-進位編碼，產生—第二編碼序 t位26進 二編碼序觸為11()_ 人ΰ —及二個桌位26，該第 一編碼序列及第二編碼序列接声者生執—f驟利用邏輯，，和，，運算該第 !出_，該第二編碼序列為^ ^柄序列，如該第一編竭序列為 再執行步驟S73，判斷該第三柄序列是否^二=碼=^為1__， 編竭序列為11000_，該第 L、弟-、.為碼序列，如該第三 對應於該第-觀库,,P 列為測0000時，該第三編碼序列伟 柄相，即漸，⑽糊，剛：編= 12 200841257 οοπππ，^ 五編碼序列，所以當該第一編碼序列係為j及弟四編碼序列，產生-第 消預====:=_—_施例之取 如圖所示：當欲取消預訂時，係先執了 =桌位狀態示意圖。 -.rr；^ 第五編碼序列，所以該第—編碼序=4弟—編瑪序列係為上述 依據欲取消預訂該些桌位26中至少_桌位聊卜接著進行步驟S81， 二編碼序列，如欲取消預訂之第—及二、個進碼’產生-第 110000(H)，再進行步驟S82，利用邏輯，，或f 編碼序列係為 碼序列’產生—第三編碼序列’如該第—編碼序:_ 及::編 餐 廳28之該歧卓4編碼序列’如：於下午五點半至下午七點半之餐 以該第-編碼序ΐ及七個桌位係為可供預訂之桌位，所 m下午找半至τ午九點半之餐鑛之該《位t，（i： ’所_第二編碼序列仙刪⑽，再進^步 =，_輯，，和，，運算該第—編碼序列及第二 二丁: 柄序列，如：該第-編碼序列為__，該第二編 麵 13 200841257 時進仃運算後該第三編碼序列係為11〇〇〇⑽，該第三編碼序 下午五點半至下午九點半之餐廳之第一、二及七個桌位可供預訂。，、不於 2上财知’ _本發明之預訂f财敍其鮮方法因利 -位編碼及邏輯運算，可快速搜尋欲搜尋之物件:早 及触，㈣嫩爾崎尋、訂位 、、’T上所述’本發日⑽貫為—具有新穎性、進， 絲^ 祈鈞局早曰賜准專利，至感為禱。 明實==述ί ’僅為本發明之—較佳實施例而已，並非用來限定本發 y施之補，舉凡依本發明中請專利範圍所述之形狀、構造、特 所為之均等變化與修飾，均應包括於本發明之中請專利細内。、" 【圖式簡單說明】 第2圖 第3圖 第4圖 第5圖 第6圖 第7圖 第8圖 第1圖·本發明之—較佳實施例之預訂流程示意圖； ;圖 本發明之-較佳實施例之車箱座位順序及狀態示意I 本發明之-擁實施狀取消前流程示意圖； 本發明之一較佳實施例之預訂後車箱座位狀態示意圖 本發明之-難實關之火車車班編碼示意圖 本發明之-較佳實施例之搜尋車班流程示意圖 本發明之-較佳實施狀搜尋車錢程示意圖 本_之-較佳實_之車班車難態示意圖； 第搜尋賴可供預訂座位之流程示意圖 锿較佺貝加例之車箱座位編碼示意圖； $圖··本伽之另_触實_讀轉麟程示意圖； 圖·本發明之另-触實關之搜尋桌赠程示意圖；。 14 200841257 弟1 3圖··本發明之另一 弟1 4圖··本發明之另一 第1 5圖··本發明之另一 弟16圖：本發明之另一 圖；及 較佳實施例之餐廳桌位狀態示意圖； 較佳實施例之取消預訂流程示意圖； 較佳實施例預訂後之桌位狀態示意圖； 較佳實施例之搜尋餐射侧訂桌狀流程示意 第1 7圖：本發明之另—較佳實施例之餐廳桌位編·意圖。 【主要元件符號說明】 10車箱 12座位 14第一車班 16車班 18車箱 20台北至新竹之車班 22新竹至台中之車班 24餐廳 26桌位 28下午五點半至下午七點半之餐廳 30下午七點半至下午九點半之餐廳 15The horse 0) and a first code (1), the first coded wire indicates that the seat 12 has been reserved. The system A indicates that the seat 12 is not reserved, so the order of the seat 12 and its shape are encoded to obtain the i-th code sequence. The first coding sequence includes at least 1, 2 binary coding second coding, as shown by the second figure, the third, fifth and seventh seats 12 (h = at least one minute) are reserved, (4) - only u (the picture is drawn with the slash part of the ___ 4 2, 5 and the seven seats 12 corresponding to the first code, the corresponding code of the first, fourth, sixth and eight seats, ', ' The coding sequence is 11010101., squash, so after the above-mentioned material-encoding sequence is obtained, and according to the passenger reservation, the step SU is performed according to at least the seat-seat code of the seats 12 to be reserved. Generating a second code sequence, wherein at least one of the above-mentioned reservations is subjected to a binary code, and the other seats 12 are coded as a first code, and if the code is a second code, the first and second seats 12 are coded as a second code, and other seats are ^, so the second coding sequence is 110_. The code is the first code, Then, step S12 is executed to paste the logic, and the (10)) t coding phase, the neo-third coding phase, for example, when the first-composition m sequence and the second compilation sequence are __, the operation is performed = 10101 'The code sequence corresponds to the second coded sequence, the weight sequence, when the third third code sequence does not correspond to the second code sequence, ie the seat 12; or when the = step, by the passenger Reselecting the box to be reserved, the code sequence corresponds to the second code sequence, so when the =_〇〇 can be reserved, the third block 200841257 performs step S14 to take the complement of the second code sequence, such as : The second coded phase is blue face #, four code sequence, and the face is thin. Finally, the step is executed, using logic, and = the "code sequence is a four-code sequence, generating a fifth code sequence, and the fifth code; pre-ordering the state of the seats 12 in the first box, such as : When the first coding sequence is 11〇12, the vehicle coding sequence is 00111111, and after the calculation, the fifth coding sequence is 'the fourth fifth coding sequence, the seats 12 in the car 10 are currently known. In the step S11, if the second coding sequence of the seats i to be reserved is G11 j - and two seats 12, whether the sequence corresponds to the second coding sequence, The third code encodes the second code sequence, and the reservation code cannot be continued until the second code sequence does not correspond to at least the seat of the order. W. For each of the customized flow diagrams and the present invention, the comparison of the pre-plans of the "fx month &" off the map shows the state of the seat after the reservation. For example, (10) No. The red code sequence is _1Gm. And eight seats 12 can be booked, if canceled p pre-Dehai car phase W inside the four , Liu Qing, according to the seat 1G inside the car 12, the first step code sequence is executed, the first code sequence is ^^ 'carry j code 'generate a first 12 state, _21, according to If you want to take the =1 phase, that is, _ offer the seat line binary code, and generate the second y = 1 § 1 seat 12 at least - seat 12 feed, the second coding sequence is:: column 'such as: Cancellation of the first generation, the thief county 鄕 - code sequence like the fourth code sequence, to cancel the pre-coding sequence is (10) ugly, the third coding sequence is coded to illustrate the (4) - the example of the train car class Schematic diagram of the search car class. As shown in the figure: 200841257: Use the method of _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ : Car, sin station station binary code, generate - _ code sequence, such as · · every car: = station system including Taipei, Hsinchu, Taichung, Tainan and Kaohsiung, if the first - car class u = the Hsinchu and Shangxiong and other stations, so the first class 14 has, ', Shoukou North, T' station code is the first code, Therefore, the first code sequence 22nd second code: = the first coded ship entering the step S31' according to the two stations of the stop station to be searched for the binary code, the second program is arranged to stop the Hsinchu And Kaohsiung, so the second coding sequence is G_. 'When the station is stationed as a face, the logic,, and, == order weak position, the second code sequence is stepped to determine the third The coded sequence is, the third code sequence is _丨, and the second code sequence is _^弟=code sequence, such as: the first transport: '; the third corresponding to the student, and judge ==:::= The code sequence, that is, whether the train station has a stop to find the transfer station, whether it corresponds to the seventh or the eighth figure, which is a schematic flow chart of the present invention and the preferred embodiment of the present invention. The car shuttle box can be used for a case of 2 cases. When the passengers are sure that they want to take the class 16 as shown in the figure: Empty seats, the first implementation of the transfer, according to the transfer of 16 multiple scales (four) whether there is Bit coding, generating - the first coding sequence, such as the turn = 16 of the state of the car box 18 for two, three, five and seven (Iv) ^ wagons free base: t16 has eight carriages 18, the first -, ^ is. I_m 'Steps';;==: Code 10 200841257 疋No empty, the job is red coded and ''operating the first code sequence and the third series ΤΓS42' h such as the first code The sequence is 01010m, and the second coding sequence is _0-..., and the sequence is Gl__, which should be in the second coding sequence, and if the ^^=43, it is determined whether the third coding sequence is For oloioooo ^, a plurality of seats ' _ some miscellaneous lines according to the outline, please refer to the ninth and tenth drawings, respectively, for the case of the invention for the book to record the face of the hair. Another - touch the search car = 2. - Cars _ seats: =::= Code sequence, such as: the car from Taipei to Hsinchu, 20 cars, the seat-seat seat is reserved for seats, so the first _ series For == 2, the seven steps S5 are based on the carry-in coding of the vehicle picker of the car class 22 of Hsinchu to Taichung, generating a second code sequence, such as the state of the first, second, fifth and seventh. The seats are bookable, so in the car, the second is a code sequence, such as: the first code sequence - house ^ 110〇1〇1〇a,, n〇〇〇〇;; ? It is expressed in Taiwan (4) (4) Fine Discovery Edition (10) Needle - Picture 'Siben's Another - Recording Completion Search Key Process Sound =. As shown in the above example, the fire handle position is taken as an example. This example is based on ==, Da'an District, Zhongshan District, Zhongzheng District, Wenshan District, Neihu District, Beitou District, Songshan District, and the South District. In the 12 districts such as the district and Wanhua District, the chain restaurant has branches in Shilin District, Da'an District, Zhonghua 200841257 Zhengzhou District, Neihu District and Xinyi District. Therefore, the status of the invention is determined. The sequence side and the flat code sequence are loioioiooioo, and the entry step is at least one of the branches of the Zhuoyi code to perform two-input 61. According to whether the Datong District and the Zhongshan District are to be searched, whether a second code sequence is generated, such as: Search _ circle 诵, 魄 into bamboo _, _ 赖,, and ^ sequence for the second coding sequence, produce a 筮 - 丈井碌弟一编码 sequence and Le two coding sequence, when 兮笛10101_诵, the k-edit The _丨__ column is generated as the third coding sequence is 〇〇〇〇〇()〇〇〇〇〇〇, and the second coding sequence after the last sum operation corresponds to the second coding ς 63 ' Judging the 'saki second edit 顺 _i__G day ^ ^ three ^ horse sequence is t and the second code sequence The column corresponds, so it is necessary to return to step s61, and the re-sequence description method can simultaneously search for other chain restaurants.菫 疋 疋 仃 仃 仃 仃 , , , 仃 请 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第 第Such as %, Bika, the invention of the face of the reservation table, the status of a table 26: carry the code = 24 internal complex for a total of eight tables, the first, second, younger brother, flat code sequence, such as the restaurant 24 for the coffee _, enter the position 26 for the reservation, the first coding sequence is -, 隹 #秘 according to the slave reservations at least one of the table 26 26 * ★ 仃 - carry code, generate - second The coding sequence t bit 26 into the second code sequence touch is 11 () _ human ΰ - and two tables 26, the first code sequence and the second code sequence sitter take care - f use logic,, and,, The second encoding sequence is a sequence of ^ handles. If the first editing sequence is step S73, it is determined whether the third handle sequence is ^2=code=^ is 1__, and the sequence is compiled. Is 11000_, the Lth, the brother-, is a code sequence, if the third corresponds to the first-view library, and the P column is measured 0000, the third coding sequence is a stalk phase, that is, gradually, (10) paste,刚:编= 12 200841257 οοπππ,^ Five code sequences, so when the first code sequence is j and the fourth code sequence, the generation - the first elimination ====:=___ The picture shows: When you want to cancel the reservation, the system is first executed. -. rr; ^ the fifth coding sequence, so the first coding sequence = 4 brother - coding sequence is based on the above-mentioned basis to cancel the booking of at least the table 26, then proceed to step S81, the second coding sequence If the first and second codes of the reservation are to be canceled, the first step is to perform the step 1 of the code sequence, and the code sequence is 'coded' to generate the third code sequence. The first code sequence: _ and :: edit the restaurant's 28 code sequence of 'Zhuo 4', such as: from 5:30 pm to 7:30 pm, the meal is coded and the seven tables are available. Book the table, the afternoon of the afternoon to find the half of the meal at the 9:30 midnight, the bit t, (i: 'the second code sequence is deleted (10), then ^ step =, _ series,, and , the operation of the first coding sequence and the second binary: stalk sequence, such as: the first coding sequence is __, and the second coding sequence is 200811257, and the third coding sequence is 11〇〇 〇 (10), the third coded order from 5:30 pm to 9:30 pm, the first, second and seventh tables of the restaurant are available for booking. _ The book of the present invention is a method for searching for the object to be searched for: the early and the touch, (4) Nen Erqi, the reservation, the 'T on the above' The day (10) is as follows - with novelty, advance, and silk, the praying bureau has given the patent as soon as possible, and it is praying for the feeling. It is only the preferred embodiment of the present invention, and is not intended to be limited. The shape, structure, and equivalent variations and modifications described in the scope of the patent application of the present invention are all included in the patent specification. " Description of the Invention - Figure 2 - Figure 4 - Figure 5 - Figure 1 - a preferred embodiment of the preferred embodiment Schematic diagram of the seat position and state of the vehicle compartment I. Schematic diagram of the flow chart before the cancellation of the embodiment of the present invention; schematic diagram of the seat state of the passenger compartment after the reservation of the preferred embodiment of the present invention A schematic diagram of the search vehicle process of the preferred embodiment of the present invention - preferably Schematic diagram of the car search engine chart _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ Another 15th figure of the present invention is another figure of the present invention: another figure of the present invention; and a schematic diagram of the state of the restaurant table of the preferred embodiment; a schematic diagram of the cancellation process of the preferred embodiment; A schematic diagram of the state of the table after the reservation is made; the flow chart of the search for the meal side of the preferred embodiment is shown in Fig. 17. Fig. 7 is a plan view of the restaurant table according to another preferred embodiment of the present invention. [Main component symbol description] 10 car box 12 seats 14 first car class 16 car class 18 car box 20 Taipei to Hsinchu car class 22 Hsinchu to Taichung car class 24 restaurant 26 table 28 pm 5:30 pm to 7 pm Half restaurant 30:30 pm to 9:30 pm restaurant 15