APL(Dyalog Unicode), ^{118 114 90 88} 83 bytes ^SBCS

{⊃,/⍪⌿⍵{(' ',⍺)[⍵]}¨1+(⍺ ⍺∘⍴¨o(⌽o←∘.=⍨⍳⍺)i(⌽⍺/⍺↑1)(⍉⍺ ⍺⍴i←(⌈⍺÷2)=⍳⍺)0)['\/|_- '⍳⍵]}

Try it on APLgolf!

A dfn submission which takes a char matrix on the right and a scale factor on the left.

Indexes each character into its specific pattern, and then uses the original matrix to index back into it.

More byte saves can be done by figuring out a formula for getting the boolean arrays.

APL(Dyalog Unicode), ^{118 114 90 88 83} 80 bytes ^SBCS

{⊃,/⍪⌿⍵{' '⍺[⍵]}¨1+(⍺ ⍺∘⍴¨o(⌽o←∘.=⍨⍳⍺)i(⌽⍺/⍺↑1)(⍉⍺ ⍺⍴i←(⌈⍺÷2)=⍳⍺)0)['\/|_- '⍳⍵]}

Try it on APLgolf!

A dfn submission which takes a char matrix on the right and a scale factor on the left.

Indexes each character into its specific pattern, and then uses the original matrix to index back into it.

More byte saves can be done by figuring out a formula for getting the boolean arrays.

APL(Dyalog Unicode), 110 bytes ^SBCS

{⊃,/⍪⌿⍺∘{(' ',⍵)[1+⍺ ⍺⍴⍺{⍵='\':∘.=⍨⍳⍺⋄⍵='/':⌽∘.=⍨⍳⍺⋄'|'=⍵:(⌈⍺÷2)=⍳⍺⋄'_'=⍵:⌽⍺/⍺↑1⋄'-'=⍵:⍉⍺ ⍺⍴(⌈⍺÷2)=⍳⍺⋄0}⍵]}¨⍵}

Try it on APLgolf!

A dfn submission which takes a character matrix on the right and the scale on the left.

Just runs a huge conditional for each character in the matrix. A possible way to improve this would be to figure out a formula to generate the binary arrays required for each character.

APL(Dyalog Unicode), ^{118 114 90 88} 83 bytes ^SBCS

{⊃,/⍪⌿⍵{(' ',⍺)[⍵]}¨1+(⍺ ⍺∘⍴¨o(⌽o←∘.=⍨⍳⍺)i(⌽⍺/⍺↑1)(⍉⍺ ⍺⍴i←(⌈⍺÷2)=⍳⍺)0)['\/|_- '⍳⍵]}

Try it on APLgolf!

A dfn submission which takes a char matrix on the right and a scale factor on the left.

Indexes each character into its specific pattern, and then uses the original matrix to index back into it.

More byte saves can be done by figuring out a formula for getting the boolean arrays.

APL(Dyalog Unicode), 118 bytes ^SBCS

{⊃,/⍪⌿⍺∘{(' ',⍵)[1+⍺{⍵='\':∘.=⍨⍳⍺⋄⍵='/':⌽∘.=⍨⍳⍺⋄'|'=⍵:⍺ ⍺⍴(⌈⍺÷2)=⍳⍺⋄'_'=⍵:⊖1@1⊢⍺ ⍺⍴0⋄'-'=⍵:⍉⍺ ⍺⍴(⌈⍺÷2)=⍳⍺⋄⍺ ⍺⍴0}⍵]}¨⍵}

Try it on APLgolf!

A dfn submission which takes a character matrix on the right and the scale on the left.

Just runs a huge conditional for each character in the matrix. A possible way to improve this would be to figure out a formula to generate the binary arrays required for each character.

APL(Dyalog Unicode), 110 bytes ^SBCS

{⊃,/⍪⌿⍺∘{(' ',⍵)[1+⍺ ⍺⍴⍺{⍵='\':∘.=⍨⍳⍺⋄⍵='/':⌽∘.=⍨⍳⍺⋄'|'=⍵:(⌈⍺÷2)=⍳⍺⋄'_'=⍵:⌽⍺/⍺↑1⋄'-'=⍵:⍉⍺ ⍺⍴(⌈⍺÷2)=⍳⍺⋄0}⍵]}¨⍵}

Try it on APLgolf!

A dfn submission which takes a character matrix on the right and the scale on the left.

Just runs a huge conditional for each character in the matrix. A possible way to improve this would be to figure out a formula to generate the binary arrays required for each character.