JPS6024683A - Label printer PLU setting method - Google Patents

Abstract

PURPOSE:To use effectively a memory area as a whole even if the number of contained bytes is different from each other, by storing successively a fixed length item from one part of a memory, and also storing successively a variable length item. CONSTITUTION:As shown in an RAM MAP, ''an area required for a program'' required for various operations of a label printer is set in the label printer, and also other area than said area becomes a PLU memory. Each PLU is classified into a fixed length item consisting of a PLU code, a commodity code, a unit price, a character number, an address, etc., and a variable length item consisting of an item of a name of commodity, etc. This fixed length item is stored successively without a gap from the high order of the PLU memory, and the variable length item is stored successivey without a gap from the low order. In this way, the whole memory area can be used without having a blank part, and a lot of PLUs can be set by using a memory of a momory of a limited area.

Description

DETAILED DESCRIPTION OF THE INVENTION Technical Field of the Invention The present invention corresponds to a commercial product! 1? , value, etc. are set, and the label printer is called up at the time of label printing to perform the paper processing.

Technical Background and Problems Conventionally, there have been many I)LJ(!l-U/Guru printers, ;), and the method for setting the LU is as shown in the 111th Law-1-1. That is, l) L U memo I - </ + area ■, ■, ■.
It is divided into fixed-length bits as shown in . The number of characters in product names varies, and in order to be able to store long product names, the number of bytes in the product name field must be increased. Therefore, a blank space usually exists for each PLU, and the memory area cannot be used effectively.

It is also conceivable to set PLUs having different numbers of bytes sequentially from the top of the memory area. According to this method, no blank space is generated in the memory area, but when changing the variable length bytes of the product name, it is necessary to shift all bytes including the fixed length bytes. Furthermore, when extracting one LU), there is a drawback that the program becomes complicated because the number of pins in each anus is different.

[1] The present invention is capable of effectively using the entire memory area even when contents such as product names have different numbers of bytes, and is also capable of handling PLU call processing. 6. Outline of the Invention The present invention aims to provide a simple 1-) l, TJ setting method for label printers. Therefore, one side of the memory stores the fixed length song 1 (existing sequentially), and the other side stores the variable length song [1 nin 1ij'l
If ζ is stored, this allows the product name 'Mi9's i' + J 7 (7? Even if there is an element, it is possible to use the memory area with no blank space fQ, but -)'C,
Many P 1. It is possible to set II, and it is also possible to store it sequentially with a fixed I (around 1st; 1 fixed pi 1 ~,
Therefore, it has been constructed as 4Iζ so that changes, calls, settlements, etc. of 1.1.11 can be easily performed.

Embodiment of the Invention First, in a label printer, 1 △M M in FIG.
As shown in AP, the ``area necessary for the program'' required for the operation of the label printer 8f and n is defined as 7); Each P I, U is classified into a fixed length item consisting of one item such as PLU code, product code, unit price, number of characters, address, etc. and a variable length item consisting of items such as product name. The "fixed length song I" is stored in the PLU memory sequentially from the top to the bottom as shown in FIG.

Based on FIGS. 5 and 6, the state of change in the pt;u memory when the PLU -- is erased will be explained. First, what is shown in Figure 5 is the second part of the fixed length item.
This shows the state in which the th PLU has been erased, and the third and subsequent PLUs are moved up.

The number of characters here is the number of characters in the product name, XXXX.

xxookasa is the product name address. As a result of erasing the fixed Nagauta 171 in this way, the second song (as shown in Figure 5)
The product name with the 8th 7 characters will also be erased, but after this is erased, the product name number 3 and 11 onwards will be crystallized and stored.
Sign.

Next, the case of changing the product name will be explained based on FIG. 7. First, what is shown in FIG. 7(a) is a state in which six types of product names are stored.

Therefore, the 6th 4 characters rccccJ are changed to 8 characters r
K K K K K K ] < KKJ In this case, the number of characters after the change (8) and the sentence before the change;,, >T, li.

(4) and the final address of the product name (I:
N I)Δ1. ) is expressed as R) by 71 characters]. This shift 1 - Sutra in the middle of shift
υ is shown in Figure 7(b). And no change
\Product name address (expressed as 1-111\IΔDR)
711(c).
There will be 4 empty characters above INADR. Then, as shown in FIG. 7(d), this ? : The white part and the 8 characters of the product name before the change are changed. K K K
Changed to KK K K K J, 11. Ru.

Then, No. 8 l”/l:r and No. 11 in Fig. 9,
Next, the above-mentioned memory processing will be explained in J'-order. First of all, star 1 to I゛1 of the product name to be changed later. Enter and change the password II) L,
Call 7-:: issues the address of tJ. Then, set the address of the product name memory to be changed in the memory area of "Variable-length song 1"(IIIIN/\1.)R);r, and manually input the product name to be changed. If it is N, then the letter 'jl) N is written manually. Then, N=
If not, the number M of characters before the change is compared with the number N of characters after the change.

Here, if the number of characters after the change N is larger, the final address of the product name is set to 14:N DΔIJR, the increased number of characters S (NM) is taken, and the contents of E N D A D R are shifted S bytes upwards. (state shown in FIG. 7(b)).

Then, repeat this one by one for ■bye 1, E N D
When AI)R matches l~IINAD R, the state becomes fp as shown in FIG. 7(C), and the process moves toward the α point.

Also, if N=O is not the case and the characters plM before the change are larger than the number of characters N after the change, i-I I NA
, D Add the number of characters before change M to R, and calculate the reduced number of characters S
(M-N) is set. The same applies to the case of N-0, in which case the number of characters M before change is S, It J NA 1 R, + M is T': N 1 A
, set as OR.

And even if there is no A, E M D A ID I
The contents of the spoon are S by 1 - Sif 1 - S, E N l)
△DR matches the final address of product name memory]:
Processes each high and 1-. Head towards point α.

Next, from point α in FIG. 9, manually set the product number as N byte 'I-11' N A IT) R to 17. ).

After that, the next P L L J ΔD i;! Product name A1-
Reply '41j updated, then P L, LJ A +'
,) I;! Add the number
Change the product name address of ADR. In this way, 13 I, l with the variable length song "1do fixed length song 1"
A change in j is made.

01? What is not shown in l is fixed length song II
Of each item, all l”L 1.1 or J”JI,
This shows a procedure for calling the Y-constant term Ll. now,
Item 1 that should not be called should be the ``product code.'' -1] First? I\1'' product code T, U product code at 1 nos/\1 DRI, its Δ1 DRI
Output J-;:, ,.

Then, add 11 +,,, IJ to this ADD RI.
Enter the fixed number [Lee's Buy 1 - Product Row 1 with the number added - Address Ha 1) and output the contents, and convert this to M
1. IJ force final address C repeat 1. As a result, Zube1. - (It is possible to call hPLU product codes all at once. This is l) l,
The same is true for other items such as IJ Ko F and KAI Gyokuyuki.

Effect of the invention The present invention, as described above, includes: I) LtJ code, unit price.

Product Two 1-2 A large number of PLUs consisting of product names, etc.
is stored in memory, the contents of this PLU are classified into fixed-length items of a certain number of bytes, such as PLTJ number-5, unit price, and product code, and variable-length items, such as product name, and Fixed-length items are stored sequentially from one side of the memory, and variable-length items are stored sequentially from the other side of the memory, so the entire memory area can be used without any blank spaces. Even in memory, a larger number of PLUs can be set, and fixed-length items are the same high 1-number for all PLIJs, so I) LU changes, calls, settlements, etc. are easy; A simple brocrum is also fine.

[Brief explanation of drawings]

Fig. 1 is a ram map showing an example of the conventional technique, Fig. 2 is a ram map showing an embodiment of the present invention, Fig. 3 is a ram map for fixed length items, and Fig. 4 is a ram map for variable length songs I:l L/J ram map. Figure 5 is a map of fixed length song 11 when deleting one pJ-1-J 'n, Figure 6 is a lamb map showing changes in variable length items corresponding to Figure 5, 21') Figure 7 (
a)(b)(c)(d) are lamb maps showing changes in product name changes; Figures 8 to 101'; 41 is a flowchart! − is. Applicant Tokyo Electric Co., Ltd. Wang Z Mao 7th floor

Claims (1)

[Scope of Claims] 1. In a device in which a large number of P'LUs having PLU codes, unit prices, UJ product codes, product names, etc. are stored in a memory, the contents of these PLUs are stored as PLU numbers, unit prices, product names, etc.
It is classified into fixed-length items of a certain number of bytes, such as product codes, and variable-length items, such as product names. A PLU setting method for a label printer, characterized in that PLU settings are sequentially stored. 2. The memory area in which variable-length items have been set is shifted by 1- in response to changes in the number of characters to avoid blank spaces. 4. Claim No. 1 that constitutes blasphemy
PLU setting method for label printer described in section. 3. If a large number of I)LUs having PL, U codes, unit prices, product codes, product names, etc. are stored in memory, the contents of these I-)LUs can be stored as 1.
11. L: Fixed bytes such as number, unit price, product code, etc.
ζ((fixed-length item and variable-length item such as product name)
: L, said fixed length from one side of said memo 1 no" ■ [1
Next 4. ') at the same time as storing the fixed length II sequentially from the other side of the memory, 1
)if illL! Fixed JE: term l l (/,) l
°+, U number, unit price, product code, etc. II.
t' indicates that each item of 11 degrees has been created with a predetermined number of bits and stored in a predetermined order.
7. -p:+Bell printer I) (,'[J setting method.