Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6541239
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 25, 20262026-05-25T11:04:50+00:00 2026-05-25T11:04:50+00:00

I am looking for a robust way in Java to test if a text

  • 0

I am looking for a robust way in Java to test if a text fragment is quoted-printable encoded. The most straightforward way would be to test whether a string contains char sequences which match the following regular expression: (=[A–F0-9][A–F0-9])|(=[\r][\n]) (encoded characters + = and soft break for a newline).

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-25T11:04:50+00:00Added an answer on May 25, 2026 at 11:04 am

    I would negate the test; text which contains = followed by anything other than newline or two hex digits is not QP; but this is still a weak heuristic – somebody could put =3D in unencoded text just for the heck of it (and I just did). Bottom line: if you don’t know the encoding, you don’t know the encoding.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I am looking for a robust Map in Java, where the key lookup would
I am looking for a robust way to copy files over a Windows network
I am looking for a robust Javascript parser written in Java - by which
I'm looking for what the standard, approved, and robust way of stripping invalid characters
I'm looking for a robust way to list the available serial (COM) ports on
My application is a commercial GIS C++ application, and I'm looking for a robust/easy
I'm looking for a performant, reasonably robust RNG using no special hardware. It can
I currently have a fairly robust server-side validation system in place, but I'm looking
Related questions: How to replace characters in a java String? How to replace special
I'm looking for a way to script a transparent forward proxy such as the

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.